Lines Matching refs:pRoot

143 static void                 stamR3LookupDestroyTree(PSTAMLOOKUP pRoot);
295 PSTAMLOOKUP pRoot = (PSTAMLOOKUP)RTMemAlloc(sizeof(STAMLOOKUP));
296 if (!pRoot)
302 pRoot->pParent = NULL;
303 pRoot->papChildren = NULL;
304 pRoot->pDesc = NULL;
305 pRoot->cDescsInTree = 0;
306 pRoot->cChildren = 0;
307 pRoot->iParent = UINT16_MAX;
308 pRoot->off = 0;
309 pRoot->cch = 0;
310 pRoot->szName[0] = '\0';
312 pUVM->stam.s.pRoot = pRoot;
358 stamR3LookupDestroyTree(pUVM->stam.s.pRoot);
359 pUVM->stam.s.pRoot = NULL;
862 * @param pRoot The root node.
865 static PSTAMDESC stamR3LookupFindDesc(PSTAMLOOKUP pRoot, const char *pszName)
867 Assert(!pRoot->pParent);
872 PSTAMLOOKUP pChild = stamR3LookupFindChild(pRoot, pszName, cch, NULL);
878 pRoot = pChild;
1009 * @param pRoot The root node.
1015 static PSTAMDESC stamR3LookupFindPatternDescRange(PSTAMLOOKUP pRoot, PRTLISTANCHOR pList, const char *pszPat,
1018 Assert(!pRoot->pParent);
1034 && pRoot->cDescsInTree > 0
1035 && pRoot->cChildren > 0)
1047 PSTAMLOOKUP pFirst = pRoot->papChildren[0];
1048 PSTAMLOOKUP pLast = pRoot->papChildren[pRoot->cChildren - 1];
1055 PSTAMLOOKUP pChild = stamR3LookupFindChild(pRoot, pszPat, cch, NULL);
1063 pRoot = pChild;
1167 * @param pRoot The root of the tree (must have no parent).
1169 static void stamR3LookupDestroyTree(PSTAMLOOKUP pRoot)
1171 Assert(pRoot); Assert(!pRoot->pParent);
1172 PSTAMLOOKUP pCur = pRoot;
1271 PSTAMLOOKUP pLookup = pUVM->stam.s.pRoot; Assert(pLookup);
1519 PSTAMDESC pCur = stamR3LookupFindPatternDescRange(pUVM->stam.s.pRoot, &pUVM->stam.s.List, pszPat, &pLast);
2522 pCur = stamR3LookupFindDesc(pUVM->stam.s.pRoot, pszPat);
2529 pCur = stamR3LookupFindPatternDescRange(pUVM->stam.s.pRoot, &pUVM->stam.s.List, pszPat, &pLast);