Lines Matching refs:leaves
228 This deletes all the objects from an associative array and leaves it
243 This destroys the contents of the associative array and leaves it
331 This will cause leaves with different length keys to scatter away from each
340 can contain mixtures of leaves and metadata pointers.
432 To save memory, if a node can hold all the leaves in its portion of keyspace,
433 then the node will have all those leaves in it and will not have any metadata
434 pointers - even if some of those leaves would like to be in the same slot.
436 A node can contain a heterogeneous mix of leaves and metadata pointers.
438 space. The leaves can be in any slot not occupied by a metadata pointer. It
439 is guaranteed that none of the leaves in a node will match a slot occupied by a
477 Each node has a maximum capacity of 16 leaves and metadata pointers. If the
479 node, that node will be split such that at least two leaves that have a common
483 If the leaves in a full node and the leaf that is being inserted are
524 already examined the leaves in the replaced node (we iterate over all the
525 leaves in a node before following any of its metadata pointers).
527 We might, however, re-see some leaves that have been split out into a new
552 Obsolete blocks and leaves are freed up after an RCU grace period has passed,