Searched refs:assumptions (Results 1 - 17 of 17) sorted by last modified time
/freebsd-11-stable/sys/netpfil/ipfw/ |
H A D | ip_fw2.c | 961 * can make some assumptions about contiguousness. 988 * can make some assumptions about contiguousness.
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | PredicateInfo.cpp | 507 for (auto &Assume : AC.assumptions()) {
|
H A D | CodeExtractor.cpp | 1614 for (auto AssumeVH : AC->assumptions()) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | AlignmentFromAssumptions.cpp | 13 // complex alignment assumptions that apply to vector loads and stores that 19 #define AA_NAME "alignment-from-assumptions" 41 "Number of loads changed by alignment assumptions"); 43 "Number of stores changed by alignment assumptions"); 45 "Number of memory intrinsics changed by alignment assumptions"); 74 static const char aip_name[] = "Alignment from assumptions"; 392 for (auto &AssumeVH : AC.assumptions())
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineSelect.cpp | 2772 if (!CondVal->getType()->isVectorTy() && !AC.assumptions().empty()) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 1784 // taken count for the loop. The exceptions are assumptions and 1790 !AC.assumptions().empty()) { 2135 // taken count for the loop. The exceptions are assumptions and 2142 !AC.assumptions().empty()) { 9565 for (auto &AssumeVH : AC.assumptions()) { 9720 for (auto &AssumeVH : AC.assumptions()) {
|
H A D | AssumptionCache.cpp | 163 // Any assumptions that affected this value now affect the new value. 207 // We expect the number of assumptions to be small, so in an asserts build 208 // check that we don't accumulate duplicates and that all assumptions point 233 OS << "Cached assumptions for function: " << F.getName() << "\n"; 234 for (auto &VH : AC.assumptions()) 282 for (auto &VH : I.second->assumptions())
|
H A D | CodeMetrics.cpp | 76 for (auto &AssumeVH : AC->assumptions()) { 100 for (auto &AssumeVH : AC->assumptions()) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | 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 42 /// The function for which this cache is handling assumptions. 44 /// We track this to lazily populate our assumptions. 67 /// information to the relevant set of assumptions. 73 /// Get the vector of assumptions which affect a value from the cache. 85 /// Scan the function for assumptions and add them to the cache. 131 MutableArrayRef<WeakTrackingVH> assumptions() { function in class:llvm::AssumptionCache 137 /// Access the list of assumptions whic [all...] |
/freebsd-11-stable/stand/pc98/kgzldr/ |
H A D | crt.s | 30 # Screen defaults and assumptions.
|
/freebsd-11-stable/stand/i386/kgzldr/ |
H A D | crt.s | 30 # Screen defaults and assumptions.
|
/freebsd-11-stable/contrib/gcc/ |
H A D | loop-doloop.c | 165 || desc->assumptions 380 /* Expand the condition testing the assumptions and if it does not pass,
|
H A D | loop-iv.c | 1810 /* Transforms invariant IV into MODE. Adds assumptions based on the fact 1871 some assumptions to DESC). */ 2004 /* The meaning of these assumptions is this: 2005 if !assumptions 2010 desc->assumptions = NULL_RTX; 2072 assumptions) to shape subreg (base + i * step). This function also fills 2126 /* Some more condition normalization. We must record some assumptions 2271 desc->assumptions = alloc_EXPR_LIST (0, may_xform, 2272 desc->assumptions); 2390 desc->assumptions [all...] |
H A D | loop-unroll.c | 365 || desc->assumptions 435 || desc->assumptions 583 if (!desc->simple_p || !desc->const_iter || desc->assumptions) 863 if (!desc->simple_p || desc->assumptions) 1197 if (desc->simple_p && !desc->assumptions && desc->const_iter) 1356 if (desc->simple_p && !desc->assumptions) 1450 /* We indeed may get here provided that there are nontrivial assumptions
|
H A D | tree-flow.h | 767 tree assumptions; /* The boolean expression. If this expression evaluates member in struct:tree_niter_desc 776 a loop (provided that assumptions == true and
|
H A D | tree-ssa-loop-niter.c | 134 NITER->assumptions to make sure this is the case). */ 187 assumptions for divisibility of c. */ 192 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, 193 niter->assumptions, assumption); 205 of the step. The assumptions necessary to ensure that the computation 266 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, 267 niter->assumptions, 339 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, 340 niter->assumptions, assumption); 398 niter->assumptions [all...] |
H A D | cfgloop.h | 330 rtx assumptions; member in struct:niter_desc
|
Completed in 234 milliseconds