Home
last modified time | relevance | path

Searched refs:ENTRY_BLOCK (Results 1 – 16 of 16) sorted by relevance

/openbsd/gnu/gcc/gcc/
H A Dcfganal.c712 post_order[post_order_num++] = ENTRY_BLOCK; in post_order_compute()
747 pre_order[pre_order_num] = ENTRY_BLOCK; in pre_and_rev_post_order_compute()
750 rev_post_order[rev_post_order_num--] = ENTRY_BLOCK; in pre_and_rev_post_order_compute()
H A Dcfg.c88 ENTRY_BLOCK_PTR->index = ENTRY_BLOCK; in init_flow()
167 SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR); in compact_blocks()
H A Dpredict.c1251 memset (heads, ENTRY_BLOCK, sizeof (int) * last_basic_block); in tree_bb_level_predictions()
1480 if (heads[bb->index] == ENTRY_BLOCK) in predict_paths_leading_to()
1489 while (heads[next_ai->index] == ENTRY_BLOCK) in predict_paths_leading_to()
H A Dcfgbuild.c554 SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR); in find_basic_blocks()
H A Dsched-rgn.c576 gcc_assert (node != ENTRY_BLOCK); in find_rgns()
595 gcc_assert (node != ENTRY_BLOCK); in find_rgns()
1087 if (predn != ENTRY_BLOCK in extend_rgns()
H A Dbasic-block.h472 #define ENTRY_BLOCK (0) macro
H A Dprofile.c1014 ENTRY_BLOCK_PTR->index = ENTRY_BLOCK; in branch_prob()
H A Ddf-scan.c1781 if (bitmap_bit_p (blocks, ENTRY_BLOCK)) in df_refs_record()
H A Dglobal.c2372 if (pred->index != ENTRY_BLOCK) in calculate_reg_pav()
H A Dtree-into-ssa.c950 if (b == ENTRY_BLOCK) in prune_unused_phi_nodes()
H A Dtree-inline.c816 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK) in copy_edges_for_bb()
H A Ddf-problems.c2572 if (bb_index != ENTRY_BLOCK && bb_index != EXIT_BLOCK) in df_urec_local_finalize()
H A Dtree-cfg.c145 SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR); in init_empty_tree_cfg()
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dcfg.c99 ENTRY_BLOCK, /* index */
H A Dbasic-block.h306 #define ENTRY_BLOCK (-1) macro
H A Dpredict.c771 if (heads[ai->index] == ENTRY_BLOCK)