Lines Matching refs:NODE
48 template <typename NODE>
51 NODE* mFirst;
52 NODE* mLast;
57 NODE const* head() const { return mFirst; }
58 NODE* head() { return mFirst; }
59 NODE const* tail() const { return mLast; }
60 NODE* tail() { return mLast; }
62 void insertAfter(NODE* node, NODE* newNode) {
63 newNode->prev = node;
64 newNode->next = node->next;
65 if (node->next == 0) mLast = newNode;
66 else node->next->prev = newNode;
67 node->next = newNode;
70 void insertBefore(NODE* node, NODE* newNode) {
71 newNode->prev = node->prev;
72 newNode->next = node;
73 if (node->prev == 0) mFirst = newNode;
74 else node->prev->next = newNode;
75 node->prev = newNode;
78 void insertHead(NODE* newNode) {
90 void insertTail(NODE* newNode) {
101 NODE* remove(NODE* node) {
102 if (node->prev == 0) mFirst = node->next;
103 else node->prev->next = node->next;
104 if (node->next == 0) mLast = node->prev;
105 else node->next->prev = node->prev;
106 return node;
285 chunk_t* node = new chunk_t(0, mHeapSize / kMemoryAlign);
286 mList.insertHead(node);
