xref: /petsc/src/mat/impls/aij/seq/aij.h (revision 846b4da1c24d4646329ef843e1782566ebe4da91)
1 
2 #if !defined(__AIJ_H)
3 #define __AIJ_H
4 
5 #include <petsc/private/matimpl.h>
6 #include <petscctable.h>
7 
8 /*
9     Struct header shared by SeqAIJ, SeqBAIJ and SeqSBAIJ matrix formats
10 */
11 #define SEQAIJHEADER(datatype)        \
12   PetscBool roworiented;              /* if true, row-oriented input, default */ \
13   PetscInt  nonew;                    /* 1 don't add new nonzeros, -1 generate error on new */ \
14   PetscInt  nounused;                 /* -1 generate error on unused space */ \
15   PetscBool singlemalloc;             /* if true a, i, and j have been obtained with one big malloc */ \
16   PetscInt  maxnz;                    /* allocated nonzeros */ \
17   PetscInt  *imax;                    /* maximum space allocated for each row */ \
18   PetscInt  *ilen;                    /* actual length of each row */ \
19   PetscInt  *ipre;                    /* space preallocated for each row by user */ \
20   PetscBool free_imax_ilen;  \
21   PetscInt  reallocs;                 /* number of mallocs done during MatSetValues() \
22                                         as more values are set than were prealloced */\
23   PetscInt          rmax;             /* max nonzeros in any row */ \
24   PetscBool         keepnonzeropattern;   /* keeps matrix structure same in calls to MatZeroRows()*/ \
25   PetscBool         ignorezeroentries; \
26   PetscBool         free_ij;          /* free the column indices j and row offsets i when the matrix is destroyed */ \
27   PetscBool         free_a;           /* free the numerical values when matrix is destroy */ \
28   Mat_CompressedRow compressedrow;    /* use compressed row format */                      \
29   PetscInt          nz;               /* nonzeros */                                       \
30   PetscInt          *i;               /* pointer to beginning of each row */               \
31   PetscInt          *j;               /* column values: j + i[k] - 1 is start of row k */  \
32   PetscInt          *diag;            /* pointers to diagonal elements */                  \
33   PetscInt          nonzerorowcnt;    /* how many rows have nonzero entries */             \
34   PetscBool         free_diag;         \
35   datatype          *a;               /* nonzero elements */                               \
36   PetscScalar       *solve_work;      /* work space used in MatSolve */                    \
37   IS                row, col, icol;   /* index sets, used for reorderings */ \
38   PetscBool         pivotinblocks;    /* pivot inside factorization of each diagonal block */ \
39   Mat               parent;           /* set if this matrix was formed with MatDuplicate(...,MAT_SHARE_NONZERO_PATTERN,....); \
40                                          means that this shares some data structures with the parent including diag, ilen, imax, i, j */\
41   Mat_SubSppt       *submatis1         /* used by MatCreateSubMatrices_MPIXAIJ_Local */
42 
43 typedef struct {
44   MatTransposeColoring matcoloring;
45   Mat                  Bt_den;       /* dense matrix of B^T */
46   Mat                  ABt_den;      /* dense matrix of A*B^T */
47   PetscBool            usecoloring;
48   PetscErrorCode (*destroy)(Mat);
49 } Mat_MatMatTransMult;
50 
51 typedef struct { /* for MatTransposeMatMult_SeqAIJ_SeqDense() */
52   Mat          mA;           /* maij matrix of A */
53   Vec          bt,ct;        /* vectors to hold locally transposed arrays of B and C */
54   PetscErrorCode (*destroy)(Mat);
55 } Mat_MatTransMatMult;
56 
57 typedef struct {
58   PetscInt    *api,*apj;       /* symbolic structure of A*P */
59   PetscScalar *apa;            /* temporary array for storing one row of A*P */
60   PetscErrorCode (*destroy)(Mat);
61 } Mat_PtAP;
62 
63 typedef struct {
64   MatTransposeColoring matcoloring;
65   Mat                  Rt;    /* sparse or dense matrix of R^T */
66   Mat                  RARt;  /* dense matrix of R*A*R^T */
67   Mat                  ARt;   /* A*R^T used for the case -matrart_color_art */
68   MatScalar            *work; /* work array to store columns of A*R^T used in MatMatMatMultNumeric_SeqAIJ_SeqAIJ_SeqDense() */
69   PetscErrorCode (*destroy)(Mat);
70 } Mat_RARt;
71 
72 typedef struct {
73   Mat BC;               /* temp matrix for storing B*C */
74   PetscErrorCode (*destroy)(Mat);
75 } Mat_MatMatMatMult;
76 
77 /*
78   MATSEQAIJ format - Compressed row storage (also called Yale sparse matrix
79   format) or compressed sparse row (CSR).  The i[] and j[] arrays start at 0. For example,
80   j[i[k]+p] is the pth column in row k.  Note that the diagonal
81   matrix elements are stored with the rest of the nonzeros (not separately).
82 */
83 
84 /* Info about i-nodes (identical nodes) helper class for SeqAIJ */
85 typedef struct {
86   MatScalar        *bdiag,*ibdiag,*ssor_work;        /* diagonal blocks of matrix used for MatSOR_SeqAIJ_Inode() */
87   PetscInt         bdiagsize;                         /* length of bdiag and ibdiag */
88   PetscBool        ibdiagvalid;                       /* do ibdiag[] and bdiag[] contain the most recent values */
89 
90   PetscBool        use;
91   PetscInt         node_count;                     /* number of inodes */
92   PetscInt         *size;                          /* size of each inode */
93   PetscInt         limit;                          /* inode limit */
94   PetscInt         max_limit;                      /* maximum supported inode limit */
95   PetscBool        checked;                        /* if inodes have been checked for */
96   PetscObjectState mat_nonzerostate;               /* non-zero state when inodes were checked for */
97 } Mat_SeqAIJ_Inode;
98 
99 PETSC_INTERN PetscErrorCode MatView_SeqAIJ_Inode(Mat,PetscViewer);
100 PETSC_INTERN PetscErrorCode MatAssemblyEnd_SeqAIJ_Inode(Mat,MatAssemblyType);
101 PETSC_INTERN PetscErrorCode MatDestroy_SeqAIJ_Inode(Mat);
102 PETSC_INTERN PetscErrorCode MatCreate_SeqAIJ_Inode(Mat);
103 PETSC_INTERN PetscErrorCode MatSetOption_SeqAIJ_Inode(Mat,MatOption,PetscBool);
104 PETSC_INTERN PetscErrorCode MatDuplicate_SeqAIJ_Inode(Mat,MatDuplicateOption,Mat*);
105 PETSC_INTERN PetscErrorCode MatDuplicateNoCreate_SeqAIJ(Mat,Mat,MatDuplicateOption,PetscBool);
106 PETSC_INTERN PetscErrorCode MatLUFactorNumeric_SeqAIJ_Inode_inplace(Mat,Mat,const MatFactorInfo*);
107 PETSC_INTERN PetscErrorCode MatLUFactorNumeric_SeqAIJ_Inode(Mat,Mat,const MatFactorInfo*);
108 
109 typedef struct {
110   SEQAIJHEADER(MatScalar);
111   Mat_SeqAIJ_Inode inode;
112   MatScalar        *saved_values;             /* location for stashing nonzero values of matrix */
113 
114   PetscScalar *idiag,*mdiag,*ssor_work;       /* inverse of diagonal entries, diagonal values and workspace for Eisenstat trick */
115   PetscBool   idiagvalid;                     /* current idiag[] and mdiag[] are valid */
116   PetscScalar *ibdiag;                        /* inverses of block diagonals */
117   PetscBool   ibdiagvalid;                    /* inverses of block diagonals are valid. */
118   PetscScalar fshift,omega;                   /* last used omega and fshift */
119 
120   ISColoring  coloring;                       /* set with MatADSetColoring() used by MatADSetValues() */
121 
122   PetscScalar         *matmult_abdense;    /* used by MatMatMult() */
123   Mat_PtAP            *ptap;               /* used by MatPtAP() */
124   Mat_MatMatMatMult   *matmatmatmult;      /* used by MatMatMatMult() */
125   Mat_RARt            *rart;               /* used by MatRARt() */
126   Mat_MatMatTransMult *abt;                /* used by MatMatTransposeMult() */
127 } Mat_SeqAIJ;
128 
129 /*
130   Frees the a, i, and j arrays from the XAIJ (AIJ, BAIJ, and SBAIJ) matrix types
131 */
132 PETSC_STATIC_INLINE PetscErrorCode MatSeqXAIJFreeAIJ(Mat AA,MatScalar **a,PetscInt **j,PetscInt **i)
133 {
134   PetscErrorCode ierr;
135   Mat_SeqAIJ     *A = (Mat_SeqAIJ*) AA->data;
136   if (A->singlemalloc) {
137     ierr = PetscFree3(*a,*j,*i);CHKERRQ(ierr);
138   } else {
139     if (A->free_a)  {ierr = PetscFree(*a);CHKERRQ(ierr);}
140     if (A->free_ij) {ierr = PetscFree(*j);CHKERRQ(ierr);}
141     if (A->free_ij) {ierr = PetscFree(*i);CHKERRQ(ierr);}
142   }
143   return 0;
144 }
145 /*
146     Allocates larger a, i, and j arrays for the XAIJ (AIJ, BAIJ, and SBAIJ) matrix types
147     This is a macro because it takes the datatype as an argument which can be either a Mat or a MatScalar
148 */
149 #define MatSeqXAIJReallocateAIJ(Amat,AM,BS2,NROW,ROW,COL,RMAX,AA,AI,AJ,RP,AP,AIMAX,NONEW,datatype) \
150   if (NROW >= RMAX) { \
151     Mat_SeqAIJ *Ain = (Mat_SeqAIJ*)Amat->data; \
152     /* there is no extra room in row, therefore enlarge */ \
153     PetscInt CHUNKSIZE = 15,new_nz = AI[AM] + CHUNKSIZE,len,*new_i=0,*new_j=0; \
154     datatype *new_a; \
155  \
156     if (NONEW == -2) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"New nonzero at (%D,%D) caused a malloc\nUse MatSetOption(A, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE) to turn off this check",ROW,COL); \
157     /* malloc new storage space */ \
158     ierr = PetscMalloc3(BS2*new_nz,&new_a,new_nz,&new_j,AM+1,&new_i);CHKERRQ(ierr); \
159  \
160     /* copy over old data into new slots */ \
161     for (ii=0; ii<ROW+1; ii++) {new_i[ii] = AI[ii];} \
162     for (ii=ROW+1; ii<AM+1; ii++) {new_i[ii] = AI[ii]+CHUNKSIZE;} \
163     ierr = PetscMemcpy(new_j,AJ,(AI[ROW]+NROW)*sizeof(PetscInt));CHKERRQ(ierr); \
164     len  = (new_nz - CHUNKSIZE - AI[ROW] - NROW); \
165     ierr = PetscMemcpy(new_j+AI[ROW]+NROW+CHUNKSIZE,AJ+AI[ROW]+NROW,len*sizeof(PetscInt));CHKERRQ(ierr); \
166     ierr = PetscMemcpy(new_a,AA,BS2*(AI[ROW]+NROW)*sizeof(datatype));CHKERRQ(ierr); \
167     ierr = PetscMemzero(new_a+BS2*(AI[ROW]+NROW),BS2*CHUNKSIZE*sizeof(datatype));CHKERRQ(ierr); \
168     ierr = PetscMemcpy(new_a+BS2*(AI[ROW]+NROW+CHUNKSIZE),AA+BS2*(AI[ROW]+NROW),BS2*len*sizeof(datatype));CHKERRQ(ierr);  \
169     /* free up old matrix storage */ \
170     ierr              = MatSeqXAIJFreeAIJ(A,&Ain->a,&Ain->j,&Ain->i);CHKERRQ(ierr); \
171     AA                = new_a; \
172     Ain->a            = (MatScalar*) new_a;                   \
173     AI                = Ain->i = new_i; AJ = Ain->j = new_j;  \
174     Ain->singlemalloc = PETSC_TRUE; \
175  \
176     RP          = AJ + AI[ROW]; AP = AA + BS2*AI[ROW]; \
177     RMAX        = AIMAX[ROW] = AIMAX[ROW] + CHUNKSIZE; \
178     Ain->maxnz += BS2*CHUNKSIZE; \
179     Ain->reallocs++; \
180   } \
181 
182 #define MatSeqXAIJReallocateAIJ_structure_only(Amat,AM,BS2,NROW,ROW,COL,RMAX,AI,AJ,RP,AIMAX,NONEW,datatype) \
183   if (NROW >= RMAX) { \
184     Mat_SeqAIJ *Ain = (Mat_SeqAIJ*)Amat->data; \
185     /* there is no extra room in row, therefore enlarge */ \
186     PetscInt CHUNKSIZE = 15,new_nz = AI[AM] + CHUNKSIZE,len,*new_i=0,*new_j=0; \
187  \
188     if (NONEW == -2) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"New nonzero at (%D,%D) caused a malloc\nUse MatSetOption(A, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE) to turn off this check",ROW,COL); \
189     /* malloc new storage space */ \
190     ierr = PetscMalloc1(new_nz,&new_j);CHKERRQ(ierr); \
191     ierr = PetscMalloc1(AM+1,&new_i);CHKERRQ(ierr);\
192  \
193     /* copy over old data into new slots */ \
194     for (ii=0; ii<ROW+1; ii++) {new_i[ii] = AI[ii];} \
195     for (ii=ROW+1; ii<AM+1; ii++) {new_i[ii] = AI[ii]+CHUNKSIZE;} \
196     ierr = PetscMemcpy(new_j,AJ,(AI[ROW]+NROW)*sizeof(PetscInt));CHKERRQ(ierr); \
197     len  = (new_nz - CHUNKSIZE - AI[ROW] - NROW); \
198     ierr = PetscMemcpy(new_j+AI[ROW]+NROW+CHUNKSIZE,AJ+AI[ROW]+NROW,len*sizeof(PetscInt));CHKERRQ(ierr); \
199  \
200     /* free up old matrix storage */ \
201     ierr              = MatSeqXAIJFreeAIJ(A,&Ain->a,&Ain->j,&Ain->i);CHKERRQ(ierr); \
202     Ain->a            = NULL;                   \
203     AI                = Ain->i = new_i; AJ = Ain->j = new_j;  \
204     Ain->singlemalloc = PETSC_FALSE; \
205     Ain->free_a       = PETSC_FALSE;             \
206  \
207     RP          = AJ + AI[ROW];    \
208     RMAX        = AIMAX[ROW] = AIMAX[ROW] + CHUNKSIZE; \
209     Ain->maxnz += BS2*CHUNKSIZE; \
210     Ain->reallocs++; \
211   } \
212 
213 PETSC_INTERN PetscErrorCode MatSeqAIJSetPreallocation_SeqAIJ(Mat,PetscInt,const PetscInt*);
214 PETSC_INTERN PetscErrorCode MatILUFactorSymbolic_SeqAIJ_inplace(Mat,Mat,IS,IS,const MatFactorInfo*);
215 PETSC_INTERN PetscErrorCode MatILUFactorSymbolic_SeqAIJ(Mat,Mat,IS,IS,const MatFactorInfo*);
216 PETSC_INTERN PetscErrorCode MatILUFactorSymbolic_SeqAIJ_ilu0(Mat,Mat,IS,IS,const MatFactorInfo*);
217 
218 PETSC_INTERN PetscErrorCode MatICCFactorSymbolic_SeqAIJ_inplace(Mat,Mat,IS,const MatFactorInfo*);
219 PETSC_INTERN PetscErrorCode MatICCFactorSymbolic_SeqAIJ(Mat,Mat,IS,const MatFactorInfo*);
220 PETSC_INTERN PetscErrorCode MatCholeskyFactorSymbolic_SeqAIJ_inplace(Mat,Mat,IS,const MatFactorInfo*);
221 PETSC_INTERN PetscErrorCode MatCholeskyFactorSymbolic_SeqAIJ(Mat,Mat,IS,const MatFactorInfo*);
222 PETSC_INTERN PetscErrorCode MatCholeskyFactorNumeric_SeqAIJ_inplace(Mat,Mat,const MatFactorInfo*);
223 PETSC_INTERN PetscErrorCode MatCholeskyFactorNumeric_SeqAIJ(Mat,Mat,const MatFactorInfo*);
224 PETSC_INTERN PetscErrorCode MatDuplicate_SeqAIJ(Mat,MatDuplicateOption,Mat*);
225 PETSC_INTERN PetscErrorCode MatCopy_SeqAIJ(Mat,Mat,MatStructure);
226 PETSC_INTERN PetscErrorCode MatMissingDiagonal_SeqAIJ(Mat,PetscBool*,PetscInt*);
227 PETSC_INTERN PetscErrorCode MatMarkDiagonal_SeqAIJ(Mat);
228 PETSC_INTERN PetscErrorCode MatFindZeroDiagonals_SeqAIJ_Private(Mat,PetscInt*,PetscInt**);
229 
230 PETSC_INTERN PetscErrorCode MatMult_SeqAIJ(Mat A,Vec,Vec);
231 PETSC_INTERN PetscErrorCode MatMultAdd_SeqAIJ(Mat A,Vec,Vec,Vec);
232 PETSC_INTERN PetscErrorCode MatMultTranspose_SeqAIJ(Mat A,Vec,Vec);
233 PETSC_INTERN PetscErrorCode MatMultTransposeAdd_SeqAIJ(Mat A,Vec,Vec,Vec);
234 PETSC_INTERN PetscErrorCode MatSOR_SeqAIJ(Mat,Vec,PetscReal,MatSORType,PetscReal,PetscInt,PetscInt,Vec);
235 
236 PETSC_INTERN PetscErrorCode MatSetOption_SeqAIJ(Mat,MatOption,PetscBool);
237 
238 PETSC_INTERN PetscErrorCode MatGetSymbolicTranspose_SeqAIJ(Mat,PetscInt *[],PetscInt *[]);
239 PETSC_INTERN PetscErrorCode MatGetSymbolicTransposeReduced_SeqAIJ(Mat,PetscInt,PetscInt,PetscInt *[],PetscInt *[]);
240 PETSC_INTERN PetscErrorCode MatRestoreSymbolicTranspose_SeqAIJ(Mat,PetscInt *[],PetscInt *[]);
241 PETSC_INTERN PetscErrorCode MatTransposeSymbolic_SeqAIJ(Mat,Mat*);
242 PETSC_INTERN PetscErrorCode MatTranspose_SeqAIJ(Mat,MatReuse,Mat*);
243 PETSC_INTERN PetscErrorCode MatToSymmetricIJ_SeqAIJ(PetscInt,PetscInt*,PetscInt*,PetscBool,PetscInt,PetscInt,PetscInt**,PetscInt**);
244 PETSC_INTERN PetscErrorCode MatLUFactorSymbolic_SeqAIJ_inplace(Mat,Mat,IS,IS,const MatFactorInfo*);
245 PETSC_INTERN PetscErrorCode MatLUFactorSymbolic_SeqAIJ(Mat,Mat,IS,IS,const MatFactorInfo*);
246 PETSC_INTERN PetscErrorCode MatLUFactorNumeric_SeqAIJ_inplace(Mat,Mat,const MatFactorInfo*);
247 PETSC_INTERN PetscErrorCode MatLUFactorNumeric_SeqAIJ(Mat,Mat,const MatFactorInfo*);
248 PETSC_INTERN PetscErrorCode MatLUFactorNumeric_SeqAIJ_InplaceWithPerm(Mat,Mat,const MatFactorInfo*);
249 PETSC_INTERN PetscErrorCode MatLUFactor_SeqAIJ(Mat,IS,IS,const MatFactorInfo*);
250 PETSC_INTERN PetscErrorCode MatSolve_SeqAIJ_inplace(Mat,Vec,Vec);
251 PETSC_INTERN PetscErrorCode MatSolve_SeqAIJ(Mat,Vec,Vec);
252 PETSC_INTERN PetscErrorCode MatSolve_SeqAIJ_Inode_inplace(Mat,Vec,Vec);
253 PETSC_INTERN PetscErrorCode MatSolve_SeqAIJ_Inode(Mat,Vec,Vec);
254 PETSC_INTERN PetscErrorCode MatSolve_SeqAIJ_NaturalOrdering_inplace(Mat,Vec,Vec);
255 PETSC_INTERN PetscErrorCode MatSolve_SeqAIJ_NaturalOrdering(Mat,Vec,Vec);
256 PETSC_INTERN PetscErrorCode MatSolve_SeqAIJ_InplaceWithPerm(Mat,Vec,Vec);
257 PETSC_INTERN PetscErrorCode MatSolveAdd_SeqAIJ_inplace(Mat,Vec,Vec,Vec);
258 PETSC_INTERN PetscErrorCode MatSolveAdd_SeqAIJ(Mat,Vec,Vec,Vec);
259 PETSC_INTERN PetscErrorCode MatSolveTranspose_SeqAIJ_inplace(Mat,Vec,Vec);
260 PETSC_INTERN PetscErrorCode MatSolveTranspose_SeqAIJ(Mat,Vec,Vec);
261 PETSC_INTERN PetscErrorCode MatSolveTransposeAdd_SeqAIJ_inplace(Mat,Vec,Vec,Vec);
262 PETSC_INTERN PetscErrorCode MatSolveTransposeAdd_SeqAIJ(Mat,Vec,Vec,Vec);
263 PETSC_INTERN PetscErrorCode MatMatSolve_SeqAIJ_inplace(Mat,Mat,Mat);
264 PETSC_INTERN PetscErrorCode MatMatSolve_SeqAIJ(Mat,Mat,Mat);
265 PETSC_INTERN PetscErrorCode MatEqual_SeqAIJ(Mat,Mat,PetscBool*);
266 PETSC_INTERN PetscErrorCode MatFDColoringCreate_SeqXAIJ(Mat,ISColoring,MatFDColoring);
267 PETSC_INTERN PetscErrorCode MatFDColoringSetUp_SeqXAIJ(Mat,ISColoring,MatFDColoring);
268 PETSC_INTERN PetscErrorCode MatFDColoringSetUpBlocked_AIJ_Private(Mat,MatFDColoring,PetscInt);
269 PETSC_INTERN PetscErrorCode MatLoad_SeqAIJ(Mat,PetscViewer);
270 PETSC_INTERN PetscErrorCode RegisterApplyPtAPRoutines_Private(Mat);
271 
272 PETSC_INTERN PetscErrorCode MatMatMult_SeqAIJ_SeqAIJ(Mat,Mat,MatReuse,PetscReal,Mat*);
273 PETSC_INTERN PetscErrorCode MatMatMultSymbolic_SeqAIJ_SeqAIJ(Mat,Mat,PetscReal,Mat*);
274 PETSC_INTERN PetscErrorCode MatMatMultSymbolic_SeqDense_SeqAIJ(Mat,Mat,PetscReal,Mat*);
275 PETSC_INTERN PetscErrorCode MatMatMultSymbolic_SeqAIJ_SeqAIJ_Scalable(Mat,Mat,PetscReal,Mat*);
276 PETSC_INTERN PetscErrorCode MatMatMultSymbolic_SeqAIJ_SeqAIJ_Scalable_fast(Mat,Mat,PetscReal,Mat*);
277 PETSC_INTERN PetscErrorCode MatMatMultSymbolic_SeqAIJ_SeqAIJ_Heap(Mat,Mat,PetscReal,Mat*);
278 PETSC_INTERN PetscErrorCode MatMatMultSymbolic_SeqAIJ_SeqAIJ_BTHeap(Mat,Mat,PetscReal,Mat*);
279 PETSC_INTERN PetscErrorCode MatMatMultNumeric_SeqAIJ_SeqAIJ(Mat,Mat,Mat);
280 PETSC_INTERN PetscErrorCode MatMatMultNumeric_SeqDense_SeqAIJ(Mat,Mat,Mat);
281 PETSC_INTERN PetscErrorCode MatMatMultNumeric_SeqAIJ_SeqAIJ_Scalable(Mat,Mat,Mat);
282 
283 PETSC_INTERN PetscErrorCode MatPtAP_SeqAIJ_SeqAIJ(Mat,Mat,MatReuse,PetscReal,Mat*);
284 PETSC_INTERN PetscErrorCode MatPtAPSymbolic_SeqAIJ_SeqAIJ_DenseAxpy(Mat,Mat,PetscReal,Mat*);
285 PETSC_INTERN PetscErrorCode MatPtAPSymbolic_SeqAIJ_SeqAIJ_SparseAxpy(Mat,Mat,PetscReal,Mat*);
286 PETSC_INTERN PetscErrorCode MatPtAPNumeric_SeqAIJ_SeqAIJ(Mat,Mat,Mat);
287 PETSC_INTERN PetscErrorCode MatPtAPNumeric_SeqAIJ_SeqAIJ_SparseAxpy(Mat,Mat,Mat);
288 
289 PETSC_INTERN PetscErrorCode MatRARtSymbolic_SeqAIJ_SeqAIJ(Mat,Mat,PetscReal,Mat*);
290 PETSC_INTERN PetscErrorCode MatRARtSymbolic_SeqAIJ_SeqAIJ_matmattransposemult(Mat,Mat,PetscReal,Mat*);
291 PETSC_INTERN PetscErrorCode MatRARtSymbolic_SeqAIJ_SeqAIJ_colorrart(Mat,Mat,PetscReal,Mat*);
292 PETSC_INTERN PetscErrorCode MatRARtNumeric_SeqAIJ_SeqAIJ(Mat,Mat,Mat);
293 PETSC_INTERN PetscErrorCode MatRARtNumeric_SeqAIJ_SeqAIJ_matmattransposemult(Mat,Mat,Mat);
294 PETSC_INTERN PetscErrorCode MatRARtNumeric_SeqAIJ_SeqAIJ_colorrart(Mat,Mat,Mat);
295 
296 PETSC_INTERN PetscErrorCode MatTransposeMatMult_SeqAIJ_SeqAIJ(Mat,Mat,MatReuse,PetscReal,Mat*);
297 PETSC_INTERN PetscErrorCode MatTransposeMatMultSymbolic_SeqAIJ_SeqAIJ(Mat,Mat,PetscReal,Mat*);
298 PETSC_INTERN PetscErrorCode MatTransposeMatMultNumeric_SeqAIJ_SeqAIJ(Mat,Mat,Mat);
299 
300 PETSC_INTERN PetscErrorCode MatTransposeMatMult_SeqAIJ_SeqDense(Mat,Mat,MatReuse,PetscReal,Mat*);
301 PETSC_INTERN PetscErrorCode MatTransposeMatMultSymbolic_SeqAIJ_SeqDense(Mat,Mat,PetscReal,Mat*);
302 PETSC_INTERN PetscErrorCode MatTransposeMatMultNumeric_SeqAIJ_SeqDense(Mat,Mat,Mat);
303 
304 PETSC_INTERN PetscErrorCode MatMatTransposeMult_SeqAIJ_SeqAIJ(Mat,Mat,MatReuse,PetscReal,Mat*);
305 PETSC_INTERN PetscErrorCode MatMatTransposeMultSymbolic_SeqAIJ_SeqAIJ(Mat,Mat,PetscReal,Mat*);
306 PETSC_INTERN PetscErrorCode MatMatTransposeMultNumeric_SeqAIJ_SeqAIJ(Mat,Mat,Mat);
307 PETSC_INTERN PetscErrorCode MatTransposeColoringCreate_SeqAIJ(Mat,ISColoring,MatTransposeColoring);
308 PETSC_INTERN PetscErrorCode MatTransColoringApplySpToDen_SeqAIJ(MatTransposeColoring,Mat,Mat);
309 PETSC_INTERN PetscErrorCode MatTransColoringApplyDenToSp_SeqAIJ(MatTransposeColoring,Mat,Mat);
310 
311 PETSC_INTERN PetscErrorCode MatMatMatMult_SeqAIJ_SeqAIJ_SeqAIJ(Mat,Mat,Mat,MatReuse,PetscReal,Mat*);
312 PETSC_INTERN PetscErrorCode MatMatMatMultSymbolic_SeqAIJ_SeqAIJ_SeqAIJ(Mat,Mat,Mat,PetscReal,Mat*);
313 PETSC_INTERN PetscErrorCode MatMatMatMultNumeric_SeqAIJ_SeqAIJ_SeqAIJ(Mat,Mat,Mat,Mat);
314 
315 PETSC_INTERN PetscErrorCode MatSetValues_SeqAIJ(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode);
316 PETSC_INTERN PetscErrorCode MatGetRow_SeqAIJ(Mat,PetscInt,PetscInt*,PetscInt**,PetscScalar**);
317 PETSC_INTERN PetscErrorCode MatRestoreRow_SeqAIJ(Mat,PetscInt,PetscInt*,PetscInt**,PetscScalar**);
318 PETSC_INTERN PetscErrorCode MatScale_SeqAIJ(Mat,PetscScalar);
319 PETSC_INTERN PetscErrorCode MatDiagonalScale_SeqAIJ(Mat,Vec,Vec);
320 PETSC_INTERN PetscErrorCode MatDiagonalSet_SeqAIJ(Mat,Vec,InsertMode);
321 PETSC_INTERN PetscErrorCode MatAXPY_SeqAIJ(Mat,PetscScalar,Mat,MatStructure);
322 PETSC_INTERN PetscErrorCode MatGetRowIJ_SeqAIJ(Mat,PetscInt,PetscBool,PetscBool,PetscInt*,const PetscInt *[],const PetscInt *[],PetscBool*);
323 PETSC_INTERN PetscErrorCode MatRestoreRowIJ_SeqAIJ(Mat,PetscInt,PetscBool,PetscBool,PetscInt*,const PetscInt *[],const PetscInt *[],PetscBool*);
324 PETSC_INTERN PetscErrorCode MatGetColumnIJ_SeqAIJ(Mat,PetscInt,PetscBool,PetscBool,PetscInt*,const PetscInt *[],const PetscInt *[],PetscBool*);
325 PETSC_INTERN PetscErrorCode MatRestoreColumnIJ_SeqAIJ(Mat,PetscInt,PetscBool,PetscBool,PetscInt*,const PetscInt *[],const PetscInt *[],PetscBool*);
326 PETSC_INTERN PetscErrorCode MatGetColumnIJ_SeqAIJ_Color(Mat,PetscInt,PetscBool,PetscBool,PetscInt*,const PetscInt *[],const PetscInt *[],PetscInt *[],PetscBool*);
327 PETSC_INTERN PetscErrorCode MatRestoreColumnIJ_SeqAIJ_Color(Mat,PetscInt,PetscBool,PetscBool,PetscInt*,const PetscInt *[],const PetscInt *[],PetscInt *[],PetscBool*);
328 PETSC_INTERN PetscErrorCode MatDestroy_SeqAIJ(Mat);
329 PETSC_INTERN PetscErrorCode MatSetUp_SeqAIJ(Mat);
330 PETSC_INTERN PetscErrorCode MatView_SeqAIJ(Mat,PetscViewer);
331 
332 PETSC_INTERN PetscErrorCode MatSeqAIJInvalidateDiagonal(Mat);
333 PETSC_INTERN PetscErrorCode MatSeqAIJInvalidateDiagonal_Inode(Mat);
334 PETSC_INTERN PetscErrorCode MatSeqAIJCheckInode(Mat);
335 PETSC_INTERN PetscErrorCode MatSeqAIJCheckInode_FactorLU(Mat);
336 
337 PETSC_INTERN PetscErrorCode MatAXPYGetPreallocation_SeqAIJ(Mat,Mat,PetscInt*);
338 
339 PETSC_INTERN PetscErrorCode MatMatMatMult_Transpose_AIJ_AIJ(Mat,Mat,Mat,MatReuse,PetscReal,Mat*);
340 PETSC_EXTERN PetscErrorCode MatlabEnginePut_SeqAIJ(PetscObject,void*);
341 PETSC_EXTERN PetscErrorCode MatlabEngineGet_SeqAIJ(PetscObject,void*);
342 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqSBAIJ(Mat,MatType,MatReuse,Mat*);
343 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqBAIJ(Mat,MatType,MatReuse,Mat*);
344 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqDense(Mat,MatType,MatReuse,Mat*);
345 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJCRL(Mat,MatType,MatReuse,Mat*);
346 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_Elemental(Mat,MatType,MatReuse,Mat*);
347 PETSC_INTERN PetscErrorCode MatConvert_AIJ_HYPRE(Mat,MatType,MatReuse,Mat*);
348 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJPERM(Mat,MatType,MatReuse,Mat*);
349 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJMKL(Mat,MatType,MatReuse,Mat*);
350 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJViennaCL(Mat,MatType,MatReuse,Mat*);
351 PETSC_INTERN PetscErrorCode MatReorderForNonzeroDiagonal_SeqAIJ(Mat,PetscReal,IS,IS);
352 PETSC_INTERN PetscErrorCode MatMatMult_SeqDense_SeqAIJ(Mat,Mat,MatReuse,PetscReal,Mat*);
353 PETSC_INTERN PetscErrorCode MatRARt_SeqAIJ_SeqAIJ(Mat,Mat,MatReuse,PetscReal,Mat*);
354 PETSC_EXTERN PetscErrorCode MatCreate_SeqAIJ(Mat);
355 PETSC_INTERN PetscErrorCode MatAssemblyEnd_SeqAIJ(Mat,MatAssemblyType);
356 
357 PETSC_INTERN PetscErrorCode MatAXPYGetPreallocation_SeqX_private(PetscInt,const PetscInt*,const PetscInt*,const PetscInt*,const PetscInt*,PetscInt*);
358 PETSC_INTERN PetscErrorCode MatCreateMPIMatConcatenateSeqMat_SeqAIJ(MPI_Comm,Mat,PetscInt,MatReuse,Mat*);
359 PETSC_INTERN PetscErrorCode MatCreateMPIMatConcatenateSeqMat_MPIAIJ(MPI_Comm,Mat,PetscInt,MatReuse,Mat*);
360 
361 PETSC_INTERN PetscErrorCode MatSetSeqMat_SeqAIJ(Mat,IS,IS,MatStructure,Mat);
362 PETSC_INTERN PetscErrorCode MatDestroySubMatrix_Private(Mat_SubSppt*);
363 PETSC_INTERN PetscErrorCode MatDestroySubMatrix_SeqAIJ(Mat);
364 PETSC_INTERN PetscErrorCode MatDestroySubMatrix_Dummy(Mat);
365 PETSC_INTERN PetscErrorCode MatCreateSubMatrix_SeqAIJ(Mat,IS,IS,PetscInt,MatReuse,Mat*);
366 
367 /*
368     PetscSparseDenseMinusDot - The inner kernel of triangular solves and Gauss-Siedel smoothing. \sum_i xv[i] * r[xi[i]] for CSR storage
369 
370   Input Parameters:
371 +  nnz - the number of entries
372 .  r - the array of vector values
373 .  xv - the matrix values for the row
374 -  xi - the column indices of the nonzeros in the row
375 
376   Output Parameter:
377 .  sum - negative the sum of results
378 
379   PETSc compile flags:
380 +   PETSC_KERNEL_USE_UNROLL_4 -   don't use this; it changes nnz and hence is WRONG
381 -   PETSC_KERNEL_USE_UNROLL_2 -
382 
383 .seealso: PetscSparseDensePlusDot()
384 
385 */
386 #if defined(PETSC_KERNEL_USE_UNROLL_4)
387 #define PetscSparseDenseMinusDot(sum,r,xv,xi,nnz) { \
388     if (nnz > 0) { \
389       switch (nnz & 0x3) { \
390       case 3: sum -= *xv++ *r[*xi++]; \
391       case 2: sum -= *xv++ *r[*xi++]; \
392       case 1: sum -= *xv++ *r[*xi++]; \
393         nnz       -= 4;} \
394       while (nnz > 0) { \
395         sum -=  xv[0] * r[xi[0]] - xv[1] * r[xi[1]] - \
396                xv[2] * r[xi[2]] - xv[3] * r[xi[3]]; \
397         xv += 4; xi += 4; nnz -= 4; }}}
398 
399 #elif defined(PETSC_KERNEL_USE_UNROLL_2)
400 #define PetscSparseDenseMinusDot(sum,r,xv,xi,nnz) { \
401     PetscInt __i,__i1,__i2; \
402     for (__i=0; __i<nnz-1; __i+=2) {__i1 = xi[__i]; __i2=xi[__i+1]; \
403                                     sum -= (xv[__i]*r[__i1] + xv[__i+1]*r[__i2]);} \
404     if (nnz & 0x1) sum -= xv[__i] * r[xi[__i]];}
405 
406 #else
407 #define PetscSparseDenseMinusDot(sum,r,xv,xi,nnz) { \
408     PetscInt __i; \
409     for (__i=0; __i<nnz; __i++) sum -= xv[__i] * r[xi[__i]];}
410 #endif
411 
412 
413 
414 /*
415     PetscSparseDensePlusDot - The inner kernel of matrix-vector product \sum_i xv[i] * r[xi[i]] for CSR storage
416 
417   Input Parameters:
418 +  nnz - the number of entries
419 .  r - the array of vector values
420 .  xv - the matrix values for the row
421 -  xi - the column indices of the nonzeros in the row
422 
423   Output Parameter:
424 .  sum - the sum of results
425 
426   PETSc compile flags:
427 +   PETSC_KERNEL_USE_UNROLL_4 -  don't use this; it changes nnz and hence is WRONG
428 -   PETSC_KERNEL_USE_UNROLL_2 -
429 
430 .seealso: PetscSparseDenseMinusDot()
431 
432 */
433 #if defined(PETSC_KERNEL_USE_UNROLL_4)
434 #define PetscSparseDensePlusDot(sum,r,xv,xi,nnz) { \
435     if (nnz > 0) { \
436       switch (nnz & 0x3) { \
437       case 3: sum += *xv++ *r[*xi++]; \
438       case 2: sum += *xv++ *r[*xi++]; \
439       case 1: sum += *xv++ *r[*xi++]; \
440         nnz       -= 4;} \
441       while (nnz > 0) { \
442         sum +=  xv[0] * r[xi[0]] + xv[1] * r[xi[1]] + \
443                xv[2] * r[xi[2]] + xv[3] * r[xi[3]]; \
444         xv += 4; xi += 4; nnz -= 4; }}}
445 
446 #elif defined(PETSC_KERNEL_USE_UNROLL_2)
447 #define PetscSparseDensePlusDot(sum,r,xv,xi,nnz) { \
448     PetscInt __i,__i1,__i2; \
449     for (__i=0; __i<nnz-1; __i+=2) {__i1 = xi[__i]; __i2=xi[__i+1]; \
450                                     sum += (xv[__i]*r[__i1] + xv[__i+1]*r[__i2]);} \
451     if (nnz & 0x1) sum += xv[__i] * r[xi[__i]];}
452 
453 #else
454 #define PetscSparseDensePlusDot(sum,r,xv,xi,nnz) { \
455     PetscInt __i; \
456     for (__i=0; __i<nnz; __i++) sum += xv[__i] * r[xi[__i]];}
457 #endif
458 
459 
460 /*
461     PetscSparseDenseMaxDot - The inner kernel of a modified matrix-vector product \max_i xv[i] * r[xi[i]] for CSR storage
462 
463   Input Parameters:
464 +  nnz - the number of entries
465 .  r - the array of vector values
466 .  xv - the matrix values for the row
467 -  xi - the column indices of the nonzeros in the row
468 
469   Output Parameter:
470 .  max - the max of results
471 
472 .seealso: PetscSparseDensePlusDot(), PetscSparseDenseMinusDot()
473 
474 */
475 #define PetscSparseDenseMaxDot(max,r,xv,xi,nnz) { \
476     PetscInt __i; \
477     for (__i=0; __i<nnz; __i++) max = PetscMax(PetscRealPart(max), PetscRealPart(xv[__i] * r[xi[__i]]));}
478 
479 /*
480  Add column indices into table for counting the max nonzeros of merged rows
481  */
482 #define MatRowMergeMax_SeqAIJ(mat,nrows,ta) {       \
483     PetscInt _j,_row,_nz,*_col;                     \
484     if (mat) { \
485       for (_row=0; _row<nrows; _row++) {   \
486         _nz = mat->i[_row+1] - mat->i[_row];    \
487         for (_j=0; _j<_nz; _j++) {               \
488           _col = _j + mat->j + mat->i[_row];       \
489           PetscTableAdd(ta,*_col+1,1,INSERT_VALUES);                    \
490         }                                                               \
491       }                                                                 \
492     }    \
493 }
494 
495 /*
496  Add column indices into table for counting the nonzeros of merged rows
497  */
498 #define MatMergeRows_SeqAIJ(mat,nrows,rows,ta) {    \
499   PetscInt _j,_row,_nz,*_col,_i;                      \
500     for (_i=0; _i<nrows; _i++) {\
501       _row = rows[_i]; \
502       _nz = mat->i[_row+1] - mat->i[_row]; \
503       for (_j=0; _j<_nz; _j++) {                \
504         _col = _j + mat->j + mat->i[_row];       \
505         PetscTableAdd(ta,*_col+1,1,INSERT_VALUES); \
506       }                                                                 \
507     }                                                                   \
508 }
509 
510 #endif
511