Searched refs:Pivot (Results 1 – 4 of 4) sorted by relevance
/device/linaro/bootloader/edk2/MdeModulePkg/Library/BaseSortLib/ |
D | BaseSortLib.c | 54 VOID *Pivot; in QuickSortWorker() local 73 Pivot = ((UINT8*)BufferToSort+((Count-1)*ElementSize)); in QuickSortWorker() 86 if (CompareFunction((VOID*)((UINT8*)BufferToSort+((LoopCount)*ElementSize)),Pivot) <= 0){ in QuickSortWorker() 103 CopyMem (Buffer, Pivot, ElementSize); in QuickSortWorker() 104 CopyMem (Pivot, (UINT8*)BufferToSort+(NextSwapLocation*ElementSize), ElementSize); in QuickSortWorker()
|
/device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
D | BaseOrderedCollectionRedBlackTreeLib.c | 428 IN OUT RED_BLACK_TREE_NODE *Pivot, in RedBlackTreeRotateRight() argument 436 Parent = Pivot->Parent; in RedBlackTreeRotateRight() 437 LeftChild = Pivot->Left; in RedBlackTreeRotateRight() 440 Pivot->Left = LeftRightChild; in RedBlackTreeRotateRight() 442 LeftRightChild->Parent = Pivot; in RedBlackTreeRotateRight() 448 if (Pivot == Parent->Left) { in RedBlackTreeRotateRight() 454 LeftChild->Right = Pivot; in RedBlackTreeRotateRight() 455 Pivot->Parent = LeftChild; in RedBlackTreeRotateRight() 493 IN OUT RED_BLACK_TREE_NODE *Pivot, in RedBlackTreeRotateLeft() argument 501 Parent = Pivot->Parent; in RedBlackTreeRotateLeft() [all …]
|
/device/linaro/bootloader/edk2/MdeModulePkg/Library/UefiSortLib/ |
D | UefiSortLib.c | 70 VOID *Pivot; in QuickSortWorker() local 89 Pivot = ((UINT8*)BufferToSort+((Count-1)*ElementSize)); in QuickSortWorker() 102 if (CompareFunction((VOID*)((UINT8*)BufferToSort+((LoopCount)*ElementSize)),Pivot) <= 0){ in QuickSortWorker() 119 CopyMem (Buffer, Pivot, ElementSize); in QuickSortWorker() 120 CopyMem (Pivot, (UINT8*)BufferToSort+(NextSwapLocation*ElementSize), ElementSize); in QuickSortWorker()
|
/device/linaro/bootloader/edk2/CryptoPkg/Library/BaseCryptLib/SysCall/ |
D | CrtWrapper.c | 44 VOID *Pivot; in QuickSortWorker() local 61 Pivot = ((UINT8 *)BufferToSort + ((Count - 1) * ElementSize)); in QuickSortWorker() 72 … if (CompareFunction ((VOID *)((UINT8 *)BufferToSort + ((LoopCount) * ElementSize)), Pivot) <= 0) { in QuickSortWorker() 89 CopyMem (Buffer, Pivot, ElementSize); in QuickSortWorker() 90 CopyMem (Pivot, (UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), ElementSize); in QuickSortWorker()
|