Lines Matching full:flow
92 * Control Flow:: Maintaining and manipulating the control flow graph.
4197 where flow analysis or alias analysis should show that certain code
5267 flow of most synchronization
5269 the control flow graph. The pass is located in `omp-low.c' and is
5279 * Lower control flow
5289 * Lower exception handling control flow
5293 explicitly represents the control flow involved. After this pass,
5295 statement that may have EH control flow semantics; examine
5297 semantics. Exact control flow may be extracted from
5302 * Build the control flow graph
5377 This pass performs a flow sensitive SSA-based points-to analysis.
5567 eliminate unnecessary control flow statements. It is located in
5574 data and control flow problem is solved. The code transformation
5737 * Cleanup control flow graph
5795 flow graph of a function by propagating constants into conditional
5819 or autodecrement addressing. The pass is located in `flow.c'.
5824 that are related by data flow into single instructions. It
8346 the flow graph (`tree-cfg.c') and OpenMP region building code
8491 File: gccint.info, Node: Tree SSA, Next: Loop Analysis and Representation, Prev: Control Flow, Up: Top
8509 operands (except function calls), it has no control flow structures and
8940 `TRY_FINALLY_EXPR' complicates the flow graph, since the cleanup needs
9248 are defined and documented in `tree-flow.h'.
9265 Data flow analysis and optimization is done on all tree nodes
9272 gather complete data flow information for a local scalar. On the other
9286 Virtual and real operands also have very different data flow
9625 Most of the tree optimizers rely on the data flow information provided
9650 Sometimes, flow of control makes it impossible to determine the most
9978 3. Compute flow-sensitive aliases
9994 4. Compute flow-insensitive aliases
10168 correspond to sub-loops or to control flow in a single loop. This means
10240 loop without any control flow inside and with one exit consists of
10788 File: gccint.info, Node: RTL, Next: Control Flow, Prev: Trees, Up: Top
13276 Instruction patterns may not use them. Until the `flow' pass of the
13278 `flow' pass finds cases where registers are incremented or decremented
13495 flow past them. They are placed after unconditional jump
13629 This list is originally set up by the flow analysis pass; it is a null
13630 pointer until then. Flow only adds links for those data dependencies
13631 which can be used for instruction combination. For each insn, the flow
13706 used, and flow optimization to build an accurate flow graph.
13746 occurrences by OP. ("Validly" here refers to the data flow of the
13812 single operation for code motion purposes and flow analysis uses
14043 File: gccint.info, Node: Control Flow, Next: Tree SSA, Prev: RTL, Up: Top
14045 13 Control Flow Graph
14048 A control flow graph (CFG) is a data structure built on top of the
14050 abstracting the control flow behavior of a function that is being
14052 basic blocks and edges represent possible transfer of control flow from
14054 control flow graph are defined in `basic-block.h'.
14061 * Maintaining the CFG:: Keeping the control flow graph and up to date.
14065 File: gccint.info, Node: Basic Blocks, Next: Edges, Up: Control Flow
14117 block ends by control flow instruction or last instruction before
14153 File: gccint.info, Node: Edges, Next: Profile information, Prev: Basic Blocks, Up: Control Flow
14158 Edges represent possible control flow transfers from the end of some
14221 There are various reasons why control flow may transfer from one block
14234 they may be freely redirected when the flow graph is not in SSA
14253 exception needs to be handled as control flow instruction.
14285 flow graphs, so these edges need to be handled with special care.
14287 avoid such dense flow graphs by factoring computed jumps. For
14300 which has a much simpler flow graph:
14353 File: gccint.info, Node: Profile information, Next: Maintaining the CFG, Prev: Edges, Up: Control Flow
14362 profile within the flow graph. GCC can handle profile information
14407 basic block, i.e. the probability that control will flow along this
14416 flow graph is no longer maintained.
14418 The probability that control flow arrives via a given edge to its
14436 power of any frequency or probability in the flow graph, it is not
14441 File: gccint.info, Node: Maintaining the CFG, Next: Liveness information, Prev: Profile information, Up: Control Flow
14447 flow graph and all profile information up-to-date. Reconstruction of
14448 the control flow graph after each pass is not an option, since it may be
14453 `basic_block' and `edge' data types to represent control flow. Both
14469 it. However, in principle the control flow graph for the `tree'
14471 a function tree may be expanded without first building a flow graph
14487 iterators provide an integrated abstraction of the flow graph and the
14534 the flow of control, possibly eliminating some edges. This may for
14544 this is best modeled as redirection of edges in the control flow graph
14550 It is also possible that a pass has to insert control flow instruction
14559 flow graph and insert instructions on them. In the RTL representation,
14571 may be useful to find bugs in the control flow graph updating code.
14573 Note that at present, the representation of control flow in the `tree'
14579 File: gccint.info, Node: Liveness information, Prev: Maintaining the CFG, Up: Control Flow
14611 and partly in the flow graph. Local information is stored in the
18993 control flow is branched to the handler of an exception. There
19552 problems with flow analysis. So instead, a dummy `doloop' insn is
19568 flow pass.
20137 data flow in the program does not suggest that it should try them. For
20893 on the type of instruction being generated, not on data flow between the
32256 assure a steady flow of resources into making more free software.
32438 communication or control flow between those subprograms and other
33709 ignored for years, flow rewrite and lots of further stuff,
38125 * basic-block.h: Control Flow. (line 6)
38266 * CFG, Control Flow Graph: Control Flow. (line 6)
38684 * edge in the flow graph: Edges. (line 6)
38833 * flow-insensitive alias analysis: Alias analysis. (line 6)
38834 * flow-sensitive alias analysis: Alias analysis. (line 6)
40981 Node: Control Flow626127
