Lines Matching defs:keys
38 * followed by an array of keys, followed by an array of values. We have
39 * to binary search on the keys so they're all held together to help the
1507 dm_block_t keys[2] = { td->id, block };
1515 r = dm_btree_lookup(info, pmd->root, keys, &value);
1547 dm_block_t keys[2] = { td->id, block };
1549 r = dm_btree_lookup_next(&pmd->info, pmd->root, keys, vblock, &value);
1626 dm_block_t keys[2] = { td->id, block };
1631 r = dm_btree_insert_notify(&pmd->info, pmd->root, keys, &value,
1660 dm_block_t keys[2] = { td->id, block };
1662 r = dm_btree_remove(&pmd->info, pmd->root, keys, &pmd->root);
1677 dm_block_t keys[1] = { td->id };
1684 r = dm_btree_lookup(&pmd->tl_info, pmd->root, keys, &value);
1694 r = dm_btree_remove(&pmd->tl_info, pmd->root, keys, &pmd->root);
1728 return dm_btree_insert(&pmd->tl_info, pmd->root, keys, &value, &pmd->root);