| /linux/mm/ |
| H A D | workingset.c | 268 unsigned long max_seq; in lru_gen_test_recent() local
277 max_seq = READ_ONCE((*lruvec)->lrugen.max_seq); in lru_gen_test_recent()
278 max_seq &= EVICTION_MASK >> LRU_REFS_WIDTH; in lru_gen_test_recent()
280 return abs_diff(max_seq, *token >> LRU_REFS_WIDTH) < MAX_NR_GENS; in lru_gen_test_recent()
|
| H A D | vmscan.c | 2712 unsigned long max_seq = READ_ONCE((lruvec)->lrugen.max_seq)
2775 return lruvec->lrugen.max_seq - lruvec->lrugen.min_seq[type] + 1; in get_nr_gens()
3084 * 1. It tries to start a new iteration with a stale max_seq: there is in iterate_mm_list()
3089 * counters and tell its caller to increment max_seq. in iterate_mm_list()
3211 unsigned long seq = carryover ? lrugen->min_seq[type] : lrugen->max_seq + 1; in reset_ctrl_pos()
3536 int gen = lru_gen_from_seq(max_seq); in walk_pte_range()
3612 int gen = lru_gen_from_seq(max_seq); in walk_pmd_range_locked()
3821 if (walk->seq != max_seq) in walk_mm()
3938 while (min_seq[type] + MIN_NR_GENS <= lrugen->max_seq) { in try_to_inc_min_seq()
4803 should_run_aging(struct lruvec * lruvec,unsigned long max_seq,int swappiness,unsigned long * nr_to_scan) should_run_aging() argument
5381 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...] |
| /linux/include/linux/ |
| H A D | mm_inline.h | 166 unsigned long max_seq = lruvec->lrugen.max_seq; in lru_gen_is_active() local
171 return gen == lru_gen_from_seq(max_seq) || gen == lru_gen_from_seq(max_seq - 1); in lru_gen_is_active()
250 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 | 358 * oldest generation numbers, max_seq and min_seq, are monotonically increasing.
464 * The youngest generation number is stored in max_seq for both anon and file
477 unsigned long max_seq; member
517 /* synced with max_seq after each iteration */
532 /* max_seq from lru_gen_folio: can be out of date */
582 * of their max_seq counters ensures the eventual fairness to all eligible
|
| /linux/Documentation/mm/ |
| H A D | multigen_lru.rst | 84 ``lrugen->max_seq`` for both anon and file types as they are aged on
115 increments ``max_seq`` when ``max_seq-min_seq+1`` approaches
119 ``max_seq``. The aging uses page table walks and rmap walks to find
122 to scan PTEs, and after each iteration, it increments ``max_seq``. For
126 page mapped by this PTE to ``(max_seq%MAX_NR_GENS)+1``.
236 2. The increment of ``max_seq`` triggers promotion, i.e., the
|
| /linux/fs/bcachefs/ |
| H A D | btree_write_buffer.c | 526 static int fetch_wb_keys_from_journal(struct bch_fs *c, u64 max_seq) in fetch_wb_keys_from_journal() argument
533 while (!ret && (buf = bch2_next_write_buffer_flush_journal_buf(j, max_seq, &blocked))) { in fetch_wb_keys_from_journal()
553 static int btree_write_buffer_flush_seq(struct btree_trans *trans, u64 max_seq, in btree_write_buffer_flush_seq() argument
563 fetch_from_journal_err = fetch_wb_keys_from_journal(c, max_seq); in btree_write_buffer_flush_seq()
576 (wb->inc.pin.seq && wb->inc.pin.seq <= max_seq) || in btree_write_buffer_flush_seq()
577 (wb->flushing.pin.seq && wb->flushing.pin.seq <= max_seq))); in btree_write_buffer_flush_seq()
|
| /linux/kernel/printk/ |
| H A D | printk.c | 1556 * records up to (but not including) @max_seq fit into @size.
1558 * @max_seq is simply an upper bound and does not need to exist. If the caller
1559 * does not require an upper bound, -1 can be used for @max_seq.
1561 static u64 find_first_fitting_seq(u64 start_seq, u64 max_seq, size_t size, in find_first_fitting_seq() argument
1569 /* Determine the size of the records up to @max_seq. */ in find_first_fitting_seq()
1571 if (info.seq >= max_seq) in find_first_fitting_seq()
1580 if (seq < max_seq) in find_first_fitting_seq()
1581 max_seq = seq; in find_first_fitting_seq()
1590 if (len <= size || info.seq >= max_seq) in find_first_fitting_seq()
|
| /linux/include/scsi/ |
| H A D | libfc.h | 182 * @max_seq: Maximum number of concurrent sequences
202 u16 max_seq; member
|
| /linux/net/mptcp/ |
| H A D | protocol.c | 189 u64 seq, end_seq, max_seq; in mptcp_data_queue_ofo() local
194 max_seq = atomic64_read(&msk->rcv_wnd_sent); in mptcp_data_queue_ofo()
196 pr_debug("msk=%p seq=%llx limit=%llx empty=%d\n", msk, seq, max_seq, in mptcp_data_queue_ofo()
198 if (after64(end_seq, max_seq)) { in mptcp_data_queue_ofo()
202 (unsigned long long)end_seq - (unsigned long)max_seq, in mptcp_data_queue_ofo()
|
| /linux/drivers/scsi/bnx2fc/ |
| H A D | bnx2fc_hwi.c | 264 ofld_req3.tx_total_conc_seqs = rdata->max_seq; in bnx2fc_send_session_ofld_req()
266 ofld_req3.tx_max_conc_seqs_c3 = rdata->max_seq; in bnx2fc_send_session_ofld_req()
|
| /linux/drivers/scsi/libfc/ |
| H A D | fc_rport.c | 1027 rdata->max_seq = csp_seq; in fc_rport_plogi_resp()
|