Lines Matching refs:r
128 int r; in dm_btree_empty() local
134 r = new_block(info, &b); in dm_btree_empty()
135 if (r < 0) in dm_btree_empty()
136 return r; in dm_btree_empty()
210 int r; in push_frame() local
218 r = dm_tm_ref(s->tm, b, &ref_count); in push_frame()
219 if (r) in push_frame()
220 return r; in push_frame()
233 r = dm_tm_read_lock(s->tm, b, &btree_node_validator, &f->b); in push_frame()
234 if (r) { in push_frame()
236 return r; in push_frame()
272 int r; in dm_btree_del() local
282 r = push_frame(s, root, 0); in dm_btree_del()
283 if (r) in dm_btree_del()
291 r = top_frame(s, &f); in dm_btree_del()
292 if (r) in dm_btree_del()
304 r = push_frame(s, b, f->level); in dm_btree_del()
305 if (r) in dm_btree_del()
311 r = push_frame(s, b, f->level + 1); in dm_btree_del()
312 if (r) in dm_btree_del()
327 if (r) { in dm_btree_del()
333 return r; in dm_btree_del()
343 int i, r; in btree_lookup_raw() local
347 r = ro_step(s, block); in btree_lookup_raw()
348 if (r < 0) in btree_lookup_raw()
349 return r; in btree_lookup_raw()
373 int r = -ENODATA; in dm_btree_lookup() local
392 r = btree_lookup_raw(&spine, root, keys[level], in dm_btree_lookup()
396 if (!r) { in dm_btree_lookup()
403 return r; in dm_btree_lookup()
410 return r; in dm_btree_lookup()
417 int r, i; in dm_btree_lookup_next_single() local
422 r = bn_read_lock(info, root, &node); in dm_btree_lookup_next_single()
423 if (r) in dm_btree_lookup_next_single()
424 return r; in dm_btree_lookup_next_single()
433 r = -ENODATA; in dm_btree_lookup_next_single()
437 r = dm_btree_lookup_next_single(info, value64(n, i), key, rkey, value_le); in dm_btree_lookup_next_single()
438 if (r == -ENODATA && i < (nr_entries - 1)) { in dm_btree_lookup_next_single()
440 r = dm_btree_lookup_next_single(info, value64(n, i), key, rkey, value_le); in dm_btree_lookup_next_single()
446 r = -ENODATA; in dm_btree_lookup_next_single()
455 return r; in dm_btree_lookup_next_single()
462 int r = -ENODATA; in dm_btree_lookup_next() local
468 r = btree_lookup_raw(&spine, root, keys[level], in dm_btree_lookup_next()
471 if (r) in dm_btree_lookup_next()
475 r = -ENODATA; in dm_btree_lookup_next()
482 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le); in dm_btree_lookup_next()
485 return r; in dm_btree_lookup_next()
523 int r; in btree_split_sibling() local
532 r = new_block(s->info, &right); in btree_split_sibling()
533 if (r < 0) in btree_split_sibling()
534 return r; in btree_split_sibling()
569 r = insert_at(sizeof(__le64), pn, parent_index + 1, in btree_split_sibling()
571 if (r) { in btree_split_sibling()
573 return r; in btree_split_sibling()
610 int r; in btree_split_beneath() local
619 r = new_block(s->info, &left); in btree_split_beneath()
620 if (r < 0) in btree_split_beneath()
621 return r; in btree_split_beneath()
623 r = new_block(s->info, &right); in btree_split_beneath()
624 if (r < 0) { in btree_split_beneath()
626 return r; in btree_split_beneath()
698 int r, i = *index, top = 1; in btree_insert_raw() local
702 r = shadow_step(s, root, vt); in btree_insert_raw()
703 if (r < 0) in btree_insert_raw()
704 return r; in btree_insert_raw()
725 r = btree_split_beneath(s, key); in btree_insert_raw()
727 r = btree_split_sibling(s, i, key); in btree_insert_raw()
729 if (r < 0) in btree_insert_raw()
730 return r; in btree_insert_raw()
762 int r, need_insert; in insert() local
773 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index); in insert()
774 if (r < 0) in insert()
785 r = dm_btree_empty(info, &new_tree); in insert()
786 if (r < 0) in insert()
792 r = insert_at(sizeof(uint64_t), n, index, in insert()
794 if (r) in insert()
802 r = btree_insert_raw(&spine, block, &info->value_type, in insert()
804 if (r < 0) in insert()
815 r = insert_at(info->value_type.size, n, index, in insert()
817 if (r) in insert()
845 return r; in insert()
870 int i, r; in find_key() local
874 r = ro_step(s, block); in find_key()
875 if (r < 0) in find_key()
876 return r; in find_key()
903 int r = 0, count = 0, level; in dm_btree_find_key() local
908 r = find_key(&spine, root, find_highest, result_keys + level, in dm_btree_find_key()
910 if (r == -ENODATA) { in dm_btree_find_key()
911 r = 0; in dm_btree_find_key()
914 } else if (r) in dm_btree_find_key()
921 return r ? r : count; in dm_btree_find_key()
948 int r; in walk_node() local
954 r = bn_read_lock(info, block, &node); in walk_node()
955 if (r) in walk_node()
956 return r; in walk_node()
963 r = walk_node(info, value64(n, i), fn, context); in walk_node()
964 if (r) in walk_node()
968 r = fn(context, &keys, value_ptr(n, i)); in walk_node()
969 if (r) in walk_node()
976 return r; in walk_node()