Lines Matching refs:pointer

66 The implementation uses a tree of 16-pointer nodes internally that are indexed
102 The script appears as outside of the API as a pointer of the type:
204      significant bit of the pointer must be zero as it's used to type-mark
376  (*) A NULL pointer, indicating that the slot is empty.
378  (*) A pointer to an object (a leaf).
380  (*) A pointer to a node at the next level.
382  (*) A pointer to a shortcut.
459 space.  The leaves can be in any slot not occupied by a metadata pointer.  It
461 metadata pointer.  If the metadata pointer is there, any leaf whose key matches
462 the metadata key prefix must be in the subtree that the metadata pointer points
514 Each node and shortcut contains a back pointer to its parent and the number of
528      matching leaf pointer with the pointer to the new leaf after a barrier.
538      the iteration as we won't have reached the pointer to it yet and the
542      problem as we've passed the anchoring pointer and won't switch onto the
562      pointer and the parent slot pointer on a node (say, for example, we
570      the parent slot number is read after the back pointer.