| /external/ceres-solver/internal/ceres/ |
| D | schur_complement_solver.cc | 114 set_rhs(new double[lhs()->num_rows()]); in InitStorage()
123 const int num_rows = m->num_rows(); in SolveReducedLinearSystem() local
127 if (num_rows == 0) { in SolveReducedLinearSystem()
134 VectorRef(solution, num_rows) = in SolveReducedLinearSystem()
135 ConstMatrixRef(m->values(), num_rows, num_rows) in SolveReducedLinearSystem()
138 .solve(ConstVectorRef(rhs(), num_rows)); in SolveReducedLinearSystem()
142 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows); in SolveReducedLinearSystem()
143 const int info = LAPACK::SolveInPlaceUsingCholesky(num_rows, in SolveReducedLinearSystem()
242 set_rhs(new double[lhs()->num_rows()]); in InitStorage()
271 const int num_rows = tsm->num_rows(); in SolveReducedLinearSystemUsingSuiteSparse() local
[all …]
|
| D | compressed_row_sparse_matrix.cc | 71 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows, in CompressedRowSparseMatrix() argument
74 num_rows_ = num_rows; in CompressedRowSparseMatrix()
76 rows_.resize(num_rows + 1, 0); in CompressedRowSparseMatrix()
91 num_rows_ = m.num_rows(); in CompressedRowSparseMatrix()
134 int num_rows) { in CompressedRowSparseMatrix() argument
137 num_rows_ = num_rows; in CompressedRowSparseMatrix()
138 num_cols_ = num_rows; in CompressedRowSparseMatrix()
139 rows_.resize(num_rows + 1); in CompressedRowSparseMatrix()
140 cols_.resize(num_rows); in CompressedRowSparseMatrix()
141 values_.resize(num_rows); in CompressedRowSparseMatrix()
[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 | 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 | lapack.cc | 66 int LAPACK::SolveInPlaceUsingCholesky(int num_rows, in SolveInPlaceUsingCholesky() argument
74 int n = num_rows; in SolveInPlaceUsingCholesky()
94 int LAPACK::EstimateWorkSizeForQR(int num_rows, int num_cols) { in EstimateWorkSizeForQR() argument
105 &num_rows, in EstimateWorkSizeForQR()
109 &num_rows, in EstimateWorkSizeForQR()
111 &num_rows, in EstimateWorkSizeForQR()
121 int LAPACK::SolveUsingQR(int num_rows, in SolveUsingQR() argument
132 int m = num_rows; in SolveUsingQR()
135 int lda = num_rows; in SolveUsingQR()
136 int ldb = num_rows; in SolveUsingQR()
|
| D | compressed_row_sparse_matrix_test.cc | 46 EXPECT_EQ(a->num_rows(), b->num_rows()); in CompareMatrices()
49 int num_rows = a->num_rows(); in CompareMatrices() local
56 Vector y_a = Vector::Zero(num_rows); in CompareMatrices()
57 Vector y_b = Vector::Zero(num_rows); in CompareMatrices()
77 num_rows = tsm->num_rows(); in SetUp()
81 int num_rows; member in ceres::internal::CompressedRowSparseMatrixTest
93 for (int i = 0; i < num_rows; ++i) { in TEST_F()
94 Vector a = Vector::Zero(num_rows); in TEST_F()
129 for (int i = 0; i < num_rows; ++i) { in TEST_F()
130 tsm->Resize(num_rows - i, num_cols); in TEST_F()
[all …]
|
| 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 | 58 num_rows_ = A_->num_rows(); in SetUp()
77 EXPECT_EQ(m.num_rows(), A_->num_rows()); in TEST_F()
94 Vector y1 = Vector::Zero(m.num_rows()); in TEST_F()
97 Vector y2 = Vector::Zero(m.num_rows()); in TEST_F()
100 for (int i = 0; i < m.num_rows(); ++i) { in TEST_F()
119 Vector y1 = Vector::Zero(m.num_rows()); in TEST_F()
122 Vector y2 = Vector::Zero(m.num_rows()); in TEST_F()
125 for (int i = 0; i < m.num_rows(); ++i) { in TEST_F()
136 Vector x = Vector::Zero(m.num_rows()); in TEST_F()
137 for (int i = 0; i < m.num_rows(); ++i) { in TEST_F()
[all …]
|
| D | dense_qr_solver.cc | 70 const int num_rows = A->num_rows(); in SolveUsingLAPACK() local
93 rhs_.head(num_rows) = ConstVectorRef(b, num_rows); in SolveUsingLAPACK()
131 const int num_rows = A->num_rows(); in SolveUsingEigen() local
142 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0); in SolveUsingEigen()
147 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 | schur_jacobi_preconditioner.cc | 96 const int num_rows = m_->num_rows(); in UpdateImpl() local
97 CHECK_GT(num_rows, 0); in UpdateImpl()
107 Vector rhs = Vector::Zero(m_->num_rows()); in UpdateImpl()
108 Vector b = Vector::Zero(A.num_rows()); in UpdateImpl()
140 int SchurJacobiPreconditioner::num_rows() const { in num_rows() function in ceres::internal::SchurJacobiPreconditioner
141 return m_->num_rows(); in num_rows()
|
| D | covariance_impl.cc | 61 explicit PerThreadContext(int num_rows) in PerThreadContext()
67 rhs = ss.CreateDenseVector(NULL, num_rows, num_rows); in PerThreadContext()
283 int num_rows = 0; in ComputeCovarianceSparsity() local
289 parameter_block_to_row_index_[parameter_block] = num_rows; in ComputeCovarianceSparsity()
290 num_rows += parameter_block_size; in ComputeCovarianceSparsity()
334 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros)); in ComputeCovarianceSparsity()
389 rows[num_rows] = cursor; in ComputeCovarianceSparsity()
429 cholmod_jacobian_view.ncol = jacobian.num_rows; in ComputeCovarianceValuesUsingSparseCholesky()
467 const int num_rows = covariance_matrix_->num_rows(); in ComputeCovarianceValuesUsingSparseCholesky() local
486 cholmod_dense* rhs = ss.CreateDenseVector(NULL, num_rows, num_rows); in ComputeCovarianceValuesUsingSparseCholesky()
[all …]
|
| D | corrector.cc | 104 void Corrector::CorrectResiduals(int num_rows, double* residuals) { in CorrectResiduals() argument
107 for (int r = 0; r < num_rows; ++r) { in CorrectResiduals()
112 void Corrector::CorrectJacobian(int num_rows, in CorrectJacobian() argument
132 for (int r = 0; r < num_rows; ++r) { in CorrectJacobian()
136 for (int r = 0; r < num_rows; ++r) { in CorrectJacobian()
|
| 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 | 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 | 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 | 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()
|
| D | block_sparse_matrix_test.cc | 57 CHECK_EQ(A_->num_rows(), B_->num_rows()); in SetUp()
72 Vector y_a = Vector::Zero(A_->num_rows()); in TEST_F()
73 Vector y_b = Vector::Zero(A_->num_rows()); in TEST_F()
86 for (int i = 0; i < A_->num_rows(); ++i) { in TEST_F()
87 Vector x = Vector::Zero(A_->num_rows()); in TEST_F()
|
| D | compressed_row_sparse_matrix.h | 70 CompressedRowSparseMatrix(int num_rows,
76 CompressedRowSparseMatrix(const double* diagonal, int num_rows);
89 virtual int num_rows() const { return num_rows_; } in num_rows() function
119 void set_num_rows(const int num_rows) { num_rows_ = num_rows; } in set_num_rows() argument
|
| /external/qemu/distrib/jpeg-6b/ |
| 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 …]
|
| D | jdcolor.c | 141 JSAMPARRAY output_buf, int num_rows) in ycc_rgb_convert() argument
157 while (--num_rows >= 0) { in ycc_rgb_convert()
182 JSAMPARRAY output_buf, int num_rows) in ycc_rgba_8888_convert() argument
198 while (--num_rows >= 0) { in ycc_rgba_8888_convert()
223 JSAMPARRAY output_buf, int num_rows) in ycc_rgb_565_convert() argument
239 while (--num_rows >= 0) { in ycc_rgb_565_convert()
295 JSAMPARRAY output_buf, int num_rows) in ycc_rgb_565D_convert() argument
312 while (--num_rows >= 0) { in ycc_rgb_565D_convert()
373 JSAMPARRAY output_buf, int num_rows) in rgb_rgba_8888_convert() argument
381 while (--num_rows >= 0) { in rgb_rgba_8888_convert()
[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 …]
|
| D | jsimd_neon.c | 40 JSAMPARRAY output_buf, int num_rows));
44 JSAMPARRAY output_buf, int num_rows));
64 JSAMPARRAY output_buf, int num_rows) in jsimd_ycc_rgba8888_convert() argument
71 input_row, output_buf, num_rows); in jsimd_ycc_rgba8888_convert()
77 JSAMPARRAY output_buf, int num_rows) in jsimd_ycc_rgb565_convert() argument
84 input_row, output_buf, num_rows); in jsimd_ycc_rgb565_convert()
|
| D | jdcolor.c | 143 JSAMPARRAY output_buf, int num_rows) in ycc_rgb_convert() argument
159 while (--num_rows >= 0) { in ycc_rgb_convert()
184 JSAMPARRAY output_buf, int num_rows) in ycc_rgba_8888_convert() argument
200 while (--num_rows >= 0) { in ycc_rgba_8888_convert()
225 JSAMPARRAY output_buf, int num_rows) in ycc_rgb_565_convert() argument
241 while (--num_rows >= 0) { in ycc_rgb_565_convert()
297 JSAMPARRAY output_buf, int num_rows) in ycc_rgb_565D_convert() argument
314 while (--num_rows >= 0) { in ycc_rgb_565D_convert()
375 JSAMPARRAY output_buf, int num_rows) in rgb_rgba_8888_convert() argument
383 while (--num_rows >= 0) { in rgb_rgba_8888_convert()
[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> >
|