Searched refs:mIdx (Results 1 – 4 of 4) sorted by relevance
54 , mIdx(0)76 if (code == mEntries[mIdx].mCode in log()77 && nowNs - mEntries[mIdx].mLastTime < mAggregateNs) { in log()78 mEntries[mIdx].mCount++; in log()79 mEntries[mIdx].mLastTime = nowNs; in log()84 if (++mIdx >= mEntries.size()) { in log()85 mIdx = 0; in log()87 mEntries[mIdx].setFirstError(code, nowNs); in log()120 mEntries[(mIdx + numberOfEntries - offset) % numberOfEntries];130 mEntries[(mIdx + numberOfEntries - offset) % numberOfEntries];[all …]
100 size_t mIdx; // next usable index in mEntries variable
33 private int mIdx; field in VhalEventVerifier53 mIdx = 0; in VhalEventVerifier()66 if (mIdx >= mExpectedEvents.size()) { in verify()69 CarPropertyValue expectedEvent = mExpectedEvents.get(mIdx); in verify()71 mMismatchedEvents.add(new MismatchedEventPair(expectedEvent, nextEvent, mIdx)); in verify()73 if (++mIdx == mExpectedEvents.size()) { in verify()
51 , mIdx(0) in PowerLog()91 mEntries[mIdx++] = std::make_pair(nowNs, 0.f); in log()96 mEntries[mIdx++] = std::make_pair(mCurrentTime, mCurrentEnergy); in log()99 if (mIdx >= mEntries.size()) { in log()100 mIdx -= mEntries.size(); in log()129 const size_t idx = (mIdx + numberOfEntries - offset - 1) % numberOfEntries; in dumpToString()182 const size_t idx = (mIdx + numberOfEntries - offset - 1) % numberOfEntries; in dumpToString()