Lines Matching defs:depth
26 static int __get_index(struct qtree_mem_dqinfo *info, qid_t id, int depth)
30 depth = info->dqi_qtree_depth - depth - 1;
31 while (depth--)
36 static int get_index(struct qtree_mem_dqinfo *info, struct kqid qid, int depth)
40 return __get_index(info, id, depth);
334 uint *treeblk, int depth)
359 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);
362 if (depth == info->dqi_qtree_depth - 1) {
368 dquot->dq_id, depth)]));
375 ret = do_insert_tree(info, dquot, &newblk, depth+1);
378 ref[get_index(info, dquot->dq_id, depth)] =
514 uint *blk, int depth)
529 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);
537 if (depth == info->dqi_qtree_depth - 1) {
541 ret = remove_tree(info, dquot, &newblk, depth+1);
545 ref[get_index(info, dquot->dq_id, depth)] = cpu_to_le32(0);
618 struct dquot *dquot, uint blk, int depth)
633 blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);
643 if (depth < info->dqi_qtree_depth - 1)
644 ret = find_tree_dqentry(info, dquot, blk, depth+1);
733 unsigned int blk, int depth)
745 for (i = depth; i < info->dqi_qtree_depth - 1; i++)
754 for (i = __get_index(info, *id, depth); i < epb; i++) {
759 if (depth == info->dqi_qtree_depth - 1) {
763 ret = find_next_id(info, id, le32_to_cpu(ref[i]), depth + 1);