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 B->ops->sor = MatSOR_SeqAIJ; 39 40 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_seqaijsell_seqaij_C",NULL);CHKERRQ(ierr); 41 42 if (reuse == MAT_INITIAL_MATRIX) aijsell = (Mat_SeqAIJSELL*)B->spptr; 43 44 /* Clean up the Mat_SeqAIJSELL data structure. 45 * Note that MatDestroy() simply returns if passed a NULL value, so it's OK to call even if the shadow matrix was never constructed. */ 46 ierr = MatDestroy(&aijsell->S);CHKERRQ(ierr); 47 ierr = PetscFree(B->spptr);CHKERRQ(ierr); 48 49 /* Change the type of B to MATSEQAIJ. */ 50 ierr = PetscObjectChangeTypeName((PetscObject)B, MATSEQAIJ);CHKERRQ(ierr); 51 52 *newmat = B; 53 PetscFunctionReturn(0); 54 } 55 56 PetscErrorCode MatDestroy_SeqAIJSELL(Mat A) 57 { 58 PetscErrorCode ierr; 59 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 60 61 PetscFunctionBegin; 62 63 /* If MatHeaderMerge() was used, then this SeqAIJSELL matrix will not have an 64 * spptr pointer. */ 65 if (aijsell) { 66 /* Clean up everything in the Mat_SeqAIJSELL data structure, then free A->spptr. */ 67 ierr = MatDestroy(&aijsell->S);CHKERRQ(ierr); 68 ierr = PetscFree(A->spptr);CHKERRQ(ierr); 69 } 70 71 /* Change the type of A back to SEQAIJ and use MatDestroy_SeqAIJ() 72 * to destroy everything that remains. */ 73 ierr = PetscObjectChangeTypeName((PetscObject)A, MATSEQAIJ);CHKERRQ(ierr); 74 /* Note that I don't call MatSetType(). I believe this is because that 75 * is only to be called when *building* a matrix. I could be wrong, but 76 * that is how things work for the SuperLU matrix class. */ 77 ierr = MatDestroy_SeqAIJ(A);CHKERRQ(ierr); 78 PetscFunctionReturn(0); 79 } 80 81 /* Build or update the shadow matrix if and only if needed. 82 * We track the ObjectState to determine when this needs to be done. */ 83 PETSC_INTERN PetscErrorCode MatSeqAIJSELL_build_shadow(Mat A) 84 { 85 PetscErrorCode ierr; 86 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*) A->spptr; 87 PetscObjectState state; 88 89 PetscFunctionBegin; 90 ierr = PetscObjectStateGet((PetscObject)A,&state);CHKERRQ(ierr); 91 if (aijsell->S && aijsell->state == state) { 92 /* The existing shadow matrix is up-to-date, so simply exit. */ 93 PetscFunctionReturn(0); 94 } 95 96 ierr = PetscLogEventBegin(MAT_Convert,A,0,0,0);CHKERRQ(ierr); 97 if (aijsell->S) { 98 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_REUSE_MATRIX,&aijsell->S);CHKERRQ(ierr); 99 } else { 100 ierr = MatConvert_SeqAIJ_SeqSELL(A,MATSEQSELL,MAT_INITIAL_MATRIX,&aijsell->S);CHKERRQ(ierr); 101 } 102 ierr = PetscLogEventEnd(MAT_Convert,A,0,0,0);CHKERRQ(ierr); 103 104 /* Record the ObjectState so that we can tell when the shadow matrix needs updating */ 105 ierr = PetscObjectStateGet((PetscObject)A,&aijsell->state);CHKERRQ(ierr); 106 107 PetscFunctionReturn(0); 108 } 109 110 PetscErrorCode MatDuplicate_SeqAIJSELL(Mat A, MatDuplicateOption op, Mat *M) 111 { 112 PetscErrorCode ierr; 113 Mat_SeqAIJSELL *aijsell; 114 Mat_SeqAIJSELL *aijsell_dest; 115 116 PetscFunctionBegin; 117 ierr = MatDuplicate_SeqAIJ(A,op,M);CHKERRQ(ierr); 118 aijsell = (Mat_SeqAIJSELL*) A->spptr; 119 aijsell_dest = (Mat_SeqAIJSELL*) (*M)->spptr; 120 ierr = PetscArraycpy(aijsell_dest,aijsell,1);CHKERRQ(ierr); 121 /* We don't duplicate the shadow matrix -- that will be constructed as needed. */ 122 aijsell_dest->S = NULL; 123 if (aijsell->eager_shadow) { 124 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 125 } 126 PetscFunctionReturn(0); 127 } 128 129 PetscErrorCode MatAssemblyEnd_SeqAIJSELL(Mat A, MatAssemblyType mode) 130 { 131 PetscErrorCode ierr; 132 Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data; 133 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*)A->spptr; 134 135 PetscFunctionBegin; 136 if (mode == MAT_FLUSH_ASSEMBLY) PetscFunctionReturn(0); 137 138 /* I disable the use of the inode routines so that the AIJSELL ones will be 139 * used instead, but I wonder if it might make sense (and is feasible) to 140 * use some of them. */ 141 a->inode.use = PETSC_FALSE; 142 143 /* Since a MATSEQAIJSELL matrix is really just a MATSEQAIJ with some 144 * extra information and some different methods, call the AssemblyEnd 145 * routine for a MATSEQAIJ. 146 * I'm not sure if this is the best way to do this, but it avoids 147 * a lot of code duplication. */ 148 149 ierr = MatAssemblyEnd_SeqAIJ(A, mode);CHKERRQ(ierr); 150 151 /* If the user has requested "eager" shadowing, create the SELL shadow matrix (if needed; the function checks). 152 * (The default is to take a "lazy" approach, deferring this until something like MatMult() is called.) */ 153 if (aijsell->eager_shadow) { 154 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 155 } 156 157 PetscFunctionReturn(0); 158 } 159 160 PetscErrorCode MatMult_SeqAIJSELL(Mat A,Vec xx,Vec yy) 161 { 162 Mat_SeqAIJSELL *aijsell = (Mat_SeqAIJSELL*)A->spptr; 163 PetscErrorCode ierr; 164 165 PetscFunctionBegin; 166 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 167 ierr = MatMult_SeqSELL(aijsell->S,xx,yy);CHKERRQ(ierr); 168 PetscFunctionReturn(0); 169 } 170 171 PetscErrorCode MatMultTranspose_SeqAIJSELL(Mat A,Vec xx,Vec yy) 172 { 173 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 174 PetscErrorCode ierr; 175 176 PetscFunctionBegin; 177 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 178 ierr = MatMultTranspose_SeqSELL(aijsell->S,xx,yy);CHKERRQ(ierr); 179 PetscFunctionReturn(0); 180 } 181 182 PetscErrorCode MatMultAdd_SeqAIJSELL(Mat A,Vec xx,Vec yy,Vec zz) 183 { 184 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 185 PetscErrorCode ierr; 186 187 PetscFunctionBegin; 188 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 189 ierr = MatMultAdd_SeqSELL(aijsell->S,xx,yy,zz);CHKERRQ(ierr); 190 PetscFunctionReturn(0); 191 } 192 193 PetscErrorCode MatMultTransposeAdd_SeqAIJSELL(Mat A,Vec xx,Vec yy,Vec zz) 194 { 195 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 196 PetscErrorCode ierr; 197 198 PetscFunctionBegin; 199 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 200 ierr = MatMultTransposeAdd_SeqSELL(aijsell->S,xx,yy,zz);CHKERRQ(ierr); 201 PetscFunctionReturn(0); 202 } 203 204 PetscErrorCode MatSOR_SeqAIJSELL(Mat A,Vec bb,PetscReal omega,MatSORType flag,PetscReal fshift,PetscInt its,PetscInt lits,Vec xx) 205 { 206 Mat_SeqAIJSELL *aijsell=(Mat_SeqAIJSELL*)A->spptr; 207 PetscErrorCode ierr; 208 209 PetscFunctionBegin; 210 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 211 ierr = MatSOR_SeqSELL(aijsell->S,bb,omega,flag,fshift,its,lits,xx);CHKERRQ(ierr); 212 PetscFunctionReturn(0); 213 } 214 215 /* MatConvert_SeqAIJ_SeqAIJSELL converts a SeqAIJ matrix into a 216 * SeqAIJSELL matrix. This routine is called by the MatCreate_SeqAIJSELL() 217 * routine, but can also be used to convert an assembled SeqAIJ matrix 218 * into a SeqAIJSELL one. */ 219 PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqAIJSELL(Mat A,MatType type,MatReuse reuse,Mat *newmat) 220 { 221 PetscErrorCode ierr; 222 Mat B = *newmat; 223 Mat_SeqAIJ *b; 224 Mat_SeqAIJSELL *aijsell; 225 PetscBool set; 226 PetscBool sametype; 227 228 PetscFunctionBegin; 229 if (reuse == MAT_INITIAL_MATRIX) { 230 ierr = MatDuplicate(A,MAT_COPY_VALUES,&B);CHKERRQ(ierr); 231 } 232 233 ierr = PetscObjectTypeCompare((PetscObject)A,type,&sametype);CHKERRQ(ierr); 234 if (sametype) PetscFunctionReturn(0); 235 236 ierr = PetscNewLog(B,&aijsell);CHKERRQ(ierr); 237 b = (Mat_SeqAIJ*) B->data; 238 B->spptr = (void*) aijsell; 239 240 /* Disable use of the inode routines so that the AIJSELL ones will be used instead. 241 * This happens in MatAssemblyEnd_SeqAIJSELL as well, but the assembly end may not be called, so set it here, too. 242 * As noted elsewhere, I wonder if it might make sense and be feasible to use some of the inode routines. */ 243 b->inode.use = PETSC_FALSE; 244 245 /* Set function pointers for methods that we inherit from AIJ but override. 246 * We also parse some command line options below, since those determine some of the methods we point to. */ 247 B->ops->duplicate = MatDuplicate_SeqAIJSELL; 248 B->ops->assemblyend = MatAssemblyEnd_SeqAIJSELL; 249 B->ops->destroy = MatDestroy_SeqAIJSELL; 250 251 aijsell->S = NULL; 252 aijsell->eager_shadow = PETSC_FALSE; 253 254 /* Parse command line options. */ 255 ierr = PetscOptionsBegin(PetscObjectComm((PetscObject)A),((PetscObject)A)->prefix,"AIJSELL Options","Mat");CHKERRQ(ierr); 256 ierr = PetscOptionsBool("-mat_aijsell_eager_shadow","Eager Shadowing","None",(PetscBool)aijsell->eager_shadow,(PetscBool*)&aijsell->eager_shadow,&set);CHKERRQ(ierr); 257 ierr = PetscOptionsEnd();CHKERRQ(ierr); 258 259 /* If A has already been assembled and eager shadowing is specified, build the shadow matrix. */ 260 if (A->assembled && aijsell->eager_shadow) { 261 ierr = MatSeqAIJSELL_build_shadow(A);CHKERRQ(ierr); 262 } 263 264 B->ops->mult = MatMult_SeqAIJSELL; 265 B->ops->multtranspose = MatMultTranspose_SeqAIJSELL; 266 B->ops->multadd = MatMultAdd_SeqAIJSELL; 267 B->ops->multtransposeadd = MatMultTransposeAdd_SeqAIJSELL; 268 B->ops->sor = MatSOR_SeqAIJSELL; 269 270 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_seqaijsell_seqaij_C",MatConvert_SeqAIJSELL_SeqAIJ);CHKERRQ(ierr); 271 272 ierr = PetscObjectChangeTypeName((PetscObject)B,MATSEQAIJSELL);CHKERRQ(ierr); 273 *newmat = B; 274 PetscFunctionReturn(0); 275 } 276 277 /*@C 278 MatCreateSeqAIJSELL - Creates a sparse matrix of type SEQAIJSELL. 279 This type inherits from AIJ and is largely identical, but keeps a "shadow" 280 copy of the matrix in SEQSELL format, which is used when this format 281 may be more suitable for a requested operation. Currently, SEQSELL format 282 is used for MatMult, MatMultTranspose, MatMultAdd, MatMultTransposeAdd, 283 and MatSOR operations. 284 Because SEQAIJSELL is a subtype of SEQAIJ, the option "-mat_seqaij_type seqaijsell" can be used to make 285 sequential AIJ matrices default to being instances of MATSEQAIJSELL. 286 287 Collective 288 289 Input Parameters: 290 + comm - MPI communicator, set to PETSC_COMM_SELF 291 . m - number of rows 292 . n - number of columns 293 . nz - number of nonzeros per row (same for all rows) 294 - nnz - array containing the number of nonzeros in the various rows 295 (possibly different for each row) or NULL 296 297 Output Parameter: 298 . A - the matrix 299 300 Options Database Keys: 301 . -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 302 303 Notes: 304 If nnz is given then nz is ignored 305 306 Level: intermediate 307 308 .seealso: MatCreate(), MatCreateMPIAIJSELL(), MatSetValues() 309 @*/ 310 PetscErrorCode MatCreateSeqAIJSELL(MPI_Comm comm,PetscInt m,PetscInt n,PetscInt nz,const PetscInt nnz[],Mat *A) 311 { 312 PetscErrorCode ierr; 313 314 PetscFunctionBegin; 315 ierr = MatCreate(comm,A);CHKERRQ(ierr); 316 ierr = MatSetSizes(*A,m,n,m,n);CHKERRQ(ierr); 317 ierr = MatSetType(*A,MATSEQAIJSELL);CHKERRQ(ierr); 318 ierr = MatSeqAIJSetPreallocation_SeqAIJ(*A,nz,nnz);CHKERRQ(ierr); 319 PetscFunctionReturn(0); 320 } 321 322 PETSC_EXTERN PetscErrorCode MatCreate_SeqAIJSELL(Mat A) 323 { 324 PetscErrorCode ierr; 325 326 PetscFunctionBegin; 327 ierr = MatSetType(A,MATSEQAIJ);CHKERRQ(ierr); 328 ierr = MatConvert_SeqAIJ_SeqAIJSELL(A,MATSEQAIJSELL,MAT_INPLACE_MATRIX,&A);CHKERRQ(ierr); 329 PetscFunctionReturn(0); 330 } 331