Lines Matching defs:level
168 unsigned int level;
208 return f->level < (info->levels - 1);
211 static int push_frame(struct del_stack *s, dm_block_t b, unsigned int level)
243 f->level = level;
312 r = push_frame(s, b, f->level);
319 r = push_frame(s, b, f->level + 1);
377 unsigned int level, last_level = info->levels - 1;
384 for (level = 0; level < info->levels; level++) {
388 if (level == last_level) {
397 r = btree_lookup_raw(&spine, root, keys[level],
402 if (rkey != keys[level]) {
473 unsigned int level;
479 for (level = 0; level < info->levels - 1u; level++) {
480 r = btree_lookup_raw(&spine, root, keys[level],
486 if (*rkey != keys[level]) {
494 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);
1228 unsigned int level, unsigned int index)
1231 (le64_to_cpu(node->keys[index]) != keys[level]));
1240 unsigned int level, index = -1, last_level = info->levels - 1;
1249 for (level = 0; level < (info->levels - 1); level++) {
1250 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);
1256 if (need_insert(n, keys, level, index)) {
1268 keys[level], &new_le);
1273 if (level < last_level)
1278 keys[level], &index);
1284 if (need_insert(n, keys, level, index)) {
1289 keys[level], value);
1380 int r = 0, count = 0, level;
1384 for (level = 0; level < info->levels; level++) {
1385 r = find_key(&spine, root, find_highest, result_keys + level,
1386 level == info->levels - 1 ? NULL : &root);
1419 * space. Also this only works for single level trees.