Lines Matching refs:nr_levels
256 unsigned nr_levels;
269 static void q_init(struct queue *q, struct entry_space *es, unsigned nr_levels)
275 q->nr_levels = nr_levels;
277 for (i = 0; i < q->nr_levels; i++) {
340 max_level = min(max_level, q->nr_levels);
359 struct entry *e = q_peek(q, q->nr_levels, true);
376 for (; level < q->nr_levels; level++)
388 unsigned level, nr_levels, entries_per_level, remainder;
391 BUG_ON(lend > q->nr_levels);
392 nr_levels = lend - lbegin;
393 entries_per_level = safe_div(nr_elts, nr_levels);
394 remainder = safe_mod(nr_elts, nr_levels);
412 if (q->nr_top_levels > q->nr_levels)
413 q_set_targets_subrange_(q, q->nr_elts, 0, q->nr_levels);
417 q->nr_levels - q->nr_top_levels, q->nr_levels);
421 0, q->nr_levels - q->nr_top_levels);
423 q_set_targets_subrange_(q, 0, 0, q->nr_levels - q->nr_top_levels);
435 for (level = 0u; level < q->nr_levels - 1u; level++) {
475 unsigned new_level = min(q->nr_levels - 1u, e->level + extra_levels);
478 if (extra_levels && (e->level < q->nr_levels - 1u)) {
526 static void stats_init(struct stats *s, unsigned nr_levels)
528 s->hit_threshold = (nr_levels * 3u) / 4u;
889 for (level = 0; level < q->nr_levels; level++) {
902 for (level = 0; level < q->nr_levels; level++) {
1186 e = q_peek(&mq->dirty, mq->dirty.nr_levels, idle);
1212 e = q_peek(&mq->clean, mq->clean.nr_levels / 2, true);