Searched refs:Pivot (Results 1 - 4 of 4) sorted by relevance
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/ |
H A D | StringTableBuilder.cpp | 97 int Pivot = charTailAt(Vec[0], Pos); local 102 if (C > Pivot) 104 else if (C < Pivot) 115 if (Pivot != -1) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Parallel.h | 104 auto Pivot = medianOf3(Start, End, Comp); local 105 // Move Pivot to End. 106 std::swap(*(End - 1), *Pivot); 107 Pivot = std::partition(Start, End - 1, [&Comp, End](decltype(*Start) V) { 110 // Move Pivot to middle of partition. 111 std::swap(*Pivot, *(End - 1)); 115 parallel_quick_sort(Start, Pivot, Comp, TG, Depth - 1); 117 parallel_quick_sort(Pivot + 1, End, Comp, TG, Depth - 1);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 278 CaseRange &Pivot = *(Begin + Mid); local 279 LLVM_DEBUG(dbgs() << "Pivot ==> [" << Pivot.Low->getValue() << ", " 280 << Pivot.High->getValue() << "]\n"); 286 ConstantInt *NewLowerBound = Pivot.Low; 313 Val, Pivot.Low, "Pivot");
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGBuilder.cpp | 10432 const ConstantInt *Pivot = PivotCluster->Low; 10438 // We will branch to the LHS if Value < Pivot. If LHS is a single cluster, 10440 // between the known lower bound and Pivot - 1. 10444 (FirstLeft->High->getValue() + 1LL) == Pivot->getValue()) { 10450 {LeftMBB, FirstLeft, LastLeft, W.GE, Pivot, W.DefaultProb / 2}); 10455 // Similarly, we will branch to the RHS if Value >= Pivot. If RHS is a 10456 // single cluster, RHS.Low == Pivot, and we can branch to its destination 10466 {RightMBB, FirstRight, LastRight, Pivot, W.LT, W.DefaultProb / 2}); 10472 CaseBlock CB(ISD::SETLT, Cond, Pivot, nullptr, LeftMBB, RightMBB, W.MBB, 10403 assert(NumRight < NumLeft); CaseCluster &CC = *LastLeft; unsigned LeftSideRank = caseClusterRank(CC, W.FirstCluster, LastLeft); unsigned RightSideRank = caseClusterRank(CC, FirstRight, W.LastCluster); if (RightSideRank <= LeftSideRank) { --LastLeft; --FirstRight; continue; } } } break; } assert(LastLeft + 1 == FirstRight); assert(LastLeft >= W.FirstCluster); assert(FirstRight <= W.LastCluster); CaseClusterIt PivotCluster = FirstRight; assert(PivotCluster > W.FirstCluster); assert(PivotCluster <= W.LastCluster); CaseClusterIt FirstLeft = W.FirstCluster; CaseClusterIt LastRight = W.LastCluster; const ConstantInt *Pivot = PivotCluster->Low; MachineFunction::iterator BBI(W.MBB); ++BBI; MachineBasicBlock *LeftMBB; if (FirstLeft == LastLeft && FirstLeft->Kind == CC_Range && FirstLeft->Low == W.GE && (FirstLeft->High->getValue() + 1LL) == Pivot->getValue()) argument
|
Completed in 199 milliseconds