| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| ConjugateGradient.h | 150 using Base::m_iterations;
207 m_iterations = Base::maxIterations();
212 m_iterations = Base::maxIterations();
216 internal::conjugate_gradient(MatrixWrapperType(*mp_matrix), b.col(j), xj, Base::m_preconditioner, m_iterations, m_error);
|
| BiCGSTAB.h | 164 using Base::m_iterations;
216 m_iterations = Base::maxIterations();
220 if(!internal::bicgstab(*mp_matrix, b.col(j), xj, Base::m_preconditioner, m_iterations, m_error))
|
| IterativeSolverBase.h | 152 return m_iterations;
230 mutable int m_iterations; member in class:Eigen::IterativeSolverBase
|
| /external/deqp/modules/gles31/functional/ |
| es31fShaderTextureSizeTests.cpp | 94 std::vector<tcu::IVec3> m_iterations; member in class:deqp::gles31::Functional::__anon10673::TextureSizeCase
202 m_iterations.push_back(tcu::IVec3(w, h, 0));
216 m_iterations.push_back(tcu::IVec3(w, h, d));
248 m_testCtx.getLog() << tcu::TestLog::Message << "\nIteration " << (m_iteration+1) << " / " << (int)m_iterations.size() << tcu::TestLog::EndMessage;
254 createTexture(m_iterations[m_iteration]);
258 runShader(result, m_iterations[m_iteration]);
283 if (++m_iteration < (int)m_iterations.size())
|
| es31fTextureBorderClampTests.cpp | [all...] |
| es31fTextureGatherTests.cpp | 1653 vector<GatherArgs> m_iterations; member in class:deqp::gles31::Functional::__anon10698::TextureGather2DCase
[all...] |
| es31fTextureLevelStateQueryTests.cpp | 841 std::vector<TextureGenerationSpec> m_iterations; member in class:deqp::gles31::Functional::__anon10700::TextureLevelCase
872 generateTestIterations(m_iterations);
874 for (int iterationNdx = 0; iterationNdx < (int)m_iterations.size(); ++iterationNdx)
875 DE_ASSERT(m_iterations[iterationNdx].bindTarget == m_target);
916 const bool result = testConfig(m_iterations[m_iteration]);
924 if (++m_iteration < (int)m_iterations.size())
[all...] |
| es31fSeparateShaderTests.cpp | 1045 int m_iterations;
1078 , m_iterations (iterations)
[all...] |
| es31fPrimitiveBoundingBoxTests.cpp | [all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 204 using Base::m_iterations;
261 m_iterations = Base::maxIterations();
266 m_iterations = Base::maxIterations();
271 Base::m_preconditioner, m_iterations, m_error);
|
| DGMRES.h | 106 using Base::m_iterations;
164 m_iterations = Base::maxIterations();
278 while (nbIts < m_iterations && m_info == NoConvergence)
283 if (nbIts < m_iterations && m_info == NoConvergence)
312 while (m_info == NoConvergence && it < m_restart && nbIts < m_iterations)
384 if(nbIts < m_iterations && m_info == NoConvergence && m_neig > 0 && (m_r+m_neig) < m_maxNeig)
|
| GMRES.h | 259 using Base::m_iterations;
324 m_iterations = Base::maxIterations();
328 if(!internal::gmres(*mp_matrix, b.col(j), xj, Base::m_preconditioner, m_iterations, m_restart, m_error))
|
