HomeSort by relevance Sort by last modified time
    Searched defs:Pivot (Results 1 - 8 of 8) sorted by null

  /device/linaro/bootloader/edk2/MdeModulePkg/Library/BaseSortLib/
BaseSortLib.c 54 VOID *Pivot;
71 // pick a pivot (we choose last element)
73 Pivot = ((UINT8*)BufferToSort+((Count-1)*ElementSize));
76 // Now get the pivot such that all on "left" are below it
84 // if the element is less than the pivot
86 if (CompareFunction((VOID*)((UINT8*)BufferToSort+((LoopCount)*ElementSize)),Pivot) <= 0){
101 // swap pivot to it's final position (NextSwapLocaiton)
103 CopyMem (Buffer, Pivot, ElementSize);
104 CopyMem (Pivot, (UINT8*)BufferToSort+(NextSwapLocation*ElementSize), ElementSize);
108 // Now recurse on 2 paritial lists. neither of these will have the 'pivot' element
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Library/UefiSortLib/
UefiSortLib.c 70 VOID *Pivot;
87 // pick a pivot (we choose last element)
89 Pivot = ((UINT8*)BufferToSort+((Count-1)*ElementSize));
92 // Now get the pivot such that all on "left" are below it
100 // if the element is less than the pivot
102 if (CompareFunction((VOID*)((UINT8*)BufferToSort+((LoopCount)*ElementSize)),Pivot) <= 0){
117 // swap pivot to it's final position (NextSwapLocaiton)
119 CopyMem (Buffer, Pivot, ElementSize);
120 CopyMem (Pivot, (UINT8*)BufferToSort+(NextSwapLocation*ElementSize), ElementSize);
124 // Now recurse on 2 paritial lists. neither of these will have the 'pivot' element
    [all...]
  /external/llvm/lib/MC/
StringTableBuilder.cpp 54 // Partition items. Items in [Begin, P) are greater than the pivot,
55 // [P, Q) are the same as the pivot, and [Q, End) are less than the pivot.
56 int Pivot = charTailAt(*Begin, Pos);
61 if (C > Pivot)
63 else if (C < Pivot)
71 if (Pivot != -1) {
  /device/linaro/bootloader/edk2/CryptoPkg/Library/BaseCryptLib/SysCall/
CrtWrapper.c 44 VOID *Pivot;
59 // Pick a pivot (we choose last element)
61 Pivot = ((UINT8 *)BufferToSort + ((Count - 1) * ElementSize));
64 // Now get the pivot such that all on "left" are below it
70 // If the element is less than the pivot
72 if (CompareFunction ((VOID *)((UINT8 *)BufferToSort + ((LoopCount) * ElementSize)), Pivot) <= 0) {
87 // Swap pivot to it's final position (NextSwapLocaiton)
89 CopyMem (Buffer, Pivot, ElementSize);
90 CopyMem (Pivot, (UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), ElementSize);
94 // Now recurse on 2 paritial lists. Neither of these will have the 'pivot' element.
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
LowerSwitch.cpp 145 CaseRange& Pivot = *(Begin + Mid);
146 DEBUG(dbgs() << "Pivot ==> "
147 << cast<ConstantInt>(Pivot.Low)->getValue() << " -"
148 << cast<ConstantInt>(Pivot.High)->getValue() << "\n");
155 // Create a new node that checks if the value is < pivot. Go to the
163 Val, Pivot.Low, "Pivot");
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 229 CaseRange &Pivot = *(Begin + Mid);
230 DEBUG(dbgs() << "Pivot ==> "
231 << Pivot.Low->getValue()
232 << " -" << Pivot.High->getValue() << "\n");
238 ConstantInt *NewLowerBound = Pivot.Low;
269 // Create a new node that checks if the value is < pivot. Go to the
275 Val, Pivot.Low, "Pivot");
  /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp     [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/
ntddk.h     [all...]

Completed in 1165 milliseconds