| /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
|
| loop-iv.cc | 2055 /* Transforms invariant IV into MODE. Adds assumptions based on the fact
2116 some assumptions to DESC). */
2309 /* The meaning of these assumptions is this:
2310 if !assumptions
2315 desc->assumptions = NULL_RTX;
2372 assumptions) to shape subreg (base + i * step). This function also fills
2429 /* Some more condition normalization. We must record some assumptions
2575 desc->assumptions = alloc_EXPR_LIST (0, may_xform,
2576 desc->assumptions);
2592 && !desc->assumptions)
[all...] |
| 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...] |
| loop-unroll.cc | 386 if (!desc->simple_p || !desc->const_iter || desc->assumptions)
706 if (!desc->simple_p || desc->assumptions)
1180 if (desc->simple_p && !desc->assumptions)
1265 /* We indeed may get here provided that there are nontrivial assumptions
|
| 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,
|
| loop-doloop.cc | 275 || desc->assumptions
539 /* Expand the condition testing the assumptions and if it does not pass,
|
| tree-vect-loop.cc | 852 niter information holds in ASSUMPTIONS.
858 vect_get_loop_niters (class loop *loop, const_edge main_exit, tree *assumptions,
867 *assumptions = boolean_true_node;
899 niter_assumptions = niter_desc.assumptions;
910 /* Try to combine may_be_zero with assumptions, this can simplify
935 /* Loop assumptions are based off the normal exit. */
936 *assumptions = niter_assumptions;
1734 niter could be analyzed under some assumptions. */
1840 /* Don't support analyzing niter under assumptions for inner
1842 if (!integer_onep (inner.assumptions))
[all...] |
| /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
|
| 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...] |
| loop-iv.cc | 2071 /* Transforms invariant IV into MODE. Adds assumptions based on the fact
2132 some assumptions to DESC). */
2325 /* The meaning of these assumptions is this:
2326 if !assumptions
2331 desc->assumptions = NULL_RTX;
2388 assumptions) to shape subreg (base + i * step). This function also fills
2445 /* Some more condition normalization. We must record some assumptions
2591 desc->assumptions = alloc_EXPR_LIST (0, may_xform,
2592 desc->assumptions);
2608 && !desc->assumptions)
[all...] |
| loop-unroll.cc | 386 if (!desc->simple_p || !desc->const_iter || desc->assumptions)
698 if (!desc->simple_p || desc->assumptions)
1172 if (desc->simple_p && !desc->assumptions)
1257 /* We indeed may get here provided that there are nontrivial assumptions
|
| 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,
|
| loop-doloop.cc | 275 || desc->assumptions
539 /* Expand the condition testing the assumptions and if it does not pass,
|
| tree-vect-loop.cc | 723 niter information holds in ASSUMPTIONS.
729 vect_get_loop_niters (class loop *loop, tree *assumptions,
737 *assumptions = boolean_true_node;
750 niter_assumptions = niter_desc.assumptions;
761 /* Try to combine may_be_zero with assumptions, this can simplify
786 *assumptions = niter_assumptions;
1339 niter could be analyzed under some assumptions. */
1425 /* Don't support analyzing niter under assumptions for inner
1427 if (!integer_onep (inner.assumptions))
1467 = vect_get_loop_niters (loop, &info->assumptions,
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| CodeMetrics.cpp | 76 for (auto &AssumeVH : AC->assumptions()) {
100 for (auto &AssumeVH : AC->assumptions()) {
|
| AssumptionCache.cpp | 190 // Any assumptions that affected this value now affect the new value.
231 // We expect the number of assumptions to be small, so in an asserts build
232 // check that we don't accumulate duplicates and that all assumptions point
257 OS << "Cached assumptions for function: " << F.getName() << "\n";
258 for (auto &VH : AC.assumptions())
306 for (auto &VH : I.second->assumptions())
|
| /src/sys/arch/atari/stand/tostools/libtos/ |
| bsdstart.S | 111 | Note that the above code makes assumptions about the order of the following
|
| /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...] |
| /src/external/bsd/file/dist/ |
| README.md | 72 * `src/ascmagic.c` - third & last set of tests, based on hardwired assumptions.
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| AlignmentFromAssumptions.cpp | 2 // Set Load/Store Alignments From Assumptions
13 // complex alignment assumptions that apply to vector loads and stores that
20 #define AA_NAME "alignment-from-assumptions"
43 "Number of loads changed by alignment assumptions");
45 "Number of stores changed by alignment assumptions");
47 "Number of memory intrinsics changed by alignment assumptions");
76 static const char aip_name[] = "Alignment from assumptions";
236 // Skip ConstantPointerNull and UndefValue. Assumptions on these shouldn't
334 for (auto &AssumeVH : AC.assumptions())
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| AssumeBundleBuilder.cpp | 350 for (Value *V : AC.assumptions()) {
|
| PredicateInfo.cpp | 531 for (auto &Assume : AC.assumptions()) {
|
| /src/sys/arch/mac68k/mac68k/ |
| macromasm.s | 404 * makes assumptions. If only it was consistent, Mac ROMs would be a
|
| /src/external/lgpl3/gmp/dist/mpn/ia64/ |
| mode1o.asm | 153 C Whether such a tradeoff is a win on average depends on assumptions about
|
| /src/external/gpl3/gdb/dist/gdb/ |
| amd64-tdep.c | 1250 operand in INSN. If !ASSUMPTIONS, only return the registers we actually
1255 bool assumptions = true)
1260 if (assumptions)
|
