Home
last modified time | relevance | path

Searched refs:AR (Results 1 – 25 of 172) sorted by relevance

1234567

/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dstore-private.ll10 ; EG: MOV {{[\* ]*}}T(0 + AR.x).X+,
15 ; CM: MOV {{[\* ]*}}T(0 + AR.x).X+,
28 ; EG: MOVA_INT * AR.x (MASKED)
45 ; EG: MOV * T(0 + AR.x).X+, [[RES]]
59 ; EG: MOVA_INT * AR.x (MASKED)
74 ; EG: MOV * T(0 + AR.x).X+, [[RES]]
91 ; EG: MOV {{[\* ]*}}T(0 + AR.x).X+,
96 ; EG: MOV {{[\* ]*}}T(0 + AR.x).X+,
101 ; CM: MOV {{[\* ]*}}T(0 + AR.x).X+,
106 ; CM: MOV {{[\* ]*}}T(0 + AR.x).X+,
[all …]
/llvm-project-15.0.7/llvm/test/Object/
H A Dnm-universal-binary.test38 CHECK-AR: {{^$}}
41 CHECK-AR: 000000000000003b s L_.str
42 CHECK-AR: 0000000000000000 T _main
44 CHECK-AR: U _printf
46 CHECK-AR: 00000008 D _bar
47 CHECK-AR: 00000000 T _foo
49 CHECK-64-AR: {{^$}}
51 CHECK-64-AR: 00000008 D _bar
52 CHECK-64-AR: 00000000 T _foo
61 CHECK-AR-i386: 00000008 D _bar
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DIVUsers.cpp38 return IVUsers(&L, &AR.AC, &AR.LI, &AR.DT, &AR.SE); in run()
62 if (AR->getLoop() == L) in isInteresting()
63 return AR->isAffine() || in isInteresting()
65 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); in isInteresting()
69 return isInteresting(AR->getStart(), I, L, SE, LI) && in isInteresting()
212 auto *L = AR->getLoop(); in AddUsersIfInteresting()
343 if (AR->getLoop() == L) in findAddRecForLoop()
344 return AR; in findAddRecForLoop()
345 return findAddRecForLoop(AR->getStart(), L); in findAddRecForLoop()
351 return AR; in findAddRecForLoop()
[all …]
H A DLoopCacheAnalysis.cpp84 if (!AR || !AR->isAffine()) in isOneDimensionalArray()
90 const SCEV *Start = AR->getStart(); in isOneDimensionalArray()
91 const SCEV *Step = AR->getStepRecurrence(SE); in isOneDimensionalArray()
323 assert(AR && AR->getLoop() && "Expecting valid loop"); in computeRefCost()
500 if (AR && AR->getLoop() == &L) { in getSubscriptIndex()
510 return AR->getStepRecurrence(SE); in getLastCoefficient()
516 return (AR != nullptr) ? AR->getLoop() != &L in isCoeffForLoopZeroOrInvariant()
528 if (!AR->isAffine()) in isSimpleAddRecurrence()
531 const SCEV *Start = AR->getStart(); in isSimpleAddRecurrence()
592 return std::make_unique<CacheCost>(Loops, AR.LI, AR.SE, AR.TTI, AR.AA, DI, TRT); in getCacheCost()
[all …]
H A DScalarEvolutionNormalization.cpp48 NormalizeDenormalizeRewriter::visitAddRecExpr(const SCEVAddRecExpr *AR) { in visitAddRecExpr() argument
51 transform(AR->operands(), std::back_inserter(Operands), in visitAddRecExpr()
54 if (!Pred(AR)) in visitAddRecExpr()
55 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
94 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
100 auto Pred = [&](const SCEVAddRecExpr *AR) { in normalizeForPostIncUse() argument
101 return Loops.count(AR->getLoop()); in normalizeForPostIncUse()
114 auto Pred = [&](const SCEVAddRecExpr *AR) { in denormalizeForPostIncUse() argument
115 return Loops.count(AR->getLoop()); in denormalizeForPostIncUse()
H A DAliasAnalysisEvaluator.cpp41 static void PrintResults(AliasResult AR, bool P, in PrintResults() argument
61 AR.swap(); in PrintResults()
63 errs() << " " << AR << ":\t"; in PrintResults()
94 static inline void PrintLoadStoreResults(AliasResult AR, bool P, in PrintLoadStoreResults() argument
98 errs() << " " << AR << ": " << *V1 << " <-> " << *V2 << '\n'; in PrintLoadStoreResults()
141 switch (AR) { in runInternal()
143 PrintResults(AR, PrintNoAlias, *I1, *I2, F.getParent()); in runInternal()
147 PrintResults(AR, PrintMayAlias, *I1, *I2, F.getParent()); in runInternal()
155 PrintResults(AR, PrintMustAlias, *I1, *I2, F.getParent()); in runInternal()
168 switch (AR) { in runInternal()
[all …]
H A DAliasAnalysis.cpp451 switch (AR) { in operator <<()
463 if (AR.hasOffset()) in operator <<()
490 if (AR == AliasResult::NoAlias) in getModRefInfo()
492 if (AR == AliasResult::MustAlias) in getModRefInfo()
515 if (AR == AliasResult::NoAlias) in getModRefInfo()
524 if (AR == AliasResult::MustAlias) in getModRefInfo()
560 if (AR == AliasResult::NoAlias) in getModRefInfo()
634 if (AR == AliasResult::NoAlias) in getModRefInfo()
662 if (AR == AliasResult::NoAlias) in getModRefInfo()
753 AliasResult AR = alias( in callCapturesBefore() local
[all …]
H A DDDG.cpp309 LoopStandardAnalysisResults &AR) { in run() argument
311 DependenceInfo DI(F, &AR.AA, &AR.SE, &AR.LI); in run()
312 return std::make_unique<DataDependenceGraph>(L, AR.LI, DI); in run()
317 LoopStandardAnalysisResults &AR, in run() argument
320 OS << *AM.getResult<DDGAnalysis>(L, AR); in run()
/llvm-project-15.0.7/clang/unittests/AST/
H A DCommentParser.cpp121 if (!AR) in HasTextAt()
142 if (!AR) in HasTextWithNewlineAt()
165 if (!AR) in HasBlockCommandAt()
190 if (!AR) in HasParamCommandAt()
236 if (!AR) in HasTParamCommandAt()
267 if (!AR) in HasInlineCommandAt()
288 if (!AR) in HasInlineCommandAt()
306 if (!AR) in HasInlineCommandAt()
328 if (!AR) in HasHTMLStartTagAt()
348 if (!AR) in HasHTMLStartTagAt()
[all …]
/llvm-project-15.0.7/llvm/unittests/Transforms/Scalar/
H A DLoopPassManagerTest.cpp1021 AR.DT.changeImmediateDominator(AR.DT[NewLoop01LatchBB], NewDTNode); in TEST_F()
1167 AR.DT.changeImmediateDominator(AR.DT[&Loop02PHBB], NewDTNode); in TEST_F()
1200 Loop *NewLoops[] = {AR.LI.AllocateLoop(), AR.LI.AllocateLoop(), in TEST_F()
1231 AR.DT.changeImmediateDominator(AR.DT[&Loop0LatchBB], NewDTNode); in TEST_F()
1289 AR.DT.changeImmediateDominator(AR.DT[&Loop2PHBB], NewDTNode); in TEST_F()
1405 AR.DT.changeImmediateDominator(ChildNode, AR.DT[&IDomBB]); in TEST_F()
1406 AR.DT.eraseNode(LoopBB); in TEST_F()
1407 AR.LI.removeBlock(LoopBB); in TEST_F()
1413 AR.LI.erase(&L); in TEST_F()
1457 AR.SE.forgetLoop(&L); in TEST_F()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLoopRotation.cpp46 LoopStandardAnalysisResults &AR, in run() argument
56 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run()
59 if (AR.MSSA) in run()
60 MSSAU = MemorySSAUpdater(AR.MSSA); in run()
62 LoopRotation(&L, &AR.LI, &AR.TTI, &AR.AC, &AR.DT, &AR.SE, in run()
69 if (AR.MSSA && VerifyMemorySSA) in run()
70 AR.MSSA->verifyMemorySSA(); in run()
73 if (AR.MSSA) in run()
H A DLoopInstSimplify.cpp215 LoopStandardAnalysisResults &AR, in run() argument
218 if (AR.MSSA) { in run()
219 MSSAU = MemorySSAUpdater(AR.MSSA); in run()
221 AR.MSSA->verifyMemorySSA(); in run()
223 if (!simplifyLoopInst(L, AR.DT, AR.LI, AR.AC, AR.TLI, in run()
229 if (AR.MSSA) in run()
H A DLoopPassManager.cpp28 LoopStandardAnalysisResults &AR, LPMUpdater &U) { in run() argument
31 ? runWithLoopNestPasses(L, AM, AR, U) in run()
32 : runWithoutLoopNestPasses(L, AM, AR, U); in run()
69 LoopStandardAnalysisResults &AR, in runWithLoopNestPasses() argument
77 PassInstrumentation PI = AM.getResult<PassInstrumentationAnalysis>(L, AR); in runWithLoopNestPasses()
93 PassPA = runSinglePass(L, Pass, AM, AR, U, PI); in runWithLoopNestPasses()
101 LoopNestPtr = LoopNest::getLoopNest(L, AR.SE); in runWithLoopNestPasses()
104 PassPA = runSinglePass(*LoopNestPtr, Pass, AM, AR, U, PI); in runWithLoopNestPasses()
143 LoopStandardAnalysisResults &AR, in runWithoutLoopNestPasses() argument
149 PassInstrumentation PI = AM.getResult<PassInstrumentationAnalysis>(L, AR); in runWithoutLoopNestPasses()
[all …]
H A DLoopDeletion.cpp513 LoopStandardAnalysisResults &AR, in run() argument
523 auto Result = deleteLoopIfDead(&L, AR.DT, AR.SE, AR.LI, AR.MSSA, ORE); in run()
529 Result = merge(Result, breakBackedgeIfNotTaken(&L, AR.DT, AR.SE, AR.LI, in run()
530 AR.MSSA, ORE)); in run()
539 if (AR.MSSA) in run()
H A DLoopUnrollAndJamPass.cpp537 LoopStandardAnalysisResults &AR, in run() argument
541 DependenceInfo DI(&F, &AR.AA, &AR.SE, &AR.LI); in run()
544 if (!tryToUnrollAndJamLoop(LN, AR.DT, AR.LI, AR.SE, AR.TTI, AR.AC, DI, ORE, in run()
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DAssumeBundleQueriesTest.cpp523 ASSERT_EQ(AR.size(), 0u); in TEST()
525 ASSERT_EQ(AR.size(), 1u); in TEST()
526 ASSERT_EQ(AR[0].Index, 0u); in TEST()
529 ASSERT_EQ(AR.size(), 1u); in TEST()
533 ASSERT_EQ(AR.size(), 3u); in TEST()
534 llvm::sort(AR, in TEST()
543 ASSERT_EQ(AR.size(), 1u); in TEST()
548 ASSERT_EQ(AR.size(), 0u); in TEST()
550 ASSERT_EQ(AR.size(), 3u); in TEST()
551 llvm::sort(AR, in TEST()
[all …]
H A DAliasAnalysisTest.cpp331 const auto AR = AA.alias(Loc1, Loc2); in TEST_F() local
332 EXPECT_EQ(AR, AliasResult::PartialAlias); in TEST_F()
333 EXPECT_EQ(4, AR.getOffset()); in TEST_F()
361 auto AR = AA.alias(Loc1, Loc2); in TEST_F() local
362 EXPECT_EQ(AR, AliasResult::PartialAlias); in TEST_F()
363 EXPECT_EQ(1, AR.getOffset()); in TEST_F()
365 AR = AA.alias(Loc2, Loc1); in TEST_F()
366 EXPECT_EQ(AR, AliasResult::PartialAlias); in TEST_F()
367 EXPECT_EQ(-1, AR.getOffset()); in TEST_F()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DArrayRefTest.cpp81 ArrayRef<char> AR(nullptr, std::numeric_limits<ptrdiff_t>::max()); in TEST() local
84 EXPECT_EQ(1U, AR.drop_back(AR.size() - 1).size()); in TEST()
87 EXPECT_EQ(1U, AR.drop_front(AR.size() - 1).size()); in TEST()
90 EXPECT_EQ(1U, AR.slice(AR.size() - 1).size()); in TEST()
91 EXPECT_EQ(AR.size() - 1, AR.slice(1, AR.size() - 1).size()); in TEST()
269 auto AR = makeMutableArrayRef(A); in TEST() local
270 EXPECT_EQ(AR.data(), &A); in TEST()
271 EXPECT_EQ(AR.size(), (size_t)1); in TEST()
273 AR[0] = 1; in TEST()
/llvm-project-15.0.7/llvm/unittests/Transforms/Utils/
H A DScalarEvolutionExpanderTest.cpp266 EXPECT_TRUE(AR->isAffine()); in TEST_F()
515 auto *AR = GetAddRec(SE, Loop); in TEST_F() local
563 auto *AR = GetAddRec(SE, Loop); in TEST_F() local
648 auto *AR = GetAddRec(SE, Loop); in TEST_F() local
767 EXPECT_EQ(AR, ExpandedAR); in TEST_F()
803 auto *AR = GetAddRec(SE, Loop); in TEST_F() local
804 EXPECT_FALSE(AR->isAffine()); in TEST_F()
816 EXPECT_EQ(AR, ExpandedAR); in TEST_F()
861 auto *AR = GetAddRec(SE, Loop); in TEST_F() local
862 EXPECT_FALSE(AR->isAffine()); in TEST_F()
[all …]
/llvm-project-15.0.7/lld/test/ELF/
H A Darchive.s40 # RUN: llvm-nm %t.out | FileCheck --check-prefix=AR-FIRST %s
42 # AR-FIRST: T _start
43 # AR-FIRST-NEXT: w bar
44 # AR-FIRST-NEXT: T end
45 # AR-FIRST-NEXT: w foo
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonVExtract.cpp107 Register AR = in runOnMachineFunction() local
125 unsigned FiOpc = AR != 0 ? Hexagon::PS_fia : Hexagon::PS_fi; in runOnMachineFunction()
127 if (AR) in runOnMachineFunction()
128 MIB.addReg(AR); in runOnMachineFunction()
181 if (AR && MaxAlign) { in runOnMachineFunction()
183 MachineInstr *AlignaI = MRI.getVRegDef(AR); in runOnMachineFunction()
/llvm-project-15.0.7/llvm/unittests/DebugInfo/CodeView/
H A DRandomAccessVisitorTest.cpp71 Error visitKnownRecord(CVType &CVR, ArrayRecord &AR) override { in visitKnownRecord() argument
72 VisitedRecords.push_back(AR); in visitKnownRecord()
98 ArrayRecord AR(TypeRecordKind::Array); in SetUpTestCase() local
99 AR.ElementType = TypeIndex::Int32(); in SetUpTestCase()
100 AR.IndexType = TypeIndex::UInt32(); in SetUpTestCase()
101 AR.Size = I; in SetUpTestCase()
105 AR.Name = GlobalState->Strings.save(Stream.str()); in SetUpTestCase()
106 GlobalState->Records.push_back(AR); in SetUpTestCase()
107 GlobalState->Indices.push_back(Builder.writeLeafType(AR)); in SetUpTestCase()
/llvm-project-15.0.7/clang/lib/Sema/
H A DDelayedDiagnostic.cpp24 DelayedDiagnostic::makeAvailability(AvailabilityResult AR, in makeAvailability() argument
54 DD.AvailabilityData.AR = AR; in makeAvailability()
/llvm-project-15.0.7/polly/lib/CodeGen/
H A DCodeGeneration.cpp361 ScopStandardAnalysisResults &AR, in run() argument
363 auto &AI = SAM.getResult<IslAstAnalysis>(S, AR); in run()
364 if (generateCode(S, AI, AR.LI, AR.DT, AR.SE, AR.RI)) { in run()
/llvm-project-15.0.7/llvm/lib/ExecutionEngine/JITLink/
H A DJITLinkGeneric.cpp53 [S = std::move(Self)](AllocResult AR) mutable { in linkPhase1() argument
55 TmpSelf->linkPhase2(std::move(S), std::move(AR)); in linkPhase1()
60 AllocResult AR) { in linkPhase2() argument
62 if (AR) in linkPhase2()
63 Alloc = std::move(*AR); in linkPhase2()
65 return Ctx->notifyFailed(AR.takeError()); in linkPhase2()

1234567