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

/freebsd-9.3-release/contrib/gcc/
H A Dtree-ssa-phiopt.c382 edge true_edge, false_edge; local
427 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
469 || (e0 == false_edge && integer_zerop (arg0))
471 || (e1 == false_edge && integer_zerop (arg1)))
549 edge true_edge, false_edge; local
567 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
591 e = (TREE_CODE (cond) == NE_EXPR ? true_edge : false_edge);
628 edge true_edge, false_edge; local
660 extract_true_false_edges_from_block (cond_bb, &true_edge, &false_edge);
665 if (false_edge
880 edge true_edge, false_edge; local
[all...]
H A Dtree-ssa-uncprop.c88 edge false_edge; local
91 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
106 false_edge->aux = equivalency;
136 false_edge->aux = equivalency;
152 false_edge->aux = equivalency;
177 false_edge->aux = equivalency;
H A Dloop-unswitch.c404 edge entry, latch_edge, true_edge, false_edge, e; local
438 false_edge = FALLTHRU_EDGE (unswitch_on);
452 e->probability = false_edge->probability;
453 e->count = latch_edge->count * (false_edge->probability) / REG_BR_PROB_BASE;
475 remove_path (loops, false_edge);
H A Dcfgexpand.c1110 edge false_edge; local
1118 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1127 false_edge->flags &= ~EDGE_FALSE_VALUE;
1143 add_reg_br_prob_note (last, false_edge->probability);
1163 dest = false_edge->dest;
1164 redirect_edge_succ (false_edge, new_bb);
1165 false_edge->flags |= EDGE_FALLTHRU;
1166 new_bb->count = false_edge->count;
1167 new_bb->frequency = EDGE_FREQUENCY (false_edge);
H A Dtree-ssa-dom.c605 edge true_edge, false_edge; local
607 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
656 if (potentially_threadable_block (false_edge->dest))
662 edge_info = (struct edge_info *) false_edge->aux;
689 dom_thread_across_edge (walk_data, false_edge);
1325 edge false_edge; local
1327 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1339 edge_info = allocate_edge_info (false_edge);
1365 edge_info = allocate_edge_info (false_edge);
1379 edge_info = allocate_edge_info (false_edge);
[all...]
H A Dcfgloopmanip.c412 basic_block switch_bb, edge true_edge, edge false_edge,
446 loop_redirect_edge (false_edge, loop->header);
1299 edge entry, latch_edge, exit, true_edge, false_edge; local
1339 extract_cond_bb_edges (cond_bb, &true_edge, &false_edge);
1343 cond_bb, true_edge, false_edge,
1354 extract_cond_bb_edges (cond_bb, &true_edge, &false_edge);
1355 lv_flush_pending_stmts (false_edge);
411 loopify(struct loops *loops, edge latch_edge, edge header_edge, basic_block switch_bb, edge true_edge, edge false_edge, bool redirect_all_edges) argument
H A Dtree-cfg.c2176 edge true_edge, false_edge; local
2178 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
2181 return (zero_p (val) ? false_edge : true_edge);
3810 edge false_edge; local
3818 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
3820 if (!true_edge || !false_edge
3822 || !(false_edge->flags & EDGE_FALSE_VALUE)
3824 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
3840 if (!has_label_p (false_edge->dest,
5829 edge *false_edge)
5825 extract_true_false_edges_from_block(basic_block b, edge *true_edge, edge *false_edge) argument
[all...]
H A Dtree-if-conv.c265 edge true_edge, false_edge; local
272 &true_edge, &false_edge); local
282 add_to_dst_predicate_list (loop, false_edge, cond, c2, bsi);

Completed in 165 milliseconds