Searched refs:CheckNode (Results 1 – 4 of 4) sorted by relevance
208 return fStatus = node && CheckNode(node) ? B_OK : B_BAD_DATA; in SetTo()267 || !info.free && !CheckNode(node)) { in Validate()341 while (stack.Pop(&pos) && (node = fCache.Get(pos)) != NULL && CheckNode(node)) in Goto()412 if ((node = fCache.Get(fCurrentNodeOffset)) == NULL || !CheckNode(node)) in Traverse()427 if (!node || !CheckNode(node)) in Traverse()626 while ((node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node)) { in SeekDown()972 …while (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(n… in Insert()1054 …if (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node… in Find()1076 BPlusTree::CheckNode(bplustree_node *node) in CheckNode() function in BPlusTree
161 bool CheckNode(bplustree_node *node);
53 inline bool CheckNode(const bplustree_node* node) const;552 bplustree_header::CheckNode(const bplustree_node* node) const in CheckNode() function
318 if (!fTree->fHeader.CheckNode(fNode)) { in SetTo()352 if (!fTree->fHeader.CheckNode(fNode)) { in SetToWritable()