Lines Matching defs:right
664 BlockDescriptor left, node, right;
672 right.buffer = nil;
673 right.blockHeader = nil;
740 &left, &node, &right, &nodeNum, &index, &foundRecord);
759 // BTree nodes are always grabbed in left to right order.
777 // Before we stomp on "right", we'd better release it if needed
778 if (right.buffer != nil) {
779 err = ReleaseNode(btreePtr, &right);
782 right = node;
809 if (right.buffer == nil)
814 err = GetNode (btreePtr, nodeNum, 0, &right);
827 node = right;
828 right.buffer = nil;
913 if (right.buffer != nil)
915 err = ReleaseNode (btreePtr, &right);
927 (void) ReleaseNode (btreePtr, &right);
980 BlockDescriptor left, node, right;
988 right.buffer = nil;
989 right.blockHeader = nil;
1048 err = FindIteratorPosition(btreePtr, iterator, &left, &node, &right,
1070 // BTree nodes are always grabbed in left to right order.
1088 // Before we stomp on "right", we'd better release it if needed
1089 if (right.buffer != nil) {
1090 err = ReleaseNode(btreePtr, &right);
1093 right = node;
1120 if (right.buffer == nil)
1125 err = GetNode(btreePtr, nodeNum, 0, &right);
1138 node = right;
1139 right.buffer = nil;
1170 if (right.buffer == nil)
1175 err = GetNode(btreePtr, nodeNum, 0, &right);
1188 node = right;
1189 right.buffer = nil;
1227 if (right.buffer != nil)
1229 err = ReleaseNode(btreePtr, &right);
1241 (void) ReleaseNode(btreePtr, &right);