Searched refs:bkey_float (Results 1 – 3 of 3) sorted by relevance
301 struct bkey_float { struct 310 struct bkey_float f[]; argument 327 DIV_ROUND_UP(t->size * sizeof(struct bkey_float), 8); in bset_aux_tree_buf_end() 358 static struct bkey_float *bkey_float(const struct btree *b, in bkey_float() function 409 * then bkey_float->m gives us the offset within that cacheline, in units of 8417 * bits we're going to store in bkey_float->mantissa. t->prev[j] stores the size470 bkey_float(b, t, j)->key_offset); in tree_to_bkey() 573 const struct bkey_float *f) in bkey_mantissa() 600 struct bkey_float * in make_bfloat() [all...]
244 struct bkey_float { struct 255 * It definites the number of bytes (in struct bset) per struct bkey_float in argument 281 return btree_keys_cachelines(b) * sizeof(struct bkey_float); in bset_tree_bytes() 514 * bkey_float->m gives us the offset within that cacheline, in units of 8 bytes.521 * bits we're going to store in bkey_float->mantissa. t->prev[j] stores the size571 * Calculate mantissa value for struct bkey_float.585 struct bkey_float *f) in bfloat_mantissa() 594 struct bkey_float *f = &t->tree[j]; in make_bfloat() 641 64 / sizeof(struct bkey_float)); in bset_alloc_tree() 963 struct bkey_float * in bset_search_tree() [all...]
153 struct bkey_float;173 struct bkey_float *tree;179 * Conceptually it's a member of struct bkey_float, but we want180 * to keep bkey_float to 4 bytes and prev isn't used in the fast