Lines Matching full:analysis
91 * Tree SSA:: Analysis and optimization of the tree representation.
92 * Loop Analysis and Representation:: Analysis and representation of loops
940 these, such as alias analysis, may work better when GCC is
2200 where flow analysis or alias analysis should show that certain code
3112 honor, (3) the language indicates that semantic analysis is not
3324 whose result is unused. It does not do memory life analysis, so
3369 This pass performs a flow sensitive SSA-based points-to analysis.
3370 The resulting may-alias, must-alias, and escape analysis
3449 loop, so that we can use just trivial invariantness analysis in
3456 analysis is necessary to determine the number of iterations.
3472 analysis.
3491 Analysis of data references is in `tree-data-ref.c'.
3752 analysis and manipulation code. Initialization and finalization
3780 * Life analysis
3875 information is not available, various types of static analysis are
3941 source program, GCC parses the program, performs semantic analysis
5851 which is preserved for the purposes of the RTL alias analysis.
5853 level alias analysis.
6257 File: gccint.info, Node: Tree SSA, Next: Loop Analysis and Representation, Prev: Control Flow, Up: Top
6259 10 Analysis and Optimization of GIMPLE Trees
6293 * Alias analysis:: Representing aliased loads and stores.
6493 alias analysis would not remember that the reference to `T1[2]' came
7029 Data flow analysis and optimization is done on all tree nodes
7380 this should be used only when absolutely required. Both alias analysis
7401 File: gccint.info, Node: SSA, Next: Alias analysis, Prev: Statement Operands, Up: Tree SSA
7676 File: gccint.info, Node: Alias analysis, Prev: SSA, Up: Tree SSA
7678 10.6 Alias analysis
7681 Alias analysis proceeds in 4 main phases:
7683 1. Structural alias analysis.
7718 2. Points-to and escape analysis.
7743 We use escape analysis to determine whether a variable is
7760 points-to analysis and create alias sets for the name memory tags
7789 After aliasing analysis has finished, the symbol memory tag for
7834 may-aliases set for T. Meaning that after alias analysis, we will
7885 File: gccint.info, Node: Loop Analysis and Representation, Next: Machine Desc, Prev: Tree SSA, Up: Top
7887 11 Analysis and Representation of Loops
7894 variable analysis and number of iterations analysis).
7898 * Loop representation:: Representation and analysis of loops.
7904 * Number of iterations:: Number of iterations analysis.
7905 * Dependency analysis:: Data dependency analysis.
7909 File: gccint.info, Node: Loop representation, Next: Loop querying, Up: Loop Analysis and Representation
7927 single latch. During loop analysis, headers of such loops are split and
7931 This means that the analysis sometimes changes the CFG, and if you run
8006 File: gccint.info, Node: Loop querying, Next: Loop manipulation, Prev: Loop representation, Up: Loop Analysis and Representation
8079 File: gccint.info, Node: Loop manipulation, Next: LCSSA, Prev: Loop querying, Up: Loop Analysis and Representation
8144 File: gccint.info, Node: LCSSA, Next: Scalar evolutions, Prev: Loop manipulation, Up: Loop Analysis and Representation
8159 * Many optimizations (value range analysis, final value replacement)
8164 * In induction variable analysis, it is not necessary to specify the
8165 loop in that the analysis should be performed - the scalar
8166 evolution analysis always returns the results with respect to the
8187 File: gccint.info, Node: Scalar evolutions, Next: loop-iv, Prev: LCSSA, Up: Loop Analysis and Representation
8193 variable analysis on GIMPLE. They enable us to represent variables with
8196 extend it). The interfaces to SCEV analysis are declared in
8197 `tree-scalar-evolution.h'. To use scalar evolutions analysis,
8199 should be used. SCEV analysis caches results in order to save time and
8210 use the results of SCEV only for some analysis, and when you work with
8248 File: gccint.info, Node: loop-iv, Next: Number of iterations, Prev: Scalar evolutions, Up: Loop Analysis and Representation
8250 11.6 IV analysis on RTL
8253 The induction variable on RTL is simple and only allows analysis of
8257 the analysis (possibly calling `iv_analysis_loop_init' for several
8259 functions can be used to access the results of the analysis:
8291 File: gccint.info, Node: Number of iterations, Next: Dependency analysis, Prev: loop-iv, Up: Loop Analysis and Representation
8293 11.7 Number of iterations analysis
8300 assumptions are satisfied. The analysis tries to verify these
8303 information and conditions are provided by the analysis:
8320 analysis framework to be initialized (SCEV on GIMPLE, loop-iv on RTL).
8343 File: gccint.info, Node: Dependency analysis, Next: Lambda, Prev: Number of iterations, Up: Loop Analysis and Representation
8345 11.8 Data Dependency Analysis
8348 The code for the data dependence analysis can be found in
8361 with the data references in the current analyzed loop, the analysis
8435 analysis has proved that there is no dependence between these two
8436 data references, `chrec_dont_know' if the analysis was not able to
8461 data dependence analysis are available: `dump_ddrs' prints with a
8469 File: gccint.info, Node: Lambda, Prev: Dependency analysis, Up: Loop Analysis and Representation
11186 This list is originally set up by the flow analysis pass; it is a null
11189 analysis pass adds a link to insns which store into registers values
11365 single operation for code motion purposes and flow analysis uses
11670 postponed until after liveness analysis. Thus the jump table vectors
12162 analysis may produce invalid results or get into an infinite cycle when
12169 File: gccint.info, Node: Machine Desc, Next: Target Macros, Prev: Loop Analysis and Representation, Up: Top
15159 analysis.
16706 problems with flow analysis. So instead, a dummy `doloop' insn is
23613 that alias analysis can understand machine-dependent addresses.
24334 requires analysis of dependencies. This hook can use backward and
29878 optimizations, improved alias analysis, plus migrating GCC to
30214 helping with analysis and improvements of x86 performance.
30289 analysis improvements, ISO C `restrict' support, and serving as
31611 * alias: Alias analysis. (line 6)
32100 * Data Dependency Analysis: Dependency analysis.
32450 * flow-insensitive alias analysis: Alias analysis. (line 6)
32451 * flow-sensitive alias analysis: Alias analysis. (line 6)
32759 * IV analysis on GIMPLE: Scalar evolutions. (line 6)
32760 * IV analysis on RTL: loop-iv. (line 6)
32868 * Loop analysis: Loop representation.
33128 * Number of iterations analysis: Number of iterations.
34412 Node: Alias analysis325108
34413 Node: Loop Analysis and Representation332287
34421 Node: Dependency analysis354054
