Lines Matching full:edges
5395 of the edges that connect them. It is located in `tree-cfg.c' and
5648 * Split critical edges
5650 This pass identifies critical edges and inserts empty basic blocks
12107 freedom to move code across these edges. Therefore, the EH lowering
13833 always be exactly the number of incoming edges for the basic block
14851 the number of incoming edges to the basic block holding PHI.
14947 end up inserting PHI nodes in blocks that have one or more edges
14964 where not all edges carry a new replacement may lead to silent
15326 several back edges (latches) leading to the header from the inside of
15340 correctly for loops with multiple latch edges (the functions that only
15345 and reachable from its latch against the direction of edges in CFG. The
15387 loops with multiple latch edges will not be disambiguated. If a
15409 * `LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS': Basic blocks and edges in
15413 and edges that belong to natural loops that are in such an
15414 irreducible region (but it is set for the entry and exit edges of
15489 * `mark_loop_exit_edges': Marks all exit edges of all loops with
15501 * `get_loop_exit_edges': Enumerates the exit edges of a loop.
15545 times on one of the edges entering loop header, thus performing
15599 outside, or unless you manipulate loop exit edges (functions are
15963 basic blocks and edges represent possible transfer of control flow from
15970 * Edges:: Types of edges and their representation.
15976 File: gccint.info, Node: Basic Blocks, Next: Edges, Up: Control Flow
16064 File: gccint.info, Node: Edges, Next: Profile information, Prev: Basic Blocks, Up: Control Flow
16066 15.2 Edges
16069 Edges represent possible control flow transfers from the end of some
16071 predecessor of B, and B is a successor of A. Edges are represented in
16075 of the `basic_block' data type point to type-safe vectors of edges to
16078 When walking the edges in an edge vector, "edge iterators" should be
16084 first edge in a vector of edges.
16088 last edge in a vector of edges.
16119 edges in a sequence of predecessor or successor edges. It must not be
16137 reasons why edges may be created. The `flags' field of the `edge' data
16142 No type flags are set for edges corresponding to jump instructions.
16143 These edges are used for unconditional or conditional jumps and in
16149 Fall-thru edges are present in case where the basic block may
16151 edges have the `EDGE_FALLTHRU' flag set. Unlike other types of
16152 edges, these edges must come into the basic block immediately
16159 Exception handling edges represent possible control transfers from
16165 Exception edges have the `EDGE_ABNORMAL' and `EDGE_EH' flags set.
16170 not happen anyway. The edges can be eliminated via
16188 edges only exist in the RTL representation.
16191 Computed jumps contain edges to all labels in the function
16192 referenced from the code. All those edges have `EDGE_ABNORMAL'
16193 flag set. The edges used to represent computed jumps often cause
16196 flow graphs, so these edges need to be handled with special care.
16260 represented by edges with no flags set.
16264 File: gccint.info, Node: Profile information, Next: Maintaining the CFG, Prev: Edges, Up: Control Flow
16279 executions of basic blocks and edges back to the compiler while
16445 the flow of control, possibly eliminating some edges. This may for
16448 instruction to non-trapping while compiling Java. Updating of edges is
16451 `purge_dead_edges' on a given basic block to remove superfluous edges,
16455 this is best modeled as redirection of edges in the control flow graph
16469 For a global optimizer, a common operation is to split edges in the
40997 * computed jump: Edges. (line 128)
41336 * edge: Edges. (line 6)
41337 * edge in the flow graph: Edges. (line 6)
41338 * edge iterators: Edges. (line 15)
41341 * EDGE_ABNORMAL: Edges. (line 128)
41342 * EDGE_ABNORMAL, EDGE_ABNORMAL_CALL: Edges. (line 171)
41343 * EDGE_ABNORMAL, EDGE_EH: Edges. (line 96)
41344 * EDGE_ABNORMAL, EDGE_SIBCALL: Edges. (line 122)
41345 * EDGE_FALLTHRU, force_nonfallthru: Edges. (line 86)
41358 * ei_edge: Edges. (line 43)
41359 * ei_end_p: Edges. (line 27)
41360 * ei_last: Edges. (line 23)
41361 * ei_next: Edges. (line 35)
41362 * ei_one_before_end_p: Edges. (line 31)
41363 * ei_prev: Edges. (line 39)
41364 * ei_safe_safe: Edges. (line 47)
41365 * ei_start: Edges. (line 19)
41397 * exception handling: Edges. (line 96)
41425 * fall-thru: Edges. (line 69)
41530 * function entry point, alternate function entry point: Edges.
42208 * LABEL_ALTERNATE_NAME: Edges. (line 180)
42377 * may_trap_p, tree_could_trap_p: Edges. (line 115)
42538 * nonlocal goto handler: Edges. (line 171)
42763 * purge_dead_edges: Edges. (line 104)
42860 * REG_EH_REGION, EDGE_ABNORMAL_CALL: Edges. (line 110)
43082 * sibling call: Edges. (line 122)
44122 Node: Edges711883
