Lines Matching refs:we

157  (3) See if this is the object we're looking for.
536  (3) Insertion replacing part of a subtree that we haven't yet entered.  This
538      the iteration as we won't have reached the pointer to it yet and the
541  (4) Insertion replacing nodes that we're actively processing.  This isn't a
542      problem as we've passed the anchoring pointer and won't switch onto the
543      new layout until we follow the back pointers - at which point we've
544      already examined the leaves in the replaced node (we iterate over all the
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.
551      This won't affect us until we follow the back pointers.  Similar to (4).
554      back pointers will get us back to the parent of the new node before we
556      unchanged - and will still be rooted on the same slot, so we shouldn't
557      process it a second time as we'll go back to slot + 1.
561  (*) Under some circumstances, we need to simultaneously change the parent
562      pointer and the parent slot pointer on a node (say, for example, we
564      this without locking against a read - so we have to replace that node too.
566      However, when we're changing a shortcut into a node this isn't a problem