Cross Reference: /external/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp

Lines Matching defs:Legal
258         Legal(nullptr) {}
262     Legal = L;
456   LoopVectorizationLegality *Legal;
840                              LoopVectorizationLegality *Legal,
843       : TheLoop(L), SE(SE), LI(LI), Legal(Legal), TTI(TTI), DL(DL), TLI(TLI) {}
912   LoopVectorizationLegality *Legal;
1585   if (Legal->hasStride(V))
1628   if (SI && Legal->blockNeedsPredication(SI->getParent()))
1636   int ConsecutiveStride = Legal->isConsecutivePtr(Ptr);
1638   bool UniformLoad = LI && Legal->isUniform(Ptr);
1647   if (Gep && Legal->isInductionVariable(Gep->getPointerOperand())) {
1699     assert(!Legal->isUniform(SI->getPointerOperand()) &&
1873   if (!Legal->mustCheckStrides())
1881   for (SmallPtrSet<Value *, 8>::iterator SI = Legal->strides_begin(),
1882                                          SE = Legal->strides_end();
1910   Legal->getRuntimePointerCheck();
2043   OldInduction = Legal->getInduction();
2044   Type *IdxTy = Legal->getWidestInductionType();
2258   LoopVectorizationLegality::InductionList *List = Legal->getInductionVars();
2643     assert(Legal->getReductionVars()->count(RdxPhi) &&
2646     (*Legal->getReductionVars())[RdxPhi];
2907   if (Legal->getReductionVars()->count(P)) {
2958   assert(Legal->getInductionVars()->count(P) &&
2962   Legal->getInductionVars()->lookup(P);
5170   if (OptForSize && Legal->getRuntimePointerCheck()->Need) {
5175   if (!EnableCondStoresVectorization && Legal->NumPredStores) {
5187   if (Legal->getMaxSafeDepDistBytes() != -1U)
5188     MaxSafeDepDist = Legal->getMaxSafeDepDistBytes() * 8;
5289         if (!Legal->getReductionVars()->count(PN))
5339   if (Legal->getMaxSafeDepDistBytes() != -1U)
5408   if (VF > 1 && Legal->getReductionVars()->size()) {
5416       (VF == 1 && Legal->getRuntimePointerCheck()->Need);
5430     unsigned StoresUF = UF / (Legal->NumStores ? Legal->NumStores : 1);
5431     unsigned LoadsUF = UF /  (Legal->NumLoads ? Legal->NumLoads : 1);
5588     if (VF == 1 && Legal->blockNeedsPredication(*bb))
5607                                               LoopVectorizationLegality *Legal,
5620         !Legal->isInductionVariable(Opd))
5650 static bool isStrideMul(Instruction *I, LoopVectorizationLegality *Legal) {
5651   if (Legal->hasStride(I->getOperand(0)) || Legal->hasStride(I->getOperand(1)))
5660   if (Legal->isUniformAfterVectorization(I))
5699     if (I->getOpcode() == Instruction::Mul && isStrideMul(I, Legal))
5756     int ConsecutiveStride = Legal->isConsecutivePtr(Ptr);
5762         isLikelyComplexAddressComputation(Ptr, Legal, SE, TheLoop);
5808         Legal->isInductionVariable(I->getOperand(0)))
5877     return Legal->isConsecutivePtr(ST->getPointerOperand()) != 0;
5881     return Legal->isConsecutivePtr(LI->getPointerOperand()) != 0;
6000   bool IfPredicateStore = (SI && Legal->blockNeedsPredication(SI->getParent()));