/external/llvm/include/llvm/CodeGen/ |
H A D | CalcSpillWeights.h | 52 const MachineLoopInfo &Loops; member in class:llvm::VirtRegAuxInfo 62 : MF(mf), LIS(lis), Loops(loops), MBFI(mbfi), normalize(norm) {}
|
H A D | MachineTraceMetrics.h | 72 const MachineLoopInfo *Loops; member in class:llvm::MachineTraceMetrics
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | radeon_emulate_loops.h | 21 struct loop_info * Loops; member in struct:emulate_loop_state
|
H A D | radeon_emulate_loops.c | 427 s->Loops, s->LoopCount, s->LoopReserved, 1); 429 loop = &s->Loops[s->LoopCount++]; 515 if(!s->Loops[i].EndLoop){ 518 iterations = loop_max_possible_iterations(s->C, &s->Loops[i]); 519 unroll_loop(s->C, &s->Loops[i], iterations);
|
H A D | r500_fragprog_emit.c | 84 struct r500_loop_info * Loops; member in struct:emit_state 467 s->Loops, s->CurrentLoopDepth, s->LoopsReserved, 1); 469 loop = &s->Loops[s->CurrentLoopDepth++]; 480 loop = &s->Loops[s->CurrentLoopDepth - 1]; 495 loop = &s->Loops[s->CurrentLoopDepth - 1]; 510 loop = &s->Loops[s->CurrentLoopDepth - 1];
|
/external/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionNormalization.h | 72 PostIncLoopSet &Loops,
|
H A D | DependenceAnalysis.h | 349 SmallBitVector Loops; member in struct:llvm::DependenceAnalysis::Subscript 536 SmallBitVector &Loops) const; 542 SmallBitVector &Loops); 548 SmallBitVector &Loops); 577 SmallBitVector &Loops); 623 const SmallBitVector &Loops, 763 const SmallBitVector &Loops, 800 const SmallBitVector &Loops, 851 SmallBitVector &Loops,
|
H A D | BlockFrequencyInfoImpl.h | 386 std::list<LoopData> Loops; member in class:llvm::BlockFrequencyInfoImplBase 417 /// Insert them into \a Loops before \c Insert. 435 /// backedges and exits are stored in its entry in Loops. 818 /// Build up \a Loops using \a LoopInfo. \a LoopInfo gives us a mapping from 855 /// Find the irreducible SCCs in \c OuterLoop, add them to \a Loops (in front 993 Loops.emplace_back(Parent, Header); 994 Working[Header.Index].Loop = &Loops.back(); 998 Q.emplace_back(L, &Loops.back()); 1031 for (auto L = Loops.rbegin(), E = Loops [all...] |
H A D | LoopInfoImpl.h | 10 // This is the generic implementation of LoopInfo used for both Loops and 309 DenseSet<const LoopT*> *Loops) const { 310 Loops->insert(static_cast<const LoopT *>(this)); 315 (*I)->verifyLoopNest(Loops);
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_emulate_loops.h | 21 struct loop_info * Loops; member in struct:emulate_loop_state
|
H A D | radeon_emulate_loops.c | 427 s->Loops, s->LoopCount, s->LoopReserved, 1); 429 loop = &s->Loops[s->LoopCount++]; 515 if(!s->Loops[i].EndLoop){ 518 iterations = loop_max_possible_iterations(s->C, &s->Loops[i]); 519 unroll_loop(s->C, &s->Loops[i], iterations);
|
H A D | r500_fragprog_emit.c | 84 struct r500_loop_info * Loops; member in struct:emit_state 467 s->Loops, s->CurrentLoopDepth, s->LoopsReserved, 1); 469 loop = &s->Loops[s->CurrentLoopDepth++]; 480 loop = &s->Loops[s->CurrentLoopDepth - 1]; 495 loop = &s->Loops[s->CurrentLoopDepth - 1]; 510 loop = &s->Loops[s->CurrentLoopDepth - 1];
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolutionNormalization.cpp | 69 PostIncLoopSet &Loops; member in class:__anon25705::PostIncTransform 78 Kind(kind), Loops(loops), SE(se), DT(dt) {} 138 Loops.insert(L); 164 if (Loops.count(L)) { 179 if (Loops.count(L)) { 249 PostIncLoopSet &Loops, 252 PostIncTransform Transform(Kind, Loops, SE, DT); 245 TransformForPostIncUse(TransformKind Kind, const SCEV *S, Instruction *User, Value *OperandValToReplace, PostIncLoopSet &Loops, ScalarEvolution &SE, DominatorTree &DT) argument
|
H A D | DependenceAnalysis.cpp | 776 SmallBitVector &Loops) const { 780 Loops.set(Level); 806 // Collect any loops mentioned in the set of "Loops". 809 SmallBitVector &Loops) { 817 Loops.set(mapSrcLoop(AddRec->getLoop())); 818 return checkSrcSubscript(Start, LoopNest, Loops); 824 // Collect any loops mentioned in the set of "Loops". 827 SmallBitVector &Loops) { 835 Loops.set(mapDstLoop(AddRec->getLoop())); 836 return checkDstSubscript(Start, LoopNest, Loops); 807 checkSrcSubscript(const SCEV *Src, const Loop *LoopNest, SmallBitVector &Loops) argument 825 checkDstSubscript(const SCEV *Dst, const Loop *LoopNest, SmallBitVector &Loops) argument 844 classifyPair(const SCEV *Src, const Loop *SrcLoopNest, const SCEV *Dst, const Loop *DstLoopNest, SmallBitVector &Loops) argument 2177 testMIV(const SCEV *Src, const SCEV *Dst, const SmallBitVector &Loops, FullDependence &Result) const argument 2433 banerjeeMIVtest(const SCEV *Src, const SCEV *Dst, const SmallBitVector &Loops, FullDependence &Result) const argument 2514 exploreDirections(unsigned Level, CoefficientInfo *A, CoefficientInfo *B, BoundInfo *Bound, const SmallBitVector &Loops, unsigned &DepthExpanded, const SCEV *Delta) const argument 2982 propagate(const SCEV *&Src, const SCEV *&Dst, SmallBitVector &Loops, SmallVectorImpl<Constraint> &Constraints, bool &Consistent) argument [all...] |
H A D | BlockFrequencyInfoImpl.cpp | 10 // Loops should be simplified before this analysis. 249 Loops.clear(); 481 for (LoopData &Loop : Loops) 670 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), 685 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); 686 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); 698 return make_range(Loops.begin(), Insert);
|
H A D | LoopInfo.cpp | 33 // Explicitly instantiate methods in LoopInfoImpl.h for IR-level Loops. 690 DenseSet<const Loop*> Loops; 693 (*I)->verifyLoopNest(&Loops); 699 assert(Loops.count(I->second) && "orphaned loop");
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 179 BB2BBMap Loops; member in class:__anon26341::StructurizeCFG 197 void insertConditions(bool Loops); 294 Loops[Exit] = N->getEntry(); 305 Loops[Succ] = BB; 390 if (Visited.count(Other) && !Loops.count(Other) && 431 Loops.clear(); 452 void StructurizeCFG::insertConditions(bool Loops) { argument 453 BranchVector &Conds = Loops ? LoopConds : Conditions; 454 Value *Default = Loops ? BoolTrue : BoolFalse; 466 PhiInserter.AddAvailableValue(Loops [all...] |
H A D | SampleProfile.cpp | 128 PostDominatorTree *PostDomTree, LoopInfo *Loops); 1038 LoopInfo *Loops) { 1050 LI = Loops; 1036 emitAnnotations(Function &F, DominatorTree *DomTree, PostDominatorTree *PostDomTree, LoopInfo *Loops) argument
|
/external/llvm/lib/CodeGen/ |
H A D | CalcSpillWeights.cpp | 129 loop = Loops.getLoopFor(mbb);
|
H A D | EarlyIfConversion.cpp | 586 MachineLoopInfo *Loops; member in class:__anon25740::EarlyIfConverter 648 if (!Loops) 653 Loops->removeBlock(Removed[i]); 791 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
H A D | ExecutionDepsFix.cpp | 748 SmallVector<MachineBasicBlock*, 16> Loops; local 754 Loops.push_back(MBB); 764 for (unsigned i = 0, e = Loops.size(); i != e; ++i) { 765 MachineBasicBlock *MBB = Loops[i];
|
H A D | MachineTraceMetrics.cpp | 42 MRI(nullptr), Loops(nullptr) { 58 Loops = &getAnalysis<MachineLoopInfo>(); 160 return MTM.Loops->getLoopFor(MBB); 419 const MachineLoopInfo *Loops; 423 : Blocks(blocks), Loops(loops), Downward(false) {} 444 if (const MachineLoop *FromLoop = LB.Loops->getLoopFor(From)) { 449 if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To))) 465 LoopBounds Bounds(BlockInfo, MTM.Loops);
|
H A D | LiveRangeEdit.cpp | 408 const MachineLoopInfo &Loops, 410 VirtRegAuxInfo VRAI(MF, LIS, Loops, MBFI); 407 calculateRegClassAndHint(MachineFunction &MF, const MachineLoopInfo &Loops, const MachineBlockFrequencyInfo &MBFI) argument
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64ConditionalCompares.cpp | 731 MachineLoopInfo *Loops; member in class:__anon25936::AArch64ConditionalCompares 802 if (!Loops) 805 Loops->removeBlock(Removed[i]); 900 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
/external/oprofile/events/i386/westmere/ |
H A D | events | 28 event:0x20 counters:0,1,2,3 um:x01 minimum:2000000 name:LSD_OVERFLOW : Loops that can't stream from the instruction queue
|