| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-loop.h | 42 tree assumptions; /* The boolean expression. If this expression evaluates member in class:tree_niter_desc
51 a loop (provided that assumptions == true and
|
| cfgloop.h | 190 1) Compute niter->assumptions by calling niter analyzer API and
197 5) Version the loop with niter->assumptions computed in step 1).
198 6) Vectorize the versioned loop in which niter->assumptions is
282 /* Set if the loop is known to be finite without any assumptions. */
487 /* Assumptions under that the rest of the information is valid. */
488 rtx assumptions; variable
490 /* Assumptions under that the loop ends before reaching the latch,
|
| tree-ssa-loop-niter.cc | 968 NITER->assumptions to make sure this is the case). BNDS contains the
1115 assumptions for divisibility of c. */
1120 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
1121 niter->assumptions, assumption);
1140 of the step. The assumptions necessary to ensure that the computation
1227 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
1228 niter->assumptions,
1302 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
1303 niter->assumptions, assumption);
1425 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node
1444 tree step, num, assumptions, may_be_zero, span; local
2435 tree assumptions = fold_build2 (NE_EXPR, boolean_type_node, src, local
[all...] |
| tree-vectorizer.h | 2422 tree assumptions; member in struct:vect_loop_form_info
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-loop.h | 42 tree assumptions; /* The boolean expression. If this expression evaluates member in class:tree_niter_desc
51 a loop (provided that assumptions == true and
|
| cfgloop.h | 187 1) Compute niter->assumptions by calling niter analyzer API and
194 5) Version the loop with niter->assumptions computed in step 1).
195 6) Vectorize the versioned loop in which niter->assumptions is
279 /* Set if the loop is known to be finite without any assumptions. */
479 /* Assumptions under that the rest of the information is valid. */
480 rtx assumptions; variable
482 /* Assumptions under that the loop ends before reaching the latch,
|
| tree-ssa-loop-niter.cc | 980 NITER->assumptions to make sure this is the case). BNDS contains the
1129 assumptions for divisibility of c. */
1134 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
1135 niter->assumptions, assumption);
1154 of the step. The assumptions necessary to ensure that the computation
1242 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
1243 niter->assumptions,
1320 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
1321 niter->assumptions, assumption);
1443 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node
1462 tree step, num, assumptions, may_be_zero, span; local
[all...] |
| tree-vectorizer.h | 2289 tree assumptions; member in struct:vect_loop_form_info
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| AssumptionCache.h | 10 // the functions of a module (allowing assumptions within any function to be
36 /// This cache provides fast lookup of assumptions within a function by caching
38 /// that create new assumptions are required to call registerAssumption() to
57 /// The function for which this cache is handling assumptions.
59 /// We track this to lazily populate our assumptions.
82 /// information to the relevant set of assumptions.
88 /// Get the vector of assumptions which affect a value from the cache.
100 /// Scan the function for assumptions and add them to the cache.
146 MutableArrayRef<ResultElem> assumptions() { function
152 /// Access the list of assumptions which affect this value
[all...] |
