Lines Matching full:flow
3185 computations may be deleted by data flow analysis before the
3283 flow-sensitive points-to information. Only warns when the
3983 variables you declared may not exist at all; flow of control may
4225 Add code so that program flow "arcs" are instrumented. During
4272 creates a program flow graph, then finds a spanning tree for the
4344 Dump after jump bypassing and control flow optimizations.
4533 flow graph suitable for viewing with VCG to `FILE.PASS.vcg'.
4667 Dump the control flow graph of each function to a file. The
4671 Dump the control flow graph of each function to a file in VCG
4794 may have complicated control-flow). If N=6, the vectorizer
4823 than two, it includes RTL at abort point, control-flow and regions
5940 transformation simplifies the control flow of the function
6006 heuristics are based on the control flow graph. If some branch
6009 of the control flow graph, taking the `__builtin_expect' info into
6151 branch target is reached in the usual flow of the code.
6562 transformation simplifies the control flow of the function
6756 delay slot code is rewritten to maintain the control-flow
20849 control-flow will never reach the location of the instruction.) Note
22831 itself is not deleted. The compiler's data flow analysis is
22966 remains available for other uses in places where flow control determines
34536 Within either execution environment, a "thread" is a flow of
34591 A "thread" is a flow of control within the abstract machine.
36262 flow graph of the program) and also includes additional code in the
37898 assure a steady flow of resources into making more free software.
38080 communication or control flow between those subprograms and other
39351 ignored for years, flow rewrite and lots of further stuff,