Lines Matching defs:nodes
63 * contain metadata (including btree nodes).
111 * free smaller than a bucket - so, that's how big our btree nodes are.
116 * bucket's gen for deleting btree nodes when we rewrite/split a node.)
118 * Anyways, btree nodes are big - big enough to be inefficient with a textbook
121 * The way this is solved is that btree nodes are internally log structured; we
150 * wrapping around. It also merges adjacent btree nodes if they're empty enough.
164 * nodes in the btree, and those writes will be mostly empty (appending at most
173 * For simplicity, we only journal updates to leaf nodes; updates to parent
174 * nodes are rare enough (since our leaf nodes are huge) that it wasn't worth
176 * - updates to non leaf nodes just happen synchronously (see btree_split()).
482 size_t nodes;
575 * common to delete and allocate btree nodes in quick succession. It
576 * should never grow past ~2-3 nodes in practice.
600 * pointers to the new nodes inserted into the btree yet.