Searched refs:oldest (Results 1 – 6 of 6) sorted by relevance
236 LogTimeEntry *oldest = NULL; in prune() local245 && (!oldest || (oldest->mStart > entry->mStart))) { in prune()246 oldest = entry; in prune()257 if (oldest && (oldest->mStart <= e->getMonotonicTime())) { in prune()310 if (oldest && (oldest->mStart <= e->getMonotonicTime())) { in prune()355 if (oldest && (oldest->mStart <= e->getMonotonicTime())) { in prune()359 oldest->release_Locked(); in prune()361 oldest->triggerSkip_Locked(pruneRows); in prune()387 if (oldest && (oldest->mStart <= e->getMonotonicTime())) { in prune()390 oldest->release_Locked(); in prune()[all …]
184 void format(char **strp, uid_t uid, unsigned int logMask, log_time oldest);
513 uid_t uid, unsigned int logMask, log_time oldest) { in format() argument567 d = t.nsec() - oldest.nsec(); in format()
418 struct log_list *oldest = NULL; in android_logger_list_flush() local424 if (!oldest in android_logger_list_flush()425 || (entry->entry.entry.sec < oldest->entry.entry.sec) in android_logger_list_flush()426 || ((entry->entry.entry.sec == oldest->entry.entry.sec) in android_logger_list_flush()427 && (entry->entry.entry.nsec < oldest->entry.entry.nsec))) { in android_logger_list_flush()428 oldest = entry; in android_logger_list_flush()432 if (!oldest) { in android_logger_list_flush()440 || (oldest->entry.entry.sec < firstentry->entry.entry.sec) in android_logger_list_flush()441 || ((oldest->entry.entry.sec == firstentry->entry.entry.sec) in android_logger_list_flush()442 && (oldest->entry.entry.nsec < firstentry->entry.entry.nsec))) { in android_logger_list_flush()[all …]
668 int oldest = -1; in find_and_open_tombstone() local675 if (oldest < 0 || sb.st_mtime < oldest_sb.st_mtime) { in find_and_open_tombstone()676 oldest = i; in find_and_open_tombstone()692 if (oldest < 0) { in find_and_open_tombstone()694 oldest = 0; in find_and_open_tombstone()698 snprintf(path, sizeof(path), TOMBSTONE_TEMPLATE, oldest); in find_and_open_tombstone()
238 Entry* oldest = mOldest; in rehash() local243 for (Entry* p = oldest; p != NULL; p = p->child) { in rehash()