dims->min_step = 1;
-#if 1
dims->box.w = (dims->max_color + 2) * opts->h_inter_gap;
dims->box.h = dims->max_step * opts->v_inter_gap;
-#else /* ! if 1 */
- dims->box.w = dims->box.h = 10;
-#endif /* if 1 */
pmap_insert(env->block_dims, block, dims);
}
foreach_out_edge(irn, edge)
phi_arg |= is_Phi(edge->src);
-#if 1
color->r = is_Phi(irn) ? 0.5 : 0.0;
color->g = phi_arg ? 0.5 : 0.0;
color->b = 0.0;
-#else /* ! if 1 */
- {
- int live_in = is_live_in(rel_bl, irn);
- int live_out = is_live_out(rel_bl, irn);
-
- color->r = live_in;
- color->g = live_out;
- color->b = 0.0;
- }
-#endif /* if 1 */
-
return color;
}
env->plotter->vtab->set_color(env->plotter, &black);
env->plotter->vtab->box(env->plotter, &dims->box);
-#if 1
env->plotter->vtab->text(env->plotter, dims->box.x, dims->box.y, buf);
-#endif
foreach_border_head(head, b) {
if (b->is_def) {
*/
static int be_is_phi_argument(const ir_node *block, const ir_node *def)
{
-#if 1
if (get_irn_n_edges_kind(block, EDGE_KIND_BLOCK) < 1)
-#else
- if (get_irn_n_edges_kind(block, EDGE_KIND_BLOCK) != 1)
-#endif
return 0;
ir_node *const succ_block = get_first_block_succ(block);
for (bl = env->all_blocks; bl != NULL; bl = bl->all_next) {
size_t i, n = ARR_LEN(bl->roots);
-#if 1
/* TODO: is this really needed? The roots are already in
idx-order by construction, which might be good enough. */
qsort(bl->roots, n, sizeof(bl->roots[0]), cmp_nodes);
-#endif
DB((dbg, LEVEL_2, " Adding Roots for block %+F\n ", bl->block));
/* ok, add them sorted */
get_irn_node_nr(entry->root));
}
-#if 1
/* dump for test */
mark_options = root_env.options;
set_dump_node_vcgattr_hook(stat_dag_mark_hook);
dump_ir_graph(graph->irg, "-dag");
set_dump_node_vcgattr_hook(NULL);
-#endif
assert(id == root_env.num_of_dags);