Lines Matching defs:blks
336 uint *blks, int depth)
346 if (!blks[depth]) {
351 if (ret == blks[i]) {
358 blks[depth] = ret;
362 ret = read_blk(info, blks[depth], buf);
365 "block %u", blks[depth]);
379 if (newblk == blks[i]) {
382 blks[depth],
388 blks[depth + 1] = newblk;
400 blks[depth + 1] = find_free_dqentry(info, dquot, &ret);
402 ret = do_insert_tree(info, dquot, blks, depth + 1);
406 cpu_to_le32(blks[depth + 1]);
407 ret = write_blk(info, blks[depth], buf);
409 put_free_dqblk(info, buf, blks[depth]);
420 uint blks[MAX_QTREE_DEPTH] = { QT_TREEOFF };
432 return do_insert_tree(info, dquot, blks, 0);
545 uint *blks, int depth)
555 ret = read_blk(info, blks[depth], buf);
558 blks[depth]);
568 if (newblk == blks[i]) {
571 blks[depth],
578 blks[depth + 1] = 0;
580 blks[depth + 1] = newblk;
581 ret = remove_tree(info, dquot, blks, depth + 1);
583 if (ret >= 0 && !blks[depth + 1]) {
590 && blks[depth] != QT_TREEOFF) {
591 put_free_dqblk(info, buf, blks[depth]);
592 blks[depth] = 0;
594 ret = write_blk(info, blks[depth], buf);
598 blks[depth]);
609 uint blks[MAX_QTREE_DEPTH] = { QT_TREEOFF };
617 return remove_tree(info, dquot, blks, 0);
661 struct dquot *dquot, uint *blks, int depth)
671 ret = read_blk(info, blks[depth], buf);
674 blks[depth]);
688 if (blk == blks[i]) {
691 blks[depth],
696 blks[depth + 1] = blk;
698 ret = find_tree_dqentry(info, dquot, blks, depth + 1);
710 uint blks[MAX_QTREE_DEPTH] = { QT_TREEOFF };
716 return find_tree_dqentry(info, dquot, blks, 0);