Lines Matching refs:fCache
77 fCache(this),
88 fCache(this),
102 fCache(this),
110 fCache.Clear();
117 fCache.Clear(0,true);
139 fCache.SetHoldChanges(true);
204 bplustree_node *node = fCache.Get(header.root_node_pointer);
266 if ((node = fCache.Get(info.offset)) == NULL
272 if ((node = fCache.Get(info.from)) != NULL)
307 bplustree_node *node = fCache.Get(offset);
341 while (stack.Pop(&pos) && (node = fCache.Get(pos)) != NULL && CheckNode(node))
385 node = fCache.Get(bplustree_node::FragmentOffset(fDuplicateNode));
396 && (node = fCache.Get(fDuplicateNode)) != NULL)
412 if ((node = fCache.Get(fCurrentNodeOffset)) == NULL || !CheckNode(node))
426 node = fCache.Get(fCurrentNodeOffset);
468 node = fCache.Get(bplustree_node::FragmentOffset(fDuplicateNode));
626 while ((node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node)) {
731 bplustree_node *other = fCache.Get(otherOffset = fHeader->maximum_size); //Node(otherOffset = fHeader->maximum_size/*,false*/);
925 fCache.SetDirty(otherOffset,true);
926 fCache.SetDirty(nodeOffset,true);
930 bplustree_node *left = fCache.Get(other->left_link);
933 fCache.SetDirty(other->left_link,true);
972 while (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node))
995 fCache.SetDirty(nodeAndKey.nodeOffset,true);
1006 rootNode = fCache.Get(newRoot = fHeader->maximum_size);
1029 fCache.SetDirty(newRoot,true);
1054 if (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node))
1141 fCache.SetHoldChanges(hold);