Lines Matching full:depth
352 printf ("root read_in: block=%d, depth=%d\n", in reiserfs_mount()
388 /* Read in the node at the current path and depth into the node cache.
389 * You must set INFO->blocks[depth] before.
392 read_tree_node (unsigned int blockNr, int depth) in read_tree_node() argument
394 char* cache = CACHE(depth); in read_tree_node()
396 if (depth < num_cached) in read_tree_node()
401 if (blockNr == INFO->blocks[depth]) in read_tree_node()
408 printf (" next read_in: block=%d (depth=%d)\n", in read_tree_node()
409 blockNr, depth); in read_tree_node()
414 if (__le16_to_cpu(BLOCKHEAD (cache)->blk_level) != depth) in read_tree_node()
420 INFO->blocks[depth] = blockNr; in read_tree_node()
430 int depth; in next_key() local
445 depth = DISK_LEAF_NODE_LEVEL; in next_key()
451 if (depth == INFO->tree_depth) in next_key()
458 depth++; in next_key()
460 printf (" depth=%d, i=%d\n", depth, INFO->next_key_nr[depth]); in next_key()
463 while (INFO->next_key_nr[depth] == 0); in next_key()
465 if (depth == INFO->tree_depth) in next_key()
467 else if (depth <= INFO->cached_slots) in next_key()
468 cache = CACHE (depth); in next_key()
471 cache = read_tree_node (INFO->blocks[depth], depth); in next_key()
479 int key_nr = INFO->next_key_nr[depth]++; in next_key()
481 printf (" depth=%d, i=%d/%d\n", depth, key_nr, nr_item); in next_key()
485 INFO->next_key_nr[depth] = 0; in next_key()
487 cache = read_tree_node (dc_block_number(&(DC (cache)[key_nr])), --depth); in next_key()
491 while (depth > DISK_LEAF_NODE_LEVEL); in next_key()
523 int depth; in search_stat() local
531 depth = INFO->tree_depth; in search_stat()
534 while (depth > DISK_LEAF_NODE_LEVEL) in search_stat()
554 printf (" depth=%d, i=%d/%d\n", depth, i, nr_item); in search_stat()
556 INFO->next_key_nr[depth] = (i == nr_item) ? 0 : i+1; in search_stat()
557 cache = read_tree_node (dc_block_number(&(DC (cache)[i])), --depth); in search_stat()
573 printf (" depth=%d, i=%d/%d\n", depth, i, nr_item); in search_stat()