HomeSort by: relevance | last modified time | path
    Searched defs:then_bb (Results 1 - 23 of 23) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
ifcvt.h 29 basic_block then_bb; /* THEN block. */ member in struct:ce_if_block
52 basic_block test_bb, then_bb, else_bb, join_bb; member in struct:noce_if_info
84 if blocks, the THEN_BB is the block reached via the fallthru edge
89 /* True if THEN_BB is conditional on !COND rather than COND.
92 - JUMP branches to THEN_BB on COND
97 /* True if the contents of then_bb and else_bb are a
107 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB.
109 of the costs for THEN_BB and ELSE_BB, as computed in the next field. */
symtab-thunks.cc 409 basic_block bb, then_bb, else_bb, return_bb; local
462 bb = then_bb = else_bb = return_bb
575 then_bb = create_basic_block (NULL, bb);
576 then_bb->count = cfg_count - cfg_count / 16;
577 return_bb = create_basic_block (NULL, then_bb);
581 add_bb_to_loop (then_bb, bb->loop_father);
585 true_label = gimple_block_label (then_bb);
590 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
596 make_single_succ_edge (then_bb, return_bb, EDGE_FALLTHRU);
599 bsi = gsi_last_bb (then_bb);
    [all...]
tree-ssa-ifcombine.cc 74 then end else blocks are stored to *THEN_BB and *ELSE_BB. If
75 *THEN_BB and/or *ELSE_BB are already set, they are required to
81 basic_block *then_bb, basic_block *else_bb)
98 if (*then_bb
99 && t->dest != *then_bb)
105 if (!*then_bb)
106 *then_bb = t->dest;
671 set of INNER_COND_BB, OUTER_COND_BB, THEN_BB and ELSE_BB.
672 PHI_PRED_BB should be one of INNER_COND_BB, THEN_BB or ELSE_BB. */
676 basic_block then_bb, basic_block else_bb
765 basic_block then_bb = NULL, else_bb = NULL; local
    [all...]
ipa-strub.cc 3108 basic_block bb, then_bb, else_bb, return_bb;
3147 bb = then_bb = else_bb = return_bb
3106 basic_block bb, then_bb, else_bb, return_bb; local
ubsan.cc 784 basic_block then_bb, fallthru_bb;
787 &then_bb, &fallthru_bb);
797 *gsi = gsi_after_labels (then_bb);
886 basic_block then_bb = create_empty_bb (cond_bb);
887 add_bb_to_loop (then_bb, cond_bb->loop_father);
892 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
894 then_bb->count = e->count ();
899 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
906 /* Update dominance info for the newly created then_bb; note that
910 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb)
1040 basic_block then_bb, fallthru_bb; local
1156 basic_block then_bb = create_empty_bb (cond_bb); local
1311 basic_block then_bb; local
1408 basic_block then_bb, fallthru2_bb; local
1825 basic_block then_bb, fallthru_bb; local
2063 basic_block then_bb, fallthru_bb; local
2119 basic_block then_bb, fallthru_bb; local
2365 basic_block then_bb, fallthru_bb; local
    [all...]
tree-ssa-loop-im.cc 2068 basic_block new_bb, then_bb, old_dest; local
2150 then_bb = create_empty_bb (new_bb);
2151 then_bb->count = new_bb->count.apply_probability (flag_probability);
2153 then_bb->flags = BB_IRREDUCIBLE_LOOP;
2154 add_bb_to_loop (then_bb, new_bb->loop_father);
2164 gsi = gsi_start_bb (then_bb);
2170 edge e2 = make_edge (new_bb, then_bb,
2179 then_old_edge = make_single_succ_edge (then_bb, old_dest,
2182 set_immediate_dominator (CDI_DOMINATORS, then_bb, new_bb);
2216 return then_bb;
    [all...]
asan.cc 2469 basic_block then_bb = create_empty_bb (cond_bb); local
2472 add_bb_to_loop (then_bb, cond_bb->loop_father);
2477 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
2483 then_bb->count = e->count ();
2485 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
2492 /* Update dominance info for the newly created then_bb; note that
2496 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
2498 *then_block = then_bb;
2517 Upon completion of the function, *THEN_BB is set to the newly
2528 basic_block *then_bb,
    [all...]
ifcvt.cc 475 basic_block then_bb = ce_info->then_bb; /* THEN */
524 then_start = first_active_insn (then_bb);
525 then_end = last_active_insn (then_bb, true);
526 then_n_insns = ce_info->num_then_insns = count_bb_insns (then_bb);
542 n_matching = flow_find_cross_jump (then_bb, else_bb,
545 if (then_first_tail == BB_HEAD (then_bb))
553 then_end = find_active_insn_before (then_bb, then_first_tail);
567 = flow_find_head_matching_sequence (then_bb, else_bb,
579 for (insn = BB_HEAD (then_bb);
473 basic_block then_bb = ce_info->then_bb; \/* THEN *\/ local
2151 basic_block then_bb = if_info->then_bb; local
3477 basic_block then_bb = if_info->then_bb; local
3625 basic_block then_bb = if_info->then_bb; local
3913 basic_block then_bb = if_info->then_bb; \/* THEN *\/ local
4467 basic_block then_bb = if_info->then_bb; local
4596 basic_block then_bb, else_bb, join_bb; local
4733 basic_block then_bb = ce_info->then_bb; \/* THEN *\/ local
5031 basic_block then_bb = ce_info->then_bb; local
5264 basic_block then_bb = then_edge->dest; local
5464 basic_block then_bb = then_edge->dest; local
5585 basic_block then_bb = then_edge->dest; local
    [all...]
omp-expand.cc 655 basic_block cond_bb, then_bb, else_bb; local
678 then_bb = create_empty_bb (cond_bb);
679 else_bb = create_empty_bb (then_bb);
680 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
687 gsi = gsi_start_bb (then_bb);
695 make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
697 add_bb_to_loop (then_bb, cond_bb->loop_father);
699 e_then = make_edge (then_bb, bb, EDGE_FALLTHRU);
10266 basic_block cond_bb, then_bb, else_bb;
10281 then_bb = create_empty_bb (cond_bb)
    [all...]
tree-cfg.cc 1295 basic_block then_bb, else_bb; local
1304 then_bb = label_to_block (cfun, then_label);
1306 then_stmt = first_stmt (then_bb);
1309 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
tree-ssa-reassoc.cc 7312 basic_block then_bb = split_block (cond_bb, def_stmt)->dest; local
7313 basic_block merge_bb = split_block (then_bb, use_stmt)->dest;
7325 edge efalse = find_edge (cond_bb, then_bb);
7328 then_bb->count -= etrue->count ();
7340 add_phi_arg (phi, othervar, single_succ_edge (then_bb), loc);
  /src/external/gpl3/gcc.old/dist/gcc/
ifcvt.h 29 basic_block then_bb; /* THEN block. */ member in struct:ce_if_block
52 basic_block test_bb, then_bb, else_bb, join_bb; member in struct:noce_if_info
84 if blocks, the THEN_BB is the block reached via the fallthru edge
89 /* True if the contents of then_bb and else_bb are a
99 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB.
101 of the costs for THEN_BB and ELSE_BB, as computed in the next field. */
symtab-thunks.cc 409 basic_block bb, then_bb, else_bb, return_bb; local
462 bb = then_bb = else_bb = return_bb
581 then_bb = create_basic_block (NULL, bb);
582 then_bb->count = cfg_count - cfg_count.apply_scale (1, 16);
583 return_bb = create_basic_block (NULL, then_bb);
587 add_bb_to_loop (then_bb, bb->loop_father);
591 true_label = gimple_block_label (then_bb);
596 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
604 make_single_succ_edge (then_bb, return_bb, EDGE_FALLTHRU);
607 bsi = gsi_last_bb (then_bb);
    [all...]
tree-ssa-ifcombine.cc 74 then end else blocks are stored to *THEN_BB and *ELSE_BB. If
75 *THEN_BB and/or *ELSE_BB are already set, they are required to
81 basic_block *then_bb, basic_block *else_bb)
98 if (*then_bb
99 && t->dest != *then_bb)
105 if (!*then_bb)
106 *then_bb = t->dest;
644 set of INNER_COND_BB, OUTER_COND_BB, THEN_BB and ELSE_BB.
645 PHI_PRED_BB should be one of INNER_COND_BB, THEN_BB or ELSE_BB. */
649 basic_block then_bb, basic_block else_bb
738 basic_block then_bb = NULL, else_bb = NULL; local
    [all...]
ubsan.cc 711 basic_block then_bb, fallthru_bb;
714 &then_bb, &fallthru_bb);
724 *gsi = gsi_after_labels (then_bb);
813 basic_block then_bb = create_empty_bb (cond_bb);
814 add_bb_to_loop (then_bb, cond_bb->loop_father);
819 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
821 then_bb->count = e->count ();
826 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
833 /* Update dominance info for the newly created then_bb; note that
837 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb)
966 basic_block then_bb, fallthru_bb; local
1082 basic_block then_bb = create_empty_bb (cond_bb); local
1240 basic_block then_bb; local
1337 basic_block then_bb, fallthru2_bb; local
1752 basic_block then_bb, fallthru_bb; local
1991 basic_block then_bb, fallthru_bb; local
2047 basic_block then_bb, fallthru_bb; local
2295 basic_block then_bb, fallthru_bb; local
    [all...]
ifcvt.cc 475 basic_block then_bb = ce_info->then_bb; /* THEN */
524 then_start = first_active_insn (then_bb);
525 then_end = last_active_insn (then_bb, TRUE);
526 then_n_insns = ce_info->num_then_insns = count_bb_insns (then_bb);
542 n_matching = flow_find_cross_jump (then_bb, else_bb,
545 if (then_first_tail == BB_HEAD (then_bb))
553 then_end = find_active_insn_before (then_bb, then_first_tail);
567 = flow_find_head_matching_sequence (then_bb, else_bb,
579 for (insn = BB_HEAD (then_bb);
473 basic_block then_bb = ce_info->then_bb; \/* THEN *\/ local
2118 basic_block then_bb = if_info->then_bb; local
3253 basic_block then_bb = if_info->then_bb; local
3401 basic_block then_bb = if_info->then_bb; local
3727 basic_block then_bb = if_info->then_bb; \/* THEN *\/ local
4275 basic_block then_bb = if_info->then_bb; local
4404 basic_block then_bb, else_bb, join_bb; local
4537 basic_block then_bb = ce_info->then_bb; \/* THEN *\/ local
4835 basic_block then_bb = ce_info->then_bb; local
5068 basic_block then_bb = then_edge->dest; local
5268 basic_block then_bb = then_edge->dest; local
5389 basic_block then_bb = then_edge->dest; local
    [all...]
tree-ssa-loop-im.cc 2020 basic_block new_bb, then_bb, old_dest; local
2099 then_bb = create_empty_bb (new_bb);
2100 then_bb->count = new_bb->count.apply_probability (flag_probability);
2102 then_bb->flags = BB_IRREDUCIBLE_LOOP;
2103 add_bb_to_loop (then_bb, new_bb->loop_father);
2113 gsi = gsi_start_bb (then_bb);
2119 edge e2 = make_edge (new_bb, then_bb,
2128 then_old_edge = make_single_succ_edge (then_bb, old_dest,
2131 set_immediate_dominator (CDI_DOMINATORS, then_bb, new_bb);
2165 return then_bb;
    [all...]
asan.cc 2427 basic_block then_bb = create_empty_bb (cond_bb); local
2430 add_bb_to_loop (then_bb, cond_bb->loop_father);
2435 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
2441 then_bb->count = e->count ();
2443 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
2450 /* Update dominance info for the newly created then_bb; note that
2454 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
2456 *then_block = then_bb;
2475 Upon completion of the function, *THEN_BB is set to the newly
2486 basic_block *then_bb,
    [all...]
omp-expand.cc 654 basic_block cond_bb, then_bb, else_bb; local
677 then_bb = create_empty_bb (cond_bb);
678 else_bb = create_empty_bb (then_bb);
679 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
686 gsi = gsi_start_bb (then_bb);
694 make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
696 add_bb_to_loop (then_bb, cond_bb->loop_father);
698 e_then = make_edge (then_bb, bb, EDGE_FALLTHRU);
10065 basic_block cond_bb, then_bb, else_bb;
10082 then_bb = create_empty_bb (cond_bb)
    [all...]
tree-cfg.cc 1211 basic_block then_bb, else_bb; local
1221 then_bb = label_to_block (cfun, then_label);
1223 then_stmt = first_stmt (then_bb);
1226 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
tree-ssa-reassoc.cc 6960 basic_block then_bb = split_block (cond_bb, def_stmt)->dest; local
6961 basic_block merge_bb = split_block (then_bb, use_stmt)->dest;
6973 edge efalse = find_edge (cond_bb, then_bb);
6976 then_bb->count -= etrue->count ();
6988 add_phi_arg (phi, othervar, single_succ_edge (then_bb), loc);
  /src/external/gpl3/gcc/dist/gcc/config/frv/
frv.cc 5214 basic_block then_bb = ce_info->then_bb; /* THEN */
5263 if (REGNO_REG_SET_P (df_get_live_in (then_bb), j))
5314 bb[num_bb++] = then_bb;
5330 (bb[j] == else_bb) ? "else" : ((bb[j] == then_bb) ? "then" : "test"),
5161 basic_block then_bb = ce_info->then_bb; \/* THEN *\/ local
  /src/external/gpl3/gcc.old/dist/gcc/config/frv/
frv.cc 5212 basic_block then_bb = ce_info->then_bb; /* THEN */
5261 if (REGNO_REG_SET_P (df_get_live_in (then_bb), j))
5312 bb[num_bb++] = then_bb;
5328 (bb[j] == else_bb) ? "else" : ((bb[j] == then_bb) ? "then" : "test"),
5159 basic_block then_bb = ce_info->then_bb; \/* THEN *\/ local

Completed in 246 milliseconds