Lines Matching defs:keys
40 * followed by an array of keys, followed by an array of values. We have
41 * to binary search on the keys so they're all held together to help the
1552 dm_block_t keys[2] = { td->id, block };
1560 r = dm_btree_lookup(info, pmd->root, keys, &value);
1592 dm_block_t keys[2] = { td->id, block };
1594 r = dm_btree_lookup_next(&pmd->info, pmd->root, keys, vblock, &value);
1671 dm_block_t keys[2] = { td->id, block };
1676 r = dm_btree_insert_notify(&pmd->info, pmd->root, keys, &value,
1706 dm_block_t keys[1] = { td->id };
1713 r = dm_btree_lookup(&pmd->tl_info, pmd->root, keys, &value);
1723 r = dm_btree_remove(&pmd->tl_info, pmd->root, keys, &pmd->root);
1757 return dm_btree_insert(&pmd->tl_info, pmd->root, keys, &value, &pmd->root);