Lines Matching refs:key
121 Routine: CalcKeyRecordSize - Return size of combined key/record structure.
126 Input: keySize - length of key (including length field)
131 Result: u_int16_t - size of combined key/record that will be inserted in btree
371 foundIt = SearchNode (btreePtr, middle->buffer, &iterator->key, &index);
408 foundIt = SearchNode (btreePtr, left->buffer, &iterator->key, &leftIndex);
458 foundIt = SearchNode (btreePtr, right->buffer, &iterator->key, &rightIndex);
485 err = SearchTree ( btreePtr, &iterator->key, treePathTable, &nodeNum, middle, &index);
538 // check total key/record size limit
539 if ( CalcKeyRecordSize (CalcKeySize(btreePtr, &iterator->key), recordLen) > (btreePtr->nodeSize >> 1))
550 Function: If a hint exitst for the iterator, attempt to find the key in the hint
551 node. If the key is found, an insert operation fails. If the is not
552 found, a replace operation fails. If the key was not found, and the
554 is inserted, provided there is enough freeSpace. If the key was found,
559 Assumptions: iterator key has already been checked by CheckKey
597 foundIt = SearchNode (btreePtr, nodePtr, &iterator->key, &index);
602 keySize = CalcKeySize(btreePtr, &iterator->key); // includes length field
617 dst += keySize; // skip over key to point at record
628 &iterator->key, KeyLength(btreePtr, &iterator->key),