1 /* 2 Defines basic operations for the MATSEQAIJSELL matrix class. 3 This class is derived from the MATAIJCLASS, but maintains a "shadow" copy 4 of the matrix stored in MATSEQSELL format, which is used as appropriate for 5 performing operations for which this format is more suitable. 6 */ 7 8 #include <../src/mat/impls/aij/seq/aij.h> 9 #include <../src/mat/impls/sell/seq/sell.h> 10 11 typedef struct { 12 Mat S; /* The SELL formatted "shadow" matrix. */ 13 PetscBool eager_shadow; 14 PetscObjectState state; /* State of the matrix when shadow matrix was last constructed. */ 15 } Mat_SeqAIJSELL; 16 17 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJSELL_SeqAIJ(Mat A,MatType type,MatReuse reuse,Mat *newmat) 18 { 19 /* This routine is only called to convert a MATAIJSELL to its base PETSc type, */ 20 /* so we will ignore 'MatType type'. */ 21 PetscErrorCode ierr; 22 Mat B = *newmat; 23 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 24 25 PetscFunctionBegin; 26 if (reuse == MAT_INITIAL_MATRIX) { 27 ierr = MatDuplicate(A,MAT_COPY_VALUES,&B);CHKERRQ(ierr); 28 } 29 30 /* Reset the original function pointers. */ 31 B->ops->duplicate = MatDuplicate_SeqAIJ; 32 B->ops->assemblyend = MatAssemblyEnd_SeqAIJ; 33 B->ops->destroy = MatDestroy_SeqAIJ; 34 B->ops->mult = MatMult_SeqAIJ; 35 B->ops->multtranspose = MatMultTranspose_SeqAIJ; 36 B->ops->multadd = MatMultAdd_SeqAIJ; 37 B->ops->multtransposeadd = MatMultTransposeAdd_SeqAIJ; 38 39 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_seqaijsell_seqaij_C",NULL);CHKERRQ(ierr); 40 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMult_seqdense_seqaijsell_C",NULL);CHKERRQ(ierr); 41 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultSymbolic_seqdense_seqaijsell_C",NULL);CHKERRQ(ierr); 42 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultNumeric_seqdense_seqaijsell_C",NULL);CHKERRQ(ierr); 43 44 if (reuse == MAT_INITIAL_MATRIX) aijsell = (Mat_SeqAIJSELL*)B->spptr; 45 46 /* Clean up the Mat_SeqAIJSELL data structure. */ 47 if(aijsell->S) { 48 ierr = MatDestroy(&aijsell->S);CHKERRQ(ierr); 49 } 50 ierr = PetscFree(B->spptr);CHKERRQ(ierr); 51 52 /* Change the type of B to MATSEQAIJ. */ 53 ierr = PetscObjectChangeTypeName((PetscObject)B, MATSEQAIJ);CHKERRQ(ierr); 54 55 *newmat = B; 56 PetscFunctionReturn(0); 57 } 58 59 PetscErrorCode MatDestroy_SeqAIJSELL(Mat A) 60 { 61 PetscErrorCode ierr; 62 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 63 64 PetscFunctionBegin; 65 66 /* If MatHeaderMerge() was used, then this SeqAIJSELL matrix will not have an 67 * spptr pointer. */ 68 if (aijsell) { 69 /* Clean up everything in the Mat_SeqAIJSELL data structure, then free A->spptr. */ 70 if (aijsell->S) { 71 ierr = MatDestroy(&aijsell->S);CHKERRQ(ierr); 72 } 73 ierr = PetscFree(A->spptr);CHKERRQ(ierr); 74 } 75 76 /* Change the type of A back to SEQAIJ and use MatDestroy_SeqAIJ() 77 * to destroy everything that remains. */ 78 ierr = PetscObjectChangeTypeName((PetscObject)A, MATSEQAIJ);CHKERRQ(ierr); 79 /* Note that I don't call MatSetType(). I believe this is because that 80 * is only to be called when *building* a matrix. I could be wrong, but 81 * that is how things work for the SuperLU matrix class. */ 82 ierr = MatDestroy_SeqAIJ(A);CHKERRQ(ierr); 83 PetscFunctionReturn(0); 84 } 85 86 /* Build or update the shadow matrix if and only if needed. 87 * We track the ObjectState to determine when this needs to be done. */ 88 PETSC_INTERN PetscErrorCode MatSeqAIJSELL_build_shadow(Mat A) 89 { 90 PetscErrorCode ierr; 91 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 92 PetscObjectState state; 93 94 PetscFunctionBegin; 95 96 ierr = PetscObjectStateGet((PetscObject)A,&state);CHKERRQ(ierr); 97 if (aijsell->S && aijsell->state == state) { 98 /* The existing shadow matrix is up-to-date, so simply exit. */ 99 PetscFunctionReturn(0); 100 } 101 102 if (aijsell->S) { 103 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_REUSE_MATRIX,&aijsell->S);CHKERRQ(ierr); 104 } else { 105 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_INITIAL_MATRIX,&aijsell->S);CHKERRQ(ierr); 106 } 107 108 /* Record the ObjectState so that we can tell when the shadow matrix needs updating */ 109 ierr = PetscObjectStateGet((PetscObject)A,&aijsell->state);CHKERRQ(ierr); 110 111 PetscFunctionReturn(0); 112 } 113 114 PetscErrorCode MatDuplicate_SeqAIJSELL(Mat A, MatDuplicateOption op, Mat *M) 115 { 116 PetscErrorCode ierr; 117 Mat_SeqAIJSELL *aijsell; 118 Mat_SeqAIJSELL *aijsell_dest; 119 120 PetscFunctionBegin; 121 ierr = MatDuplicate_SeqAIJ(A,op,M);CHKERRQ(ierr); 122 aijsell = (Mat_SeqAIJSELL*) A->spptr; 123 aijsell_dest = (Mat_SeqAIJSELL*) (*M)->spptr; 124 ierr = PetscMemcpy(aijsell_dest,aijsell,sizeof(Mat_SeqAIJSELL));CHKERRQ(ierr); 125 /* We don't duplicate the shadow matrix -- that will be constructed as needed. */ 126 aijsell_dest->S = NULL; 127 /* TODO: Have the shadow matrix be built now if eager_shadow is set to true. */ 128 PetscFunctionReturn(0); 129 } 130 131 PetscErrorCode MatAssemblyEnd_SeqAIJSELL(Mat A, MatAssemblyType mode) 132 { 133 PetscErrorCode ierr; 134 Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data; 135 Mat_SeqAIJSELL *aijsell; 136 137 PetscFunctionBegin; 138 if (mode == MAT_FLUSH_ASSEMBLY) PetscFunctionReturn(0); 139 140 /* I disable the use of the inode routines so that the AIJSELL ones will be 141 * used instead, but I wonder if it might make sense (and is feasible) to 142 * use some of them. */ 143 a->inode.use = PETSC_FALSE; 144 145 /* Since a MATSEQAIJSELL matrix is really just a MATSEQAIJ with some 146 * extra information and some different methods, call the AssemblyEnd 147 * routine for a MATSEQAIJ. 148 * I'm not sure if this is the best way to do this, but it avoids 149 * a lot of code duplication. */ 150 151 ierr = MatAssemblyEnd_SeqAIJ(A, mode);CHKERRQ(ierr); 152 153 /* If the user has requested "eager" shadowing, create the SELL shadow matrix (if needed; the function checks). 154 * (The default is to take a "lazy" approach, deferring this until something like MatMult() is called.) */ 155 aijsell = (Mat_SeqAIJSELL*) A->spptr; 156 if (aijsell->eager_shadow) { 157 /* TODO: Construct the shadow matrix here. */ 158 } 159 160 PetscFunctionReturn(0); 161 } 162 163 PetscErrorCode MatMult_SeqAIJSELL(Mat A,Vec xx,Vec yy) 164 { 165 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 166 PetscErrorCode ierr; 167 168 PetscFunctionBegin; 169 170 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 171 ierr = MatMult_SeqSELL(aijsell->S,xx,yy);CHKERRQ(ierr); 172 173 PetscFunctionReturn(0); 174 } 175 176 /* MatConvert_SeqAIJ_SeqAIJSELL converts a SeqAIJ matrix into a 177 * SeqAIJSELL matrix. This routine is called by the MatCreate_SeqAIJSELL() 178 * routine, but can also be used to convert an assembled SeqAIJ matrix 179 * into a SeqAIJSELL one. */ 180 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJSELL(Mat A,MatType type,MatReuse reuse,Mat *newmat) 181 { 182 PetscErrorCode ierr; 183 Mat B = *newmat; 184 Mat_SeqAIJ *b; 185 Mat_SeqAIJSELL *aijsell; 186 PetscBool set; 187 PetscBool sametype; 188 189 PetscFunctionBegin; 190 if (reuse == MAT_INITIAL_MATRIX) { 191 ierr = MatDuplicate(A,MAT_COPY_VALUES,&B);CHKERRQ(ierr); 192 } 193 194 ierr = PetscObjectTypeCompare((PetscObject)A,type,&sametype);CHKERRQ(ierr); 195 if (sametype) PetscFunctionReturn(0); 196 197 ierr = PetscNewLog(B,&aijsell);CHKERRQ(ierr); 198 b = (Mat_SeqAIJ*) B->data; 199 B->spptr = (void*) aijsell; 200 201 /* Disable use of the inode routines so that the AIJSELL ones will be used instead. 202 * This happens in MatAssemblyEnd_SeqAIJSELL as well, but the assembly end may not be called, so set it here, too. 203 * As noted elsewhere, I wonder if it might make sense and be feasible to use some of the inode routines. */ 204 b->inode.use = PETSC_FALSE; 205 206 /* Set function pointers for methods that we inherit from AIJ but override. 207 * We also parse some command line options below, since those determine some of the methods we point to. */ 208 B->ops->duplicate = MatDuplicate_SeqAIJSELL; 209 B->ops->assemblyend = MatAssemblyEnd_SeqAIJSELL; 210 B->ops->destroy = MatDestroy_SeqAIJSELL; 211 212 aijsell->S = NULL; 213 aijsell->eager_shadow = PETSC_FALSE; 214 215 /* Parse command line options. */ 216 ierr = PetscOptionsBegin(PetscObjectComm((PetscObject)A),((PetscObject)A)->prefix,"AIJSELL Options","Mat");CHKERRQ(ierr); 217 ierr = PetscOptionsBool("-mat_aijsell_eager_shadow","Eager Shadowing","None",(PetscBool)aijsell->eager_shadow,(PetscBool*)&aijsell->eager_shadow,&set);CHKERRQ(ierr); 218 ierr = PetscOptionsEnd();CHKERRQ(ierr); 219 220 /* If A has already been assembled and eager shadowing is specified, build the shadow matrix. */ 221 if (A->assembled) { 222 /* TODO: Have the shadow matrix for B be built now if eager_shadow is set to true. */ 223 } 224 225 B->ops->mult = MatMult_SeqAIJSELL; 226 /* Commenting these out for now, as these functions are not yet implemented. 227 B->ops->multtranspose = MatMultTranspose_SeqAIJSELL; 228 B->ops->multadd = MatMultAdd_SeqAIJSELL; 229 B->ops->multtransposeadd = MatMultTransposeAdd_SeqAIJSELL; 230 */ 231 232 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_seqaijsell_seqaij_C",MatConvert_SeqAIJSELL_SeqAIJ);CHKERRQ(ierr); 233 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMult_seqdense_seqaijsell_C",MatMatMult_SeqDense_SeqAIJ);CHKERRQ(ierr); 234 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultSymbolic_seqdense_seqaijsell_C",MatMatMultSymbolic_SeqDense_SeqAIJ);CHKERRQ(ierr); 235 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMatMultNumeric_seqdense_seqaijsell_C",MatMatMultNumeric_SeqDense_SeqAIJ);CHKERRQ(ierr); 236 237 ierr = PetscObjectChangeTypeName((PetscObject)B,MATSEQAIJSELL);CHKERRQ(ierr); 238 *newmat = B; 239 PetscFunctionReturn(0); 240 } 241 242 /*@C 243 MatCreateSeqAIJSELL - Creates a sparse matrix of type SEQAIJSELL. 244 This type inherits from AIJ and is largely identical, but keeps a "shadow" 245 copy of the matrix in SEQSELL format, which is used when performing 246 operations for which this format is more suitable. 247 248 Collective on MPI_Comm 249 250 Input Parameters: 251 + comm - MPI communicator, set to PETSC_COMM_SELF 252 . m - number of rows 253 . n - number of columns 254 . nz - number of nonzeros per row (same for all rows) 255 - nnz - array containing the number of nonzeros in the various rows 256 (possibly different for each row) or NULL 257 258 Output Parameter: 259 . A - the matrix 260 261 Options Database Keys: 262 . -mat_aijsell_eager_shadow - Construct shadow matrix upon matrix assembly; default is to take a "lazy" approach, performing this step the first time the matrix is applied 263 264 Notes: 265 If nnz is given then nz is ignored 266 267 Level: intermediate 268 269 .keywords: matrix, sparse, parallel 270 271 .seealso: MatCreate(), MatCreateMPIAIJSELL(), MatSetValues() 272 @*/ 273 PetscErrorCode MatCreateSeqAIJSELL(MPI_Comm comm,PetscInt m,PetscInt n,PetscInt nz,const PetscInt nnz[],Mat *A) 274 { 275 PetscErrorCode ierr; 276 277 PetscFunctionBegin; 278 ierr = MatCreate(comm,A);CHKERRQ(ierr); 279 ierr = MatSetSizes(*A,m,n,m,n);CHKERRQ(ierr); 280 ierr = MatSetType(*A,MATSEQAIJSELL);CHKERRQ(ierr); 281 ierr = MatSeqAIJSetPreallocation_SeqAIJ(*A,nz,nnz);CHKERRQ(ierr); 282 PetscFunctionReturn(0); 283 } 284 285 PETSC_EXTERN PetscErrorCode MatCreate_SeqAIJSELL(Mat A) 286 { 287 PetscErrorCode ierr; 288 289 PetscFunctionBegin; 290 ierr = MatSetType(A,MATSEQAIJ);CHKERRQ(ierr); 291 ierr = MatConvert_SeqAIJ_SeqAIJSELL(A,MATSEQAIJSELL,MAT_INPLACE_MATRIX,&A);CHKERRQ(ierr); 292 PetscFunctionReturn(0); 293 } 294