Lines Matching defs:next
1775 * have the reclaim flag set next time
2143 struct folio *folio, *next;
2147 list_for_each_entry_safe(folio, next, folio_list, lru) {
3301 * leaf entries, the aging carries them over to the next generation in
3450 lruvec->mm_state.tail = lruvec->mm_state.tail->next;
3557 * 2. It started the next iteration: it needs to reset the Bloom filter
3576 mm_state->head = mm_state->head->next;
3585 mm_state->tail = mm_state->head->next;
4076 goto next;
4081 goto next;
4086 goto next;
4089 goto next;
4101 next:
4122 unsigned long next;
4140 for (i = pmd_index(start), addr = start; addr != end; i++, addr = next) {
4143 next = pmd_addr_end(addr, end);
4184 if (!walk_pte_range(&val, addr, next, args))
4189 /* carry over to the next generation */
4205 unsigned long next;
4212 for (i = pud_index(start), addr = start; addr != end; i++, addr = next) {
4215 next = pud_addr_end(addr, end);
4220 walk_pmd_range(&val, addr, next, args);
4370 goto next;
4375 next:
4399 int prev, next;
4428 next = lru_gen_from_seq(lrugen->max_seq + 1);
4434 lrugen->nr_pages[next][type][zone];
4447 WRITE_ONCE(lrugen->timestamps[next], jiffies);
5137 struct folio *next;
5162 list_for_each_entry_safe_reverse(folio, next, &list, lru) {
5982 .next = lru_gen_seq_next,
6086 char *cur, *next;
6115 next = buf;
6116 next[len] = '\0';
6118 while ((cur = strsep(&next, ",;\n"))) {
6229 lruvec->lrugen.list.next = LIST_POISON1;
7496 * re-evaluate if boosting is required when kswapd next wakes.