Lines Matching refs:pNode

47     PRTISOFSPATHTABLEENTRY pNode = RTListGetFirst(&pFile->listPaths, RTISOFSPATHTABLEENTRY, Node);
48 while (pNode)
50 PRTISOFSPATHTABLEENTRY pNext = RTListNodeGetNext(&pNode->Node, RTISOFSPATHTABLEENTRY, Node);
51 bool fLast = RTListNodeIsLast(&pFile->listPaths, &pNode->Node);
53 if (pNode->path)
54 RTStrFree(pNode->path);
55 if (pNode->path_full)
56 RTStrFree(pNode->path_full);
57 RTListNodeRemove(&pNode->Node);
58 RTMemFree(pNode);
63 pNode = pNext;
83 PRTISOFSPATHTABLEENTRY pNode = (PRTISOFSPATHTABLEENTRY)RTMemAlloc(sizeof(RTISOFSPATHTABLEENTRY));
84 if (pNode == NULL)
87 pNode->path = NULL;
88 if (RT_SUCCESS(RTStrAAppend(&pNode->path, pszPath)))
90 memcpy((RTISOFSPATHTABLEHEADER*)&pNode->header,
91 (RTISOFSPATHTABLEHEADER*)pHeader, sizeof(pNode->header));
93 pNode->path_full = NULL;
94 pNode->Node.pPrev = NULL;
95 pNode->Node.pNext = NULL;
96 RTListAppend(pList, &pNode->Node);
109 * @param pNode Node of path table entry to lookup the full path for.
113 static int rtIsoFsGetParentPathSub(PRTLISTNODE pList, PRTISOFSPATHTABLEENTRY pNode,
118 if (pNode->header.parent_index > 1)
121 /* Get the parent of our current node (pNode) */
123 while (idx++ < pNode->header.parent_index)
204 PRTISOFSPATHTABLEENTRY pNode = RTListGetLast(&pFile->listPaths, RTISOFSPATHTABLEENTRY, Node);
205 while ( pNode
206 && !RTListNodeIsFirst(&pFile->listPaths, &pNode->Node)
209 rc = rtIsoFsGetParentPathSub(&pFile->listPaths, pNode,
210 pNode->path, &pNode->path_full);
212 pNode = RTListNodeGetPrev(&pNode->Node, RTISOFSPATHTABLEENTRY, Node);
416 PRTISOFSPATHTABLEENTRY pNode;
419 pNode = RTListGetFirst(&pFile->listPaths, RTISOFSPATHTABLEENTRY, Node);
420 if (pNode)
425 RTListForEach(&pFile->listPaths, pNode, RTISOFSPATHTABLEENTRY, Node)
427 if ( pNode->path_full != NULL /* Root does not have a path! */
428 && !RTStrICmp(pNode->path_full, pszTemp))
437 AssertPtr(pNode);
438 *puSector = pNode->header.sector_dir_table;