HomeSort by: relevance | last modified time | path
    Searched refs:merge_bb (Results 1 - 16 of 16) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-tail-merge.cc 1073 basic_block merge_bb, other_bb; local
1088 merge_bb = BB_CLUSTER (bb1) == NULL ? bb2 : bb1;
1090 merge = BB_CLUSTER (merge_bb);
ifcvt.cc 5692 TEST_BB is the block containing the conditional branch. MERGE_BB
5699 dead_or_predicable (basic_block test_bb, basic_block merge_bb,
5714 head = BB_HEAD (merge_bb);
5715 end = BB_END (merge_bb);
5720 /* If merge_bb ends with a tablejump, predicating/moving insn's
5721 into test_bb and then deleting merge_bb will result in the jumptable
5722 that follows merge_bb being removed along with merge_bb and then we
5847 simulate_backwards_to_point (merge_bb, live, end);
5849 merge_bb, live
    [all...]
tree-vect-loop-manip.cc 2927 goto merge_bb;
2946 merge_bb:
2963 This function creates PHI nodes at merge_bb and replaces the use of i_5
3987 basic_block merge_bb;
4250 merge_bb will have already just a single successor. */
4263 merge_bb = exit_edge->dest;
4264 if (EDGE_COUNT (merge_bb->preds) >= 2)
4266 gcc_assert (EDGE_COUNT (merge_bb->preds) >= 2);
4271 for (gsi = gsi_start_phis (merge_bb); !gsi_end_p (gsi);
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);
df-problems.cc 4108 different basic blocks; MERGE_BB is the block from which the
4128 basic_block merge_bb, regset merge_live,
4180 MERGE_SET = set of registers set in MERGE_BB
4181 MERGE_USE = set of registers used in MERGE_BB and live at its top
4197 df_simulate_initialize_backwards (merge_bb, test_use);
4297 df_simulate_one_insn_backwards (merge_bb, insn, local_merge_live);
4312 df_simulate_one_insn_backwards (merge_bb, insn,
sel-sched-ir.cc 5295 /* Concatenate info of EMPTY_BB to info of MERGE_BB. */
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));
tree-ssa-reassoc.cc 7313 basic_block merge_bb = split_block (then_bb, use_stmt)->dest; local
7323 edge etrue = make_edge (cond_bb, merge_bb, EDGE_TRUE_VALUE);
7338 gphi *phi = create_phi_node (lhs, merge_bb);
7344 set_immediate_dominator (CDI_DOMINATORS, merge_bb, cond_bb);
7345 set_immediate_dominator (CDI_POST_DOMINATORS, cond_bb, merge_bb);
tree-cfg.cc 1852 basic_block merge_bb = label_to_block (cfun, CASE_LABEL (merge_case)); local
1857 if (merge_bb == base_bb
  /src/external/gpl3/gcc.old/dist/gcc/
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);
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 = guard_edge->dest local
3414 basic_block merge_bb; local
    [all...]
ifcvt.cc 5496 TEST_BB is the block containing the conditional branch. MERGE_BB
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
    [all...]
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);
df-problems.cc 4108 different basic blocks; MERGE_BB is the block from which the
4128 basic_block merge_bb, regset merge_live,
4180 MERGE_SET = set of registers set in MERGE_BB
4181 MERGE_USE = set of registers used in MERGE_BB and live at its top
4197 df_simulate_initialize_backwards (merge_bb, test_use);
4297 df_simulate_one_insn_backwards (merge_bb, insn, local_merge_live);
4312 df_simulate_one_insn_backwards (merge_bb, insn,
sel-sched-ir.cc 5295 /* Concatenate info of EMPTY_BB to info of MERGE_BB. */
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));
tree-ssa-reassoc.cc 6961 basic_block merge_bb = split_block (then_bb, use_stmt)->dest; local
6971 edge etrue = make_edge (cond_bb, merge_bb, EDGE_TRUE_VALUE);
6986 gphi *phi = create_phi_node (lhs, merge_bb);
6992 set_immediate_dominator (CDI_DOMINATORS, merge_bb, cond_bb);
6993 set_immediate_dominator (CDI_POST_DOMINATORS, cond_bb, merge_bb);
tree-cfg.cc 1770 basic_block merge_bb = label_to_block (cfun, CASE_LABEL (merge_case)); local
1775 if (merge_bb == base_bb

Completed in 99 milliseconds