Searched refs:pLeft (Results 1 - 25 of 44) sorted by relevance

12

/vbox/src/VBox/Runtime/common/table/
H A Davl_GetBestFit.cpp.h56 if (pNode->pLeft != KAVL_NULL)
59 pNode = KAVL_GET_POINTER(&pNode->pLeft);
79 if (pNode->pLeft != KAVL_NULL)
80 pNode = KAVL_GET_POINTER(&pNode->pLeft);
H A Davl_Get.cpp.h48 if (pNode->pLeft != KAVL_NULL)
49 pNode = KAVL_GET_POINTER(&pNode->pLeft);
H A Davl_RemoveNode.cpp.h54 if (pCurNode->pLeft != KAVL_NULL)
55 pCurNode = KAVL_GET_POINTER(&pCurNode->pLeft);
105 if (pNode->pLeft != KAVL_NULL)
106 KAVL_SET_POINTER(&pNewUs->pLeft, KAVL_GET_POINTER(&pNode->pLeft));
108 pNewUs->pLeft = KAVL_NULL;
117 if (KAVL_GET_POINTER_NULL(&pParent->pLeft) == pNode)
118 KAVL_SET_POINTER(&pParent->pLeft, pNewUs);
H A Davl_Base.cpp.h214 PKAVLNODECORE pLeftNode = KAVL_GET_POINTER_NULL(&pNode->pLeft);
221 PKAVLNODECORE pLeftLeftNode = KAVL_GET_POINTER_NULL(&pLeftNode->pLeft);
227 KAVL_SET_POINTER_NULL(&pNode->pLeft, &pLeftNode->pRight);
234 KAVL_SET_POINTER_NULL(&pLeftNode->pRight, &pLeftRightNode->pLeft);
235 KAVL_SET_POINTER_NULL(&pNode->pLeft, &pLeftRightNode->pRight);
236 KAVL_SET_POINTER(&pLeftRightNode->pLeft, pLeftNode);
245 PKAVLNODECORE pRightLeftNode = KAVL_GET_POINTER_NULL(&pRightNode->pLeft);
251 KAVL_SET_POINTER_NULL(&pNode->pRight, &pRightNode->pLeft);
252 KAVL_SET_POINTER(&pRightNode->pLeft, pNode);
258 KAVL_SET_POINTER_NULL(&pRightNode->pLeft,
[all...]
H A Davl_Destroy.cpp.h60 if (pNode->pLeft != KAVL_NULL)
61 apEntries[cEntries++] = KAVL_GET_POINTER(&pNode->pLeft);
88 if (KAVL_GET_POINTER(&pParent->pLeft) == pNode)
89 pParent->pLeft = KAVL_NULL;
96 kASSERT(pNode->pLeft == KAVL_NULL);
H A Davl_Range.cpp.h49 if (pNode->pLeft != KAVL_NULL)
50 pNode = KAVL_GET_POINTER(&pNode->pLeft);
H A Davl_DoWithAll.cpp.h65 if (pNode->pLeft != KAVL_NULL)
68 AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pLeft);
129 if (pNode->pLeft != KAVL_NULL)
132 AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pLeft);
H A Davl_Enum.cpp.h72 return KAVL_GET_POINTER_NULL(&pNode->pLeft);
/vbox/src/bldprogs/
H A Dscmdiff.h34 PSCMSTREAM pLeft; member in struct:SCMDIFFSTATE
54 size_t ScmDiffStreams(const char *pszFilename, PSCMSTREAM pLeft, PSCMSTREAM pRight, bool fIgnoreEol,
H A Dscmdiff.cpp129 size_t c = ScmStreamCountLines(pState->pLeft);
178 scmDiffPrintLines(pState, '<', pState->pLeft, iLeft, cLeft);
187 ScmStreamSeekByLine(pState->pLeft, iLeft + cLeft + cMatches);
263 const char *pchLeft = ScmStreamGetLineByNo(pState->pLeft, iLeft + iLine, &cchLeft, &enmEolLeft);
289 size_t const iStartLeft = ScmStreamTellLine(pState->pLeft) - 1;
305 const char *pchLine = ScmStreamGetLineByNo(pState->pLeft, iStartLeft + iRange, &cchLine, &enmEol);
338 const char *pchLeft = ScmStreamGetLineByNo(pState->pLeft, iStartLeft + iLeft,
354 * Creates a diff of the changes between the streams @a pLeft and @a pRight.
363 * @param pLeft The left side stream.
373 size_t ScmDiffStreams(const char *pszFilename, PSCMSTREAM pLeft, PSCMSTREA argument
[all...]
/vbox/src/VBox/Runtime/common/asn1/
H A Dasn1-ut-time.cpp76 RTDECL(int) RTAsn1Time_CompareWithTimeSpec(PCRTASN1TIME pLeft, PCRTTIMESPEC pTsRight) argument
78 int iDiff = RTAsn1Time_IsPresent(pLeft) ? 0 : -1;
82 AssertReturn(RTTimeImplode(&TsLeft, &pLeft->Time), -1);
162 RTDECL(int) RTAsn1Time_Compare(PCRTASN1TIME pLeft, PCRTASN1TIME pRight) argument
164 Assert(pLeft && (!RTAsn1Time_IsPresent(pLeft) || pLeft->Asn1Core.pOps == &g_RTAsn1Time_Vtable));
168 if (RTAsn1Time_IsPresent(pLeft))
173 AssertReturn(RTTimeImplode(&TsLeft, &pLeft->Time), -1);
234 RTDECL(int) RT_CONCAT(a_Api,_Compare)(PCRTASN1TIME pLeft, PCRTASN1TIM
[all...]
H A Dasn1-ut-null.cpp110 RTDECL(int) RTAsn1Null_Compare(PCRTASN1NULL pLeft, PCRTASN1NULL pRight) argument
112 Assert(pLeft && (!RTAsn1Null_IsPresent(pLeft) || pLeft->Asn1Core.pOps == &g_RTAsn1Null_Vtable));
115 return (int)RTAsn1Null_IsPresent(pLeft) - (int)RTAsn1Null_IsPresent(pRight);
H A Dasn1-ut-core.cpp148 RTDECL(int) RTAsn1Core_CompareEx(PCRTASN1CORE pLeft, PCRTASN1CORE pRight, bool fIgnoreTagAndClass) argument
151 if (RTASN1CORE_IS_PRESENT(pLeft))
155 iDiff = memcmp(pLeft->uData.pv, pRight->uData.pv, RT_MIN(pLeft->cb, pRight->cb));
158 if (pLeft->cb != pRight->cb)
159 iDiff = pLeft->cb < pRight->cb ? -1 : 1;
162 if (pLeft->uTag != pRight->uTag)
163 iDiff = pLeft->uTag < pRight->uTag ? -1 : 1;
164 else if (pLeft->fClass != pRight->fClass)
165 iDiff = pLeft
252 RTAsn1Core_Compare(PCRTASN1CORE pLeft, PCRTASN1CORE pRight) argument
[all...]
H A Dasn1-ut-dyntype.cpp116 RTDECL(int) RTAsn1DynType_Compare(PCRTASN1DYNTYPE pLeft, PCRTASN1DYNTYPE pRight) argument
118 if (RTAsn1DynType_IsPresent(pLeft) && RTAsn1DynType_IsPresent(pRight))
120 if (pLeft->enmType != pRight->enmType)
121 return pLeft->enmType < pRight->enmType ? -1 : 1;
123 switch (pLeft->enmType)
125 case RTASN1TYPE_CORE: return RTAsn1Core_Compare(&pLeft->u.Core, &pRight->u.Core); break;
126 case RTASN1TYPE_NULL: return RTAsn1Null_Compare(&pLeft->u.Asn1Null, &pRight->u.Asn1Null);
127 case RTASN1TYPE_INTEGER: return RTAsn1Integer_Compare(&pLeft->u.Integer, &pRight->u.Integer);
128 case RTASN1TYPE_BOOLEAN: return RTAsn1Boolean_Compare(&pLeft->u.Boolean, &pRight->u.Boolean);
129 case RTASN1TYPE_STRING: return RTAsn1String_Compare(&pLeft
[all...]
H A Dasn1-ut-boolean.cpp168 RTDECL(int) RTAsn1Boolean_Compare(PCRTASN1BOOLEAN pLeft, PCRTASN1BOOLEAN pRight) argument
170 Assert(pLeft && (!RTAsn1Boolean_IsPresent(pLeft) || pLeft->Asn1Core.pOps == &g_RTAsn1Boolean_Vtable));
174 if (RTAsn1Boolean_IsPresent(pLeft))
177 iDiff = (int)pLeft->fValue - (int)pRight->fValue;
H A Dasn1-ut-bitstring.cpp435 RTDECL(int) RTAsn1BitString_Compare(PCRTASN1BITSTRING pLeft, PCRTASN1BITSTRING pRight) argument
437 Assert(pLeft && (!RTAsn1BitString_IsPresent(pLeft) || pLeft->Asn1Core.pOps == &g_RTAsn1BitString_Vtable));
441 if (RTAsn1BitString_IsPresent(pLeft))
448 if (pLeft->pEncapsulated || pRight->pEncapsulated)
450 if ( pLeft->pEncapsulated
452 && pLeft->pEncapsulated->pOps == pRight->pEncapsulated->pOps)
453 iDiff = pLeft->pEncapsulated->pOps->pfnCompare(pLeft
[all...]
H A Dasn1-ut-octetstring.cpp348 RTDECL(int) RTAsn1OctetString_Compare(PCRTASN1OCTETSTRING pLeft, PCRTASN1OCTETSTRING pRight) argument
350 Assert(pLeft && (!RTAsn1OctetString_IsPresent(pLeft) || pLeft->Asn1Core.pOps == &g_RTAsn1OctetString_Vtable));
354 if (RTAsn1OctetString_IsPresent(pLeft))
361 if (pLeft->pEncapsulated || pRight->pEncapsulated)
363 if ( pLeft->pEncapsulated
365 && pLeft->pEncapsulated->pOps == pRight->pEncapsulated->pOps)
366 iDiff = pLeft->pEncapsulated->pOps->pfnCompare(pLeft
[all...]
H A Dasn1-ut-integer.cpp206 RTDECL(int) RTAsn1Integer_UnsignedCompare(PCRTASN1INTEGER pLeft, PCRTASN1INTEGER pRight) argument
208 Assert(pLeft && (!RTAsn1Integer_IsPresent(pLeft) || pLeft->Asn1Core.pOps == &g_RTAsn1Integer_Vtable));
212 if (RTAsn1Integer_IsPresent(pLeft))
216 if ( pLeft->Asn1Core.cb > 8
219 uint32_t iLeft = RTAsn1Integer_UnsignedLastBit(pLeft);
227 uint8_t const *pbLeft = &pLeft->Asn1Core.uData.pu8[pLeft->Asn1Core.cb - i - 1];
241 if (pLeft
429 RTAsn1Integer_Compare(PCRTASN1INTEGER pLeft, PCRTASN1INTEGER pRight) argument
[all...]
H A Dasn1-ut-objid.cpp505 RTDECL(int) RTAsn1ObjId_Compare(PCRTASN1OBJID pLeft, PCRTASN1OBJID pRight) argument
507 if (RTAsn1ObjId_IsPresent(pLeft))
511 uint8_t cComponents = RT_MIN(pLeft->cComponents, pRight->cComponents);
513 if (pLeft->pauComponents[i] != pRight->pauComponents[i])
514 return pLeft->pauComponents[i] < pRight->pauComponents[i] ? -1 : 1;
516 if (pLeft->cComponents == pRight->cComponents)
518 return pLeft->cComponents < pRight->cComponents ? -1 : 1;
/vbox/include/iprt/
H A Davl.h55 struct _AVLPVNodeCore *pLeft; /** Pointer to left leaf node. */ member in struct:_AVLPVNodeCore
100 struct _AVLULNodeCore *pLeft; /** Pointer to left leaf node. */ member in struct:_AVLULNodeCore
144 struct AVLRPVNodeCore *pLeft; /**< Pointer to left leaf node. */ member in struct:AVLRPVNodeCore
188 struct _AVLU32NodeCore *pLeft; /**< Pointer to left leaf node. */ member in struct:_AVLU32NodeCore
233 AVLOU32 pLeft; member in struct:_AVLOU32NodeCore
278 struct _AVLLU32NodeCore *pLeft; /**< Pointer to left leaf node. */ member in struct:_AVLLU32NodeCore
322 struct AVLRU64NodeCore *pLeft; /**< Pointer to left leaf node. */ member in struct:AVLRU64NodeCore
372 AVLOGCPHYS pLeft; member in struct:_AVLOGCPhysNodeCore
426 AVLROGCPHYS pLeft; member in struct:_AVLROGCPhysNodeCore
477 struct _AVLGCPtrNodeCore *pLeft; member in struct:_AVLGCPtrNodeCore
523 AVLOGCPTR pLeft; member in struct:_AVLOGCPtrNodeCore
571 struct _AVLRGCPtrNodeCore *pLeft; member in struct:_AVLRGCPtrNodeCore
627 AVLROGCPTR pLeft; member in struct:_AVLROGCPtrNodeCore
684 AVLROOGCPTR pLeft; member in struct:_AVLROOGCPtrNodeCore
736 struct _AVLUIntPtrNodeCore *pLeft; member in struct:_AVLUIntPtrNodeCore
787 struct _AVLRUIntPtrNodeCore *pLeft; member in struct:_AVLRUIntPtrNodeCore
843 AVLOHCPHYS pLeft; member in struct:_AVLOHCPhysNodeCore
895 AVLOIOPORTPTR pLeft; member in struct:_AVLOIOPortNodeCore
949 AVLROIOPORTPTR pLeft; member in struct:_AVLROIOPortNodeCore
997 AVLHCPHYSPTR pLeft; member in struct:_AVLHCPhysNodeCore
1046 AVLGCPHYSPTR pLeft; member in struct:_AVLGCPhysNodeCore
1095 struct _AVLRFOFFNodeCore *pLeft; member in struct:_AVLRFOFFNodeCore
[all...]
H A Dbignum.h151 * @retval -1 if pLeft < pRight.
152 * @retval 0 if pLeft == pRight.
153 * @retval 1 if pLeft > pRight.
155 * @param pLeft The left side number.
158 RTDECL(int) RTBigNumCompare(PRTBIGNUM pLeft, PRTBIGNUM pRight);
159 RTDECL(int) RTBigNumCompareWithU64(PRTBIGNUM pLeft, uint64_t uRight);
160 RTDECL(int) RTBigNumCompareWithS64(PRTBIGNUM pLeft, int64_t iRight);
/vbox/src/VBox/Runtime/common/alloc/
H A Dheapoffset.cpp695 PRTHEAPOFFSETFREE pLeft; local
706 pLeft = NULL;
717 pLeft = RTHEAPOFF_TO_PTR_N(pHeapInt, pHeapInt->offFreeTail, PRTHEAPOFFSETFREE);
721 pLeft = RTHEAPOFF_TO_PTR_N(pHeapInt, pRight->offPrev, PRTHEAPOFFSETFREE);
723 if (pLeft)
724 ASSERT_BLOCK_FREE(pHeapInt, pLeft);
726 AssertMsgReturnVoid(pLeft != pFree, ("Freed twice! pv=%p (pBlock=%p)\n", pBlock + 1, pBlock));
727 ASSERT_L(RTHEAPOFF_TO_OFF(pHeapInt, pLeft), RTHEAPOFF_TO_OFF(pHeapInt, pFree));
729 Assert(!pLeft || RTHEAPOFF_TO_PTR_N(pHeapInt, pLeft
[all...]
H A Dheapsimple.cpp687 PRTHEAPSIMPLEFREE pLeft; local
698 pLeft = NULL;
709 pLeft = pHeapInt->pFreeTail;
713 pLeft = pRight->pPrev;
715 if (pLeft)
716 ASSERT_BLOCK_FREE(pHeapInt, pLeft);
718 AssertMsgReturnVoid(pLeft != pFree, ("Freed twice! pv=%p (pBlock=%p)\n", pBlock + 1, pBlock));
719 ASSERT_L(pLeft, pFree);
721 Assert(!pLeft || pLeft
[all...]
/vbox/src/VBox/VMM/VMMAll/
H A DMMAllHyper.cpp966 PMMHYPERCHUNKFREE pLeft = NULL; local
986 pRight = (PMMHYPERCHUNKFREE)((char *)pHeap->CTX_SUFF(pbHeap) + pHeap->offFreeTail); /** @todo this can't be correct! 'pLeft = .. ; else' I think */
992 pLeft = (PMMHYPERCHUNKFREE)((char *)pRight + pRight->offPrev);
993 ASSERT_CHUNK_FREE(pHeap, pLeft);
997 if (pLeft == pFree)
1007 if (!pLeft)
1029 if ((char *)pLeft + pLeft->core.offNext == (char *)pFree)
1033 pLeft->core.offNext = pLeft
[all...]
/vbox/src/VBox/Runtime/common/math/
H A Dbignum.cpp1010 RTDECL(int) RTBigNumCompare(PRTBIGNUM pLeft, PRTBIGNUM pRight)
1012 int rc = rtBigNumUnscramble(pLeft);
1015 RTBIGNUM_ASSERT_VALID(pLeft);
1020 if (pLeft->fNegative == pRight->fNegative)
1022 if (pLeft->cUsed == pRight->cUsed)
1025 uint32_t i = pLeft->cUsed;
1027 if (pLeft->pauElements[i] != pRight->pauElements[i])
1029 rc = pLeft->pauElements[i] < pRight->pauElements[i] ? -1 : 1;
1032 if (pLeft->fNegative)
1036 rc = !pLeft
[all...]

Completed in 417 milliseconds

12