Home
last modified time | relevance | path

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

/kernel/linux/linux-6.6/mm/
H A Dworkingset.c235 unsigned long min_seq; in lru_gen_eviction() local
249 min_seq = READ_ONCE(lrugen->min_seq[type]); in lru_gen_eviction()
250 token = (min_seq << LRU_REFS_WIDTH) | max(refs - 1, 0); in lru_gen_eviction()
252 hist = lru_hist_from_seq(min_seq); in lru_gen_eviction()
266 unsigned long min_seq; in lru_gen_test_recent() local
275 min_seq = READ_ONCE((*lruvec)->lrugen.min_seq[file]); in lru_gen_test_recent()
276 return (*token >> LRU_REFS_WIDTH) == (min_seq & (EVICTION_MASK >> LRU_REFS_WIDTH)); in lru_gen_test_recent()
303 hist = lru_hist_from_seq(READ_ONCE(lrugen->min_seq[typ in lru_gen_refault()
[all...]
H A Dvmscan.c3226 unsigned long min_seq[ANON_AND_FILE] = { \
3227 READ_ONCE((lruvec)->lrugen.min_seq[LRU_GEN_ANON]), \
3228 READ_ONCE((lruvec)->lrugen.min_seq[LRU_GEN_FILE]), \
3276 return lruvec->lrugen.max_seq - lruvec->lrugen.min_seq[type] + 1; in get_nr_gens()
3667 int hist = lru_hist_from_seq(lrugen->min_seq[type]); in read_ctrl_pos()
3683 unsigned long seq = carryover ? lrugen->min_seq[type] : lrugen->max_seq + 1; in reset_ctrl_pos()
3759 int new_gen, old_gen = lru_gen_from_seq(lrugen->min_seq[type]); in folio_inc_gen()
4323 int new_gen, old_gen = lru_gen_from_seq(lrugen->min_seq[type]); in inc_min_seq()
4349 WRITE_ONCE(lrugen->min_seq[type], lrugen->min_seq[typ in inc_min_seq()
5871 lru_gen_seq_show_full(struct seq_file *m, struct lruvec *lruvec, unsigned long max_seq, unsigned long *min_seq, unsigned long seq) lru_gen_seq_show_full() argument
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A 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()
475 u64 start, u64 min_seq, in __tree_mod_log_search()
492 } else if (cur->seq < min_seq) { in __tree_mod_log_search()
500 } else if (cur->seq > min_seq) { in __tree_mod_log_search()
519 * sequence lower than min_seq will be ignored.
522 u64 start, u64 min_seq) in tree_mod_log_search_oldest()
524 return __tree_mod_log_search(fs_info, start, min_seq, true); in tree_mod_log_search_oldest()
530 * a time sequence lower than min_seq wil
474 __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq, bool smallest) __tree_mod_log_search() argument
521 tree_mod_log_search_oldest(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq) tree_mod_log_search_oldest() argument
532 tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq) tree_mod_log_search() argument
[all...]
H A Ddelayed-ref.c516 u64 min_seq = btrfs_tree_mod_log_lowest_seq(fs_info); in btrfs_check_delayed_seq() local
518 if (min_seq != 0 && seq >= min_seq) { in btrfs_check_delayed_seq()
521 seq, min_seq); in btrfs_check_delayed_seq()
/kernel/linux/linux-6.6/include/linux/
H A Dmm_inline.h255 else if (reclaiming || lrugen->min_seq[type] + MIN_NR_GENS >= lrugen->max_seq) in lru_gen_add_folio()
256 seq = lrugen->min_seq[type]; in lru_gen_add_folio()
258 seq = lrugen->min_seq[type] + 1; in lru_gen_add_folio()
H A Dmmzone.h348 * oldest generation numbers, max_seq and min_seq, are monotonically increasing.
434 * stored in min_seq[] separately for anon and file types as clean file pages
437 * Normally anon and file min_seq are in sync. But if swapping is constrained,
438 * e.g., out of swap space, file min_seq is allowed to advance and leave anon
439 * min_seq behind.
448 unsigned long min_seq[ANON_AND_FILE]; member
/kernel/linux/linux-6.6/kernel/printk/
H A Dprintk.c4140 u64 min_seq = latched_seq_read_nolock(&clear_seq); in kmsg_dump_get_line() local
4147 if (iter->cur_seq < min_seq) in kmsg_dump_get_line()
4148 iter->cur_seq = min_seq; in kmsg_dump_get_line()
4198 u64 min_seq = latched_seq_read_nolock(&clear_seq); in kmsg_dump_get_buffer() local
4210 if (iter->cur_seq < min_seq) in kmsg_dump_get_buffer()
4211 iter->cur_seq = min_seq; in kmsg_dump_get_buffer()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dctree.c313 u64 min_seq = (u64)-1; in btrfs_put_tree_mod_seq() local
336 min_seq = first->seq; in btrfs_put_tree_mod_seq()
347 if (tm->seq >= min_seq) in btrfs_put_tree_mod_seq()
646 __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq, in __tree_mod_log_search() argument
663 } else if (cur->seq < min_seq) { in __tree_mod_log_search()
671 } else if (cur->seq > min_seq) { in __tree_mod_log_search()
690 * sequence lower than min_seq will be ignored.
694 u64 min_seq) in tree_mod_log_search_oldest()
696 return __tree_mod_log_search(fs_info, start, min_seq, 1); in tree_mod_log_search_oldest()
702 * a time sequence lower than min_seq wil
693 tree_mod_log_search_oldest(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq) tree_mod_log_search_oldest() argument
705 tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq) tree_mod_log_search() argument
[all...]

Completed in 27 milliseconds