| /external/ceres-solver/internal/ceres/ |
| D | schur_complement_solver.cc | 111 set_rhs(new double[lhs()->num_rows()]); in InitStorage()
126 const int num_rows = m->num_rows(); in SolveReducedLinearSystem() local
130 if (num_rows == 0) { in SolveReducedLinearSystem()
138 ConstMatrixRef(m->values(), num_rows, num_rows) in SolveReducedLinearSystem()
148 VectorRef(solution, num_rows) = llt.solve(ConstVectorRef(rhs(), num_rows)); in SolveReducedLinearSystem()
150 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows); in SolveReducedLinearSystem()
152 LAPACK::SolveInPlaceUsingCholesky(num_rows, in SolveReducedLinearSystem()
248 set_rhs(new double[lhs()->num_rows()]); in InitStorage()
293 const int num_rows = tsm->num_rows(); in SolveReducedLinearSystemUsingSuiteSparse()
297 if (num_rows == 0) { in SolveReducedLinearSystemUsingSuiteSparse()
[all …]
|
| D | normal_prior_test.cc | 58 for (int num_rows = 1; num_rows < 5; ++num_rows) { in TEST() local
63 Matrix A(num_rows, num_cols); in TEST()
70 double * jacobian = new double[num_rows * num_cols]; in TEST()
71 Vector residuals(num_rows); in TEST()
82 MatrixRef J(jacobian, num_rows, num_cols); in TEST()
95 for (int num_rows = 1; num_rows < 5; ++num_rows) { in TEST() local
100 Matrix A(num_rows, num_cols); in TEST()
110 Vector residuals(num_rows); in TEST()
|
| D | compressed_row_sparse_matrix.cc | 72 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows, in CompressedRowSparseMatrix() argument
75 num_rows_ = num_rows; in CompressedRowSparseMatrix()
77 rows_.resize(num_rows + 1, 0); in CompressedRowSparseMatrix()
92 num_rows_ = m.num_rows(); in CompressedRowSparseMatrix()
135 int num_rows) { in CompressedRowSparseMatrix() argument
138 num_rows_ = num_rows; in CompressedRowSparseMatrix()
139 num_cols_ = num_rows; in CompressedRowSparseMatrix()
140 rows_.resize(num_rows + 1); in CompressedRowSparseMatrix()
141 cols_.resize(num_rows); in CompressedRowSparseMatrix()
142 values_.resize(num_rows); in CompressedRowSparseMatrix()
[all …]
|
| D | dynamic_compressed_row_sparse_matrix_test.cc | 48 num_rows = 7; in SetUp()
56 expected_num_nonzeros = num_rows * num_cols - min(num_rows, num_cols); in SetUp()
61 dcrsm.reset(new DynamicCompressedRowSparseMatrix(num_rows, in SetUp()
71 dense.resize(num_rows, num_cols); in InitialiseDenseReference()
74 for (int i = 0; i < (num_rows * num_cols); ++i) { in InitialiseDenseReference()
87 for (int i = 0; i < (num_rows * num_cols); ++i) { in InitialiseSparseMatrixReferences()
97 tsm.reset(new TripletSparseMatrix(num_rows, in InitialiseSparseMatrixReferences()
116 for (int r = 0; r < num_rows; ++r) { in InsertNonZeroEntriesFromDenseReference()
127 EXPECT_EQ(dcrsm->num_rows(), num_rows); in ExpectEmpty()
133 EXPECT_EQ(dense_from_dcrsm.rows(), num_rows); in ExpectEmpty()
[all …]
|
| D | dense_sparse_matrix_test.cc | 49 EXPECT_EQ(a->num_rows(), b->num_rows()); in CompareMatrices()
52 int num_rows = a->num_rows(); in CompareMatrices() local
59 Vector y_a = Vector::Zero(num_rows); in CompareMatrices()
60 Vector y_b = Vector::Zero(num_rows); in CompareMatrices()
80 num_rows = tsm->num_rows(); in SetUp()
84 int num_rows; member in ceres::internal::DenseSparseMatrixTest
100 Vector b1 = Vector::Zero(num_rows); in TEST_F()
101 Vector b2 = Vector::Zero(num_rows); in TEST_F()
110 for (int i = 0; i < num_rows; ++i) { in TEST_F()
111 Vector a = Vector::Zero(num_rows); in TEST_F()
[all …]
|
| D | dynamic_compressed_row_sparse_matrix.cc | 38 int num_rows, in DynamicCompressedRowSparseMatrix() argument
41 : CompressedRowSparseMatrix(num_rows, in DynamicCompressedRowSparseMatrix()
44 dynamic_cols_.resize(num_rows); in DynamicCompressedRowSparseMatrix()
45 dynamic_values_.resize(num_rows); in DynamicCompressedRowSparseMatrix()
52 CHECK_LT(row, num_rows()); in InsertEntry()
60 int num_rows) { in ClearRows() argument
61 for (int r = 0; r < num_rows; ++r) { in ClearRows()
64 CHECK_LT(i, this->num_rows()); in ClearRows()
86 for (int i = 0; i < num_rows(); ++i) { in Finalize()
99 mutable_rows()[num_rows()] = index_into_values_and_cols; in Finalize()
|
| D | lapack.cc | 70 int num_rows, in SolveInPlaceUsingCholesky() argument
79 int n = num_rows; in SolveInPlaceUsingCholesky()
115 int LAPACK::EstimateWorkSizeForQR(int num_rows, int num_cols) { in EstimateWorkSizeForQR() argument
126 &num_rows, in EstimateWorkSizeForQR()
130 &num_rows, in EstimateWorkSizeForQR()
132 &num_rows, in EstimateWorkSizeForQR()
148 int num_rows, in SolveInPlaceUsingQR() argument
160 int m = num_rows; in SolveInPlaceUsingQR()
163 int lda = num_rows; in SolveInPlaceUsingQR()
164 int ldb = num_rows; in SolveInPlaceUsingQR()
|
| D | incomplete_lq_factorization.cc | 122 int num_nonzeros = rows[matrix->num_rows()]; in DropEntriesAndAddRow()
125 matrix->set_num_rows(matrix->num_rows() + 1); in DropEntriesAndAddRow()
126 rows[matrix->num_rows()] = num_nonzeros; in DropEntriesAndAddRow()
159 matrix->set_num_rows(matrix->num_rows() + 1); in DropEntriesAndAddRow()
160 rows[matrix->num_rows()] = num_nonzeros; in DropEntriesAndAddRow()
170 const int num_rows = matrix.num_rows(); in IncompleteLQFactorization() local
177 new CompressedRowSparseMatrix(num_rows, in IncompleteLQFactorization()
178 num_rows, in IncompleteLQFactorization()
179 l_level_of_fill * num_rows); in IncompleteLQFactorization()
182 CompressedRowSparseMatrix q(num_rows, num_cols, q_level_of_fill * num_rows); in IncompleteLQFactorization()
[all …]
|
| D | partitioned_matrix_view_test.cc | 59 num_rows_ = A_->num_rows(); in SetUp()
81 EXPECT_EQ(pmv_->num_rows(), A_->num_rows()); in TEST_F()
93 Vector y1 = Vector::Zero(pmv_->num_rows()); in TEST_F()
96 Vector y2 = Vector::Zero(pmv_->num_rows()); in TEST_F()
99 for (int i = 0; i < pmv_->num_rows(); ++i) { in TEST_F()
113 Vector y1 = Vector::Zero(pmv_->num_rows()); in TEST_F()
116 Vector y2 = Vector::Zero(pmv_->num_rows()); in TEST_F()
119 for (int i = 0; i < pmv_->num_rows(); ++i) { in TEST_F()
125 Vector x = Vector::Zero(pmv_->num_rows()); in TEST_F()
126 for (int i = 0; i < pmv_->num_rows(); ++i) { in TEST_F()
[all …]
|
| D | dense_qr_solver.cc | 71 const int num_rows = A->num_rows(); in SolveUsingLAPACK() local
94 rhs_.head(num_rows) = ConstVectorRef(b, num_rows); in SolveUsingLAPACK()
129 const int num_rows = A->num_rows(); in SolveUsingEigen() local
140 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0); in SolveUsingEigen()
145 rhs_.head(num_rows) = ConstVectorRef(b, num_rows); in SolveUsingEigen()
|
| D | dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols) in DenseSparseMatrix() argument
45 m_.resize(num_rows, num_cols); in DenseSparseMatrix()
49 DenseSparseMatrix::DenseSparseMatrix(int num_rows, in DenseSparseMatrix() argument
56 m_.resize(num_rows + num_cols, num_cols); in DenseSparseMatrix()
58 m_.resize(num_rows, num_cols); in DenseSparseMatrix()
64 : m_(Eigen::MatrixXd::Zero(m.num_rows(), m.num_cols())), in DenseSparseMatrix()
88 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols()); in RightMultiply()
93 matrix().transpose() * ConstVectorRef(x, num_rows()); in LeftMultiply()
105 *dense_matrix = m_.block(0, 0, num_rows(), num_cols()); in ToDenseMatrix()
129 int DenseSparseMatrix::num_rows() const { in num_rows() function in ceres::internal::DenseSparseMatrix
|
| D | compressed_row_sparse_matrix_test.cc | 49 EXPECT_EQ(a->num_rows(), b->num_rows()); in CompareMatrices()
52 int num_rows = a->num_rows(); in CompareMatrices() local
59 Vector y_a = Vector::Zero(num_rows); in CompareMatrices()
60 Vector y_b = Vector::Zero(num_rows); in CompareMatrices()
80 num_rows = tsm->num_rows(); in SetUp()
84 row_blocks->resize(num_rows); in SetUp()
92 int num_rows; member in ceres::internal::CompressedRowSparseMatrixTest
104 for (int i = 0; i < num_rows; ++i) { in TEST_F()
105 Vector a = Vector::Zero(num_rows); in TEST_F()
143 for (int i = 0; i < num_rows; ++i) { in TEST_F()
[all …]
|
| D | corrector.cc | 112 void Corrector::CorrectResiduals(const int num_rows, double* residuals) { in CorrectResiduals() argument
115 VectorRef(residuals, num_rows) *= residual_scaling_; in CorrectResiduals()
118 void Corrector::CorrectJacobian(const int num_rows, in CorrectJacobian() argument
127 VectorRef(jacobian, num_rows * num_cols) *= sqrt_rho1_; in CorrectJacobian()
145 for (int r = 0; r < num_rows; ++r) { in CorrectJacobian()
149 for (int r = 0; r < num_rows; ++r) { in CorrectJacobian()
|
| D | schur_jacobi_preconditioner.cc | 86 const int num_rows = m_->num_rows(); in UpdateImpl() local
87 CHECK_GT(num_rows, 0); in UpdateImpl()
97 Vector rhs = Vector::Zero(m_->num_rows()); in UpdateImpl()
98 Vector b = Vector::Zero(A.num_rows()); in UpdateImpl()
130 int SchurJacobiPreconditioner::num_rows() const { in num_rows() function in ceres::internal::SchurJacobiPreconditioner
131 return m_->num_rows(); in num_rows()
|
| D | linear_least_squares_problems.cc | 181 int num_rows = 6; in LinearLeastSquaresProblem1() local
185 TripletSparseMatrix* A = new TripletSparseMatrix(num_rows, in LinearLeastSquaresProblem1()
187 num_rows * num_cols); in LinearLeastSquaresProblem1()
188 problem->b.reset(new double[num_rows]); in LinearLeastSquaresProblem1()
277 for (int i = 0; i < num_rows; ++i) { in LinearLeastSquaresProblem1()
286 int num_rows = 6; in LinearLeastSquaresProblem2() local
291 problem->b.reset(new double[num_rows]); in LinearLeastSquaresProblem2()
296 scoped_array<double> values(new double[num_rows * num_cols]); in LinearLeastSquaresProblem2()
393 for (int i = 0; i < num_rows; ++i) { in LinearLeastSquaresProblem2()
420 int num_rows = 5; in LinearLeastSquaresProblem3() local
[all …]
|
| D | triplet_sparse_matrix.cc | 55 TripletSparseMatrix::TripletSparseMatrix(int num_rows, in TripletSparseMatrix() argument
58 : num_rows_(num_rows), in TripletSparseMatrix()
66 CHECK_GE(num_rows, 0); in TripletSparseMatrix()
199 num_rows_ = num_rows_ + B.num_rows(); in AppendRows()
203 CHECK_EQ(B.num_rows(), num_rows_); in AppendCols()
244 const double* values, int num_rows) { in CreateSparseDiagonalMatrix() argument
246 new TripletSparseMatrix(num_rows, num_rows, num_rows); in CreateSparseDiagonalMatrix()
247 for (int i = 0; i < num_rows; ++i) { in CreateSparseDiagonalMatrix()
252 m->set_num_nonzeros(num_rows); in CreateSparseDiagonalMatrix()
|
| D | block_random_access_dense_matrix_test.cc | 44 const int num_rows = 3 + 4 + 5; in TEST() local
46 EXPECT_EQ(m.num_rows(), num_rows); in TEST()
47 EXPECT_EQ(m.num_cols(), num_rows); in TEST()
76 const int num_rows = 3 + 4 + 5; in TEST() local
104 int pos = row_idx * num_rows + col_idx; in TEST()
|
| D | incomplete_lq_factorization_test.cc | 45 EXPECT_EQ(expected.num_rows(), actual.num_rows()); in ExpectMatricesAreEqual()
47 for (int i = 0; i < expected.num_rows(); ++i) { in ExpectMatricesAreEqual()
137 EXPECT_EQ(matrix.num_rows(), 1); in TEST()
145 EXPECT_EQ(matrix.num_rows(), 2); in TEST()
155 EXPECT_EQ(matrix.num_rows(), 3); in TEST()
169 EXPECT_EQ(matrix.num_rows(), 4); in TEST()
185 EXPECT_EQ(matrix.num_rows(), 5); in TEST()
|
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| D | fpdfapi_jdpostct.c | 134 JDIMENSION num_rows, max_rows; in post_process_1pass() local
141 num_rows = 0; in post_process_1pass()
144 post->buffer, &num_rows, max_rows); in post_process_1pass()
147 post->buffer, output_buf + *out_row_ctr, (int) num_rows); in post_process_1pass()
148 *out_row_ctr += num_rows; in post_process_1pass()
166 JDIMENSION old_next_row, num_rows; in post_process_prepass() local
184 num_rows = post->next_row - old_next_row; in post_process_prepass()
186 (JSAMPARRAY) NULL, (int) num_rows); in post_process_prepass()
187 *out_row_ctr += num_rows; in post_process_prepass()
210 JDIMENSION num_rows, max_rows; in post_process_2pass() local
[all …]
|
| /external/jpeg/ |
| D | jdpostct.c | 133 JDIMENSION num_rows, max_rows; in post_process_1pass() local
140 num_rows = 0; in post_process_1pass()
143 post->buffer, &num_rows, max_rows); in post_process_1pass()
146 post->buffer, output_buf + *out_row_ctr, (int) num_rows); in post_process_1pass()
147 *out_row_ctr += num_rows; in post_process_1pass()
165 JDIMENSION old_next_row, num_rows; in post_process_prepass() local
183 num_rows = post->next_row - old_next_row; in post_process_prepass()
185 (JSAMPARRAY) NULL, (int) num_rows); in post_process_prepass()
186 *out_row_ctr += num_rows; in post_process_prepass()
209 JDIMENSION num_rows, max_rows; in post_process_2pass() local
[all …]
|
| /external/ceres-solver/include/ceres/internal/ |
| D | eigen.h | 65 template <int num_rows = Eigen::Dynamic, int num_cols = Eigen::Dynamic>
67 typedef Eigen::Matrix <double, num_rows, num_cols, Eigen::RowMajor>
71 Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >
74 typedef Eigen::Matrix <double, num_rows, 1>
78 Eigen::Matrix<double, num_rows, 1> >
83 const Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >
87 const Eigen::Matrix<double, num_rows, 1> >
|
| /external/webp/src/dec/ |
| D | alpha.c | 88 static int ALPHDecode(VP8Decoder* const dec, int row, int num_rows) { in ALPHDecode() argument
96 const size_t num_pixels = num_rows * width; in ALPHDecode()
102 if (!VP8LDecodeAlphaImageStream(alph_dec, row + num_rows)) { in ALPHDecode()
108 unfilter_func(width, height, width, row, num_rows, output); in ALPHDecode()
111 if (row + num_rows == dec->pic_hdr_.height_) { in ALPHDecode()
121 int row, int num_rows) { in VP8DecompressAlphaRows() argument
125 if (row < 0 || num_rows <= 0 || row + num_rows > height) { in VP8DecompressAlphaRows()
144 num_rows = height; // decode everything in one pass in VP8DecompressAlphaRows()
151 ok = ALPHDecode(dec, row, num_rows); in VP8DecompressAlphaRows()
|
| /external/libhevc/decoder/ |
| D | ihevcd_fmt_conv.c | 391 WORD32 num_rows, num_cols, src_strd, dst_strd; in ihevcd_fmt_conv_420sp_to_420sp() local
398 num_rows = ht; in ihevcd_fmt_conv_420sp_to_420sp()
404 for(i = 0; i < num_rows; i++) in ihevcd_fmt_conv_420sp_to_420sp()
415 num_rows = ht >> 1; in ihevcd_fmt_conv_420sp_to_420sp()
421 for(i = 0; i < num_rows; i++) in ihevcd_fmt_conv_420sp_to_420sp()
490 WORD32 num_rows, num_cols, src_strd, dst_strd; in ihevcd_fmt_conv_420sp_to_420sp_swap_uv() local
497 num_rows = ht; in ihevcd_fmt_conv_420sp_to_420sp_swap_uv()
503 for(i = 0; i < num_rows; i++) in ihevcd_fmt_conv_420sp_to_420sp_swap_uv()
514 num_rows = ht >> 1; in ihevcd_fmt_conv_420sp_to_420sp_swap_uv()
520 for(i = 0; i < num_rows; i++) in ihevcd_fmt_conv_420sp_to_420sp_swap_uv()
[all …]
|
| /external/webp/src/utils/ |
| D | filters.c | 28 assert(row >= 0 && num_rows > 0 && row + num_rows <= height); \
46 int row, int num_rows, in DoHorizontalFilter() argument
50 const int last_row = row + num_rows; in DoHorizontalFilter()
84 int num_rows, uint8_t* data) { in HorizontalUnfilter() argument
85 DoHorizontalFilter(data, width, height, stride, row, num_rows, 1, data); in HorizontalUnfilter()
93 int row, int num_rows, in DoVerticalFilter() argument
97 const int last_row = row + num_rows; in DoVerticalFilter()
132 int num_rows, uint8_t* data) { in VerticalUnfilter() argument
133 DoVerticalFilter(data, width, height, stride, row, num_rows, 1, data); in VerticalUnfilter()
146 int row, int num_rows, in DoGradientFilter() argument
[all …]
|
| /external/libavc/encoder/ |
| D | ih264e_fmt_conv.c | 371 WORD32 num_rows, num_cols, src_strd, dst_strd; in ih264e_fmt_conv_420sp_to_420sp() local
378 num_rows = ht; in ih264e_fmt_conv_420sp_to_420sp()
384 for (i = 0; i < num_rows; i++) in ih264e_fmt_conv_420sp_to_420sp()
395 num_rows = ht >> 1; in ih264e_fmt_conv_420sp_to_420sp()
401 for (i = 0; i < num_rows; i++) in ih264e_fmt_conv_420sp_to_420sp()
423 WORD32 num_rows, num_cols, src_strd, dst_strd; in ih264e_fmt_conv_420sp_to_420sp_swap_uv() local
430 num_rows = ht; in ih264e_fmt_conv_420sp_to_420sp_swap_uv()
436 for (i = 0; i < num_rows; i++) in ih264e_fmt_conv_420sp_to_420sp_swap_uv()
447 num_rows = ht >> 1; in ih264e_fmt_conv_420sp_to_420sp_swap_uv()
453 for (i = 0; i < num_rows; i++) in ih264e_fmt_conv_420sp_to_420sp_swap_uv()
[all …]
|