Searched refs:max_seq (Results 1 - 11 of 11) sorted by relevance
/linux-master/include/linux/ |
H A D | mm_inline.h | 167 unsigned long max_seq = lruvec->lrugen.max_seq; local 172 return gen == lru_gen_from_seq(max_seq) || gen == lru_gen_from_seq(max_seq - 1); 247 seq = lrugen->max_seq; 251 seq = lrugen->max_seq - 1; 252 else if (reclaiming || lrugen->min_seq[type] + MIN_NR_GENS >= lrugen->max_seq)
|
H A D | mmzone.h | 330 * oldest generation numbers, max_seq and min_seq, are monotonically increasing. 414 * The youngest generation number is stored in max_seq for both anon and file 428 unsigned long max_seq; member in struct:lru_gen_folio 470 /* synced with max_seq after each iteration */ 485 /* max_seq from lru_gen_folio: can be out of date */ 535 * of their max_seq counters ensures the eventual fairness to all eligible
|
/linux-master/mm/ |
H A D | vmscan.c | 2573 unsigned long max_seq = READ_ONCE((lruvec)->lrugen.max_seq) 2626 return lruvec->lrugen.max_seq - lruvec->lrugen.min_seq[type] + 1; 2929 * 1. It tries to start a new iteration with a stale max_seq: there is 2934 * counters and tell its caller to increment max_seq. 3052 unsigned long seq = carryover ? lrugen->min_seq[type] : lrugen->max_seq + 1; 3343 int old_gen, new_gen = lru_gen_from_seq(max_seq); 3411 int old_gen, new_gen = lru_gen_from_seq(max_seq); 3624 if (walk->seq != max_seq) 3729 while (min_seq[type] + MIN_NR_GENS <= lrugen->max_seq) { 4600 should_run_aging(struct lruvec *lruvec, unsigned long max_seq, bool can_swap, unsigned long *nr_to_scan) argument 5222 lru_gen_seq_show_full(struct seq_file *m, struct lruvec *lruvec, unsigned long max_seq, unsigned long *min_seq, unsigned long seq) argument [all...] |
/linux-master/fs/bcachefs/ |
H A D | journal.c | 869 static struct journal_buf *__bch2_next_write_buffer_flush_journal_buf(struct journal *j, u64 max_seq) argument 875 max_seq = min(max_seq, journal_cur_seq(j)); 878 seq <= max_seq; 903 struct journal_buf *bch2_next_write_buffer_flush_journal_buf(struct journal *j, u64 max_seq) argument 907 wait_event(j->wait, (ret = __bch2_next_write_buffer_flush_journal_buf(j, max_seq)) != ERR_PTR(-EAGAIN));
|
H A D | journal.h | 427 struct journal_buf *bch2_next_write_buffer_flush_journal_buf(struct journal *j, u64 max_seq);
|
/linux-master/include/scsi/ |
H A D | libfc.h | 177 * @max_seq: Maximum number of concurrent sequences 197 u16 max_seq; member in struct:fc_rport_priv
|
/linux-master/kernel/printk/ |
H A D | printk.c | 1505 * records up to (but not including) @max_seq fit into @size. 1507 * @max_seq is simply an upper bound and does not need to exist. If the caller 1508 * does not require an upper bound, -1 can be used for @max_seq. 1510 static u64 find_first_fitting_seq(u64 start_seq, u64 max_seq, size_t size, argument 1518 /* Determine the size of the records up to @max_seq. */ 1520 if (info.seq >= max_seq) 1529 if (seq < max_seq) 1530 max_seq = seq; 1539 if (len <= size || info.seq >= max_seq)
|
/linux-master/net/mptcp/ |
H A D | protocol.c | 212 u64 seq, end_seq, max_seq; local 217 max_seq = atomic64_read(&msk->rcv_wnd_sent); 219 pr_debug("msk=%p seq=%llx limit=%llx empty=%d", msk, seq, max_seq, 221 if (after64(end_seq, max_seq)) { 225 (unsigned long long)end_seq - (unsigned long)max_seq,
|
/linux-master/drivers/scsi/bnx2fc/ |
H A D | bnx2fc_hwi.c | 264 ofld_req3.tx_total_conc_seqs = rdata->max_seq; 266 ofld_req3.tx_max_conc_seqs_c3 = rdata->max_seq;
|
/linux-master/drivers/scsi/libfc/ |
H A D | fc_rport.c | 1027 rdata->max_seq = csp_seq;
|
/linux-master/drivers/scsi/qedf/ |
H A D | qedf_main.c | 1364 conn_info.max_conc_seqs_c3 = fcport->rdata->max_seq;
|
Completed in 348 milliseconds