Searched defs:Pivot (Results 1 - 5 of 5) sorted by relevance
/external/llvm/lib/MC/ |
H A D | StringTableBuilder.cpp | 56 int Pivot = charTailAt(*Begin, Pos); local 61 if (C > Pivot) 63 else if (C < Pivot) 71 if (Pivot != -1) {
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 145 CaseRange& Pivot = *(Begin + Mid); local 146 DEBUG(dbgs() << "Pivot ==> " 147 << cast<ConstantInt>(Pivot.Low)->getValue() << " -" 148 << cast<ConstantInt>(Pivot.High)->getValue() << "\n"); 163 Val, Pivot.Low, "Pivot");
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 229 CaseRange &Pivot = *(Begin + Mid); local 230 DEBUG(dbgs() << "Pivot ==> " 231 << Pivot.Low->getValue() 232 << " -" << Pivot.High->getValue() << "\n"); 238 ConstantInt *NewLowerBound = Pivot.Low; 275 Val, Pivot.Low, "Pivot");
|
/external/lmfit/lib/ |
H A D | 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; local 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[ 553 lm_lmpar(const int n, double* r, const int ldr, const int* Pivot, const double* diag, const double* qtb, const double delta, double* par, double* x, double* Sdiag, double* aux, double* xdi) argument 766 lm_qrfac(const int m, const int n, double* A, int* Pivot, double* Rdiag, double* Acnorm, double* W) argument 900 lm_qrsolv(const int n, double* r, const int ldr, const int* Pivot, const double* diag, const double* qtb, double* x, double* Sdiag, double* W) argument [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGBuilder.cpp | 2139 CaseItr Pivot = CR.Range.first + Size/2; local 2176 Pivot = J; 2188 Pivot = CR.Range.first + Size/2; 2191 CaseRange LHSR(CR.Range.first, Pivot); 2192 CaseRange RHSR(Pivot, CR.Range.second); 2193 Constant *C = Pivot->Low; 2197 // less than the Pivot value, C. We use this to optimize our binary 2200 // Pivot's Value, then we can branch directly to the LHS's Target,
|
Completed in 185 milliseconds