Lines Matching refs:Pivot
2167 CaseItr Pivot = CR.Range.first + Size/2;
2169 // Select optimal pivot, maximizing sum density of LHS and RHS. This will
2178 DEBUG(dbgs() << "Selecting best pivot: \n"
2204 Pivot = J;
2216 Pivot = CR.Range.first + Size/2;
2219 CaseRange LHSR(CR.Range.first, Pivot);
2220 CaseRange RHSR(Pivot, CR.Range.second);
2221 const Constant *C = Pivot->Low;
2225 // less than the Pivot value, C. We use this to optimize our binary
2228 // Pivot's Value, then we can branch directly to the LHS's Target,
2539 // Emit binary tree. We need to pick a pivot, and push left and right ranges
