Lines Matching defs:depth
591 int depth, level, alloc_depth = BFQ_LIMIT_INLINE_DEPTH;
603 depth = bfqg_to_blkg(bfqq_group(bfqq))->blkcg->css.cgroup->level + 1;
604 if (depth > alloc_depth) {
608 entities = kmalloc_array(depth, sizeof(*entities), GFP_NOIO);
611 alloc_depth = depth;
627 if (WARN_ON_ONCE(level >= depth))
631 WARN_ON_ONCE(level != depth);
683 * appropriate for their weight, we trim the available tag depth to 1. This
694 int depth;
698 /* Sync reads have full depth available */
700 depth = 0;
702 depth = bfqd->word_depths[!!bfqd->wr_busy_queues][op_is_sync(opf)];
703 limit = (limit * depth) >> bfqd->full_depth_shift;
713 * limit depth so that it cannot consume more
717 depth = 1;
721 bfq_log(bfqd, "[%s] wr_busy %d sync %d depth %u",
722 __func__, bfqd->wr_busy_queues, op_is_sync(opf), depth);
723 if (depth)
724 data->shallow_depth = depth;
3843 * serious as the speed and the queue depth of the drive grow,
7084 * the depths set in the function. Return minimum shallow depth we'll use.
7088 unsigned int depth = 1U << bt->sb.shift;
7102 bfqd->word_depths[0][0] = max(depth >> 1, 1U);
7108 bfqd->word_depths[0][1] = max((depth * 3) >> 2, 1U);
7118 bfqd->word_depths[1][0] = max((depth * 3) >> 4, 1U);
7120 bfqd->word_depths[1][1] = max((depth * 6) >> 4, 1U);