Lines Matching refs:le64_to_cpu
47 uint64_t mid_key = le64_to_cpu(n->keys[mid]); in bsearch()
362 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in btree_lookup_raw()
406 root = le64_to_cpu(internal_value_le); in dm_btree_lookup()
457 *rkey = le64_to_cpu(n->keys[i]); in dm_btree_lookup_next_single()
486 root = le64_to_cpu(internal_value_le); in dm_btree_lookup_next()
673 le64_to_cpu(rn->keys[0]), &location); in split_one_into_two()
680 if (key < le64_to_cpu(rn->keys[0])) { in split_one_into_two()
772 le64_to_cpu(mn->keys[0]), &location); in split_two_into_three()
787 if (key < le64_to_cpu(mn->keys[0])) { in split_two_into_three()
791 } else if (key < le64_to_cpu(rn->keys[0])) { in split_two_into_three()
920 if (key < le64_to_cpu(right->keys[0])) { in rebalance_left()
949 if (key < le64_to_cpu(right->keys[0])) { in rebalance_right()
1054 if (i >= 0 && le64_to_cpu(node->keys[i]) == key) in contains_key()
1136 if (i < 0 || le64_to_cpu(node->keys[i]) != key) in btree_insert_raw()
1177 if (key != le64_to_cpu(node->keys[i])) in __btree_get_overwrite_leaf()
1218 (le64_to_cpu(node->keys[index]) != keys[level])); in need_insert()
1346 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in find_key()
1348 *result_key = le64_to_cpu(ro_node(s)->keys[0]); in find_key()
1431 keys = le64_to_cpu(*key_ptr(n, i)); in walk_node()
1467 dm_bm_prefetch(bm, le64_to_cpu(value_le)); in prefetch_values()
1545 r = push_node(c, le64_to_cpu(value_le)); in find_leaf()
1616 *key = le64_to_cpu(*key_ptr(bn, n->index)); in dm_btree_cursor_get_value()