Lines Matching defs:nr_levels
257 unsigned int nr_levels;
270 static void q_init(struct queue *q, struct entry_space *es, unsigned int nr_levels)
276 q->nr_levels = nr_levels;
278 for (i = 0; i < q->nr_levels; i++) {
341 max_level = min(max_level, q->nr_levels);
360 struct entry *e = q_peek(q, q->nr_levels, true);
377 for (; level < q->nr_levels; level++)
390 unsigned int level, nr_levels, entries_per_level, remainder;
393 BUG_ON(lend > q->nr_levels);
394 nr_levels = lend - lbegin;
395 entries_per_level = safe_div(nr_elts, nr_levels);
396 remainder = safe_mod(nr_elts, nr_levels);
414 if (q->nr_top_levels > q->nr_levels)
415 q_set_targets_subrange_(q, q->nr_elts, 0, q->nr_levels);
419 q->nr_levels - q->nr_top_levels, q->nr_levels);
423 0, q->nr_levels - q->nr_top_levels);
425 q_set_targets_subrange_(q, 0, 0, q->nr_levels - q->nr_top_levels);
437 for (level = 0u; level < q->nr_levels - 1u; level++) {
477 unsigned int new_level = min(q->nr_levels - 1u, e->level + extra_levels);
480 if (extra_levels && (e->level < q->nr_levels - 1u)) {
528 static void stats_init(struct stats *s, unsigned int nr_levels)
530 s->hit_threshold = (nr_levels * 3u) / 4u;
892 for (level = 0; level < q->nr_levels; level++) {
905 for (level = 0; level < q->nr_levels; level++) {
1191 e = q_peek(&mq->dirty, mq->dirty.nr_levels, idle);
1217 e = q_peek(&mq->clean, mq->clean.nr_levels / 2, true);