| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 69 LoopInfoBase<MachineBasicBlock, MachineLoop> LI;
82 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; }
88 inline iterator begin() const { return LI.begin(); }
89 inline iterator end() const { return LI.end(); }
90 bool empty() const { return LI.empty(); }
96 return LI.getLoopFor(BB);
102 return LI.getLoopFor(BB);
108 return LI.getLoopDepth(BB);
113 return LI.isLoopHeader(BB);
120 void releaseMemory() override { LI.releaseMemory();
[all...] |
| /external/llvm/lib/TableGen/ |
| StringMatcher.cpp | 106 for (std::map<char, std::vector<const StringPair*> >::iterator LI =
107 MatchesByLetter.begin(), E = MatchesByLetter.end(); LI != E; ++LI) {
109 OS << Indent << "case '" << LI->first << "':\t // "
110 << LI->second.size() << " string";
111 if (LI->second.size() != 1) OS << 's';
113 if (EmitStringMatcherForChar(LI->second, CharNo+1, IndentCount+1))
139 for (std::map<unsigned, std::vector<const StringPair*> >::iterator LI =
140 MatchesByLength.begin(), E = MatchesByLength.end(); LI != E; ++LI) {
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 69 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
71 if (!LI->isSimple()) return false;
318 static LoadInst *combineLoadToNewType(InstCombiner &IC, LoadInst &LI, Type *NewTy,
320 Value *Ptr = LI.getPointerOperand();
321 unsigned AS = LI.getPointerAddressSpace();
323 LI.getAllMetadata(MD);
327 LI.getAlignment(), LI.getName() + Suffix);
456 static Instruction *combineLoadToOperationType(InstCombiner &IC, LoadInst &LI) {
459 if (!LI.isSimple()
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFG.h | 61 /// Using DT or LI allows us to answer more quickly. LI reduces the cost of
65 /// on branchy code but not loops, and LI is most useful on code with loops but
69 const LoopInfo *LI = nullptr);
79 const LoopInfo *LI = nullptr);
91 const LoopInfo *LI = nullptr);
|
| BasicAliasAnalysis.h | 45 LoopInfo *LI;
50 LoopInfo *LI = nullptr)
51 : AAResultBase(TLI), DL(DL), AC(AC), DT(DT), LI(LI) {}
54 : AAResultBase(Arg), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT), LI(Arg.LI) {}
57 LI(Arg.LI) {}
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DebugLocStream.h | 65 const List &getList(size_t LI) const { return Lists[LI]; }
79 size_t LI = Lists.size();
81 return LI;
109 size_t LI = getIndex(L);
111 .slice(Lists[LI].EntryOffset, getNumEntries(LI));
136 size_t getNumEntries(size_t LI) const {
137 if (LI + 1 == Lists.size())
138 return Entries.size() - Lists[LI].EntryOffset
[all...] |
| ErlangGCPrinter.cpp | 115 for (GCFunctionInfo::live_iterator LI = MD.live_begin(PI),
117 LI != LE; ++LI) {
120 AP.EmitInt16(LI->StackOffset / IntPtrSize);
|
| /external/llvm/lib/CodeGen/ |
| AtomicExpandPass.cpp | 53 LoadInst *convertAtomicLoadToIntegerType(LoadInst *LI);
54 bool tryExpandAtomicLoad(LoadInst *LI);
55 bool expandAtomicLoadToLL(LoadInst *LI);
56 bool expandAtomicLoadToCmpXchg(LoadInst *LI);
95 auto LI = dyn_cast<LoadInst>(I);
99 assert((LI || SI || RMWI || CASI || isa<FenceInst>(I)) &&
105 if (LI && isAtLeastAcquire(LI->getOrdering())) {
106 FenceOrdering = LI->getOrdering();
107 LI->setOrdering(Monotonic)
[all...] |
| InterleavedAccessPass.cpp | 83 bool lowerInterleavedLoad(LoadInst *LI,
179 LoadInst *LI, SmallVector<Instruction *, 32> &DeadInsts) {
180 if (!LI->isSimple())
186 for (auto UI = LI->user_begin(), E = LI->user_end(); UI != E; UI++) {
222 DEBUG(dbgs() << "IA: Found an interleaved load: " << *LI << "\n");
225 if (!TLI->lowerInterleavedLoad(LI, Shuffles, Indices, Factor))
231 DeadInsts.push_back(LI);
275 if (LoadInst *LI = dyn_cast<LoadInst>(&I))
276 Changed |= lowerInterleavedLoad(LI, DeadInsts)
[all...] |
| LiveRangeEdit.cpp | 39 LiveInterval &LI = LIS.createEmptyInterval(VReg);
40 return LI;
99 LiveInterval &li = LIS.getInterval(MO.getReg()); local
100 const VNInfo *OVNI = li.getVNInfoAt(OrigIdx);
110 if (OVNI != li.getVNInfoAt(UseIdx))
164 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI,
169 for (MachineOperand &MO : MRI.reg_nodbg_operands(LI->reg)) {
206 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second)
215 DefMI->addRegisterDead(LI->reg, nullptr);
221 bool LiveRangeEdit::useIsKill(const LiveInterval &LI,
[all...] |
| RegAllocBase.h | 84 virtual void enqueue(LiveInterval *LI) = 0;
100 virtual void aboutToRemoveInterval(LiveInterval &LI) {}
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXLowerAlloca.cpp | 87 auto LI = dyn_cast<LoadInst>(AllocaUse.getUser());
88 if (LI && LI->getPointerOperand() == allocaInst && !LI->isVolatile()) {
89 LI->setOperand(LI->getPointerOperandIndex(), NewASCToGeneric);
|
| NVPTXLowerKernelArgs.cpp | 161 LoadInst *LI = new LoadInst(ArgInParam, Arg->getName(), FirstInst);
162 new StoreInst(LI, AllocA, FirstInst);
204 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) {
205 if (LI->getType()->isPointerTy()) {
206 Value *UO = GetUnderlyingObject(LI->getPointerOperand(),
210 // LI is a load from a pointer within a byval kernel parameter.
211 markPointerAsGlobal(LI);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| UnrollLoop.h | 34 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
38 bool AllowExpensiveTripCount, LoopInfo *LI,
|
| BasicBlockUtils.h | 55 LoopInfo *LI = nullptr,
84 LoopInfo *LI;
90 LoopInfo *LI = nullptr)
91 : DT(DT), LI(LI), MergeIdenticalEdges(false),
183 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
191 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
211 LoopInfo *LI = nullptr,
231 LoopInfo *LI = nullptr,
|
| LoopVersioning.h | 42 LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
108 LoopInfo *LI;
|
| SimplifyIndVar.h | 61 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead,
67 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead);
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 195 BasicBlock::iterator LI = L->begin(), LE = L->end();
199 assert(LI != LE && RI != R->end());
200 Instruction *LeftI = &*LI, *RightI = &*RI;
213 ++LI, ++RI;
214 } while (LI != LE); // This is sufficient: we can't get equality of
219 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI)
220 unify(&*LI, &*RI);
224 void runBlockDiff(BasicBlock::iterator LI, BasicBlock::iterator RI)
[all...] |
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 113 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) {
114 const Loop *L = LI->getLoopFor(BB);
123 static bool loopContainsBoth(const LoopInfo *LI,
125 const Loop *L1 = getOutermostLoop(LI, BB1);
126 const Loop *L2 = getOutermostLoop(LI, BB2);
132 const DominatorTree *DT, const LoopInfo *LI) {
150 if (LI && loopContainsBoth(LI, BB, StopBB))
159 if (const Loop *Outer = LI ? getOutermostLoop(LI, BB) : nullptr)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 117 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
118 LI != LE; ++LI) {
119 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
213 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
214 LI != LE; ++LI) {
217 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end())
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyRegColoring.cpp | 106 LiveInterval *LI = &Liveness->getInterval(VReg);
107 assert(LI->weight == 0.0f);
108 LI->weight = computeWeight(MRI, MBFI, VReg);
109 DEBUG(LI->dump());
110 SortedIntervals.push_back(LI);
136 LiveInterval *LI = SortedIntervals[i];
137 unsigned Old = LI->reg;
148 if (!OtherLI->empty() && OtherLI->overlaps(*LI))
159 Assignments[Color].push_back(LI);
161 << TargetRegisterInfo::virtReg2Index(LI->reg) << " to vreg
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 48 auto *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
50 SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI));
200 auto *LI = Options.LI;
201 if (!DT && !LI)
260 if (LI) {
261 if (Loop *TIL = LI->getLoopFor(TIBB)) {
263 // either, and thus LI doesn't need to be updated.
264 if (Loop *DestLoop = LI->getLoopFor(DestBB)) {
267 DestLoop->addBasicBlockToLoop(NewBB, *LI);
[all...] |
| LCSSA.cpp | 66 PredIteratorCache &PredCache, LoopInfo *LI) {
149 if (auto *OtherLoop = LI->getLoopFor(ExitBB))
185 Loop *OtherLoop = LI->getLoopFor(PHIBB);
194 processInstruction(*OtherLoop, *I, DT, EBs, PredCache, LI);
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,
249 Changed |= processInstruction(L, I, DT, ExitBlocks, PredCache, LI);
265 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
271 Changed |= formLCSSARecursively(*SubLoop, DT, LI, SE);
273 Changed |= formLCSSA(L, DT, LI, SE);
286 LoopInfo *LI;
[all...] |
| /bionic/libc/arch-mips64/bionic/ |
| vfork.S | 55 LI a0, (CLONE_VM | CLONE_VFORK | SIGCHLD)
64 LI v0, __NR_clone
|
| /external/clang/www/analyzer/scripts/ |
| menu.js | 6 if (node.nodeName=="LI") {
|
