Lines Matching full:edge
3549 such that the edge is no longer critical. The pass is located in
6707 to appear on every edge out of the controlled block; this reduces the
6710 expressions by explicitly adding the cleanup to each edge. Rethrowing
7465 edge through which VAR flows.
7468 Returns the incoming edge for the Ith argument of PHI.
7965 way that each loop has only one entry edge, and additionally, the
7966 source block of this entry edge has only one successor. This
7968 loop, and ensures that the entry edge of the loop leads from its
7989 edge, this edge is stored in `single_exit' field of the loop
8028 * `single_exit': The exit edge of the loop, if the loop has exactly
8042 * `loop_latch_edge': Returns the latch edge of a loop.
8045 preheader edge of a loop.
8061 * `loop_exit_edge_p': Tests whether edge is an exit from a loop.
8097 * `loop_split_edge_with': Splits an edge, and places a specified RTL
8101 * `bsi_insert_on_edge_immediate_loop': Inserts code on edge,
8104 * `remove_path': Removes an edge and all blocks it dominates.
8110 * `split_loop_exit_edge': Splits exit edge of the loop, ensuring
11672 Before any edge is made "fall-thru", the existence of such construct in
11704 GCC with the `edge' data type. Each `edge' acts as a link between two
11705 basic blocks: the `src' member of an edge points to the predecessor
11710 When walking the edges in an edge vector, "edge iterators" should be
11711 used. Edge iterators are constructed using the `edge_iterator' data
11716 first edge in a vector of edges.
11720 last edge in a vector of edges.
11724 edge in an edge vector.
11728 second last edge in an edge vector.
11732 point to the next edge in the sequence.
11736 point to the previous edge in the sequence.
11739 This function returns the `edge' currently pointed to by an
11743 This function returns the `edge' currently pointed to by an
11746 existing code makes the assumption that a `NULL' edge indicates
11755 edge e;
11767 new basic block. In this case a "fall-thru" edge links the basic block
11769 reasons why edges may be created. The `flags' field of the `edge' data
11770 type is used to store information about the type of edge we are dealing
11771 with. Each edge is of one of the following types:
11801 exception edge. The opposite conversion is difficult, but should
11805 In the RTL representation, the destination of an exception edge is
11818 non-standard way and thus an edge to the exit must be present.
11871 receivers, an edge from the call to the label is created with the
11876 there is always an edge from the `ENTRY_BLOCK_PTR' to basic block
11889 instructions are used. This corresponds to the fall-thru edge
11947 Each edge also contains a branch probability field: an integer in the
11951 edge. The `EDGE_FREQUENCY' macro is available to compute how
11952 frequently a given edge is taken. There is a `count' field for each
11953 edge as well, representing same information as for a basic block.
11956 stream, but in the RTL representation the edge frequencies are
11961 The probability that control flow arrives via a given edge to its
11996 `basic_block' and `edge' data types to represent control flow. Both
12002 block splitting and merging, edge redirection and creating and deleting
12104 emits an instruction "on the edge", caching it for a later
12106 inserted instructions off the edge into the instruction stream
12110 iterator on an edge, and `bsi_commit_edge_inserts' which flushes the
17172 jump, -1 otherwise. To simplify recomputing of edge frequencies, the
22944 be considered live on entry to an exception edge.
26334 common destination of jumps and has no fallthru incoming edge.
32310 * edge: Edges. (line 6)
32311 * edge in the flow graph: Edges. (line 6)
32312 * edge iterators: Edges. (line 15)
32313 * edge splitting: Maintaining the CFG.
