/external/arm-trusted-firmware/lib/aarch32/ |
D | arm32_aeabi_divmod.c | 22 struct qr { struct 30 struct qr *qr); argument 59 static void division_qr(unsigned int n, unsigned int p, struct qr *qr) in division_qr() argument 64 qr->r = 0xFFFFFFFF; /* division by 0 */ in division_qr() 82 qr->r = n; in division_qr() 83 qr->q = q; in division_qr() 87 struct qr *qr) in uint_div_qr() argument 89 division_qr(numerator, denominator, qr); in uint_div_qr() 92 if (qr->q_n) in uint_div_qr() 93 qr->q = -qr->q; in uint_div_qr() [all …]
|
/external/eigen/test/ |
D | qr_fullpivoting.cpp | 14 template<typename MatrixType> void qr() in qr() function 29 FullPivHouseholderQR<MatrixType> qr(m1); in qr() local 30 VERIFY_IS_EQUAL(rank, qr.rank()); in qr() 31 VERIFY_IS_EQUAL(cols - qr.rank(), qr.dimensionOfKernel()); in qr() 32 VERIFY(!qr.isInjective()); in qr() 33 VERIFY(!qr.isInvertible()); in qr() 34 VERIFY(!qr.isSurjective()); in qr() 36 MatrixType r = qr.matrixQR(); in qr() 38 MatrixQType q = qr.matrixQ(); in qr() 44 MatrixType c = qr.matrixQ() * r * qr.colsPermutation().inverse(); in qr() [all …]
|
D | qr_colpivoting.cpp | 94 template<typename MatrixType> void qr() in qr() function 107 ColPivHouseholderQR<MatrixType> qr(m1); in qr() local 108 VERIFY_IS_EQUAL(rank, qr.rank()); in qr() 109 VERIFY_IS_EQUAL(cols - qr.rank(), qr.dimensionOfKernel()); in qr() 110 VERIFY(!qr.isInjective()); in qr() 111 VERIFY(!qr.isInvertible()); in qr() 112 VERIFY(!qr.isSurjective()); in qr() 114 MatrixQType q = qr.householderQ(); in qr() 117 MatrixType r = qr.matrixQR().template triangularView<Upper>(); in qr() 118 MatrixType c = q * r * qr.colsPermutation().inverse(); in qr() [all …]
|
D | qr.cpp | 13 template<typename MatrixType> void qr(const MatrixType& m) in qr() function 38 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1); in qr_fixedsize() local 40 Matrix<Scalar,Rows,Cols> r = qr.matrixQR(); in qr_fixedsize() 44 VERIFY_IS_APPROX(m1, qr.householderQ() * r); in qr_fixedsize() 49 m2 = qr.solve(m3); in qr_fixedsize() 74 HouseholderQR<MatrixType> qr(m1); in qr_invertible() local 76 m2 = qr.solve(m3); in qr_invertible() 83 m3 = qr.householderQ(); // get a unitary in qr_invertible() 85 qr.compute(m1); in qr_invertible() 86 VERIFY_IS_APPROX(log(absdet), qr.logAbsDeterminant()); in qr_invertible() [all …]
|
/external/tensorflow/tensorflow/cc/training/ |
D | queue_runner_test.cc | 118 std::unique_ptr<QueueRunner> qr; in TEST() local 119 TF_EXPECT_OK(QueueRunner::New(queue_runner_def, &qr)); in TEST() 120 TF_CHECK_OK(qr->Start(session.get())); in TEST() 121 TF_EXPECT_OK(qr->Join()); in TEST() 138 std::unique_ptr<QueueRunner> qr; in TEST() local 139 TF_EXPECT_OK(QueueRunner::New(queue_runner_def, &qr)); in TEST() 140 TF_EXPECT_OK(qr->Start(session.get())); in TEST() 141 TF_EXPECT_OK(qr->Join()); in TEST() 157 std::unique_ptr<QueueRunner> qr; in TEST() local 158 TF_EXPECT_OK(QueueRunner::New(queue_runner_def, &qr)); in TEST() [all …]
|
D | coordinator_test.cc | 147 std::unique_ptr<MockQueueRunner> qr; in TEST() local 149 qr.reset(new MockQueueRunner(&coord)); in TEST() 150 qr->StartCounting(&counter, 10, &start); in TEST() 151 TF_ASSERT_OK(coord.RegisterRunner(std::move(qr))); in TEST() 201 std::unique_ptr<MockQueueRunner> qr(new MockQueueRunner(&coord)); in TEST() local 202 TF_ASSERT_OK(coord.RegisterRunner(std::move(qr))); in TEST() 209 MockQueueRunner* qr = new MockQueueRunner(&coord); in TEST() local 210 TF_ASSERT_OK(coord.RegisterRunner(std::unique_ptr<RunnerInterface>(qr))); in TEST() 213 qr->Stop(); in TEST()
|
/external/tensorflow/tensorflow/python/training/ |
D | queue_runner_test.py | 53 qr = queue_runner_impl.QueueRunner(queue, [count_up_to]) 54 threads = qr.create_threads(sess) 61 self.assertEqual(0, len(qr.exceptions_raised)) 74 qr = queue_runner_impl.QueueRunner(queue, [count_up_to_3, count_up_to_30]) 75 threads = qr.create_threads(sess) 84 self.assertEqual(0, len(qr.exceptions_raised)) 91 qr = queue_runner_impl.QueueRunner(queue, [_MockOp("i fail"), 93 threads = qr.create_threads(sess) 99 exceptions = qr.exceptions_raised 112 qr = queue_runner_impl.QueueRunner(q1, [enqueue1]) [all …]
|
/external/XNNPACK/test/ |
D | f32-pavgpool.cc | 347 .qr(8) in TEST() 349 const size_t ks = tester.mr() + tester.qr(); in TEST() 366 .qr(8) in TEST() 368 for (size_t ks = 10; ks < tester.mr() + tester.qr(); ks++) { in TEST() 385 .qr(8) in TEST() 405 .qr(8) in TEST() 407 for (size_t ks = ks_max - tester.qr() + 1; ks < ks_max; ks++) { in TEST() 424 .qr(8) in TEST() 445 .qr(8) in TEST() 447 for (size_t ks = 10; ks < tester.mr() + tester.qr(); ks++) { in TEST() [all …]
|
D | f32-avgpool.cc | 347 .qr(8) in TEST() 349 const size_t ks = tester.mr() + tester.qr(); in TEST() 366 .qr(8) in TEST() 368 for (size_t ks = 10; ks < tester.mr() + tester.qr(); ks++) { in TEST() 385 .qr(8) in TEST() 405 .qr(8) in TEST() 407 for (size_t ks = ks_max - tester.qr() + 1; ks < ks_max; ks++) { in TEST() 424 .qr(8) in TEST() 445 .qr(8) in TEST() 447 for (size_t ks = 10; ks < tester.mr() + tester.qr(); ks++) { in TEST() [all …]
|
D | q8-avgpool.cc | 434 .qr(8) in TEST() 436 const size_t ks = tester.mr() + tester.qr(); in TEST() 453 .qr(8) in TEST() 455 for (size_t ks = 10; ks < tester.mr() + tester.qr(); ks++) { in TEST() 472 .qr(8) in TEST() 492 .qr(8) in TEST() 494 for (size_t ks = ks_max - tester.qr() + 1; ks < ks_max; ks++) { in TEST() 511 .qr(8) in TEST() 532 .qr(8) in TEST() 534 for (size_t ks = 10; ks < tester.mr() + tester.qr(); ks++) { in TEST() [all …]
|
D | max-pooling-nhwc.cc | 267 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 283 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 305 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 322 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 339 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 355 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 377 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 394 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 411 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() 437 …u8.maxpool.mr + 1; pool_size <= xnn_params.u8.maxpool.mr + xnn_params.u8.maxpool.qr; pool_size++) { in TEST() [all …]
|
D | argmax-pooling-nhwc.cc | 15 while (ukernel->qr == 0) { in FindMaxSinglePassPoolingSize() 23 while (ukernel->qr == 0) { in FindMultiPassMicroKernel() 213 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() 230 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() 253 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() 270 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() 293 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() 320 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() 347 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() 374 … for (size_t pool_size = multipass.mr + 1; pool_size <= multipass.mr + multipass.qr; pool_size++) { in TEST() [all …]
|
/external/wpa_supplicant_8/src/common/ |
D | dragonfly.c | 54 struct crypto_bignum **qr, in dragonfly_get_random_qr_qnr() argument 57 *qr = *qnr = NULL; in dragonfly_get_random_qr_qnr() 59 while (!(*qr) || !(*qnr)) { in dragonfly_get_random_qr_qnr() 70 if (res == 1 && !(*qr)) in dragonfly_get_random_qr_qnr() 71 *qr = tmp; in dragonfly_get_random_qr_qnr() 78 if (*qr && *qnr) in dragonfly_get_random_qr_qnr() 80 crypto_bignum_deinit(*qr, 0); in dragonfly_get_random_qr_qnr() 82 *qr = *qnr = NULL; in dragonfly_get_random_qr_qnr() 110 const u8 *qr, const u8 *qnr, in dragonfly_is_quadratic_residue_blind() argument 156 const_time_select_bin(mask, qnr, qr, prime_len, qr_or_qnr_bin); in dragonfly_is_quadratic_residue_blind()
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
D | LMpar.h | 21 const QRSolver &qr, in lmpar2() argument 47 s = qr.matrixR(); in lmpar2() 51 const Index n = qr.matrixR().cols(); in lmpar2() 61 const Index rank = qr.rank(); // use a threshold in lmpar2() 67 x = qr.colsPermutation()*wa1; in lmpar2() 86 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2)/dxnorm; in lmpar2() 94 wa1[j] = s.col(j).head(j+1).dot(qtb.head(j+1)) / diag[qr.colsPermutation().indices()(j)]; in lmpar2() 118 lmqrsolv(s, qr.colsPermutation(), wa1, qtb, x, sdiag); in lmpar2() 132 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2/dxnorm); in lmpar2()
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/regression/ |
D | OLSMultipleLinearRegression.java | 58 private QRDecomposition qr = null; field in OLSMultipleLinearRegression 82 qr = new QRDecompositionImpl(X); in newSampleData() 102 RealMatrix Q = qr.getQ(); in calculateHat() 103 final int p = qr.getR().getColumnDimension(); in calculateHat() 201 qr = new QRDecompositionImpl(X); in newXSampleData() 211 return qr.getSolver().solve(Y); in calculateBeta() 228 RealMatrix Raug = qr.getR().getSubMatrix(0, p - 1 , 0, p - 1); in calculateBetaVariance()
|
/external/pdfium/fxbarcode/qrcode/ |
D | BC_QRCodeWriter.cpp | 68 CBC_QRCoder qr; in Encode() local 69 if (!CBC_QRCoderEncoder::Encode(contents, ec, &qr)) in Encode() 72 *pOutWidth = qr.GetMatrixWidth(); in Encode() 73 *pOutHeight = qr.GetMatrixWidth(); in Encode() 75 memcpy(results.data(), qr.GetMatrix()->GetArray().data(), in Encode()
|
/external/perfetto/src/ipc/ |
D | client_impl.cc | 77 QueuedRequest qr; in BindService() local 78 qr.type = Frame::kMsgBindServiceFieldNumber; in BindService() 79 qr.request_id = request_id; in BindService() 80 qr.service_proxy = service_proxy; in BindService() 81 queued_requests_.emplace(request_id, std::move(qr)); in BindService() 109 QueuedRequest qr; in BeginInvoke() local 110 qr.type = Frame::kMsgInvokeMethodFieldNumber; in BeginInvoke() 111 qr.request_id = request_id; in BeginInvoke() 112 qr.method_name = method_name; in BeginInvoke() 113 qr.service_proxy = std::move(service_proxy); in BeginInvoke() [all …]
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
D | lmpar.h | 165 const ColPivHouseholderQR<Matrix< Scalar, Dynamic, Dynamic> > &qr, in lmpar2() 189 const Index n = qr.matrixQR().cols(); in lmpar2() 199 const Index rank = qr.rank(); // use a threshold in lmpar2() 202 …qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(ran… in lmpar2() 204 x = qr.colsPermutation()*wa1; in lmpar2() 223 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2)/dxnorm; in lmpar2() 224 … qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1); in lmpar2() 231 …wa1[j] = qr.matrixQR().col(j).head(j+1).dot(qtb.head(j+1)) / diag[qr.colsPermutation().indices()(j… in lmpar2() 246 Matrix< Scalar, Dynamic, Dynamic > s = qr.matrixQR(); in lmpar2() 256 qrsolv<Scalar>(s, qr.colsPermutation().indices(), wa1, qtb, x, sdiag); in lmpar2() [all …]
|
/external/XNNPACK/src/ |
D | average-pooling-nhwc.c | 166 const uint32_t qr = xnn_params.q8.avgpool.qr; in xnn_create_average_pooling2d_nhwc_q8() local 167 if (any_padding || pooling_size < mr || (pooling_size - mr) % qr != 0) { in xnn_create_average_pooling2d_nhwc_q8() 194 const size_t nrows = round_up(doz(pooling_size, mr), qr) + mr; in xnn_create_average_pooling2d_nhwc_q8() 314 const uint32_t qr = xnn_params.f32.avgpool.qr; in xnn_create_average_pooling2d_nhwc_f32() local 315 if (any_padding || pooling_size < mr || (pooling_size - mr) % qr != 0) { in xnn_create_average_pooling2d_nhwc_f32() 444 const uint32_t qr = xnn_params.q8.avgpool.qr; in xnn_setup_average_pooling2d_nhwc_q8() local 452 pooling_size > mr ? round_up(pooling_size - mr, qr) + mr - qr : 0; in xnn_setup_average_pooling2d_nhwc_q8() 582 const uint32_t qr = xnn_params.f32.avgpool.qr; in xnn_setup_average_pooling2d_nhwc_f32() local 584 pooling_size > mr ? round_up(pooling_size - mr, qr) + mr - qr : 0; in xnn_setup_average_pooling2d_nhwc_f32() 638 const uint32_t qr = xnn_params.f32.pavgpool.qr; in xnn_setup_average_pooling2d_nhwc_f32() local [all …]
|
D | init.c | 100 .qr = 8, in init() 115 .qr = 8, in init() 208 .qr = 8, in init() 214 .qr = 8, in init() 224 .qr = 8, in init() 237 .qr = 8, in init() 331 .qr = 8, in init() 346 .qr = 8, in init() 506 .qr = 8, in init() 512 .qr = 8, in init() [all …]
|
/external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
D | matrix_inverse_op.cc | 45 auto qr = xla::QRDecomposition(input, /*full_matrices=*/false); in Compile() local 46 OP_REQUIRES_OK(ctx, qr.status()); in Compile() 49 qr.ValueOrDie().r, xla::TransposeInMinorDims(qr.ValueOrDie().q), in Compile()
|
D | matrix_solve_op.cc | 49 auto qr = xla::QRDecomposition(matrix, /*full_matrices=*/false); in Compile() local 50 OP_REQUIRES_OK(ctx, qr.status()); in Compile() 53 qr.ValueOrDie().r, xla::TransposeInMinorDims(qr.ValueOrDie().q), in Compile()
|
/external/eigen/doc/snippets/ |
D | HouseholderQR_householderQ.cpp | 3 HouseholderQR<MatrixXf> qr(A); 4 Q = qr.householderQ(); 5 thinQ = qr.householderQ() * thinQ;
|
/external/tensorflow/tensorflow/python/kernel_tests/ |
D | qr_op_test.py | 54 linalg_ops.qr(scalar) 58 linalg_ops.qr(vector) 69 q1, r1 = linalg_ops.qr(matrix1, full_matrices=full_matrices_) 70 q2, r2 = linalg_ops.qr(matrix2, full_matrices=full_matrices_) 139 q_tf, r_tf = linalg_ops.qr(x_tf, full_matrices=full_matrices_) 154 np_q_reshape[i, :, :], _ = np.linalg.qr( 157 np_q_reshape[i, :, :], _ = np.linalg.qr( 189 tf_b = linalg_ops.qr(tf_a, full_matrices=full_matrices_) 238 q, r = linalg_ops.qr(matrix) 253 q, r = linalg_ops.qr(matrix)
|
/external/scapy/scapy/layers/ |
D | llmnr.py | 44 qr = 1 variable in LLMNRResponse 48 self.qr == 1 and 49 other.qr == 0)
|