Home
last modified time | relevance | path

Searched refs:getDepth (Results 1 – 25 of 86) sorted by relevance

1234

/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp148 int LDepth = left->getDepth(); in BUCompareLatency()
149 int RDepth = right->getDepth(); in BUCompareLatency()
169 int spread = (int)left->getDepth() - (int)right->getDepth(); in pickBest()
172 << left->getDepth() << " != SU(" << right->NodeNum in pickBest()
173 << "): " << right->getDepth() << "\n"); in pickBest()
174 return left->getDepth() < right->getDepth() ? right : left; in pickBest()
230 if (left->getDepth() != right->getDepth()) in pickBest()
231 return (left->getDepth() < right->getDepth()) ? right : left; in pickBest()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp138 if (StageCycle >= (int)RequiredScoreboard.getDepth()) { in getHazardType()
139 assert((StageCycle - Stalls) < (int)RequiredScoreboard.getDepth() && in getHazardType()
193 assert(((cycle + i) < RequiredScoreboard.getDepth()) && in EmitInstruction()
237 ReservedScoreboard[ReservedScoreboard.getDepth()-1] = 0; in RecedeCycle()
239 RequiredScoreboard[RequiredScoreboard.getDepth()-1] = 0; in RecedeCycle()
H A DScheduleDAG.cpp248 if (NewDepth <= getDepth()) in setDepthToAtLeast()
330 unsigned MaxDepth = BestI->getSUnit()->getDepth(); in biasCriticalPath()
333 if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth) { in biasCriticalPath()
334 MaxDepth = I->getSUnit()->getDepth(); in biasCriticalPath()
352 dbgs() << " Depth : " << getDepth() << "\n"; in dumpAttributes()
411 (isBottomUp ? SUnit.getHeight() : SUnit.getDepth()) > in VerifyScheduledDAG()
H A DPostRASchedulerList.cpp521 assert(CurCycle >= SU->getDepth() && in ScheduleNodeTopDown()
574 if (PendingQueue[i]->getDepth() <= CurCycle) { in ListScheduleTopDown()
580 } else if (PendingQueue[i]->getDepth() < MinDepth) in ListScheduleTopDown()
581 MinDepth = PendingQueue[i]->getDepth(); in ListScheduleTopDown()
H A DCriticalAntiDepBreaker.cpp147 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; in CriticalPathStep()
456 if (!Max || SU.getDepth() + SU.Latency > Max->getDepth() + Max->Latency) in BreakAntiDependencies()
464 << (Max->getDepth() + Max->Latency) << "\n"); in BreakAntiDependencies()
H A DMachineScheduler.cpp1853 unsigned LiveOutDepth = DefSU->getDepth() + DefSU->Latency; in computeCyclicCriticalPath()
1870 if (LiveOutDepth > SU->getDepth()) in computeCyclicCriticalPath()
1871 CyclicLatency = LiveOutDepth - SU->getDepth(); in computeCyclicCriticalPath()
3089 if (SU->getDepth() > TopLatency) { in bumpNode()
3090 TopLatency = SU->getDepth(); in bumpNode()
3436 Latency = Cand.SU->getDepth(); in traceCandidate()
3445 Latency = Cand.SU->getDepth(); in traceCandidate()
3509 if (std::max(TryCand.SU->getDepth(), Cand.SU->getDepth()) > in tryLatency()
3511 if (tryLess(TryCand.SU->getDepth(), Cand.SU->getDepth(), in tryLatency()
3528 if (tryGreater(TryCand.SU->getDepth(), Cand.SU->getDepth(), in tryLatency()
[all …]
H A DVLIWMachineScheduler.cpp230 if (SU.getDepth() > maxD) in schedule()
231 maxD = SU.getDepth(); in schedule()
637 ResCount += (SU->getDepth() * ScaleTwo); in SchedulingCost()
642 dbgstr << "d" << std::setw(3) << SU->getDepth() << "|"; in SchedulingCost()
H A DMachineCombiner.cpp93 unsigned getDepth(SmallVectorImpl<MachineInstr *> &InsInstrs,
204 MachineCombiner::getDepth(SmallVectorImpl<MachineInstr *> &InsInstrs, in getDepth() function in MachineCombiner
360 getDepth(InsInstrs, InstrIdxForVirtReg, BlockTrace, *MBB); in improvesCriticalPathLen()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp120 SuccSU->setDepthToAtLeast(SU->getDepth() + D.getLatency()); in releaseSucc()
147 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!"); in scheduleNodeTopDown()
180 if (PendingQueue[i]->getDepth() == CurCycle) { in listScheduleTopDown()
188 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?"); in listScheduleTopDown()
H A DScheduleDAGRRList.cpp2527 int LDepth = left->getDepth() - LPenalty; in BUCompareLatency()
2528 int RDepth = right->getDepth() - RPenalty; in BUCompareLatency()
2635 if (left->getDepth() != right->getDepth()) in BURRSort()
2636 return left->getDepth() < right->getDepth(); in BURRSort()
2796 int spread = (int)left->getDepth() - (int)right->getDepth(); in operator ()()
2799 << left->getDepth() << " != SU(" << right->NodeNum in operator ()()
2800 << "): " << right->getDepth() << "\n"); in operator ()()
2801 return left->getDepth() < right->getDepth(); in operator ()()
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DSemaInternal.h63 return std::make_pair(TTP->getDepth(), TTP->getIndex()); in getDepthAndIndex()
66 return std::make_pair(NTTP->getDepth(), NTTP->getIndex()); in getDepthAndIndex()
69 return std::make_pair(TTP->getDepth(), TTP->getIndex()); in getDepthAndIndex()
76 return std::make_pair(TTP->getDepth(), TTP->getIndex()); in getDepthAndIndex()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h548 while (A->getDepth() > B->getDepth())
550 while (B->getDepth() > A->getDepth())
573 return Cycle->getDepth(); in getCycleDepth()
H A DGenericUniformityImpl.h877 ExitLevelCycle ? ExitLevelCycle->getDepth() : 0; in propagateCycleExitDivergence()
880 while (DivCycle && DivCycle->getDepth() > CycleExitDepth) { in propagateCycleExitDivergence()
1096 return A->getDepth() > B->getDepth(); in analyzeControlDivergence()
/freebsd/contrib/llvm-project/clang/lib/Index/
H A DCommentToXML.cpp67 if (LHS->getDepth() > 1) in operator ()()
69 if (RHS->getDepth() > 1) in operator ()()
73 if (LHS->getDepth() == 1 && RHS->getDepth() == 1) in operator ()()
387 if (C->getDepth() == 1) in visitTParamCommandComment()
402 if (C->getDepth() == 1) in visitTParamCommandComment()
788 if (C->isPositionValid() && C->getDepth() == 1) { in visitTParamCommandComment()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DVLIWMachineScheduler.h180 MaxPath = std::max(MaxPath, isTop() ? SU.getHeight() : SU.getDepth()); in init()
206 unsigned PathLength = isTop() ? SU->getHeight() : SU->getDepth(); in isLatencyBound()
H A DScoreboardHazardRecognizer.h58 size_t getDepth() const { return Depth; } in getDepth() function
H A DScheduleDFS.h159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
H A DMachinePipeliner.h404 unsigned getDepth(SUnit *Node) { return Node->getDepth(); } in getDepth() function
584 MaxDepth = std::max(MaxDepth, SSD->getDepth(SU)); in computeNodeSetInfo()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DRegionPrinter.cpp99 << ((R.getDepth() * 2 % 12) + 1) << "\n"; in printRegionCluster()
104 << ((R.getDepth() * 2 % 12) + 2) << "\n"; in printRegionCluster()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DLegacyPassManager.cpp558 PDepth = P->getResolver()->getPMDataManager().getDepth(); in setLastUser()
581 unsigned APDepth = AR->getPMDataManager().getDepth(); in setLastUser()
1006 unsigned PDepth = this->getDepth(); in add()
1014 RDepth = DM.getDepth(); in add()
1147 << std::string(getDepth() * 2 + 1, ' '); in dumpPassInfo()
1214 dbgs() << (const void*)P << std::string(getDepth()*2+3, ' ') << Msg << " Analyses:"; in dumpAnalysisUsage()
1661 assert(PM->getDepth()==0 && "Pass Manager depth set too early"); in push()
1671 PM->setDepth(this->top()->getDepth()+1); in push()
/freebsd/contrib/llvm-project/clang/lib/Frontend/
H A DFrontendActions.cpp539 if (TTPT->getDepth() > 0) in printEntryName()
540 OS << "(at depth " << TTPT->getDepth() << ") "; in printEntryName()
550 if (Decl->getDepth() > 0) in printEntryName()
551 OS << "(at depth " << Decl->getDepth() << ") "; in printEntryName()
559 if (Decl->getDepth() > 0) in printEntryName()
560 OS << "(at depth " << Decl->getDepth() << ") "; in printEntryName()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaTemplateInstantiate.cpp220 for (unsigned I = 0, N = TTP->getDepth() + 1; I != N; ++I) in HandleDefaultTempArgIntoTempTempParam()
1926 if (TTP->getDepth() < TemplateArgs.getNumLevels()) { in TransformDecl()
1931 if (!TemplateArgs.hasTemplateArgument(TTP->getDepth(), in TransformDecl()
1937 TemplateArgument Arg = TemplateArgs(TTP->getDepth(), TTP->getPosition()); in TransformDecl()
2034 if (TTP->getDepth() < TemplateArgs.getNumLevels()) { in TransformFirstQualifierInScope()
2036 TemplateArgument Arg = TemplateArgs(TTP->getDepth(), TTP->getIndex()); in TransformFirstQualifierInScope()
2123 if (TTP->getDepth() < TemplateArgs.getNumLevels()) { in TransformTemplateName()
2128 if (!TemplateArgs.hasTemplateArgument(TTP->getDepth(), in TransformTemplateName()
2134 TemplateArgument Arg = TemplateArgs(TTP->getDepth(), TTP->getPosition()); in TransformTemplateName()
2146 TemplateArgs.getAssociatedDecl(TTP->getDepth()); in TransformTemplateName()
[all …]
H A DSemaTemplateVariadic.cpp52 if (FTD && FTD->getTemplateParameters()->getDepth() >= DepthLimit) in addUnexpanded()
64 if (T->getDepth() < DepthLimit) in addUnexpanded()
286 DepthLimit = TPL->getDepth(); in TraverseLambdaExpr()
773 Depth = TTP->getDepth(); in CheckParameterPacksForExpansion()
954 Depth = TTP->getDepth(); in getNumArgumentsInExpansionFromUnexpanded()
/freebsd/contrib/llvm-project/clang/include/clang/Parse/
H A DRAIIObjectsForParser.h426 unsigned short &getDepth() { in getDepth() function
470 if (getDepth() < P.getLangOpts().BracketDepth) { in consumeOpen()
/freebsd/contrib/llvm-project/clang/lib/AST/ByteCode/
H A DInterpFrame.h127 unsigned getDepth() const { return Depth; } in getDepth() function

1234