Searched refs:BASIC_BLOCK (Results 1 - 25 of 34) sorted by relevance
12
/freebsd-9.3-release/contrib/gcc/ |
H A D | insn-notes.def | 89 INSN_NOTE (BASIC_BLOCK)
|
H A D | caller-save.c | 839 if (chain->insn == BB_HEAD (BASIC_BLOCK (chain->block))) 840 BB_HEAD (BASIC_BLOCK (chain->block)) = new->insn; 859 if (chain->insn == BB_END (BASIC_BLOCK (chain->block))) 860 BB_END (BASIC_BLOCK (chain->block)) = new->insn;
|
H A D | tree-ssa-sink.c | 255 commondom = BASIC_BLOCK (bitmap_first_set_bit (blocks)); 258 BASIC_BLOCK (j));
|
H A D | sched-rgn.c | 158 BASIC_BLOCK (EBB_HEAD (i)) - head of ebb. */ 160 #define EBB_FIRST_BB(ebb) BASIC_BLOCK (BB_TO_BLOCK (ebb)) 161 #define EBB_LAST_BB(ebb) BASIC_BLOCK (rgn_bb_table[ebb_head[ebb + 1] - 1]) 450 (*num_insns) += (INSN_LUID (BB_END (BASIC_BLOCK (block))) 451 - INSN_LUID (BB_HEAD (BASIC_BLOCK (block)))); 846 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (child)->preds) 903 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (child)->succs) 1084 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (bbn)->preds) 1188 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (bbn)->succs) 1245 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (succ [all...] |
H A D | tree-into-ssa.c | 374 *tos++ = BASIC_BLOCK (i); 535 BASIC_BLOCK (def_block_index))) 886 def_bb = BASIC_BLOCK (i); 960 use_bb = get_immediate_dominator (CDI_DOMINATORS, BASIC_BLOCK (b)); 973 def_bb = BASIC_BLOCK (p); 1151 bb = BASIC_BLOCK (bb_index); 2771 if (BASIC_BLOCK (i) != entry 2772 && dominated_by_p (CDI_DOMINATORS, BASIC_BLOCK (i), entry)) 2801 basic_block bb = BASIC_BLOCK (i);
|
H A D | df-core.c | 413 basic_block bb = BASIC_BLOCK (bb_index); 477 basic_block bb = BASIC_BLOCK (bb_index); 682 df_hybrid_search_forward (BASIC_BLOCK (idx), dataflow, single_pass); 692 df_hybrid_search_backward (BASIC_BLOCK (idx), dataflow, single_pass); 907 basic_block bb = BASIC_BLOCK (i);
|
H A D | tree-ssa-loop-manip.c | 176 add_exit_phis_edge (BASIC_BLOCK (index), var); 310 find_uses_to_rename_bb (BASIC_BLOCK (index), use_blocks, need_phis); 572 BASIC_BLOCK (i)->flags |= BB_DUPLICATED; 575 add_phi_args_after_copy_bb (BASIC_BLOCK (i)); 578 BASIC_BLOCK (i)->flags &= ~BB_DUPLICATED;
|
H A D | graph.c | 317 bb = BASIC_BLOCK (i);
|
H A D | sbitmap.c | 533 basic_block b = BASIC_BLOCK (bb); 573 basic_block b = BASIC_BLOCK (bb); 613 basic_block b = BASIC_BLOCK (bb); 653 basic_block b = BASIC_BLOCK (bb);
|
H A D | bt-load.c | 468 basic_block bb = BASIC_BLOCK (i); 678 basic_block bb = BASIC_BLOCK (i); 822 if (def->other_btr_uses_before_def && BASIC_BLOCK (bb) == def->bb) 828 if (BASIC_BLOCK (bb) == user->bb) 1414 basic_block bb = BASIC_BLOCK (i);
|
H A D | cfg.c | 812 basic_block bb = BASIC_BLOCK (n); 1119 return BASIC_BLOCK (entry->index2); 1161 return BASIC_BLOCK (entry->index2);
|
H A D | dominance.c | 814 dom = BASIC_BLOCK (first); 816 if (dom != BASIC_BLOCK (i)) 817 dom = nearest_common_dominator (dir, dom, BASIC_BLOCK (i));
|
H A D | resource.c | 936 && ! INSN_DELETED_P (BB_HEAD (BASIC_BLOCK (tinfo->block)))) 975 regset regs_live = BASIC_BLOCK (b)->il.rtl->global_live_at_start; 1001 start_insn = (b == 0 ? insns : BB_HEAD (BASIC_BLOCK (b)));
|
H A D | local-alloc.c | 1301 insn = BB_END (BASIC_BLOCK (b)); 1309 if (insn == BB_HEAD (BASIC_BLOCK (b))) 1321 BASIC_BLOCK (b)->il.rtl->global_live_at_start); 1327 insn = BB_HEAD (BASIC_BLOCK (b)); 1556 if (insn == BB_END (BASIC_BLOCK (b)))
|
H A D | predict.c | 1509 ai = BASIC_BLOCK (heads[ai->index]); 1519 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (y)->succs) 1577 look up via BASIC_BLOCK. Detect this and use EXIT_BLOCK_PTR 1579 bb = BASIC_BLOCK (i);
|
H A D | sched-ebb.c | 763 last_bb = BASIC_BLOCK (jump_bbi);
|
H A D | tree-ssa-threadupdate.c | 880 basic_block bb = BASIC_BLOCK (i);
|
H A D | tree-ssa-uncprop.c | 233 find_edge (bb, BASIC_BLOCK (i))->aux = equivalency;
|
H A D | df-problems.c | 530 basic_block bb = BASIC_BLOCK (bb_index); 1059 basic_block bb = BASIC_BLOCK (bb_index); 1459 basic_block bb = BASIC_BLOCK (bb_index); 1874 basic_block bb = BASIC_BLOCK (bb_index); 2451 basic_block bb = BASIC_BLOCK (bb_index); 2850 basic_block bb = BASIC_BLOCK (bb_index); 2961 basic_block bb = BASIC_BLOCK (bb_index); 3499 basic_block bb = BASIC_BLOCK (bb_index);
|
H A D | tree-cfg.c | 464 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU); 833 bsi_start (BASIC_BLOCK (NUM_FIXED_BLOCKS)); 2277 debug_tree_bb (BASIC_BLOCK (n)); 2278 return BASIC_BLOCK (n); 5226 bb = BASIC_BLOCK (NUM_FIXED_BLOCKS); 5354 basic_block bb = BASIC_BLOCK (i); 5498 changed |= tree_purge_dead_eh_edges (BASIC_BLOCK (i));
|
H A D | df-scan.c | 467 basic_block bb = BASIC_BLOCK (bb_index); 837 basic_block bb = BASIC_BLOCK (bb_index); 1778 basic_block bb = BASIC_BLOCK (bb_index);
|
H A D | cfghooks.c | 88 && bb != BASIC_BLOCK (bb->index))
|
H A D | tree-dfa.c | 524 for (i = bsi_start (BASIC_BLOCK (NUM_FIXED_BLOCKS));
|
H A D | loop-unroll.c | 2094 bb = BASIC_BLOCK (i); 2165 bb = BASIC_BLOCK (i);
|
H A D | tree-ssa-live.c | 591 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (b)->preds) 851 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (b)->preds)
|
Completed in 316 milliseconds
12