Searched refs:AR (Results 76 - 100 of 307) sorted by relevance

1234567891011>>

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopSimplifyCFG.cpp697 LoopStandardAnalysisResults &AR,
700 if (AR.MSSA)
701 MSSAU = MemorySSAUpdater(AR.MSSA);
703 if (!simplifyLoopCFG(L, AR.DT, AR.LI, AR.SE,
712 if (AR.MSSA)
696 run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &LPMU) argument
H A DIndVarSimplify.cpp1896 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(SE->getSCEV(Phi)); local
1897 if (!AR || AR->getLoop() != L || !AR->isAffine())
1900 const SCEV *Step = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE));
1939 const auto *AR = cast<SCEVAddRecExpr>(SE->getSCEV(Phi)); local
1941 // AR may be a pointer type, while BECount is an integer type.
1942 // AR may be wider than BECount. With eq/ne tests overflow is immaterial.
1943 // AR may not be a narrower type, or we may never exit.
1944 uint64_t PhiWidth = SE->getTypeSizeInBits(AR
2004 const SCEVAddRecExpr *AR = cast<SCEVAddRecExpr>(SE->getSCEV(IndVar)); local
2134 const SCEVAddRecExpr *AR = cast<SCEVAddRecExpr>(SE->getSCEV(IncVar)); local
2780 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(ExitCount); local
2842 run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &) argument
[all...]
H A DLoopUnrollPass.cpp1338 LoopStandardAnalysisResults &AR,
1352 OldLoops.insert(AR.LI.begin(), AR.LI.end());
1356 bool Changed = tryToUnrollLoop(&L, AR.DT, &AR.LI, AR.SE, AR.TTI, AR.AC, ORE,
1396 SibLoops.append(AR.LI.begin(), AR
1337 run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &Updater) argument
[all...]
H A DLoopDataPrefetch.cpp76 bool isStrideLargeEnough(const SCEVAddRecExpr *AR, unsigned TargetMinStride);
153 bool LoopDataPrefetch::isStrideLargeEnough(const SCEVAddRecExpr *AR, argument
159 const auto *ConstStride = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE));
H A DSimpleLoopUnswitch.cpp2883 LoopStandardAnalysisResults &AR,
2910 if (AR.MSSA) {
2911 MSSAU = MemorySSAUpdater(AR.MSSA);
2913 AR.MSSA->verifyMemorySSA();
2915 if (!unswitchLoop(L, AR.DT, AR.LI, AR.AC, AR.TTI, NonTrivial, UnswitchCB,
2916 &AR.SE, MSSAU.hasValue() ? MSSAU.getPointer() : nullptr))
2919 if (AR
2882 run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &U) argument
[all...]
H A DLoopIdiomRecognize.cpp263 LoopStandardAnalysisResults &AR,
272 LoopIdiomRecognize LIR(&AR.AA, &AR.DT, &AR.LI, &AR.SE, &AR.TLI, &AR.TTI,
273 AR.MSSA, DL, ORE);
278 if (AR.MSSA)
262 run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &) argument
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DImplicitNullChecks.cpp317 for (MCRegAliasIterator AR(Reg, TRI, /*IncludeSelf*/ true); AR.isValid();
318 ++AR)
319 if (MBB->isLiveIn(*AR))
387 AliasResult AR = areMemoryOpsAliased(MI, PrevMI); local
388 if (AR == AR_WillAliasEverything)
390 if (AR == AR_MayAlias)
H A DRDFRegisters.cpp341 BitVector AR(PRI.getTRI().getNumRegs());
342 AliasedRegs(U, AR);
343 Regs &= AR;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DMemorySSA.cpp254 Optional<AliasResult> AR; member in struct:__anon3380::ClobberAlias
259 // Return a pair of {IsClobber (bool), AR (AliasResult)}. It relies on AR being
268 Optional<AliasResult> AR; local
282 AR = AA.alias(MemoryLocation(II->getArgOperand(1)), UseLoc);
283 return {AR != NoAlias, AR};
301 AR = isMustSet(I) ? MustAlias : MayAlias;
302 return {isModOrRefSet(I), AR};
310 AR
346 Optional<AliasResult> AR = MayAlias; member in struct:__anon3381::UpwardsMemoryQuery
547 Optional<AliasResult> AR; member in struct:__anon3382::ClobberWalker::UpwardsWalkResult
1300 Optional<AliasResult> AR; member in struct:llvm::MemorySSA::OptimizeUses::MemlocStackInfo
2178 OS << " " << *AR; local
2218 OS << " " << *AR; local
[all...]
H A DScalarEvolution.cpp272 const SCEVAddRecExpr *AR = cast<SCEVAddRecExpr>(this); local
273 OS << "{" << *AR->getOperand(0);
274 for (unsigned i = 1, e = AR->getNumOperands(); i != e; ++i)
275 OS << ",+," << *AR->getOperand(i);
277 if (AR->hasNoUnsignedWrap())
279 if (AR->hasNoSignedWrap())
281 if (AR->hasNoSelfWrap() &&
282 !AR->getNoWrapFlags((NoWrapFlags)(FlagNUW | FlagNSW)))
284 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false);
1177 // The recurrence AR ha
[all...]
H A DLoopNestAnalysis.cpp290 LoopStandardAnalysisResults &AR,
292 if (auto LN = LoopNest::getLoopNest(L, AR.SE))
289 run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &U) argument
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp646 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S))
647 L = AR->getLoop();
1138 static bool IsIncrementNSW(ScalarEvolution &SE, const SCEVAddRecExpr *AR) { argument
1139 if (!isa<IntegerType>(AR->getType()))
1142 unsigned BitWidth = cast<IntegerType>(AR->getType())->getBitWidth();
1143 Type *WideTy = IntegerType::get(AR->getType()->getContext(), BitWidth * 2);
1144 const SCEV *Step = AR->getStepRecurrence(SE);
1146 SE.getSignExtendExpr(AR, WideTy));
1148 SE.getSignExtendExpr(SE.getAddExpr(AR, Step), WideTy);
1152 static bool IsIncrementNUW(ScalarEvolution &SE, const SCEVAddRecExpr *AR) { argument
2355 generateOverflowCheck(const SCEVAddRecExpr *AR, Instruction *Loc, bool Signed) argument
[all...]
/freebsd-13-stable/contrib/capsicum-test/
H A Dmakefile33 $(AR) -rv libgtest.a gtest-all.o
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/
H A DRange.h125 raw_ostream &operator<<(raw_ostream &OS, const AddressRanges &AR);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/
H A DLegacyPassManager.cpp657 AnalysisResolver *AR = AnalysisPass->getResolver(); local
658 assert(AR && "Expected analysis resolver to exist.");
659 unsigned APDepth = AR->getPMDataManager().getDepth();
814 AnalysisResolver *AR = new AnalysisResolver(*DM); local
815 P->setResolver(AR);
1106 AnalysisResolver *AR = new AnalysisResolver(*this); local
1107 P->setResolver(AR);
1214 AnalysisResolver *AR = P->getResolver(); local
1215 assert(AR && "Analysis Resolver is not set");
1216 AR
1415 AnalysisResolver *AR = new AnalysisResolver(*FPM); local
1457 AnalysisResolver *AR = FP->getResolver(); local
[all...]
/freebsd-13-stable/contrib/bearssl/conf/
H A DUnix.mk45 AR = ar macro
H A DWin.mk46 AR = lib macro
/freebsd-13-stable/contrib/bmake/unit-tests/
H A Dcond-token-plain.exp35 CondParser_Eval: V${UNDEF}AR
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h94 LoopStandardAnalysisResults &AR, LPMUpdater &) {
95 (void)AM.template getResult<AnalysisT>(L, AR);
93 run(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &) argument
/freebsd-13-stable/tools/build/mk/
H A DMakefile.boot13 AR:= /usr/bin/ar
/freebsd-13-stable/contrib/sqlite3/tea/
H A DMakefile.in167 AR = @AR@
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIVUsers.h196 LoopStandardAnalysisResults &AR);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/
H A DCodeCompleteConsumer.cpp664 AvailabilityResult AR = D->getAvailability(); local
666 AR = std::max(AR, cast<Decl>(D->getDeclContext())->getAvailability());
667 return AR;
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/
H A DPass.h135 void setResolver(AnalysisResolver *AR);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/MC/MCParser/
H A DAsmParser.cpp5922 const AsmRewrite &AR = *it; local
5924 if (AR.Done)
5926 AsmRewriteKind Kind = AR.Kind;
5928 const char *Loc = AR.Loc.getPointer();
5937 AsmStart = Loc + AR.Len;
5947 assert(AR.IntelExp.isValid() && "cannot write invalid intel expression");
5948 if (AR.IntelExp.NeedBracs)
5950 if (AR.IntelExp.hasBaseReg())
5951 OS << AR.IntelExp.BaseReg;
5952 if (AR
[all...]

Completed in 192 milliseconds

1234567891011>>