Home
last modified time | relevance | path

Searched defs:SU (Results 1 – 25 of 31) sorted by relevance

12

/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp43 bool VLIWResourceModel::isResourceAvailable(SUnit *SU) { in isResourceAvailable()
83 bool VLIWResourceModel::reserveResources(SUnit *SU) { in reserveResources()
182 while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) { in schedule() local
220 void ConvergingVLIWScheduler::releaseTopNode(SUnit *SU) { in releaseTopNode()
237 void ConvergingVLIWScheduler::releaseBottomNode(SUnit *SU) { in releaseBottomNode()
269 bool ConvergingVLIWScheduler::SchedBoundary::checkHazard(SUnit *SU) { in checkHazard()
280 void ConvergingVLIWScheduler::SchedBoundary::releaseNode(SUnit *SU, in releaseNode()
321 void ConvergingVLIWScheduler::SchedBoundary::bumpNode(SUnit *SU) { in bumpNode()
359 SUnit *SU = *(Pending.begin()+i); in releasePending() local
379 void ConvergingVLIWScheduler::SchedBoundary::removeReady(SUnit *SU) { in removeReady()
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp71 ResourcePriorityQueue::numberRCValPredInSU(SUnit *SU, unsigned RCId) { in numberRCValPredInSU()
108 unsigned ResourcePriorityQueue::numberRCValSuccInSU(SUnit *SU, in numberRCValSuccInSU()
146 static unsigned numberCtrlDepsInSU(SUnit *SU) { in numberCtrlDepsInSU()
156 static unsigned numberCtrlPredInSU(SUnit *SU) { in numberCtrlPredInSU()
174 SUnit *SU = &(*SUnits)[i]; in initNodes() local
216 SUnit *ResourcePriorityQueue::getSingleUnscheduledPred(SUnit *SU) { in getSingleUnscheduledPred()
232 void ResourcePriorityQueue::push(SUnit *SU) { in push()
247 bool ResourcePriorityQueue::isResourceAvailable(SUnit *SU) { in isResourceAvailable()
290 void ResourcePriorityQueue::reserveResources(SUnit *SU) { in reserveResources()
327 signed ResourcePriorityQueue::rawRegPressureDelta(SUnit *SU, unsigned RCId) { in rawRegPressureDelta()
[all …]
DScheduleDAGRRList.cpp185 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable()
191 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { in WillCreateCycle()
198 void AddPred(SUnit *SU, const SDep &D) { in AddPred()
206 void RemovePred(SUnit *SU, const SDep &D) { in RemovePred()
212 bool isReady(SUnit *SU) { in isReady()
364 void ScheduleDAGRRList::ReleasePred(SUnit *SU, const SDep *PredEdge) { in ReleasePred()
524 void ScheduleDAGRRList::ReleasePredecessors(SUnit *SU) { in ReleasePredecessors()
621 void ScheduleDAGRRList::AdvancePastStalls(SUnit *SU) { in AdvancePastStalls()
663 void ScheduleDAGRRList::EmitNode(SUnit *SU) { in EmitNode()
705 void ScheduleDAGRRList::ScheduleNodeBottomUp(SUnit *SU) { in ScheduleNodeBottomUp()
[all …]
DScheduleDAGVLIW.cpp115 void ScheduleDAGVLIW::releaseSucc(SUnit *SU, const SDep &D) { in releaseSucc()
139 void ScheduleDAGVLIW::releaseSuccessors(SUnit *SU) { in releaseSuccessors()
153 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) { in scheduleNodeTopDown()
DScheduleDAGFast.cpp87 void AddPred(SUnit *SU, const SDep &D) { in AddPred()
93 void RemovePred(SUnit *SU, const SDep &D) { in RemovePred()
139 void ScheduleDAGFast::ReleasePred(SUnit *SU, SDep *PredEdge) { in ReleasePred()
160 void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigned CurCycle) { in ReleasePredecessors()
182 void ScheduleDAGFast::ScheduleNodeBottomUp(SUnit *SU, unsigned CurCycle) { in ScheduleNodeBottomUp()
212 SUnit *ScheduleDAGFast::CopyAndMoveSuccessors(SUnit *SU) { in CopyAndMoveSuccessors()
387 void ScheduleDAGFast::InsertCopiesAndMoveSuccs(SUnit *SU, unsigned Reg, in InsertCopiesAndMoveSuccs()
448 static bool CheckForLiveRegDef(SUnit *SU, unsigned Reg, in CheckForLiveRegDef()
469 bool ScheduleDAGFast::DelayForLiveRegsBottomUp(SUnit *SU, in DelayForLiveRegsBottomUp()
DScheduleDAGSDNodes.cpp78 SUnit *SU = &SUnits.back(); in newSUnit() local
90 SUnit *SU = newSUnit(Old->getNode()); in Clone() local
408 SUnit *SU = CallSUnits.pop_back_val(); in BuildSchedUnits() local
429 SUnit *SU = &SUnits[su]; in AddSchedEdges() local
552 ScheduleDAGSDNodes::RegDefIter::RegDefIter(const SUnit *SU, in RegDefIter()
577 void ScheduleDAGSDNodes::InitNumRegDefsLeft(SUnit *SU) { in InitNumRegDefsLeft()
585 void ScheduleDAGSDNodes::computeLatency(SUnit *SU) { in computeLatency()
670 if (SUnit *SU = Sequence[i]) in dumpSchedule() local
758 EmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap, in EmitPhysRegCopy() argument
818 SUnit *SU = Sequence[i]; in EmitSchedule() local
/external/llvm/lib/Target/R600/
DR600MachineScheduler.cpp59 SUnit *SU = 0; in pickNode() local
159 void R600SchedStrategy::schedNode(SUnit *SU, bool IsTopNode) { in schedNode()
207 void R600SchedStrategy::releaseTopNode(SUnit *SU) { in releaseTopNode()
211 void R600SchedStrategy::releaseBottomNode(SUnit *SU) { in releaseBottomNode()
321 int R600SchedStrategy::getInstKind(SUnit* SU) { in getInstKind()
350 SUnit *SU = *It; in PopInst() local
460 SUnit *SU = AttemptFillSlot(Chan); in pickAlu() local
474 SUnit *SU = 0; in pickOther() local
/external/llvm/lib/CodeGen/
DLatencyPriorityQueue.cpp55 SUnit *LatencyPriorityQueue::getSingleUnscheduledPred(SUnit *SU) { in getSingleUnscheduledPred()
72 void LatencyPriorityQueue::push(SUnit *SU) { in push()
91 void LatencyPriorityQueue::scheduledNode(SUnit *SU) { in scheduledNode()
104 void LatencyPriorityQueue::AdjustPriorityOfUnscheduledPreds(SUnit *SU) { in AdjustPriorityOfUnscheduledPreds()
133 void LatencyPriorityQueue::remove(SUnit *SU) { in remove()
DScheduleDAG.cpp183 SUnit *SU = WorkList.pop_back_val(); in setDepthDirty() local
199 SUnit *SU = WorkList.pop_back_val(); in setHeightDirty() local
472 SUnit *SU = &SUnits[i]; in InitDAGTopologicalSorting() local
488 SUnit *SU = WorkList.back(); in InitDAGTopologicalSorting() local
494 SUnit *SU = I->getSUnit(); in InitDAGTopologicalSorting() local
507 SUnit *SU = &SUnits[i]; in InitDAGTopologicalSorting() local
545 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS()
602 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) { in WillCreateCycle()
615 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable()
DMachineScheduler.cpp348 void ScheduleDAGMI::releaseSucc(SUnit *SU, SDep *SuccEdge) { in releaseSucc()
371 void ScheduleDAGMI::releaseSuccessors(SUnit *SU) { in releaseSuccessors()
382 void ScheduleDAGMI::releasePred(SUnit *SU, SDep *PredEdge) { in releasePred()
405 void ScheduleDAGMI::releasePredecessors(SUnit *SU) { in releasePredecessors()
565 while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) { in schedule() local
624 SUnit *SU = &(*I); in findRootsAndBiasEdges() local
675 void ScheduleDAGMI::scheduleMI(SUnit *SU, bool IsTopNode) { in scheduleMI()
715 void ScheduleDAGMI::updateQueues(SUnit *SU, bool IsTopNode) { in updateQueues()
763 if (SUnit *SU = getSUnit(&(*MI))) in dumpSchedule() local
780 SUnit *SU; member
[all …]
DScheduleDAGInstrs.cpp244 void ScheduleDAGInstrs::addPhysRegDataDeps(SUnit *SU, unsigned OperIdx) { in addPhysRegDataDeps()
287 void ScheduleDAGInstrs::addPhysRegDeps(SUnit *SU, unsigned OperIdx) { in addPhysRegDeps()
366 void ScheduleDAGInstrs::addVRegDefDeps(SUnit *SU, unsigned OperIdx) { in addVRegDefDeps()
404 void ScheduleDAGInstrs::addVRegUseDeps(SUnit *SU, unsigned OperIdx) { in addVRegUseDeps()
601 SUnit *SU, SUnit *ExitSU, std::set<SUnit *> &CheckList, in adjustChainDeps()
674 SUnit *SU = newSUnit(MI); in initSUnits() local
749 SUnit *SU = MISUnitMap[MI]; in buildSchedGraph() local
1048 void visitPreorder(const SUnit *SU) { in visitPreorder()
1056 void visitPostorderNode(const SUnit *SU) { in visitPostorderNode()
1208 void follow(const SUnit *SU) { in follow()
[all …]
DScoreboardHazardRecognizer.cpp118 ScoreboardHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { in getHazardType()
178 void ScoreboardHazardRecognizer::EmitInstruction(SUnit *SU) { in EmitInstruction()
DPostRASchedulerList.cpp245 if (SUnit *SU = Sequence[i]) in dumpSchedule() local
563 void SchedulePostRATDList::ReleaseSucc(SUnit *SU, SDep *SuccEdge) { in ReleaseSucc()
598 void SchedulePostRATDList::ReleaseSuccessors(SUnit *SU) { in ReleaseSuccessors()
608 void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) { in ScheduleNodeTopDown()
752 if (SUnit *SU = Sequence[i]) in EmitSchedule() local
DScheduleDAGPrinter.cpp79 std::string DOTGraphTraits<ScheduleDAG*>::getNodeLabel(const SUnit *SU, in getNodeLabel()
DCriticalAntiDepBreaker.cpp126 static const SDep *CriticalPathStep(const SUnit *SU) { in CriticalPathStep()
424 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies() local
623 const SUnit *SU = MISUnitMap[Q->second->getParent()]; in BreakAntiDependencies() local
DAggressiveAntiDepBreaker.cpp259 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) { in AntiDepEdges()
275 static const SUnit *CriticalPathStep(const SUnit *SU) { in CriticalPathStep()
719 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies() local
731 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies() local
908 const SUnit *SU = MISUnitMap[Q->second.Operand->getParent()]; in BreakAntiDependencies() local
DDFAPacketizer.cpp169 SUnit *SU = &VLIWScheduler->SUnits[i]; in PacketizeMIs() local
/external/llvm/lib/Target/PowerPC/
DPPCHazardRecognizers.cpp26 void PPCScoreboardHazardRecognizer::EmitInstruction(SUnit *SU) { in EmitInstruction()
36 PPCScoreboardHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { in getHazardType()
137 getHazardType(SUnit *SU, int Stalls) { in getHazardType()
197 void PPCHazardRecognizer970::EmitInstruction(SUnit *SU) { in EmitInstruction()
/external/llvm/lib/Target/ARM/
DARMHazardRecognizer.cpp35 ARMHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { in getHazardType()
85 void ARMHazardRecognizer::EmitInstruction(SUnit *SU) { in EmitInstruction()
/external/llvm/include/llvm/CodeGen/
DLatencyPriorityQueue.h57 void addNode(const SUnit *SU) { in addNode()
61 void updateNode(const SUnit *SU) { in updateNode()
DScheduleDFS.h148 unsigned getNumInstrs(const SUnit *SU) const { in getNumInstrs()
161 ILPValue getILP(const SUnit *SU) const { in getILP()
172 unsigned getSubtreeID(const SUnit *SU) const { in getSubtreeID()
DScheduleDAGInstrs.h35 SUnit *SU; member
47 SUnit *SU; member
160 const MCSchedClassDesc *getSchedClass(SUnit *SU) const { in getSchedClass()
DResourcePriorityQueue.h88 void addNode(const SUnit *SU) { in addNode()
92 void updateNode(const SUnit *SU) {} in updateNode()
DMachineScheduler.h156 bool isInQueue(SUnit *SU) const { return (SU->NodeQueueId & ID); } in isInQueue()
172 iterator find(SUnit *SU) { in find()
176 void push(SUnit *SU) { in push()
/external/clang/lib/StaticAnalyzer/Core/
DSimpleConstraintManager.h25 SubEngine *SU; variable

12