Lines Matching refs:newNode
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) {
80 mFirst = mLast = newNode;
81 newNode->prev = newNode->next = 0;
83 newNode->prev = 0;
84 newNode->next = mFirst;
85 mFirst->prev = newNode;
86 mFirst = newNode;
90 void insertTail(NODE* newNode) {
92 insertHead(newNode);
94 newNode->prev = mLast;
95 newNode->next = 0;
96 mLast->next = newNode;
97 mLast = newNode;
