Lines Matching refs:key
112 * For the btree internal pages, the item is a key. BINTERNALs are {key, pgno}
113 * pairs, such that the key compares less than or equal to all of the records
121 u_int32_t ksize; /* key size */
124 #define P_BIGKEY 0x02 /* overflow key */
171 /* For the btree leaf pages, the item is a key and data pair. */
173 u_int32_t ksize; /* size of key */
186 /* Get the number of bytes in the user's key/data pair. */
192 #define WR_BLEAF(p, key, data, flags) { \
193 *(u_int32_t *)p = key->size; \
199 memmove(p, key->data, key->size); \
200 p += key->size; \
237 * record less than key in the tree so that descents work. Leaf page searches
238 * must find the smallest record greater than key so that the returned index
252 * About cursors. The cursor (and the page that contained the key/data pair
254 * there are no duplicates of the cursor key in the tree (i.e. B_NODUPS is set
255 * or there simply aren't any duplicates of the key) we copy the key that it
256 * referenced when it's deleted, and reacquire a new cursor key if the cursor
258 * key, and set a flag so that we know what happened. NOTE: if duplicate (to
265 * CURS_ACQUIRE The cursor was deleted, and a key has been saved so that
268 * The cursor was deleted, and now references a key/data pair
270 * deleted key/data pair.
277 DBT key; /* B: Saved key, or key.data == NULL. */
281 #define CURS_AFTER 0x02 /* B: Unreturned cursor after key. */
282 #define CURS_BEFORE 0x04 /* B: Unreturned cursor before key. */
324 DBT bt_rkey; /* returned key */
331 indx_t bt_ovflsize; /* cut-off for key/data overflow */
337 /* B: key comparison function */