Home
last modified time | relevance | path

Searched refs:min_seq (Results 1 – 8 of 8) sorted by relevance

/linux-6.12.1/mm/
Dworkingset.c236 unsigned long min_seq; in lru_gen_eviction() local
250 min_seq = READ_ONCE(lrugen->min_seq[type]); in lru_gen_eviction()
251 token = (min_seq << LRU_REFS_WIDTH) | max(refs - 1, 0); in lru_gen_eviction()
253 hist = lru_hist_from_seq(min_seq); in lru_gen_eviction()
267 unsigned long min_seq; in lru_gen_test_recent() local
276 min_seq = READ_ONCE((*lruvec)->lrugen.min_seq[file]); in lru_gen_test_recent()
277 return (*token >> LRU_REFS_WIDTH) == (min_seq & (EVICTION_MASK >> LRU_REFS_WIDTH)); in lru_gen_test_recent()
304 hist = lru_hist_from_seq(READ_ONCE(lrugen->min_seq[type])); in lru_gen_refault()
Dvmscan.c2611 unsigned long min_seq[ANON_AND_FILE] = { \
2612 READ_ONCE((lruvec)->lrugen.min_seq[LRU_GEN_ANON]), \
2613 READ_ONCE((lruvec)->lrugen.min_seq[LRU_GEN_FILE]), \
2661 return lruvec->lrugen.max_seq - lruvec->lrugen.min_seq[type] + 1; in get_nr_gens()
3071 int hist = lru_hist_from_seq(lrugen->min_seq[type]); in read_ctrl_pos()
3087 unsigned long seq = carryover ? lrugen->min_seq[type] : lrugen->max_seq + 1; in reset_ctrl_pos()
3163 int new_gen, old_gen = lru_gen_from_seq(lrugen->min_seq[type]); in folio_inc_gen()
3722 int new_gen, old_gen = lru_gen_from_seq(lrugen->min_seq[type]); in inc_min_seq()
3748 WRITE_ONCE(lrugen->min_seq[type], lrugen->min_seq[type] + 1); in inc_min_seq()
3764 while (min_seq[type] + MIN_NR_GENS <= lrugen->max_seq) { in try_to_inc_min_seq()
[all …]
/linux-6.12.1/fs/btrfs/
Dtree-mod-log.c81 u64 min_seq = BTRFS_SEQ_LAST; in btrfs_put_tree_mod_seq() local
106 min_seq = first->seq; in btrfs_put_tree_mod_seq()
117 if (tm->seq >= min_seq) in btrfs_put_tree_mod_seq()
474 u64 start, u64 min_seq, in __tree_mod_log_search() argument
491 } else if (cur->seq < min_seq) { in __tree_mod_log_search()
499 } else if (cur->seq > min_seq) { in __tree_mod_log_search()
521 u64 start, u64 min_seq) in tree_mod_log_search_oldest() argument
523 return __tree_mod_log_search(fs_info, start, min_seq, true); in tree_mod_log_search_oldest()
532 u64 start, u64 min_seq) in tree_mod_log_search() argument
534 return __tree_mod_log_search(fs_info, start, min_seq, false); in tree_mod_log_search()
Ddelayed-ref.c548 u64 min_seq = btrfs_tree_mod_log_lowest_seq(fs_info); in btrfs_check_delayed_seq() local
550 if (min_seq != 0 && seq >= min_seq) { in btrfs_check_delayed_seq()
553 seq, min_seq); in btrfs_check_delayed_seq()
/linux-6.12.1/include/linux/
Dmm_inline.h252 else if (reclaiming || lrugen->min_seq[type] + MIN_NR_GENS >= lrugen->max_seq) in lru_gen_add_folio()
253 seq = lrugen->min_seq[type]; in lru_gen_add_folio()
255 seq = lrugen->min_seq[type] + 1; in lru_gen_add_folio()
Dmmzone.h433 unsigned long min_seq[ANON_AND_FILE]; member
/linux-6.12.1/Documentation/mm/
Dmultigen_lru.rst86 ``lrugen->min_seq[]`` separately for anon and file types as clean file
115 increments ``max_seq`` when ``max_seq-min_seq+1`` approaches
131 increments ``min_seq`` when ``lrugen->folios[]`` indexed by
132 ``min_seq%MAX_NR_GENS`` becomes empty. To select a type and a tier to
133 evict from, it first compares ``min_seq[]`` to select the older type.
139 moves a page to the next generation, i.e., ``min_seq+1``, if this page
/linux-6.12.1/kernel/printk/
Dprintk.c4728 u64 min_seq = latched_seq_read_nolock(&clear_seq); in kmsg_dump_get_line() local
4735 if (iter->cur_seq < min_seq) in kmsg_dump_get_line()
4736 iter->cur_seq = min_seq; in kmsg_dump_get_line()
4786 u64 min_seq = latched_seq_read_nolock(&clear_seq); in kmsg_dump_get_buffer() local
4798 if (iter->cur_seq < min_seq) in kmsg_dump_get_buffer()
4799 iter->cur_seq = min_seq; in kmsg_dump_get_buffer()