- * Topological walker. Allocates block info for every block and place nodes in topological
- * order into the nodes set.
+ * Topological walker. Allocates block info for every block and place nodes in
+ * topological order into the nodes set.
info = get_block_info(block);
ir_valueset_insert(info->exp_gen, value, irn);
info = get_block_info(block);
ir_valueset_insert(info->exp_gen, value, irn);
value_union(info->avail_out, info->exp_gen);
dump_value_set(info->avail_out, "Avail_out", block);
value_union(info->avail_out, info->exp_gen);
dump_value_set(info->avail_out, "Avail_out", block);
block_info *succ_info;
block_info *info = get_block_info(block);
ir_node *succ, *value, *expr;
block_info *succ_info;
block_info *info = get_block_info(block);
ir_node *succ, *value, *expr;
ir_node *value, *expr, *idom, *first_s, *worklist;
block_info *curr_info, *idom_info;
int pos, arity = get_irn_arity(block);
ir_node *value, *expr, *idom, *first_s, *worklist;
block_info *curr_info, *idom_info;
int pos, arity = get_irn_arity(block);
if (expr != NULL && expr != irn) {
elim_pair *p = OALLOC(env->obst, elim_pair);
if (expr != NULL && expr != irn) {
elim_pair *p = OALLOC(env->obst, elim_pair);