Searched refs:bkey_u64s (Results 1 – 5 of 5) sorted by relevance
99 static __inline__ unsigned long bkey_u64s(const struct bkey *k) in bkey_u64s() function106 return bkey_u64s(k) * sizeof(__u64); in bkey_bytes()121 return (struct bkey *) (d + bkey_u64s(k)); in bkey_next()
99 static inline unsigned long bkey_u64s(const struct bkey *k) in bkey_u64s() function106 return bkey_u64s(k) * sizeof(__u64); in bkey_bytes()121 return (struct bkey *) (d + bkey_u64s(k)); in bkey_next()
175 l->top_p -= bkey_u64s(l->keys); in bch_keylist_pop_front()603 ? bset_bkey_idx(t->data, t->data->keys - bkey_u64s(&t->end)) in make_bfloat()718 t->prev[j] = bkey_u64s(prev); in bch_bset_build_written_tree()785 unsigned int shift = bkey_u64s(k); in bch_bset_fix_lookup_table()862 __set_bytes(t->data, t->data->keys + bkey_u64s(insert)) > in bch_bset_insert()865 memmove((uint64_t *) where + bkey_u64s(insert), in bch_bset_insert()869 t->data->keys += bkey_u64s(insert); in bch_bset_insert()
1289 gc->key_bytes += bkey_u64s(k); in btree_gc_mark_node()1383 bkey_u64s(k), in btree_gc_coalesce()1388 keys += bkey_u64s(k); in btree_gc_coalesce()1430 bkey_u64s(&new_nodes[i]->key))) in btree_gc_coalesce()1449 if (__bch_keylist_realloc(&keylist, bkey_u64s(&r[i].b->key))) in btree_gc_coalesce()1540 ret += bkey_u64s(k); in btree_gc_count_keys()2156 if (bkey_u64s(k) > insert_u64s_remaining(b)) in bch_btree_insert_keys()2241 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), in btree_split()2246 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()