Lines Matching refs:pNode
98 void ListDigraph::erase(ListDigraph::Node& pNode)
101 if (NULL != pNode.next) {
102 pNode.next->prev = pNode.prev;
105 if (NULL != pNode.prev) {
106 pNode.prev->next = pNode.next;
108 else { // pNode.prev is NULL => pNode is the head
109 m_pNodeHead = pNode.next;
113 Arc* fan_in = pNode.first_in;
121 Arc* fan_out = pNode.first_out;
128 // 4. put pNode in the free node list
129 pNode.next = m_pFreeNodeHead;
130 pNode.prev = NULL;
132 m_pFreeNodeHead->prev = &pNode;
133 m_pFreeNodeHead = &pNode;
