| 1301 | |
| 1302 | |
| 1303 | UCHAR* BTR_find_leaf(btree_page* bucket, temporary_key* key, UCHAR* value, |
| 1304 | USHORT* return_value, bool descending, int retrieval) |
| 1305 | { |
| 1306 | /************************************** |
| 1307 | * |
| 1308 | * B T R _ f i n d _ l e a f |
| 1309 | * |
| 1310 | ************************************** |
| 1311 | * |
| 1312 | * Functional description |
| 1313 | * Locate and return a pointer to the insertion point. |
| 1314 | * If the key doesn't belong in this bucket, return NULL. |
| 1315 | * A flag indicates the index is descending. |
| 1316 | * |
| 1317 | **************************************/ |
| 1318 | return find_node_start_point(bucket, key, value, return_value, descending, retrieval); |
| 1319 | } |
| 1320 | |
| 1321 | |
| 1322 | btree_page* BTR_find_page(thread_db* tdbb, |
no test coverage detected