| /external/llvm/lib/IR/ |
| D | ConstantRange.cpp | 34 Lower = Upper = APInt::getMaxValue(BitWidth); in ConstantRange()
36 Lower = Upper = APInt::getMinValue(BitWidth); in ConstantRange()
42 : Lower(std::move(V)), Upper(Lower + 1) {} in ConstantRange()
45 : Lower(std::move(L)), Upper(std::move(U)) { in ConstantRange()
46 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
48 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
131 return Lower == Upper && Lower.isMaxValue(); in isFullSet()
137 return Lower == Upper && Lower.isMinValue(); in isEmptySet()
144 return Lower.ugt(Upper); in isWrappedSet()
165 return (Upper - Lower).zext(getBitWidth()+1); in getSetSize()
[all …]
|
| /external/eigen/test/ |
| D | sparse_permutations.cpp | 32 up = mat.template triangularView<Upper>(); in sparse_permutations()
35 up_sym_d = mat_d.template selfadjointView<Upper>(); in sparse_permutations()
39 VERIFY_IS_APPROX(up, DenseMatrix(mat_d.template triangularView<Upper>())); in sparse_permutations()
68 res = mat.template selfadjointView<Upper>().twistedBy(p_null); in sparse_permutations()
77 res = up.template selfadjointView<Upper>().twistedBy(p_null); in sparse_permutations()
86 res = mat.template selfadjointView<Upper>(); in sparse_permutations()
94 res = up.template selfadjointView<Upper>(); in sparse_permutations()
103 res.template selfadjointView<Upper>() = mat.template selfadjointView<Upper>(); in sparse_permutations()
104 res_d = up_sym_d.template triangularView<Upper>(); in sparse_permutations()
107 res.template selfadjointView<Lower>() = mat.template selfadjointView<Upper>(); in sparse_permutations()
[all …]
|
| D | triangular.cpp | 33 MatrixType m1up = m1.template triangularView<Upper>(); in triangular_square()
34 MatrixType m2up = m2.template triangularView<Upper>(); in triangular_square()
48 r1.template triangularView<Upper>() += m1; in triangular_square()
54 m1.template triangularView<Upper>() = m2.transpose() + m2; in triangular_square()
72 m3 = m1.template triangularView<Upper>(); in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
76 m3 = m1.template triangularView<Upper>(); in triangular_square()
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); in triangular_square()
82 m3 = m1.template triangularView<Upper>(); in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
[all …]
|
| D | product_syrk.cpp | 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
47 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
49 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
50 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
62 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk()
63 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
64 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpress… in syrk()
65 … (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
73 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs3.adjoint(),s1)._expression(), in syrk()
74 … (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
[all …]
|
| D | sparse_solvers.cpp | 58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2), in sparse_solvers()
59 m2.template triangularView<Upper>().solve(vec3)); in sparse_solvers()
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
61 m2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
67 mm2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2), in sparse_solvers()
73 m2.transpose().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
93 refMat2.template triangularView<Upper>().solveInPlace(refMatB); in sparse_solvers()
94 m2.template triangularView<Upper>().solveInPlace(matB); in sparse_solvers()
|
| D | nomalloc.cpp | 68 m2.col(0).noalias() = m1.template triangularView<Upper>() * m1.col(0); in nomalloc()
69 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0); in nomalloc()
70 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc()
71 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint(); in nomalloc()
73 m2.row(0).noalias() = m1.row(0) * m1.template triangularView<Upper>(); in nomalloc()
74 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template triangularView<Upper>(); in nomalloc()
75 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.template triangularView<Upper>(); in nomalloc()
76 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint().template triangularView<Upper>(); in nomalloc()
79 m2.col(0).noalias() = m1.template selfadjointView<Upper>() * m1.col(0); in nomalloc()
80 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.col(0); in nomalloc()
[all …]
|
| D | cholmod_support.cpp | 17 …CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(… in test_cholmod_T()
19 …CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(C… in test_cholmod_T()
21 …CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(… in test_cholmod_T()
24 CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper; in test_cholmod_T()
26 CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper; in test_cholmod_T()
28 CholmodSimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper; in test_cholmod_T()
|
| D | product_mmtr.cpp | 39 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint())); in mmtr()
41 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint())); in mmtr()
44 CHECK_MMTR(matc, Upper, += s*(soc*sor.transpose())); in mmtr()
46 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint())); in mmtr()
49 CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate())); in mmtr()
51 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint())); in mmtr()
|
| D | product_trmv.cpp | 35 m3 = m1.template triangularView<Eigen::Upper>(); in trmv()
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); in trmv()
45 m3 = m1.template triangularView<Eigen::Upper>(); in trmv()
46 … * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Upper>() * v1.conjugate(… in trmv()
49 m3 = m1.template triangularView<Eigen::Upper>(); in trmv()
52 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1,… in trmv()
59 m3 = m1.template triangularView<Eigen::Upper>(); in trmv()
62 …(s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView<Eigen::Upper>() * (s1*v1.conjug… in trmv()
|
| D | product_symm.cpp | 42 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12; in symm()
43 m3 = m2.template selfadjointView<Upper>(); in symm()
45 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), in symm()
52 m2 = m1.template triangularView<Upper>(); in symm()
53 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
56 m2 = m1.template triangularView<Upper>(); in symm()
65 m2 = m1.template triangularView<Upper>(); in symm()
70 m2 = m1.template triangularView<Upper>(); rhs13 = rhs12; in symm()
|
| D | simplicial_cholesky.cpp | 15 SimplicialCholesky<SparseMatrix<T>, Upper> chol_colmajor_upper_amd; in test_simplicial_cholesky_T()
17 SimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper_amd; in test_simplicial_cholesky_T()
19 SimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper_amd; in test_simplicial_cholesky_T()
21 SimplicialLDLT<SparseMatrix<T>, Upper, NaturalOrdering<int> > ldlt_colmajor_upper_nat; in test_simplicial_cholesky_T()
|
| D | product_selfadjoint.cpp | 45 m2 = m1.template triangularView<Upper>(); in product_selfadjoint()
46 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3); in product_selfadjoint()
47 …oint()+numext::conj(s3)*(s2*v2)*(-v1).adjoint())).template triangularView<Upper>().toDenseMatrix()… in product_selfadjoint()
49 m2 = m1.template triangularView<Upper>(); in product_selfadjoint()
50 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1); in product_selfadjoint()
51 …(r2.adjoint()*s3) * (-s2*r1.adjoint()).adjoint()).template triangularView<Upper>().toDenseMatrix()… in product_selfadjoint()
|
| D | product_trsolve.cpp | 48 VERIFY_TRSM(cmLhs .template triangularView<Upper>(), cmRhs); in trsolve()
50 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Upper>(), rmRhs); in trsolve()
51 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Upper>(), rmRhs); in trsolve()
61 VERIFY_TRSM_ONTHERIGHT(cmLhs .template triangularView<Upper>(), cmRhs); in trsolve()
63 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<Upper>(), rmRhs); in trsolve()
|
| D | product_notemporary.cpp | 78 …VERIFY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template triangularView<Upper>() * (m… in product_notemporary()
81 VERIFY_EVALUATION_COUNT( m3.template triangularView<Upper>() = (m1 * m2.adjoint()), 0); in product_notemporary()
82 VERIFY_EVALUATION_COUNT( m3.template triangularView<Upper>() -= (m1 * m2.adjoint()), 0); in product_notemporary()
91 …OUNT( m3.noalias() = s2 * m2.adjoint() * (s1 * m1.adjoint()).template selfadjointView<Upper>(), 0); in product_notemporary()
96 …UNT( m3.col(c0).noalias() -= (s1 * m1).adjoint().template selfadjointView<Upper>() * (-m2.row(c0)*… in product_notemporary()
98 …(r0,c0,r1,c1).noalias() += m1.block(r0,r0,r1,r1).template selfadjointView<Upper>() * (s1*m2.block(… in product_notemporary()
99 …k(r0,c0,r1,c1).noalias() = m1.block(r0,r0,r1,r1).template selfadjointView<Upper>() * m2.block(r0,c… in product_notemporary()
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | RangeConstraintManager.cpp | 107 const llvm::APSInt &Upper, in IntersectInRange() argument
123 if (i->From() > Upper) { in IntersectInRange()
128 if (i->Includes(Upper)) { in IntersectInRange()
130 BV.getValue(Upper))); in IntersectInRange()
135 if (i->Includes(Upper)) { in IntersectInRange()
136 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper))); in IntersectInRange()
149 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const { in pin()
157 APSIntType::RangeTestResultKind UpperTest = Type.testInRange(Upper, true); in pin()
165 if (Lower < Upper) in pin()
170 Upper = Type.getMaxValue(); in pin()
[all …]
|
| /external/eigen/blas/ |
| D | level2_impl.h | 87 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,Col… in EIGEN_BLAS_FUNC()
92 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,Row… in EIGEN_BLAS_FUNC()
93 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, Conj, Row… in EIGEN_BLAS_FUNC()
95 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,Col… in EIGEN_BLAS_FUNC()
100 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,Row… in EIGEN_BLAS_FUNC()
101 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,Conj, Row… in EIGEN_BLAS_FUNC()
142 …func[NOTR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Upper|0, … in EIGEN_BLAS_FUNC()
147 …func[TR | (LO << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Upper|0, … in EIGEN_BLAS_FUNC()
148 …func[ADJ | (LO << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Upper|0, … in EIGEN_BLAS_FUNC()
150 …func[NOTR | (UP << 2) | (UNIT << 3)] = (internal::triangular_matrix_vector_product<int,Upper|Uni… in EIGEN_BLAS_FUNC()
[all …]
|
| D | level3_impl.h | 78 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,… in EIGEN_BLAS_FUNC()
82 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, false,… in EIGEN_BLAS_FUNC()
87 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,… in EIGEN_BLAS_FUNC()
88 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, Conj, … in EIGEN_BLAS_FUNC()
91 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, false,… in EIGEN_BLAS_FUNC()
92 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, Conj, … in EIGEN_BLAS_FUNC()
95 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,false,Col… in EIGEN_BLAS_FUNC()
99 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|UnitDiag,false,Col… in EIGEN_BLAS_FUNC()
104 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,false,Row… in EIGEN_BLAS_FUNC()
105 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,Conj, Row… in EIGEN_BLAS_FUNC()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | UnicodeCharRanges.h | 29 uint32_t Upper; member
36 return Range.Upper < Value;
81 if (I->Upper < I->Lower) { in rangesAreValid()
85 DEBUG(dbgs().write_hex(I->Upper) << "\n"); in rangesAreValid()
88 Prev = I->Upper; in rangesAreValid()
|
| D | Format.h | 146 bool Upper; variable
152 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), in FormattedNumber()
163 bool Upper = false) {
165 return FormattedNumber(N, 0, Width, true, Upper, true);
176 bool Upper = false) {
178 return FormattedNumber(N, 0, Width, true, Upper, false);
|
| /external/icu/icu4c/source/test/testdata/ |
| D | SentenceBreakTest.txt | 35 ÷ 0001 × 0041 ÷ # ÷ [0.2] <START OF HEADING> (Other) × [12.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.…
36 …NG> (Other) × [5.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
65 ÷ 000D ÷ 0041 ÷ # ÷ [0.2] <CARRIAGE RETURN (CR)> (CR) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.…
66 … (CR)> (CR) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
95 ÷ 000A ÷ 0041 ÷ # ÷ [0.2] <LINE FEED (LF)> (LF) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
96 … (LF)> (LF) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
125 ÷ 0085 ÷ 0041 ÷ # ÷ [0.2] <NEXT LINE (NEL)> (Sep) ÷ [4.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
126 …NEL)> (Sep) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
155 ÷ 0009 × 0041 ÷ # ÷ [0.2] <CHARACTER TABULATION> (Sp) × [12.0] LATIN CAPITAL LETTER A (Upper) ÷ [0…
156 …ATION> (Sp) × [5.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN CAPITAL LETTER A (Upper) ÷ [0.3]
[all …]
|
| /external/llvm/include/llvm/IR/ |
| D | ConstantRange.h | 44 APInt Lower, Upper; variable
61 ConstantRange(APIntMoveTy Lower, APIntMoveTy Upper);
91 const APInt &getUpper() const { return Upper; } in getUpper()
127 if (Upper == Lower + 1) in getSingleElement()
159 return Lower == CR.Lower && Upper == CR.Upper;
|
| /external/clang/unittests/Basic/ |
| D | VirtualFileSystemTest.cpp | 213 IntrusiveRefCntPtr<DummyFileSystem> Upper(new DummyFileSystem()); in TEST() local
216 O->pushOverlay(Upper); in TEST()
219 Upper->addDirectory("/upper-only"); in TEST()
228 Status1 = Upper->status("/upper-only"); in TEST()
238 IntrusiveRefCntPtr<DummyFileSystem> Upper(new DummyFileSystem()); in TEST() local
241 O->pushOverlay(Upper); in TEST()
245 Upper->addDirectory("/both", sys::fs::owner_all | sys::fs::group_read); in TEST()
252 Upper->addRegularFile("/both/bar", sys::fs::owner_write); in TEST()
374 IntrusiveRefCntPtr<DummyFileSystem> Upper(new DummyFileSystem()); in TEST() local
377 O->pushOverlay(Upper); in TEST()
[all …]
|
| /external/eigen/Eigen/src/SparseCore/ |
| D | SparseSelfAdjointView.h | 244 ((UpLo&(Upper|Lower))==(Upper|Lower))
245 || ( (UpLo&Upper) && !LhsIsRowMajor)
340 if(UpLo==(Upper|Lower))
344 else if(( UpLo==Lower && r>c) || ( UpLo==Upper && r<c))
373 if(UpLo==(Upper|Lower))
385 else if(( (UpLo&Lower)==Lower && r>c) || ( (UpLo&Upper)==Upper && r<c))
410 DstUpLo = DstOrder==RowMajor ? (_DstUpLo==Upper ? Lower : Upper) : _DstUpLo,
411 SrcUpLo = SrcOrder==RowMajor ? (_SrcUpLo==Upper ? Lower : Upper) : _SrcUpLo
424 if((int(SrcUpLo)==int(Lower) && i<j) || (int(SrcUpLo)==int(Upper) && i>j))
444 if((int(SrcUpLo)==int(Lower) && i<j) || (int(SrcUpLo)==int(Upper) && i>j))
[all …]
|
| D | TriangularSolver.h | 20 : (Mode & Upper)
21 ? Upper
62 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,RowMajor>
132 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,ColMajor>
169 eigen_assert((!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower)));
200 : (Mode & Upper)
201 ? Upper
294 eigen_assert( (!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower)));
317 this->template triangular<Flags&(Upper|Lower)>().solveInPlace(other);
|
| /external/llvm/lib/Support/ |
| D | ScaledNumber.cpp | 33 uint64_t Upper = P1, Lower = P4; in multiply64() local
36 Upper += getU(N) + (NewLower < Lower); in multiply64()
43 if (!Upper) in multiply64()
47 unsigned LeadingZeros = countLeadingZeros(Upper); in multiply64()
50 Upper = Upper << LeadingZeros | Lower >> Shift; in multiply64()
51 return getRounded(Upper, Shift, in multiply64()
|