67   for (PetscInt iterIdx = 0; iterIdx < misk; iterIdx++) {  in MatCoarsenApply_MISK_private()  local
127     if (!iterIdx) PetscCall(ISGetIndices(perm, &perm_ix)); // use permutation on first MIS  in MatCoarsenApply_MISK_private()
134         if (iterIdx == 0 && lid_removed[lid]) continue;  in MatCoarsenApply_MISK_private()
161                 if (iterIdx == 0) {  in MatCoarsenApply_MISK_private()
220     if (!iterIdx) PetscCall(ISRestoreIndices(perm, &perm_ix));  in MatCoarsenApply_MISK_private()
251     PetscCall(MatCreate(comm, &Prols[iterIdx]));  in MatCoarsenApply_MISK_private()
252     PetscCall(MatSetType(Prols[iterIdx], jtype));  in MatCoarsenApply_MISK_private()
253     PetscCall(MatSetSizes(Prols[iterIdx], nloc_inner, nselected, PETSC_DETERMINE, PETSC_DETERMINE));  in MatCoarsenApply_MISK_private()
254     PetscCall(MatSeqAIJSetPreallocation(Prols[iterIdx], 1, NULL));  in MatCoarsenApply_MISK_private()
255     PetscCall(MatMPIAIJSetPreallocation(Prols[iterIdx], 1, NULL, 1, NULL));  in MatCoarsenApply_MISK_private()
260       PetscCall(MatGetOwnershipRangeColumn(Prols[iterIdx], &colIndex, &Iend));  in MatCoarsenApply_MISK_private()
268           PetscCall(MatSetValues(Prols[iterIdx], 1, &fgid, 1, &colIndex, &one, INSERT_VALUES));  in MatCoarsenApply_MISK_private()
274     PetscCall(MatAssemblyBegin(Prols[iterIdx], MAT_FINAL_ASSEMBLY));  in MatCoarsenApply_MISK_private()
275     PetscCall(MatAssemblyEnd(Prols[iterIdx], MAT_FINAL_ASSEMBLY));  in MatCoarsenApply_MISK_private()
277     if (iterIdx < misk - 1) {  in MatCoarsenApply_MISK_private()
279       PetscCall(MatPtAP(cMat, Prols[iterIdx], MAT_INITIAL_MATRIX, PETSC_DETERMINE, &new_mat));  in MatCoarsenApply_MISK_private()
288   for (PetscInt iterIdx = misk - 1; iterIdx > 0; iterIdx--) {  in MatCoarsenApply_MISK_private()  local
291     PetscCall(MatMatMult(Prols[iterIdx - 1], Rtot, MAT_INITIAL_MATRIX, PETSC_CURRENT, &P));  in MatCoarsenApply_MISK_private()
292     PetscCall(MatDestroy(&Prols[iterIdx - 1]));  in MatCoarsenApply_MISK_private()