| /external/eigen/doc/snippets/ |
| TopicAliasing_mult3.cpp | 3 matA.noalias() = matA * matA;
|
| MatrixBase_noalias.cpp | 2 c.noalias() = a * b; // this computes the product directly to c
|
| TopicAliasing_mult2.cpp | 9 matB.noalias() = matA * matA;
|
| /external/eigen/test/ |
| product_notemporary.cpp | 47 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0);
51 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0);
57 VERIFY_EVALUATION_COUNT( m3.noalias() = m3 + m1 * m2.transpose(), 0);
58 VERIFY_EVALUATION_COUNT( m3.noalias() += m3 + m1 * m2.transpose(), 0);
59 VERIFY_EVALUATION_COUNT( m3.noalias() -= m3 + m1 * m2.transpose(), 0);
60 VERIFY_EVALUATION_COUNT( m3.noalias() = m3 - m1 * m2.transpose(), 0);
61 VERIFY_EVALUATION_COUNT( m3.noalias() += m3 - m1 * m2.transpose(), 0);
62 VERIFY_EVALUATION_COUNT( m3.noalias() -= m3 - m1 * m2.transpose(), 0);
64 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0);
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1)
[all...] |
| nomalloc.cpp | 47 m2.col(0).noalias() = m1 * m1.col(0);
48 m2.col(0).noalias() -= m1.adjoint() * m1.col(0);
49 m2.col(0).noalias() -= m1 * m1.row(0).adjoint();
50 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint();
52 m2.row(0).noalias() = m1.row(0) * m1;
53 m2.row(0).noalias() -= m1.row(0) * m1.adjoint();
54 m2.row(0).noalias() -= m1.col(0).adjoint() * m1;
55 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint();
58 m2.col(0).noalias() = m1.template triangularView<Upper>() * m1.col(0);
59 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0)
[all...] |
| product.h | 92 res.noalias() += m1 * m2.transpose();
99 vcres.noalias() += m1.transpose() * v1;
104 res.noalias() -= m1 * m2.transpose();
111 vcres.noalias() -= m1.transpose() * v1;
115 res.noalias() = square + m1 * m2.transpose();
117 res.noalias() += square + m1 * m2.transpose();
119 res.noalias() -= square + m1 * m2.transpose();
123 res.noalias() = square - m1 * m2.transpose();
125 res.noalias() += square - m1 * m2.transpose();
127 res.noalias() -= square - m1 * m2.transpose()
[all...] |
| product_trmm.cpp | 51 VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
52 VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
54 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.transpose()));
55 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate());
57 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()), s1*triTr.conjugate() * (s2*ge_left.adjoint()));
58 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate());
61 VERIFY_IS_APPROX( (ge_xs_save + s1*triTr.conjugate() * (s2*ge_left.adjoint())).eval(), ge_xs.noalias() += (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()) );
64 VERIFY_IS_APPROX( ge_sx_save - (ge_right.adjoint() * (-s1 * triTr).conjugate()).eval(), ge_sx.noalias() -= (ge_right.adjoint() * (-s1 * mat).adjoint().template triangularView<Mode>()).eval());
|
| product_extra.cpp | 41 VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval());
42 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.adjoint().eval());
43 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * m2, m1.adjoint().eval() * m2);
44 VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2);
45 VERIFY_IS_APPROX(m3.noalias() = ((s1 * m1).adjoint()) * m2, (numext::conj(s1) * m1.adjoint()).eval() * m2);
46 VERIFY_IS_APPROX(m3.noalias() = (- m1.adjoint() * s1) * (s3 * m2), (- m1.adjoint() * s1).eval() * (s3 * m2).eval());
47 VERIFY_IS_APPROX(m3.noalias() = (s2 * m1.adjoint() * s1) * m2, (s2 * m1.adjoint() * s1).eval() * m2);
48 VERIFY_IS_APPROX(m3.noalias() = (-m1*s2) * s1*m2.adjoint(), (-m1*s2).eval() * (s1*m2.adjoint()).eval());
237 r1.segment(o,m).noalias() = M * v1;
239 r2.segment(o,n).noalias() = v2 * M
[all...] |
| permutationmatrices.cpp | 77 VERIFY_EVALUATION_COUNT(m_permuted.noalias()= lp.inverse() * m_permuted, 1); // 1 temp to allocate the mask
81 VERIFY_EVALUATION_COUNT(m_permuted.noalias() = m_permuted * rp.inverse(), 1); // 1 temp to allocate the mask
85 VERIFY_EVALUATION_COUNT(m_permuted.noalias() = lp * m_permuted, 1); // 1 temp to allocate the mask
89 VERIFY_EVALUATION_COUNT(m_permuted.noalias() = m_permuted * rp, 1); // 1 temp to allocate the mask
|
| product_small.cpp | 196 C.noalias() = A.template topLeftCorner<1,M>() * (B.template topRows<M>()+B.template bottomRows<M>());
197 R.noalias() = A.template topLeftCorner<1,M>() * (B.template topRows<M>()+B.template bottomRows<M>()).eval();
207 C.noalias() = (B.template leftCols<M>()+B.template rightCols<M>()) * A.template topLeftCorner<M,1>();
208 R.noalias() = (B.template leftCols<M>()+B.template rightCols<M>()).eval() * A.template topLeftCorner<M,1>();
219 res.noalias() = 1. * (A * b);
221 res.noalias() = 1.*A * b;
223 res.noalias() = (1.*A).lazyProduct(b);
225 res.noalias() = (1.*A).lazyProduct(1.*b);
227 res.noalias() = (A).lazyProduct(1.*b);
288 B.noalias() = (((A*A)*(A*A))*((A*A)*(A*A))*((A*A)*(A*A))*((A*A)*(A*A))*((A*A)*(A*A)) * ((A*A)*(A*A))*((A*A)* (…)
[all...] |
| /external/clang/test/CodeGen/ |
| ms-declspecs.c | 36 __declspec(noalias) void noalias_callee(int *x);
|
| /external/eigen/Eigen/src/Householder/ |
| Householder.h | 126 tmp.noalias() = essential.adjoint() * bottom;
129 bottom.noalias() -= tau * essential * tmp;
163 tmp.noalias() = right * essential.conjugate();
166 right.noalias() -= tau * tmp * essential.transpose();
|
| BlockHouseholder.h | 38 // triFactor.col(i).head(i).noalias() = -h * vectors.block(i, 0, rs, i).adjoint()
41 // // FIXME add .noalias() once the triangular product can work inplace
63 triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
66 // FIXME add .noalias() once the triangular product can work inplace
93 // FIXME add .noalias() once the triangular product can work inplace
96 mat.noalias() -= V * tmp;
|
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 207 y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck
208 tmp.noalias() = V_k1.adjoint() * v_k;
209 y_k.noalias() -= Y_k.leftCols(k) * tmp;
210 tmp.noalias() = X_k1.adjoint() * v_k;
211 y_k.noalias() -= U_k1.adjoint() * tmp;
239 x_k.noalias() = A.block(k+1,k+1, remainingRows-1,remainingCols) * u_k.transpose(); // bottleneck
240 tmp0.noalias() = U_k1 * u_k.transpose();
241 x_k.noalias() -= X_k1.bottomRows(remainingRows-1) * tmp0;
242 tmp1.noalias() = Y_k.adjoint() * u_k.transpose();
243 x_k.noalias() -= A.block(k+1,0, remainingRows-1,k+1) * tmp1
[all...] |
| /external/eigen/bench/ |
| bench_gemm.cpp | 111 cr.noalias() += ar * br;
112 cr.noalias() -= ai * bi;
113 ci.noalias() += ar * bi;
114 ci.noalias() += ai * br;
119 cr.noalias() += a * br;
120 ci.noalias() += a * bi;
125 cr.noalias() += ar * b;
126 ci.noalias() += ai * b;
132 c.noalias() += a * b;
233 r.noalias() += a * b
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Umeyama.h | 143 Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose();
152 Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean;
158 Rt.col(m).head(m).noalias() -= Rt.topLeftCorner(m,m)*src_mean;
|
| /external/eigen/bench/btl/libs/eigen3/ |
| eigen3_interface.hh | 88 X.noalias() = A*B;
92 X.noalias() = A.transpose()*B.transpose();
96 // X.noalias() = A.transpose()*A;
105 X.noalias() = A*B;
109 X.noalias() = (A.template selfadjointView<Lower>() * B);
174 X.noalias() = (A.transpose()*B);
202 X.noalias() = L.template triangularView<Lower>() * B;
|
| /external/eigen/Eigen/src/Core/ |
| NoAlias.h | 15 /** \class NoAlias
25 * It is the return type of MatrixBase::noalias()
28 * \sa MatrixBase::noalias()
31 class NoAlias
36 explicit NoAlias(ExpressionType& expression) : m_expression(expression) {}
75 * More precisely, noalias() allows to bypass the EvalBeforeAssignBit flag.
77 * expressions have this flag. Therefore, noalias() is only usefull when
80 * Here are some examples where noalias is usefull:
82 * D.noalias() = A * B;
83 * D.noalias() += A.transpose() * B
101 NoAlias<Derived,MatrixBase> MatrixBase<Derived>::noalias() function in class:Eigen::MatrixBase
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| matrix_triangular_solve_op.cc | 99 output.noalias() = triangle.adjoint().solve(rhs);
101 output.noalias() = triangle.solve(rhs);
106 output.noalias() = triangle.adjoint().solve(rhs);
108 output.noalias() = triangle.solve(rhs);
|
| matrix_solve_ls_op_impl.h | 119 outputs->at(0).noalias() = matrix.adjoint() * rhs;
140 outputs->at(0).noalias() = matrix.adjoint() * llt.solve(rhs);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixExponential.h | 72 U.noalias() = A * tmp;
90 U.noalias() = A * tmp;
110 U.noalias() = A * tmp;
133 U.noalias() = A * tmp;
156 U.noalias() = A * tmp;
158 V.noalias() = A6 * tmp;
189 U.noalias() = A * tmp;
191 V.noalias() = tmp * A8;
|
| /external/eigen/bench/perf_monitoring/gemm/ |
| gemm.cpp | 19 C.noalias() += A * B;
|
| lazy_gemm.cpp | 20 C.noalias() += A.lazyProduct(B);
|
| /external/tensorflow/tensorflow/compiler/xla/service/llvm_ir/ |
| ir_array.h | 227 void AddNoaliasMetadata(llvm::MDNode* noalias) {
228 CHECK_NE(noalias, nullptr);
229 AddMetadata(llvm::LLVMContext::MD_noalias, noalias);
|
| /external/clang/test/Parser/ |
| MicrosoftExtensions.c | 8 __declspec(safebuffers) __declspec(noalias) __declspec(restrict) void * __cdecl xxx(void *_Memory); /* expected-warning{{__declspec attribute 'safebuffers' is not supported}} */
|
