Searched refs:then_bb (Results 1 - 24 of 24) sorted by relevance

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Difcvt.h29 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
89 /* True if the contents of then_bb and else_bb are a
H A Dtree-ssa-ifcombine.c79 basic_block *then_bb, basic_block *else_bb)
96 if (*then_bb
97 && t->dest != *then_bb)
103 if (!*then_bb)
104 *then_bb = t->dest;
636 basic_block then_bb, basic_block else_bb,
678 /* The || form is characterized by a common then_bb with the
680 by matching PHI arguments in the then_bb and the inner cond_bb
682 if (phi_pred_bb != then_bb
683 && recognize_if_then_else (outer_cond_bb, &then_bb,
78 recognize_if_then_else(basic_block cond_bb, basic_block *then_bb, basic_block *else_bb) argument
635 tree_ssa_ifcombine_bb_1(basic_block inner_cond_bb, basic_block outer_cond_bb, basic_block then_bb, basic_block else_bb, basic_block phi_pred_bb) argument
725 basic_block then_bb = NULL, else_bb = NULL; local
[all...]
H A Difcvt.c465 basic_block then_bb = ce_info->then_bb; /* THEN */
514 then_start = first_active_insn (then_bb);
515 then_end = last_active_insn (then_bb, TRUE);
516 then_n_insns = ce_info->num_then_insns = count_bb_insns (then_bb);
532 n_matching = flow_find_cross_jump (then_bb, else_bb,
535 if (then_first_tail == BB_HEAD (then_bb))
543 then_end = find_active_insn_before (then_bb, then_first_tail);
557 = flow_find_head_matching_sequence (then_bb, else_bb,
569 for (insn = BB_HEAD (then_bb);
463 basic_block then_bb = ce_info->then_bb; /* THEN */ local
2099 basic_block then_bb = if_info->then_bb; local
3190 basic_block then_bb = if_info->then_bb; local
3444 basic_block then_bb = if_info->then_bb; /* THEN */ local
3894 basic_block then_bb = if_info->then_bb; local
4025 basic_block then_bb, else_bb, join_bb; local
4158 basic_block then_bb = ce_info->then_bb; /* THEN */ local
4456 basic_block then_bb = ce_info->then_bb; local
4689 basic_block then_bb = then_edge->dest; local
4887 basic_block then_bb = then_edge->dest; local
5008 basic_block then_bb = then_edge->dest; local
[all...]
H A Dubsan.c707 basic_block then_bb, fallthru_bb; local
710 &then_bb, &fallthru_bb);
720 *gsi = gsi_after_labels (then_bb);
802 basic_block then_bb = create_empty_bb (cond_bb); local
803 add_bb_to_loop (then_bb, cond_bb->loop_father);
808 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
810 then_bb->count = e->count ();
815 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
822 /* Update dominance info for the newly created then_bb; note that
826 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_b
955 basic_block then_bb, fallthru_bb; local
1071 basic_block then_bb = create_empty_bb (cond_bb); local
1229 basic_block then_bb; local
1326 basic_block then_bb, fallthru2_bb; local
1730 basic_block then_bb, fallthru_bb; local
1961 basic_block then_bb, fallthru_bb; local
2017 basic_block then_bb, fallthru_bb; local
2266 basic_block then_bb, fallthru_bb; local
[all...]
H A Dcgraphunit.c1955 basic_block bb, then_bb, else_bb, return_bb; local
2007 bb = then_bb = else_bb = return_bb
2129 then_bb = create_basic_block (NULL, bb);
2130 then_bb->count = cfg_count - cfg_count.apply_scale (1, 16);
2131 return_bb = create_basic_block (NULL, then_bb);
2135 add_bb_to_loop (then_bb, bb->loop_father);
2139 true_label = gimple_block_label (then_bb);
2144 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
2152 make_single_succ_edge (then_bb, return_bb, EDGE_FALLTHRU);
2155 bsi = gsi_last_bb (then_bb);
[all...]
H A Dasan.c2014 basic_block then_bb = create_empty_bb (cond_bb); local
2017 add_bb_to_loop (then_bb, cond_bb->loop_father);
2022 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
2028 then_bb->count = e->count ();
2030 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
2037 /* Update dominance info for the newly created then_bb; note that
2041 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
2043 *then_block = then_bb;
2073 basic_block *then_bb,
2081 then_bb,
2070 insert_if_then_before_iter(gcond *cond, gimple_stmt_iterator *iter, bool then_more_likely_p, basic_block *then_bb, basic_block *fallthrough_bb) argument
3427 basic_block then_bb, fallthrough_bb; local
3441 basic_block then_bb, else_bb; local
[all...]
H A Dtree-ssa-phiopt.c2328 cond_if_else_store_replacement_1 (basic_block then_bb, basic_block else_bb, argument
2380 add_phi_arg (newphi, then_rhs, EDGE_SUCC (then_bb, 0), then_locus);
2451 cond_if_else_store_replacement (basic_block then_bb, basic_block else_bb, argument
2477 tree then_vdef = PHI_ARG_DEF_FROM_EDGE (vphi, single_succ_edge (then_bb));
2479 gimple *then_assign = single_trailing_store_in_bb (then_bb, then_vdef);
2484 return cond_if_else_store_replacement_1 (then_bb, else_bb, join_bb,
2498 if ((find_data_references_in_bb (NULL, then_bb, &then_datarefs)
2570 blocks[0] = then_bb;
2623 res = cond_if_else_store_replacement_1 (then_bb, else_bb, join_bb,
H A Dtree-ssa-loop-im.c1869 basic_block new_bb, then_bb, old_dest; local
1949 then_bb = create_empty_bb (new_bb);
1950 then_bb->count = new_bb->count.apply_probability (flag_probability);
1952 then_bb->flags = BB_IRREDUCIBLE_LOOP;
1953 add_bb_to_loop (then_bb, new_bb->loop_father);
1960 gsi = gsi_start_bb (then_bb);
1966 edge e2 = make_edge (new_bb, then_bb,
1975 then_old_edge = make_single_succ_edge (then_bb, old_dest,
1978 set_immediate_dominator (CDI_DOMINATORS, then_bb, new_bb);
H A Domp-expand.c684 basic_block cond_bb, then_bb, else_bb; local
707 then_bb = create_empty_bb (cond_bb);
708 else_bb = create_empty_bb (then_bb);
709 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
716 gsi = gsi_start_bb (then_bb);
724 make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
726 add_bb_to_loop (then_bb, cond_bb->loop_father);
728 e_then = make_edge (then_bb, bb, EDGE_FALLTHRU);
8281 basic_block cond_bb, then_bb, else_bb; local
8298 then_bb
[all...]
H A Dtree-ssa-reassoc.c6537 basic_block then_bb = split_block (cond_bb, def_stmt)->dest; local
6538 basic_block merge_bb = split_block (then_bb, use_stmt)->dest;
6550 edge efalse = find_edge (cond_bb, then_bb);
6553 then_bb->count -= etrue->count ();
6565 add_phi_arg (phi, othervar, single_succ_edge (then_bb), loc);
H A Dtree-cfg.c1217 basic_block then_bb, else_bb; local
1227 then_bb = label_to_block (cfun, then_label);
1229 then_stmt = first_stmt (then_bb);
1232 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Difcvt.h29 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
89 /* True if the contents of then_bb and else_bb are a
H A Dtree-ssa-ifcombine.cc81 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;
639 basic_block then_bb, basic_block else_bb,
681 /* The || form is characterized by a common then_bb with the
683 by matching PHI arguments in the then_bb and the inner cond_bb
685 if (phi_pred_bb != then_bb
686 && recognize_if_then_else (outer_cond_bb, &then_bb,
80 recognize_if_then_else(basic_block cond_bb, basic_block *then_bb, basic_block *else_bb) argument
638 tree_ssa_ifcombine_bb_1(basic_block inner_cond_bb, basic_block outer_cond_bb, basic_block then_bb, basic_block else_bb, basic_block phi_pred_bb) argument
728 basic_block then_bb = NULL, else_bb = NULL; local
[all...]
H A Difcvt.cc475 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...]
H A Dubsan.cc710 basic_block then_bb, fallthru_bb;
713 &then_bb, &fallthru_bb);
723 *gsi = gsi_after_labels (then_bb);
805 basic_block then_bb = create_empty_bb (cond_bb);
806 add_bb_to_loop (then_bb, cond_bb->loop_father);
811 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
813 then_bb->count = e->count ();
818 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
825 /* Update dominance info for the newly created then_bb; note that
829 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_b
958 basic_block then_bb, fallthru_bb; local
1074 basic_block then_bb = create_empty_bb (cond_bb); local
1232 basic_block then_bb; local
1329 basic_block then_bb, fallthru2_bb; local
1733 basic_block then_bb, fallthru_bb; local
1972 basic_block then_bb, fallthru_bb; local
2028 basic_block then_bb, fallthru_bb; local
2276 basic_block then_bb, fallthru_bb; local
[all...]
H A Dsymtab-thunks.cc409 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...]
H A Dasan.cc2405 basic_block then_bb = create_empty_bb (cond_bb); local
2408 add_bb_to_loop (then_bb, cond_bb->loop_father);
2413 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE);
2419 then_bb->count = e->count ();
2421 make_single_succ_edge (then_bb, fallthru_bb, EDGE_FALLTHRU);
2428 /* Update dominance info for the newly created then_bb; note that
2432 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb);
2434 *then_block = then_bb;
2464 basic_block *then_bb,
2472 then_bb,
2461 insert_if_then_before_iter(gcond *cond, gimple_stmt_iterator *iter, bool then_more_likely_p, basic_block *then_bb, basic_block *fallthrough_bb) argument
3825 gcc_assert(flags < ASAN_CHECK_LAST); bool is_scalar_access = (flags & ASAN_CHECK_SCALAR_ACCESS) != 0; bool is_store = (flags & ASAN_CHECK_STORE) != 0; bool is_non_zero_len = (flags & ASAN_CHECK_NON_ZERO_LEN) != 0; tree base = gimple_call_arg (g, 1); tree len = gimple_call_arg (g, 2); HOST_WIDE_INT align = tree_to_shwi (gimple_call_arg (g, 3)); HOST_WIDE_INT size_in_bytes = is_scalar_access && tree_fits_shwi_p (len) ? tree_to_shwi (len) : -1; if (use_calls) { gimple *g = gimple_build_assign (make_ssa_name (pointer_sized_int_node), NOP_EXPR, base); gimple_set_location (g, loc); gsi_insert_before (iter, g, GSI_SAME_STMT); tree base_addr = gimple_assign_lhs (g); int nargs; tree fun = check_func (is_store, recover_p, size_in_bytes, &nargs); if (nargs == 1) g = gimple_build_call (fun, 1, base_addr); else { gcc_assert (nargs == 2); g = gimple_build_assign (make_ssa_name (pointer_sized_int_node), NOP_EXPR, len); gimple_set_location (g, loc); gsi_insert_before (iter, g, GSI_SAME_STMT); tree sz_arg = gimple_assign_lhs (g); g = gimple_build_call (fun, nargs, base_addr, sz_arg); } gimple_set_location (g, loc); gsi_replace (iter, g, false); return false; } HOST_WIDE_INT real_size_in_bytes = size_in_bytes == -1 ? 1 : size_in_bytes; tree shadow_ptr_type = shadow_ptr_types[real_size_in_bytes == 16 ? 1 : 0]; tree shadow_type = TREE_TYPE (shadow_ptr_type); gimple_stmt_iterator gsi = *iter; if (!is_non_zero_len) { g = gimple_build_cond (NE_EXPR, len, build_int_cst (TREE_TYPE (len), 0), NULL_TREE, NULL_TREE); gimple_set_location (g, loc); basic_block then_bb, fallthrough_bb; insert_if_then_before_iter (as_a <gcond *> (g), iter, true, &then_bb, &fallthrough_bb); gsi = gsi_last_bb (then_bb); } basic_block then_bb, else_bb; gsi = create_cond_insert_point (&gsi, false, false, recover_p, &then_bb, &else_bb); g = gimple_build_assign (make_ssa_name (pointer_sized_int_node), NOP_EXPR, base); gimple_set_location (g, loc); gsi_insert_before (&gsi, g, GSI_NEW_STMT); tree base_addr = gimple_assign_lhs (g); tree t = NULL_TREE; if (real_size_in_bytes >= 8) argument
[all...]
H A Dtree-ssa-loop-im.cc2010 basic_block new_bb, then_bb, old_dest; local
2089 then_bb = create_empty_bb (new_bb);
2090 then_bb->count = new_bb->count.apply_probability (flag_probability);
2092 then_bb->flags = BB_IRREDUCIBLE_LOOP;
2093 add_bb_to_loop (then_bb, new_bb->loop_father);
2103 gsi = gsi_start_bb (then_bb);
2109 edge e2 = make_edge (new_bb, then_bb,
2118 then_old_edge = make_single_succ_edge (then_bb, old_dest,
2121 set_immediate_dominator (CDI_DOMINATORS, then_bb, new_bb);
2155 return then_bb;
[all...]
H A Dtree-ssa-phiopt.cc3275 cond_if_else_store_replacement_1 (basic_block then_bb, basic_block else_bb, argument
3327 add_phi_arg (newphi, then_rhs, EDGE_SUCC (then_bb, 0), then_locus);
3400 cond_if_else_store_replacement (basic_block then_bb, basic_block else_bb, argument
3426 tree then_vdef = PHI_ARG_DEF_FROM_EDGE (vphi, single_succ_edge (then_bb));
3428 gimple *then_assign = single_trailing_store_in_bb (then_bb, then_vdef);
3433 return cond_if_else_store_replacement_1 (then_bb, else_bb, join_bb,
3447 if ((find_data_references_in_bb (NULL, then_bb, &then_datarefs)
3519 blocks[0] = then_bb;
3572 res = cond_if_else_store_replacement_1 (then_bb, else_bb, join_bb,
H A Domp-expand.cc654 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);
10064 basic_block cond_bb, then_bb, else_bb;
10081 then_bb
[all...]
H A Dtree-ssa-reassoc.cc6956 basic_block then_bb = split_block (cond_bb, def_stmt)->dest; local
6957 basic_block merge_bb = split_block (then_bb, use_stmt)->dest;
6969 edge efalse = find_edge (cond_bb, then_bb);
6972 then_bb->count -= etrue->count ();
6984 add_phi_arg (phi, othervar, single_succ_edge (then_bb), loc);
H A Dtree-cfg.cc1211 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);
/netbsd-current/external/gpl3/gcc.old/dist/gcc/config/frv/
H A Dfrv.c5224 basic_block then_bb = ce_info->then_bb; /* THEN */
5273 if (REGNO_REG_SET_P (df_get_live_in (then_bb), j))
5324 bb[num_bb++] = then_bb;
5340 (bb[j] == else_bb) ? "else" : ((bb[j] == then_bb) ? "then" : "test"),
5170 basic_block then_bb = ce_info->then_bb; /* THEN */ local
/netbsd-current/external/gpl3/gcc/dist/gcc/config/frv/
H A Dfrv.cc5212 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 392 milliseconds