Searched refs:next_ (Results 1 – 6 of 6) sorted by relevance
47 AllocatorStats *next_; variable62 s->next_ = next_; in Register()64 next_->prev_ = s; in Register()65 next_ = s; in Register()70 s->prev_->next_ = s->next_; in Unregister()71 s->next_->prev_ = s->prev_; in Unregister()83 stats = stats->next_; in Get()94 if (!next_) { in LazyInit()95 next_ = this; in LazyInit()
29 RB->last_ = RB->next_ = reinterpret_cast<T*>(End - sizeof(T)); in New() 48 *next_ = t; in push() 49 next_--; in push() 53 if (next_ <= reinterpret_cast<T*>(&next_)) in push() 54 next_ = last_;60 if (IdxNext > last_ - next_)62 return next_[IdxNext];74 // N: next_, initially equals to last_, is decremented on every push,77 T *next_;75 T *next_; global() variable [all...]
24 INode* next_ = nullptr;78 node_.next_ = node_.prev_ = &node_; in IList()94 DCHECK_EQ(n->next_, nullptr); in Push()96 INode* next = after->next_; in Push()97 n->next_ = next; in Push()100 after->next_ = n; in Push()107 INode* next = n->next_; in Remove()113 prev->next_ = next; in Remove()114 n->prev_ = n->next_ = nullptr; in Remove()136 return size_ ? ToElem(node_.next_) : nullptr; in Front()[all …]
54 QueueNode* next() { return next_; } in next()55 const QueueNode* next() const { return next_; } in next()61 : element_(an_element), next_(nullptr) {} in QueueNode()68 QueueNode* next_; variable121 last_->next_ = new_node; in Enqueue()135 head_ = head_->next_; in Dequeue()154 node = node->next_) { in Map()
323 cl->next_ = parent->children_; in rmc_newclass()504 t = t->next_; in rmc_depth_recompute()526 t = t->next_; in rmc_depth_recompute()570 if (head->next_ == NULL) { in rmc_delete_class()577 cl->parent_->children_ = cl->next_; in rmc_delete_class()579 previous->next_ = cl->next_; in rmc_delete_class()580 cl->next_ = NULL; in rmc_delete_class()584 p = p->next_; in rmc_delete_class()859 p = p->next_; in rmc_satisfied()
156 rm_class_t *next_; /* Next pointer, used if child */ member