Lines Matching +full:keep +full:- +full:a +full:- +full:live
10 #include "dm-btree.h"
12 /*----------------------------------------------------------------*/
15 * We'll need 2 accessor functions for n->csum and n->blocknr
16 * to support dm-btree-spine.c in that case.
25 * Every btree node begins with this structure. Make sure it's a multiple
26 * of 8-bytes in size, otherwise the 64bit keys will be mis-aligned.
31 __le64 blocknr; /* Block this node is supposed to live in. */
46 * Locks a block using the btree node validator.
58 * Spines keep track of the rolling locks. There are 2 variants, read-only
61 * on a shadow spine.
110 return n->keys + index; in key_ptr()
115 return &n->keys[le32_to_cpu(n->header.max_entries)]; in value_base()
120 uint32_t value_size = le32_to_cpu(n->header.value_size); in value_ptr()
125 * Assumes the values are suitably-aligned and converts to core format.
135 * Searching for a key within a single node.
142 * Value type for upper levels of multi-level btrees.