Actual source code: sbaij.h

  4: #include <private/matimpl.h>
  5: #include <../src/mat/impls/baij/seq/baij.h>

  7: /*  
  8:   MATSEQSBAIJ format - Block compressed row storage. The i[] and j[] 
  9:   arrays start at 0.
 10: */

 12: typedef struct {
 13:   SEQAIJHEADER(MatScalar);
 14:   SEQBAIJHEADER;
 15:   PetscInt         *inew;        /* pointer to beginning of each row of reordered matrix */
 16:   PetscInt         *jnew;        /* column values: jnew + i[k] is start of row k */
 17:   MatScalar        *anew;        /* nonzero diagonal and superdiagonal elements of reordered matrix */
 18:   PetscScalar      *solves_work; /* work space used in MatSolves */
 19:   PetscInt         solves_work_n;/* size of solves_work */
 20:   PetscInt         *a2anew;        /* map used for symm permutation */
 21:   PetscBool        permute;        /* if true, a non-trivial permutation is used for factorization */
 22:   PetscBool        ignore_ltriangular; /* if true, ignore the lower triangular values inserted by users */
 23:   PetscBool        getrow_utriangular; /* if true, MatGetRow_SeqSBAIJ() is enabled to get the upper part of the row */
 24:   Mat_SeqAIJ_Inode inode;
 25:   unsigned short   *jshort;
 26:   PetscBool        free_jshort;
 27: } Mat_SeqSBAIJ;




















162: #endif