Searched refs:min_seq (Results 1 – 9 of 9) sorted by relevance
| /linux/mm/ |
| H A D | workingset.c | 236 unsigned long min_seq; in lru_gen_eviction() local 251 min_seq = READ_ONCE(lrugen->min_seq[type]); in lru_gen_eviction() 252 token = (min_seq << LRU_REFS_WIDTH) | max(refs - 1, 0); in lru_gen_eviction() 254 hist = lru_hist_from_seq(min_seq); in lru_gen_eviction() 307 hist = lru_hist_from_seq(READ_ONCE(lrugen->min_seq[type])); in lru_gen_refault()
|
| H A D | vmscan.c | 2716 unsigned long min_seq[ANON_AND_FILE] = { \ 2717 READ_ONCE((lruvec)->lrugen.min_seq[LRU_GEN_ANON]), \ 2718 READ_ONCE((lruvec)->lrugen.min_seq[LRU_GEN_FILE]), \ 2725 #define evictable_min_seq(min_seq, swappiness) \ argument 2726 min((min_seq)[min_type(swappiness)], (min_seq)[max_type(swappiness)]) 2776 return lruvec->lrugen.max_seq - lruvec->lrugen.min_seq[type] + 1; in get_nr_gens() 3193 int hist = lru_hist_from_seq(lrugen->min_seq[type]); in read_ctrl_pos() 3212 unsigned long seq = carryover ? lrugen->min_seq[type] : lrugen->max_seq + 1; in reset_ctrl_pos() 3288 int new_gen, old_gen = lru_gen_from_seq(lrugen->min_seq[type]); in folio_inc_gen() 3879 int hist = lru_hist_from_seq(lrugen->min_seq[type]); in inc_min_seq() [all …]
|
| H A D | swap.c | 426 return gen == lru_gen_from_seq(READ_ONCE(lrugen->min_seq[type])); in lru_gen_clear_refs()
|
| /linux/fs/btrfs/ |
| H A D | tree-mod-log.c | 92 u64 min_seq = BTRFS_SEQ_LAST; in btrfs_put_tree_mod_seq() local 117 min_seq = first->seq; in btrfs_put_tree_mod_seq() 128 if (tm->seq >= min_seq) in btrfs_put_tree_mod_seq() 511 u64 start, u64 min_seq, in __tree_mod_log_search() argument 528 } else if (cur->seq < min_seq) { in __tree_mod_log_search() 536 } else if (cur->seq > min_seq) { in __tree_mod_log_search() 558 u64 start, u64 min_seq) in tree_mod_log_search_oldest() argument 560 return __tree_mod_log_search(fs_info, start, min_seq, true); in tree_mod_log_search_oldest() 569 u64 start, u64 min_seq) in tree_mod_log_search() argument 571 return __tree_mod_log_search(fs_info, start, min_seq, false); in tree_mod_log_search()
|
| H A D | delayed-ref.c | 463 u64 min_seq = btrfs_tree_mod_log_lowest_seq(fs_info); in btrfs_check_delayed_seq() local 465 if (min_seq != 0 && seq >= min_seq) { in btrfs_check_delayed_seq() 468 seq, min_seq); in btrfs_check_delayed_seq()
|
| /linux/Documentation/mm/ |
| H A D | multigen_lru.rst | 86 ``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/kernel/printk/ |
| H A D | printk.c | 4764 u64 min_seq = latched_seq_read_nolock(&clear_seq); in kmsg_dump_get_line() local 4771 if (iter->cur_seq < min_seq) in kmsg_dump_get_line() 4772 iter->cur_seq = min_seq; in kmsg_dump_get_line() 4822 u64 min_seq = latched_seq_read_nolock(&clear_seq); in kmsg_dump_get_buffer() local 4834 if (iter->cur_seq < min_seq) in kmsg_dump_get_buffer() 4835 iter->cur_seq = min_seq; in kmsg_dump_get_buffer()
|
| /linux/include/linux/ |
| H A D | mm_inline.h | 251 return max(READ_ONCE(lrugen->max_seq) - gen + 1, READ_ONCE(lrugen->min_seq[type])); in lru_gen_folio_seq()
|
| H A D | mmzone.h | 494 unsigned long min_seq[ANON_AND_FILE]; member
|