Home
last modified time | relevance | path

Searched refs:Lower (Results 1 – 25 of 487) sorted by relevance

12345678910>>...20

/external/swiftshader/third_party/LLVM/lib/Support/
DConstantRange.cpp34 Lower = Upper = APInt::getMaxValue(BitWidth); in ConstantRange()
36 Lower = Upper = APInt::getMinValue(BitWidth); in ConstantRange()
41 ConstantRange::ConstantRange(const APInt &V) : Lower(V), Upper(V + 1) {} in ConstantRange()
44 Lower(L), Upper(U) { in ConstantRange()
119 return Lower == Upper && Lower.isMaxValue(); in isFullSet()
125 return Lower == Upper && Lower.isMinValue(); in isEmptySet()
132 return Lower.ugt(Upper); in isWrappedSet()
149 if (Lower != Upper) // One of T or F in the set... in getSetSize()
155 return Upper - Lower; in getSetSize()
221 if (Lower == Upper) in contains()
[all …]
/external/llvm/lib/IR/
DConstantRange.cpp36 Lower = Upper = APInt::getMaxValue(BitWidth); in ConstantRange()
38 Lower = Upper = APInt::getMinValue(BitWidth); in ConstantRange()
44 : Lower(std::move(V)), Upper(Lower + 1) {} in ConstantRange()
47 : Lower(std::move(L)), Upper(std::move(U)) { in ConstantRange()
48 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
50 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
230 return Lower == Upper && Lower.isMaxValue(); in isFullSet()
236 return Lower == Upper && Lower.isMinValue(); in isEmptySet()
243 return Lower.ugt(Upper); in isWrappedSet()
264 return (Upper - Lower).zext(getBitWidth()+1); in getSetSize()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/
DConstantRange.cpp43 : Lower(Full ? APInt::getMaxValue(BitWidth) : APInt::getMinValue(BitWidth)), in ConstantRange()
44 Upper(Lower) {} in ConstantRange()
47 : Lower(std::move(V)), Upper(Lower + 1) {} in ConstantRange()
50 : Lower(std::move(L)), Upper(std::move(U)) { in ConstantRange()
51 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
53 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
286 APInt Lower, Upper; in makeGuaranteedNoWrapRegion() local
288 Lower = APIntOps::RoundingSDiv(MaxValue, V, APInt::Rounding::UP); in makeGuaranteedNoWrapRegion()
291 Lower = APIntOps::RoundingUDiv(MinValue, V, APInt::Rounding::UP); in makeGuaranteedNoWrapRegion()
294 Lower = APIntOps::RoundingSDiv(MinValue, V, APInt::Rounding::UP); in makeGuaranteedNoWrapRegion()
[all …]
/external/clang/unittests/Basic/
DVirtualFileSystemTest.cpp236 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); in TEST() local
239 new vfs::OverlayFileSystem(Lower)); in TEST()
242 Lower->addDirectory("/lower-only"); in TEST()
246 ErrorOr<vfs::Status> Status1 = Lower->status("/lower-only"); in TEST()
261 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); in TEST() local
264 new vfs::OverlayFileSystem(Lower)); in TEST()
268 Lower->addDirectory("/both", sys::fs::owner_read); in TEST()
275 Lower->addRegularFile("/both/foo", sys::fs::owner_read); in TEST()
395 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); in TEST() local
398 new vfs::OverlayFileSystem(Lower)); in TEST()
[all …]
/external/icu/icu4c/source/test/testdata/
DSentenceBreakTest.txt35 ÷ 0001 × 0061 ÷ # ÷ [0.2] <START OF HEADING> (Other) × [998.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
36 …ING> (Other) × [5.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
65 ÷ 000D ÷ 0061 ÷ # ÷ [0.2] <CARRIAGE RETURN (CR)> (CR) ÷ [4.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
66 …N (CR)> (CR) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
95 ÷ 000A ÷ 0061 ÷ # ÷ [0.2] <LINE FEED (LF)> (LF) ÷ [4.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
96 …D (LF)> (LF) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
125 ÷ 0085 ÷ 0061 ÷ # ÷ [0.2] <NEXT LINE (NEL)> (Sep) ÷ [4.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
126 …(NEL)> (Sep) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
155 ÷ 0009 × 0061 ÷ # ÷ [0.2] <CHARACTER TABULATION> (Sp) × [998.0] LATIN SMALL LETTER A (Lower) ÷ [0.…
156 …LATION> (Sp) × [5.0] COMBINING DIAERESIS (Extend_FE) × [998.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
[all …]
/external/eigen/blas/
DRank2Update.h26 …Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) += in run()
27 …numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i … in run()
28 … + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)); in run()
45 Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) += in run()
46 …numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i … in run()
47 … + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)); in run()
49 mat[offset+(UpLo==Lower ? 0 : i)] = numext::real(mat[offset+(UpLo==Lower ? 0 : i)]); in run()
50 offset += UpLo==Lower ? size-i : (i+1); in run()
DPackedSelfadjointProduct.h33 …ynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(U…
35 mat[UpLo==Lower ? 0 : i] = numext::real(mat[UpLo==Lower ? 0 : i]);
36 mat += UpLo==Lower ? size-i : (i+1);
47 …selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::ru…
Dlevel2_impl.h93 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,RowMajor>::ru… in EIGEN_BLAS_FUNC()
95 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, Conj, RowMajor>::ru… in EIGEN_BLAS_FUNC()
98 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,ColMajor>::ru… in EIGEN_BLAS_FUNC()
107 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,RowMajor>::ru… in EIGEN_BLAS_FUNC()
109 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,Conj, RowMajor>::ru… in EIGEN_BLAS_FUNC()
112 …(internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,ColMajor>::ru… in EIGEN_BLAS_FUNC()
152 …(internal::triangular_matrix_vector_product<int,Lower|0, Scalar,false,Scalar,false,RowMajor>… in EIGEN_BLAS_FUNC()
154 …(internal::triangular_matrix_vector_product<int,Lower|0, Scalar,Conj, Scalar,false,RowMajor>… in EIGEN_BLAS_FUNC()
157 …(internal::triangular_matrix_vector_product<int,Lower|0, Scalar,false,Scalar,false,ColMajor>… in EIGEN_BLAS_FUNC()
166 …(internal::triangular_matrix_vector_product<int,Lower|UnitDiag,Scalar,false,Scalar,false,RowMajor>… in EIGEN_BLAS_FUNC()
[all …]
Dlevel3_impl.h87 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,RowMajor,C… in EIGEN_BLAS_FUNC()
89 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, Conj, RowMajor,C… in EIGEN_BLAS_FUNC()
94 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,RowMajor,C… in EIGEN_BLAS_FUNC()
96 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, Conj, RowMajor,C… in EIGEN_BLAS_FUNC()
99 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,ColMajor,C… in EIGEN_BLAS_FUNC()
106 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,ColMajor,C… in EIGEN_BLAS_FUNC()
115 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,false,RowMajor,ColM… in EIGEN_BLAS_FUNC()
117 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,Conj, RowMajor,ColM… in EIGEN_BLAS_FUNC()
122 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,false,RowMajor,ColM… in EIGEN_BLAS_FUNC()
124 …(internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,Conj, RowMajor,ColM… in EIGEN_BLAS_FUNC()
[all …]
/external/eigen/test/
Dproduct_mmtr.cpp48 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint()); in mmtr()
50 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint()); in mmtr()
53 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint()); in mmtr()
55 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint()); in mmtr()
58 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint()); in mmtr()
60 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint()); in mmtr()
63 CHECK_MMTR(matc, Lower, -= s*sqr*sqc.template triangularView<Upper>()); in mmtr()
65 CHECK_MMTR(matc, Lower, += s*sqr*sqc.template triangularView<Lower>()); in mmtr()
66 CHECK_MMTR(matc, Upper, = s*sqc*sqc.template triangularView<Lower>()); in mmtr()
68 CHECK_MMTR(matc, Lower, = (s*sqr).template triangularView<Upper>()*sqc); in mmtr()
[all …]
Dsparse_permutations.cpp65 lo = mat.template triangularView<Lower>(); in sparse_permutations()
68 lo_sym_d = mat_d.template selfadjointView<Lower>(); in sparse_permutations()
72 VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView<Lower>())); in sparse_permutations()
115 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>().twistedBy(p_null) )); in sparse_permutations()
124 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>().twistedBy(p_null) )); in sparse_permutations()
133 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>() )); in sparse_permutations()
141 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>() )); in sparse_permutations()
150 res.template selfadjointView<Lower>() = mat.template selfadjointView<Upper>(); in sparse_permutations()
151 res_d = up_sym_d.template triangularView<Lower>(); in sparse_permutations()
154 res.template selfadjointView<Upper>() = mat.template selfadjointView<Lower>(); in sparse_permutations()
[all …]
Dproduct_syrk.cpp38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
39 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
41 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
42 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk()
55 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
57 …VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpres… in syrk()
58 … (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
69 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(), in syrk()
70 … (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
[all …]
Dproduct_symm.cpp36 m2 = m1.template triangularView<Lower>(); in symm()
37 m3 = m2.template selfadjointView<Lower>(); in symm()
39 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm()
45 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().transpose() * (s2*rhs1), in symm()
48 VERIFY_IS_APPROX(rhs12 = (s1*m2).conjugate().template selfadjointView<Lower>() * (s2*rhs1), in symm()
51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().conjugate() * (s2*rhs1), in symm()
57 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().adjoint() * (s2*rhs1), in symm()
66 m2 = m1.template triangularView<Lower>(); in symm()
67 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
75 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
[all …]
Dtriangular.cpp56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); in triangular_square()
60 m1.template triangularView<Lower>() = m2.transpose() + m2; in triangular_square()
61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); in triangular_square()
63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(), in triangular_square()
64 m3.conjugate().template triangularView<Lower>().toDenseMatrix()); in triangular_square()
73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
74 m3 = m1.template triangularView<Lower>(); in triangular_square()
78 m3 = m1.template triangularView<Lower>(); in triangular_square()
79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
[all …]
Dproduct_trmv.cpp33 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); in trmv()
43 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
44 …ugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps… in trmv()
50 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1,… in trmv()
51 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
60 …VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView<Eigen::Lower>() * v1, lar… in trmv()
61 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
66 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
67 …VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(),… in trmv()
[all …]
Dincomplete_cholesky.cpp18 …ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > … in test_incomplete_cholesky_T()
19 …ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, NaturalOrdering<I> > > … in test_incomplete_cholesky_T()
22 …ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > … in test_incomplete_cholesky_T()
59 Eigen::Lower | Eigen::Upper, in test_incomplete_cholesky()
Deigensolver_selfadjoint.cpp35 VERIFY_IS_APPROX((m.template selfadjointView<Lower>() * eiSymm.eigenvectors())/scaling, in selfadjointeigensolver_essential_check()
38 VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues()); in selfadjointeigensolver_essential_check()
60 VERIFY_IS_APPROX((m.template selfadjointView<Lower>() * eiDirect.eigenvectors())/scaling, in selfadjointeigensolver_essential_check()
62 …VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues()/scaling, eiDirect.eigenvalues()… in selfadjointeigensolver_essential_check()
111 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox( in selfadjointeigensolver()
112 …symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDi… in selfadjointeigensolver()
117 …VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSym… in selfadjointeigensolver()
123 …VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSym… in selfadjointeigensolver()
129 VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), sqrtSymmA*sqrtSymmA); in selfadjointeigensolver()
130 VERIFY_IS_APPROX(sqrtSymmA, symmC.template selfadjointView<Lower>()*eiSymm.operatorInverseSqrt()); in selfadjointeigensolver()
[all …]
Dcholesky.cpp32 MatrixType symmLo = symm.template triangularView<Lower>(); in test_chol_update()
36 CholType<MatrixType,Lower> chollo(symmLo); in test_chol_update()
46 CholType<MatrixType,Lower> chol(symmCpy); in test_chol_update()
85 SquareMatrixType symmLo = symm.template triangularView<Lower>(); in cholesky()
87 LLT<SquareMatrixType,Lower> chollo(symmLo); in cholesky()
95 RealScalar rcond = (RealScalar(1) / matrix_l1_norm<MatrixType, Lower>(symmLo)) / in cholesky()
96 matrix_l1_norm<MatrixType, Lower>(symmLo_inverse); in cholesky()
131 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
132 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
134 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
[all …]
Dcholmod_support.cpp17 …CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(… in test_cholmod_T()
19 …CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(C… in test_cholmod_T()
21 …CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(… in test_cholmod_T()
24 CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower; in test_cholmod_T()
26 CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower; in test_cholmod_T()
28 CholmodSimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower; in test_cholmod_T()
/external/clang/lib/StaticAnalyzer/Core/
DRangeConstraintManager.cpp115 const llvm::APSInt &Lower, in IntersectInRange() argument
129 if (i->To() < Lower) { in IntersectInRange()
136 if (i->Includes(Lower)) { in IntersectInRange()
138 newRanges = F.add(newRanges, Range(BV.getValue(Lower), in IntersectInRange()
142 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To())); in IntersectInRange()
158 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const { in pin() argument
165 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower, true); in pin()
174 if (Lower <= Upper) in pin()
178 Lower = Type.getMinValue(); in pin()
183 Lower = Type.getMinValue(); in pin()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/Support/
DConstantRange.h43 APInt Lower, Upper; variable
57 ConstantRange(const APInt &Lower, const APInt &Upper);
71 const APInt &getLower() const { return Lower; } in getLower()
79 uint32_t getBitWidth() const { return Lower.getBitWidth(); } in getBitWidth()
112 if (Upper == Lower + 1) in getSingleElement()
113 return &Lower; in getSingleElement()
148 return Lower == CR.Lower && Upper == CR.Upper;
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DConstantRange.h48 APInt Lower, Upper; variable
60 ConstantRange(APInt Lower, APInt Upper);
126 const APInt &getLower() const { return Lower; } in getLower()
132 uint32_t getBitWidth() const { return Lower.getBitWidth(); } in getBitWidth()
157 if (Upper == Lower + 1) in getSingleElement()
158 return &Lower; in getSingleElement()
165 if (Lower == Upper + 1) in getSingleMissingElement()
196 return Lower == CR.Lower && Upper == CR.Upper;
/external/llvm/include/llvm/IR/
DConstantRange.h44 APInt Lower, Upper; variable
61 ConstantRange(APIntMoveTy Lower, APIntMoveTy Upper);
124 const APInt &getLower() const { return Lower; } in getLower()
132 uint32_t getBitWidth() const { return Lower.getBitWidth(); } in getBitWidth()
164 if (Upper == Lower + 1) in getSingleElement()
165 return &Lower; in getSingleElement()
196 return Lower == CR.Lower && Upper == CR.Upper;
/external/llvm/include/llvm/Support/
DUnicodeCharRanges.h28 uint32_t Lower; member
33 return Value < Range.Lower;
79 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
83 DEBUG(dbgs().write_hex(I->Lower) << "\n"); in rangesAreValid()
86 if (I->Upper < I->Lower) { in rangesAreValid()
88 DEBUG(dbgs().write_hex(I->Lower)); in rangesAreValid()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/
DUnicodeCharRanges.h28 uint32_t Lower; member
33 return Value < Range.Lower;
79 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
83 LLVM_DEBUG(dbgs().write_hex(I->Lower) << "\n"); in rangesAreValid()
86 if (I->Upper < I->Lower) { in rangesAreValid()
88 LLVM_DEBUG(dbgs().write_hex(I->Lower)); in rangesAreValid()

12345678910>>...20