Home
last modified time | relevance | path

Searched refs:Increasing (Results 1 – 15 of 15) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp1063 bool Increasing = MainLoopStructure.IndVarIncreasing; in calculateSubRanges() local
1072 if (Increasing) { in calculateSubRanges()
1256 bool Increasing = LS.IndVarIncreasing; in changeIterationSpaceEnd() local
1264 Increasing in changeIterationSpaceEnd()
1394 bool Increasing = MainLoopStructure.IndVarIncreasing; in run() local
1406 Increasing ? SR.LowLimit.hasValue() : SR.HighLimit.hasValue(); in run()
1408 Increasing ? SR.HighLimit.hasValue() : SR.LowLimit.hasValue(); in run()
1418 if (Increasing) in run()
1445 if (Increasing) in run()
H A DLoopPredication.cpp722 bool Increasing; in isSafeToTruncateWideIVType() local
723 if (!SE->isMonotonicPredicate(LatchCheck.IV, LatchCheck.Pred, Increasing)) in isSafeToTruncateWideIVType()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DLoopUnrollPeel.cpp200 bool Increasing; in countToEliminateCompares() local
202 !SE.isMonotonicPredicate(LeftAR, Pred, Increasing)) in countToEliminateCompares()
204 (void)Increasing; in countToEliminateCompares()
/freebsd-12.1/crypto/openssl/doc/man3/
H A DPKCS5_PBKDF2_HMAC.pod51 Increasing the B<iter> parameter slows down the algorithm which makes it
H A DEVP_BytesToKey.pod31 Increasing the B<count> parameter slows down the algorithm which makes it
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DScalarEvolution.h904 bool &Increasing);
1757 ICmpInst::Predicate Pred, bool &Increasing);
/freebsd-12.1/contrib/gcc/
H A Dparams.def152 the delay slot will be minimal so stop searching. Increasing
162 information. Increasing this arbitrarily chosen value means more
H A DChangeLog.gcc43151 alignment for amdfam10 architecture. Increasing the max loop
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DScalarEvolution.cpp9117 bool &Increasing) { in isMonotonicPredicate() argument
9118 bool Result = isMonotonicPredicateImpl(LHS, Pred, Increasing); in isMonotonicPredicate()
9129 assert(Increasing == !IncreasingSwapped && in isMonotonicPredicate()
9138 bool &Increasing) { in isMonotonicPredicateImpl() argument
9161 Increasing = Pred == ICmpInst::ICMP_UGT || Pred == ICmpInst::ICMP_UGE; in isMonotonicPredicateImpl()
9174 Increasing = Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE; in isMonotonicPredicateImpl()
9179 Increasing = Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SLE; in isMonotonicPredicateImpl()
9209 bool Increasing; in isLoopInvariantPredicate() local
9210 if (!isMonotonicPredicate(ArLHS, Pred, Increasing)) in isLoopInvariantPredicate()
9231 auto P = Increasing ? Pred : ICmpInst::getInversePredicate(Pred); in isLoopInvariantPredicate()
/freebsd-12.1/sys/i386/conf/
H A DNOTES886 # Set the number of PV entries per process. Increasing this can
/freebsd-12.1/contrib/gperf/doc/
H A Dgperf.texi1175 is 0. Increasing the initial value helps inflate the final table size,
/freebsd-12.1/contrib/gcc/doc/
H A Dinvoke.texi4629 Increasing this value can result in more inlined code at
5888 the number of edges incoming to each block. Increasing values mean
5915 will be minimal so stop searching. Increasing values mean more
5922 information. Increasing this arbitrarily chosen value means more
6025 (having cost of 1). Increasing this cost disqualifies inlining of non-leaf
6204 register. Increasing values mean more aggressive optimization, making the
6210 Increasing values mean more aggressive optimization, making the compile time
6232 consider at any given time during the first scheduling pass. Increasing
H A Dtm.texi5655 string move insn or a library call. Increasing the value will always
5680 or a library call. Increasing the value will always make code faster, but
/freebsd-12.1/contrib/binutils/gas/doc/
H A Das.texinfo590 @var{number}. Increasing this value can reduce the length of time it takes the
/freebsd-12.1/contrib/binutils/ld/
H A Dld.texinfo1941 close to @var{number}. Increasing this value can reduce the length of