/* Defines the basic matrix operations for the SELL matrix storage format. */ #include <../src/mat/impls/sell/seq/sell.h> /*I "petscmat.h" I*/ #include #include static PetscBool cited = PETSC_FALSE; static const char citation[] = "@inproceedings{ZhangELLPACK2018,\n" " author = {Hong Zhang and Richard T. Mills and Karl Rupp and Barry F. Smith},\n" " title = {Vectorized Parallel Sparse Matrix-Vector Multiplication in {PETSc} Using {AVX-512}},\n" " booktitle = {Proceedings of the 47th International Conference on Parallel Processing},\n" " year = 2018\n" "}\n"; #if defined(PETSC_HAVE_IMMINTRIN_H) && (defined(__AVX512F__) || (defined(__AVX2__) && defined(__FMA__)) || defined(__AVX__)) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) #include #if !defined(_MM_SCALE_8) #define _MM_SCALE_8 8 #endif #if defined(__AVX512F__) /* these do not work vec_idx = _mm512_loadunpackhi_epi32(vec_idx,acolidx); vec_vals = _mm512_loadunpackhi_pd(vec_vals,aval); */ #define AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y) \ /* if the mask bit is set, copy from acolidx, otherwise from vec_idx */ \ vec_idx = _mm256_loadu_si256((__m256i const *)acolidx); \ vec_vals = _mm512_loadu_pd(aval); \ vec_x = _mm512_i32gather_pd(vec_idx, x, _MM_SCALE_8); \ vec_y = _mm512_fmadd_pd(vec_x, vec_vals, vec_y) #elif defined(__AVX2__) && defined(__FMA__) #define AVX2_Mult_Private(vec_idx, vec_x, vec_vals, vec_y) \ vec_vals = _mm256_loadu_pd(aval); \ vec_idx = _mm_loadu_si128((__m128i const *)acolidx); /* SSE2 */ \ vec_x = _mm256_i32gather_pd(x, vec_idx, _MM_SCALE_8); \ vec_y = _mm256_fmadd_pd(vec_x, vec_vals, vec_y) #endif #endif /* PETSC_HAVE_IMMINTRIN_H */ /*@ MatSeqSELLSetPreallocation - For good matrix assembly performance the user should preallocate the matrix storage by setting the parameter `nz` (or the array `nnz`). Collective Input Parameters: + B - The `MATSEQSELL` matrix . rlenmax - number of nonzeros per row (same for all rows), ignored if `rlen` is provided - rlen - array containing the number of nonzeros in the various rows (possibly different for each row) or `NULL` Level: intermediate Notes: Specify the preallocated storage with either `rlenmax` or `rlen` (not both). Set `rlenmax` = `PETSC_DEFAULT` and `rlen` = `NULL` for PETSc to control dynamic memory allocation. You can call `MatGetInfo()` to get information on how effective the preallocation was; for example the fields mallocs,nz_allocated,nz_used,nz_unneeded; You can also run with the option `-info` and look for messages with the string malloc in them to see if additional memory allocation was needed. Developer Notes: Use `rlenmax` of `MAT_SKIP_ALLOCATION` to not allocate any space for the matrix entries or columns indices. The maximum number of nonzeos in any row should be as accurate as possible. If it is underestimated, you will get bad performance due to reallocation (`MatSeqXSELLReallocateSELL()`). .seealso: `Mat`, `MATSEQSELL`, `MATSELL`, `MatCreate()`, `MatCreateSELL()`, `MatSetValues()`, `MatGetInfo()` @*/ PetscErrorCode MatSeqSELLSetPreallocation(Mat B, PetscInt rlenmax, const PetscInt rlen[]) { PetscFunctionBegin; PetscValidHeaderSpecific(B, MAT_CLASSID, 1); PetscValidType(B, 1); PetscTryMethod(B, "MatSeqSELLSetPreallocation_C", (Mat, PetscInt, const PetscInt[]), (B, rlenmax, rlen)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatSeqSELLSetPreallocation_SeqSELL(Mat B, PetscInt maxallocrow, const PetscInt rlen[]) { Mat_SeqSELL *b; PetscInt i, j, totalslices; #if defined(PETSC_HAVE_CUPM) PetscInt rlenmax = 0; #endif PetscBool skipallocation = PETSC_FALSE, realalloc = PETSC_FALSE; PetscFunctionBegin; if (maxallocrow >= 0 || rlen) realalloc = PETSC_TRUE; if (maxallocrow == MAT_SKIP_ALLOCATION) { skipallocation = PETSC_TRUE; maxallocrow = 0; } PetscCall(PetscLayoutSetUp(B->rmap)); PetscCall(PetscLayoutSetUp(B->cmap)); /* FIXME: if one preallocates more space than needed, the matrix does not shrink automatically, but for best performance it should */ if (maxallocrow == PETSC_DEFAULT || maxallocrow == PETSC_DECIDE) maxallocrow = 5; PetscCheck(maxallocrow >= 0, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "maxallocrow cannot be less than 0: value %" PetscInt_FMT, maxallocrow); if (rlen) { for (i = 0; i < B->rmap->n; i++) { PetscCheck(rlen[i] >= 0, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "rlen cannot be less than 0: local row %" PetscInt_FMT " value %" PetscInt_FMT, i, rlen[i]); PetscCheck(rlen[i] <= B->cmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "rlen cannot be greater than row length: local row %" PetscInt_FMT " value %" PetscInt_FMT " rowlength %" PetscInt_FMT, i, rlen[i], B->cmap->n); } } B->preallocated = PETSC_TRUE; b = (Mat_SeqSELL *)B->data; if (!b->sliceheight) { /* not set yet */ #if defined(PETSC_HAVE_CUPM) b->sliceheight = 16; #else b->sliceheight = 8; #endif } totalslices = PetscCeilInt(B->rmap->n, b->sliceheight); b->totalslices = totalslices; if (!skipallocation) { if (B->rmap->n % b->sliceheight) PetscCall(PetscInfo(B, "Padding rows to the SEQSELL matrix because the number of rows is not the multiple of the slice height (value %" PetscInt_FMT ")\n", B->rmap->n)); if (!b->sliidx) { /* sliidx gives the starting index of each slice, the last element is the total space allocated */ PetscCall(PetscMalloc1(totalslices + 1, &b->sliidx)); } if (!rlen) { /* if rlen is not provided, allocate same space for all the slices */ if (maxallocrow == PETSC_DEFAULT || maxallocrow == PETSC_DECIDE) maxallocrow = 10; else if (maxallocrow < 0) maxallocrow = 1; #if defined(PETSC_HAVE_CUPM) rlenmax = maxallocrow; /* Pad the slice to DEVICE_MEM_ALIGN */ while (b->sliceheight * maxallocrow % DEVICE_MEM_ALIGN) maxallocrow++; #endif for (i = 0; i <= totalslices; i++) b->sliidx[i] = b->sliceheight * i * maxallocrow; } else { #if defined(PETSC_HAVE_CUPM) PetscInt mul = DEVICE_MEM_ALIGN / b->sliceheight; #endif maxallocrow = 0; b->sliidx[0] = 0; for (i = 1; i < totalslices; i++) { b->sliidx[i] = 0; for (j = 0; j < b->sliceheight; j++) b->sliidx[i] = PetscMax(b->sliidx[i], rlen[b->sliceheight * (i - 1) + j]); #if defined(PETSC_HAVE_CUPM) if (mul != 0) { /* Pad the slice to DEVICE_MEM_ALIGN if sliceheight < DEVICE_MEM_ALIGN */ rlenmax = PetscMax(b->sliidx[i], rlenmax); b->sliidx[i] = ((b->sliidx[i] - 1) / mul + 1) * mul; } #endif maxallocrow = PetscMax(b->sliidx[i], maxallocrow); PetscCall(PetscIntSumError(b->sliidx[i - 1], b->sliceheight * b->sliidx[i], &b->sliidx[i])); } /* last slice */ b->sliidx[totalslices] = 0; for (j = b->sliceheight * (totalslices - 1); j < B->rmap->n; j++) b->sliidx[totalslices] = PetscMax(b->sliidx[totalslices], rlen[j]); #if defined(PETSC_HAVE_CUPM) if (mul != 0) { rlenmax = PetscMax(b->sliidx[i], rlenmax); b->sliidx[totalslices] = ((b->sliidx[totalslices] - 1) / mul + 1) * mul; } #endif maxallocrow = PetscMax(b->sliidx[totalslices], maxallocrow); b->sliidx[totalslices] = b->sliidx[totalslices - 1] + b->sliceheight * b->sliidx[totalslices]; } /* allocate space for val, colidx, rlen */ /* FIXME: should B's old memory be unlogged? */ PetscCall(MatSeqXSELLFreeSELL(B, &b->val, &b->colidx)); /* FIXME: assuming an element of the bit array takes 8 bits */ PetscCall(PetscMalloc2(b->sliidx[totalslices], &b->val, b->sliidx[totalslices], &b->colidx)); /* b->rlen will count nonzeros in each row so far. We dont copy rlen to b->rlen because the matrix has not been set. */ PetscCall(PetscCalloc1(b->sliceheight * totalslices, &b->rlen)); b->singlemalloc = PETSC_TRUE; b->free_val = PETSC_TRUE; b->free_colidx = PETSC_TRUE; } else { b->free_val = PETSC_FALSE; b->free_colidx = PETSC_FALSE; } b->nz = 0; b->maxallocrow = maxallocrow; #if defined(PETSC_HAVE_CUPM) b->rlenmax = rlenmax; #else b->rlenmax = maxallocrow; #endif b->maxallocmat = b->sliidx[totalslices]; B->info.nz_unneeded = (double)b->maxallocmat; if (realalloc) PetscCall(MatSetOption(B, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_TRUE)); PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatGetRow_SeqSELL(Mat A, PetscInt row, PetscInt *nz, PetscInt **idx, PetscScalar **v) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt shift; PetscFunctionBegin; PetscCheck(row >= 0 && row < A->rmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Row %" PetscInt_FMT " out of range", row); if (nz) *nz = a->rlen[row]; shift = a->sliidx[row / a->sliceheight] + (row % a->sliceheight); if (!a->getrowcols) PetscCall(PetscMalloc2(a->rlenmax, &a->getrowcols, a->rlenmax, &a->getrowvals)); if (idx) { PetscInt j; for (j = 0; j < a->rlen[row]; j++) a->getrowcols[j] = a->colidx[shift + a->sliceheight * j]; *idx = a->getrowcols; } if (v) { PetscInt j; for (j = 0; j < a->rlen[row]; j++) a->getrowvals[j] = a->val[shift + a->sliceheight * j]; *v = a->getrowvals; } PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatRestoreRow_SeqSELL(Mat A, PetscInt row, PetscInt *nz, PetscInt **idx, PetscScalar **v) { PetscFunctionBegin; PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatConvert_SeqSELL_SeqAIJ(Mat A, MatType newtype, MatReuse reuse, Mat *newmat) { Mat B; Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt i; PetscFunctionBegin; if (reuse == MAT_REUSE_MATRIX) { B = *newmat; PetscCall(MatZeroEntries(B)); } else { PetscCall(MatCreate(PetscObjectComm((PetscObject)A), &B)); PetscCall(MatSetSizes(B, A->rmap->n, A->cmap->n, A->rmap->N, A->cmap->N)); PetscCall(MatSetType(B, MATSEQAIJ)); PetscCall(MatSeqAIJSetPreallocation(B, 0, a->rlen)); } for (i = 0; i < A->rmap->n; i++) { PetscInt nz = 0, *cols = NULL; PetscScalar *vals = NULL; PetscCall(MatGetRow_SeqSELL(A, i, &nz, &cols, &vals)); PetscCall(MatSetValues(B, 1, &i, nz, cols, vals, INSERT_VALUES)); PetscCall(MatRestoreRow_SeqSELL(A, i, &nz, &cols, &vals)); } PetscCall(MatAssemblyBegin(B, MAT_FINAL_ASSEMBLY)); PetscCall(MatAssemblyEnd(B, MAT_FINAL_ASSEMBLY)); B->rmap->bs = A->rmap->bs; if (reuse == MAT_INPLACE_MATRIX) { PetscCall(MatHeaderReplace(A, &B)); } else { *newmat = B; } PetscFunctionReturn(PETSC_SUCCESS); } #include <../src/mat/impls/aij/seq/aij.h> PetscErrorCode MatConvert_SeqAIJ_SeqSELL(Mat A, MatType newtype, MatReuse reuse, Mat *newmat) { Mat B; Mat_SeqAIJ *a = (Mat_SeqAIJ *)A->data; PetscInt *ai = a->i, m = A->rmap->N, n = A->cmap->N, i, *rowlengths, row, ncols; const PetscInt *cols; const PetscScalar *vals; PetscFunctionBegin; if (reuse == MAT_REUSE_MATRIX) { B = *newmat; } else { if (PetscDefined(USE_DEBUG) || !a->ilen) { PetscCall(PetscMalloc1(m, &rowlengths)); for (i = 0; i < m; i++) rowlengths[i] = ai[i + 1] - ai[i]; } if (PetscDefined(USE_DEBUG) && a->ilen) { PetscBool eq; PetscCall(PetscArraycmp(rowlengths, a->ilen, m, &eq)); PetscCheck(eq, PETSC_COMM_SELF, PETSC_ERR_PLIB, "SeqAIJ ilen array incorrect"); PetscCall(PetscFree(rowlengths)); rowlengths = a->ilen; } else if (a->ilen) rowlengths = a->ilen; PetscCall(MatCreate(PetscObjectComm((PetscObject)A), &B)); PetscCall(MatSetSizes(B, m, n, m, n)); PetscCall(MatSetType(B, MATSEQSELL)); PetscCall(MatSeqSELLSetPreallocation(B, 0, rowlengths)); if (rowlengths != a->ilen) PetscCall(PetscFree(rowlengths)); } for (row = 0; row < m; row++) { PetscCall(MatGetRow_SeqAIJ(A, row, &ncols, (PetscInt **)&cols, (PetscScalar **)&vals)); PetscCall(MatSetValues_SeqSELL(B, 1, &row, ncols, cols, vals, INSERT_VALUES)); PetscCall(MatRestoreRow_SeqAIJ(A, row, &ncols, (PetscInt **)&cols, (PetscScalar **)&vals)); } PetscCall(MatAssemblyBegin(B, MAT_FINAL_ASSEMBLY)); PetscCall(MatAssemblyEnd(B, MAT_FINAL_ASSEMBLY)); B->rmap->bs = A->rmap->bs; if (reuse == MAT_INPLACE_MATRIX) { PetscCall(MatHeaderReplace(A, &B)); } else { *newmat = B; } PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatMult_SeqSELL(Mat A, Vec xx, Vec yy) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscScalar *y; const PetscScalar *x; const MatScalar *aval = a->val; PetscInt totalslices = a->totalslices; const PetscInt *acolidx = a->colidx; PetscInt i, j; #if defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX512F__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) __m512d vec_x, vec_y, vec_vals; __m256i vec_idx; __mmask8 mask; __m512d vec_x2, vec_y2, vec_vals2, vec_x3, vec_y3, vec_vals3, vec_x4, vec_y4, vec_vals4; __m256i vec_idx2, vec_idx3, vec_idx4; #elif defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX2__) && defined(__FMA__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) __m128i vec_idx; __m256d vec_x, vec_y, vec_y2, vec_vals; MatScalar yval; PetscInt r, rows_left, row, nnz_in_row; #elif defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) __m128d vec_x_tmp; __m256d vec_x, vec_y, vec_y2, vec_vals; MatScalar yval; PetscInt r, rows_left, row, nnz_in_row; #else PetscInt k, sliceheight = a->sliceheight; PetscScalar *sum; #endif #if defined(PETSC_HAVE_PRAGMA_DISJOINT) #pragma disjoint(*x, *y, *aval) #endif PetscFunctionBegin; PetscCall(VecGetArrayRead(xx, &x)); PetscCall(VecGetArray(yy, &y)); #if defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX512F__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) PetscCheck(a->sliceheight == 8, PETSC_COMM_SELF, PETSC_ERR_SUP, "The kernel requires a slice height of 8, but the input matrix has a slice height of %" PetscInt_FMT, a->sliceheight); for (i = 0; i < totalslices; i++) { /* loop over slices */ PetscPrefetchBlock(acolidx, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); PetscPrefetchBlock(aval, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); vec_y = _mm512_setzero_pd(); vec_y2 = _mm512_setzero_pd(); vec_y3 = _mm512_setzero_pd(); vec_y4 = _mm512_setzero_pd(); j = a->sliidx[i] >> 3; /* 8 bytes are read at each time, corresponding to a slice column */ switch ((a->sliidx[i + 1] - a->sliidx[i]) / 8 & 3) { case 3: AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx2, vec_x2, vec_vals2, vec_y2); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx3, vec_x3, vec_vals3, vec_y3); acolidx += 8; aval += 8; j += 3; break; case 2: AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx2, vec_x2, vec_vals2, vec_y2); acolidx += 8; aval += 8; j += 2; break; case 1: AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; j += 1; break; } #pragma novector for (; j < (a->sliidx[i + 1] >> 3); j += 4) { AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx2, vec_x2, vec_vals2, vec_y2); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx3, vec_x3, vec_vals3, vec_y3); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx4, vec_x4, vec_vals4, vec_y4); acolidx += 8; aval += 8; } vec_y = _mm512_add_pd(vec_y, vec_y2); vec_y = _mm512_add_pd(vec_y, vec_y3); vec_y = _mm512_add_pd(vec_y, vec_y4); if (i == totalslices - 1 && A->rmap->n & 0x07) { /* if last slice has padding rows */ mask = (__mmask8)(0xff >> (8 - (A->rmap->n & 0x07))); _mm512_mask_storeu_pd(&y[8 * i], mask, vec_y); } else { _mm512_storeu_pd(&y[8 * i], vec_y); } } #elif defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX2__) && defined(__FMA__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) PetscCheck(a->sliceheight == 8, PETSC_COMM_SELF, PETSC_ERR_SUP, "The kernel requires a slice height of 8, but the input matrix has a slice height of %" PetscInt_FMT, a->sliceheight); for (i = 0; i < totalslices; i++) { /* loop over full slices */ PetscPrefetchBlock(acolidx, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); PetscPrefetchBlock(aval, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); /* last slice may have padding rows. Don't use vectorization. */ if (i == totalslices - 1 && (A->rmap->n & 0x07)) { rows_left = A->rmap->n - 8 * i; for (r = 0; r < rows_left; ++r) { yval = (MatScalar)0; row = 8 * i + r; nnz_in_row = a->rlen[row]; for (j = 0; j < nnz_in_row; ++j) yval += aval[8 * j + r] * x[acolidx[8 * j + r]]; y[row] = yval; } break; } vec_y = _mm256_setzero_pd(); vec_y2 = _mm256_setzero_pd(); /* Process slice of height 8 (512 bits) via two subslices of height 4 (256 bits) via AVX */ #pragma novector #pragma unroll(2) for (j = a->sliidx[i]; j < a->sliidx[i + 1]; j += 8) { AVX2_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); aval += 4; acolidx += 4; AVX2_Mult_Private(vec_idx, vec_x, vec_vals, vec_y2); aval += 4; acolidx += 4; } _mm256_storeu_pd(y + i * 8, vec_y); _mm256_storeu_pd(y + i * 8 + 4, vec_y2); } #elif defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) PetscCheck(a->sliceheight == 8, PETSC_COMM_SELF, PETSC_ERR_SUP, "The kernel requires a slice height of 8, but the input matrix has a slice height of %" PetscInt_FMT, a->sliceheight); for (i = 0; i < totalslices; i++) { /* loop over full slices */ PetscPrefetchBlock(acolidx, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); PetscPrefetchBlock(aval, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); vec_y = _mm256_setzero_pd(); vec_y2 = _mm256_setzero_pd(); /* last slice may have padding rows. Don't use vectorization. */ if (i == totalslices - 1 && (A->rmap->n & 0x07)) { rows_left = A->rmap->n - 8 * i; for (r = 0; r < rows_left; ++r) { yval = (MatScalar)0; row = 8 * i + r; nnz_in_row = a->rlen[row]; for (j = 0; j < nnz_in_row; ++j) yval += aval[8 * j + r] * x[acolidx[8 * j + r]]; y[row] = yval; } break; } /* Process slice of height 8 (512 bits) via two subslices of height 4 (256 bits) via AVX */ #pragma novector #pragma unroll(2) for (j = a->sliidx[i]; j < a->sliidx[i + 1]; j += 8) { vec_vals = _mm256_loadu_pd(aval); vec_x_tmp = _mm_setzero_pd(); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 0); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 1); vec_y = _mm256_add_pd(_mm256_mul_pd(vec_x, vec_vals), vec_y); aval += 4; vec_vals = _mm256_loadu_pd(aval); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 0); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 1); vec_y2 = _mm256_add_pd(_mm256_mul_pd(vec_x, vec_vals), vec_y2); aval += 4; } _mm256_storeu_pd(y + i * 8, vec_y); _mm256_storeu_pd(y + i * 8 + 4, vec_y2); } #else PetscCall(PetscMalloc1(sliceheight, &sum)); for (i = 0; i < totalslices; i++) { /* loop over slices */ for (j = 0; j < sliceheight; j++) { sum[j] = 0.0; for (k = a->sliidx[i] + j; k < a->sliidx[i + 1]; k += sliceheight) sum[j] += aval[k] * x[acolidx[k]]; } if (i == totalslices - 1 && (A->rmap->n % sliceheight)) { /* if last slice has padding rows */ for (j = 0; j < (A->rmap->n % sliceheight); j++) y[sliceheight * i + j] = sum[j]; } else { for (j = 0; j < sliceheight; j++) y[sliceheight * i + j] = sum[j]; } } PetscCall(PetscFree(sum)); #endif PetscCall(PetscLogFlops(2.0 * a->nz - a->nonzerorowcnt)); /* theoretical minimal FLOPs */ PetscCall(VecRestoreArrayRead(xx, &x)); PetscCall(VecRestoreArray(yy, &y)); PetscFunctionReturn(PETSC_SUCCESS); } #include <../src/mat/impls/aij/seq/ftn-kernels/fmultadd.h> PetscErrorCode MatMultAdd_SeqSELL(Mat A, Vec xx, Vec yy, Vec zz) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscScalar *y, *z; const PetscScalar *x; const MatScalar *aval = a->val; PetscInt totalslices = a->totalslices; const PetscInt *acolidx = a->colidx; PetscInt i, j; #if defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX512F__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) __m512d vec_x, vec_y, vec_vals; __m256i vec_idx; __mmask8 mask = 0; __m512d vec_x2, vec_y2, vec_vals2, vec_x3, vec_y3, vec_vals3, vec_x4, vec_y4, vec_vals4; __m256i vec_idx2, vec_idx3, vec_idx4; #elif defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) __m128d vec_x_tmp; __m256d vec_x, vec_y, vec_y2, vec_vals; MatScalar yval; PetscInt r, row, nnz_in_row; #else PetscInt k, sliceheight = a->sliceheight; PetscScalar *sum; #endif #if defined(PETSC_HAVE_PRAGMA_DISJOINT) #pragma disjoint(*x, *y, *aval) #endif PetscFunctionBegin; if (!a->nz) { PetscCall(VecCopy(yy, zz)); PetscFunctionReturn(PETSC_SUCCESS); } PetscCall(VecGetArrayRead(xx, &x)); PetscCall(VecGetArrayPair(yy, zz, &y, &z)); #if defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX512F__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) PetscCheck(a->sliceheight == 8, PETSC_COMM_SELF, PETSC_ERR_SUP, "The kernel requires a slice height of 8, but the input matrix has a slice height of %" PetscInt_FMT, a->sliceheight); for (i = 0; i < totalslices; i++) { /* loop over slices */ PetscPrefetchBlock(acolidx, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); PetscPrefetchBlock(aval, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); if (i == totalslices - 1 && A->rmap->n & 0x07) { /* if last slice has padding rows */ mask = (__mmask8)(0xff >> (8 - (A->rmap->n & 0x07))); vec_y = _mm512_mask_loadu_pd(vec_y, mask, &y[8 * i]); } else { vec_y = _mm512_loadu_pd(&y[8 * i]); } vec_y2 = _mm512_setzero_pd(); vec_y3 = _mm512_setzero_pd(); vec_y4 = _mm512_setzero_pd(); j = a->sliidx[i] >> 3; /* 8 bytes are read at each time, corresponding to a slice column */ switch ((a->sliidx[i + 1] - a->sliidx[i]) / 8 & 3) { case 3: AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx2, vec_x2, vec_vals2, vec_y2); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx3, vec_x3, vec_vals3, vec_y3); acolidx += 8; aval += 8; j += 3; break; case 2: AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx2, vec_x2, vec_vals2, vec_y2); acolidx += 8; aval += 8; j += 2; break; case 1: AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; j += 1; break; } #pragma novector for (; j < (a->sliidx[i + 1] >> 3); j += 4) { AVX512_Mult_Private(vec_idx, vec_x, vec_vals, vec_y); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx2, vec_x2, vec_vals2, vec_y2); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx3, vec_x3, vec_vals3, vec_y3); acolidx += 8; aval += 8; AVX512_Mult_Private(vec_idx4, vec_x4, vec_vals4, vec_y4); acolidx += 8; aval += 8; } vec_y = _mm512_add_pd(vec_y, vec_y2); vec_y = _mm512_add_pd(vec_y, vec_y3); vec_y = _mm512_add_pd(vec_y, vec_y4); if (i == totalslices - 1 && A->rmap->n & 0x07) { /* if last slice has padding rows */ _mm512_mask_storeu_pd(&z[8 * i], mask, vec_y); } else { _mm512_storeu_pd(&z[8 * i], vec_y); } } #elif defined(PETSC_HAVE_IMMINTRIN_H) && defined(__AVX__) && defined(PETSC_USE_REAL_DOUBLE) && !defined(PETSC_USE_COMPLEX) && !defined(PETSC_USE_64BIT_INDICES) PetscCheck(a->sliceheight == 8, PETSC_COMM_SELF, PETSC_ERR_SUP, "The kernel requires a slice height of 8, but the input matrix has a slice height of %" PetscInt_FMT, a->sliceheight); for (i = 0; i < totalslices; i++) { /* loop over full slices */ PetscPrefetchBlock(acolidx, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); PetscPrefetchBlock(aval, a->sliidx[i + 1] - a->sliidx[i], 0, PETSC_PREFETCH_HINT_T0); /* last slice may have padding rows. Don't use vectorization. */ if (i == totalslices - 1 && (A->rmap->n & 0x07)) { for (r = 0; r < (A->rmap->n & 0x07); ++r) { row = 8 * i + r; yval = (MatScalar)0.0; nnz_in_row = a->rlen[row]; for (j = 0; j < nnz_in_row; ++j) yval += aval[8 * j + r] * x[acolidx[8 * j + r]]; z[row] = y[row] + yval; } break; } vec_y = _mm256_loadu_pd(y + 8 * i); vec_y2 = _mm256_loadu_pd(y + 8 * i + 4); /* Process slice of height 8 (512 bits) via two subslices of height 4 (256 bits) via AVX */ for (j = a->sliidx[i]; j < a->sliidx[i + 1]; j += 8) { vec_vals = _mm256_loadu_pd(aval); vec_x_tmp = _mm_setzero_pd(); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_setzero_pd(); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 0); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 1); vec_y = _mm256_add_pd(_mm256_mul_pd(vec_x, vec_vals), vec_y); aval += 4; vec_vals = _mm256_loadu_pd(aval); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 0); vec_x_tmp = _mm_loadl_pd(vec_x_tmp, x + *acolidx++); vec_x_tmp = _mm_loadh_pd(vec_x_tmp, x + *acolidx++); vec_x = _mm256_insertf128_pd(vec_x, vec_x_tmp, 1); vec_y2 = _mm256_add_pd(_mm256_mul_pd(vec_x, vec_vals), vec_y2); aval += 4; } _mm256_storeu_pd(z + i * 8, vec_y); _mm256_storeu_pd(z + i * 8 + 4, vec_y2); } #else PetscCall(PetscMalloc1(sliceheight, &sum)); for (i = 0; i < totalslices; i++) { /* loop over slices */ for (j = 0; j < sliceheight; j++) { sum[j] = 0.0; for (k = a->sliidx[i] + j; k < a->sliidx[i + 1]; k += sliceheight) sum[j] += aval[k] * x[acolidx[k]]; } if (i == totalslices - 1 && (A->rmap->n % sliceheight)) { for (j = 0; j < (A->rmap->n % sliceheight); j++) z[sliceheight * i + j] = y[sliceheight * i + j] + sum[j]; } else { for (j = 0; j < sliceheight; j++) z[sliceheight * i + j] = y[sliceheight * i + j] + sum[j]; } } PetscCall(PetscFree(sum)); #endif PetscCall(PetscLogFlops(2.0 * a->nz)); PetscCall(VecRestoreArrayRead(xx, &x)); PetscCall(VecRestoreArrayPair(yy, zz, &y, &z)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatMultTransposeAdd_SeqSELL(Mat A, Vec xx, Vec zz, Vec yy) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscScalar *y; const PetscScalar *x; const MatScalar *aval = a->val; const PetscInt *acolidx = a->colidx; PetscInt i, j, r, row, nnz_in_row, totalslices = a->totalslices, sliceheight = a->sliceheight; #if defined(PETSC_HAVE_PRAGMA_DISJOINT) #pragma disjoint(*x, *y, *aval) #endif PetscFunctionBegin; if (A->symmetric == PETSC_BOOL3_TRUE) { PetscCall(MatMultAdd_SeqSELL(A, xx, zz, yy)); PetscFunctionReturn(PETSC_SUCCESS); } if (zz != yy) PetscCall(VecCopy(zz, yy)); if (a->nz) { PetscCall(VecGetArrayRead(xx, &x)); PetscCall(VecGetArray(yy, &y)); for (i = 0; i < a->totalslices; i++) { /* loop over slices */ if (i == totalslices - 1 && (A->rmap->n % sliceheight)) { for (r = 0; r < (A->rmap->n % sliceheight); ++r) { row = sliceheight * i + r; nnz_in_row = a->rlen[row]; for (j = 0; j < nnz_in_row; ++j) y[acolidx[sliceheight * j + r]] += aval[sliceheight * j + r] * x[row]; } break; } for (r = 0; r < sliceheight; ++r) for (j = a->sliidx[i] + r; j < a->sliidx[i + 1]; j += sliceheight) y[acolidx[j]] += aval[j] * x[sliceheight * i + r]; } PetscCall(PetscLogFlops(2.0 * a->nz)); PetscCall(VecRestoreArrayRead(xx, &x)); PetscCall(VecRestoreArray(yy, &y)); } PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatMultTranspose_SeqSELL(Mat A, Vec xx, Vec yy) { PetscFunctionBegin; if (A->symmetric == PETSC_BOOL3_TRUE) { PetscCall(MatMult_SeqSELL(A, xx, yy)); } else { PetscCall(VecSet(yy, 0.0)); PetscCall(MatMultTransposeAdd_SeqSELL(A, xx, yy, yy)); } PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatGetDiagonalMarkers_SeqSELL(Mat A, const PetscInt **diag, PetscBool *diagDense) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscFunctionBegin; if (A->factortype != MAT_FACTOR_NONE) { PetscAssertPointer(diag, 2); PetscCheck(!diagDense, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cannot check for dense diagonal with factored matrices"); *diag = a->diag; PetscFunctionReturn(PETSC_SUCCESS); } PetscCheck(diag || diagDense, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "At least one of diag or diagDense must be requested"); if (a->diagNonzeroState != A->nonzerostate || (diag && !a->diag)) { const PetscInt m = A->rmap->n; PetscInt shift; if (!diag && !a->diag) { a->diagDense = PETSC_TRUE; for (PetscInt i = 0; i < m; i++) { PetscBool found = PETSC_FALSE; shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ for (PetscInt j = 0; j < a->rlen[i]; j++) { if (a->colidx[shift + a->sliceheight * j] == i) { a->diag[i] = shift + a->sliceheight * j; found = PETSC_TRUE; break; } } if (!found) { a->diagDense = PETSC_FALSE; *diagDense = a->diagDense; a->diagNonzeroState = A->nonzerostate; PetscFunctionReturn(PETSC_SUCCESS); } } } else { if (!a->diag) PetscCall(PetscMalloc1(m, &a->diag)); a->diagDense = PETSC_TRUE; for (PetscInt i = 0; i < m; i++) { PetscBool found = PETSC_FALSE; shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ a->diag[i] = -1; for (PetscInt j = 0; j < a->rlen[i]; j++) { if (a->colidx[shift + a->sliceheight * j] == i) { a->diag[i] = shift + a->sliceheight * j; found = PETSC_TRUE; break; } } if (!found) a->diagDense = PETSC_FALSE; } } a->diagNonzeroState = A->nonzerostate; } if (diag) *diag = a->diag; if (diagDense) *diagDense = a->diagDense; PetscFunctionReturn(PETSC_SUCCESS); } /* Negative shift indicates do not generate an error if there is a zero diagonal, just invert it anyways */ static PetscErrorCode MatInvertDiagonalForSOR_SeqSELL(Mat A, PetscScalar omega, PetscScalar fshift) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt i, m = A->rmap->n; MatScalar *val = a->val; PetscScalar *idiag, *mdiag; const PetscInt *diag; PetscBool diagDense; PetscFunctionBegin; if (a->idiagState == ((PetscObject)A)->state && a->omega == omega && a->fshift == fshift) PetscFunctionReturn(PETSC_SUCCESS); PetscCall(MatGetDiagonalMarkers_SeqSELL(A, &diag, &diagDense)); PetscCheck(diagDense, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONGSTATE, "Matrix must have all diagonal locations to invert them"); if (!a->idiag) { PetscCall(PetscMalloc3(m, &a->idiag, m, &a->mdiag, m, &a->ssor_work)); val = a->val; } mdiag = a->mdiag; idiag = a->idiag; if (omega == 1.0 && PetscRealPart(fshift) <= 0.0) { for (i = 0; i < m; i++) { mdiag[i] = val[diag[i]]; if (!PetscAbsScalar(mdiag[i])) { /* zero diagonal */ PetscCheck(PetscRealPart(fshift), PETSC_COMM_SELF, PETSC_ERR_ARG_INCOMP, "Zero diagonal on row %" PetscInt_FMT, i); PetscCall(PetscInfo(A, "Zero diagonal on row %" PetscInt_FMT "\n", i)); A->factorerrortype = MAT_FACTOR_NUMERIC_ZEROPIVOT; A->factorerror_zeropivot_value = 0.0; A->factorerror_zeropivot_row = i; } idiag[i] = 1.0 / val[diag[i]]; } PetscCall(PetscLogFlops(m)); } else { for (i = 0; i < m; i++) { mdiag[i] = val[diag[i]]; idiag[i] = omega / (fshift + val[diag[i]]); } PetscCall(PetscLogFlops(2.0 * m)); } a->idiagState = ((PetscObject)A)->state; a->omega = omega; a->fshift = fshift; PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatZeroEntries_SeqSELL(Mat A) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscFunctionBegin; PetscCall(PetscArrayzero(a->val, a->sliidx[a->totalslices])); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatDestroy_SeqSELL(Mat A) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscFunctionBegin; PetscCall(PetscLogObjectState((PetscObject)A, "Rows=%" PetscInt_FMT ", Cols=%" PetscInt_FMT ", NZ=%" PetscInt_FMT, A->rmap->n, A->cmap->n, a->nz)); PetscCall(MatSeqXSELLFreeSELL(A, &a->val, &a->colidx)); PetscCall(ISDestroy(&a->row)); PetscCall(ISDestroy(&a->col)); PetscCall(PetscFree(a->diag)); PetscCall(PetscFree(a->rlen)); PetscCall(PetscFree(a->sliidx)); PetscCall(PetscFree3(a->idiag, a->mdiag, a->ssor_work)); PetscCall(PetscFree(a->solve_work)); PetscCall(ISDestroy(&a->icol)); PetscCall(PetscFree(a->saved_values)); PetscCall(PetscFree2(a->getrowcols, a->getrowvals)); PetscCall(PetscFree(A->data)); #if defined(PETSC_HAVE_CUPM) PetscCall(PetscFree(a->chunk_slice_map)); #endif PetscCall(PetscObjectChangeTypeName((PetscObject)A, NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatStoreValues_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatRetrieveValues_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLSetPreallocation_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLGetArray_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLRestoreArray_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatConvert_seqsell_seqaij_C", NULL)); #if defined(PETSC_HAVE_CUDA) PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatConvert_seqsell_seqsellcuda_C", NULL)); #endif #if defined(PETSC_HAVE_HIP) PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatConvert_seqsell_seqsellhip_C", NULL)); #endif PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLGetFillRatio_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLGetMaxSliceWidth_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLGetAvgSliceWidth_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLGetVarSliceSize_C", NULL)); PetscCall(PetscObjectComposeFunction((PetscObject)A, "MatSeqSELLSetSliceHeight_C", NULL)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatSetOption_SeqSELL(Mat A, MatOption op, PetscBool flg) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscFunctionBegin; switch (op) { case MAT_ROW_ORIENTED: a->roworiented = flg; break; case MAT_KEEP_NONZERO_PATTERN: a->keepnonzeropattern = flg; break; case MAT_NEW_NONZERO_LOCATIONS: a->nonew = (flg ? 0 : 1); break; case MAT_NEW_NONZERO_LOCATION_ERR: a->nonew = (flg ? -1 : 0); break; case MAT_NEW_NONZERO_ALLOCATION_ERR: a->nonew = (flg ? -2 : 0); break; case MAT_UNUSED_NONZERO_LOCATION_ERR: a->nounused = (flg ? -1 : 0); break; default: break; } PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatGetDiagonal_SeqSELL(Mat A, Vec v) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt i, j, n, shift; PetscScalar *x, zero = 0.0; PetscFunctionBegin; PetscCall(VecGetLocalSize(v, &n)); PetscCheck(n == A->rmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Nonconforming matrix and vector"); if (A->factortype == MAT_FACTOR_ILU || A->factortype == MAT_FACTOR_LU) { const PetscInt *diag; PetscCall(MatGetDiagonalMarkers_SeqSELL(A, &diag, NULL)); PetscCall(VecGetArrayWrite(v, &x)); for (i = 0; i < n; i++) x[i] = 1.0 / a->val[diag[i]]; PetscCall(VecRestoreArrayWrite(v, &x)); PetscFunctionReturn(PETSC_SUCCESS); } PetscCall(VecSet(v, zero)); PetscCall(VecGetArray(v, &x)); for (i = 0; i < n; i++) { /* loop over rows */ shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ x[i] = 0; for (j = 0; j < a->rlen[i]; j++) { if (a->colidx[shift + a->sliceheight * j] == i) { x[i] = a->val[shift + a->sliceheight * j]; break; } } } PetscCall(VecRestoreArray(v, &x)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatDiagonalScale_SeqSELL(Mat A, Vec ll, Vec rr) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; const PetscScalar *l, *r; PetscInt i, j, m, n, row; PetscFunctionBegin; if (ll) { /* The local size is used so that VecMPI can be passed to this routine by MatDiagonalScale_MPISELL */ PetscCall(VecGetLocalSize(ll, &m)); PetscCheck(m == A->rmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Left scaling vector wrong length"); PetscCall(VecGetArrayRead(ll, &l)); for (i = 0; i < a->totalslices; i++) { /* loop over slices */ if (i == a->totalslices - 1 && (A->rmap->n % a->sliceheight)) { /* if last slice has padding rows */ for (j = a->sliidx[i], row = 0; j < a->sliidx[i + 1]; j++, row = (row + 1) % a->sliceheight) { if (row < (A->rmap->n % a->sliceheight)) a->val[j] *= l[a->sliceheight * i + row]; } } else { for (j = a->sliidx[i], row = 0; j < a->sliidx[i + 1]; j++, row = (row + 1) % a->sliceheight) a->val[j] *= l[a->sliceheight * i + row]; } } PetscCall(VecRestoreArrayRead(ll, &l)); PetscCall(PetscLogFlops(a->nz)); } if (rr) { PetscCall(VecGetLocalSize(rr, &n)); PetscCheck(n == A->cmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Right scaling vector wrong length"); PetscCall(VecGetArrayRead(rr, &r)); for (i = 0; i < a->totalslices; i++) { /* loop over slices */ if (i == a->totalslices - 1 && (A->rmap->n % a->sliceheight)) { /* if last slice has padding rows */ for (j = a->sliidx[i], row = 0; j < a->sliidx[i + 1]; j++, row = ((row + 1) % a->sliceheight)) { if (row < (A->rmap->n % a->sliceheight)) a->val[j] *= r[a->colidx[j]]; } } else { for (j = a->sliidx[i]; j < a->sliidx[i + 1]; j++) a->val[j] *= r[a->colidx[j]]; } } PetscCall(VecRestoreArrayRead(rr, &r)); PetscCall(PetscLogFlops(a->nz)); } #if defined(PETSC_HAVE_CUPM) if (A->offloadmask != PETSC_OFFLOAD_UNALLOCATED) A->offloadmask = PETSC_OFFLOAD_CPU; #endif PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatGetValues_SeqSELL(Mat A, PetscInt m, const PetscInt im[], PetscInt n, const PetscInt in[], PetscScalar v[]) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt *cp, i, k, low, high, t, row, col, l; PetscInt shift; MatScalar *vp; PetscFunctionBegin; for (k = 0; k < m; k++) { /* loop over requested rows */ row = im[k]; if (row < 0) continue; PetscCheck(row < A->rmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Row too large: row %" PetscInt_FMT " max %" PetscInt_FMT, row, A->rmap->n - 1); shift = a->sliidx[row / a->sliceheight] + (row % a->sliceheight); /* starting index of the row */ cp = a->colidx + shift; /* pointer to the row */ vp = a->val + shift; /* pointer to the row */ for (l = 0; l < n; l++) { /* loop over requested columns */ col = in[l]; if (col < 0) continue; PetscCheck(col < A->cmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Column too large: row %" PetscInt_FMT " max %" PetscInt_FMT, col, A->cmap->n - 1); high = a->rlen[row]; low = 0; /* assume unsorted */ while (high - low > 5) { t = (low + high) / 2; if (*(cp + a->sliceheight * t) > col) high = t; else low = t; } for (i = low; i < high; i++) { if (*(cp + a->sliceheight * i) > col) break; if (*(cp + a->sliceheight * i) == col) { *v++ = *(vp + a->sliceheight * i); goto finished; } } *v++ = 0.0; finished:; } } PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatView_SeqSELL_ASCII(Mat A, PetscViewer viewer) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt i, j, m = A->rmap->n, shift; const char *name; PetscViewerFormat format; PetscFunctionBegin; PetscCall(PetscViewerGetFormat(viewer, &format)); if (format == PETSC_VIEWER_ASCII_MATLAB) { PetscInt nofinalvalue = 0; /* if (m && ((a->i[m] == a->i[m-1]) || (a->j[a->nz-1] != A->cmap->n-1))) nofinalvalue = 1; */ PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_FALSE)); PetscCall(PetscViewerASCIIPrintf(viewer, "%% Size = %" PetscInt_FMT " %" PetscInt_FMT " \n", m, A->cmap->n)); PetscCall(PetscViewerASCIIPrintf(viewer, "%% Nonzeros = %" PetscInt_FMT " \n", a->nz)); #if defined(PETSC_USE_COMPLEX) PetscCall(PetscViewerASCIIPrintf(viewer, "zzz = zeros(%" PetscInt_FMT ",4);\n", a->nz + nofinalvalue)); #else PetscCall(PetscViewerASCIIPrintf(viewer, "zzz = zeros(%" PetscInt_FMT ",3);\n", a->nz + nofinalvalue)); #endif PetscCall(PetscViewerASCIIPrintf(viewer, "zzz = [\n")); for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; for (j = 0; j < a->rlen[i]; j++) { #if defined(PETSC_USE_COMPLEX) PetscCall(PetscViewerASCIIPrintf(viewer, "%" PetscInt_FMT " %" PetscInt_FMT " %18.16e %18.16e\n", i + 1, a->colidx[shift + a->sliceheight * j] + 1, (double)PetscRealPart(a->val[shift + a->sliceheight * j]), (double)PetscImaginaryPart(a->val[shift + a->sliceheight * j]))); #else PetscCall(PetscViewerASCIIPrintf(viewer, "%" PetscInt_FMT " %" PetscInt_FMT " %18.16e\n", i + 1, a->colidx[shift + a->sliceheight * j] + 1, (double)a->val[shift + a->sliceheight * j])); #endif } } /* if (nofinalvalue) { #if defined(PETSC_USE_COMPLEX) PetscCall(PetscViewerASCIIPrintf(viewer,"%" PetscInt_FMT " %" PetscInt_FMT " %18.16e %18.16e\n",m,A->cmap->n,0.,0.)); #else PetscCall(PetscViewerASCIIPrintf(viewer,"%" PetscInt_FMT " %" PetscInt_FMT " %18.16e\n",m,A->cmap->n,0.0)); #endif } */ PetscCall(PetscObjectGetName((PetscObject)A, &name)); PetscCall(PetscViewerASCIIPrintf(viewer, "];\n %s = spconvert(zzz);\n", name)); PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_TRUE)); } else if (format == PETSC_VIEWER_ASCII_FACTOR_INFO || format == PETSC_VIEWER_ASCII_INFO) { PetscFunctionReturn(PETSC_SUCCESS); } else if (format == PETSC_VIEWER_ASCII_COMMON) { PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_FALSE)); for (i = 0; i < m; i++) { PetscCall(PetscViewerASCIIPrintf(viewer, "row %" PetscInt_FMT ":", i)); shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; for (j = 0; j < a->rlen[i]; j++) { #if defined(PETSC_USE_COMPLEX) if (PetscImaginaryPart(a->val[shift + a->sliceheight * j]) > 0.0 && PetscRealPart(a->val[shift + a->sliceheight * j]) != 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g + %g i)", a->colidx[shift + a->sliceheight * j], (double)PetscRealPart(a->val[shift + a->sliceheight * j]), (double)PetscImaginaryPart(a->val[shift + a->sliceheight * j]))); } else if (PetscImaginaryPart(a->val[shift + a->sliceheight * j]) < 0.0 && PetscRealPart(a->val[shift + a->sliceheight * j]) != 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g - %g i)", a->colidx[shift + a->sliceheight * j], (double)PetscRealPart(a->val[shift + a->sliceheight * j]), (double)-PetscImaginaryPart(a->val[shift + a->sliceheight * j]))); } else if (PetscRealPart(a->val[shift + a->sliceheight * j]) != 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[shift + a->sliceheight * j], (double)PetscRealPart(a->val[shift + a->sliceheight * j]))); } #else if (a->val[shift + a->sliceheight * j] != 0.0) PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[shift + a->sliceheight * j], (double)a->val[shift + a->sliceheight * j])); #endif } PetscCall(PetscViewerASCIIPrintf(viewer, "\n")); } PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_TRUE)); } else if (format == PETSC_VIEWER_ASCII_DENSE) { PetscInt cnt = 0, jcnt; PetscScalar value; #if defined(PETSC_USE_COMPLEX) PetscBool realonly = PETSC_TRUE; for (i = 0; i < a->sliidx[a->totalslices]; i++) { if (PetscImaginaryPart(a->val[i]) != 0.0) { realonly = PETSC_FALSE; break; } } #endif PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_FALSE)); for (i = 0; i < m; i++) { jcnt = 0; shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; for (j = 0; j < A->cmap->n; j++) { if (jcnt < a->rlen[i] && j == a->colidx[shift + a->sliceheight * j]) { value = a->val[cnt++]; jcnt++; } else { value = 0.0; } #if defined(PETSC_USE_COMPLEX) if (realonly) { PetscCall(PetscViewerASCIIPrintf(viewer, " %7.5e ", (double)PetscRealPart(value))); } else { PetscCall(PetscViewerASCIIPrintf(viewer, " %7.5e+%7.5e i ", (double)PetscRealPart(value), (double)PetscImaginaryPart(value))); } #else PetscCall(PetscViewerASCIIPrintf(viewer, " %7.5e ", (double)value)); #endif } PetscCall(PetscViewerASCIIPrintf(viewer, "\n")); } PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_TRUE)); } else if (format == PETSC_VIEWER_ASCII_MATRIXMARKET) { PetscInt fshift = 1; PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_FALSE)); #if defined(PETSC_USE_COMPLEX) PetscCall(PetscViewerASCIIPrintf(viewer, "%%%%MatrixMarket matrix coordinate complex general\n")); #else PetscCall(PetscViewerASCIIPrintf(viewer, "%%%%MatrixMarket matrix coordinate real general\n")); #endif PetscCall(PetscViewerASCIIPrintf(viewer, "%" PetscInt_FMT " %" PetscInt_FMT " %" PetscInt_FMT "\n", m, A->cmap->n, a->nz)); for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; for (j = 0; j < a->rlen[i]; j++) { #if defined(PETSC_USE_COMPLEX) PetscCall(PetscViewerASCIIPrintf(viewer, "%" PetscInt_FMT " %" PetscInt_FMT " %g %g\n", i + fshift, a->colidx[shift + a->sliceheight * j] + fshift, (double)PetscRealPart(a->val[shift + a->sliceheight * j]), (double)PetscImaginaryPart(a->val[shift + a->sliceheight * j]))); #else PetscCall(PetscViewerASCIIPrintf(viewer, "%" PetscInt_FMT " %" PetscInt_FMT " %g\n", i + fshift, a->colidx[shift + a->sliceheight * j] + fshift, (double)a->val[shift + a->sliceheight * j])); #endif } } PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_TRUE)); } else if (format == PETSC_VIEWER_NATIVE) { for (i = 0; i < a->totalslices; i++) { /* loop over slices */ PetscInt row; PetscCall(PetscViewerASCIIPrintf(viewer, "slice %" PetscInt_FMT ": %" PetscInt_FMT " %" PetscInt_FMT "\n", i, a->sliidx[i], a->sliidx[i + 1])); for (j = a->sliidx[i], row = 0; j < a->sliidx[i + 1]; j++, row = (row + 1) % a->sliceheight) { #if defined(PETSC_USE_COMPLEX) if (PetscImaginaryPart(a->val[j]) > 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " %" PetscInt_FMT " %" PetscInt_FMT " %g + %g i\n", a->sliceheight * i + row, a->colidx[j], (double)PetscRealPart(a->val[j]), (double)PetscImaginaryPart(a->val[j]))); } else if (PetscImaginaryPart(a->val[j]) < 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " %" PetscInt_FMT " %" PetscInt_FMT " %g - %g i\n", a->sliceheight * i + row, a->colidx[j], (double)PetscRealPart(a->val[j]), -(double)PetscImaginaryPart(a->val[j]))); } else { PetscCall(PetscViewerASCIIPrintf(viewer, " %" PetscInt_FMT " %" PetscInt_FMT " %g\n", a->sliceheight * i + row, a->colidx[j], (double)PetscRealPart(a->val[j]))); } #else PetscCall(PetscViewerASCIIPrintf(viewer, " %" PetscInt_FMT " %" PetscInt_FMT " %g\n", a->sliceheight * i + row, a->colidx[j], (double)a->val[j])); #endif } } } else { PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_FALSE)); if (A->factortype) { for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; PetscCall(PetscViewerASCIIPrintf(viewer, "row %" PetscInt_FMT ":", i)); /* L part */ for (j = shift; j < a->diag[i]; j += a->sliceheight) { #if defined(PETSC_USE_COMPLEX) if (PetscImaginaryPart(a->val[shift + a->sliceheight * j]) > 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g + %g i)", a->colidx[j], (double)PetscRealPart(a->val[j]), (double)PetscImaginaryPart(a->val[j]))); } else if (PetscImaginaryPart(a->val[shift + a->sliceheight * j]) < 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g - %g i)", a->colidx[j], (double)PetscRealPart(a->val[j]), (double)(-PetscImaginaryPart(a->val[j])))); } else { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[j], (double)PetscRealPart(a->val[j]))); } #else PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[j], (double)a->val[j])); #endif } /* diagonal */ j = a->diag[i]; #if defined(PETSC_USE_COMPLEX) if (PetscImaginaryPart(a->val[j]) > 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g + %g i)", a->colidx[j], (double)PetscRealPart(1.0 / a->val[j]), (double)PetscImaginaryPart(1.0 / a->val[j]))); } else if (PetscImaginaryPart(a->val[j]) < 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g - %g i)", a->colidx[j], (double)PetscRealPart(1.0 / a->val[j]), (double)(-PetscImaginaryPart(1.0 / a->val[j])))); } else { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[j], (double)PetscRealPart(1.0 / a->val[j]))); } #else PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[j], (double)(1 / a->val[j]))); #endif /* U part */ for (j = a->diag[i] + 1; j < shift + a->sliceheight * a->rlen[i]; j += a->sliceheight) { #if defined(PETSC_USE_COMPLEX) if (PetscImaginaryPart(a->val[j]) > 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g + %g i)", a->colidx[j], (double)PetscRealPart(a->val[j]), (double)PetscImaginaryPart(a->val[j]))); } else if (PetscImaginaryPart(a->val[j]) < 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g - %g i)", a->colidx[j], (double)PetscRealPart(a->val[j]), (double)(-PetscImaginaryPart(a->val[j])))); } else { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[j], (double)PetscRealPart(a->val[j]))); } #else PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[j], (double)a->val[j])); #endif } PetscCall(PetscViewerASCIIPrintf(viewer, "\n")); } } else { for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; PetscCall(PetscViewerASCIIPrintf(viewer, "row %" PetscInt_FMT ":", i)); for (j = 0; j < a->rlen[i]; j++) { #if defined(PETSC_USE_COMPLEX) if (PetscImaginaryPart(a->val[j]) > 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g + %g i)", a->colidx[shift + a->sliceheight * j], (double)PetscRealPart(a->val[shift + a->sliceheight * j]), (double)PetscImaginaryPart(a->val[shift + a->sliceheight * j]))); } else if (PetscImaginaryPart(a->val[j]) < 0.0) { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g - %g i)", a->colidx[shift + a->sliceheight * j], (double)PetscRealPart(a->val[shift + a->sliceheight * j]), (double)-PetscImaginaryPart(a->val[shift + a->sliceheight * j]))); } else { PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[shift + a->sliceheight * j], (double)PetscRealPart(a->val[shift + a->sliceheight * j]))); } #else PetscCall(PetscViewerASCIIPrintf(viewer, " (%" PetscInt_FMT ", %g) ", a->colidx[shift + a->sliceheight * j], (double)a->val[shift + a->sliceheight * j])); #endif } PetscCall(PetscViewerASCIIPrintf(viewer, "\n")); } } PetscCall(PetscViewerASCIIUseTabs(viewer, PETSC_TRUE)); } PetscCall(PetscViewerFlush(viewer)); PetscFunctionReturn(PETSC_SUCCESS); } #include static PetscErrorCode MatView_SeqSELL_Draw_Zoom(PetscDraw draw, void *Aa) { Mat A = (Mat)Aa; Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt i, j, m = A->rmap->n, shift; int color; PetscReal xl, yl, xr, yr, x_l, x_r, y_l, y_r; PetscViewer viewer; PetscViewerFormat format; PetscFunctionBegin; PetscCall(PetscObjectQuery((PetscObject)A, "Zoomviewer", (PetscObject *)&viewer)); PetscCall(PetscViewerGetFormat(viewer, &format)); PetscCall(PetscDrawGetCoordinates(draw, &xl, &yl, &xr, &yr)); /* loop over matrix elements drawing boxes */ if (format != PETSC_VIEWER_DRAW_CONTOUR) { PetscDrawCollectiveBegin(draw); /* Blue for negative, Cyan for zero and Red for positive */ color = PETSC_DRAW_BLUE; for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ y_l = m - i - 1.0; y_r = y_l + 1.0; for (j = 0; j < a->rlen[i]; j++) { x_l = a->colidx[shift + a->sliceheight * j]; x_r = x_l + 1.0; if (PetscRealPart(a->val[shift + a->sliceheight * j]) >= 0.) continue; PetscCall(PetscDrawRectangle(draw, x_l, y_l, x_r, y_r, color, color, color, color)); } } color = PETSC_DRAW_CYAN; for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; y_l = m - i - 1.0; y_r = y_l + 1.0; for (j = 0; j < a->rlen[i]; j++) { x_l = a->colidx[shift + a->sliceheight * j]; x_r = x_l + 1.0; if (a->val[shift + a->sliceheight * j] != 0.) continue; PetscCall(PetscDrawRectangle(draw, x_l, y_l, x_r, y_r, color, color, color, color)); } } color = PETSC_DRAW_RED; for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; y_l = m - i - 1.0; y_r = y_l + 1.0; for (j = 0; j < a->rlen[i]; j++) { x_l = a->colidx[shift + a->sliceheight * j]; x_r = x_l + 1.0; if (PetscRealPart(a->val[shift + a->sliceheight * j]) <= 0.) continue; PetscCall(PetscDrawRectangle(draw, x_l, y_l, x_r, y_r, color, color, color, color)); } } PetscDrawCollectiveEnd(draw); } else { /* use contour shading to indicate magnitude of values */ /* first determine max of all nonzero values */ PetscReal minv = 0.0, maxv = 0.0; PetscInt count = 0; PetscDraw popup; for (i = 0; i < a->sliidx[a->totalslices]; i++) { if (PetscAbsScalar(a->val[i]) > maxv) maxv = PetscAbsScalar(a->val[i]); } if (minv >= maxv) maxv = minv + PETSC_SMALL; PetscCall(PetscDrawGetPopup(draw, &popup)); PetscCall(PetscDrawScalePopup(popup, minv, maxv)); PetscDrawCollectiveBegin(draw); for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; y_l = m - i - 1.0; y_r = y_l + 1.0; for (j = 0; j < a->rlen[i]; j++) { x_l = a->colidx[shift + a->sliceheight * j]; x_r = x_l + 1.0; color = PetscDrawRealToColor(PetscAbsScalar(a->val[count]), minv, maxv); PetscCall(PetscDrawRectangle(draw, x_l, y_l, x_r, y_r, color, color, color, color)); count++; } } PetscDrawCollectiveEnd(draw); } PetscFunctionReturn(PETSC_SUCCESS); } #include static PetscErrorCode MatView_SeqSELL_Draw(Mat A, PetscViewer viewer) { PetscDraw draw; PetscReal xr, yr, xl, yl, h, w; PetscBool isnull; PetscFunctionBegin; PetscCall(PetscViewerDrawGetDraw(viewer, 0, &draw)); PetscCall(PetscDrawIsNull(draw, &isnull)); if (isnull) PetscFunctionReturn(PETSC_SUCCESS); xr = A->cmap->n; yr = A->rmap->n; h = yr / 10.0; w = xr / 10.0; xr += w; yr += h; xl = -w; yl = -h; PetscCall(PetscDrawSetCoordinates(draw, xl, yl, xr, yr)); PetscCall(PetscObjectCompose((PetscObject)A, "Zoomviewer", (PetscObject)viewer)); PetscCall(PetscDrawZoom(draw, MatView_SeqSELL_Draw_Zoom, A)); PetscCall(PetscObjectCompose((PetscObject)A, "Zoomviewer", NULL)); PetscCall(PetscDrawSave(draw)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatView_SeqSELL(Mat A, PetscViewer viewer) { PetscBool isascii, isbinary, isdraw; PetscFunctionBegin; PetscCall(PetscObjectTypeCompare((PetscObject)viewer, PETSCVIEWERASCII, &isascii)); PetscCall(PetscObjectTypeCompare((PetscObject)viewer, PETSCVIEWERBINARY, &isbinary)); PetscCall(PetscObjectTypeCompare((PetscObject)viewer, PETSCVIEWERDRAW, &isdraw)); if (isascii) { PetscCall(MatView_SeqSELL_ASCII(A, viewer)); } else if (isbinary) { /* PetscCall(MatView_SeqSELL_Binary(A,viewer)); */ } else if (isdraw) PetscCall(MatView_SeqSELL_Draw(A, viewer)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatAssemblyEnd_SeqSELL(Mat A, MatAssemblyType mode) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt i, shift, row_in_slice, row, nrow, *cp, lastcol, j, k; MatScalar *vp; #if defined(PETSC_HAVE_CUPM) PetscInt totalchunks = 0; #endif PetscFunctionBegin; if (mode == MAT_FLUSH_ASSEMBLY) PetscFunctionReturn(PETSC_SUCCESS); /* To do: compress out the unused elements */ PetscCall(PetscInfo(A, "Matrix size: %" PetscInt_FMT " X %" PetscInt_FMT "; storage space: %" PetscInt_FMT " allocated %" PetscInt_FMT " used (%" PetscInt_FMT " nonzeros+%" PetscInt_FMT " paddedzeros)\n", A->rmap->n, A->cmap->n, a->maxallocmat, a->sliidx[a->totalslices], a->nz, a->sliidx[a->totalslices] - a->nz)); PetscCall(PetscInfo(A, "Number of mallocs during MatSetValues() is %" PetscInt_FMT "\n", a->reallocs)); PetscCall(PetscInfo(A, "Maximum nonzeros in any row is %" PetscInt_FMT "\n", a->rlenmax)); a->nonzerorowcnt = 0; /* Set unused slots for column indices to last valid column index. Set unused slots for values to zero. This allows for a use of unmasked intrinsics -> higher performance */ for (i = 0; i < a->totalslices; ++i) { shift = a->sliidx[i]; /* starting index of the slice */ cp = PetscSafePointerPlusOffset(a->colidx, shift); /* pointer to the column indices of the slice */ vp = PetscSafePointerPlusOffset(a->val, shift); /* pointer to the nonzero values of the slice */ for (row_in_slice = 0; row_in_slice < a->sliceheight; ++row_in_slice) { /* loop over rows in the slice */ row = a->sliceheight * i + row_in_slice; nrow = a->rlen[row]; /* number of nonzeros in row */ /* Search for the nearest nonzero. Normally setting the index to zero may cause extra communication. But if the entire slice are empty, it is fine to use 0 since the index will not be loaded. */ lastcol = 0; if (nrow > 0) { /* nonempty row */ a->nonzerorowcnt++; lastcol = cp[a->sliceheight * (nrow - 1) + row_in_slice]; /* use the index from the last nonzero at current row */ } else if (!row_in_slice) { /* first row of the correct slice is empty */ for (j = 1; j < a->sliceheight; j++) { if (a->rlen[a->sliceheight * i + j]) { lastcol = cp[j]; break; } } } else { if (a->sliidx[i + 1] != shift) lastcol = cp[row_in_slice - 1]; /* use the index from the previous row */ } for (k = nrow; k < (a->sliidx[i + 1] - shift) / a->sliceheight; ++k) { cp[a->sliceheight * k + row_in_slice] = lastcol; vp[a->sliceheight * k + row_in_slice] = (MatScalar)0; } } } A->info.mallocs += a->reallocs; a->reallocs = 0; #if defined(PETSC_HAVE_CUPM) if (!a->chunksize && a->totalslices) { a->chunksize = 64; while (a->chunksize < 1024 && 2 * a->chunksize <= a->sliidx[a->totalslices] / a->totalslices) a->chunksize *= 2; totalchunks = 1 + (a->sliidx[a->totalslices] - 1) / a->chunksize; } if (totalchunks != a->totalchunks) { PetscCall(PetscFree(a->chunk_slice_map)); PetscCall(PetscMalloc1(totalchunks, &a->chunk_slice_map)); a->totalchunks = totalchunks; } j = 0; for (i = 0; i < totalchunks; i++) { while (a->sliidx[j + 1] <= i * a->chunksize && j < a->totalslices) j++; a->chunk_slice_map[i] = j; } #endif PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatGetInfo_SeqSELL(Mat A, MatInfoType flag, MatInfo *info) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscFunctionBegin; info->block_size = 1.0; info->nz_allocated = a->maxallocmat; info->nz_used = a->sliidx[a->totalslices]; /* include padding zeros */ info->nz_unneeded = (a->maxallocmat - a->sliidx[a->totalslices]); info->assemblies = A->num_ass; info->mallocs = A->info.mallocs; info->memory = 0; /* REVIEW ME */ if (A->factortype) { info->fill_ratio_given = A->info.fill_ratio_given; info->fill_ratio_needed = A->info.fill_ratio_needed; info->factor_mallocs = A->info.factor_mallocs; } else { info->fill_ratio_given = 0; info->fill_ratio_needed = 0; info->factor_mallocs = 0; } PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatSetValues_SeqSELL(Mat A, PetscInt m, const PetscInt im[], PetscInt n, const PetscInt in[], const PetscScalar v[], InsertMode is) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscInt shift, i, k, l, low, high, t, ii, row, col, nrow; PetscInt *cp, nonew = a->nonew, lastcol = -1; MatScalar *vp, value; #if defined(PETSC_HAVE_CUPM) PetscBool inserted = PETSC_FALSE; PetscInt mul = DEVICE_MEM_ALIGN / a->sliceheight; #endif PetscFunctionBegin; for (k = 0; k < m; k++) { /* loop over added rows */ row = im[k]; if (row < 0) continue; PetscCheck(row < A->rmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Row too large: row %" PetscInt_FMT " max %" PetscInt_FMT, row, A->rmap->n - 1); shift = a->sliidx[row / a->sliceheight] + row % a->sliceheight; /* starting index of the row */ cp = a->colidx + shift; /* pointer to the row */ vp = a->val + shift; /* pointer to the row */ nrow = a->rlen[row]; low = 0; high = nrow; for (l = 0; l < n; l++) { /* loop over added columns */ col = in[l]; if (col < 0) continue; PetscCheck(col < A->cmap->n, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Col too large: row %" PetscInt_FMT " max %" PetscInt_FMT, col, A->cmap->n - 1); if (a->roworiented) { value = v[l + k * n]; } else { value = v[k + l * m]; } if ((value == 0.0 && a->ignorezeroentries) && (is == ADD_VALUES)) continue; /* search in this row for the specified column, i indicates the column to be set */ if (col <= lastcol) low = 0; else high = nrow; lastcol = col; while (high - low > 5) { t = (low + high) / 2; if (*(cp + a->sliceheight * t) > col) high = t; else low = t; } for (i = low; i < high; i++) { if (*(cp + a->sliceheight * i) > col) break; if (*(cp + a->sliceheight * i) == col) { if (is == ADD_VALUES) *(vp + a->sliceheight * i) += value; else *(vp + a->sliceheight * i) = value; #if defined(PETSC_HAVE_CUPM) inserted = PETSC_TRUE; #endif low = i + 1; goto noinsert; } } if (value == 0.0 && a->ignorezeroentries) goto noinsert; if (nonew == 1) goto noinsert; PetscCheck(nonew != -1, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Inserting a new nonzero (%" PetscInt_FMT ", %" PetscInt_FMT ") in the matrix", row, col); #if defined(PETSC_HAVE_CUPM) MatSeqXSELLReallocateSELL(A, A->rmap->n, 1, nrow, a->sliidx, a->sliceheight, row / a->sliceheight, row, col, a->colidx, a->val, cp, vp, nonew, MatScalar, mul); #else /* If the current row length exceeds the slice width (e.g. nrow==slice_width), allocate a new space, otherwise do nothing */ MatSeqXSELLReallocateSELL(A, A->rmap->n, 1, nrow, a->sliidx, a->sliceheight, row / a->sliceheight, row, col, a->colidx, a->val, cp, vp, nonew, MatScalar, 1); #endif /* add the new nonzero to the high position, shift the remaining elements in current row to the right by one slot */ for (ii = nrow - 1; ii >= i; ii--) { *(cp + a->sliceheight * (ii + 1)) = *(cp + a->sliceheight * ii); *(vp + a->sliceheight * (ii + 1)) = *(vp + a->sliceheight * ii); } a->rlen[row]++; *(cp + a->sliceheight * i) = col; *(vp + a->sliceheight * i) = value; a->nz++; #if defined(PETSC_HAVE_CUPM) inserted = PETSC_TRUE; #endif low = i + 1; high++; nrow++; noinsert:; } a->rlen[row] = nrow; } #if defined(PETSC_HAVE_CUPM) if (A->offloadmask != PETSC_OFFLOAD_UNALLOCATED && inserted) A->offloadmask = PETSC_OFFLOAD_CPU; #endif PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatCopy_SeqSELL(Mat A, Mat B, MatStructure str) { PetscFunctionBegin; /* If the two matrices have the same copy implementation, use fast copy. */ if (str == SAME_NONZERO_PATTERN && (A->ops->copy == B->ops->copy)) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; Mat_SeqSELL *b = (Mat_SeqSELL *)B->data; PetscCheck(a->sliidx[a->totalslices] == b->sliidx[b->totalslices], PETSC_COMM_SELF, PETSC_ERR_ARG_INCOMP, "Number of nonzeros in two matrices are different"); PetscCall(PetscArraycpy(b->val, a->val, a->sliidx[a->totalslices])); } else { PetscCall(MatCopy_Basic(A, B, str)); } PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatSetUp_SeqSELL(Mat A) { PetscFunctionBegin; PetscCall(MatSeqSELLSetPreallocation(A, PETSC_DEFAULT, NULL)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatSeqSELLGetArray_SeqSELL(Mat A, PetscScalar *array[]) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscFunctionBegin; *array = a->val; PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatSeqSELLRestoreArray_SeqSELL(Mat A, PetscScalar *array[]) { PetscFunctionBegin; PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatScale_SeqSELL(Mat inA, PetscScalar alpha) { Mat_SeqSELL *a = (Mat_SeqSELL *)inA->data; MatScalar *aval = a->val; PetscScalar oalpha = alpha; PetscBLASInt one = 1, size; PetscFunctionBegin; PetscCall(PetscBLASIntCast(a->sliidx[a->totalslices], &size)); PetscCallBLAS("BLASscal", BLASscal_(&size, &oalpha, aval, &one)); PetscCall(PetscLogFlops(a->nz)); #if defined(PETSC_HAVE_CUPM) if (inA->offloadmask != PETSC_OFFLOAD_UNALLOCATED) inA->offloadmask = PETSC_OFFLOAD_CPU; #endif PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatShift_SeqSELL(Mat Y, PetscScalar a) { Mat_SeqSELL *y = (Mat_SeqSELL *)Y->data; PetscFunctionBegin; if (!Y->preallocated || !y->nz) PetscCall(MatSeqSELLSetPreallocation(Y, 1, NULL)); PetscCall(MatShift_Basic(Y, a)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatSOR_SeqSELL(Mat A, Vec bb, PetscReal omega, MatSORType flag, PetscReal fshift, PetscInt its, PetscInt lits, Vec xx) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscScalar *x, sum, *t; const MatScalar *idiag = NULL, *mdiag; const PetscScalar *b, *xb; PetscInt n, m = A->rmap->n, i, j, shift; const PetscInt *diag; PetscFunctionBegin; its = its * lits; PetscCall(MatInvertDiagonalForSOR_SeqSELL(A, omega, fshift)); diag = a->diag; t = a->ssor_work; idiag = a->idiag; mdiag = a->mdiag; PetscCall(VecGetArray(xx, &x)); PetscCall(VecGetArrayRead(bb, &b)); /* We count flops by assuming the upper triangular and lower triangular parts have the same number of nonzeros */ PetscCheck(flag != SOR_APPLY_UPPER, PETSC_COMM_SELF, PETSC_ERR_SUP, "SOR_APPLY_UPPER is not implemented"); PetscCheck(flag != SOR_APPLY_LOWER, PETSC_COMM_SELF, PETSC_ERR_SUP, "SOR_APPLY_LOWER is not implemented"); PetscCheck(!(flag & SOR_EISENSTAT), PETSC_COMM_SELF, PETSC_ERR_SUP, "No support yet for Eisenstat"); if (flag & SOR_ZERO_INITIAL_GUESS) { if ((flag & SOR_FORWARD_SWEEP) || (flag & SOR_LOCAL_FORWARD_SWEEP)) { for (i = 0; i < m; i++) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ sum = b[i]; n = (diag[i] - shift) / a->sliceheight; for (j = 0; j < n; j++) sum -= a->val[shift + a->sliceheight * j] * x[a->colidx[shift + a->sliceheight * j]]; t[i] = sum; x[i] = sum * idiag[i]; } xb = t; PetscCall(PetscLogFlops(a->nz)); } else xb = b; if ((flag & SOR_BACKWARD_SWEEP) || (flag & SOR_LOCAL_BACKWARD_SWEEP)) { for (i = m - 1; i >= 0; i--) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ sum = xb[i]; n = a->rlen[i] - (diag[i] - shift) / a->sliceheight - 1; for (j = 1; j <= n; j++) sum -= a->val[diag[i] + a->sliceheight * j] * x[a->colidx[diag[i] + a->sliceheight * j]]; if (xb == b) { x[i] = sum * idiag[i]; } else { x[i] = (1. - omega) * x[i] + sum * idiag[i]; /* omega in idiag */ } } PetscCall(PetscLogFlops(a->nz)); /* assumes 1/2 in upper */ } its--; } while (its--) { if ((flag & SOR_FORWARD_SWEEP) || (flag & SOR_LOCAL_FORWARD_SWEEP)) { for (i = 0; i < m; i++) { /* lower */ shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ sum = b[i]; n = (diag[i] - shift) / a->sliceheight; for (j = 0; j < n; j++) sum -= a->val[shift + a->sliceheight * j] * x[a->colidx[shift + a->sliceheight * j]]; t[i] = sum; /* save application of the lower-triangular part */ /* upper */ n = a->rlen[i] - (diag[i] - shift) / a->sliceheight - 1; for (j = 1; j <= n; j++) sum -= a->val[diag[i] + a->sliceheight * j] * x[a->colidx[diag[i] + a->sliceheight * j]]; x[i] = (1. - omega) * x[i] + sum * idiag[i]; /* omega in idiag */ } xb = t; PetscCall(PetscLogFlops(2.0 * a->nz)); } else xb = b; if ((flag & SOR_BACKWARD_SWEEP) || (flag & SOR_LOCAL_BACKWARD_SWEEP)) { for (i = m - 1; i >= 0; i--) { shift = a->sliidx[i / a->sliceheight] + i % a->sliceheight; /* starting index of the row i */ sum = xb[i]; if (xb == b) { /* whole matrix (no checkpointing available) */ n = a->rlen[i]; for (j = 0; j < n; j++) sum -= a->val[shift + a->sliceheight * j] * x[a->colidx[shift + a->sliceheight * j]]; x[i] = (1. - omega) * x[i] + (sum + mdiag[i] * x[i]) * idiag[i]; } else { /* lower-triangular part has been saved, so only apply upper-triangular */ n = a->rlen[i] - (diag[i] - shift) / a->sliceheight - 1; for (j = 1; j <= n; j++) sum -= a->val[diag[i] + a->sliceheight * j] * x[a->colidx[diag[i] + a->sliceheight * j]]; x[i] = (1. - omega) * x[i] + sum * idiag[i]; /* omega in idiag */ } } if (xb == b) { PetscCall(PetscLogFlops(2.0 * a->nz)); } else { PetscCall(PetscLogFlops(a->nz)); /* assumes 1/2 in upper */ } } } PetscCall(VecRestoreArray(xx, &x)); PetscCall(VecRestoreArrayRead(bb, &b)); PetscFunctionReturn(PETSC_SUCCESS); } static struct _MatOps MatOps_Values = {MatSetValues_SeqSELL, MatGetRow_SeqSELL, MatRestoreRow_SeqSELL, MatMult_SeqSELL, /* 4*/ MatMultAdd_SeqSELL, MatMultTranspose_SeqSELL, MatMultTransposeAdd_SeqSELL, NULL, NULL, NULL, /* 10*/ NULL, NULL, NULL, MatSOR_SeqSELL, NULL, /* 15*/ MatGetInfo_SeqSELL, MatEqual_SeqSELL, MatGetDiagonal_SeqSELL, MatDiagonalScale_SeqSELL, NULL, /* 20*/ NULL, MatAssemblyEnd_SeqSELL, MatSetOption_SeqSELL, MatZeroEntries_SeqSELL, /* 24*/ NULL, NULL, NULL, NULL, NULL, /* 29*/ MatSetUp_SeqSELL, NULL, NULL, NULL, NULL, /* 34*/ MatDuplicate_SeqSELL, NULL, NULL, NULL, NULL, /* 39*/ NULL, NULL, NULL, MatGetValues_SeqSELL, MatCopy_SeqSELL, /* 44*/ NULL, MatScale_SeqSELL, MatShift_SeqSELL, NULL, NULL, /* 49*/ NULL, NULL, NULL, NULL, NULL, /* 54*/ MatFDColoringCreate_SeqXAIJ, NULL, NULL, NULL, NULL, /* 59*/ NULL, MatDestroy_SeqSELL, MatView_SeqSELL, NULL, NULL, /* 64*/ NULL, NULL, NULL, NULL, NULL, /* 69*/ NULL, NULL, NULL, MatFDColoringApply_AIJ, /* reuse the FDColoring function for AIJ */ NULL, /* 74*/ NULL, NULL, NULL, NULL, NULL, /* 79*/ NULL, NULL, NULL, NULL, NULL, /* 84*/ NULL, NULL, NULL, NULL, NULL, /* 89*/ NULL, NULL, NULL, NULL, MatConjugate_SeqSELL, /* 94*/ NULL, NULL, NULL, NULL, NULL, /* 99*/ NULL, NULL, NULL, NULL, NULL, /*104*/ NULL, NULL, NULL, NULL, NULL, /*109*/ NULL, NULL, NULL, NULL, NULL, /*114*/ NULL, NULL, NULL, NULL, NULL, /*119*/ NULL, NULL, NULL, NULL, NULL, /*124*/ NULL, NULL, NULL, NULL, MatFDColoringSetUp_SeqXAIJ, /*129*/ NULL, NULL, NULL, NULL, NULL, /*134*/ NULL, NULL, NULL, NULL, NULL, /*139*/ NULL, NULL, NULL, NULL, NULL}; static PetscErrorCode MatStoreValues_SeqSELL(Mat mat) { Mat_SeqSELL *a = (Mat_SeqSELL *)mat->data; PetscFunctionBegin; PetscCheck(a->nonew, PETSC_COMM_SELF, PETSC_ERR_ORDER, "Must call MatSetOption(A,MAT_NEW_NONZERO_LOCATIONS,PETSC_FALSE);first"); /* allocate space for values if not already there */ if (!a->saved_values) PetscCall(PetscMalloc1(a->sliidx[a->totalslices] + 1, &a->saved_values)); /* copy values over */ PetscCall(PetscArraycpy(a->saved_values, a->val, a->sliidx[a->totalslices])); PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatRetrieveValues_SeqSELL(Mat mat) { Mat_SeqSELL *a = (Mat_SeqSELL *)mat->data; PetscFunctionBegin; PetscCheck(a->nonew, PETSC_COMM_SELF, PETSC_ERR_ORDER, "Must call MatSetOption(A,MAT_NEW_NONZERO_LOCATIONS,PETSC_FALSE);first"); PetscCheck(a->saved_values, PETSC_COMM_SELF, PETSC_ERR_ORDER, "Must call MatStoreValues(A);first"); PetscCall(PetscArraycpy(a->val, a->saved_values, a->sliidx[a->totalslices])); PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatSeqSELLGetFillRatio_SeqSELL(Mat mat, PetscReal *ratio) { Mat_SeqSELL *a = (Mat_SeqSELL *)mat->data; PetscFunctionBegin; if (a->totalslices && a->sliidx[a->totalslices]) { *ratio = (PetscReal)(a->sliidx[a->totalslices] - a->nz) / a->sliidx[a->totalslices]; } else { *ratio = 0.0; } PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatSeqSELLGetMaxSliceWidth_SeqSELL(Mat mat, PetscInt *slicewidth) { Mat_SeqSELL *a = (Mat_SeqSELL *)mat->data; PetscInt i, current_slicewidth; PetscFunctionBegin; *slicewidth = 0; for (i = 0; i < a->totalslices; i++) { current_slicewidth = (a->sliidx[i + 1] - a->sliidx[i]) / a->sliceheight; if (current_slicewidth > *slicewidth) *slicewidth = current_slicewidth; } PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatSeqSELLGetAvgSliceWidth_SeqSELL(Mat mat, PetscReal *slicewidth) { Mat_SeqSELL *a = (Mat_SeqSELL *)mat->data; PetscFunctionBegin; *slicewidth = 0; if (a->totalslices) *slicewidth = (PetscReal)a->sliidx[a->totalslices] / a->sliceheight / a->totalslices; PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatSeqSELLGetVarSliceSize_SeqSELL(Mat mat, PetscReal *variance) { Mat_SeqSELL *a = (Mat_SeqSELL *)mat->data; PetscReal mean; PetscInt i, totalslices = a->totalslices, *sliidx = a->sliidx; PetscFunctionBegin; *variance = 0; if (totalslices) { mean = (PetscReal)sliidx[totalslices] / totalslices; for (i = 1; i <= totalslices; i++) *variance += ((PetscReal)(sliidx[i] - sliidx[i - 1]) - mean) * ((PetscReal)(sliidx[i] - sliidx[i - 1]) - mean) / totalslices; } PetscFunctionReturn(PETSC_SUCCESS); } static PetscErrorCode MatSeqSELLSetSliceHeight_SeqSELL(Mat A, PetscInt sliceheight) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscFunctionBegin; if (A->preallocated) PetscFunctionReturn(PETSC_SUCCESS); PetscCheck(a->sliceheight <= 0 || a->sliceheight == sliceheight, PETSC_COMM_SELF, PETSC_ERR_SUP, "Cannot change slice height %" PetscInt_FMT " to %" PetscInt_FMT, a->sliceheight, sliceheight); a->sliceheight = sliceheight; #if defined(PETSC_HAVE_CUPM) PetscCheck(PetscMax(DEVICE_MEM_ALIGN, sliceheight) % PetscMin(DEVICE_MEM_ALIGN, sliceheight) == 0, PETSC_COMM_SELF, PETSC_ERR_SUP, "The slice height is not compatible with DEVICE_MEM_ALIGN (one must be divisible by the other) %" PetscInt_FMT, sliceheight); #endif PetscFunctionReturn(PETSC_SUCCESS); } /*@ MatSeqSELLGetFillRatio - returns a ratio that indicates the irregularity of the matrix. Not Collective Input Parameter: . A - a MATSEQSELL matrix Output Parameter: . ratio - ratio of number of padded zeros to number of allocated elements Level: intermediate .seealso: `MATSEQSELL`, `MatSeqSELLGetAvgSliceWidth()` @*/ PetscErrorCode MatSeqSELLGetFillRatio(Mat A, PetscReal *ratio) { PetscFunctionBegin; PetscUseMethod(A, "MatSeqSELLGetFillRatio_C", (Mat, PetscReal *), (A, ratio)); PetscFunctionReturn(PETSC_SUCCESS); } /*@ MatSeqSELLGetMaxSliceWidth - returns the maximum slice width. Not Collective Input Parameter: . A - a MATSEQSELL matrix Output Parameter: . slicewidth - maximum slice width Level: intermediate .seealso: `MATSEQSELL`, `MatSeqSELLGetAvgSliceWidth()` @*/ PetscErrorCode MatSeqSELLGetMaxSliceWidth(Mat A, PetscInt *slicewidth) { PetscFunctionBegin; PetscUseMethod(A, "MatSeqSELLGetMaxSliceWidth_C", (Mat, PetscInt *), (A, slicewidth)); PetscFunctionReturn(PETSC_SUCCESS); } /*@ MatSeqSELLGetAvgSliceWidth - returns the average slice width. Not Collective Input Parameter: . A - a MATSEQSELL matrix Output Parameter: . slicewidth - average slice width Level: intermediate .seealso: `MATSEQSELL`, `MatSeqSELLGetMaxSliceWidth()` @*/ PetscErrorCode MatSeqSELLGetAvgSliceWidth(Mat A, PetscReal *slicewidth) { PetscFunctionBegin; PetscUseMethod(A, "MatSeqSELLGetAvgSliceWidth_C", (Mat, PetscReal *), (A, slicewidth)); PetscFunctionReturn(PETSC_SUCCESS); } /*@ MatSeqSELLSetSliceHeight - sets the slice height. Not Collective Input Parameters: + A - a MATSEQSELL matrix - sliceheight - slice height Notes: You cannot change the slice height once it have been set. The slice height must be set before MatSetUp() or MatXXXSetPreallocation() is called. Level: intermediate .seealso: `MATSEQSELL`, `MatSeqSELLGetVarSliceSize()` @*/ PetscErrorCode MatSeqSELLSetSliceHeight(Mat A, PetscInt sliceheight) { PetscFunctionBegin; PetscUseMethod(A, "MatSeqSELLSetSliceHeight_C", (Mat, PetscInt), (A, sliceheight)); PetscFunctionReturn(PETSC_SUCCESS); } /*@ MatSeqSELLGetVarSliceSize - returns the variance of the slice size. Not Collective Input Parameter: . A - a MATSEQSELL matrix Output Parameter: . variance - variance of the slice size Level: intermediate .seealso: `MATSEQSELL`, `MatSeqSELLSetSliceHeight()` @*/ PetscErrorCode MatSeqSELLGetVarSliceSize(Mat A, PetscReal *variance) { PetscFunctionBegin; PetscUseMethod(A, "MatSeqSELLGetVarSliceSize_C", (Mat, PetscReal *), (A, variance)); PetscFunctionReturn(PETSC_SUCCESS); } #if defined(PETSC_HAVE_CUDA) PETSC_EXTERN PetscErrorCode MatConvert_SeqSELL_SeqSELLCUDA(Mat); #endif #if defined(PETSC_HAVE_HIP) PETSC_EXTERN PetscErrorCode MatConvert_SeqSELL_SeqSELLHIP(Mat); #endif PETSC_EXTERN PetscErrorCode MatCreate_SeqSELL(Mat B) { Mat_SeqSELL *b; PetscMPIInt size; PetscFunctionBegin; PetscCall(PetscCitationsRegister(citation, &cited)); PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)B), &size)); PetscCheck(size <= 1, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Comm must be of size 1"); PetscCall(PetscNew(&b)); B->data = (void *)b; B->ops[0] = MatOps_Values; b->row = NULL; b->col = NULL; b->icol = NULL; b->reallocs = 0; b->ignorezeroentries = PETSC_FALSE; b->roworiented = PETSC_TRUE; b->nonew = 0; b->diag = NULL; b->solve_work = NULL; B->spptr = NULL; b->saved_values = NULL; b->idiag = NULL; b->mdiag = NULL; b->ssor_work = NULL; b->omega = 1.0; b->fshift = 0.0; b->keepnonzeropattern = PETSC_FALSE; b->sliceheight = 0; PetscCall(PetscObjectChangeTypeName((PetscObject)B, MATSEQSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLGetArray_C", MatSeqSELLGetArray_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLRestoreArray_C", MatSeqSELLRestoreArray_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatStoreValues_C", MatStoreValues_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatRetrieveValues_C", MatRetrieveValues_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLSetPreallocation_C", MatSeqSELLSetPreallocation_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatConvert_seqsell_seqaij_C", MatConvert_SeqSELL_SeqAIJ)); #if defined(PETSC_HAVE_CUDA) PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatConvert_seqsell_seqsellcuda_C", MatConvert_SeqSELL_SeqSELLCUDA)); #endif #if defined(PETSC_HAVE_HIP) PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatConvert_seqsell_seqsellhip_C", MatConvert_SeqSELL_SeqSELLHIP)); #endif PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLGetFillRatio_C", MatSeqSELLGetFillRatio_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLGetMaxSliceWidth_C", MatSeqSELLGetMaxSliceWidth_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLGetAvgSliceWidth_C", MatSeqSELLGetAvgSliceWidth_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLGetVarSliceSize_C", MatSeqSELLGetVarSliceSize_SeqSELL)); PetscCall(PetscObjectComposeFunction((PetscObject)B, "MatSeqSELLSetSliceHeight_C", MatSeqSELLSetSliceHeight_SeqSELL)); PetscObjectOptionsBegin((PetscObject)B); { PetscInt newsh = -1; PetscBool flg; #if defined(PETSC_HAVE_CUPM) PetscInt chunksize = 0; #endif PetscCall(PetscOptionsInt("-mat_sell_slice_height", "Set the slice height used to store SELL matrix", "MatSELLSetSliceHeight", newsh, &newsh, &flg)); if (flg) PetscCall(MatSeqSELLSetSliceHeight(B, newsh)); #if defined(PETSC_HAVE_CUPM) PetscCall(PetscOptionsInt("-mat_sell_chunk_size", "Set the chunksize for load-balanced CUDA/HIP kernels. Choices include 64,128,256,512,1024", NULL, chunksize, &chunksize, &flg)); if (flg) { PetscCheck(chunksize >= 64 && chunksize <= 1024 && chunksize % 64 == 0, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "chunksize must be a number in {64,128,256,512,1024}: value %" PetscInt_FMT, chunksize); b->chunksize = chunksize; } #endif } PetscOptionsEnd(); PetscFunctionReturn(PETSC_SUCCESS); } /* Given a matrix generated with MatGetFactor() duplicates all the information in A into B */ static PetscErrorCode MatDuplicateNoCreate_SeqSELL(Mat C, Mat A, MatDuplicateOption cpvalues, PetscBool mallocmatspace) { Mat_SeqSELL *c = (Mat_SeqSELL *)C->data, *a = (Mat_SeqSELL *)A->data; PetscInt i, m = A->rmap->n; PetscInt totalslices = a->totalslices; PetscFunctionBegin; C->factortype = A->factortype; c->row = NULL; c->col = NULL; c->icol = NULL; c->reallocs = 0; C->assembled = PETSC_TRUE; PetscCall(PetscLayoutReference(A->rmap, &C->rmap)); PetscCall(PetscLayoutReference(A->cmap, &C->cmap)); c->sliceheight = a->sliceheight; PetscCall(PetscMalloc1(c->sliceheight * totalslices, &c->rlen)); PetscCall(PetscMalloc1(totalslices + 1, &c->sliidx)); for (i = 0; i < m; i++) c->rlen[i] = a->rlen[i]; for (i = 0; i < totalslices + 1; i++) c->sliidx[i] = a->sliidx[i]; /* allocate the matrix space */ if (mallocmatspace) { PetscCall(PetscMalloc2(a->maxallocmat, &c->val, a->maxallocmat, &c->colidx)); c->singlemalloc = PETSC_TRUE; if (m > 0) { PetscCall(PetscArraycpy(c->colidx, a->colidx, a->maxallocmat)); if (cpvalues == MAT_COPY_VALUES) { PetscCall(PetscArraycpy(c->val, a->val, a->maxallocmat)); } else { PetscCall(PetscArrayzero(c->val, a->maxallocmat)); } } } c->ignorezeroentries = a->ignorezeroentries; c->roworiented = a->roworiented; c->nonew = a->nonew; c->solve_work = NULL; c->saved_values = NULL; c->idiag = NULL; c->ssor_work = NULL; c->keepnonzeropattern = a->keepnonzeropattern; c->free_val = PETSC_TRUE; c->free_colidx = PETSC_TRUE; c->maxallocmat = a->maxallocmat; c->maxallocrow = a->maxallocrow; c->rlenmax = a->rlenmax; c->nz = a->nz; C->preallocated = PETSC_TRUE; c->nonzerorowcnt = a->nonzerorowcnt; C->nonzerostate = A->nonzerostate; PetscCall(PetscFunctionListDuplicate(((PetscObject)A)->qlist, &((PetscObject)C)->qlist)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatDuplicate_SeqSELL(Mat A, MatDuplicateOption cpvalues, Mat *B) { PetscFunctionBegin; PetscCall(MatCreate(PetscObjectComm((PetscObject)A), B)); PetscCall(MatSetSizes(*B, A->rmap->n, A->cmap->n, A->rmap->n, A->cmap->n)); if (!(A->rmap->n % A->rmap->bs) && !(A->cmap->n % A->cmap->bs)) PetscCall(MatSetBlockSizesFromMats(*B, A, A)); PetscCall(MatSetType(*B, ((PetscObject)A)->type_name)); PetscCall(MatDuplicateNoCreate_SeqSELL(*B, A, cpvalues, PETSC_TRUE)); PetscFunctionReturn(PETSC_SUCCESS); } /*MC MATSEQSELL - MATSEQSELL = "seqsell" - A matrix type to be used for sequential sparse matrices, based on the sliced Ellpack format, {cite}`zhangellpack2018` Options Database Key: . -mat_type seqsell - sets the matrix type to "`MATSEQELL` during a call to `MatSetFromOptions()` Level: beginner .seealso: `Mat`, `MatCreateSeqSELL()`, `MATSELL`, `MATMPISELL`, `MATSEQAIJ`, `MATAIJ`, `MATMPIAIJ` M*/ /*MC MATSELL - MATSELL = "sell" - A matrix type to be used for sparse matrices, {cite}`zhangellpack2018` This matrix type is identical to `MATSEQSELL` when constructed with a single process communicator, and `MATMPISELL` otherwise. As a result, for single process communicators, `MatSeqSELLSetPreallocation()` is supported, and similarly `MatMPISELLSetPreallocation()` is supported for communicators controlling multiple processes. It is recommended that you call both of the above preallocation routines for simplicity. Options Database Key: . -mat_type sell - sets the matrix type to "sell" during a call to MatSetFromOptions() Level: beginner Notes: This format is only supported for real scalars, double precision, and 32-bit indices (the defaults). It can provide better performance on Intel and AMD processes with AVX2 or AVX512 support for matrices that have a similar number of non-zeros in contiguous groups of rows. However if the computation is memory bandwidth limited it may not provide much improvement. Developer Notes: On Intel (and AMD) systems some of the matrix operations use SIMD (AVX) instructions to achieve higher performance. The sparse matrix format is as follows. For simplicity we assume a slice size of 2, it is actually 8 .vb (2 0 3 4) Consider the matrix A = (5 0 6 0) (0 0 7 8) (0 0 9 9) symbolically the Ellpack format can be written as (2 3 4 |) (0 2 3 |) v = (5 6 0 |) colidx = (0 2 2 |) -------- --------- (7 8 |) (2 3 |) (9 9 |) (2 3 |) The data for 2 contiguous rows of the matrix are stored together (in column-major format) (with any left-over rows handled as a special case). Any of the rows in a slice fewer columns than the rest of the slice (row 1 above) are padded with a previous valid column in their "extra" colidx[] locations and zeros in their "extra" v locations so that the matrix operations do not need special code to handle different length rows within the 2 rows in a slice. The one-dimensional representation of v used in the code is (2 5 3 6 4 0 7 9 8 9) and for colidx is (0 0 2 2 3 2 2 2 3 3) .ve See `MatMult_SeqSELL()` for how this format is used with the SIMD operations to achieve high performance. .seealso: `Mat`, `MatCreateSeqSELL()`, `MatCreateSeqAIJ()`, `MatCreateSELL()`, `MATSEQSELL`, `MATMPISELL`, `MATSEQAIJ`, `MATMPIAIJ`, `MATAIJ` M*/ /*@ MatCreateSeqSELL - Creates a sparse matrix in `MATSEQSELL` format. Collective Input Parameters: + comm - MPI communicator, set to `PETSC_COMM_SELF` . m - number of rows . n - number of columns . rlenmax - maximum number of nonzeros in a row, ignored if `rlen` is provided - rlen - array containing the number of nonzeros in the various rows (possibly different for each row) or NULL Output Parameter: . A - the matrix Level: intermediate Notes: It is recommended that one use the `MatCreate()`, `MatSetType()` and/or `MatSetFromOptions()`, MatXXXXSetPreallocation() paradigm instead of this routine directly. [MatXXXXSetPreallocation() is, for example, `MatSeqSELLSetPreallocation()`] Specify the preallocated storage with either `rlenmax` or `rlen` (not both). Set `rlenmax` = `PETSC_DEFAULT` and `rlen` = `NULL` for PETSc to control dynamic memory allocation. .seealso: `Mat`, `MATSEQSELL`, `MatCreate()`, `MatCreateSELL()`, `MatSetValues()`, `MatSeqSELLSetPreallocation()`, `MATSELL`, `MATMPISELL` @*/ PetscErrorCode MatCreateSeqSELL(MPI_Comm comm, PetscInt m, PetscInt n, PetscInt rlenmax, const PetscInt rlen[], Mat *A) { PetscFunctionBegin; PetscCall(MatCreate(comm, A)); PetscCall(MatSetSizes(*A, m, n, m, n)); PetscCall(MatSetType(*A, MATSEQSELL)); PetscCall(MatSeqSELLSetPreallocation_SeqSELL(*A, rlenmax, rlen)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatEqual_SeqSELL(Mat A, Mat B, PetscBool *flg) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data, *b = (Mat_SeqSELL *)B->data; PetscInt totalslices = a->totalslices; PetscFunctionBegin; /* If the matrix dimensions are not equal,or no of nonzeros */ if ((A->rmap->n != B->rmap->n) || (A->cmap->n != B->cmap->n) || (a->nz != b->nz) || (a->rlenmax != b->rlenmax)) { *flg = PETSC_FALSE; PetscFunctionReturn(PETSC_SUCCESS); } /* if the a->colidx are the same */ PetscCall(PetscArraycmp(a->colidx, b->colidx, a->sliidx[totalslices], flg)); if (!*flg) PetscFunctionReturn(PETSC_SUCCESS); /* if a->val are the same */ PetscCall(PetscArraycmp(a->val, b->val, a->sliidx[totalslices], flg)); PetscFunctionReturn(PETSC_SUCCESS); } PetscErrorCode MatConjugate_SeqSELL(Mat A) { Mat_SeqSELL *a = (Mat_SeqSELL *)A->data; PetscScalar *val = a->val; PetscFunctionBegin; for (PetscInt i = 0; i < a->sliidx[a->totalslices]; i++) val[i] = PetscConj(val[i]); #if defined(PETSC_HAVE_CUPM) if (A->offloadmask != PETSC_OFFLOAD_UNALLOCATED) A->offloadmask = PETSC_OFFLOAD_CPU; #endif PetscFunctionReturn(PETSC_SUCCESS); }