Lines Matching full:int
53 const int _N_team, _team_size, _vector_length;
54 const int _N_iteration;
56 const int _ortho_strategy;
57 const int _scratch_pad_level;
61 Functor_TestBatchedTeamVectorGMRES(const ValuesViewType &D, const IntView &r, const IntView &c, const VectorViewType &X, const VectorViewType &B, const int N_team, const int team_size, const int vector_length, const int N_iteration, const double tol, const int ortho_strategy, const int scratch_pad_level, KrylovHandleType &handle) :
67 Functor_TestBatchedTeamVectorGMRES(const ValuesViewType &D, const ValuesViewType &diag, const IntView &r, const IntView &c, const VectorViewType &X, const VectorViewType &B, const int N_team, const int team_size, const int vector_length, const int N_iteration, const double tol, int ortho_strategy, const int scratch_pad_level, KrylovHandleType &handle) :
75 const int first_matrix = static_cast<int>(member.league_rank()) * _N_team;
76 const int N = _D.extent(0);
77 const int last_matrix = (static_cast<int>(member.league_rank() + 1) * _N_team < N ? static_cast<int>(member.league_rank() + 1) * _N_team : N);
78 const int graphID = static_cast<int>(member.league_rank());
124 int maximum_iteration = _handle.get_max_iteration();
144 PetscCall(PetscInfo(pc, "%d scratch memory(0) = %d + %d + %d bytes_diag=%d; %d scratch memory(1); %d maximum_iterations\n", (int)bytes_tmp, 2 * (int)bytes_2D_1, 2 * (int)bytes_1D, (int)bytes_2D_2, (int)bytes_diag, (int)(bytes_row_ptr + bytes_col_idc + bytes_diag), (int)maximum_iteration));
160 const int Nsolves = nBlk;
161 int Nsolves_team = jac->nsolves_team, fill_idx = 0;
162 int Nloc = jac->const_block_size; // same grids
163 const int nnz = (int)info.nz_used / Nsolves; // fix for variable grid size
173 PetscCheck(((int)info.nz_used) % Nsolves == 0, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_WRONG, "info.nz_used.mod(Nsolves) != 0: info.nz_used = %g, Nsolves = %d", info.nz_used, Nsolves);
194 PetscCall(PetscInfo(pc, "\tjac->n = %d, Nloc = %d, Nsolves = %d, nnz = %d, Nsolves_team = %d, league size = %d, maxit = %d\n", (int)jac->n, Nloc, Nsolves, nnz, Nsolves_team, Nsolves / Nsolves_team, (int)maxit));
197 const int blkID = team.league_rank(), start = d_bid_eqOffset[blkID], end = d_bid_eqOffset[blkID + 1];
200 Kokkos::parallel_for(Kokkos::TeamVectorRange(team, start, end), [=](const int rowb) { // Nloc
201 int rowa = d_isicol[rowb];
202 int n = glb_Aai[rowa + 1] - glb_Aai[rowa];
208 Kokkos::parallel_for(Kokkos::TeamVectorRange(team, start, end), [=](int rowb) {
209 int rowa = d_isicol[rowb];
217 const int graphID = team.league_rank();
219 for (int i = 0; i < Nloc; ++i) rowOffsets(graphID, i + 1) += rowOffsets(graphID, i);
225 const int blkID = team.league_rank(), start = d_bid_eqOffset[blkID], end = d_bid_eqOffset[blkID + 1], graphID = blkID / Nsolves_team;
226 Kokkos::parallel_for(Kokkos::TeamThreadRange(team, start, end), [=](const int rowb) {
227 int rowa = d_isicol[rowb];
228 int n = glb_Aai[rowa + 1] - glb_Aai[rowa];
231 Kokkos::parallel_for(Kokkos::ThreadVectorRange(team, n), [=](const int &i) {
245 using IntViewType = Kokkos::View<int *, layout, exec_space>;
247 const int n_iterations = maxit;
248 //const int team_size = -1;
249 const int vector_length = -1;
251 const int ortho_strategy = 0;
260 const int blkID = team.league_rank(), start = d_bid_eqOffset[blkID], end = d_bid_eqOffset[blkID + 1]; // 0
262 Kokkos::parallel_for(Kokkos::TeamVectorRange(team, start, end), [=](int rowb) {
263 int rowa = d_isicol[rowb];
278 for (int bid = 0; bid < batch_sz; bid++) PetscCall(PetscPrintf(PetscObjectComm((PetscObject)A), "%3D ", handle.get_iteration_host(idx + bid * jac->dm_Nf[dmIdx])));
281 int count = 0, ii;
282 for (int bid = 0; bid < batch_sz; bid++) {
299 for (int blkID = 0; blkID < nBlk; blkID++) {
311 for (int blkID = 0; blkID < nBlk; blkID++) {
321 if (!handle.is_converged_host(blkID)) PetscCall(PetscPrintf(PETSC_COMM_SELF, "ERROR species %d, batch %d did not converge with %d iterations\n", (int)(blkID / batch_sz), (int)blkID % batch_sz, handle.get_iteration_host(blkID)));