Lines Matching defs:nodeAndKey
617 node_and_key nodeAndKey;
618 nodeAndKey.nodeOffset = fHeader->root_node_pointer;
619 nodeAndKey.keyIndex = 0;
622 while ((node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node)) {
627 nodeAndKey.keyIndex = 0;
628 stack.Push(nodeAndKey);
633 status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex,&nextOffset);
635 if (status == B_ENTRY_NOT_FOUND && nextOffset == nodeAndKey.nodeOffset)
639 stack.Push(nodeAndKey);
641 nodeAndKey.nodeOffset = nextOffset;
964 node_and_key nodeAndKey;
968 while (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node))
972 status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex);
980 return InsertDuplicate(node,nodeAndKey.keyIndex);
990 InsertKey(node,keyBuffer,keyLength,valueToInsert,nodeAndKey.keyIndex);
991 fCache.SetDirty(nodeAndKey.nodeOffset,true);
1001 if (nodeAndKey.nodeOffset == fHeader->root_node_pointer) {
1009 if (SplitNode(node,nodeAndKey.nodeOffset,&nodeAndKey.keyIndex,keyBuffer,&keyLength,&valueToInsert) < B_OK) {
1017 rootNode->overflow_link = nodeAndKey.nodeOffset;
1047 node_and_key nodeAndKey;
1050 if (stack.Pop(&nodeAndKey) && (node = fCache.Get(nodeAndKey.nodeOffset)) != NULL && CheckNode(node))
1052 status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex);
1056 SetCurrentNode(node,nodeAndKey.nodeOffset);
1060 *value = node->Values()[nodeAndKey.keyIndex];