Lines Matching defs:CACHE
293 /* The size of the node cache */
345 #define CACHE(i) (ROOT + ((i) << INFO->fullblocksize_shift))
346 #define LEAF CACHE (DISK_LEAF_NODE_LEVEL)
348 #define BLOCKHEAD(cache) ((struct block_head *) cache)
350 #define KEY(cache) ((struct key *) ((int) cache + BLKH_SIZE))
351 #define DC(cache) ((struct disk_child *) \
352 ((int) cache + BLKH_SIZE + KEY_SIZE * nr_item))
358 * The journal cache. For each transaction it contains the number of
464 /* Init the journal data structure. We try to cache as much as
531 /* Cache the length and the realblock numbers in the table.
622 /* Clear node cache. */
672 * My tree node cache is organized as following
676 * if there is not enough space in the cache, the top most are
688 /* Read in the node at the current path and depth into the node cache.
694 char* cache = CACHE(depth);
702 return cache;
705 cache = CACHE(num_cached);
711 if (! block_read (blockNr, 0, INFO->blocksize, cache))
714 if (BLOCKHEAD (cache)->blk_level != depth)
721 return cache;
732 char *cache;
766 cache = ROOT;
768 cache = CACHE (depth);
771 cache = read_tree_node (INFO->blocks[depth], depth);
772 if (! cache)
778 int nr_item = BLOCKHEAD (cache)->blk_nr_item;
787 cache = read_tree_node (DC (cache)[key_nr].dc_block_number, --depth);
788 if (! cache)
817 * side effects: messes around with the cache.
822 char *cache;
832 cache = ROOT;
837 nr_item = BLOCKHEAD (cache)->blk_nr_item;
839 key = KEY (cache);
857 cache = read_tree_node (DC (cache)[i].dc_block_number, --depth);
858 if (! cache)
862 /* cache == LEAF */
1162 * the tree cache. That doesn't hurt as long as we
