Lines Matching defs:pNode
341 PAVLOGCPHYSNODECORE pNode = (PAVLOGCPHYSNODECORE)RTMemAlloc(sizeof(*pNode));
342 pNode->Key = i;
343 if (!RTAvloGCPhysInsert(pTree, pNode))
349 AVLOGCPHYSNODECORE Node = *pNode;
361 PAVLOGCPHYSNODECORE pNode = RTAvloGCPhysRemove(pTree, i);
362 if (!pNode)
367 memset(pNode, 0xcc, sizeof(*pNode));
368 RTMemFree(pNode);
371 pNode = RTAvloGCPhysRemove(pTree, i);
372 if (pNode)
387 PAVLOGCPHYSNODECORE pNode = (PAVLOGCPHYSNODECORE)RTMemAlloc(sizeof(*pNode));
388 pNode->Key = i;
389 if (!RTAvloGCPhysInsert(pTree, pNode))
395 AVLOGCPHYSNODECORE Node = *pNode;
407 PAVLOGCPHYSNODECORE pNode = RTAvloGCPhysRemove(pTree, i);
408 if (!pNode)
413 memset(pNode, 0xcc, sizeof(*pNode));
414 RTMemFree(pNode);
417 pNode = RTAvloGCPhysRemove(pTree, i);
418 if (pNode)
433 PAVLOGCPHYSNODECORE pNode = (PAVLOGCPHYSNODECORE)RTMemAlloc(sizeof(*pNode));
434 pNode->Key = i;
435 if (!RTAvloGCPhysInsert(pTree, pNode))
441 AVLOGCPHYSNODECORE Node = *pNode;
453 PAVLOGCPHYSNODECORE pNode = (PAVLOGCPHYSNODECORE)((intptr_t)pTree + *pTree);
454 RTGCPHYS Key = pNode->Key;
455 pNode = RTAvloGCPhysRemove(pTree, Key);
456 if (!pNode)
461 memset(pNode, 0xcc, sizeof(*pNode));
462 RTMemFree(pNode);
465 pNode = RTAvloGCPhysRemove(pTree, Key);
466 if (pNode)
487 PAVLOGCPHYSNODECORE pNode = (PAVLOGCPHYSNODECORE)RTMemAlloc(sizeof(*pNode));
488 pNode->Key = i;
489 if (!RTAvloGCPhysInsert(pTree, pNode))
495 AVLOGCPHYSNODECORE Node = *pNode;
511 PAVLOGCPHYSNODECORE pNode = RTAvloGCPhysRemoveBestFit(pTree, i, true);
512 if (!pNode)
517 if (pNode->Key - (unsigned long)i >= 8 * 4)
519 RTTestIFailed("sparse remove i=%d j=%d Key=%d\n", i, j, (unsigned)pNode->Key);
522 memset(pNode, 0xdd, sizeof(*pNode));
523 RTMemFree(pNode);
565 PAVLOGCPHYSNODECORE pNode = (PAVLOGCPHYSNODECORE)RTMemAlloc(sizeof(*pNode));
566 pNode->Key = Key;
567 if (!RTAvloGCPhysInsert(pTree, pNode))
573 AVLOGCPHYSNODECORE Node = *pNode;
596 PAVLOGCPHYSNODECORE pNode = RTAvloGCPhysRemove(pTree, Key);
597 if (!pNode)
602 if (pNode->Key != Key)
604 RTTestIFailed("random remove i=%d Key=%#x pNode->Key=%#x\n", i, Key, (unsigned)pNode->Key);
608 memset(pNode, 0xdd, sizeof(*pNode));
609 RTMemFree(pNode);
642 PAVLROGCPHYSNODECORE pNode = (PAVLROGCPHYSNODECORE)RTMemAlloc(sizeof(*pNode));
643 pNode->Key = i;
644 pNode->KeyLast = i + 3;
645 if (!RTAvlroGCPhysInsert(pTree, pNode))
652 AVLROGCPHYSNODECORE Node = *pNode;
671 PAVLROGCPHYSNODECORE pNode = RTAvlroGCPhysGet(pTree, i);
672 if (!pNode)
677 if (pNode->Key > i || pNode->KeyLast < i)
679 RTTestIFailed("linear get i=%d Key=%d KeyLast=%d\n", i, (unsigned)pNode->Key, (unsigned)pNode->KeyLast);
685 if (RTAvlroGCPhysRangeGet(pTree, i + j) != pNode)
706 PAVLROGCPHYSNODECORE pNode = RTAvlroGCPhysRemove(pTree, i);
707 if (!pNode)
712 memset(pNode, 0xcc, sizeof(*pNode));
713 RTMemFree(pNode);
731 PAVLROGCPHYSNODECORE pNode = (PAVLROGCPHYSNODECORE)RTMemAlloc(sizeof(*pNode));
732 pNode->Key = i;
733 pNode->KeyLast = i + 3;
734 if (!RTAvlroGCPhysInsert(pTree, pNode))
740 AVLROGCPHYSNODECORE Node = *pNode;
743 for (j = pNode->KeyLast; j >= jMin; j--)
745 for (k = pNode->Key; k < kMax; k++)
767 PAVLROGCPHYSNODECORE pNode = RTAvlroGCPhysGet(pTree, KeyBase);
768 if (!pNode)
773 if (pNode->Key > KeyBase || pNode->KeyLast < KeyBase)
775 RTTestIFailed("sparse get i=%d j=%d KeyBase=%d pNode->Key=%d\n", i, j, (unsigned)KeyBase, (unsigned)pNode->Key);
780 if (RTAvlroGCPhysRangeGet(pTree, k) != pNode)
816 if (RTAvlroGCPhysRangeRemove(pTree, Key) != pNode)
821 memset(pNode, 0xdd, sizeof(*pNode));
822 RTMemFree(pNode);
854 PAVLROGCPHYSNODECORE pNode = &s1.aNode[i];
855 if (!RTAvlroGCPhysInsert(&s1.Tree, pNode))
860 if (RTAvlroGCPhysInsert(&s1.Tree, pNode))
865 if (RTAvlroGCPhysGet(&s1.Tree, pNode->Key) != pNode)
870 if (RTAvlroGCPhysGet(&s1.Tree, pNode->KeyLast) != NULL)
875 if (RTAvlroGCPhysRangeGet(&s1.Tree, pNode->Key) != pNode)
880 if (RTAvlroGCPhysRangeGet(&s1.Tree, pNode->Key + 1) != pNode)
885 if (RTAvlroGCPhysRangeGet(&s1.Tree, pNode->KeyLast) != pNode)
896 PAVLROGCPHYSNODECORE pNode = &s3.aNode[i];
897 if (RTAvlroGCPhysGet(&s3.Tree, pNode->Key) != pNode)
902 if (RTAvlroGCPhysRangeGet(&s3.Tree, pNode->Key) != pNode)
908 j = pNode->Key + 1;
916 if (RTAvlroGCPhysRangeGet(&s3.Tree, j) != pNode)
921 } while (j++ < pNode->KeyLast);
940 PAVLULNODECORE pNode = (PAVLULNODECORE)RTMemAlloc(sizeof(*pNode));
941 pNode->Key = i;
942 if (!RTAvlULInsert(&pTree, pNode))
948 AVLULNODECORE Node = *pNode;
958 PAVLULNODECORE pNode = RTAvlULRemove(&pTree, i);
959 if (!pNode)
964 pNode->pLeft = (PAVLULNODECORE)0xaaaaaaaa;
965 pNode->pRight = (PAVLULNODECORE)0xbbbbbbbb;
966 pNode->uchHeight = 'e';
967 RTMemFree(pNode);
970 pNode = RTAvlULRemove(&pTree, i);
971 if (pNode)
983 PAVLULNODECORE pNode = (PAVLULNODECORE)RTMemAlloc(sizeof(*pNode));
984 pNode->Key = i;
985 if (!RTAvlULInsert(&pTree, pNode))
991 AVLULNODECORE Node = *pNode;
1007 PAVLULNODECORE pNode = RTAvlULRemoveBestFit(&pTree, i, true);
1008 //PAVLULNODECORE pNode = RTAvlULRemove(&pTree, i + j * 8);
1009 if (!pNode)
1014 pNode->pLeft = (PAVLULNODECORE)0xdddddddd;
1015 pNode->pRight = (PAVLULNODECORE)0xcccccccc;
1016 pNode->uchHeight = 'E';
1017 RTMemFree(pNode);