| /external/llvm/lib/CodeGen/ |
| D | LiveRangeCalc.h | 80 LiveInterval *LI; member
95 : LI(li), DomNode(node), Kill(kill), Value(0) {} in LiveInBlock()
114 bool findReachingDefs(LiveInterval *LI,
151 void calculate(LiveInterval *LI);
168 void extend(LiveInterval *LI, SlotIndex Kill, unsigned PhysReg = 0);
173 void createDeadDefs(LiveInterval *LI, unsigned Reg);
176 void createDeadDefs(LiveInterval *LI) { in createDeadDefs() argument
177 createDeadDefs(LI, LI->reg); in createDeadDefs()
184 void extendToUses(LiveInterval *LI, unsigned Reg);
187 void extendToUses(LiveInterval *LI) { in extendToUses() argument
[all …]
|
| D | LiveRangeEdit.cpp | 39 LiveInterval &LI = LIS.getOrCreateInterval(VReg); in createFrom() local
40 NewRegs.push_back(&LI); in createFrom()
41 return LI; in createFrom()
159 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI, in foldAsLoad() argument
164 for (MachineRegisterInfo::reg_nodbg_iterator I = MRI.reg_nodbg_begin(LI->reg), in foldAsLoad()
203 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second) in foldAsLoad()
212 DefMI->addRegisterDead(LI->reg, 0); in foldAsLoad()
259 if (LiveInterval *LI = LIS.getCachedRegUnit(*Units)) { in eliminateDeadDef() local
260 if (VNInfo *VNI = LI->getVNInfoAt(Idx)) in eliminateDeadDef()
261 LI->removeValNo(VNI); in eliminateDeadDef()
[all …]
|
| D | LiveIntervalAnalysis.cpp | 143 if (LiveInterval *LI = RegUnitIntervals[i]) in print() local
144 OS << PrintRegUnit(i, TRI) << " = " << *LI << '\n'; in print()
180 void LiveIntervals::computeVirtRegInterval(LiveInterval *LI) { in computeVirtRegInterval() argument
182 assert(LI->empty() && "Should only compute empty intervals."); in computeVirtRegInterval()
184 LRCalc->createDeadDefs(LI); in computeVirtRegInterval()
185 LRCalc->extendToUses(LI); in computeVirtRegInterval()
193 LiveInterval *LI = createInterval(Reg); in computeVirtRegs() local
194 VirtRegIntervals[Reg] = LI; in computeVirtRegs()
195 computeVirtRegInterval(LI); in computeVirtRegs()
235 void LiveIntervals::computeRegUnitInterval(LiveInterval *LI) { in computeRegUnitInterval() argument
[all …]
|
| D | StrongPHIElimination.cpp | 147 LiveIntervals *LI; member in __anon198d8bb70111::StrongPHIElimination
182 MIIndexCompare(LiveIntervals *LiveIntervals) : LI(LiveIntervals) { } in MIIndexCompare()
185 return LI->getInstructionIndex(LHS) < LI->getInstructionIndex(RHS); in operator ()()
188 LiveIntervals *LI; member
237 LI = &getAnalysis<LiveIntervals>(); in runOnMachineFunction()
327 LI->RemoveMachineInstrFromMaps(PHI); in runOnMachineFunction()
344 LiveInterval &DestLI = LI->getInterval(DestReg); in runOnMachineFunction()
345 LiveInterval &NewLI = LI->getInterval(NewReg); in runOnMachineFunction()
353 NewVNI = NewLI.createValueCopy(DestLR->valno, LI->getVNInfoAllocator()); in runOnMachineFunction()
361 LI->removeInterval(DestReg); in runOnMachineFunction()
[all …]
|
| D | MachineVerifier.cpp | 213 const LiveInterval &LI);
215 const LiveInterval &LI);
415 const LiveInterval &LI) { in report() argument
418 if (TargetRegisterInfo::isVirtualRegister(LI.reg)) in report()
419 *OS << PrintReg(LI.reg, TRI); in report()
421 *OS << PrintRegUnit(LI.reg, TRI); in report()
422 *OS << ' ' << LI << '\n'; in report()
426 const LiveInterval &LI) { in report() argument
429 if (TargetRegisterInfo::isVirtualRegister(LI.reg)) in report()
430 *OS << PrintReg(LI.reg, TRI); in report()
[all …]
|
| D | LiveInterval.cpp | 687 if (LI) in print()
688 OS << "Clean " << PrintReg(LI->reg) << " updater: " << *LI << '\n'; in print()
693 assert(LI && "Can't have null LI in dirty updater."); in print()
694 OS << PrintReg(LI->reg) << " updater with gap = " << (ReadI - WriteI) in print()
697 for (LiveInterval::const_iterator I = LI->begin(); I != WriteI; ++I) in print()
703 for (LiveInterval::const_iterator I = ReadI, E = LI->end(); I != E; ++I) in print()
725 assert(LI && "Cannot add to a null destination"); in add()
733 WriteI = ReadI = LI->begin(); in add()
740 LiveInterval::iterator E = LI->end(); in add()
747 ReadI = WriteI = LI->find(Seg.start); in add()
[all …]
|
| D | LiveRangeCalc.cpp | 39 void LiveRangeCalc::createDeadDefs(LiveInterval *LI, unsigned Reg) { in createDeadDefs() argument
58 LI->createDeadDef(Idx, *Alloc); in createDeadDefs()
63 void LiveRangeCalc::extendToUses(LiveInterval *LI, unsigned Reg) { in extendToUses() argument
102 extend(LI, Idx, Reg); in extendToUses()
128 Updater.setDest(I->LI); in updateLiveIns()
135 void LiveRangeCalc::extend(LiveInterval *LI, in extend() argument
138 assert(LI && "Missing live range"); in extend()
147 if (LI->extendInBlock(Indexes->getMBBStartIdx(KillMBB), Kill)) in extend()
154 if (findReachingDefs(LI, KillMBB, Kill, PhysReg)) in extend()
173 bool LiveRangeCalc::findReachingDefs(LiveInterval *LI, in findReachingDefs() argument
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineLoopInfo.h | 73 LoopInfoBase<MachineBasicBlock, MachineLoop> LI; variable
86 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; } in getBase()
92 inline iterator begin() const { return LI.begin(); } in begin()
93 inline iterator end() const { return LI.end(); } in end()
94 bool empty() const { return LI.empty(); } in empty()
100 return LI.getLoopFor(BB); in getLoopFor()
106 return LI.getLoopFor(BB);
112 return LI.getLoopDepth(BB); in getLoopDepth()
117 return LI.isLoopHeader(BB); in isLoopHeader()
124 virtual void releaseMemory() { LI.releaseMemory(); } in releaseMemory()
[all …]
|
| D | LiveIntervalAnalysis.h | 106 LiveInterval *LI = VirtRegIntervals[Reg]; in getInterval() local
107 assert(LI && "Interval does not exist for virtual register"); in getInterval()
108 return *LI; in getInterval()
157 void extendToIndices(LiveInterval *LI, ArrayRef<SlotIndex> Indices);
166 void pruneValue(LiveInterval *LI, SlotIndex Kill,
255 MachineBasicBlock *intervalIsInOneMBB(const LiveInterval &LI) const;
259 bool hasPHIKill(const LiveInterval &LI, const VNInfo *VNI) const;
339 bool checkRegMaskInterference(LiveInterval &LI,
356 LiveInterval *LI = RegUnitIntervals[Unit]; in getRegUnit() local
357 if (!LI) { in getRegUnit()
[all …]
|
| /external/llvm/lib/TableGen/ |
| D | StringMatcher.cpp | 106 for (std::map<char, std::vector<const StringPair*> >::iterator LI = in EmitStringMatcherForChar() local
107 MatchesByLetter.begin(), E = MatchesByLetter.end(); LI != E; ++LI) { in EmitStringMatcherForChar()
109 OS << Indent << "case '" << LI->first << "':\t // " in EmitStringMatcherForChar()
110 << LI->second.size() << " string"; in EmitStringMatcherForChar()
111 if (LI->second.size() != 1) OS << 's'; in EmitStringMatcherForChar()
113 if (EmitStringMatcherForChar(LI->second, CharNo+1, IndentCount+1)) in EmitStringMatcherForChar()
139 for (std::map<unsigned, std::vector<const StringPair*> >::iterator LI = in Emit() local
140 MatchesByLength.begin(), E = MatchesByLength.end(); LI != E; ++LI) { in Emit()
141 OS.indent(Indent*2+2) << "case " << LI->first << ":\t // " in Emit()
142 << LI->second.size() in Emit()
[all …]
|
| /external/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 195 BasicBlock::iterator LI = L->begin(), LE = L->end(); in diff() local
201 assert(LI != LE && RI != R->end()); in diff()
202 Instruction *LeftI = &*LI, *RightI = &*RI; in diff()
215 ++LI, ++RI; in diff()
216 } while (LI != LE); // This is sufficient: we can't get equality of in diff()
221 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI) in diff()
222 unify(&*LI, &*RI); in diff()
226 void runBlockDiff(BasicBlock::iterator LI, BasicBlock::iterator RI);
279 InvokeInst *LI = cast<InvokeInst>(L); in diff() local
281 if (diffCallSites(CallSite(LI), CallSite(RI), Complain)) in diff()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopDeletion.cpp | 114 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in isLoopDead() local
115 LI != LE; ++LI) { in isLoopDead()
116 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end(); in isLoopDead()
207 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop() local
208 LI != LE; ++LI) { in runOnLoop()
211 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end()); in runOnLoop()
218 DT.eraseNode(*LI); in runOnLoop()
222 (*LI)->dropAllReferences(); in runOnLoop()
229 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop() local
230 LI != LE; ++LI) in runOnLoop()
[all …]
|
| D | ScalarReplAggregates.cpp | 182 void RewriteLoadUserOfWholeAlloca(LoadInst *LI, AllocaInst *AI,
472 if (LoadInst *LI = dyn_cast<LoadInst>(User)) { in CanConvertToScalar() local
474 if (!LI->isSimple()) in CanConvertToScalar()
477 if (LI->getType()->isX86_MMXTy()) in CanConvertToScalar()
480 MergeInTypeForLoadOrStore(LI->getType(), Offset); in CanConvertToScalar()
627 if (LoadInst *LI = dyn_cast<LoadInst>(User)) { in ConvertUsesToScalar() local
631 = ConvertScalar_ExtractValue(LoadedVal, LI->getType(), Offset, in ConvertUsesToScalar()
633 LI->replaceAllUsesWith(NewLoadVal); in ConvertUsesToScalar()
634 LI->eraseFromParent(); in ConvertUsesToScalar()
1083 if (LoadInst *LI = dyn_cast<LoadInst>(I)) in isInstInList() local
[all …]
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineLoadStoreAlloca.cpp | 57 if (LoadInst *LI = dyn_cast<LoadInst>(U)) { in isOnlyCopiedFromConstantGlobal() local
59 if (!LI->isSimple()) return false; in isOnlyCopiedFromConstantGlobal()
282 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI, in InstCombineLoadCast() argument
284 User *CI = cast<User>(LI.getOperand(0)); in InstCombineLoadCast()
306 Idxs[0] = Constant::getNullValue(Type::getInt32Ty(LI.getContext())); in InstCombineLoadCast()
318 (SrcPTy->isPointerTy() == LI.getType()->isPointerTy()) && in InstCombineLoadCast()
326 IC.Builder->CreateLoad(CastOp, LI.isVolatile(), CI->getName()); in InstCombineLoadCast()
327 NewLoad->setAlignment(LI.getAlignment()); in InstCombineLoadCast()
328 NewLoad->setAtomic(LI.getOrdering(), LI.getSynchScope()); in InstCombineLoadCast()
330 return new BitCastInst(NewLoad, LI.getType()); in InstCombineLoadCast()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 119 static const Loop *getOutermostLoop(LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop() argument
120 const Loop *L = LI->getLoopFor(BB); in getOutermostLoop()
129 static bool loopContainsBoth(LoopInfo *LI, in loopContainsBoth() argument
131 const Loop *L1 = getOutermostLoop(LI, BB1); in loopContainsBoth()
132 const Loop *L2 = getOutermostLoop(LI, BB2); in loopContainsBoth()
138 LoopInfo *LI) { in isPotentiallyReachableSameBlock() argument
154 if (LI && HasLoop) { in isPotentiallyReachableSameBlock()
155 HasLoop = LI->getLoopFor(BB) != 0; in isPotentiallyReachableSameBlock()
169 DominatorTree *DT, LoopInfo *LI) { in isPotentiallyReachable() argument
176 return isPotentiallyReachableSameBlock(A, B, LI); in isPotentiallyReachable()
[all …]
|
| D | LoopInfo.cpp | 437 LoopInfo *LI; member in __anon4e6819950111::UnloopUpdater
453 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {} in UnloopUpdater()
472 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
476 Loop *L = LI->getLoopFor(*POI); in updateBlockParents()
483 LI->changeLoopFor(*POI, NL); in updateBlockParents()
504 Loop *L = LI->getLoopFor(*POI); in updateBlockParents()
509 LI->changeLoopFor(*POI, NL); in updateBlockParents()
523 Loop *OuterParent = LI->getLoopFor(*BI); in removeBlocksFromAncestors()
550 LI->addTopLevelLoop(Subloop); in updateSubloopParents()
587 Loop *L = LI->getLoopFor(*I); in getNearestLoop()
[all …]
|
| D | IVUsers.cpp | 50 ScalarEvolution *SE, LoopInfo *LI) { in isInteresting() argument
58 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); in isInteresting()
62 return isInteresting(AR->getStart(), I, L, SE, LI) && in isInteresting()
63 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); in isInteresting()
71 if (isInteresting(*OI, I, L, SE, LI)) { in isInteresting()
86 const LoopInfo *LI, in isSimplifiedLoopNest() argument
92 Loop *DomLoop = LI->getLoopFor(DomBB); in isSimplifiedLoopNest()
142 if (!isInteresting(ISE, I, L, SE, LI)) in AddUsersImpl()
165 if (!isSimplifiedLoopNest(UseBB, DT, LI, SimpleLoopNests)) in AddUsersImpl()
175 if (LI->getLoopFor(User->getParent()) != L) { in AddUsersImpl()
[all …]
|
| /external/tcpdump/tests/ |
| D | print-A.new | 72 <LI>
73 Configuration files can be found in <TT>/etc/apache</TT>.</LI>
75 <LI>
77 HTML files should exist, is set to <TT>/var/www</TT>.</LI>
79 <LI>
81 Debian packages will place their scripts.</LI>
83 <LI>
86 <TT>/etc/logrotate.d/apache</TT>.</LI>
88 <LI>
91 if it exists (assuming that <TT>/var/www</TT> is your <TT>DocumentRoot</TT>).</LI>
[all …]
|
| D | print-AA.new | 72 <LI>
73 Configuration files can be found in <TT>/etc/apache</TT>.</LI>
75 <LI>
77 HTML files should exist, is set to <TT>/var/www</TT>.</LI>
79 <LI>
81 Debian packages will place their scripts.</LI>
83 <LI>
86 <TT>/etc/logrotate.d/apache</TT>.</LI>
88 <LI>
91 if it exists (assuming that <TT>/var/www</TT> is your <TT>DocumentRoot</TT>).</LI>
[all …]
|
| D | print-A.out | 72 <LI>
73 Configuration files can be found in <TT>/etc/apache</TT>.</LI>
75 <LI>
77 HTML files should exist, is set to <TT>/var/www</TT>.</LI>
79 <LI>
81 Debian packages will place their scripts.</LI>
83 <LI>
86 <TT>/etc/logrotate.d/apache</TT>.</LI>
88 <LI>
91 if it exists (assuming that <TT>/var/www</TT> is your <TT>DocumentRoot</TT>).</LI>
[all …]
|
| D | print-AA.out | 72 <LI>
73 Configuration files can be found in <TT>/etc/apache</TT>.</LI>
75 <LI>
77 HTML files should exist, is set to <TT>/var/www</TT>.</LI>
79 <LI>
81 Debian packages will place their scripts.</LI>
83 <LI>
86 <TT>/etc/logrotate.d/apache</TT>.</LI>
88 <LI>
91 if it exists (assuming that <TT>/var/www</TT> is your <TT>DocumentRoot</TT>).</LI>
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | PromoteMemoryToRegister.cpp | 139 bool visitLoadInst(LoadInst &LI) { in visitLoadInst()
140 if (LI.isVolatile() || LI.getType() != AllocaTy) in visitLoadInst()
144 UsingBlocks.push_back(LI.getParent()); in visitLoadInst()
145 AllocaPointerVal = &LI; in visitLoadInst()
424 LoadInst *LI = cast<LoadInst>(UserInst); in rewriteSingleStoreAlloca() local
431 if (LI->getParent() == StoreBB) { in rewriteSingleStoreAlloca()
438 if (unsigned(StoreIndex) > LBI.getInstructionIndex(LI)) { in rewriteSingleStoreAlloca()
444 } else if (LI->getParent() != StoreBB && in rewriteSingleStoreAlloca()
445 !DT.dominates(StoreBB, LI->getParent())) { in rewriteSingleStoreAlloca()
449 Info.UsingBlocks.push_back(LI->getParent()); in rewriteSingleStoreAlloca()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopInfo.h | 240 void addBasicBlockToLoop(BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LI);
576 LoopInfoBase<BasicBlock, Loop> LI; variable
588 LoopInfoBase<BasicBlock, Loop>& getBase() { return LI; } in getBase()
595 inline iterator begin() const { return LI.begin(); } in begin()
596 inline iterator end() const { return LI.end(); } in end()
597 inline reverse_iterator rbegin() const { return LI.rbegin(); } in rbegin()
598 inline reverse_iterator rend() const { return LI.rend(); } in rend()
599 bool empty() const { return LI.empty(); } in empty()
605 return LI.getLoopFor(BB); in getLoopFor()
611 return LI.getLoopFor(BB);
[all …]
|
| /external/llvm/lib/MC/ |
| D | MCObjectDisassembler.cpp | 165 const MCDecodedInst &LI = TA->back(); in buildCFG() local
166 if (MIA.isBranch(LI.Inst)) { in buildCFG()
168 if (MIA.evaluateBranch(LI.Inst, LI.Address, LI.Size, Target)) in buildCFG()
170 if (MIA.isConditionalBranch(LI.Inst)) in buildCFG()
171 CurBB.addSucc(BBInfos[LI.Address + LI.Size]); in buildCFG()
172 } else if (!MIA.isTerminator(LI.Inst)) in buildCFG()
173 CurBB.addSucc(BBInfos[LI.Address + LI.Size]); in buildCFG()
|
| /external/smali/smali/src/test/resources/LexerTest/ |
| D | TypeAndIdentifierTest.smali | 12 LI;
14 LI/I/I;
25 [LI/I/I;
40 LI
|