Lines Matching full:timestamp
101 // We assume this number is a power of two when wrapping indices into the timestamp array.
115 // Set all the historical flush timestamps to initially be at the beginning of time (timestamp
126 // We must set the timestamp before adding to the array in case the timestamp wraps and we wind
358 // When the timestamp overflows validate() is called. validate() checks that resources in
468 uint32_t oldestResourceTimestamp = fPurgeableQueue.peek()->cacheAccess().timestamp();
539 // a timestamp after the wrap.
543 // Reset all the timestamps. We sort the resources by timestamp and then assign
563 // timestamp and assign new timestamps.
568 uint32_t tsP = sortedPurgeableResources[currP]->cacheAccess().timestamp();
569 uint32_t tsNP = fNonpurgeableResources[currNP]->cacheAccess().timestamp();
597 // count should be the next timestamp we return.
611 // get the timestamp before accessing fFlushTimestamps because getNextTimestamp will
612 // reallocate fFlushTimestamps on timestamp overflow.
613 uint32_t timestamp = this->getNextTimestamp();
614 fFlushTimestamps[fLastFlushTimestampIndex] = timestamp;
