{
nodes_iter_t *it = (nodes_iter_t*)data;
struct list_head *head = get_block_border_head(it->env, bl);
- border_t *b;
foreach_border_head(head, b) {
if (b->is_def && b->is_real) {
struct list_head *head = get_block_border_head(it->env, block);
be_lv_t *lv = be_get_irg_liveness(it->env->irg);
- border_t *b;
int has_started = 0;
if (!be_is_live_in(lv, block, it->irn) && block != get_nodes_block(it->irn))
const ir_node *irn)
{
find_neighbours(ifg, iter, irn);
- return ir_nodeset_iterator_next(&iter->iter);
+ return get_next_neighbour(iter);
}
ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter)
/* before shrinking the set, return the current maximal clique */
if (output_on_shrink) {
int count = 0;
- ir_node *irn;
/* fill the output buffer */
- for (irn = (ir_node*)pset_first(it->living); irn != NULL;
- irn = (ir_node*)pset_next(it->living)) {
+ foreach_pset(it->living, ir_node, irn) {
it->buf[count++] = irn;
}
if (bitset_is_set(seen, get_irn_idx(m)))
continue;
- if (arch_get_irn_register_req(m)->type & arch_register_req_type_ignore)
+ arch_register_req_t const *const req = arch_get_irn_register_req(m);
+ if (arch_register_req_is(req, ignore))
continue;
bitset_set(seen, get_irn_idx(m));
if (bitset_is_set(seen, get_irn_idx(n)))
continue;
- if (arch_get_irn_register_req(n)->type & arch_register_req_type_ignore)
+ arch_register_req_t const *const req = arch_get_irn_register_req(n);
+ if (arch_register_req_is(req, ignore))
continue;
++n_comp;