/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | LiveRangeCalc.h | 77 // LI - The live range that is live-in to this block. The algorithms can 79 LiveInterval *LI; member in struct:llvm::LiveRangeCalc::LiveInBlock 82 // Cleared when the final value has been determined and LI has been updated. 87 // determined, the range from the block start to Kill will be added to LI. 94 : LI(li), DomNode(node), Kill(kill), Value(0) {} 103 /// findReachingDefs - Assuming that LI is live-in to KillMBB and killed at 104 /// Kill, search for values that can reach KillMBB. All blocks that need LI 110 VNInfo *findReachingDefs(LiveInterval *LI, 147 /// and uses. LI must be empty with no values. 148 void calculate(LiveInterval *LI); 173 createDeadDefs(LiveInterval *LI) argument 184 extendToUses(LiveInterval *LI) argument 221 addLiveInBlock(LiveInterval *LI, MachineDomTreeNode *DomNode, SlotIndex Kill = SlotIndex()) argument [all...] |
H A D | LiveRangeEdit.cpp | 40 LiveInterval &LI = LIS.getOrCreateInterval(VReg); local 41 NewRegs.push_back(&LI); 42 return LI; 160 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI, argument 165 for (MachineRegisterInfo::reg_nodbg_iterator I = MRI.reg_nodbg_begin(LI->reg), 204 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second) 213 DefMI->addRegisterDead(LI->reg, 0); 263 LiveInterval &LI = LIS.getInterval(Reg); local 271 LI.killedAt(Idx))) 272 ToShrink.insert(&LI); 326 LiveInterval *LI = ToShrink.back(); local 357 DEBUG(dbgs() << NumComp << " components: " << *LI << '\\n'); local 381 LiveInterval &LI = **I; local [all...] |
H A D | LiveIntervalAnalysis.cpp | 139 if (LiveInterval *LI = RegUnitIntervals[i]) 140 OS << PrintRegUnit(i, TRI) << " = " << *LI << '\n'; 463 void LiveIntervals::computeVirtRegInterval(LiveInterval *LI) { argument 465 assert(LI->empty() && "Should only compute empty intervals."); 467 LRCalc->createDeadDefs(LI); 468 LRCalc->extendToUses(LI); 476 LiveInterval *LI = createInterval(Reg); local 477 VirtRegIntervals[Reg] = LI; 478 computeVirtRegInterval(LI); 518 void LiveIntervals::computeRegUnitInterval(LiveInterval *LI) { argument 732 extendToIndices(LiveInterval *LI, ArrayRef<SlotIndex> Indices) argument 740 pruneValue(LiveInterval *LI, SlotIndex Kill, SmallVectorImpl<SlotIndex> *EndPoints) argument 812 LiveInterval *LI = &getInterval(Reg); local 891 hasPHIKill(const LiveInterval &LI, const VNInfo *VNI) const argument 946 checkRegMaskInterference(LiveInterval &LI, BitVector &UsableRegs) argument 1125 const LiveInterval* LI = P.first; local 1188 collectRanges(const MachineOperand &MO, LiveInterval *LI, RangeSet &Entering, RangeSet &Internal, RangeSet &Exiting, SlotIndex OldIdx) argument 1213 LiveInterval* LI = EI->first; local 1220 LiveInterval* LI = II->first; local 1231 LiveInterval* LI = EI->first; local [all...] |
H A D | LiveRangeCalc.cpp | 38 void LiveRangeCalc::createDeadDefs(LiveInterval *LI, unsigned Reg) { argument 42 // LI->createDeadDef() will deduplicate. 56 // Create the def in LI. This may find an existing def. 57 LI->createDeadDef(Idx, *Alloc); 62 void LiveRangeCalc::extendToUses(LiveInterval *LI, unsigned Reg) { argument 101 extend(LI, Idx, Reg); 121 I->LI->addRange(LiveRange(Start, I->Kill, VNI)); 123 I->LI->addRange(LiveRange(Start, End, VNI)); 134 void LiveRangeCalc::extend(LiveInterval *LI, argument 137 assert(LI 174 findReachingDefs(LiveInterval *LI, MachineBasicBlock *KillMBB, SlotIndex Kill, unsigned PhysReg) argument [all...] |
H A D | MachineVerifier.cpp | 213 const LiveInterval &LI); 215 const LiveInterval &LI); 397 const LiveInterval &LI) { 400 if (TargetRegisterInfo::isVirtualRegister(LI.reg)) 401 *OS << PrintReg(LI.reg, TRI); 403 *OS << PrintRegUnit(LI.reg, TRI); 404 *OS << ' ' << LI << '\n'; local 408 const LiveInterval &LI) { 411 if (TargetRegisterInfo::isVirtualRegister(LI.reg)) 412 *OS << PrintReg(LI 396 report(const char *msg, const MachineFunction *MF, const LiveInterval &LI) argument 407 report(const char *msg, const MachineBasicBlock *MBB, const LiveInterval &LI) argument 415 *OS << ' ' << LI << '\\n'; local 940 LiveInterval &LI = LiveStks->getInterval(MO->getIndex()); local 944 *OS << "Live stack: " << LI << '\\n'; local 948 *OS << "Live stack: " << LI << '\\n'; local 1001 const LiveInterval &LI = LiveInts->getInterval(Reg); local 1005 *OS << UseIdx << " is not live in " << LI << '\\n'; local 1011 *OS << "Live range: " << LI << '\\n'; local 1059 const LiveInterval &LI = LiveInts->getInterval(Reg); local 1069 *OS << DefIdx << " is not live in " << LI << '\\n'; local 1310 const LiveInterval &LI = LiveInts->getInterval(Reg); local 1321 verifyLiveIntervalValue(const LiveInterval &LI, VNInfo *VNI) argument 1404 verifyLiveIntervalSegment(const LiveInterval &LI, LiveInterval::const_iterator I) argument 1502 *OS << " in " << LI << '\\n'; local 1507 *OS << *I << " in " << LI << '\\n'; local 1567 verifyLiveInterval(const LiveInterval &LI) argument [all...] |
H A D | StrongPHIElimination.cpp | 147 LiveIntervals *LI; member in class:__anon10293::StrongPHIElimination 182 MIIndexCompare(LiveIntervals *LiveIntervals) : LI(LiveIntervals) { } 185 return LI->getInstructionIndex(LHS) < LI->getInstructionIndex(RHS); 188 LiveIntervals *LI; member in struct:__anon10293::MIIndexCompare 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 [all...] |
H A D | LiveInterval.cpp | 530 iterator LE = end(), LI = std::upper_bound(begin(), LE, *RI); 536 iterator ReplaceI = LI; 540 if (LI != begin()) { 541 ReplaceI = llvm::prior(LI); 547 while (LI != LE && RI != RE) { 556 LiveRange R = *LI; 563 ++LI; 587 assert(RI == RE || LI == LE); 591 for (; LI != LE && (LI [all...] |
H A D | LiveDebugVariables.cpp | 220 /// @param LI Restrict liveness to where LI has the value VNI. May be null. 221 /// @param VNI When LI is not null, this is the value to restrict to. 226 LiveInterval *LI, const VNInfo *VNI, 231 /// addDefsFromCopies - The value in LI/LocNo may be copies to other 234 /// @param LI Scan for copies of the value in LI->reg. 235 /// @param LocNo Location number of LI->reg. 238 void addDefsFromCopies(LiveInterval *LI, unsigned LocNo, 486 LiveInterval *LI, cons 485 extendDef(SlotIndex Idx, unsigned LocNo, LiveInterval *LI, const VNInfo *VNI, SmallVectorImpl<SlotIndex> *Kills, LiveIntervals &LIS, MachineDominatorTree &MDT, UserValueScopes &UVS) argument 547 addDefsFromCopies(LiveInterval *LI, unsigned LocNo, const SmallVectorImpl<SlotIndex> &Kills, SmallVectorImpl<std::pair<SlotIndex, unsigned> > &NewDefs, MachineRegisterInfo &MRI, LiveIntervals &LIS) argument 645 LiveInterval *LI = 0; local 660 LiveInterval *LI = &LIS.getRegUnit(Unit); local 770 LiveInterval *LI = NewRegs[i]; local [all...] |
/macosx-10.10/screen-22/screen/terminfo/ |
H A D | checktc.c | 4 int CO, LI, AM, XN; variable 44 LI = atoi(s); 47 if (LI == 0) 48 LI = tgetnum("li"); 51 if (LI == 0) 52 LI = 24; 64 GotoPos(CO/2-12, LI/2); 66 GotoPos(CO/2-3, LI/2+1); 67 printf("%dx%d", CO, LI); 70 GotoPos(CO/2-3, LI [all...] |
/macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 73 LoopInfoBase<MachineBasicBlock, MachineLoop> LI; member in class:llvm::MachineLoopInfo 86 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; } 92 inline iterator begin() const { return LI.begin(); } 93 inline iterator end() const { return LI.end(); } 94 bool empty() const { return LI.empty(); } 100 return LI.getLoopFor(BB); 106 return LI.getLoopFor(BB); 112 return LI.getLoopDepth(BB); 117 return LI.isLoopHeader(BB); 124 virtual void releaseMemory() { LI [all...] |
H A D | LiveIntervalAnalysis.h | 107 LiveInterval *LI = VirtRegIntervals[Reg]; local 108 assert(LI && "Interval does not exist for virtual register"); 109 return *LI; 150 /// extendToIndices - Extend the live range of LI to reach all points in 152 /// existing defs in LI. PHI-defs are added as needed to maintain SSA form. 154 /// If a SlotIndex in Indices is the end index of a basic block, LI will be 158 void extendToIndices(LiveInterval *LI, ArrayRef<SlotIndex> Indices); 160 /// pruneValue - If an LI value is live at Kill, prune its live range by 162 /// EndPoints such that extendToIndices(LI, EndPoints) will reconstruct the 167 void pruneValue(LiveInterval *LI, SlotInde 330 LiveInterval *LI = RegUnitIntervals[Unit]; local [all...] |
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Transforms/Utils/ |
H A D | UnrollLoop.h | 26 unsigned TripMultiple, LoopInfo* LI, LPPassManager* LPM); 28 bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
|
/macosx-10.10/llvmCore-3425.0.34/lib/TableGen/ |
H A D | 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...] |
/macosx-10.10/llvmCore-3425.0.34/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 197 BasicBlock::iterator LI = L->begin(), LE = L->end(); local 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, BasicBloc 281 InvokeInst *LI = cast<InvokeInst>(L); local 293 BranchInst *LI = cast<BranchInst>(L); local 311 SwitchInst *LI = cast<SwitchInst>(L); local 549 BasicBlock::iterator LI = LStart, RI = RStart; local [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Scalar/ |
H A D | 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] [all...] |
H A D | LowerAtomic.cpp | 98 static bool LowerLoadInst(LoadInst *LI) { argument 99 LI->setAtomic(NotAtomic); 124 else if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) { 125 if (LI->isAtomic()) 126 LowerLoadInst(LI);
|
H A D | ScalarReplAggregates.cpp | 182 void RewriteLoadUserOfWholeAlloca(LoadInst *LI, AllocaInst *AI, 472 if (LoadInst *LI = dyn_cast<LoadInst>(User)) { 474 if (!LI->isSimple()) 477 if (LI->getType()->isX86_MMXTy()) 480 MergeInTypeForLoadOrStore(LI->getType(), Offset); 627 if (LoadInst *LI = dyn_cast<LoadInst>(User)) { 631 = ConvertScalar_ExtractValue(LoadedVal, LI->getType(), Offset, 633 LI->replaceAllUsesWith(NewLoadVal); 634 LI->eraseFromParent(); 1083 if (LoadInst *LI 1143 LoadInst *LI = dyn_cast<LoadInst>(*UI); local 1184 LoadInst *LI = dyn_cast<LoadInst>(*UI); local 1329 LoadInst *LI = cast<LoadInst>(SI->use_back()); local 1376 LoadInst *LI = cast<LoadInst>(PN->use_back()); local 2443 RewriteLoadUserOfWholeAlloca(LoadInst *LI, AllocaInst *AI, SmallVector<AllocaInst*, 32> &NewElts) argument 2450 DEBUG(dbgs() << "PROMOTING LOAD OF WHOLE ALLOCA: " << *AI << '\\n' << *LI local [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/ |
H A D | LoopInfo.cpp | 324 LoopInfo *LI; member in class:__anon10156::UnloopUpdater 340 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {} 359 LoopBlocksTraversal Traversal(DFS, LI); 363 Loop *L = LI->getLoopFor(*POI); 370 LI->changeLoopFor(*POI, NL); 391 Loop *L = LI->getLoopFor(*POI); 396 LI->changeLoopFor(*POI, NL); 410 Loop *OuterParent = LI->getLoopFor(*BI); 437 LI->addTopLevelLoop(Subloop); 474 Loop *L = LI 621 perform(LoopInfo *LI) argument [all...] |
H A D | IVUsers.cpp | 50 ScalarEvolution *SE, LoopInfo *LI) { 58 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); 62 return isInteresting(AR->getStart(), I, L, SE, LI) && 63 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); 71 if (isInteresting(*OI, I, L, SE, LI)) { 86 const LoopInfo *LI, 92 Loop *DomLoop = LI->getLoopFor(DomBB); 142 if (!isInteresting(ISE, I, L, SE, LI)) 165 if (!isSimplifiedLoopNest(UseBB, DT, LI, SimpleLoopNests)) 175 if (LI 49 isInteresting(const SCEV *S, const Instruction *I, const Loop *L, ScalarEvolution *SE, LoopInfo *LI) argument 85 isSimplifiedLoopNest(BasicBlock *BB, const DominatorTree *DT, const LoopInfo *LI, SmallPtrSet<Loop*,16> &SimpleLoopNests) argument [all...] |
H A D | LoopPass.cpp | 64 LI = NULL; 71 LI->updateUnloop(L); 102 LI->addTopLevelLoop(L); 180 LI = &getAnalysis<LoopInfo>(); 191 for (LoopInfo::reverse_iterator I = LI->rbegin(), E = LI->rend(); I != E; ++I) 244 TimeRegion PassTimer(getPassTimer(LI));
|
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/InstCombine/ |
H A D | InstCombineLoadStoreAlloca.cpp | 57 if (LoadInst *LI = dyn_cast<LoadInst>(U)) { 59 if (!LI->isSimple()) return false; 299 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI, argument 301 User *CI = cast<User>(LI.getOperand(0)); 323 Idxs[0] = Constant::getNullValue(Type::getInt32Ty(LI.getContext())); 335 (SrcPTy->isPointerTy() == LI.getType()->isPointerTy()) && 343 IC.Builder->CreateLoad(CastOp, LI.isVolatile(), CI->getName()); 344 NewLoad->setAlignment(LI.getAlignment()); 345 NewLoad->setAtomic(LI.getOrdering(), LI 354 visitLoadInst(LoadInst &LI) argument [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Utils/ |
H A D | PromoteMemoryToRegister.cpp | 90 if (const LoadInst *LI = dyn_cast<LoadInst>(U)) { 93 if (LI->isVolatile()) 333 LoadInst *LI = cast<LoadInst>(User); local 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); local 858 if (LI->getParent() == StoreBB) { 865 if (unsigned(StoreIndex) > LBI.getInstructionIndex(LI)) { 961 LoadInst *LI = dyn_cast<LoadInst>(*UI++); local [all...] |
H A D | BreakCriticalEdges.cpp | 247 LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>(); local 251 if (DT == 0 && LI == 0 && PI == 0) 310 if (LI) { 311 if (Loop *TIL = LI->getLoopFor(TIBB)) { 313 // either, and thus LI doesn't need to be updated. 314 if (Loop *DestLoop = LI->getLoopFor(DestBB)) { 317 DestLoop->addBasicBlockToLoop(NewBB, LI->getBase()); 320 TIL->addBasicBlockToLoop(NewBB, LI->getBase()); 323 DestLoop->addBasicBlockToLoop(NewBB, LI->getBase()); 332 P->addBasicBlockToLoop(NewBB, LI [all...] |
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/doctools2base/ |
H A D | html_cssdefaults.tcl | 54 UL LI { 57 OL LI { 67 LI.section, LI.subsection { 89 UL.requirements LI, UL.syntax LI {
|
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Analysis/ |
H A D | LoopInfo.h | 243 void addBasicBlockToLoop(BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LI); 549 LoopInfoBase<BasicBlock, Loop> LI; member in class:llvm::LoopInfo 561 LoopInfoBase<BasicBlock, Loop>& getBase() { return LI; } 568 inline iterator begin() const { return LI.begin(); } 569 inline iterator end() const { return LI.end(); } 570 inline reverse_iterator rbegin() const { return LI.rbegin(); } 571 inline reverse_iterator rend() const { return LI.rend(); } 572 bool empty() const { return LI.empty(); } 578 return LI.getLoopFor(BB); 584 return LI [all...] |