Searched refs:false_edge (Results 1 - 25 of 27) sorted by relevance

12

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-uncprop.c80 edge false_edge; local
84 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
118 false_edge->aux = equivalency;
134 false_edge->aux = equivalency;
159 false_edge->aux = equivalency;
H A Dsese.c306 edge false_edge = find_edge (pred_block, region_entry_dest); local
307 false_edge->flags &= ~EDGE_FALLTHRU;
308 false_edge->flags |= EDGE_FALSE_VALUE;
322 if_region->false_region->region.entry = false_edge;
H A Dtree-ssa-phiopt.c662 edge true_edge, false_edge;
663 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
666 ^ (e1 == false_edge))
755 edge true_edge, false_edge; local
815 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
817 || (e0 == false_edge && !integer_zerop (arg0))
819 || (e1 == false_edge && !integer_zerop (arg1)))
1067 edge true_edge, false_edge; local
1110 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
1131 e = (code == NE_EXPR ? true_edge : false_edge);
1377 edge true_edge, false_edge; local
1868 edge true_edge, false_edge; local
[all...]
H A Dcfgloopmanip.c862 basic_block switch_bb, edge true_edge, edge false_edge,
886 loop_redirect_edge (false_edge, loop->header);
1690 edge entry, latch_edge, true_edge, false_edge; local
1729 extract_cond_bb_edges (cond_bb, &true_edge, &false_edge);
1732 cond_bb, true_edge, false_edge,
1743 extract_cond_bb_edges (cond_bb, &true_edge, &false_edge);
1744 lv_flush_pending_stmts (false_edge);
861 loopify(edge latch_edge, edge header_edge, basic_block switch_bb, edge true_edge, edge false_edge, bool redirect_all_edges, profile_probability true_scale, profile_probability false_scale) argument
H A Dtree-ssa-threadedge.c1450 edge true_edge, false_edge; local
1452 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1462 if (potentially_threadable_block (false_edge->dest))
1463 thread_across_edge (dummy_cond, false_edge,
H A Dtree-ssa-dom.c488 edge false_edge; local
494 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
518 edge_info = new class edge_info (false_edge);
529 edge_info = new class edge_info (false_edge);
554 edge_info = new class edge_info (false_edge);
578 edge_info = new class edge_info (false_edge);
H A Dcfgexpand.c2431 edge false_edge; local
2500 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
2505 false_edge->flags &= ~EDGE_FALSE_VALUE;
2509 if (false_edge->dest == bb->next_bb)
2516 false_edge->flags |= EDGE_FALLTHRU;
2517 maybe_cleanup_end_of_block (false_edge, last);
2522 jumpifnot_1 (code, op0, op1, label_rtx_for_bb (false_edge->dest),
2523 false_edge->probability);
2525 if (false_edge->goto_locus != UNKNOWN_LOCATION)
2526 set_curr_insn_location (false_edge
[all...]
H A Dtree-switch-conversion.c2130 edge false_edge = split_block (bb, cond);
2131 false_edge->flags = EDGE_FALSE_VALUE;
2132 false_edge->probability = prob.invert ();
2137 return false_edge->dest;
2160 edge false_edge = split_block (bb, cond);
2161 false_edge->flags = EDGE_FALSE_VALUE;
2162 false_edge->probability = prob.invert ();
2167 return false_edge->dest;
2129 edge false_edge = split_block (bb, cond); local
2159 edge false_edge = split_block (bb, cond); local
H A Dtree-cfg.c2412 edge true_edge, false_edge; local
2428 &true_edge, &false_edge);
2430 return (integer_zerop (val) ? false_edge : true_edge);
5662 edge false_edge; local
5664 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
5667 || !false_edge
5669 || !(false_edge->flags & EDGE_FALSE_VALUE)
5671 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
9215 edge *false_edge)
9222 *false_edge
9212 extract_true_false_edges_from_block(basic_block b, edge *true_edge, edge *false_edge) argument
9244 edge true_edge, false_edge, tem; local
[all...]
H A Dgimple-pretty-print.c1088 edge e, true_edge = NULL, false_edge = NULL; local
1098 false_edge = e;
1102 bool has_edge_info = true_edge != NULL && false_edge != NULL;
1121 dump_edge_probability (buffer, false_edge);
2902 edge true_edge, false_edge; local
2909 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
2916 pp_cfg_jump (buffer, false_edge, flags);
H A Dipa-split.c357 edge true_edge, false_edge; local
370 extract_true_false_edges_from_block (use_bb, &true_edge, &false_edge);
378 forbidden_bb = false_edge->dest;
H A Dtree-if-conv.c1303 edge true_edge, false_edge; local
1312 &true_edge, &false_edge); local
1321 add_to_dst_predicate_list (loop, false_edge,
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dtree-ssa-uncprop.cc80 edge false_edge; local
84 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
118 false_edge->aux = equivalency;
134 false_edge->aux = equivalency;
159 false_edge->aux = equivalency;
H A Dsese.cc306 edge false_edge = find_edge (pred_block, region_entry_dest); local
307 false_edge->flags &= ~EDGE_FALLTHRU;
308 false_edge->flags |= EDGE_FALSE_VALUE;
322 if_region->false_region->region.entry = false_edge;
H A Dtree-ssa-loop-split.cc492 edge false_edge)
510 basic_block bbi_copy = get_bb_copy (false_edge->dest);
614 edge true_edge, false_edge; local
615 extract_true_false_edges_from_block (bbs[i], &true_edge, &false_edge);
647 fix_loop_bb_probability (loop1, loop2, true_edge, false_edge);
1586 edge true_edge, false_edge, skip_edge1, skip_edge2; local
1587 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
1589 skip_edge1 = true_invar ? false_edge : true_edge;
1590 skip_edge2 = true_invar ? true_edge : false_edge;
491 fix_loop_bb_probability(class loop *loop1, class loop *loop2, edge true_edge, edge false_edge) argument
H A Dgimple-if-to-switch.cc424 edge true_edge, false_edge; local
428 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
429 info->m_true_edge = in_p ? true_edge : false_edge;
430 info->m_false_edge = in_p ? false_edge : true_edge;
H A Dtree-ssa-phiopt.cc744 edge true_edge, false_edge;
745 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
748 ^ (e1 == false_edge))
960 edge true_edge, false_edge; local
1029 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
1030 if (e1 == true_edge || e0 == false_edge)
1280 edge true_edge, false_edge; local
1323 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
1354 e = (code == NE_EXPR ? true_edge : false_edge);
1693 if (((code == NE_EXPR && e1 == false_edge)
1760 edge true_edge, false_edge; local
[all...]
H A Dtree-ssa-threadedge.cc1213 edge true_edge, false_edge; local
1215 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1223 if (potentially_threadable_block (false_edge->dest))
1224 thread_across_edge (false_edge);
H A Dtree-ssa-dom.cc488 edge false_edge; local
494 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
518 edge_info = new class edge_info (false_edge);
529 edge_info = new class edge_info (false_edge);
554 edge_info = new class edge_info (false_edge);
578 edge_info = new class edge_info (false_edge);
H A Dcfgexpand.cc2548 edge false_edge; local
2625 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
2630 false_edge->flags &= ~EDGE_FALSE_VALUE;
2634 if (false_edge->dest == bb->next_bb)
2641 false_edge->flags |= EDGE_FALLTHRU;
2642 maybe_cleanup_end_of_block (false_edge, last);
2647 jumpifnot_1 (code, op0, op1, label_rtx_for_bb (false_edge->dest),
2648 false_edge->probability);
2650 if (false_edge->goto_locus != UNKNOWN_LOCATION)
2651 set_curr_insn_location (false_edge
[all...]
H A Dtree-switch-conversion.cc2167 edge false_edge = split_block (bb, cond);
2168 false_edge->flags = EDGE_FALSE_VALUE;
2169 false_edge->probability = prob.invert ();
2174 return false_edge->dest;
2197 edge false_edge = split_block (bb, cond);
2198 false_edge->flags = EDGE_FALSE_VALUE;
2199 false_edge->probability = prob.invert ();
2204 return false_edge->dest;
H A Dtree-cfg.cc2432 edge true_edge, false_edge; local
2448 &true_edge, &false_edge);
2450 return (integer_zerop (val) ? false_edge : true_edge);
5711 edge false_edge; local
5713 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
5716 || !false_edge
5718 || !(false_edge->flags & EDGE_FALSE_VALUE)
5720 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
9275 edge *false_edge)
9282 *false_edge
9272 extract_true_false_edges_from_block(basic_block b, edge *true_edge, edge *false_edge) argument
9304 edge true_edge, false_edge, tem; local
[all...]
H A Dgimple-pretty-print.cc1107 edge e, true_edge = NULL, false_edge = NULL; local
1117 false_edge = e;
1121 bool has_edge_info = true_edge != NULL && false_edge != NULL;
1140 dump_edge_probability (buffer, false_edge);
3011 edge true_edge, false_edge; local
3018 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
3025 pp_cfg_jump (buffer, false_edge, flags);
H A Dipa-split.cc357 edge true_edge, false_edge; local
370 extract_true_false_edges_from_block (use_bb, &true_edge, &false_edge);
378 forbidden_bb = false_edge->dest;
H A Dtree-if-conv.cc1315 edge true_edge, false_edge; local
1324 &true_edge, &false_edge); local
1333 add_to_dst_predicate_list (loop, false_edge,

Completed in 312 milliseconds

12