/freebsd-11-stable/lib/libc/stdlib/ |
H A D | a64l.c | 21 #define AA 65 /* ASCII 'A' */ macro 37 else if (*s <= AA + 25) 38 digit = *s - AA + 12;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | FlattenCFGPass.cpp | 39 AliasAnalysis *AA; member in struct:__anon2671::FlattenCFGPass 55 static bool iterativelyFlattenCFG(Function &F, AliasAnalysis *AA) { argument 73 if (FlattenCFG(BB, AA)) 82 AA = &getAnalysis<AAResultsWrapperPass>().getAAResults(); 85 while (iterativelyFlattenCFG(F, AA)) {
|
H A D | Sink.cpp | 60 static bool isSafeToMove(Instruction *Inst, AliasAnalysis &AA, argument 71 if (isModSet(AA.getModRefInfo(S, Loc))) 86 if (isModSet(AA.getModRefInfo(S, Call))) 141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { 150 if (!isSafeToMove(Inst, AA, Stores)) 200 AAResults &AA) { 228 if (SinkInstruction(Inst, Stores, DT, LI, AA)) { 240 LoopInfo &LI, AAResults &AA) { 248 MadeChange |= ProcessBlock(I, DT, LI, AA); 259 auto &AA local 139 SinkInstruction(Instruction *Inst, SmallPtrSetImpl<Instruction *> &Stores, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument 199 ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument 239 iterativelySinkInstructions(Function &F, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument 280 auto &AA = getAnalysis<AAResultsWrapperPass>().getAAResults(); variable [all...] |
H A D | MergeICmps.cpp | 219 bool canSplit(AliasAnalysis &AA) const; 226 AliasAnalysis &AA) const; 231 void split(BasicBlock *NewParent, AliasAnalysis &AA) const; 250 AliasAnalysis &AA) const { 260 if (isModSet(AA.getModRefInfo(Inst, LLoc)) || 261 isModSet(AA.getModRefInfo(Inst, RLoc))) 273 void BCECmpBlock::split(BasicBlock *NewParent, AliasAnalysis &AA) const { 280 assert(canSinkBCECmpInst(&Inst, BlockInsts, AA) && 293 bool BCECmpBlock::canSplit(AliasAnalysis &AA) const { 298 if (!canSinkBCECmpInst(&Inst, BlockInsts, AA)) 436 BCECmpChain(const std::vector<BasicBlock *> &Blocks, PHINode &Phi, AliasAnalysis &AA) argument 606 mergeComparisons(ArrayRef<BCECmpBlock> Comparisons, BasicBlock *const InsertBefore, BasicBlock *const NextCmpBlock, PHINode &Phi, const TargetLibraryInfo &TLI, AliasAnalysis &AA, DomTreeUpdater &DTU) argument 678 simplify(const TargetLibraryInfo &TLI, AliasAnalysis &AA, DomTreeUpdater &DTU) argument 794 processPhi(PHINode &Phi, const TargetLibraryInfo &TLI, AliasAnalysis &AA, DomTreeUpdater &DTU) argument 863 runImpl(Function &F, const TargetLibraryInfo &TLI, const TargetTransformInfo &TTI, AliasAnalysis &AA, DominatorTree *DT) argument 906 auto &AA = getAnalysis<AAResultsWrapperPass>().getAAResults(); variable 937 auto &AA = AM.getResult<AAManager>(F); local [all...] |
H A D | MergedLoadStoreMotion.cpp | 101 AliasAnalysis *AA = nullptr; member in class:__anon2737::MergedLoadStoreMotion 112 bool run(Function &F, AliasAnalysis &AA); 179 return AA->canInstructionRangeModRef(Start, End, Loc, ModRefInfo::ModRef); 198 if (AA->isMustAlias(Loc0, Loc1) && Store0->isSameOperationAs(Store1) && 347 bool MergedLoadStoreMotion::run(Function &F, AliasAnalysis &AA) { argument 348 this->AA = &AA; 418 auto &AA = AM.getResult<AAManager>(F); local 419 if (!Impl.run(F, AA))
|
H A D | DeadStoreElimination.cpp | 362 AliasAnalysis &AA, 377 if (P1 == P2 || AA.isMustAlias(P1, P2)) { 556 AliasAnalysis &AA) { 564 if (AA.isNoAlias(InstReadLoc, InstStoreLoc)) 585 if (DepReadLoc.Ptr && AA.isMustAlias(InstReadLoc.Ptr, DepReadLoc.Ptr)) 600 AliasAnalysis *AA) { 635 if (isModSet(AA->getModRefInfo(I, MemLoc))) 669 static bool handleFree(CallInst *F, AliasAnalysis *AA, argument 698 if (!AA->isMustAlias(F->getArgOperand(0), DepPointer)) 732 const DataLayout &DL, AliasAnalysis *AA, 355 isOverwrite(const MemoryLocation &Later, const MemoryLocation &Earlier, const DataLayout &DL, const TargetLibraryInfo &TLI, int64_t &EarlierOff, int64_t &LaterOff, Instruction *DepWrite, InstOverlapIntervalsTy &IOL, AliasAnalysis &AA, const Function *F) argument 730 removeAccessedObjects(const MemoryLocation &LoadedLoc, SmallSetVector<const Value *, 16> &DeadStackObjects, const DataLayout &DL, AliasAnalysis *AA, const TargetLibraryInfo *TLI, const Function *F) argument 762 handleEndBlock(BasicBlock &BB, AliasAnalysis *AA, MemoryDependenceResults *MD, const TargetLibraryInfo *TLI, InstOverlapIntervalsTy &IOL, OrderedBasicBlock &OBB, MapVector<Instruction *, bool> &ThrowableInst) argument 1017 removePartiallyOverlappedStores(AliasAnalysis *AA, const DataLayout &DL, InstOverlapIntervalsTy &IOL) argument 1041 eliminateNoopStore(Instruction *Inst, BasicBlock::iterator &BBI, AliasAnalysis *AA, MemoryDependenceResults *MD, const DataLayout &DL, const TargetLibraryInfo *TLI, InstOverlapIntervalsTy &IOL, OrderedBasicBlock &OBB, MapVector<Instruction *, bool> &ThrowableInst) argument 1089 eliminateDeadStores(BasicBlock &BB, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument 1339 eliminateDeadStores(Function &F, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument 1356 AliasAnalysis *AA = &AM.getResult<AAManager>(F); local 1387 AliasAnalysis *AA = &getAnalysis<AAResultsWrapperPass>().getAAResults(); local [all...] |
H A D | TailRecursionElimination.cpp | 329 static bool canMoveAboveCall(Instruction *I, CallInst *CI, AliasAnalysis *AA) { 343 if (isModSet(AA->getModRefInfo(CI, MemoryLocation::get(L))) || 503 AliasAnalysis *AA, OptimizationRemarkEmitter *ORE, DomTreeUpdater &DTU) { 523 if (canMoveAboveCall(&*BBI, CI, AA)) 691 AliasAnalysis *AA, OptimizationRemarkEmitter *ORE, DomTreeUpdater &DTU) { 727 ArgumentPHIs, AA, ORE, DTU); 740 AliasAnalysis *AA, OptimizationRemarkEmitter *ORE, DomTreeUpdater &DTU) { 746 ArgumentPHIs, AA, ORE, DTU); 750 AliasAnalysis *AA, 787 TTI, AA, OR [all...] |
H A D | MemCpyOptimizer.cpp | 437 static bool moveUp(AliasAnalysis &AA, StoreInst *SI, Instruction *P, argument 441 if (isModOrRefSet(AA.getModRefInfo(P, StoreLoc))) 465 bool MayAlias = isModOrRefSet(AA.getModRefInfo(C, None)); 471 NeedLift = llvm::any_of(MemLocs, [C, &AA](const MemoryLocation &ML) { 472 return isModOrRefSet(AA.getModRefInfo(C, ML)); 476 NeedLift = llvm::any_of(Calls, [C, &AA](const CallBase *Call) { 477 return isModOrRefSet(AA.getModRefInfo(C, Call)); 487 if (isModSet(AA.getModRefInfo(C, LoadLoc))) 491 if (isModOrRefSet(AA.getModRefInfo(P, Call))) 498 if (isModOrRefSet(AA 548 AliasAnalysis &AA = LookupAliasAnalysis(); local 623 AliasAnalysis &AA = LookupAliasAnalysis(); local 1090 AliasAnalysis &AA = LookupAliasAnalysis(); local 1221 AliasAnalysis &AA = LookupAliasAnalysis(); local [all...] |
H A D | LoopVersioningLICM.cpp | 146 AA = nullptr; 168 AliasAnalysis *AA = nullptr; member in struct:__anon2723::LoopVersioningLICM 339 if (!AA->doesNotAccessMemory(Call)) { 581 AA = &getAnalysis<AAResultsWrapperPass>().getAAResults(); 588 CurAST.reset(new AliasSetTracker(*AA));
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ProvenanceAnalysis.h | 52 AliasAnalysis *AA; member in class:llvm::objcarc::ProvenanceAnalysis 70 void setAA(AliasAnalysis *aa) { AA = aa; } 72 AliasAnalysis *getAA() const { return AA; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
H A D | CoroElide.cpp | 38 void elideHeapAllocations(Function *F, Type *FrameTy, AAResults &AA); 40 bool processCoroId(CoroIdInst *, AAResults &AA, DominatorTree &DT); 69 static bool operandReferences(CallInst *CI, AllocaInst *Frame, AAResults &AA) { argument 71 if (AA.alias(Op, Frame) != NoAlias) 79 static void removeTailCallAttribute(AllocaInst *Frame, AAResults &AA) { argument 83 if (Call->isTailCall() && operandReferences(Call, Frame, AA)) { 109 void Lowerer::elideHeapAllocations(Function *F, Type *FrameTy, AAResults &AA) { argument 142 removeTailCallAttribute(Frame, AA); 191 bool Lowerer::processCoroId(CoroIdInst *CoroId, AAResults &AA, argument 248 elideHeapAllocations(CoroId->getFunction(), FrameTy, AA); [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | DFAPacketizer.cpp | 107 AAResults *AA; member in class:llvm::DefaultVLIWScheduler 113 AAResults *AA); 131 AAResults *AA) 132 : ScheduleDAGInstrs(MF, &MLI), AA(AA) { 144 buildSchedGraph(AA); 150 : MF(mf), TII(mf.getSubtarget().getInstrInfo()), AA(aa) { 153 VLIWScheduler = new DefaultVLIWScheduler(MF, mli, AA); 293 AA->alias(MemoryLocation(Op1.getValue(), Overlapa, 129 DefaultVLIWScheduler(MachineFunction &MF, MachineLoopInfo &MLI, AAResults *AA) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LoopCacheAnalysis.h | 73 AliasAnalysis &AA) const; 81 DependenceInfo &DI, AliasAnalysis &AA) const; 121 bool isAliased(const IndexedReference &Other, AliasAnalysis &AA) const; 186 TargetTransformInfo &TTI, AliasAnalysis &AA, DependenceInfo &DI, 261 AliasAnalysis &AA;
|
H A D | Loads.h | 113 /// \param AA Optional pointer to alias analysis, to make the scan more 123 AliasAnalysis *AA = nullptr, 144 /// \param AA Optional pointer to alias analysis, to make the scan more 153 unsigned MaxInstsToScan, AliasAnalysis *AA,
|
H A D | AliasAnalysisEvaluator.h | 11 /// analysis result is a set of statistics of how many times the AA 16 /// algorithm, or the AA pipeline infrastructure itself. It acts like a stable 17 /// and easily tested consumer of all AA information exposed. 65 void runInternal(Function &F, AAResults &AA);
|
H A D | AliasSetTracker.h | 301 void addUnknownInst(Instruction *I, AliasAnalysis &AA); 319 const AAMDNodes &AAInfo, AliasAnalysis &AA) const; 320 bool aliasesUnknownInst(const Instruction *Inst, AliasAnalysis &AA) const; 346 AliasAnalysis &AA; member in class:llvm::AliasSetTracker 360 explicit AliasSetTracker(AliasAnalysis &aa) : AA(aa) {} 362 : AA(aa), MSSA(mssa), L(l) {} 401 AliasAnalysis &getAliasAnalysis() const { return AA; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGVLIW.cpp | 66 /// AA - AAResults for making memory reference queries. 67 AAResults *AA; member in class:__anon1819::ScheduleDAGVLIW 72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) { 98 BuildSchedGraph(AA); 275 return new ScheduleDAGVLIW(*IS->MF, IS->AA, new ResourcePriorityQueue(IS));
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FlattenCFG.cpp | 36 AliasAnalysis *AA; member in class:__anon2773::FlattenCFGOpt 56 FlattenCFGOpt(AliasAnalysis *AA) : AA(AA) {} argument 372 if (!AA || AA->alias(&*iter1, &*BI)) 499 bool llvm::FlattenCFG(BasicBlock *BB, AliasAnalysis *AA) { argument 500 return FlattenCFGOpt(AA).run(BB);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | AliasSetTracker.cpp | 66 AliasAnalysis &AA = AST.getAliasAnalysis(); local 71 if (AA.alias(MemoryLocation(L->getValue(), L->getSize(), L->getAAInfo()), 145 AliasAnalysis &AA = AST.getAliasAnalysis(); local 146 AliasResult Result = AA.alias( 174 void AliasSet::addUnknownInst(Instruction *I, AliasAnalysis &AA) { argument 201 AliasAnalysis &AA) const { 212 return AA.alias(MemoryLocation(SomePtr->getValue(), SomePtr->getSize(), 220 if (AliasResult AR = AA.alias( 230 AA.getModRefInfo(Inst, MemoryLocation(Ptr, Size, AAInfo)))) 238 AliasAnalysis &AA) cons [all...] |
H A D | LoopCacheAnalysis.cpp | 143 AliasAnalysis &AA) const { 146 if (BasePointer != Other.getBasePointer() && !isAliased(Other, AA)) { 200 AliasAnalysis &AA) const { 203 if (BasePointer != Other.getBasePointer() && !isAliased(Other, AA)) { 438 AliasAnalysis &AA) const { 441 return AA.isMustAlias(Loc1, Loc2); 457 AliasAnalysis &AA, DependenceInfo &DI, 461 LI(LI), SE(SE), TTI(TTI), AA(AA), DI(DI) { 491 return std::make_unique<CacheCost>(Loops, AR.LI, AR.SE, AR.TTI, AR.AA, D [all...] |
H A D | AliasAnalysis.cpp | 59 /// Allow disabling BasicAA from the AA results. This is particularly useful 60 /// when testing to isolate a single AA implementation. 66 for (auto &AA : AAs) 67 AA->setAAResults(this); 76 for (auto &AA : AAs) 77 AA->setAAResults(nullptr); 113 for (const auto &AA : AAs) { 114 auto Result = AA->alias(LocA, LocB, AAQI); 129 for (const auto &AA : AAs) 130 if (AA [all...] |
H A D | MemorySSA.cpp | 264 const Instruction *UseInst, AliasAnalysisType &AA) { 282 AR = AA.alias(MemoryLocation(II->getArgOperand(1)), UseLoc); 300 ModRefInfo I = AA.getModRefInfo(DefInst, UseCall); 309 ModRefInfo I = AA.getModRefInfo(DefInst, UseLoc); 318 AliasAnalysisType &AA) { 323 AA); 325 AA); 330 AliasAnalysis &AA) { 331 return instructionClobbersQuery(MD, MU, MemoryLocOrCall(MU), AA).IsClobber; 361 BatchAAResults &AA) { 263 instructionClobbersQuery(const MemoryDef *MD, const MemoryLocation &UseLoc, const Instruction *UseInst, AliasAnalysisType &AA) argument 315 instructionClobbersQuery(MemoryDef *MD, const MemoryUseOrDef *MU, const MemoryLocOrCall &UseMLOC, AliasAnalysisType &AA) argument 329 defClobbersUseOrDef(MemoryDef *MD, const MemoryUseOrDef *MU, AliasAnalysis &AA) argument 360 lifetimeEndsAt(MemoryDef *MD, const MemoryLocation &Loc, BatchAAResults &AA) argument 375 isUseTriviallyOptimizableToLiveOnEntry(AliasAnalysisType &AA, const Instruction *I) argument 400 checkClobberSanity(const MemoryAccess *Start, MemoryAccess *ClobberAt, const MemoryLocation &StartLoc, const MemorySSA &MSSA, const UpwardsMemoryQuery &Query, AliasAnalysisType &AA, bool AllowImpreciseClobber = false) argument 516 AliasAnalysisType &AA; member in class:__anon1641::ClobberWalker 926 ClobberWalker(const MemorySSA &MSSA, AliasAnalysisType &AA, DominatorTree &DT) argument 1225 MemorySSA(Function &Func, AliasAnalysis *AA, DominatorTree *DT) argument 1308 BatchAAResults *AA; member in class:llvm::MemorySSA::OptimizeUses 2252 auto &AA = AM.getResult<AAManager>(F); local 2296 auto &AA = getAnalysis<AAResultsWrapperPass>().getAAResults(); local [all...] |
H A D | Loads.cpp | 365 AliasAnalysis *AA, bool *IsLoad, 373 ScanFrom, MaxInstsToScan, AA, IsLoad, NumScanedInst); 380 AliasAnalysis *AA, bool *IsLoadCSE, 456 if (AA && !isModSet(AA->getModRefInfo(SI, StrippedPtr, AccessSize))) 468 if (AA && !isModSet(AA->getModRefInfo(Inst, StrippedPtr, AccessSize))) 361 FindAvailableLoadedValue(LoadInst *Load, BasicBlock *ScanBB, BasicBlock::iterator &ScanFrom, unsigned MaxInstsToScan, AliasAnalysis *AA, bool *IsLoad, unsigned *NumScanedInst) argument 376 FindAvailablePtrLoadStore(Value *Ptr, Type *AccessTy, bool AtLeastAtomic, BasicBlock *ScanBB, BasicBlock::iterator &ScanFrom, unsigned MaxInstsToScan, AliasAnalysis *AA, bool *IsLoadCSE, unsigned *NumScanedInst) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | DFAPacketizer.h | 116 AAResults *AA; member in class:llvm::VLIWPacketizerList 130 AAResults *AA);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyInstrInfo.h | 47 AAResults *AA) const override;
|