Lines Matching refs:pNode
80 struct listNode* pNode; in listAdd() local
85 pNode = (struct listNode*)malloc(sizeof(struct listNode)); in listAdd()
86 if (pNode == NULL) { in listAdd()
91 pNode->pData = pData; in listAdd()
92 pNode->pNext = NULL; in listAdd()
98 pList->pFirst = pNode; in listAdd()
107 pLastNode->pNext = pNode; in listAdd()
127 struct listNode* pNode; in listRemove() local
140 pNode = pList->pFirst; in listRemove()
143 pRemovedNode = pNode; in listRemove()
148 while (pNode->pNext != NULL) { in listRemove()
149 if (pNode->pNext->pData == pData) { in listRemove()
153 pNode = pNode->pNext; in listRemove()
156 if (pNode->pNext == NULL) { in listRemove()
164 pRemovedNode = pNode->pNext; in listRemove()
167 pNode->pNext = pNode->pNext->pNext; in listRemove()
190 struct listNode* pNode; in listGetAndRemoveNext() local
203 pNode = pList->pFirst; in listGetAndRemoveNext()
207 *ppData = pNode->pData; in listGetAndRemoveNext()
211 pList->pFirst = pNode->pNext; in listGetAndRemoveNext()
212 free(pNode); in listGetAndRemoveNext()
232 struct listNode* pNode = pList->pFirst; in listDump() local
235 while (pNode != NULL) { in listDump()
236 NXPLOG_NCIHAL_D("- %8p (%8p)", pNode, pNode->pData); in listDump()
237 pNode = pNode->pNext; in listDump()