Home | History | Annotate | Download | only in info

Lines Matching full:flow

2705      because they require data flow information that is computed only
2724 computations may be deleted by data flow analysis before the
2822 flow-sensitive points-to information. Only warns when the
3514 variables you declared may not exist at all; flow of control may
3714 Add code so that program flow "arcs" are instrumented. During
3761 creates a program flow graph, then finds a spanning tree for the
3834 data flow analysis, to `FILE.116r.cfg'. `-df' and
3847 dumping after jump bypassing and control flow optimizations,
3935 Dump after the second flow pass, to `FILE.142r.flow2'.
3968 flow graph suitable for viewing with VCG to `FILE.PASS.vcg'.
4086 Dump the control flow graph of each function to a file. The
4090 Dump the control flow graph of each function to a file in VCG
4218 may have complicated control-flow). If N=6, the vectorizer
4246 point, control-flow and regions info. And for N over four,
5084 transformation simplifies the control flow of the function
5143 heuristics are based on the control flow graph. If some branch
5146 of the control flow graph, taking the `__builtin_expect' info into
5275 branch target is reached in the usual flow of the code.
5601 transformation simplifies the control flow of the function
5790 delay slot code is rewritten to maintain the control-flow
6103 `max-flow-memory-locations'
17941 control-flow will never reach the location of the instruction.) Note
19729 itself is not deleted. The compiler's data flow analysis is
19864 remains available for other uses in places where flow control determines
24610 Within either execution environment, a "thread" is a flow of
24665 A "thread" is a flow of control within the abstract machine.
26189 flow graph of the program) and also includes additional code in the
27836 assure a steady flow of resources into making more free software.
28923 ignored for years, flow rewrite and lots of further stuff,