/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | MemorySSA.h | 233 static void deleteNode(MemoryAccess *MA) { MA->deleteValue(); } argument 236 inline raw_ostream &operator<<(raw_ostream &OS, const MemoryAccess &MA) { argument 237 MA.print(OS); 260 static bool classof(const Value *MA) { argument 261 return MA->getValueID() == MemoryUseVal || MA->getValueID() == MemoryDefVal; 331 static bool classof(const Value *MA) { argument 332 return MA->getValueID() == MemoryUseVal; 391 static bool classof(const Value *MA) { argument 395 setOptimized(MemoryAccess *MA) argument 622 unorderedDeleteIncomingValue(const MemoryAccess *MA) argument 682 setOptimized(MemoryAccess *MA) argument 1024 MemoryAccess *MA = MSSA->getMemoryAccess(I); local 1277 def_chain_iterator(T MA) argument 1298 T MA; member in struct:llvm::def_chain_iterator 1303 def_chain(T MA, MemoryAccess *UpTo = nullptr) argument 1312 optimized_def_chain(T MA) argument [all...] |
H A D | MemorySSAUpdater.h | 224 if (MemoryAccess *MA = MSSA->getMemoryAccess(I)) 225 removeMemoryAccess(MA, OptimizePhis);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | MemorySSA.cpp | 109 if (MemoryAccess *MA = MSSA->getMemoryAccess(BB)) 110 OS << "; " << *MA << "\n"; variable 115 if (MemoryAccess *MA = MSSA->getMemoryAccess(I)) 116 OS << "; " << *MA << "\n"; variable 425 for (const auto *MA : def_chain(MAP.first)) { 426 if (MA == ClobberAt) { 427 if (const auto *MD = dyn_cast<MemoryDef>(MA)) { 447 assert(!MSSA.isLiveOnEntryDef(MA) && "Hit liveOnEntry before clobber?"); 449 if (const auto *MD = dyn_cast<MemoryDef>(MA)) { 460 if (const auto *MU = dyn_cast<MemoryUse>(MA)) { 1025 getClobberingMemoryAccess(MemoryAccess *MA, unsigned &UWL) argument 1028 getClobberingMemoryAccess(MemoryAccess *MA, const MemoryLocation &Loc, unsigned &UWL) argument 1061 getClobberingMemoryAccess(MemoryAccess *MA, unsigned &UWL) argument 1064 getClobberingMemoryAccess(MemoryAccess *MA, const MemoryLocation &Loc, unsigned &UWL) argument 1810 removeFromLookups(MemoryAccess *MA) argument 1837 removeFromLists(MemoryAccess *MA, bool ShouldDelete) argument 2000 MemoryUseOrDef *MA = getMemoryAccess(&I); local 2187 MemoryAccess *MA = cast<MemoryAccess>(Op); local 2360 getClobberingMemoryAccessBase( MemoryAccess *MA, unsigned &UpwardWalkLimit, bool SkipSelf) argument 2437 getClobberingMemoryAccess(MemoryAccess *MA) argument [all...] |
H A D | MemorySSAUpdater.cpp | 144 MemoryAccess *MemorySSAUpdater::getPreviousDef(MemoryAccess *MA) { argument 145 if (auto *LocalResult = getPreviousDefInBlock(MA)) 148 return getPreviousDefRecursive(MA->getBlock(), CachedPreviousDef); 154 MemoryAccess *MemorySSAUpdater::getPreviousDefInBlock(MemoryAccess *MA) { argument 155 auto *Defs = MSSA->getWritableBlockDefs(MA->getBlock()); 160 if (!isa<MemoryUse>(MA)) { 161 auto Iter = MA->getReverseDefsIterator(); 167 auto End = MSSA->getWritableBlockAccesses(MA->getBlock())->rend(); 168 for (auto &U : make_range(++MA->getReverseIterator(), End)) 171 // Note that if MA come 547 getNewDefiningAccessForClone(MemoryAccess *MA, const ValueToValueMapTy &VMap, PhiToDefMap &MPhiMap, bool CloneWasSimplified, MemorySSA *MSSA) argument 1233 MemoryAccess *MA = nullptr; local 1281 removeMemoryAccess(MemoryAccess *MA, bool OptimizePhis) argument 1371 MemoryAccess *MA = &*AB; local [all...] |
H A D | Loads.cpp | 135 MaybeAlign MA, 150 const Align Alignment = DL.getValueOrABITypeAlignment(MA, Ty); 134 isDereferenceableAndAlignedPointer(const Value *V, Type *Ty, MaybeAlign MA, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT) argument
|
H A D | ConstantFolding.cpp | 2533 APFloat MA(Sem), SC(Sem), TC(Sem); 2543 MA = S2; 2554 MA = S1; 2565 MA = S0; 2574 return MA + MA;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | NewGVN.cpp | 704 CongruenceClass *createMemoryClass(MemoryAccess *MA) { 706 CC->setMemoryLeader(MA); 710 CongruenceClass *ensureLeaderOfMemoryClass(MemoryAccess *MA) { 711 auto *CC = getMemoryClass(MA); 712 if (CC->getMemoryLeader() != MA) 713 CC = createMemoryClass(MA); 774 CongruenceClass *getMemoryClass(const MemoryAccess *MA) const; 846 unsigned InstrToDFSNum(const MemoryAccess *MA) const { 847 return MemoryToDFSNum(MA); 855 unsigned MemoryToDFSNum(const Value *MA) cons [all...] |
H A D | LoopInstSimplify.cpp | 139 if (MemoryAccess *MA = MSSA->getMemoryAccess(&I)) 141 MA->replaceAllUsesWith(ReplacementMA);
|
H A D | LICM.cpp | 316 for (const auto &MA : *Accesses) { 317 (void)MA; 1201 for (const auto &MA : *Accesses) 1202 if (const auto *MU = dyn_cast<MemoryUse>(&MA)) { 1213 } else if (const auto *MD = dyn_cast<MemoryDef>(&MA)) { 2228 for (const auto &MA : *Accesses) 2229 if (const auto *MD = dyn_cast<MemoryDef>(&MA))
|
H A D | DeadStoreElimination.cpp | 1532 MemoryAccess *MA = MSSA.getMemoryAccess(&I); local 1533 if (I.mayThrow() && !MA) 1536 auto *MD = dyn_cast_or_null<MemoryDef>(MA); 1963 if (MemoryAccess *MA = MSSA.getMemoryAccess(DeadInst)) { 1964 if (MemoryDef *MD = dyn_cast<MemoryDef>(MA)) { 1967 Updater.removeMemoryAccess(MA);
|
H A D | GVNHoist.cpp | 396 for (const MemoryAccess &MA : *Acc) 397 if (const MemoryUse *MU = dyn_cast<MemoryUse>(&MA)) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Alignment.h | 364 inline std::string DebugStr(const MaybeAlign &MA) { argument 365 if (MA) 366 return std::to_string(MA->value());
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | Function.h | 353 if (const auto MA = 355 return MA->value(); 455 if (const auto MA = getParamAlign(ArgNo)) 456 return MA->value();
|
H A D | IntrinsicInst.h | 402 if (auto MA = getParamAlign(ARG_DEST)) 403 return MA->value(); 467 if (auto MA = BaseCL::getParamAlign(ARG_SOURCE)) 468 return MA->value();
|
H A D | InstrTypes.h | 1597 if (const auto MA = Attrs.getRetAlignment()) 1598 return MA->value(); 1608 if (const auto MA = Attrs.getParamAlignment(ArgNo)) 1609 return MA->value();
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RDFGraph.cpp | 486 // Add node NA after member node MA in the given code node. 487 void CodeNode::addMemberAfter(NodeAddr<NodeBase*> MA, NodeAddr<NodeBase*> NA, argument 489 MA.Addr->append(NA); 490 if (Code.LastM == MA.Id) 496 NodeAddr<NodeBase*> MA = getFirstMember(G); local 497 assert(MA.Id != 0); 500 if (MA.Id == NA.Id) { 501 if (Code.LastM == MA.Id) { 506 Code.FirstM = MA.Addr->getNext(); 511 while (MA [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | AssumeBundleBuilder.cpp | 247 MaybeAlign MA) { 258 if (MA.valueOrOne() > 1) 260 {Attribute::Alignment, unsigned(MA.valueOrOne().value()), Pointer}); 246 addAccessedPtr(Instruction *MemInst, Value *Pointer, Type *AccType, MaybeAlign MA) argument
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonConstExtenders.cpp | 1986 const MachineInstr *MA = A.UseMI; 1988 if (MA == MB) { 1993 const MachineBasicBlock *BA = MA->getParent(); 1998 return MDT->dominates(MA, MB);
|
/freebsd-13-stable/sys/dev/sym/ |
H A D | sym_defs.h | 428 #define MA 0x80 /* sta: phase mismatch */ macro
|
/freebsd-13-stable/sys/cddl/dev/dtrace/x86/ |
H A D | dis_tables.c | 123 MA, enumerator in enum:__anon8768 2037 /* [4] */ TNS("mulb",MA), TNS("imulb",MA), TNS("divb",MA), TNS("idivb",MA), 2048 /* [4] */ TS("mul",MA), TS("imul",MA), TS("div",MA), TS("idiv",MA), 4472 case MA [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | RDFGraph.h | 601 void addMemberAfter(NodeAddr<NodeBase*> MA, NodeAddr<NodeBase*> NA,
|
/freebsd-13-stable/sys/contrib/ncsw/Peripherals/QM/ |
H A D | fsl_qman.h | 586 * MaxTH = MA * (2 ^ Mn) 594 volatile uint32_t MA:8; member in struct:qm_cgr_wr_parm::__anon9830::__anon9831
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | AttributorAttributes.cpp | 3545 MaybeAlign MA; local 3556 MA = MaybeAlign(AlignAA.getKnownAlign()); 3563 MA = SI->getAlign(); 3566 MA = LI->getAlign(); 3569 if (!MA || *MA <= 1) 3572 unsigned Alignment = MA->value();
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/MC/MCParser/ |
H A D | AsmParser.cpp | 298 bool parseMacroArgument(MCAsmMacroArgument &MA, bool Vararg); 2572 bool AsmParser::parseMacroArgument(MCAsmMacroArgument &MA, bool Vararg) { argument 2577 MA.emplace_back(AsmToken::String, Str); 2609 MA.push_back(getTok()); 2635 MA.push_back(getTok());
|
H A D | MasmParser.cpp | 553 bool parseMacroArgument(MCAsmMacroArgument &MA, bool Vararg); 2720 bool MasmParser::parseMacroArgument(MCAsmMacroArgument &MA, bool Vararg) { argument 2725 MA.emplace_back(AsmToken::String, Str); 2757 MA.push_back(getTok()); 2783 MA.push_back(getTok());
|