/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | cfgloopmanip.c | 664 | | | cond_bb | 691 basic_block cond_bb, true_bb, false_bb, join_bb; local 697 cond_bb = split_edge (entry_edge); 699 /* Insert condition in cond_bb. */ 700 gsi = gsi_last_bb (cond_bb); 705 gsi = gsi_last_bb (cond_bb); 708 join_bb = split_edge (single_succ_edge (cond_bb)); 710 e_true = single_succ_edge (cond_bb); 713 e_false = make_edge (cond_bb, join_bb, 0); 721 set_immediate_dominator (CDI_DOMINATORS, cond_bb, entry_edg 1693 basic_block cond_bb; local [all...] |
H A D | tree-ssa-phiopt.c | 618 two_value_replacement (basic_block cond_bb, basic_block middle_bb, argument 634 gimple *stmt = last_stmt (cond_bb); 663 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge); 733 replace_phi_edge_with_variable (cond_bb, e1, phi, new_rhs); 746 conditional_replacement (basic_block cond_bb, basic_block middle_bb, argument 803 stmt = last_stmt (cond_bb); 815 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge); 854 replace_phi_edge_with_variable (cond_bb, e1, phi, new_var); 1061 value_replacement (basic_block cond_bb, basic_block middle_bb, argument 1101 cond = last_stmt (cond_bb); 1370 minmax_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, gimple *phi, tree arg0, tree arg1) argument 1748 cond_removal_in_popcount_pattern(basic_block cond_bb, basic_block middle_bb, edge e1, edge e2, gimple *phi, tree arg0, tree arg1) argument 1860 abs_replacement(basic_block cond_bb, basic_block middle_bb, edge e0 ATTRIBUTE_UNUSED, edge e1, gimple *phi, tree arg0, tree arg1) argument [all...] |
H A D | tree-profile.c | 424 basic_block cond_bb = split_edge (single_succ_edge (entry)); local 425 basic_block update_bb = split_edge (single_succ_edge (cond_bb)); 431 edge true_edge = single_succ_edge (cond_bb); 441 edge e = make_edge (cond_bb, single_succ_edge (update_bb)->dest, 453 gimple_stmt_iterator gsi = gsi_start_bb (cond_bb); 489 basic_block cond_bb = split_edge (single_succ_edge (entry)); local 490 basic_block update_bb = split_edge (single_succ_edge (cond_bb)); 496 edge true_edge = single_succ_edge (cond_bb); 500 = make_edge (cond_bb, single_succ_edge (update_bb)->dest, EDGE_FALSE_VALUE); 503 gimple_stmt_iterator gsi = gsi_start_bb (cond_bb); [all...] |
H A D | tree-ssa-loop-split.c | 583 basic_block cond_bb; local 585 class loop *loop2 = loop_version (loop1, cond, &cond_bb, 1275 basic_block cond_bb = gimple_bb (cond); local 1282 targ_bb[i] = EDGE_SUCC (cond_bb, i)->dest; 1321 return EDGE_SUCC (cond_bb, invar[0] ? 0 : 1); 1330 basic_block cond_bb = branch_edge->src; local 1331 unsigned branch = EDGE_SUCC (cond_bb, 1) == branch_edge; 1332 basic_block opposite_bb = EDGE_SUCC (cond_bb, !branch)->dest; 1352 gimple *stmt = last_stmt (cond_bb); 1477 basic_block cond_bb local [all...] |
H A D | ubsan.c | 800 basic_block cond_bb = e->src; local 802 basic_block then_bb = create_empty_bb (cond_bb); 803 add_bb_to_loop (then_bb, cond_bb->loop_father); 808 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); 818 e = find_edge (cond_bb, fallthru_bb); 826 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); 877 e = split_block (cond_bb, stmt); 1069 basic_block cond_bb = e->src; local 1071 basic_block then_bb = create_empty_bb (cond_bb); 1073 add_bb_to_loop (then_bb, cond_bb [all...] |
H A D | tree-ssa-ifcombine.c | 78 recognize_if_then_else (basic_block cond_bb, argument 83 if (EDGE_COUNT (cond_bb->succs) != 2) 87 t = EDGE_SUCC (cond_bb, 0); 88 e = EDGE_SUCC (cond_bb, 1); 642 the inner cond_bb having no side-effects. */ 680 by matching PHI arguments in the then_bb and the inner cond_bb 737 This requires a single predecessor of the inner cond_bb. */
|
H A D | value-prof.c | 1286 basic_block cond_bb, dcall_bb, icall_bb, join_bb = NULL; local 1293 cond_bb = gimple_bb (icall_stmt); 1326 /* Edge e_cd connects cond_bb to dcall_bb, etc; note the first letters. */ 1327 e_cd = split_block (cond_bb, cond_stmt); 1329 dcall_bb->count = cond_bb->count.apply_probability (prob); 1333 icall_bb->count = cond_bb->count - dcall_bb->count; 1351 join_bb->count = cond_bb->count; 1357 e_ci = make_edge (cond_bb, icall_bb, EDGE_FALSE_VALUE); 1512 basic_block cond_bb, icall_bb, vcall_bb, join_bb; local 1520 cond_bb [all...] |
H A D | gimple-loop-versioning.cc | 1708 basic_block cond_bb; local 1709 li.optimized_loop = loop_version (loop, cond, &cond_bb, 1731 gimple_stmt_iterator gsi = gsi_last_bb (cond_bb);
|
H A D | tree-complex.c | 1180 basic_block cond_bb local 1184 gimple_stmt_iterator cond_bb_gsi = gsi_last_bb (cond_bb); 1195 basic_block join_bb = single_succ_edge (cond_bb)->dest; 1198 /* We have a conditional block with some assignments in cond_bb. 1202 edge cond_to_join = single_succ_edge (cond_bb);
|
H A D | omp-expand.c | 684 basic_block cond_bb, then_bb, else_bb; local 703 cond_bb = e->src; 707 then_bb = create_empty_bb (cond_bb); 709 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); 710 set_immediate_dominator (CDI_DOMINATORS, else_bb, cond_bb); 713 gsi = gsi_start_bb (cond_bb); 724 make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); 725 make_edge (cond_bb, else_bb, EDGE_FALSE_VALUE); 726 add_bb_to_loop (then_bb, cond_bb->loop_father); 727 add_bb_to_loop (else_bb, cond_bb 8281 basic_block cond_bb, then_bb, else_bb; local [all...] |
H A D | tree-loop-distribution.c | 451 basic_block cond_bb = cd->get_edge_src (edge_n); local 452 gimple *stmt = last_stmt (cond_bb); 2678 basic_block cond_bb; local 2727 nloop = loop_version (loop, lhs, &cond_bb, prob, prob.invert (), 2749 gimple_stmt_iterator cond_gsi = gsi_last_bb (cond_bb);
|
H A D | asan.c | 2012 basic_block cond_bb = e->src; local 2014 basic_block then_bb = create_empty_bb (cond_bb); 2017 add_bb_to_loop (then_bb, cond_bb->loop_father); 2022 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); 2033 e = find_edge (cond_bb, fallthru_bb); 2041 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); 2047 return gsi_last_bb (cond_bb);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | cfgloopmanip.cc | 663 | | | cond_bb | 690 basic_block cond_bb, true_bb, false_bb, join_bb; local 696 cond_bb = split_edge (entry_edge); 698 /* Insert condition in cond_bb. */ 699 gsi = gsi_last_bb (cond_bb); 704 gsi = gsi_last_bb (cond_bb); 707 join_bb = split_edge (single_succ_edge (cond_bb)); 709 e_true = single_succ_edge (cond_bb); 712 e_false = make_edge (cond_bb, join_bb, 0); 720 set_immediate_dominator (CDI_DOMINATORS, cond_bb, entry_edg 1621 basic_block cond_bb; local [all...] |
H A D | tree-ssa-loop-split.cc | 620 basic_block cond_bb; local 622 class loop *loop2 = loop_version (loop1, cond, &cond_bb, 1321 basic_block cond_bb = gimple_bb (cond); local 1328 targ_bb[i] = EDGE_SUCC (cond_bb, i)->dest; 1367 return EDGE_SUCC (cond_bb, invar[0] ? 0 : 1); 1376 basic_block cond_bb = branch_edge->src; local 1377 unsigned branch = EDGE_SUCC (cond_bb, 1) == branch_edge; 1378 basic_block opposite_bb = EDGE_SUCC (cond_bb, !branch)->dest; 1398 gimple *stmt = last_stmt (cond_bb); 1523 basic_block cond_bb local [all...] |
H A D | tree-profile.cc | 427 basic_block cond_bb = split_edge (single_succ_edge (entry)); local 428 basic_block update_bb = split_edge (single_succ_edge (cond_bb)); 434 edge true_edge = single_succ_edge (cond_bb); 444 edge e = make_edge (cond_bb, single_succ_edge (update_bb)->dest, 456 gimple_stmt_iterator gsi = gsi_start_bb (cond_bb); 492 basic_block cond_bb = split_edge (single_succ_edge (entry)); local 493 basic_block update_bb = split_edge (single_succ_edge (cond_bb)); 499 edge true_edge = single_succ_edge (cond_bb); 503 = make_edge (cond_bb, single_succ_edge (update_bb)->dest, EDGE_FALSE_VALUE); 506 gimple_stmt_iterator gsi = gsi_start_bb (cond_bb); [all...] |
H A D | tree-ssa-phiopt.cc | 677 two_value_replacement (basic_block cond_bb, basic_block middle_bb, argument 693 gimple *stmt = last_stmt (cond_bb); 745 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge); 815 replace_phi_edge_with_variable (cond_bb, e1, phi, new_rhs); 954 match_simplify_replacement (basic_block cond_bb, basic_block middle_bb, argument 1025 stmt = last_stmt (cond_bb); 1029 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge); 1040 gsi = gsi_last_bb (cond_bb); 1063 replace_phi_edge_with_variable (cond_bb, e1, phi, result); 1275 value_replacement (basic_block cond_bb, basic_bloc argument 1756 minmax_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, gphi *phi, tree arg0, tree arg1) argument 2190 spaceship_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, gphi *phi, tree arg0, tree arg1) argument 2751 cond_removal_in_builtin_zero_pattern(basic_block cond_bb, basic_block middle_bb, edge e1, edge e2, gphi *phi, tree arg0, tree arg1) argument [all...] |
H A D | ubsan.cc | 803 basic_block cond_bb = e->src; 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); 821 e = find_edge (cond_bb, fallthru_bb); 829 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); 880 e = split_block (cond_bb, stmt); 1072 basic_block cond_bb = e->src; local 1074 basic_block then_bb = create_empty_bb (cond_bb); 1076 add_bb_to_loop (then_bb, cond_bb [all...] |
H A D | tree-ssa-ifcombine.cc | 80 recognize_if_then_else (basic_block cond_bb, argument 85 if (EDGE_COUNT (cond_bb->succs) != 2) 89 t = EDGE_SUCC (cond_bb, 0); 90 e = EDGE_SUCC (cond_bb, 1); 645 the inner cond_bb having no side-effects. */ 683 by matching PHI arguments in the then_bb and the inner cond_bb 740 This requires a single predecessor of the inner cond_bb. */
|
H A D | value-prof.cc | 1323 basic_block cond_bb, dcall_bb, icall_bb, join_bb = NULL; local 1330 cond_bb = gimple_bb (icall_stmt); 1363 /* Edge e_cd connects cond_bb to dcall_bb, etc; note the first letters. */ 1364 e_cd = split_block (cond_bb, cond_stmt); 1366 dcall_bb->count = cond_bb->count.apply_probability (prob); 1370 icall_bb->count = cond_bb->count - dcall_bb->count; 1388 join_bb->count = cond_bb->count; 1394 e_ci = make_edge (cond_bb, icall_bb, EDGE_FALSE_VALUE); 1549 basic_block cond_bb, icall_bb, vcall_bb, join_bb; local 1557 cond_bb [all...] |
H A D | gimple-loop-versioning.cc | 1688 basic_block cond_bb; local 1689 li.optimized_loop = loop_version (loop, cond, &cond_bb, 1711 gimple_stmt_iterator gsi = gsi_last_bb (cond_bb);
|
H A D | tree-complex.cc | 1190 basic_block cond_bb local 1194 gimple_stmt_iterator cond_bb_gsi = gsi_last_bb (cond_bb); 1207 basic_block join_bb = single_succ_edge (cond_bb)->dest; 1210 /* We have a conditional block with some assignments in cond_bb. 1214 edge cond_to_join = single_succ_edge (cond_bb);
|
H A D | asan.cc | 2403 basic_block cond_bb = e->src; local 2405 basic_block then_bb = create_empty_bb (cond_bb); 2408 add_bb_to_loop (then_bb, cond_bb->loop_father); 2413 e = make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); 2424 e = find_edge (cond_bb, fallthru_bb); 2432 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); 2438 return gsi_last_bb (cond_bb);
|
H A D | omp-expand.cc | 654 basic_block cond_bb, then_bb, else_bb; local 673 cond_bb = e->src; 677 then_bb = create_empty_bb (cond_bb); 679 set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); 680 set_immediate_dominator (CDI_DOMINATORS, else_bb, cond_bb); 683 gsi = gsi_start_bb (cond_bb); 694 make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); 695 make_edge (cond_bb, else_bb, EDGE_FALSE_VALUE); 696 add_bb_to_loop (then_bb, cond_bb->loop_father); 697 add_bb_to_loop (else_bb, cond_bb [all...] |
H A D | tree-loop-distribution.cc | 455 basic_block cond_bb = cd->get_edge_src (edge_n); local 456 gimple *stmt = last_stmt (cond_bb); 2707 basic_block cond_bb; 2756 nloop = loop_version (loop, lhs, &cond_bb, prob, prob.invert (), 2778 gimple_stmt_iterator cond_gsi = gsi_last_bb (cond_bb);
|
H A D | tree-vrp.cc | 2247 basic_block cond_bb = e->src; local 2248 gimple *stmt = last_stmt (cond_bb); 2664 basic_block cond_bb); 3649 basic_block cond_bb) 3666 || gimple_bb (use_stmt) != cond_bb) 3647 all_imm_uses_in_stmt_or_feed_cond(tree var, gimple *stmt, basic_block cond_bb) argument
|