Lines Matching refs:that

38      Rather, the array is made up of metadata blocks that point to objects.
66 The implementation uses a tree of 16-pointer nodes internally that are indexed
91 The insertion and deletion functions produce an 'edit script' that can later be
93 preallocated metadata blocks that will be installed in the internal tree and
94 keeps track of the metadata blocks that will be removed from the tree when the
98 script has been applied so that they can be freed later.  The freeing is done
177      Free the specified object.  Note that this may be called an RCU grace
203      This inserts the given object into the array.  Note that the least
207      If an object already exists for that key then it will be replaced with the
214      an edit script that must be applied.  -ENOMEM is returned in the case of
227      This deletes an object that matches the specified data from the array.
233      an edit script that must be applied.  -ENOMEM is returned in the case of
250      an edit script that must be applied.  -ENOMEM is returned in the case of
265      something that would require memory to be allocated.
311      iterator_data is private data for that function.
345 the key is, it is strongly recommended that the index key includes its length
352 It is also recommended that the index key begin with a hash of the rest of the
363 unlikely that more than one word of any particular index key will have to be
376  (*) A NULL pointer, indicating that the slot is empty.
458 Metadata pointers must be in the slots that match their subdivisions of key
460 is guaranteed that none of the leaves in a node will match a slot occupied by a
462 the metadata key prefix must be in the subtree that the metadata pointer points
484 Shortcuts are metadata records that jump over a piece of keyspace.  A shortcut
498 insertion algorithm finds that it is trying to insert a 17th object into a
499 node, that node will be split such that at least two leaves that have a common
500 key segment at that level end up in a separate node rooted on that slot for
501 that common key segment.
503 If the leaves in a full node and the leaf that is being inserted are
515 slot in that parent that points to it.  None-recursive iteration uses these to
536  (3) Insertion replacing part of a subtree that we haven't yet entered.  This
537      may involve replacement of part of that subtree - but that won't affect
541  (4) Insertion replacing nodes that we're actively processing.  This isn't a
547      We might, however, re-see some leaves that have been split out into a new
548      branch that's in a slot further along than we were at.
550  (5) Insertion replacing nodes that we're processing a dependent branch of.
564      this without locking against a read - so we have to replace that node too.
568      when traversing backwards over one.  This means that it's okay to change