Lines Matching full:edges
5305 of the edges that connect them. It is located in `tree-cfg.c' and
5558 * Split critical edges
5560 This pass identifies critical edges and inserts empty basic blocks
8942 freedom to move code across these edges. Therefore, the EH lowering
9679 the number of incoming edges to the basic block holding PHI.
9776 in blocks that have one or more edges with no incoming
9794 old name where not all edges carry a new replacement may lead to
10160 several back edges (latches) leading to the header from the inside of
10174 correctly for loops with multiple latch edges (the functions that only
10179 and reachable from its latch against the direction of edges in CFG. The
10221 loops with multiple latch edges will not be disambiguated. If a
10243 * `LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS': Basic blocks and edges in
10247 and edges that belong to natural loops that are in such an
10248 irreducible region (but it is set for the entry and exit edges of
10323 * `mark_loop_exit_edges': Marks all exit edges of all loops with
10335 * `get_loop_exit_edges': Enumerates the exit edges of a loop.
10379 times on one of the edges entering loop header, thus performing
10433 outside, or unless you manipulate loop exit edges (functions are
14052 basic blocks and edges represent possible transfer of control flow from
14059 * Edges:: Types of edges and their representation.
14065 File: gccint.info, Node: Basic Blocks, Next: Edges, Up: Control Flow
14153 File: gccint.info, Node: Edges, Next: Profile information, Prev: Basic Blocks, Up: Control Flow
14155 13.2 Edges
14158 Edges represent possible control flow transfers from the end of some
14160 predecessor of B, and B is a successor of A. Edges are represented in
14164 of the `basic_block' data type point to type-safe vectors of edges to
14167 When walking the edges in an edge vector, "edge iterators" should be
14173 first edge in a vector of edges.
14177 last edge in a vector of edges.
14208 edges in a sequence of predecessor or successor edges. It must not be
14226 reasons why edges may be created. The `flags' field of the `edge' data
14231 No type flags are set for edges corresponding to jump instructions.
14232 These edges are used for unconditional or conditional jumps and in
14238 Fall-thru edges are present in case where the basic block may
14240 edges have the `EDGE_FALLTHRU' flag set. Unlike other types of
14241 edges, these edges must come into the basic block immediately
14248 Exception handling edges represent possible control transfers from
14254 Exception edges have the `EDGE_ABNORMAL' and `EDGE_EH' flags set.
14259 not happen anyway. The edges can be eliminated via
14277 edges only exist in the RTL representation.
14280 Computed jumps contain edges to all labels in the function
14281 referenced from the code. All those edges have `EDGE_ABNORMAL'
14282 flag set. The edges used to represent computed jumps often cause
14285 flow graphs, so these edges need to be handled with special care.
14349 represented by edges with no flags set.
14353 File: gccint.info, Node: Profile information, Next: Maintaining the CFG, Prev: Edges, Up: Control Flow
14368 executions of basic blocks and edges back to the compiler while
14534 the flow of control, possibly eliminating some edges. This may for
14537 instruction to non-trapping while compiling Java. Updating of edges is
14540 `purge_dead_edges' on a given basic block to remove superfluous edges,
14544 this is best modeled as redirection of edges in the control flow graph
14558 For a global optimizer, a common operation is to split edges in the
38346 * computed jump: Edges. (line 128)
38683 * edge: Edges. (line 6)
38684 * edge in the flow graph: Edges. (line 6)
38685 * edge iterators: Edges. (line 15)
38688 * EDGE_ABNORMAL: Edges. (line 128)
38689 * EDGE_ABNORMAL, EDGE_ABNORMAL_CALL: Edges. (line 171)
38690 * EDGE_ABNORMAL, EDGE_EH: Edges. (line 96)
38691 * EDGE_ABNORMAL, EDGE_SIBCALL: Edges. (line 122)
38692 * EDGE_FALLTHRU, force_nonfallthru: Edges. (line 86)
38705 * ei_edge: Edges. (line 43)
38706 * ei_end_p: Edges. (line 27)
38707 * ei_last: Edges. (line 23)
38708 * ei_next: Edges. (line 35)
38709 * ei_one_before_end_p: Edges. (line 31)
38710 * ei_prev: Edges. (line 39)
38711 * ei_safe_safe: Edges. (line 47)
38712 * ei_start: Edges. (line 19)
38740 * exception handling <1>: Edges. (line 96)
38769 * fall-thru: Edges. (line 69)
38874 * function entry point, alternate function entry point: Edges.
39168 * LABEL_ALTERNATE_NAME: Edges. (line 180)
39332 * may_trap_p, tree_could_trap_p: Edges. (line 115)
39496 * nonlocal goto handler: Edges. (line 171)
39715 * purge_dead_edges <1>: Edges. (line 104)
39814 * REG_EH_REGION, EDGE_ABNORMAL_CALL: Edges. (line 110)
40038 * sibling call: Edges. (line 122)
40983 Node: Edges631666
