HomeSort by: relevance | last modified time | path
    Searched defs:Pivot (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/MC/
StringTableBuilder.cpp 99 // Partition items so that items in [0, I) are greater than the pivot,
100 // [I, J) are the same as the pivot, and [J, Vec.size()) are less than
101 // the pivot.
102 int Pivot = charTailAt(Vec[0], Pos);
107 if (C > Pivot)
109 else if (C < Pivot)
120 if (Pivot != -1) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Parallel.h 100 auto Pivot = medianOf3(Start, End, Comp);
101 // Move Pivot to End.
102 std::swap(*(End - 1), *Pivot);
103 Pivot = std::partition(Start, End - 1, [&Comp, End](decltype(*Start) V) {
106 // Move Pivot to middle of partition.
107 std::swap(*Pivot, *(End - 1));
111 parallel_quick_sort(Start, Pivot, Comp, TG, Depth - 1);
113 parallel_quick_sort(Pivot + 1, End, Comp, TG, Depth - 1);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 250 CaseRange &Pivot = *(Begin + Mid);
251 LLVM_DEBUG(dbgs() << "Pivot ==> [" << Pivot.Low->getValue() << ", "
252 << Pivot.High->getValue() << "]\n");
258 ConstantInt *NewLowerBound = Pivot.Low;
279 // Create a new node that checks if the value is < pivot. Go to the
285 Val, Pivot.Low, "Pivot");

Completed in 29 milliseconds