Lines Matching defs:set
68 * into the last (unwritten) set, most of the keys within a given btree node are
73 * set; they index one key every BSET_CACHELINE bytes, and then a linear search
89 * (we don't want to fetch the key from the set, that would defeat the purpose),
93 * search tree corresponds to precisely BSET_CACHELINE bytes in the set. We have
138 * don't want to be constantly rebuilding the search tree for the last set
139 * whenever we insert another key into it. For the unwritten set, we use a much
141 * corresponds to the i range of BSET_CACHELINE bytes in the set. Indexing
171 /* copy of the last key in the set */
185 /* The actual btree node, with pointers to each sorted set */
227 * set[0] is special; set[0]->tree, set[0]->prev and set[0]->data point
229 * set[0]->data points to the entire btree node as it exists on disk.
231 struct bset_tree set[MAX_BSETS];
236 return b->set + b->nsets;
241 return t <= b->set + b->nsets - b->last_set_unwritten;
246 return !b->last_set_unwritten || k < b->set[b->nsets].data->start;
252 return ((size_t) i) - ((size_t) b->set->data);
440 * key of k. If the preceding key does not exist, set '*preceding_key_p' to
560 void bch_dump_bset(struct btree_keys *b, struct bset *i, unsigned int set);
569 void bch_dump_bset(struct btree_keys *b, struct bset *i, unsigned int set);