94       const PetscInt    *Ai, *Aj;  in main()  local
104       PetscCall(MatGetRowIJ(A, 0, PETSC_FALSE, PETSC_FALSE, &An, &Ai, &Aj, &done));  in main()
110       PetscCall(PetscMalloc1(Ai[An] * bs[j] * bs[j], &val));  in main()
111       for (i = 0; i < Ai[An]; ++i)  in main()
114       PetscCall(MatSeqBAIJSetPreallocationCSR(B, bs[j], Ai, Aj, val));  in main()
117       PetscCall(MatRestoreRowIJ(A, 0, PETSC_FALSE, PETSC_FALSE, &An, &Ai, &Aj, &done));  in main()
160         const PetscInt *Ai, *Aj;  in main()  local
167 …   PetscCall(MatGetRowIJ(A, 0, PETSC_FALSE, flg ? PETSC_FALSE : PETSC_TRUE, &An, &Ai, &Aj, &done));  in main()
170         PetscCall(PetscMalloc1(Ai[An], &ja_ptr));  in main()
172           for (k = 0; k < An + 1; ++k) ia_ptr[k] = Ai[k];  in main()
173           for (k = 0; k < Ai[An]; ++k) ja_ptr[k] = Aj[k];  in main()
179 …for (k = 0; k < An + 1; ++k) ia_ptr[k] = Ai[k] + 1; /* Fortran indexing to maximize cases covered …  in main()
180 …for (k = 0; k < Ai[An]; ++k) ja_ptr[k] = Aj[k] + 1; /* Fortran indexing to maximize cases covered …  in main()
186 …for (k = 0; k < An + 1; ++k) ia_ptr[k] = Ai[k] + 1; /* Fortran indexing to maximize cases covered …  in main()
187 …for (k = 0; k < Ai[An]; ++k) ja_ptr[k] = Aj[k] + 1; /* Fortran indexing to maximize cases covered …  in main()
199 …PetscCall(MatRestoreRowIJ(A, 0, PETSC_FALSE, flg ? PETSC_FALSE : PETSC_TRUE, &An, &Ai, &Aj, &done)…  in main()