Lines Matching defs:left
664 BlockDescriptor left, node, right;
670 left.buffer = nil;
671 left.blockHeader = nil;
740 &left, &node, &right, &nodeNum, &index, &foundRecord);
754 if (left.buffer == nil)
759 // BTree nodes are always grabbed in left to right order.
761 // left node.
765 // Look up the left node
766 err = GetNode (btreePtr, nodeNum, 0, &left);
770 err = GetRightSiblingNode (btreePtr, left.buffer, &node);
783 node = left;
784 left.buffer = nil;
821 // Before we stomp on "left", we'd better release it if needed
822 if (left.buffer != nil) {
823 err = ReleaseNode(btreePtr, &left);
826 left = node;
907 if (left.buffer != nil)
909 err = ReleaseNode (btreePtr, &left);
925 (void) ReleaseNode (btreePtr, &left);
980 BlockDescriptor left, node, right;
986 left.buffer = nil;
987 left.blockHeader = nil;
1048 err = FindIteratorPosition(btreePtr, iterator, &left, &node, &right,
1065 if (left.buffer == nil)
1070 // BTree nodes are always grabbed in left to right order.
1072 // left node.
1076 // Look up the left node
1077 err = GetNode (btreePtr, nodeNum, 0, &left);
1081 err = GetRightSiblingNode (btreePtr, left.buffer, &node);
1094 node = left;
1095 left.buffer = nil;
1132 // Before we stomp on "left", we'd better release it if needed
1133 if (left.buffer != nil) {
1134 err = ReleaseNode(btreePtr, &left);
1137 left = node;
1182 // Before we stomp on "left", we'd better release it if needed
1183 if (left.buffer != nil) {
1184 err = ReleaseNode(btreePtr, &left);
1187 left = node;
1221 if (left.buffer != nil)
1223 err = ReleaseNode(btreePtr, &left);
1239 (void) ReleaseNode(btreePtr, &left);