Lines Matching defs:keys
20 * bch_ptr_invalid() primarily filters out keys and pointers that would be
21 * invalid due to some sort of bug, whereas bch_ptr_bad() filters out keys and
24 * The one exception to the rule that ptr_invalid() filters out invalid keys is
25 * that it also filters out keys of size 0 - these are keys that have been
30 * We can't filter out stale keys when we're resorting, because garbage
32 * unless we're rewriting the btree node those stale keys still exist on disk.
56 * The btree iterator code serves both functions; it iterates through the keys
57 * in a btree node in sorted order, starting from either keys after a specific
62 * Since keys are variable length, we can't use a binary search on a bset - we
67 * So we need to construct some sort of lookup table. Since we only insert keys
68 * into the last (unwritten) set, most of the keys within a given btree node are
127 * The keys in the auxiliary search tree are stored in (software) floating
132 * We need 7 bits for the exponent and 3 bits for the key's offset (since keys
176 * The nodes in the bset tree point to specific keys - this
207 void (*key_dump)(struct btree_keys *keys,
225 * Sets of sorted keys - the real btree node - plus a binary search tree
262 #define set_bytes(i) __set_bytes(i, i->keys)
267 __set_blocks(i, (i)->keys, block_bytes)
401 (unsigned int)(i)->keys)
487 struct bkey *keys;
495 /* Enough room for btree_split's keys without realloc */
507 l->keys = k;
524 return l->top == l->keys;
529 l->top = l->keys;