Lines Matching refs:le64_to_cpu
50 uint64_t mid_key = le64_to_cpu(n->keys[mid]); in bsearch()
367 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in btree_lookup_raw()
411 root = le64_to_cpu(internal_value_le); in dm_btree_lookup()
462 *rkey = le64_to_cpu(n->keys[i]); in dm_btree_lookup_next_single()
491 root = le64_to_cpu(internal_value_le); in dm_btree_lookup_next()
684 le64_to_cpu(rn->keys[0]), &location); in split_one_into_two()
691 if (key < le64_to_cpu(rn->keys[0])) { in split_one_into_two()
783 le64_to_cpu(mn->keys[0]), &location); in split_two_into_three()
798 if (key < le64_to_cpu(mn->keys[0])) { in split_two_into_three()
802 } else if (key < le64_to_cpu(rn->keys[0])) { in split_two_into_three()
931 if (key < le64_to_cpu(right->keys[0])) { in rebalance_left()
960 if (key < le64_to_cpu(right->keys[0])) { in rebalance_right()
1067 if (i >= 0 && le64_to_cpu(node->keys[i]) == key) in contains_key()
1149 if (i < 0 || le64_to_cpu(node->keys[i]) != key) in btree_insert_raw()
1190 if (key != le64_to_cpu(node->keys[i])) in __btree_get_overwrite_leaf()
1231 (le64_to_cpu(node->keys[index]) != keys[level])); in need_insert()
1359 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in find_key()
1361 *result_key = le64_to_cpu(ro_node(s)->keys[0]); in find_key()
1444 keys = le64_to_cpu(*key_ptr(n, i)); in walk_node()
1480 dm_bm_prefetch(bm, le64_to_cpu(value_le)); in prefetch_values()
1558 r = push_node(c, le64_to_cpu(value_le)); in find_leaf()
1630 *key = le64_to_cpu(*key_ptr(bn, n->index)); in dm_btree_cursor_get_value()