HomeSort by relevance Sort by last modified time
    Searched defs:TripCount (Results 1 - 7 of 7) sorted by null

  /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
LoopUnrollPass.cpp 148 unsigned TripCount = 0;
152 // via the loop latch on any iteration prior to TripCount. The loop may exit
156 TripCount = SE->getSmallConstantTripCount(L, LatchBlock);
161 TripCount = L->getSmallConstantTripCount();
162 if (TripCount == 0)
172 if (TripCount == 0)
174 Count = TripCount;
188 if (TripCount != 1 && Size > Threshold) {
196 // Reduce unroll count to be modulo of TripCount for partial unrolling
198 while (Count != 0 && TripCount%Count != 0)
    [all...]
  /external/llvm/unittests/Analysis/
UnrollAnalyzer.cpp 22 static unsigned TripCount = 0;
38 TripCount = SE->getSmallConstantTripCount(L, Exiting);
39 for (unsigned Iteration = 0; Iteration < TripCount; Iteration++) {
119 I1 = SimplifiedValuesVector[TripCount - 1].find(Y1);
120 EXPECT_TRUE(I1 != SimplifiedValuesVector[TripCount - 1].end());
121 EXPECT_EQ(cast<ConstantInt>((*I1).second)->getZExtValue(), TripCount);
124 I2 = SimplifiedValuesVector[TripCount - 1].find(Y2);
125 EXPECT_TRUE(I2 != SimplifiedValuesVector[TripCount - 1].end());
  /external/swiftshader/third_party/LLVM/lib/Analysis/
LoopInfo.cpp 208 Value* TripCount = this->getTripCount();
209 if (TripCount) {
210 if (ConstantInt *TripCountC = dyn_cast<ConstantInt>(TripCount)) {
230 Value* TripCount = this->getTripCount();
233 if (TripCount) {
235 Result = dyn_cast<ConstantInt>(TripCount);
238 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TripCount)) {
  /external/llvm/lib/Transforms/Utils/
LoopUnrollRuntime.cpp 406 /// extraiters = tripcount % loopfactor
412 /// if (tripcount < loopfactor) jump End:
418 /// extraiters = tripcount % loopfactor
419 /// if (tripcount < loopfactor) jump LoopExit:
420 /// unroll_iters = tripcount - extraiters
544 Value *TripCount = Expander.expandCodeFor(TripCountSC, TripCountSC->getType(),
551 // Note that TripCount is BECount + 1.
555 ModVal = B.CreateAnd(TripCount, Count - 1, "xtraiter");
558 // 2. The addition computing TripCount overflowed.
560 // If (2) is true, we know that TripCount really is (1 << BEWidth) and s
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopUnrollPass.cpp 235 analyzeLoopUnrollCost(const Loop *L, unsigned TripCount, DominatorTree &DT,
249 // Don't simulate loops with a big or unknown tripcount
250 if (!UnrollMaxIterationsCountToAnalyze || !TripCount ||
251 TripCount > UnrollMaxIterationsCountToAnalyze)
373 for (unsigned Iteration = 0; Iteration < TripCount; ++Iteration) {
518 AddCostRecursively(*OpI, TripCount - 1);
694 ScalarEvolution *SE, unsigned TripCount,
726 if (PragmaFullUnroll && TripCount != 0) {
727 UP.Count = TripCount;
741 if (ExplicitUnroll && TripCount != 0)
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonHardwareLoops.cpp     [all...]
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 297 OldInduction(nullptr), WidenMap(UnrollFactor), TripCount(nullptr),
591 Value *TripCount;
592 /// Trip count of the widened loop (TripCount - TripCount % (VF*UF))
    [all...]

Completed in 425 milliseconds