size_red_t *new_size_red(copy_opt_t *co) {
- size_red_t *res = xmalloc(sizeof(*res));
+ size_red_t *res = XMALLOC(size_red_t);
res->co = co;
res->all_removed = pset_new_ptr_default();
while (redo) {
redo = 0;
be_ifg_foreach_node(ifg, iter, irn) {
- const arch_register_req_t *req;
-
- req = arch_get_register_req(sr->co->aenv, irn, -1);
+ const arch_register_req_t *req = arch_get_register_req(irn, -1);
if (!arch_register_req_is(req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) {
if (sr_is_simplicial(sr, irn)) {
be_ifg_foreach_neighbour(ifg, iter, irn, other) {
if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */
- bitset_set(used_cols, get_irn_col(sr->co, other));
+ bitset_set(used_cols, get_irn_col(other));
}
/* now all bits not set are possible colors */
#include <stdio.h>
ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
- ilp_env_t *res = xmalloc(sizeof(*res));
- assert(res);
+ ilp_env_t *res = XMALLOC(ilp_env_t);
res->co = co;
res->build = build;