/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | tree-vect-loop-manip.c | 2180 goto merge_bb; 2199 merge_bb: 2216 This function creates PHI nodes at merge_bb and replaces the use of i_5 2258 and MERGE_EDGE are the two pred edges of merge_bb at the end of EPILOG. 2277 goto merge_bb; 2291 goto merge_bb; 2295 merge_bb: 2299 i_x = PHI<i_4>; ;Use of i_4 to be replaced with i_y in merge_bb. 2302 phi in exit_bb) we create a new PHI in merge_bb. The new PHI has two 2313 basic_block merge_bb local 3272 basic_block merge_bb; local [all...] |
H A D | tree-ssa-tail-merge.c | 1062 basic_block merge_bb, other_bb; local 1077 merge_bb = BB_CLUSTER (bb1) == NULL ? bb2 : bb1; 1079 merge = BB_CLUSTER (merge_bb);
|
H A D | ifcvt.c | 5122 dead_or_predicable (basic_block test_bb, basic_block merge_bb, 5137 head = BB_HEAD (merge_bb); 5138 end = BB_END (merge_bb); 5143 /* If merge_bb ends with a tablejump, predicating/moving insn's 5144 into test_bb and then deleting merge_bb will result in the jumptable 5145 that follows merge_bb being removed along with merge_bb and then we 5264 simulate_backwards_to_point (merge_bb, live, end); 5266 merge_bb, live, 5275 FOR_BB_INSNS (merge_bb, ins 5116 dead_or_predicable(basic_block test_bb, basic_block merge_bb, basic_block other_bb, edge dest_edge, int reversep) argument [all...] |
H A D | cfgcleanup.c | 2470 basic_block merge_bb = EDGE_SUCC (bb, ix)->dest; 2471 rtx_insn *head = BB_HEAD (merge_bb); 2483 simulate_backwards_to_point (merge_bb, live, head); 2463 basic_block merge_bb = EDGE_SUCC (bb, ix)->dest; local
|
H A D | df-problems.c | 4086 basic_block merge_bb, regset merge_live, 4155 df_simulate_initialize_backwards (merge_bb, test_use); 4256 df_simulate_one_insn_backwards (merge_bb, insn, local_merge_live); 4272 df_simulate_one_insn_backwards (merge_bb, insn, 4075 can_move_insns_across(rtx_insn *from, rtx_insn *to, rtx_insn *across_from, rtx_insn *across_to, basic_block merge_bb, regset merge_live, regset other_branch_live, rtx_insn **pmove_upto) argument
|
H A D | tree-ssa-reassoc.c | 6538 basic_block merge_bb = split_block (then_bb, use_stmt)->dest; local 6548 edge etrue = make_edge (cond_bb, merge_bb, EDGE_TRUE_VALUE); 6563 gphi *phi = create_phi_node (lhs, merge_bb); 6569 set_immediate_dominator (CDI_DOMINATORS, merge_bb, cond_bb); 6570 set_immediate_dominator (CDI_POST_DOMINATORS, cond_bb, merge_bb);
|
H A D | hsa-gen.c | 4807 basic_block merge_bb = split_edge (EDGE_PRED (cont_bb, 0)); local 4813 redirect_edge_succ (EDGE_SUCC (call_bb, 0), merge_bb); 4883 hsa_bb *merge_bb local 4885 expand_lhs_of_string_op (stmt, n, merge_bb, builtin); 4923 hsa_bb *merge_bb local 4925 expand_lhs_of_string_op (stmt, n, merge_bb, builtin);
|
H A D | sel-sched-ir.c | 5299 move_bb_info (basic_block merge_bb, basic_block empty_bb) 5301 if (in_current_region_p (merge_bb)) 5303 &BB_NOTE_LIST (merge_bb)); 5274 move_bb_info(basic_block merge_bb, basic_block empty_bb) argument
|
H A D | tree-cfg.c | 1772 basic_block merge_bb = label_to_block (cfun, CASE_LABEL (merge_case)); local 1777 if (merge_bb == base_bb
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-tail-merge.cc | 1062 basic_block merge_bb, other_bb; local 1077 merge_bb = BB_CLUSTER (bb1) == NULL ? bb2 : bb1; 1079 merge = BB_CLUSTER (merge_bb);
|
H A D | tree-vect-loop-manip.cc | 2259 goto merge_bb; 2278 merge_bb: 2295 This function creates PHI nodes at merge_bb and replaces the use of i_5 2337 and MERGE_EDGE are the two pred edges of merge_bb at the end of EPILOG. 2356 goto merge_bb; 2370 goto merge_bb; 2374 merge_bb: 2378 i_x = PHI<i_4>; ;Use of i_4 to be replaced with i_y in merge_bb. 2381 phi in exit_bb) we create a new PHI in merge_bb. The new PHI has two 2392 basic_block merge_bb local 3414 basic_block merge_bb; local [all...] |
H A D | ifcvt.cc | 5503 dead_or_predicable (basic_block test_bb, basic_block merge_bb, 5518 head = BB_HEAD (merge_bb); 5519 end = BB_END (merge_bb); 5524 /* If merge_bb ends with a tablejump, predicating/moving insn's 5525 into test_bb and then deleting merge_bb will result in the jumptable 5526 that follows merge_bb being removed along with merge_bb and then we 5651 simulate_backwards_to_point (merge_bb, live, end); 5653 merge_bb, live, 5662 FOR_BB_INSNS (merge_bb, ins 5497 dead_or_predicable(basic_block test_bb, basic_block merge_bb, basic_block other_bb, edge dest_edge, int reversep) argument [all...] |
H A D | cfgcleanup.cc | 2456 basic_block merge_bb = EDGE_SUCC (bb, ix)->dest; 2457 rtx_insn *head = BB_HEAD (merge_bb); 2469 simulate_backwards_to_point (merge_bb, live, head);
|
H A D | df-problems.cc | 4126 basic_block merge_bb, regset merge_live, 4195 df_simulate_initialize_backwards (merge_bb, test_use); 4295 df_simulate_one_insn_backwards (merge_bb, insn, local_merge_live); 4310 df_simulate_one_insn_backwards (merge_bb, insn, 4115 can_move_insns_across(rtx_insn *from, rtx_insn *to, rtx_insn *across_from, rtx_insn *across_to, basic_block merge_bb, regset merge_live, regset other_branch_live, rtx_insn **pmove_upto) argument
|
H A D | sel-sched-ir.cc | 5297 move_bb_info (basic_block merge_bb, basic_block empty_bb) 5299 if (in_current_region_p (merge_bb)) 5301 &BB_NOTE_LIST (merge_bb)); 5272 move_bb_info(basic_block merge_bb, basic_block empty_bb) argument
|
H A D | tree-ssa-reassoc.cc | 6957 basic_block merge_bb = split_block (then_bb, use_stmt)->dest; local 6967 edge etrue = make_edge (cond_bb, merge_bb, EDGE_TRUE_VALUE); 6982 gphi *phi = create_phi_node (lhs, merge_bb); 6988 set_immediate_dominator (CDI_DOMINATORS, merge_bb, cond_bb); 6989 set_immediate_dominator (CDI_POST_DOMINATORS, cond_bb, merge_bb);
|
H A D | tree-cfg.cc | 1770 basic_block merge_bb = label_to_block (cfun, CASE_LABEL (merge_case)); local 1775 if (merge_bb == base_bb
|