Lines Matching full:graph
90 * Control Flow:: Maintaining and manipulating the control flow graph.
3253 the control flow graph. The pass is located in `omp-low.c' and is
3286 * Build the control flow graph
3714 * Cleanup control flow graph
3763 flow graph of a function by propagating constants into conditional
5483 acyclic graph. (For example there may be many references to the integer
6209 the flow graph (`tree-cfg.c') and OpenMP region building code
6706 `TRY_FINALLY_EXPR' complicates the flow graph, since the cleanup needs
7410 Control Dependence Graph. ACM Transactions on Programming Languages
11268 accurate flow graph.
11588 13 Control Flow Graph
11591 A control flow graph (CFG) is a data structure built on top of the
11594 compiled. The CFG is a directed graph where the vertices represent
11597 control flow graph are defined in `basic-block.h'.
11604 * Maintaining the CFG:: Keeping the control flow graph and up to date.
11777 they may be freely redirected when the flow graph is not in SSA
11843 which has a much simpler flow graph:
11905 profile within the flow graph. GCC can handle profile information
11923 the graph.
11959 flow graph is no longer maintained.
11979 power of any frequency or probability in the flow graph, it is not
11990 flow graph and all profile information up-to-date. Reconstruction of
11991 the control flow graph after each pass is not an option, since it may be
12012 it. However, in principle the control flow graph for the `tree'
12014 a function tree may be expanded without first building a flow graph
12030 iterators provide an integrated abstraction of the flow graph and the
12087 this is best modeled as redirection of edges in the control flow graph
12102 flow graph and insert instructions on them. In the RTL representation,
12114 may be useful to find bugs in the control flow graph updating code.
12136 stream and partly in the flow graph. Local information is stored in
12143 Global liveness information is stored in the control flow graph. Each
12159 This scheme works reliably as long as no control flow graph
12161 flow graph changes is more difficult as normal iterative data flow
31899 * CFG, Control Flow Graph: Control Flow. (line 6)
32308 * edge in the flow graph: Edges. (line 6)