Home
last modified time | relevance | path

Searched refs:MA (Results 1 – 25 of 73) sorted by relevance

123

/llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/ConfusableTable/
H A Dconfusables.txt233 2000 ; 0020 ; MA #* (   → ) EN QUAD → SPACE #
234 2001 ; 0020 ; MA #* (   → ) EM QUAD → SPACE #
281 00B8 ; 002C ; MA #* ( ¸ → , ) CEDILLA → COMMA #
305 2236 ; 003A ; MA #* ( ∶ → : ) RATIO → COLON #
1044 02D8 ; 02C7 ; MA #* ( ˘ → ˇ ) BREVE → CARON #
2627 14AA ; 004C ; MA # ( ᒪ → L ) CANADIAN SYLLABICS MA → LATIN CAPITAL LETTER L #
2811 A4DF ; 004D ; MA # ( ꓟ → M ) LISU LETTER MA → LATIN CAPITAL LETTER M #
5648 114A7 ; 09AE ; MA # ( �� → ম ) TIRHUTA LETTER MA → BENGALI LETTER MA #
5743 0BF4 ; 0BAE 0BC0 ; MA #* ( ௴ → மீ ) TAMIL MONTH SIGN → TAMIL LETTER MA, TAMIL VOWEL SIGN II #
5808 0C2E ; 0C35 0C41 ; MA # ( మ → వు ) TELUGU LETTER MA → TELUGU LETTER VA, TELUGU VOWEL SIGN U #
[all …]
/llvm-project-15.0.7/polly/lib/Transform/
H A DSimplify.cpp73 return MA->isRead() && MA->isOriginalScalarKind(); in isImplicitRead()
81 return MA->isWrite() && MA->isOriginalScalarKind(); in isImplicitWrite()
271 if (MA->isRead()) { in removeOverwrites()
291 if (MA->isMustWrite()) { in removeOverwrites()
353 if (MA->isMustWrite() && (MA->isOriginalScalarKind() || in coalesceWrites()
421 MA = OtherMA; in coalesceWrites()
547 if (MA->isRead()) { in removeRedundantWrites()
590 if (!MA->isWrite()) in removeEmptyPartialAccesses()
628 if (UsedMA.count(MA)) in markAndSweep()
695 for (auto *MA : Stmt) in printAccesses() local
[all …]
H A DZoneAlgo.cpp300 if (!MA->isLatestArrayKind() || !MA->isMustWrite() || in onlySameValueWrites()
342 if (MA->isRead()) { in collectIncompatibleElts()
393 assert(MA->isRead()); in addArrayReadAccess()
449 assert(MA->isWrite()); in addArrayWriteAccess()
455 if (MA->isMustWrite()) in addArrayWriteAccess()
458 if (MA->isMayWrite()) in addArrayWriteAccess()
890 if (!MA) in isCompatibleAccess()
899 assert(MA->isRead()); in isNormalizable()
981 if (MA->isRead()) in computeCommon()
984 if (MA->isWrite()) in computeCommon()
[all …]
H A DMaximalStaticExpansion.cpp143 Reads.insert(MA); in isExpandable()
189 if (MA->isRead()) { in isExpandable()
207 if (MA->isMayWrite()) { in isExpandable()
214 if (MA->isMustWrite()) { in isExpandable()
215 Writes.insert(MA); in isExpandable()
225 if (MA->isRead()) { in isExpandable()
265 Reads.insert(MA); in isExpandable()
292 for (auto MA : Accesses) { in mapAccess() local
404 Writes.insert(MA); in expandPhi()
454 for (auto *MA : Stmt) in print() local
[all …]
H A DDeLICM.cpp561 if (!MA) { in isMappable()
588 auto *MA = S->getPHIRead(SAI); in isMappable() local
589 assert(MA); in isMappable()
1042 for (auto *MA : *Stmt) { in collapseScalarsToStore()
1045 if (!MA->isRead()) in collapseScalarsToStore()
1048 Worklist.push_back(MA); in collapseScalarsToStore()
1241 for (auto *MA : Stmt) { in greedyCollapse() local
1244 if (!MA->isWrite()) in greedyCollapse()
1247 if (MA->isMayWrite()) { in greedyCollapse()
1268 if (isScalarAccess(MA)) { in greedyCollapse()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DMemorySSA.cpp143 OS << "; " << *MA; in emitInstructionAnnot()
1649 *Accesses, [](const MemoryAccess &MA) { return isa<MemoryPhi>(MA); }); in insertIntoListsForBlock() argument
1654 *Defs, [](const MemoryAccess &MA) { return isa<MemoryPhi>(MA); }); in insertIntoListsForBlock() argument
1860 if (VMA->second == MA) in removeFromLookups()
1877 Defs->remove(*MA); in removeFromLists()
1887 Accesses->erase(MA); in removeFromLists()
2041 assert((!MA || (AL && (isa<MemoryUse>(MA) || DL))) && in verifyOrderingDominationAndDefUses()
2045 if (MA) { in verifyOrderingDominationAndDefUses()
2060 verifyUseInDefs(MA->getDefiningAccess(), MA); in verifyOrderingDominationAndDefUses()
2574 return MA; in getClobberingMemoryAccessBase()
[all …]
H A DMemorySSAUpdater.cpp153 if (!isa<MemoryUse>(MA)) { in getPreviousDefInBlock()
557 MemoryAccess *MA = nullptr; in onlySingleValue() local
560 if (!MA) in onlySingleValue()
562 else if (MA != Arg) in onlySingleValue()
565 return MA; in onlySingleValue()
1327 if (!isa<MemoryUse>(MA) && !MA->use_empty()) { in removeMemoryAccess()
1336 if (MA->hasValueHandle()) in removeMemoryAccess()
1342 while (!MA->use_empty()) { in removeMemoryAccess()
1355 MSSA->removeFromLookups(MA); in removeMemoryAccess()
1356 MSSA->removeFromLists(MA); in removeMemoryAccess()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DMemorySSA.h237 static void deleteNode(MemoryAccess *MA) { MA->deleteValue(); }
241 MA.print(OS);
265 return MA->getValueID() == MemoryUseVal || MA->getValueID() == MemoryDefVal;
407 setOperand(1, MA);
408 OptimizedID = MA->getID();
697 MD->setOptimized(MA);
1336 def_chain_iterator(T MA) : MA(MA) {}
1344 MA = MUD->getOptimized();
1348 MA = nullptr;
1354 bool operator==(const def_chain_iterator &O) const { return MA == O.MA; }
[all …]
/llvm-project-15.0.7/polly/lib/Support/
H A DVirtualInstruction.cpp193 assert(MA->isOriginalValueKind()); in isEscaping()
231 for (auto *MA : *Stmt) { in addAccessRoots()
232 if (!MA->isWrite()) in addAccessRoots()
236 if (MA->isLatestArrayKind()) in addAccessRoots()
237 RootAccs.push_back(MA); in addAccessRoots()
240 else if (MA->isLatestValueKind()) { in addAccessRoots()
241 if (Local || isEscaping(MA)) in addAccessRoots()
242 RootAccs.push_back(MA); in addAccessRoots()
246 else if (MA->isLatestExitPHIKind()) in addAccessRoots()
247 RootAccs.push_back(MA); in addAccessRoots()
[all …]
/llvm-project-15.0.7/polly/lib/CodeGen/
H A DBlockGenerators.cpp262 NewAccesses, MA.getId().release(), MA.getAccessValue()->getType()); in generateLocationAccessed()
560 for (MemoryAccess *MA : Stmt) { in generateScalarLoads()
561 if (MA->isOriginalArrayKind() || MA->isWrite()) in generateScalarLoads()
763 for (MemoryAccess *MA : Stmt) { in generateScalarStores()
764 if (MA->isOriginalArrayKind() || MA->isRead()) in generateScalarStores()
1331 if (MA->isArrayKind() || MA->isWrite()) in generateScalarVectorLoads()
1353 if (MA->isArrayKind() || MA->isRead()) in verifyNoScalarStores()
1666 if (MA->isAnyPHIKind()) { in getExitScalar()
1702 if (MA->isOriginalArrayKind() || MA->isRead()) in generateScalarStores()
1706 NewExitScalars[MA] = NewVal; in generateScalarStores()
[all …]
H A DIslNodeBuilder.cpp782 for (auto *MA : *Stmt) { in hasPartialAccesses()
872 for (auto *MA : *Stmt) { in createNewAccesses()
873 if (!MA->hasNewAccessRelation()) { in createNewAccesses()
875 if (!MA->isAffine()) in createNewAccesses()
888 assert(MA->isAffine() && in createNewAccesses()
894 if (MA->isRead()) { in createNewAccesses()
1273 MemoryAccess *MA = MAs.front(); in preloadInvariantEquivClass() local
1274 assert(MA->isArrayKind() && MA->isRead()); in preloadInvariantEquivClass()
1293 auto *SAI = MA->getScopArrayInfo(); in preloadInvariantEquivClass()
1330 for (const MemoryAccess *MA : MAs) { in preloadInvariantEquivClass() local
[all …]
/llvm-project-15.0.7/polly/include/polly/
H A DZoneAlgo.h186 void addArrayReadAccess(MemoryAccess *MA);
193 isl::union_map getWrittenValue(MemoryAccess *MA, isl::map AccRel);
195 void addArrayWriteAccess(MemoryAccess *MA);
231 isl::map getScatterFor(MemoryAccess *MA) const;
243 isl::set getDomainFor(MemoryAccess *MA) const;
248 isl::map getAccessRelationFor(MemoryAccess *MA) const;
348 bool isCompatibleAccess(MemoryAccess *MA);
365 bool isNormalizable(MemoryAccess *MA);
/llvm-project-15.0.7/polly/lib/Analysis/
H A DDependenceInfo.cpp128 for (MemoryAccess *MA : Stmt) in collectInfo()
129 if (MA->isReductionLike()) in collectInfo()
133 for (MemoryAccess *MA : Stmt) { in collectInfo()
155 accdom = tag(accdom, MA, Level); in collectInfo()
166 if (MA->isRead()) in collectInfo()
168 else if (MA->isMayWrite()) in collectInfo()
530 for (MemoryAccess *MA : Stmt) { in calculateDependences()
531 if (!MA->isReductionLike()) in calculateDependences()
575 for (MemoryAccess *MA : Stmt) { in calculateDependences()
576 if (!MA->isReductionLike()) in calculateDependences()
[all …]
H A DScopInfo.cpp1153 MA->realignParams(); in realignParams()
1269 if (MA->isRead() && MA->isOriginalValueKind()) { in removeAccessData()
1274 if (MA->isWrite() && MA->isOriginalValueKind()) { in removeAccessData()
1279 if (MA->isWrite() && MA->isOriginalAnyPHIKind()) { in removeAccessData()
1284 if (MA->isRead() && MA->isOriginalAnyPHIKind()) { in removeAccessData()
1302 if (Predicate(MA)) { in removeMemoryAccess()
1860 if (MA->isRead()) in isProfitable()
2231 return getAccessesOfType([](MemoryAccess &MA) { return MA.isMayWrite(); }); in getMayWrites() argument
2235 return getAccessesOfType([](MemoryAccess &MA) { return MA.isWrite(); }); in getWrites() argument
2239 return getAccessesOfType([](MemoryAccess &MA) { return MA.isRead(); }); in getReads() argument
[all …]
H A DScopBuilder.cpp2539 for (MemoryAccess *MA : Stmt) { in checkForReductions()
2540 if (MA == CandidatePair.first || MA == CandidatePair.second) in checkForReductions()
2823 auto *MA = InvMA.MA; in addInvariantLoads() local
2844 auto *MA = InvMA.MA; in addInvariantLoads() local
2892 MAs.push_front(MA); in addInvariantLoads()
3215 for (MemoryAccess *MA : Stmt) { in buildAliasGroupsForAccesses()
3216 if (MA->isScalarKind()) in buildAliasGroupsForAccesses()
3218 if (!MA->isRead()) in buildAliasGroupsForAccesses()
3312 if (!MA->isAffine()) { in buildAliasGroup()
3362 MemoryAccess *MA = *AGI; in splitAliasGroupsByDomain() local
[all …]
/llvm-project-15.0.7/libcxx/test/std/experimental/memory/memory.polymorphic.allocator.class/memory.polymorphic.allocator.mem/
H A Ddeallocate.pass.cpp61 constexpr std::size_t MA = alignof(std::max_align_t); in main() local
64 testForSizeAndAlign<1, MA>(); in main()
67 testForSizeAndAlign<73, MA>(); in main()
68 testForSizeAndAlign<13, MA>(); in main()
H A Dallocate.pass.cpp98 constexpr std::size_t MA = alignof(std::max_align_t); in main() local
101 testForSizeAndAlign<1, MA>(); in main()
104 testForSizeAndAlign<73, MA>(); in main()
105 testForSizeAndAlign<13, MA>(); in main()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPUMemoryUtils.cpp189 MemoryAccess *MA = WorkList.pop_back_val(); in isClobberedInFunction() local
190 if (!Visited.insert(MA).second) in isClobberedInFunction()
193 if (MSSA->isLiveOnEntryDef(MA)) in isClobberedInFunction()
196 if (MemoryDef *Def = dyn_cast<MemoryDef>(MA)) { in isClobberedInFunction()
209 const MemoryPhi *Phi = cast<MemoryPhi>(MA); in isClobberedInFunction()
/llvm-project-15.0.7/libcxx/test/std/utilities/utility/utility.swap/
H A Dswap_array.pass.cpp104 using MA = NoexceptMoveOnly[42]; in main() typedef
107 static_assert(can_swap<MA&>(), ""); in main()
111 MA ma; in main()
/llvm-project-15.0.7/clang/test/Tooling/
H A Dclang-diff-ast.cpp75 #define MA(a, b) (void)a, b macro
80 MA(1, 2); in macros()
/llvm-project-15.0.7/polly/lib/Exchange/
H A DJSONExporter.cpp160 for (MemoryAccess *MA : Stmt) { in getJSON()
163 access["kind"] = MA->isRead() ? "read" : "write"; in getJSON()
164 access["relation"] = MA->getAccessRelationStr(); in getJSON()
389 for (MemoryAccess *MA : Stmt) { in importAccesses()
409 isl_map *CurrentAccessMap = MA->getAccessRelation().release(); in importAccesses()
447 if (MA->isArrayKind()) { in importAccesses()
452 if (LoadInst *LoadI = dyn_cast<LoadInst>(MA->getAccessInstruction())) { in importAccesses()
456 dyn_cast<StoreInst>(MA->getAccessInstruction())) { in importAccesses()
514 if (MA->isRead() && in importAccesses()
533 MA->setNewAccessRelation(isl::manage(NewAccessMap)); in importAccesses()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp744 CC->setMemoryLeader(MA); in createMemoryClass()
749 auto *CC = getMemoryClass(MA); in ensureLeaderOfMemoryClass()
751 CC = createMemoryClass(MA); in ensureLeaderOfMemoryClass()
880 return MemoryToDFSNum(MA); in InstrToDFSNum()
891 return isa<MemoryUseOrDef>(MA) in MemoryToDFSNum()
1343 auto *CC = getMemoryClass(MA); in lookupMemoryLeader()
2091 if (isa<MemoryUse>(MA)) in markMemoryUsersTouched()
2093 for (auto U : MA->users()) in markMemoryUsersTouched()
2395 markMemoryUsersTouched(MA); in performCongruenceFinding()
2535 if (MA && !isa<MemoryUse>(MA)) { in processOutgoingEdges()
[all …]
H A DMemCpyOptimizer.cpp339 for (const MemoryAccess &MA : in accessedBetween() local
341 if (isModOrRefSet(AA.getModRefInfo(cast<MemoryUseOrDef>(MA).getMemoryInst(), in accessedBetween()
633 if (MemoryUseOrDef *MA = MSSAU->getMemorySSA()->getMemoryAccess(P)) { in moveUp() local
634 MemInsertPoint = cast<MemoryUseOrDef>(--MA->getIterator()); in moveUp()
639 if (MemoryUseOrDef *MA = MSSAU->getMemorySSA()->getMemoryAccess(&I)) { in moveUp() local
640 MemInsertPoint = MA; in moveUp()
651 if (MemoryUseOrDef *MA = MSSAU->getMemorySSA()->getMemoryAccess(I)) { in moveUp() local
652 MSSAU->moveAfter(MA, MemInsertPoint); in moveUp()
653 MemInsertPoint = MA; in moveUp()
1428 MemoryUseOrDef *MA = MSSA->getMemoryAccess(M); in processMemCpy() local
[all …]
/llvm-project-15.0.7/llvm/unittests/Support/
H A DAlignmentTest.cpp209 const MaybeAlign MA(ValidAlignments[I - 1]); in TEST() local
211 EXPECT_EQ(MA, MA); in TEST()
212 EXPECT_NE(MA, MB); in TEST()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DAlignment.h301 inline std::string DebugStr(const MaybeAlign &MA) { in DebugStr() argument
302 if (MA) in DebugStr()
303 return std::to_string(MA->value()); in DebugStr()

123