hashlist.h - OpenGrok cross reference for /developtools/hiperf/include/hashlist.h

Lines Matching refs:next_
28     Link(const Link &link) : prev_ {link.prev_}, next_ {link.next_} {}
29     Link(Link &&link) : prev_ {link.prev_}, next_ {link.next_}
32         link.next_ = nullptr;
37         next_ = link.next_;
44         next_ = link.next_;
45         link.next_ = nullptr;
49     Link *next_ {nullptr};
164         return (dataHead_.next_ == &dataHead_) and (dataHead_.prev_ == &dataHead_);
172         return freeHead_.next_ == &freeHead_;
351     Link* plink = pnode_->link_.next_;
370     Link* plink = pnode_->link_.next_;
589         plink = phashList_->dataHead_.next_;
591         plink = pnode_->link_.next_;
612         plink = phashList_->dataHead_.next_;
614         plink = pnode_->link_.next_;
698     dataHead_.next_ = &dataHead_;
704             freeHead_.next_ = &(pData_[0].link_);
708                 curNnode.link_.next_ = &(pData_[++index].link_);
710             pData_[last].link_.next_ = &freeHead_;
713             freeHead_.next_ = &freeHead_;
729         dataHead_.next_ = &dataHead_;
732             freeHead_.next_ = &(pData_[0].link_);
736                 curNnode.link_.next_ = &(pData_[++index].link_);
738             pData_[last].link_.next_ = &freeHead_;
741             freeHead_.next_ = &freeHead_;
756     dataHead_.next_ = &dataHead_;
758     freeHead_.next_ = nullptr;
801     return Iterator(LinkNode<Key, Val>::GetLinkNode(dataHead_.next_), this);
811     return Iterator(LinkNode<Key, Val>::GetLinkNode(dataHead_.next_), this);
865     LinkNode<Key, Val> *pnode = LinkNode<Key, Val>::GetLinkNode(dataHead_.next_);
973     LinkNode<Key, Val>* pnode = LinkNode<Key, Val>::GetLinkNode(dataHead_.next_);
1000     Link* plink = pnode->link_.next_;
1041     if (pnode->link_.next_ == &curNode->link_) {
1045     Link* nextLink = pnode->link_.next_;
1047         prevLink->next_ = nextLink;
1053     prevLink->next_ = nextLink;
1055     nextLink->next_ = currLink;
1063     if (pnode->link_.prev_ and pnode->link_.next_) {
1065         Link* next = pnode->link_.next_;
1066         prev->next_ = next;
1069     pnode->link_.next_ = dataHead_.next_;
1070     dataHead_.next_->prev_ = &pnode->link_;
1071     dataHead_.next_ = &pnode->link_;
1078     if (pnode->link_.prev_ and pnode->link_.next_) {
1080         Link* next = pnode->link_.next_;
1081         prev->next_ = next;
1085     dataHead_.prev_->next_ = &pnode->link_;
1086     pnode->link_.next_ = &dataHead_;
1097     LinkNode<Key, Val> *pnode = LinkNode<Key, Val>::GetLinkNode(freeHead_.next_);
1098     freeHead_.next_ = freeHead_.next_->next_;
1100         pnode->link_.next_ = nullptr;
1115     LinkNode<Key, Val> *pnode = LinkNode<Key, Val>::GetLinkNode(freeHead_.next_);
1116     freeHead_.next_ = freeHead_.next_->next_;
1117     pnode->link_.next_ = nullptr;
1131     LinkNode<Key, Val> *pnode = LinkNode<Key, Val>::GetLinkNode(freeHead_.next_);
1132     freeHead_.next_ = freeHead_.next_->next_;
1133     pnode->link_.next_ = nullptr;
1144     Link *nextLink = pnode->link_.next_;
1145     prevLink->next_ = nextLink;
1148     pnode->link_.next_ = freeHead_.next_;
1149     freeHead_.next_ = &pnode->link_;