Lines Matching full:flow
95 * Control Flow:: Maintaining and manipulating the control flow graph.
4203 where flow analysis or alias analysis should show that certain code
5357 sharing clauses, exposing the control flow of most synchronization
5359 the control flow graph. The pass is located in `omp-low.c' and is
5369 * Lower control flow
5379 * Lower exception handling control flow
5383 explicitly represents the control flow involved. After this pass,
5385 statement that may have EH control flow semantics; examine
5387 semantics. Exact control flow may be extracted from
5392 * Build the control flow graph
5467 This pass performs a flow sensitive SSA-based points-to analysis.
5657 eliminate unnecessary control flow statements. It is located in
5664 data and control flow problem is solved. The code transformation
5827 * Cleanup control flow graph
5885 flow graph of a function by propagating constants into conditional
5909 or autodecrement addressing. The pass is located in `flow.c'.
5914 that are related by data flow into single instructions. It
8457 the flow graph (`tree-cfg.c') and OpenMP region building code
11220 Instruction patterns may not use them. Until the `flow' pass of the
11222 `flow' pass finds cases where registers are incremented or decremented
11439 flow past them. They are placed after unconditional jump
11573 This list is originally set up by the flow analysis pass; it is a null
11574 pointer until then. Flow only adds links for those data dependencies
11575 which can be used for instruction combination. For each insn, the flow
11634 used, and flow optimization to build an accurate flow graph.
11674 occurrences by OP. ("Validly" here refers to the data flow of the
12105 `TRY_FINALLY_EXPR' complicates the flow graph, since the cleanup needs
14371 File: gccint.info, Node: Tree SSA, Next: Control Flow, Prev: GIMPLE, Up: Top
14389 operands (except function calls), it has no control flow structures and
14420 Annotations are defined and documented in `tree-flow.h'.
14437 Data flow analysis and optimization is done on all tree nodes
14444 gather complete data flow information for a local scalar. On the other
14458 Virtual and real operands also have very different data flow
14797 Most of the tree optimizers rely on the data flow information provided
14822 Sometimes, flow
15144 3. Compute flow-sensitive aliases
15160 4. Compute flow-insensitive aliases
15287 File: gccint.info, Node: Loop Analysis and Representation, Next: Machine Desc, Prev: Control Flow, Up: Top
15334 correspond to sub-loops or to control flow in a single loop. This means
15406 loop without any control flow inside and with one exit consists of
15954 File: gccint.info, Node: Control Flow, Next: Loop Analysis and Representation, Prev: Tree SSA, Up: Top
15956 15 Control Flow Graph
15959 A control flow graph (CFG) is a data structure built on top of the
15961 abstracting the control flow behavior of a function that is being
15963 basic blocks and edges represent possible transfer of control flow from
15965 control flow graph are defined in `basic-block.h'.
15972 * Maintaining the CFG:: Keeping the control flow graph and up to date.
15976 File: gccint.info, Node: Basic Blocks, Next: Edges, Up: Control Flow
16028 block ends by control flow instruction or last instruction before
16064 File: gccint.info, Node: Edges, Next: Profile information, Prev: Basic Blocks, Up: Control Flow
16069 Edges represent possible control flow transfers from the end of some
16132 There are various reasons why control flow may transfer from one block
16145 they may be freely redirected when the flow graph is not in SSA
16164 exception needs to be handled as control flow instruction.
16196 flow graphs, so these edges need to be handled with special care.
16198 avoid such dense flow graphs by factoring computed jumps. For
16211 which has a much simpler flow graph:
16264 File: gccint.info, Node: Profile information, Next: Maintaining the CFG, Prev: Edges, Up: Control Flow
16273 profile within the flow graph. GCC can handle profile information
16318 basic block, i.e. the probability that control will flow along this
16327 flow graph is no longer maintained.
16329 The probability that control flow arrives via a given edge to its
16347 power of any frequency or probability in the flow graph, it is not
16352 File: gccint.info, Node: Maintaining the CFG, Next: Liveness information, Prev: Profile information, Up: Control Flow
16358 flow graph and all profile information up-to-date. Reconstruction of
16359 the control flow graph after each pass is not an option, since it may be
16364 `basic_block' and `edge' data types to represent control flow. Both
16380 it. However, in principle the control flow graph for the `tree'
16382 a function tree may be expanded without first building a flow graph
16398 iterators provide an integrated abstraction of the flow graph and the
16445 the flow of control, possibly eliminating some edges. This may for
16455 this is best modeled as redirection of edges in the control flow graph
16461 It is also possible that a pass has to insert control flow instruction
16470 flow graph and insert instructions on them. In the RTL representation,
16482 may be useful to find bugs in the control flow graph updating code.
16484 Note that at present, the representation of control flow in the `tree'
16490 File: gccint.info, Node: Liveness information, Prev: Maintaining the CFG, Up: Control Flow
16522 and partly in the flow graph. Local information is stored in the
21022 control flow is branched to the handler of an exception. There
21581 problems with flow analysis. So instead, a dummy `doloop' insn is
21597 flow pass.
22166 data flow in the program does not suggest that it should try them. For
22936 on the type of instruction being generated, not on data flow between the
34857 assure a steady flow of resources into making more free software.
35039 communication or control flow between those subprograms and other
36310 ignored for years, flow rewrite and lots of further stuff,
40776 * basic-block.h: Control Flow. (line 6)
40923 * CFG, Control Flow Graph: Control Flow. (line 6)
41344 * edge in the flow graph: Edges. (line 6)
41496 * flow-insensitive alias analysis: Alias analysis. (line 6)
41497 * flow-sensitive alias analysis: Alias analysis. (line 6)
44128 Node: Control Flow706323
