Lines Matching refs:pointer
48 The implementation uses a tree of 16-pointer nodes internally that are indexed
85 The script appears as outside of the API as a pointer of the type::
186 significant bit of the pointer must be zero as it's used to type-mark
357 * A NULL pointer, indicating that the slot is empty.
358 * A pointer to an object (a leaf).
359 * A pointer to a node at the next level.
360 * A pointer to a shortcut.
438 space. The leaves can be in any slot not occupied by a metadata pointer. It
440 metadata pointer. If the metadata pointer is there, any leaf whose key matches
441 the metadata key prefix must be in the subtree that the metadata pointer points
494 Each node and shortcut contains a back pointer to its parent and the number of
508 matching leaf pointer with the pointer to the new leaf after a barrier.
518 the iteration as we won't have reached the pointer to it yet and the
522 problem as we've passed the anchoring pointer and won't switch onto the
542 pointer and the parent slot pointer on a node (say, for example, we
550 the parent slot number is read after the back pointer.