| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 61 LoopInfoBase<MachineBasicBlock, MachineLoop> LI;
74 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; }
80 inline iterator begin() const { return LI.begin(); }
81 inline iterator end() const { return LI.end(); }
82 bool empty() const { return LI.empty(); }
88 return LI.getLoopFor(BB);
94 return LI.getLoopFor(BB);
100 return LI.getLoopDepth(BB);
105 return LI.isLoopHeader(BB);
112 virtual void releaseMemory() { LI.releaseMemory();
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| UnrollLoop.h | 26 unsigned TripMultiple, LoopInfo* LI, LPPassManager* LPM);
28 bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
|
| /external/llvm/lib/CodeGen/ |
| LiveRangeEdit.cpp | 40 LiveInterval &LI = LIS.getOrCreateInterval(VReg);
41 newRegs_.push_back(&LI);
42 return LI;
91 LiveInterval &li = LIS.getInterval(MO.getReg()); local
92 const VNInfo *OVNI = li.getVNInfoAt(OrigIdx);
95 if (OVNI != li.getVNInfoAt(UseIdx))
149 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI,
154 for (MachineRegisterInfo::reg_nodbg_iterator I = MRI.reg_nodbg_begin(LI->reg),
180 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second)
189 DefMI->addRegisterDead(LI->reg, 0)
[all...] |
| LiveRangeCalc.h | 72 // LI - The live range that is live-in to this block. The algorithms can
74 LiveInterval *LI;
77 // Cleared when the final value has been determined and LI has been updated.
82 // determined, the range from the block start to Kill will be added to LI.
88 LiveInBlock(LiveInterval *li, MachineDomTreeNode *node, SlotIndex kill)
89 : LI(li), DomNode(node), Kill(kill), Value(0) {}
98 /// findReachingDefs - Assuming that LI is live-in to KillMBB and killed at
99 /// Kill, search for values that can reach KillMBB. All blocks that need LI
103 VNInfo *findReachingDefs(LiveInterval *LI,
[all...] |
| LiveIntervalAnalysis.cpp | 113 if (const LiveInterval *LI = r2iMap_.lookup(Reg)) {
114 LI->print(OS, tri_);
120 if (const LiveInterval *LI =
122 LI->print(OS, tri_);
568 for (MachineBasicBlock::livein_iterator LI = MBB->livein_begin(),
569 LE = MBB->livein_end(); LI != LE; ++LI) {
570 handleLiveInRegister(MBB, MIIndex, getOrCreateInterval(*LI));
631 LiveInterval* LiveIntervals::dupInterval(LiveInterval *li) {
632 LiveInterval *NewLI = createInterval(li->reg)
[all...] |
| MachineVerifier.cpp | 416 for (MachineBasicBlock::livein_iterator LI = MBB->livein_begin(),
418 LI != LE; ++LI) {
419 unsigned reg = *LI;
738 LiveInterval &LI = LiveStks->getInterval(MO->getIndex());
740 if (MI->mayLoad() && !LI.liveAt(Idx.getRegSlot(true))) {
742 *OS << "Live stack: " << LI << '\n';
744 if (MI->mayStore() && !LI.liveAt(Idx.getRegSlot())) {
746 *OS << "Live stack: " << LI << '\n';
793 const LiveInterval &LI = LiveInts->getInterval(Reg)
[all...] |
| LiveRangeCalc.cpp | 44 I->LI->addRange(LiveRange(Start, I->Kill, VNI));
46 I->LI->addRange(LiveRange(Start, End, VNI));
57 void LiveRangeCalc::extend(LiveInterval *LI,
62 assert(LI && "Missing live range");
71 if (LI->extendInBlock(Indexes->getMBBStartIdx(KillMBB), Kill))
78 VNInfo *VNI = findReachingDefs(LI, KillMBB, Kill, Indexes, DomTree);
101 VNInfo *LiveRangeCalc::findReachingDefs(LiveInterval *LI,
106 // Blocks where LI should be live-in.
136 VNInfo *VNI = LI->extendInBlock(Start, End);
159 addLiveInBlock(LI, DomTree->getNode(WorkList.pop_back_val()))
[all...] |
| StrongPHIElimination.cpp | 147 LiveIntervals *LI;
182 MIIndexCompare(LiveIntervals *LiveIntervals) : LI(LiveIntervals) { }
185 return LI->getInstructionIndex(LHS) < LI->getInstructionIndex(RHS);
188 LiveIntervals *LI;
237 LI = &getAnalysis<LiveIntervals>();
327 LI->RemoveMachineInstrFromMaps(PHI);
344 LiveInterval &DestLI = LI->getInterval(DestReg);
345 LiveInterval &NewLI = LI->getInterval(NewReg);
353 NewVNI = NewLI.createValueCopy(DestLR->valno, LI->getVNInfoAllocator())
[all...] |
| /external/llvm/utils/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/tools/llvm-diff/ |
| DifferenceEngine.cpp | 197 BasicBlock::iterator LI = L->begin(), LE = L->end();
203 assert(LI != LE && RI != R->end());
204 Instruction *LeftI = &*LI, *RightI = &*RI;
217 ++LI, ++RI;
218 } while (LI != LE); // This is sufficient: we can't get equality of
223 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI)
224 unify(&*LI, &*RI);
228 void runBlockDiff(BasicBlock::iterator LI, BasicBlock::iterator RI)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 112 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
113 LI != LE; ++LI) {
114 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
205 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
206 LI != LE; ++LI) {
209 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end())
[all...] |
| LowerAtomic.cpp | 98 static bool LowerLoadInst(LoadInst *LI) {
99 LI->setAtomic(NotAtomic);
124 else if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) {
125 if (LI->isAtomic())
126 LowerLoadInst(LI);
|
| ScalarReplAggregates.cpp | 156 void RewriteLoadUserOfWholeAlloca(LoadInst *LI, AllocaInst *AI,
418 if (LoadInst *LI = dyn_cast<LoadInst>(User)) {
420 if (!LI->isSimple())
423 if (LI->getType()->isX86_MMXTy())
426 MergeInTypeForLoadOrStore(LI->getType(), Offset);
548 if (LoadInst *LI = dyn_cast<LoadInst>(User)) {
552 = ConvertScalar_ExtractValue(LoadedVal, LI->getType(), Offset, Builder);
553 LI->replaceAllUsesWith(NewLoadVal);
554 LI->eraseFromParent();
[all...] |
| LICM.cpp | 100 LoopInfo *LI; // Current LoopInfo
141 return LI->getLoopFor(BB) != CurLoop;
201 LI = &getAnalysis<LoopInfo>();
237 if (LI->getLoopFor(BB) == L) // Ignore blocks in subloops.
375 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) {
376 if (!LI->isUnordered())
381 if (AA->pointsToConstantMemory(LI->getOperand(0)))
383 if (LI->getMetadata("invariant.load"))
388 if (LI->getType()->isSized())
389 Size = AA->getTypeStoreSize(LI->getType())
[all...] |
| LoopInstSimplify.cpp | 68 LoopInfo *LI = &getAnalysis<LoopInfo>();
112 if (V && LI->replacementPreservesLCSSAForm(I, V)) {
139 const Loop *SuccLoop = LI->getLoopFor(SuccBB);
149 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 158 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI,
160 User *CI = cast<User>(LI.getOperand(0));
182 Idxs[0] = Constant::getNullValue(Type::getInt32Ty(LI.getContext()));
194 (SrcPTy->isPointerTy() == LI.getType()->isPointerTy()) &&
202 IC.Builder->CreateLoad(CastOp, LI.isVolatile(), CI->getName());
203 NewLoad->setAlignment(LI.getAlignment());
204 NewLoad->setAtomic(LI.getOrdering(), LI.getSynchScope());
206 return new BitCastInst(NewLoad, LI.getType());
213 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
[all...] |
| /external/clang/www/analyzer/scripts/ |
| menu.js | 6 if (node.nodeName=="LI") {
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 317 LoopInfo *LI;
333 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {}
352 LoopBlocksTraversal Traversal(DFS, LI);
356 Loop *L = LI->getLoopFor(*POI);
363 LI->changeLoopFor(*POI, NL);
384 Loop *L = LI->getLoopFor(*POI);
389 LI->changeLoopFor(*POI, NL);
403 Loop *OuterParent = LI->getLoopFor(*BI);
430 LI->addTopLevelLoop(Subloop);
468 Loop *L = LI->getLoopFor(*I)
[all...] |
| IVUsers.cpp | 49 ScalarEvolution *SE, LoopInfo *LI) {
57 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR);
61 return isInteresting(AR->getStart(), I, L, SE, LI) &&
62 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI);
70 if (isInteresting(*OI, I, L, SE, LI)) {
85 const LoopInfo *LI,
91 Loop *DomLoop = LI->getLoopFor(DomBB);
135 if (!isInteresting(ISE, I, L, SE, LI))
158 if (!isSimplifiedLoopNest(UseBB, DT, LI, SimpleLoopNests))
168 if (LI->getLoopFor(User->getParent()) != L)
[all...] |
| LoopPass.cpp | 64 LI = NULL;
71 LI->updateUnloop(L);
102 LI->addTopLevelLoop(L);
180 LI = &getAnalysis<LoopInfo>();
187 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
240 TimeRegion PassTimer(getPassTimer(LI));
|
| AliasSetTracker.cpp | 299 bool AliasSetTracker::add(LoadInst *LI) {
300 if (LI->getOrdering() > Monotonic) return addUnknown(LI);
302 if (!LI->isUnordered()) ATy = AliasSet::ModRef;
304 AliasSet &AS = addPointer(LI->getOperand(0),
305 AA.getTypeStoreSize(LI->getType()),
306 LI->getMetadata(LLVMContext::MD_tbaa),
308 if (LI->isVolatile()) AS.setVolatile();
354 if (LoadInst *LI = dyn_cast<LoadInst>(I))
355 return add(LI);
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 65 void perform(LoopInfo *LI);
120 LoopInfo *LI;
124 DFS(Storage), LI(LInfo) {}
145 if (!DFS.L->contains(LI->getLoopFor(BB)))
166 return !DFS.L->contains(LI->getLoopFor(BB)) || DFS.PostNumbers.count(BB);
|
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 90 if (const LoadInst *LI = dyn_cast<LoadInst>(U)) {
93 if (LI->isVolatile())
333 LoadInst *LI = cast<LoadInst>(User);
336 UsingBlocks.push_back(LI->getParent());
337 AllocaPointerVal = LI;
706 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
707 if (LI->getOperand(0) != AI) continue;
851 LoadInst *LI = cast<LoadInst>(UserInst);
858 if (LI->getParent() == StoreBB) {
865 if (unsigned(StoreIndex) > LBI.getInstructionIndex(LI)) {
[all...] |
| BreakCriticalEdges.cpp | 241 LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>();
245 if (DT == 0 && LI == 0 && PI == 0)
304 if (LI) {
305 if (Loop *TIL = LI->getLoopFor(TIBB)) {
307 // either, and thus LI doesn't need to be updated.
308 if (Loop *DestLoop = LI->getLoopFor(DestBB)) {
311 DestLoop->addBasicBlockToLoop(NewBB, LI->getBase());
314 TIL->addBasicBlockToLoop(NewBB, LI->getBase());
317 DestLoop->addBasicBlockToLoop(NewBB, LI->getBase());
326 P->addBasicBlockToLoop(NewBB, LI->getBase())
[all...] |
| /external/clang/utils/TableGen/ |
| OptParserEmitter.cpp | 161 const ListInit *LI = R.getValueAsListInit("Flags");
162 if (LI->empty()) {
166 for (unsigned i = 0, e = LI->size(); i != e; ++i) {
169 OS << dynamic_cast<DefInit*>(LI->getElement(i))->getDef()->getName();
|
