Lines Matching full:pidx
1705 unsigned PIdx = PI->ProcResourceIdx;
1706 unsigned Factor = SchedModel->getResourceFactor(PIdx);
1707 RemainingCounts[PIdx] += (Factor * PI->Cycles);
1744 getNextResourceCycle(unsigned PIdx, unsigned Cycles) {
1745 unsigned NextUnreserved = ReservedCycles[PIdx];
1832 for (unsigned PIdx = 1, PEnd = SchedModel->getNumProcResourceKinds();
1833 PIdx != PEnd; ++PIdx) {
1834 unsigned OtherCount = getResourceCount(PIdx) + Rem->RemainingCounts[PIdx];
1837 OtherCritIdx = PIdx;
1927 void SchedBoundary::incExecutedResources(unsigned PIdx, unsigned Count) {
1928 ExecutedResCounts[PIdx] += Count;
1929 if (ExecutedResCounts[PIdx] > MaxExecutedResCount)
1930 MaxExecutedResCount = ExecutedResCounts[PIdx];
1941 countResource(unsigned PIdx, unsigned Cycles, unsigned NextCycle) {
1942 unsigned Factor = SchedModel->getResourceFactor(PIdx);
1944 DEBUG(dbgs() << " " << SchedModel->getResourceName(PIdx)
1948 incExecutedResources(PIdx, Count);
1949 assert(Rem->RemainingCounts[PIdx] >= Count && "resource double counted");
1950 Rem->RemainingCounts[PIdx] -= Count;
1954 if (ZoneCritResIdx != PIdx && (getResourceCount(PIdx) > getCriticalCount())) {
1955 ZoneCritResIdx = PIdx;
1957 << SchedModel->getResourceName(PIdx) << ": "
1958 << getResourceCount(PIdx) / SchedModel->getLatencyFactor() << "c\n");
1961 unsigned NextAvailable = getNextResourceCycle(PIdx, Cycles);
1964 << SchedModel->getProcResource(PIdx)->Name << " reserved until @"
2049 unsigned PIdx = PI->ProcResourceIdx;
2050 if (SchedModel->getProcResource(PIdx)->BufferSize == 0) {
2052 ReservedCycles[PIdx] =
2053 std::max(getNextResourceCycle(PIdx, 0), NextCycle + PI->Cycles);
2056 ReservedCycles[PIdx] = NextCycle;
