/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) {
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/MC/ |
StringTableBuilder.cpp | 91 // Partition items so that items in [0, I) are greater than the pivot, 92 // [I, J) are the same as the pivot, and [J, Vec.size()) are less than 93 // the pivot. 94 int Pivot = charTailAt(Vec[0], Pos); 99 if (C > Pivot) 101 else if (C < Pivot) 112 if (Pivot != -1) {
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
Parallel.h | 126 auto Pivot = medianOf3(Start, End, Comp); 127 // Move Pivot to End. 128 std::swap(*(End - 1), *Pivot); 129 Pivot = std::partition(Start, End - 1, [&Comp, End](decltype(*Start) V) { 132 // Move Pivot to middle of partition. 133 std::swap(*Pivot, *(End - 1)); 137 parallel_quick_sort(Start, Pivot, Comp, TG, Depth - 1); 139 parallel_quick_sort(Pivot + 1, End, Comp, TG, Depth - 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/lmfit/lib/ |
lmmin.c | 30 void lm_lmpar(const int n, double* r, const int ldr, const int* Pivot, 33 void lm_qrfac(const int m, const int n, double* A, int* Pivot, double* Rdiag, 35 void lm_qrsolv(const int n, double* r, const int ldr, const int* Pivot, 221 int* Pivot = (int*)pws; 293 * Jacobian. Column j of P is column Pivot(j) of the identity matrix. 297 * Pivot is an integer array of length n. It defines a permutation 301 * is column Pivot(j) of the identity matrix. 304 lm_qrfac(m, n, fjac, Pivot, wa1, wa2, wa3); 305 /* return values are Pivot, wa1=rdiag, wa2=acnorm */ 328 if (wa2[Pivot[j]] == 0 [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 249 CaseRange &Pivot = *(Begin + Mid); 250 LLVM_DEBUG(dbgs() << "Pivot ==> " << Pivot.Low->getValue() << " -" 251 << Pivot.High->getValue() << "\n"); 257 ConstantInt *NewLowerBound = Pivot.Low; 282 // Create a new node that checks if the value is < pivot. Go to the 288 Val, Pivot.Low, "Pivot");
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
SelectionDAGBuilder.cpp | [all...] |