CheckNode
if (!fTree->fHeader.CheckNode(fNode)) {
if (!fTree->fHeader.CheckNode(fNode)) {
inline bool CheckNode(const bplustree_node* node) const;
if (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node))
return fStatus = node && CheckNode(node) ? B_OK : B_BAD_DATA;
|| !info.free && !CheckNode(node)) {
while (stack.Pop(&pos) && (node = fCache.Get(pos)) != NULL && CheckNode(node))
if ((node = fCache.Get(fCurrentNodeOffset)) == NULL || !CheckNode(node))
if (!node || !CheckNode(node))
while ((node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node)) {
while (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node))
bool CheckNode(bplustree_node *node);