Lines Matching refs:InstrToCycle

2842       InstrToCycle.insert(std::make_pair(SU, curCycle));  in insert()
2868     std::map<SUnit *, int>::const_iterator it = InstrToCycle.find(PrevSU);  in earliestCycleInChain()
2869     if (it == InstrToCycle.end())  in earliestCycleInChain()
2891     std::map<SUnit *, int>::const_iterator it = InstrToCycle.find(SuccSU);  in latestCycleInChain()
2892     if (it == InstrToCycle.end())  in latestCycleInChain()
3159     if (InstrToCycle.count(Pred.getSUnit()) && !DAG->isBackedge(SU, Pred))  in onlyHasLoopCarriedOutputOrOrderPreds()
3162     if (InstrToCycle.count(Succ.getSUnit()) && DAG->isBackedge(SU, Succ))  in onlyHasLoopCarriedOutputOrOrderPreds()
3204       NewLastCycle = std::max(NewLastCycle, InstrToCycle[&SU]);  in normalizeNonPipelinedInstructions()
3211       NewCycle = std::max(InstrToCycle[Dep.getSUnit()], NewCycle);  in normalizeNonPipelinedInstructions()
3213     int OldCycle = InstrToCycle[&SU];  in normalizeNonPipelinedInstructions()
3215       InstrToCycle[&SU] = NewCycle;  in normalizeNonPipelinedInstructions()
3242     int CycleDef = InstrToCycle[&SU];  in isValidSchedule()
3249           if (InstrToCycle[SI.getSUnit()] <= CycleDef)  in isValidSchedule()