Lines Matching defs:edge

68    Currently it does following: checks edge and basic block list correctness
108 edge e;
127 error ("verify_flow_info: Duplicate edge %i->%i",
133 error ("verify_flow_info: Wrong probability of edge %i->%i %i",
139 error ("verify_flow_info: Wrong count of edge %i->%i %i",
151 error ("verify_flow_info: Basic block %d succ edge is corrupted",
173 error ("basic block %d pred edge is corrupted", bb->index);
184 error ("basic block %d pred edge is corrupted", bb->index);
199 /* Complete edge checksumming for ENTRY and EXIT. */
201 edge e;
214 error ("basic block %i edge lists are corrupted", bb->index);
238 edge e;
277 /* Redirect edge E to the given basic block DEST and update underlying program
278 representation. Returns edge representing redirected branch (that may not
280 if edge is not easily redirectable for whatever reason. */
282 edge
283 redirect_edge_and_branch (edge e, basic_block dest)
285 edge ret;
296 /* Redirect the edge E to basic block DEST even if it requires creating
301 redirect_edge_and_branch_force (edge e, basic_block dest)
315 the labels). If I is NULL, splits just after labels. The newly created edge
318 edge
343 /* Splits block BB just after labels. The newly created edge is returned. */
345 edge
393 /* Splits edge E and returns the newly created basic block. */
396 split_edge (edge e)
401 edge f;
502 predict_edge (edge e, enum br_predictor predictor, int probability)
524 edge e;
562 part. Returns the edge connecting the entry part to the rest. */
564 edge
565 make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge),
568 edge e, fallthru;
619 tidy_fallthru_edge (edge e)
643 edge s;
652 out edge for the block which ended with the conditional
655 Furthermore, the edge will be marked as a fallthru because we
657 check that the edge is not a FALLTHRU edge. */
675 edge e;
693 /* Duplicates basic block BB and redirects edge E to it. Returns the
698 duplicate_block (basic_block bb, edge e, basic_block after)
700 edge s, n;
809 /* This function is called immediately after edge E is added to the
810 edge vector E->dest->preds. */
813 execute_on_growing_pred (edge e)
819 /* This function is called immediately before edge E is removed from
820 the edge vector E->dest->preds. */
823 execute_on_shrinking_pred (edge e)
833 lv_flush_pending_stmts (edge e)
847 cfg_hook_duplicate_loop_to_header_edge (struct loop *loop, edge e,
849 sbitmap wont_exit, edge orig,
850 edge *to_remove,
865 extract_cond_bb_edges (basic_block b, edge *e1, edge *e2)
875 basic_block new, edge e)