#define PETSCMAT_DLL /* Factorization code for BAIJ format. */ #include "src/mat/impls/baij/seq/baij.h" #include "src/inline/ilu.h" #include "src/inline/dot.h" #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_1_NaturalOrdering" PetscErrorCode MatSolveTranspose_SeqBAIJ_1_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; PetscErrorCode ierr; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar s1,*x,*b; PetscFunctionBegin; ierr = VecCopy(bb,xx);CHKERRQ(ierr); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the U^T */ for (i=0; i=0; i--){ v = aa + diag[i] - 1; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; s1 = x[i]; while (nz--) { x[*vi--] -= (*v--)*s1; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*(a->nz) - A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_2_NaturalOrdering" PetscErrorCode MatSolveTranspose_SeqBAIJ_2_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; PetscErrorCode ierr; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscInt *diag = a->diag,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,x1,x2; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecCopy(bb,xx);CHKERRQ(ierr); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the U^T */ idx = 0; for (i=0; i=0; i--){ v = aa + 4*diag[i] - 4; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 2*i; s1 = x[idt]; s2 = x[1+idt]; while (nz--) { idx = 2*(*vi--); x[idx] -= v[0]*s1 + v[1]*s2; x[idx+1] -= v[2]*s1 + v[3]*s2; v -= 4; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*4*(a->nz) - 2*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_3_NaturalOrdering" PetscErrorCode MatSolveTranspose_SeqBAIJ_3_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; PetscErrorCode ierr; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscInt *diag = a->diag,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,x1,x2,x3; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecCopy(bb,xx);CHKERRQ(ierr); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the U^T */ idx = 0; for (i=0; i=0; i--){ v = aa + 9*diag[i] - 9; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 3*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt]; while (nz--) { idx = 3*(*vi--); x[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3; x[idx+1] -= v[3]*s1 + v[4]*s2 + v[5]*s3; x[idx+2] -= v[6]*s1 + v[7]*s2 + v[8]*s3; v -= 9; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*9*(a->nz) - 3*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_4_NaturalOrdering" PetscErrorCode MatSolveTranspose_SeqBAIJ_4_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; PetscErrorCode ierr; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscInt *diag = a->diag,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,x1,x2,x3,x4; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecCopy(bb,xx);CHKERRQ(ierr); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the U^T */ idx = 0; for (i=0; i=0; i--){ v = aa + 16*diag[i] - 16; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 4*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt];s4 = x[3+idt]; while (nz--) { idx = 4*(*vi--); x[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4; x[idx+1] -= v[4]*s1 + v[5]*s2 + v[6]*s3 + v[7]*s4; x[idx+2] -= v[8]*s1 + v[9]*s2 + v[10]*s3 + v[11]*s4; x[idx+3] -= v[12]*s1 + v[13]*s2 + v[14]*s3 + v[15]*s4; v -= 16; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_5_NaturalOrdering" PetscErrorCode MatSolveTranspose_SeqBAIJ_5_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; PetscErrorCode ierr; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscInt *diag = a->diag,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,s5,x1,x2,x3,x4,x5; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecCopy(bb,xx);CHKERRQ(ierr); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the U^T */ idx = 0; for (i=0; i=0; i--){ v = aa + 25*diag[i] - 25; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 5*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt];s4 = x[3+idt]; s5 = x[4+idt]; while (nz--) { idx = 5*(*vi--); x[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4 + v[4]*s5; x[idx+1] -= v[5]*s1 + v[6]*s2 + v[7]*s3 + v[8]*s4 + v[9]*s5; x[idx+2] -= v[10]*s1 + v[11]*s2 + v[12]*s3 + v[13]*s4 + v[14]*s5; x[idx+3] -= v[15]*s1 + v[16]*s2 + v[17]*s3 + v[18]*s4 + v[19]*s5; x[idx+4] -= v[20]*s1 + v[21]*s2 + v[22]*s3 + v[23]*s4 + v[24]*s5; v -= 25; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*25*(a->nz) - 5*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_6_NaturalOrdering" PetscErrorCode MatSolveTranspose_SeqBAIJ_6_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; PetscErrorCode ierr; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscInt *diag = a->diag,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,s5,s6,x1,x2,x3,x4,x5,x6; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecCopy(bb,xx);CHKERRQ(ierr); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the U^T */ idx = 0; for (i=0; i=0; i--){ v = aa + 36*diag[i] - 36; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 6*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt];s4 = x[3+idt]; s5 = x[4+idt]; s6 = x[5+idt]; while (nz--) { idx = 6*(*vi--); x[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4 + v[4]*s5 + v[5]*s6; x[idx+1] -= v[6]*s1 + v[7]*s2 + v[8]*s3 + v[9]*s4 + v[10]*s5 + v[11]*s6; x[idx+2] -= v[12]*s1 + v[13]*s2 + v[14]*s3 + v[15]*s4 + v[16]*s5 + v[17]*s6; x[idx+3] -= v[18]*s1 + v[19]*s2 + v[20]*s3 + v[21]*s4 + v[22]*s5 + v[23]*s6; x[idx+4] -= v[24]*s1 + v[25]*s2 + v[26]*s3 + v[27]*s4 + v[28]*s5 + v[29]*s6; x[idx+5] -= v[30]*s1 + v[31]*s2 + v[32]*s3 + v[33]*s4 + v[34]*s5 + v[35]*s6; v -= 36; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*36*(a->nz) - 6*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_7_NaturalOrdering" PetscErrorCode MatSolveTranspose_SeqBAIJ_7_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; PetscErrorCode ierr; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscInt *diag = a->diag,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,s5,s6,s7,x1,x2,x3,x4,x5,x6,x7; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecCopy(bb,xx);CHKERRQ(ierr); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the U^T */ idx = 0; for (i=0; i=0; i--){ v = aa + 49*diag[i] - 49; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 7*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt];s4 = x[3+idt]; s5 = x[4+idt]; s6 = x[5+idt];s7 = x[6+idt]; while (nz--) { idx = 7*(*vi--); x[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4 + v[4]*s5 + v[5]*s6 + v[6]*s7; x[idx+1] -= v[7]*s1 + v[8]*s2 + v[9]*s3 + v[10]*s4 + v[11]*s5 + v[12]*s6 + v[13]*s7; x[idx+2] -= v[14]*s1 + v[15]*s2 + v[16]*s3 + v[17]*s4 + v[18]*s5 + v[19]*s6 + v[20]*s7; x[idx+3] -= v[21]*s1 + v[22]*s2 + v[23]*s3 + v[24]*s4 + v[25]*s5 + v[26]*s6 + v[27]*s7; x[idx+4] -= v[28]*s1 + v[29]*s2 + v[30]*s3 + v[31]*s4 + v[32]*s5 + v[33]*s6 + v[34]*s7; x[idx+5] -= v[35]*s1 + v[36]*s2 + v[37]*s3 + v[38]*s4 + v[39]*s5 + v[40]*s6 + v[41]*s7; x[idx+6] -= v[42]*s1 + v[43]*s2 + v[44]*s3 + v[45]*s4 + v[46]*s5 + v[47]*s6 + v[48]*s7; v -= 49; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*49*(a->nz) - 7*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } /*---------------------------------------------------------------------------------------------*/ #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_1" PetscErrorCode MatSolveTranspose_SeqBAIJ_1(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar s1,*x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout; /* copy the b into temp work space according to permutation */ for (i=0; i=0; i--){ v = aa + diag[i] - 1; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; s1 = t[i]; while (nz--) { t[*vi--] -= (*v--)*s1; } } /* copy t into x according to permutation */ for (i=0; inz) - A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_2" PetscErrorCode MatSolveTranspose_SeqBAIJ_2(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,*rout,*cout; PetscInt *diag = a->diag,ii,ic,ir,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,x1,x2; PetscScalar *x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout; /* copy the b into temp work space according to permutation */ ii = 0; for (i=0; i=0; i--){ v = aa + 4*diag[i] - 4; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 2*i; s1 = t[idt]; s2 = t[1+idt]; while (nz--) { idx = 2*(*vi--); t[idx] -= v[0]*s1 + v[1]*s2; t[idx+1] -= v[2]*s1 + v[3]*s2; v -= 4; } } /* copy t into x according to permutation */ ii = 0; for (i=0; inz) - 2*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_3" PetscErrorCode MatSolveTranspose_SeqBAIJ_3(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,*rout,*cout; PetscInt *diag = a->diag,ii,ic,ir,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,x1,x2,x3; PetscScalar *x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout; /* copy the b into temp work space according to permutation */ ii = 0; for (i=0; i=0; i--){ v = aa + 9*diag[i] - 9; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 3*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt]; while (nz--) { idx = 3*(*vi--); t[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3; t[idx+1] -= v[3]*s1 + v[4]*s2 + v[5]*s3; t[idx+2] -= v[6]*s1 + v[7]*s2 + v[8]*s3; v -= 9; } } /* copy t into x according to permutation */ ii = 0; for (i=0; inz) - 3*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_4" PetscErrorCode MatSolveTranspose_SeqBAIJ_4(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,*rout,*cout; PetscInt *diag = a->diag,ii,ic,ir,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,x1,x2,x3,x4; PetscScalar *x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout; /* copy the b into temp work space according to permutation */ ii = 0; for (i=0; i=0; i--){ v = aa + 16*diag[i] - 16; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 4*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; while (nz--) { idx = 4*(*vi--); t[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4; t[idx+1] -= v[4]*s1 + v[5]*s2 + v[6]*s3 + v[7]*s4; t[idx+2] -= v[8]*s1 + v[9]*s2 + v[10]*s3 + v[11]*s4; t[idx+3] -= v[12]*s1 + v[13]*s2 + v[14]*s3 + v[15]*s4; v -= 16; } } /* copy t into x according to permutation */ ii = 0; for (i=0; inz) - 4*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_5" PetscErrorCode MatSolveTranspose_SeqBAIJ_5(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,*rout,*cout; PetscInt *diag = a->diag,ii,ic,ir,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,s5,x1,x2,x3,x4,x5; PetscScalar *x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout; /* copy the b into temp work space according to permutation */ ii = 0; for (i=0; i=0; i--){ v = aa + 25*diag[i] - 25; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 5*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; s5 = t[4+idt]; while (nz--) { idx = 5*(*vi--); t[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4 + v[4]*s5; t[idx+1] -= v[5]*s1 + v[6]*s2 + v[7]*s3 + v[8]*s4 + v[9]*s5; t[idx+2] -= v[10]*s1 + v[11]*s2 + v[12]*s3 + v[13]*s4 + v[14]*s5; t[idx+3] -= v[15]*s1 + v[16]*s2 + v[17]*s3 + v[18]*s4 + v[19]*s5; t[idx+4] -= v[20]*s1 + v[21]*s2 + v[22]*s3 + v[23]*s4 + v[24]*s5; v -= 25; } } /* copy t into x according to permutation */ ii = 0; for (i=0; inz) - 5*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_6" PetscErrorCode MatSolveTranspose_SeqBAIJ_6(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,*rout,*cout; PetscInt *diag = a->diag,ii,ic,ir,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,s5,s6,x1,x2,x3,x4,x5,x6; PetscScalar *x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout; /* copy the b into temp work space according to permutation */ ii = 0; for (i=0; i=0; i--){ v = aa + 36*diag[i] - 36; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 6*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; s5 = t[4+idt]; s6 = t[5+idt]; while (nz--) { idx = 6*(*vi--); t[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4 + v[4]*s5 + v[5]*s6; t[idx+1] -= v[6]*s1 + v[7]*s2 + v[8]*s3 + v[9]*s4 + v[10]*s5 + v[11]*s6; t[idx+2] -= v[12]*s1 + v[13]*s2 + v[14]*s3 + v[15]*s4 + v[16]*s5 + v[17]*s6; t[idx+3] -= v[18]*s1 + v[19]*s2 + v[20]*s3 + v[21]*s4 + v[22]*s5 + v[23]*s6; t[idx+4] -= v[24]*s1 + v[25]*s2 + v[26]*s3 + v[27]*s4 + v[28]*s5 + v[29]*s6; t[idx+5] -= v[30]*s1 + v[31]*s2 + v[32]*s3 + v[33]*s4 + v[34]*s5 + v[35]*s6; v -= 36; } } /* copy t into x according to permutation */ ii = 0; for (i=0; inz) - 6*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_7" PetscErrorCode MatSolveTranspose_SeqBAIJ_7(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,*rout,*cout; PetscInt *diag = a->diag,ii,ic,ir,oidx; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,s5,s6,s7,x1,x2,x3,x4,x5,x6,x7; PetscScalar *x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout; /* copy the b into temp work space according to permutation */ ii = 0; for (i=0; i=0; i--){ v = aa + 49*diag[i] - 49; vi = aj + diag[i] - 1; nz = diag[i] - ai[i]; idt = 7*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; s5 = t[4+idt]; s6 = t[5+idt];s7 = t[6+idt]; while (nz--) { idx = 7*(*vi--); t[idx] -= v[0]*s1 + v[1]*s2 + v[2]*s3 + v[3]*s4 + v[4]*s5 + v[5]*s6 + v[6]*s7; t[idx+1] -= v[7]*s1 + v[8]*s2 + v[9]*s3 + v[10]*s4 + v[11]*s5 + v[12]*s6 + v[13]*s7; t[idx+2] -= v[14]*s1 + v[15]*s2 + v[16]*s3 + v[17]*s4 + v[18]*s5 + v[19]*s6 + v[20]*s7; t[idx+3] -= v[21]*s1 + v[22]*s2 + v[23]*s3 + v[24]*s4 + v[25]*s5 + v[26]*s6 + v[27]*s7; t[idx+4] -= v[28]*s1 + v[29]*s2 + v[30]*s3 + v[31]*s4 + v[32]*s5 + v[33]*s6 + v[34]*s7; t[idx+5] -= v[35]*s1 + v[36]*s2 + v[37]*s3 + v[38]*s4 + v[39]*s5 + v[40]*s6 + v[41]*s7; t[idx+6] -= v[42]*s1 + v[43]*s2 + v[44]*s3 + v[45]*s4 + v[46]*s5 + v[47]*s6 + v[48]*s7; v -= 49; } } /* copy t into x according to permutation */ ii = 0; for (i=0; inz) - 7*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } /* ----------------------------------------------------------- */ #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_N" PetscErrorCode MatSolve_SeqBAIJ_N(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j; PetscInt nz,bs=A->bs,bs2=a->bs2,*rout,*cout; MatScalar *aa=a->a,*v; PetscScalar *x,*b,*s,*t,*ls; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ ierr = PetscMemcpy(t,b+bs*(*r++),bs*sizeof(PetscScalar));CHKERRQ(ierr); for (i=1; idiag[i] - ai[i]; s = t + bs*i; ierr = PetscMemcpy(s,b+bs*(*r++),bs*sizeof(PetscScalar));CHKERRQ(ierr); while (nz--) { Kernel_v_gets_v_minus_A_times_w(bs,s,v,t+bs*(*vi++)); v += bs2; } } /* backward solve the upper triangular */ ls = a->solve_work + A->n; for (i=n-1; i>=0; i--){ v = aa + bs2*(a->diag[i] + 1); vi = aj + a->diag[i] + 1; nz = ai[i+1] - a->diag[i] - 1; ierr = PetscMemcpy(ls,t+i*bs,bs*sizeof(PetscScalar));CHKERRQ(ierr); while (nz--) { Kernel_v_gets_v_minus_A_times_w(bs,ls,v,t+bs*(*vi++)); v += bs2; } Kernel_w_gets_A_times_v(bs,ls,aa+bs2*a->diag[i],t+i*bs); ierr = PetscMemcpy(x + bs*(*c--),t+i*bs,bs*sizeof(PetscScalar));CHKERRQ(ierr); } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*(a->bs2)*(a->nz) - A->bs*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_7" PetscErrorCode MatSolve_SeqBAIJ_7(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar s1,s2,s3,s4,s5,s6,s7,x1,x2,x3,x4,x5,x6,x7; PetscScalar *x,*b,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 7*(*r++); t[0] = b[idx]; t[1] = b[1+idx]; t[2] = b[2+idx]; t[3] = b[3+idx]; t[4] = b[4+idx]; t[5] = b[5+idx]; t[6] = b[6+idx]; for (i=1; i=0; i--){ v = aa + 49*diag[i] + 49; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 7*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; s5 = t[4+idt]; s6 = t[5+idt];s7 = t[6+idt]; while (nz--) { idx = 7*(*vi++); x1 = t[idx]; x2 = t[1+idx]; x3 = t[2+idx]; x4 = t[3+idx]; x5 = t[4+idx]; x6 = t[5+idx]; x7 = t[6+idx]; s1 -= v[0]*x1 + v[7]*x2 + v[14]*x3 + v[21]*x4 + v[28]*x5 + v[35]*x6 + v[42]*x7; s2 -= v[1]*x1 + v[8]*x2 + v[15]*x3 + v[22]*x4 + v[29]*x5 + v[36]*x6 + v[43]*x7; s3 -= v[2]*x1 + v[9]*x2 + v[16]*x3 + v[23]*x4 + v[30]*x5 + v[37]*x6 + v[44]*x7; s4 -= v[3]*x1 + v[10]*x2 + v[17]*x3 + v[24]*x4 + v[31]*x5 + v[38]*x6 + v[45]*x7; s5 -= v[4]*x1 + v[11]*x2 + v[18]*x3 + v[25]*x4 + v[32]*x5 + v[39]*x6 + v[46]*x7; s6 -= v[5]*x1 + v[12]*x2 + v[19]*x3 + v[26]*x4 + v[33]*x5 + v[40]*x6 + v[47]*x7; s7 -= v[6]*x1 + v[13]*x2 + v[20]*x3 + v[27]*x4 + v[34]*x5 + v[41]*x6 + v[48]*x7; v += 49; } idc = 7*(*c--); v = aa + 49*diag[i]; x[idc] = t[idt] = v[0]*s1+v[7]*s2+v[14]*s3+ v[21]*s4+v[28]*s5+v[35]*s6+v[42]*s7; x[1+idc] = t[1+idt] = v[1]*s1+v[8]*s2+v[15]*s3+ v[22]*s4+v[29]*s5+v[36]*s6+v[43]*s7; x[2+idc] = t[2+idt] = v[2]*s1+v[9]*s2+v[16]*s3+ v[23]*s4+v[30]*s5+v[37]*s6+v[44]*s7; x[3+idc] = t[3+idt] = v[3]*s1+v[10]*s2+v[17]*s3+ v[24]*s4+v[31]*s5+v[38]*s6+v[45]*s7; x[4+idc] = t[4+idt] = v[4]*s1+v[11]*s2+v[18]*s3+ v[25]*s4+v[32]*s5+v[39]*s6+v[46]*s7; x[5+idc] = t[5+idt] = v[5]*s1+v[12]*s2+v[19]*s3+ v[26]*s4+v[33]*s5+v[40]*s6+v[47]*s7; x[6+idc] = t[6+idt] = v[6]*s1+v[13]*s2+v[20]*s3+ v[27]*s4+v[34]*s5+v[41]*s6+v[48]*s7; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*49*(a->nz) - 7*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_7_NaturalOrdering" PetscErrorCode MatSolve_SeqBAIJ_7_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscErrorCode ierr; PetscInt *diag = a->diag,jdx; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,s4,s5,s6,s7,x1,x2,x3,x4,x5,x6,x7; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the lower triangular */ idx = 0; x[0] = b[idx]; x[1] = b[1+idx]; x[2] = b[2+idx]; x[3] = b[3+idx]; x[4] = b[4+idx]; x[5] = b[5+idx]; x[6] = b[6+idx]; for (i=1; i=0; i--){ v = aa + 49*diag[i] + 49; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 7*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt]; s4 = x[3+idt]; s5 = x[4+idt]; s6 = x[5+idt]; s7 = x[6+idt]; while (nz--) { idx = 7*(*vi++); x1 = x[idx]; x2 = x[1+idx]; x3 = x[2+idx]; x4 = x[3+idx]; x5 = x[4+idx]; x6 = x[5+idx]; x7 = x[6+idx]; s1 -= v[0]*x1 + v[7]*x2 + v[14]*x3 + v[21]*x4 + v[28]*x5 + v[35]*x6 + v[42]*x7; s2 -= v[1]*x1 + v[8]*x2 + v[15]*x3 + v[22]*x4 + v[29]*x5 + v[36]*x6 + v[43]*x7; s3 -= v[2]*x1 + v[9]*x2 + v[16]*x3 + v[23]*x4 + v[30]*x5 + v[37]*x6 + v[44]*x7; s4 -= v[3]*x1 + v[10]*x2 + v[17]*x3 + v[24]*x4 + v[31]*x5 + v[38]*x6 + v[45]*x7; s5 -= v[4]*x1 + v[11]*x2 + v[18]*x3 + v[25]*x4 + v[32]*x5 + v[39]*x6 + v[46]*x7; s6 -= v[5]*x1 + v[12]*x2 + v[19]*x3 + v[26]*x4 + v[33]*x5 + v[40]*x6 + v[47]*x7; s7 -= v[6]*x1 + v[13]*x2 + v[20]*x3 + v[27]*x4 + v[34]*x5 + v[41]*x6 + v[48]*x7; v += 49; } v = aa + 49*diag[i]; x[idt] = v[0]*s1 + v[7]*s2 + v[14]*s3 + v[21]*s4 + v[28]*s5 + v[35]*s6 + v[42]*s7; x[1+idt] = v[1]*s1 + v[8]*s2 + v[15]*s3 + v[22]*s4 + v[29]*s5 + v[36]*s6 + v[43]*s7; x[2+idt] = v[2]*s1 + v[9]*s2 + v[16]*s3 + v[23]*s4 + v[30]*s5 + v[37]*s6 + v[44]*s7; x[3+idt] = v[3]*s1 + v[10]*s2 + v[17]*s3 + v[24]*s4 + v[31]*s5 + v[38]*s6 + v[45]*s7; x[4+idt] = v[4]*s1 + v[11]*s2 + v[18]*s3 + v[25]*s4 + v[32]*s5 + v[39]*s6 + v[46]*s7; x[5+idt] = v[5]*s1 + v[12]*s2 + v[19]*s3 + v[26]*s4 + v[33]*s5 + v[40]*s6 + v[47]*s7; x[6+idt] = v[6]*s1 + v[13]*s2 + v[20]*s3 + v[27]*s4 + v[34]*s5 + v[41]*s6 + v[48]*s7; } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*36*(a->nz) - 6*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_6" PetscErrorCode MatSolve_SeqBAIJ_6(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,s4,s5,s6,x1,x2,x3,x4,x5,x6,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 6*(*r++); t[0] = b[idx]; t[1] = b[1+idx]; t[2] = b[2+idx]; t[3] = b[3+idx]; t[4] = b[4+idx]; t[5] = b[5+idx]; for (i=1; i=0; i--){ v = aa + 36*diag[i] + 36; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 6*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; s5 = t[4+idt];s6 = t[5+idt]; while (nz--) { idx = 6*(*vi++); x1 = t[idx]; x2 = t[1+idx]; x3 = t[2+idx]; x4 = t[3+idx]; x5 = t[4+idx]; x6 = t[5+idx]; s1 -= v[0]*x1 + v[6]*x2 + v[12]*x3 + v[18]*x4 + v[24]*x5 + v[30]*x6; s2 -= v[1]*x1 + v[7]*x2 + v[13]*x3 + v[19]*x4 + v[25]*x5 + v[31]*x6; s3 -= v[2]*x1 + v[8]*x2 + v[14]*x3 + v[20]*x4 + v[26]*x5 + v[32]*x6; s4 -= v[3]*x1 + v[9]*x2 + v[15]*x3 + v[21]*x4 + v[27]*x5 + v[33]*x6; s5 -= v[4]*x1 + v[10]*x2 + v[16]*x3 + v[22]*x4 + v[28]*x5 + v[34]*x6; s6 -= v[5]*x1 + v[11]*x2 + v[17]*x3 + v[23]*x4 + v[29]*x5 + v[35]*x6; v += 36; } idc = 6*(*c--); v = aa + 36*diag[i]; x[idc] = t[idt] = v[0]*s1+v[6]*s2+v[12]*s3+ v[18]*s4+v[24]*s5+v[30]*s6; x[1+idc] = t[1+idt] = v[1]*s1+v[7]*s2+v[13]*s3+ v[19]*s4+v[25]*s5+v[31]*s6; x[2+idc] = t[2+idt] = v[2]*s1+v[8]*s2+v[14]*s3+ v[20]*s4+v[26]*s5+v[32]*s6; x[3+idc] = t[3+idt] = v[3]*s1+v[9]*s2+v[15]*s3+ v[21]*s4+v[27]*s5+v[33]*s6; x[4+idc] = t[4+idt] = v[4]*s1+v[10]*s2+v[16]*s3+ v[22]*s4+v[28]*s5+v[34]*s6; x[5+idc] = t[5+idt] = v[5]*s1+v[11]*s2+v[17]*s3+ v[23]*s4+v[29]*s5+v[35]*s6; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*36*(a->nz) - 6*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_6_NaturalOrdering" PetscErrorCode MatSolve_SeqBAIJ_6_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscErrorCode ierr; PetscInt *diag = a->diag,jdx; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,s4,s5,s6,x1,x2,x3,x4,x5,x6; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the lower triangular */ idx = 0; x[0] = b[idx]; x[1] = b[1+idx]; x[2] = b[2+idx]; x[3] = b[3+idx]; x[4] = b[4+idx]; x[5] = b[5+idx]; for (i=1; i=0; i--){ v = aa + 36*diag[i] + 36; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 6*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt]; s4 = x[3+idt]; s5 = x[4+idt]; s6 = x[5+idt]; while (nz--) { idx = 6*(*vi++); x1 = x[idx]; x2 = x[1+idx]; x3 = x[2+idx]; x4 = x[3+idx]; x5 = x[4+idx]; x6 = x[5+idx]; s1 -= v[0]*x1 + v[6]*x2 + v[12]*x3 + v[18]*x4 + v[24]*x5 + v[30]*x6; s2 -= v[1]*x1 + v[7]*x2 + v[13]*x3 + v[19]*x4 + v[25]*x5 + v[31]*x6; s3 -= v[2]*x1 + v[8]*x2 + v[14]*x3 + v[20]*x4 + v[26]*x5 + v[32]*x6; s4 -= v[3]*x1 + v[9]*x2 + v[15]*x3 + v[21]*x4 + v[27]*x5 + v[33]*x6; s5 -= v[4]*x1 + v[10]*x2 + v[16]*x3 + v[22]*x4 + v[28]*x5 + v[34]*x6; s6 -= v[5]*x1 + v[11]*x2 + v[17]*x3 + v[23]*x4 + v[29]*x5 + v[35]*x6; v += 36; } v = aa + 36*diag[i]; x[idt] = v[0]*s1 + v[6]*s2 + v[12]*s3 + v[18]*s4 + v[24]*s5 + v[30]*s6; x[1+idt] = v[1]*s1 + v[7]*s2 + v[13]*s3 + v[19]*s4 + v[25]*s5 + v[31]*s6; x[2+idt] = v[2]*s1 + v[8]*s2 + v[14]*s3 + v[20]*s4 + v[26]*s5 + v[32]*s6; x[3+idt] = v[3]*s1 + v[9]*s2 + v[15]*s3 + v[21]*s4 + v[27]*s5 + v[33]*s6; x[4+idt] = v[4]*s1 + v[10]*s2 + v[16]*s3 + v[22]*s4 + v[28]*s5 + v[34]*s6; x[5+idt] = v[5]*s1 + v[11]*s2 + v[17]*s3 + v[23]*s4 + v[29]*s5 + v[35]*s6; } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*36*(a->nz) - 6*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_5" PetscErrorCode MatSolve_SeqBAIJ_5(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,s4,s5,x1,x2,x3,x4,x5,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 5*(*r++); t[0] = b[idx]; t[1] = b[1+idx]; t[2] = b[2+idx]; t[3] = b[3+idx]; t[4] = b[4+idx]; for (i=1; i=0; i--){ v = aa + 25*diag[i] + 25; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 5*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; s5 = t[4+idt]; while (nz--) { idx = 5*(*vi++); x1 = t[idx]; x2 = t[1+idx]; x3 = t[2+idx]; x4 = t[3+idx]; x5 = t[4+idx]; s1 -= v[0]*x1 + v[5]*x2 + v[10]*x3 + v[15]*x4 + v[20]*x5; s2 -= v[1]*x1 + v[6]*x2 + v[11]*x3 + v[16]*x4 + v[21]*x5; s3 -= v[2]*x1 + v[7]*x2 + v[12]*x3 + v[17]*x4 + v[22]*x5; s4 -= v[3]*x1 + v[8]*x2 + v[13]*x3 + v[18]*x4 + v[23]*x5; s5 -= v[4]*x1 + v[9]*x2 + v[14]*x3 + v[19]*x4 + v[24]*x5; v += 25; } idc = 5*(*c--); v = aa + 25*diag[i]; x[idc] = t[idt] = v[0]*s1+v[5]*s2+v[10]*s3+ v[15]*s4+v[20]*s5; x[1+idc] = t[1+idt] = v[1]*s1+v[6]*s2+v[11]*s3+ v[16]*s4+v[21]*s5; x[2+idc] = t[2+idt] = v[2]*s1+v[7]*s2+v[12]*s3+ v[17]*s4+v[22]*s5; x[3+idc] = t[3+idt] = v[3]*s1+v[8]*s2+v[13]*s3+ v[18]*s4+v[23]*s5; x[4+idc] = t[4+idt] = v[4]*s1+v[9]*s2+v[14]*s3+ v[19]*s4+v[24]*s5; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*25*(a->nz) - 5*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_5_NaturalOrdering" PetscErrorCode MatSolve_SeqBAIJ_5_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt; PetscErrorCode ierr; PetscInt *diag = a->diag,jdx; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,s4,s5,x1,x2,x3,x4,x5; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the lower triangular */ idx = 0; x[0] = b[idx]; x[1] = b[1+idx]; x[2] = b[2+idx]; x[3] = b[3+idx];x[4] = b[4+idx]; for (i=1; i=0; i--){ v = aa + 25*diag[i] + 25; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 5*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt];s4 = x[3+idt]; s5 = x[4+idt]; while (nz--) { idx = 5*(*vi++); x1 = x[idx]; x2 = x[1+idx];x3 = x[2+idx]; x4 = x[3+idx]; x5 = x[4+idx]; s1 -= v[0]*x1 + v[5]*x2 + v[10]*x3 + v[15]*x4 + v[20]*x5; s2 -= v[1]*x1 + v[6]*x2 + v[11]*x3 + v[16]*x4 + v[21]*x5; s3 -= v[2]*x1 + v[7]*x2 + v[12]*x3 + v[17]*x4 + v[22]*x5; s4 -= v[3]*x1 + v[8]*x2 + v[13]*x3 + v[18]*x4 + v[23]*x5; s5 -= v[4]*x1 + v[9]*x2 + v[14]*x3 + v[19]*x4 + v[24]*x5; v += 25; } v = aa + 25*diag[i]; x[idt] = v[0]*s1 + v[5]*s2 + v[10]*s3 + v[15]*s4 + v[20]*s5; x[1+idt] = v[1]*s1 + v[6]*s2 + v[11]*s3 + v[16]*s4 + v[21]*s5; x[2+idt] = v[2]*s1 + v[7]*s2 + v[12]*s3 + v[17]*s4 + v[22]*s5; x[3+idt] = v[3]*s1 + v[8]*s2 + v[13]*s3 + v[18]*s4 + v[23]*s5; x[4+idt] = v[4]*s1 + v[9]*s2 + v[14]*s3 + v[19]*s4 + v[24]*s5; } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*25*(a->nz) - 5*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_4" PetscErrorCode MatSolve_SeqBAIJ_4(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,s4,x1,x2,x3,x4,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 4*(*r++); t[0] = b[idx]; t[1] = b[1+idx]; t[2] = b[2+idx]; t[3] = b[3+idx]; for (i=1; i=0; i--){ v = aa + 16*diag[i] + 16; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 4*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt];s4 = t[3+idt]; while (nz--) { idx = 4*(*vi++); x1 = t[idx]; x2 = t[1+idx]; x3 = t[2+idx]; x4 = t[3+idx]; s1 -= v[0]*x1 + v[4]*x2 + v[8]*x3 + v[12]*x4; s2 -= v[1]*x1 + v[5]*x2 + v[9]*x3 + v[13]*x4; s3 -= v[2]*x1 + v[6]*x2 + v[10]*x3 + v[14]*x4; s4 -= v[3]*x1 + v[7]*x2 + v[11]*x3 + v[15]*x4; v += 16; } idc = 4*(*c--); v = aa + 16*diag[i]; x[idc] = t[idt] = v[0]*s1+v[4]*s2+v[8]*s3+v[12]*s4; x[1+idc] = t[1+idt] = v[1]*s1+v[5]*s2+v[9]*s3+v[13]*s4; x[2+idc] = t[2+idt] = v[2]*s1+v[6]*s2+v[10]*s3+v[14]*s4; x[3+idc] = t[3+idt] = v[3]*s1+v[7]*s2+v[11]*s3+v[15]*s4; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_4_Demotion" PetscErrorCode MatSolve_SeqBAIJ_4_Demotion(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v,s1,s2,s3,s4,x1,x2,x3,x4,*t; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = (MatScalar *)a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 4*(*r++); t[0] = (MatScalar)b[idx]; t[1] = (MatScalar)b[1+idx]; t[2] = (MatScalar)b[2+idx]; t[3] = (MatScalar)b[3+idx]; for (i=1; i=0; i--){ v = aa + 16*diag[i] + 16; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 4*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt]; s4 = t[3+idt]; while (nz--) { idx = 4*(*vi++); x1 = t[idx]; x2 = t[1+idx]; x3 = t[2+idx]; x4 = t[3+idx]; s1 -= v[0]*x1 + v[4]*x2 + v[8]*x3 + v[12]*x4; s2 -= v[1]*x1 + v[5]*x2 + v[9]*x3 + v[13]*x4; s3 -= v[2]*x1 + v[6]*x2 + v[10]*x3 + v[14]*x4; s4 -= v[3]*x1 + v[7]*x2 + v[11]*x3 + v[15]*x4; v += 16; } idc = 4*(*c--); v = aa + 16*diag[i]; t[idt] = v[0]*s1+v[4]*s2+v[8]*s3+v[12]*s4; t[1+idt] = v[1]*s1+v[5]*s2+v[9]*s3+v[13]*s4; t[2+idt] = v[2]*s1+v[6]*s2+v[10]*s3+v[14]*s4; t[3+idt] = v[3]*s1+v[7]*s2+v[11]*s3+v[15]*s4; x[idc] = (PetscScalar)t[idt]; x[1+idc] = (PetscScalar)t[1+idt]; x[2+idc] = (PetscScalar)t[2+idt]; x[3+idc] = (PetscScalar)t[3+idt]; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #if defined (PETSC_HAVE_SSE) #include PETSC_HAVE_SSE #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_4_SSE_Demotion" PetscErrorCode MatSolve_SeqBAIJ_4_SSE_Demotion(Mat A,Vec bb,Vec xx) { /* Note: This code uses demotion of double to float when performing the mixed-mode computation. This may not be numerically reasonable for all applications. */ Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag,ai16; MatScalar *aa=a->a,*v; PetscScalar *x,*b,*t; /* Make space in temp stack for 16 Byte Aligned arrays */ float ssealignedspace[11],*tmps,*tmpx; unsigned long offset; PetscFunctionBegin; SSE_SCOPE_BEGIN; offset = (unsigned long)ssealignedspace % 16; if (offset) offset = (16 - offset)/4; tmps = &ssealignedspace[offset]; tmpx = &ssealignedspace[offset+4]; PREFETCH_NTA(aa+16*ai[1]); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 4*(*r++); t[0] = b[idx]; t[1] = b[1+idx]; t[2] = b[2+idx]; t[3] = b[3+idx]; v = aa + 16*ai[1]; for (i=1; i=0;){ PREFETCH_NTA(&v[8]); vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; /* Demote accumulator from double to float */ CONVERT_DOUBLE4_FLOAT4(tmps,&t[idt]); LOAD_PS(tmps,XMM7); while (nz--) { PREFETCH_NTA(&v[16]); idx = 4*(*vi++); /* Demote solution (so far) from double to float */ CONVERT_DOUBLE4_FLOAT4(tmpx,&t[idx]); /* 4x4 Matrix-Vector Product with negative accumulation: */ SSE_INLINE_BEGIN_2(tmpx,v) SSE_LOAD_PS(SSE_ARG_1,FLOAT_0,XMM6) /* First Column */ SSE_COPY_PS(XMM0,XMM6) SSE_SHUFFLE(XMM0,XMM0,0x00) SSE_MULT_PS_M(XMM0,SSE_ARG_2,FLOAT_0) SSE_SUB_PS(XMM7,XMM0) /* Second Column */ SSE_COPY_PS(XMM1,XMM6) SSE_SHUFFLE(XMM1,XMM1,0x55) SSE_MULT_PS_M(XMM1,SSE_ARG_2,FLOAT_4) SSE_SUB_PS(XMM7,XMM1) SSE_PREFETCH_NTA(SSE_ARG_2,FLOAT_24) /* Third Column */ SSE_COPY_PS(XMM2,XMM6) SSE_SHUFFLE(XMM2,XMM2,0xAA) SSE_MULT_PS_M(XMM2,SSE_ARG_2,FLOAT_8) SSE_SUB_PS(XMM7,XMM2) /* Fourth Column */ SSE_COPY_PS(XMM3,XMM6) SSE_SHUFFLE(XMM3,XMM3,0xFF) SSE_MULT_PS_M(XMM3,SSE_ARG_2,FLOAT_12) SSE_SUB_PS(XMM7,XMM3) SSE_INLINE_END_2 v += 16; } v = aa + ai16; ai16 = 16*diag[--i]; PREFETCH_NTA(aa+ai16+16); /* Scale the result by the diagonal 4x4 block, which was inverted as part of the factorization */ SSE_INLINE_BEGIN_3(v,tmps,aa+ai16) /* First Column */ SSE_COPY_PS(XMM0,XMM7) SSE_SHUFFLE(XMM0,XMM0,0x00) SSE_MULT_PS_M(XMM0,SSE_ARG_1,FLOAT_0) /* Second Column */ SSE_COPY_PS(XMM1,XMM7) SSE_SHUFFLE(XMM1,XMM1,0x55) SSE_MULT_PS_M(XMM1,SSE_ARG_1,FLOAT_4) SSE_ADD_PS(XMM0,XMM1) SSE_PREFETCH_NTA(SSE_ARG_3,FLOAT_24) /* Third Column */ SSE_COPY_PS(XMM2,XMM7) SSE_SHUFFLE(XMM2,XMM2,0xAA) SSE_MULT_PS_M(XMM2,SSE_ARG_1,FLOAT_8) SSE_ADD_PS(XMM0,XMM2) /* Fourth Column */ SSE_COPY_PS(XMM3,XMM7) SSE_SHUFFLE(XMM3,XMM3,0xFF) SSE_MULT_PS_M(XMM3,SSE_ARG_1,FLOAT_12) SSE_ADD_PS(XMM0,XMM3) SSE_STORE_PS(SSE_ARG_2,FLOAT_0,XMM0) SSE_INLINE_END_3 /* Promote solution from float to double */ CONVERT_FLOAT4_DOUBLE4(&t[idt],tmps); /* Apply reordering to t and stream into x. */ /* This way, x doesn't pollute the cache. */ /* Be careful with size: 2 doubles = 4 floats! */ idc = 4*(*c--); SSE_INLINE_BEGIN_2((float *)&t[idt],(float *)&x[idc]) /* x[idc] = t[idt]; x[1+idc] = t[1+idc]; */ SSE_LOAD_PS(SSE_ARG_1,FLOAT_0,XMM0) SSE_STREAM_PS(SSE_ARG_2,FLOAT_0,XMM0) /* x[idc+2] = t[idt+2]; x[3+idc] = t[3+idc]; */ SSE_LOAD_PS(SSE_ARG_1,FLOAT_4,XMM1) SSE_STREAM_PS(SSE_ARG_2,FLOAT_4,XMM1) SSE_INLINE_END_2 v = aa + ai16 + 16; idt -= 4; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); SSE_SCOPE_END; PetscFunctionReturn(0); } #endif /* Special case where the matrix was ILU(0) factored in the natural ordering. This eliminates the need for the column and row permutation. */ #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_4_NaturalOrdering" PetscErrorCode MatSolve_SeqBAIJ_4_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt n=a->mbs,*ai=a->i,*aj=a->j; PetscErrorCode ierr; PetscInt *diag = a->diag; MatScalar *aa=a->a; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); #if defined(PETSC_USE_FORTRAN_KERNEL_SOLVEBAIJBLAS) { static PetscScalar w[2000]; /* very BAD need to fix */ fortransolvebaij4blas_(&n,x,ai,aj,diag,aa,b,w); } #elif defined(PETSC_USE_FORTRAN_KERNEL_SOLVEBAIJ) { static PetscScalar w[2000]; /* very BAD need to fix */ fortransolvebaij4_(&n,x,ai,aj,diag,aa,b,w); } #elif defined(PETSC_USE_FORTRAN_KERNEL_SOLVEBAIJUNROLL) fortransolvebaij4unroll_(&n,x,ai,aj,diag,aa,b); #else { PetscScalar s1,s2,s3,s4,x1,x2,x3,x4; MatScalar *v; PetscInt jdx,idt,idx,nz,*vi,i,ai16; /* forward solve the lower triangular */ idx = 0; x[0] = b[0]; x[1] = b[1]; x[2] = b[2]; x[3] = b[3]; for (i=1; i=0; i--){ ai16 = 16*diag[i]; v = aa + ai16 + 16; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt];s4 = x[3+idt]; while (nz--) { idx = 4*(*vi++); x1 = x[idx]; x2 = x[1+idx];x3 = x[2+idx]; x4 = x[3+idx]; s1 -= v[0]*x1 + v[4]*x2 + v[8]*x3 + v[12]*x4; s2 -= v[1]*x1 + v[5]*x2 + v[9]*x3 + v[13]*x4; s3 -= v[2]*x1 + v[6]*x2 + v[10]*x3 + v[14]*x4; s4 -= v[3]*x1 + v[7]*x2 + v[11]*x3 + v[15]*x4; v += 16; } v = aa + ai16; x[idt] = v[0]*s1 + v[4]*s2 + v[8]*s3 + v[12]*s4; x[1+idt] = v[1]*s1 + v[5]*s2 + v[9]*s3 + v[13]*s4; x[2+idt] = v[2]*s1 + v[6]*s2 + v[10]*s3 + v[14]*s4; x[3+idt] = v[3]*s1 + v[7]*s2 + v[11]*s3 + v[15]*s4; idt -= 4; } } #endif ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_4_NaturalOrdering_Demotion" PetscErrorCode MatSolve_SeqBAIJ_4_NaturalOrdering_Demotion(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt n=a->mbs,*ai=a->i,*aj=a->j; PetscErrorCode ierr; PetscInt *diag = a->diag; MatScalar *aa=a->a; PetscScalar *x,*b; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); { MatScalar s1,s2,s3,s4,x1,x2,x3,x4; MatScalar *v,*t=(MatScalar *)x; PetscInt jdx,idt,idx,nz,*vi,i,ai16; /* forward solve the lower triangular */ idx = 0; t[0] = (MatScalar)b[0]; t[1] = (MatScalar)b[1]; t[2] = (MatScalar)b[2]; t[3] = (MatScalar)b[3]; for (i=1; i=0; i--){ ai16 = 16*diag[i]; v = aa + ai16 + 16; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt]; s4 = t[3+idt]; while (nz--) { idx = 4*(*vi++); x1 = (MatScalar)x[idx]; x2 = (MatScalar)x[1+idx]; x3 = (MatScalar)x[2+idx]; x4 = (MatScalar)x[3+idx]; s1 -= v[0]*x1 + v[4]*x2 + v[8]*x3 + v[12]*x4; s2 -= v[1]*x1 + v[5]*x2 + v[9]*x3 + v[13]*x4; s3 -= v[2]*x1 + v[6]*x2 + v[10]*x3 + v[14]*x4; s4 -= v[3]*x1 + v[7]*x2 + v[11]*x3 + v[15]*x4; v += 16; } v = aa + ai16; x[idt] = (PetscScalar)(v[0]*s1 + v[4]*s2 + v[8]*s3 + v[12]*s4); x[1+idt] = (PetscScalar)(v[1]*s1 + v[5]*s2 + v[9]*s3 + v[13]*s4); x[2+idt] = (PetscScalar)(v[2]*s1 + v[6]*s2 + v[10]*s3 + v[14]*s4); x[3+idt] = (PetscScalar)(v[3]*s1 + v[7]*s2 + v[11]*s3 + v[15]*s4); idt -= 4; } } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #if defined (PETSC_HAVE_SSE) #include PETSC_HAVE_SSE #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_4_NaturalOrdering_SSE_Demotion_usj" PetscErrorCode MatSolve_SeqBAIJ_4_NaturalOrdering_SSE_Demotion_usj(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; unsigned short *aj=(unsigned short *)a->j; PetscErrorCode ierr; int *ai=a->i,n=a->mbs,*diag = a->diag; MatScalar *aa=a->a; PetscScalar *x,*b; PetscFunctionBegin; SSE_SCOPE_BEGIN; /* Note: This code currently uses demotion of double to float when performing the mixed-mode computation. This may not be numerically reasonable for all applications. */ PREFETCH_NTA(aa+16*ai[1]); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); { /* x will first be computed in single precision then promoted inplace to double */ MatScalar *v,*t=(MatScalar *)x; int nz,i,idt,ai16; unsigned int jdx,idx; unsigned short *vi; /* Forward solve the lower triangular factor. */ /* First block is the identity. */ idx = 0; CONVERT_DOUBLE4_FLOAT4(t,b); v = aa + 16*((unsigned int)ai[1]); for (i=1; i=0;){ PREFETCH_NTA(&v[8]); vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; LOAD_PS(&t[idt],XMM7); while (nz--) { PREFETCH_NTA(&v[16]); idx = 4*((unsigned int)(*vi++)); /* 4x4 Matrix-Vector Product with negative accumulation: */ SSE_INLINE_BEGIN_2(&t[idx],v) SSE_LOAD_PS(SSE_ARG_1,FLOAT_0,XMM6) /* First Column */ SSE_COPY_PS(XMM0,XMM6) SSE_SHUFFLE(XMM0,XMM0,0x00) SSE_MULT_PS_M(XMM0,SSE_ARG_2,FLOAT_0) SSE_SUB_PS(XMM7,XMM0) /* Second Column */ SSE_COPY_PS(XMM1,XMM6) SSE_SHUFFLE(XMM1,XMM1,0x55) SSE_MULT_PS_M(XMM1,SSE_ARG_2,FLOAT_4) SSE_SUB_PS(XMM7,XMM1) SSE_PREFETCH_NTA(SSE_ARG_2,FLOAT_24) /* Third Column */ SSE_COPY_PS(XMM2,XMM6) SSE_SHUFFLE(XMM2,XMM2,0xAA) SSE_MULT_PS_M(XMM2,SSE_ARG_2,FLOAT_8) SSE_SUB_PS(XMM7,XMM2) /* Fourth Column */ SSE_COPY_PS(XMM3,XMM6) SSE_SHUFFLE(XMM3,XMM3,0xFF) SSE_MULT_PS_M(XMM3,SSE_ARG_2,FLOAT_12) SSE_SUB_PS(XMM7,XMM3) SSE_INLINE_END_2 v += 16; } v = aa + ai16; ai16 = 16*diag[--i]; PREFETCH_NTA(aa+ai16+16); /* Scale the result by the diagonal 4x4 block, which was inverted as part of the factorization */ SSE_INLINE_BEGIN_3(v,&t[idt],aa+ai16) /* First Column */ SSE_COPY_PS(XMM0,XMM7) SSE_SHUFFLE(XMM0,XMM0,0x00) SSE_MULT_PS_M(XMM0,SSE_ARG_1,FLOAT_0) /* Second Column */ SSE_COPY_PS(XMM1,XMM7) SSE_SHUFFLE(XMM1,XMM1,0x55) SSE_MULT_PS_M(XMM1,SSE_ARG_1,FLOAT_4) SSE_ADD_PS(XMM0,XMM1) SSE_PREFETCH_NTA(SSE_ARG_3,FLOAT_24) /* Third Column */ SSE_COPY_PS(XMM2,XMM7) SSE_SHUFFLE(XMM2,XMM2,0xAA) SSE_MULT_PS_M(XMM2,SSE_ARG_1,FLOAT_8) SSE_ADD_PS(XMM0,XMM2) /* Fourth Column */ SSE_COPY_PS(XMM3,XMM7) SSE_SHUFFLE(XMM3,XMM3,0xFF) SSE_MULT_PS_M(XMM3,SSE_ARG_1,FLOAT_12) SSE_ADD_PS(XMM0,XMM3) SSE_STORE_PS(SSE_ARG_2,FLOAT_0,XMM0) SSE_INLINE_END_3 v = aa + ai16 + 16; idt -= 4; } /* Convert t from single precision back to double precision (inplace)*/ idt = 4*(n-1); for (i=n-1;i>=0;i--) { /* CONVERT_FLOAT4_DOUBLE4(&x[idt],&t[idt]); */ /* Unfortunately, CONVERT_ will count from 0 to 3 which doesn't work here. */ PetscScalar *xtemp=&x[idt]; MatScalar *ttemp=&t[idt]; xtemp[3] = (PetscScalar)ttemp[3]; xtemp[2] = (PetscScalar)ttemp[2]; xtemp[1] = (PetscScalar)ttemp[1]; xtemp[0] = (PetscScalar)ttemp[0]; idt -= 4; } } /* End of artificial scope. */ ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); SSE_SCOPE_END; PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_4_NaturalOrdering_SSE_Demotion" PetscErrorCode MatSolve_SeqBAIJ_4_NaturalOrdering_SSE_Demotion(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; int *aj=a->j; PetscErrorCode ierr; int *ai=a->i,n=a->mbs,*diag = a->diag; MatScalar *aa=a->a; PetscScalar *x,*b; PetscFunctionBegin; SSE_SCOPE_BEGIN; /* Note: This code currently uses demotion of double to float when performing the mixed-mode computation. This may not be numerically reasonable for all applications. */ PREFETCH_NTA(aa+16*ai[1]); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); { /* x will first be computed in single precision then promoted inplace to double */ MatScalar *v,*t=(MatScalar *)x; int nz,i,idt,ai16; int jdx,idx; int *vi; /* Forward solve the lower triangular factor. */ /* First block is the identity. */ idx = 0; CONVERT_DOUBLE4_FLOAT4(t,b); v = aa + 16*ai[1]; for (i=1; i=0;){ PREFETCH_NTA(&v[8]); vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; LOAD_PS(&t[idt],XMM7); while (nz--) { PREFETCH_NTA(&v[16]); idx = 4*(*vi++); /* idx = *vi++; */ /* 4x4 Matrix-Vector Product with negative accumulation: */ SSE_INLINE_BEGIN_2(&t[idx],v) SSE_LOAD_PS(SSE_ARG_1,FLOAT_0,XMM6) /* First Column */ SSE_COPY_PS(XMM0,XMM6) SSE_SHUFFLE(XMM0,XMM0,0x00) SSE_MULT_PS_M(XMM0,SSE_ARG_2,FLOAT_0) SSE_SUB_PS(XMM7,XMM0) /* Second Column */ SSE_COPY_PS(XMM1,XMM6) SSE_SHUFFLE(XMM1,XMM1,0x55) SSE_MULT_PS_M(XMM1,SSE_ARG_2,FLOAT_4) SSE_SUB_PS(XMM7,XMM1) SSE_PREFETCH_NTA(SSE_ARG_2,FLOAT_24) /* Third Column */ SSE_COPY_PS(XMM2,XMM6) SSE_SHUFFLE(XMM2,XMM2,0xAA) SSE_MULT_PS_M(XMM2,SSE_ARG_2,FLOAT_8) SSE_SUB_PS(XMM7,XMM2) /* Fourth Column */ SSE_COPY_PS(XMM3,XMM6) SSE_SHUFFLE(XMM3,XMM3,0xFF) SSE_MULT_PS_M(XMM3,SSE_ARG_2,FLOAT_12) SSE_SUB_PS(XMM7,XMM3) SSE_INLINE_END_2 v += 16; } v = aa + ai16; ai16 = 16*diag[--i]; PREFETCH_NTA(aa+ai16+16); /* Scale the result by the diagonal 4x4 block, which was inverted as part of the factorization */ SSE_INLINE_BEGIN_3(v,&t[idt],aa+ai16) /* First Column */ SSE_COPY_PS(XMM0,XMM7) SSE_SHUFFLE(XMM0,XMM0,0x00) SSE_MULT_PS_M(XMM0,SSE_ARG_1,FLOAT_0) /* Second Column */ SSE_COPY_PS(XMM1,XMM7) SSE_SHUFFLE(XMM1,XMM1,0x55) SSE_MULT_PS_M(XMM1,SSE_ARG_1,FLOAT_4) SSE_ADD_PS(XMM0,XMM1) SSE_PREFETCH_NTA(SSE_ARG_3,FLOAT_24) /* Third Column */ SSE_COPY_PS(XMM2,XMM7) SSE_SHUFFLE(XMM2,XMM2,0xAA) SSE_MULT_PS_M(XMM2,SSE_ARG_1,FLOAT_8) SSE_ADD_PS(XMM0,XMM2) /* Fourth Column */ SSE_COPY_PS(XMM3,XMM7) SSE_SHUFFLE(XMM3,XMM3,0xFF) SSE_MULT_PS_M(XMM3,SSE_ARG_1,FLOAT_12) SSE_ADD_PS(XMM0,XMM3) SSE_STORE_PS(SSE_ARG_2,FLOAT_0,XMM0) SSE_INLINE_END_3 v = aa + ai16 + 16; idt -= 4; } /* Convert t from single precision back to double precision (inplace)*/ idt = 4*(n-1); for (i=n-1;i>=0;i--) { /* CONVERT_FLOAT4_DOUBLE4(&x[idt],&t[idt]); */ /* Unfortunately, CONVERT_ will count from 0 to 3 which doesn't work here. */ PetscScalar *xtemp=&x[idt]; MatScalar *ttemp=&t[idt]; xtemp[3] = (PetscScalar)ttemp[3]; xtemp[2] = (PetscScalar)ttemp[2]; xtemp[1] = (PetscScalar)ttemp[1]; xtemp[0] = (PetscScalar)ttemp[0]; idt -= 4; } } /* End of artificial scope. */ ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*16*(a->nz) - 4*A->n);CHKERRQ(ierr); SSE_SCOPE_END; PetscFunctionReturn(0); } #endif #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_3" PetscErrorCode MatSolve_SeqBAIJ_3(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,x1,x2,x3,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 3*(*r++); t[0] = b[idx]; t[1] = b[1+idx]; t[2] = b[2+idx]; for (i=1; i=0; i--){ v = aa + 9*diag[i] + 9; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 3*i; s1 = t[idt]; s2 = t[1+idt]; s3 = t[2+idt]; while (nz--) { idx = 3*(*vi++); x1 = t[idx]; x2 = t[1+idx]; x3 = t[2+idx]; s1 -= v[0]*x1 + v[3]*x2 + v[6]*x3; s2 -= v[1]*x1 + v[4]*x2 + v[7]*x3; s3 -= v[2]*x1 + v[5]*x2 + v[8]*x3; v += 9; } idc = 3*(*c--); v = aa + 9*diag[i]; x[idc] = t[idt] = v[0]*s1 + v[3]*s2 + v[6]*s3; x[1+idc] = t[1+idt] = v[1]*s1 + v[4]*s2 + v[7]*s3; x[2+idc] = t[2+idt] = v[2]*s1 + v[5]*s2 + v[8]*s3; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*9*(a->nz) - 3*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } /* Special case where the matrix was ILU(0) factored in the natural ordering. This eliminates the need for the column and row permutation. */ #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_3_NaturalOrdering" PetscErrorCode MatSolve_SeqBAIJ_3_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt n=a->mbs,*ai=a->i,*aj=a->j; PetscErrorCode ierr; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,s3,x1,x2,x3; PetscInt jdx,idt,idx,nz,*vi,i; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the lower triangular */ idx = 0; x[0] = b[0]; x[1] = b[1]; x[2] = b[2]; for (i=1; i=0; i--){ v = aa + 9*diag[i] + 9; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 3*i; s1 = x[idt]; s2 = x[1+idt]; s3 = x[2+idt]; while (nz--) { idx = 3*(*vi++); x1 = x[idx]; x2 = x[1+idx];x3 = x[2+idx]; s1 -= v[0]*x1 + v[3]*x2 + v[6]*x3; s2 -= v[1]*x1 + v[4]*x2 + v[7]*x3; s3 -= v[2]*x1 + v[5]*x2 + v[8]*x3; v += 9; } v = aa + 9*diag[i]; x[idt] = v[0]*s1 + v[3]*s2 + v[6]*s3; x[1+idt] = v[1]*s1 + v[4]*s2 + v[7]*s3; x[2+idt] = v[2]*s1 + v[5]*s2 + v[8]*s3; } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*9*(a->nz) - 3*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_2" PetscErrorCode MatSolve_SeqBAIJ_2(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,idx,idt,idc,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,x1,x2,*t; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ idx = 2*(*r++); t[0] = b[idx]; t[1] = b[1+idx]; for (i=1; i=0; i--){ v = aa + 4*diag[i] + 4; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 2*i; s1 = t[idt]; s2 = t[1+idt]; while (nz--) { idx = 2*(*vi++); x1 = t[idx]; x2 = t[1+idx]; s1 -= v[0]*x1 + v[2]*x2; s2 -= v[1]*x1 + v[3]*x2; v += 4; } idc = 2*(*c--); v = aa + 4*diag[i]; x[idc] = t[idt] = v[0]*s1 + v[2]*s2; x[1+idc] = t[1+idt] = v[1]*s1 + v[3]*s2; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*4*(a->nz) - 2*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } /* Special case where the matrix was ILU(0) factored in the natural ordering. This eliminates the need for the column and row permutation. */ #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_2_NaturalOrdering" PetscErrorCode MatSolve_SeqBAIJ_2_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt n=a->mbs,*ai=a->i,*aj=a->j; PetscErrorCode ierr; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,s2,x1,x2; PetscInt jdx,idt,idx,nz,*vi,i; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the lower triangular */ idx = 0; x[0] = b[0]; x[1] = b[1]; for (i=1; i=0; i--){ v = aa + 4*diag[i] + 4; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = 2*i; s1 = x[idt]; s2 = x[1+idt]; while (nz--) { idx = 2*(*vi++); x1 = x[idx]; x2 = x[1+idx]; s1 -= v[0]*x1 + v[2]*x2; s2 -= v[1]*x1 + v[3]*x2; v += 4; } v = aa + 4*diag[i]; x[idt] = v[0]*s1 + v[2]*s2; x[1+idt] = v[1]*s1 + v[3]*s2; } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*4*(a->nz) - 2*A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_1" PetscErrorCode MatSolve_SeqBAIJ_1(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a=(Mat_SeqBAIJ *)A->data; IS iscol=a->col,isrow=a->row; PetscErrorCode ierr; PetscInt *r,*c,i,n=a->mbs,*vi,*ai=a->i,*aj=a->j,nz,*rout,*cout; PetscInt *diag = a->diag; MatScalar *aa=a->a,*v; PetscScalar *x,*b,s1,*t; PetscFunctionBegin; if (!n) PetscFunctionReturn(0); ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); t = a->solve_work; ierr = ISGetIndices(isrow,&rout);CHKERRQ(ierr); r = rout; ierr = ISGetIndices(iscol,&cout);CHKERRQ(ierr); c = cout + (n-1); /* forward solve the lower triangular */ t[0] = b[*r++]; for (i=1; i=0; i--){ v = aa + diag[i] + 1; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; s1 = t[i]; while (nz--) { s1 -= (*v++)*t[*vi++]; } x[*c--] = t[i] = aa[diag[i]]*s1; } ierr = ISRestoreIndices(isrow,&rout);CHKERRQ(ierr); ierr = ISRestoreIndices(iscol,&cout);CHKERRQ(ierr); ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*1*(a->nz) - A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } /* Special case where the matrix was ILU(0) factored in the natural ordering. This eliminates the need for the column and row permutation. */ #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_1_NaturalOrdering" PetscErrorCode MatSolve_SeqBAIJ_1_NaturalOrdering(Mat A,Vec bb,Vec xx) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt n=a->mbs,*ai=a->i,*aj=a->j; PetscErrorCode ierr; PetscInt *diag = a->diag; MatScalar *aa=a->a; PetscScalar *x,*b; PetscScalar s1,x1; MatScalar *v; PetscInt jdx,idt,idx,nz,*vi,i; PetscFunctionBegin; ierr = VecGetArray(bb,&b);CHKERRQ(ierr); ierr = VecGetArray(xx,&x);CHKERRQ(ierr); /* forward solve the lower triangular */ idx = 0; x[0] = b[0]; for (i=1; i=0; i--){ v = aa + diag[i] + 1; vi = aj + diag[i] + 1; nz = ai[i+1] - diag[i] - 1; idt = i; s1 = x[idt]; while (nz--) { idx = *vi++; x1 = x[idx]; s1 -= v[0]*x1; v += 1; } v = aa + diag[i]; x[idt] = v[0]*s1; } ierr = VecRestoreArray(bb,&b);CHKERRQ(ierr); ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); ierr = PetscLogFlops(2*(a->nz) - A->n);CHKERRQ(ierr); PetscFunctionReturn(0); } /* ----------------------------------------------------------------*/ /* This code is virtually identical to MatILUFactorSymbolic_SeqAIJ except that the data structure of Mat_SeqAIJ is slightly different. Not a good example of code reuse. */ EXTERN PetscErrorCode MatMissingDiagonal_SeqBAIJ(Mat); #undef __FUNCT__ #define __FUNCT__ "MatILUFactorSymbolic_SeqBAIJ" PetscErrorCode MatILUFactorSymbolic_SeqBAIJ(Mat A,IS isrow,IS iscol,MatFactorInfo *info,Mat *fact) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data,*b; IS isicol; PetscErrorCode ierr; PetscInt *r,*ic,prow,n = a->mbs,*ai = a->i,*aj = a->j; PetscInt *ainew,*ajnew,jmax,*fill,*xi,nz,*im,*ajfill,*flev; PetscInt *dloc,idx,row,m,fm,nzf,nzi,reallocate = 0,dcount = 0; PetscInt incrlev,nnz,i,bs = A->bs,bs2 = a->bs2,levels,diagonal_fill; PetscTruth col_identity,row_identity; PetscReal f; PetscFunctionBegin; f = info->fill; levels = (PetscInt)info->levels; diagonal_fill = (PetscInt)info->diagonal_fill; ierr = ISInvertPermutation(iscol,PETSC_DECIDE,&isicol);CHKERRQ(ierr); ierr = ISIdentity(isrow,&row_identity);CHKERRQ(ierr); ierr = ISIdentity(iscol,&col_identity);CHKERRQ(ierr); if (!levels && row_identity && col_identity) { /* special case copy the nonzero structure */ ierr = MatDuplicate_SeqBAIJ(A,MAT_DO_NOT_COPY_VALUES,fact);CHKERRQ(ierr); (*fact)->factor = FACTOR_LU; b = (Mat_SeqBAIJ*)(*fact)->data; if (!b->diag) { ierr = MatMarkDiagonal_SeqBAIJ(*fact);CHKERRQ(ierr); } ierr = MatMissingDiagonal_SeqBAIJ(*fact);CHKERRQ(ierr); b->row = isrow; b->col = iscol; ierr = PetscObjectReference((PetscObject)isrow);CHKERRQ(ierr); ierr = PetscObjectReference((PetscObject)iscol);CHKERRQ(ierr); b->icol = isicol; b->pivotinblocks = (info->pivotinblocks) ? PETSC_TRUE : PETSC_FALSE; ierr = PetscMalloc(((*fact)->m+1+(*fact)->bs)*sizeof(PetscScalar),&b->solve_work);CHKERRQ(ierr); } else { /* general case perform the symbolic factorization */ ierr = ISGetIndices(isrow,&r);CHKERRQ(ierr); ierr = ISGetIndices(isicol,&ic);CHKERRQ(ierr); /* get new row pointers */ ierr = PetscMalloc((n+1)*sizeof(PetscInt),&ainew);CHKERRQ(ierr); ainew[0] = 0; /* don't know how many column pointers are needed so estimate */ jmax = (PetscInt)(f*ai[n] + 1); ierr = PetscMalloc((jmax)*sizeof(PetscInt),&ajnew);CHKERRQ(ierr); /* ajfill is level of fill for each fill entry */ ierr = PetscMalloc((jmax)*sizeof(PetscInt),&ajfill);CHKERRQ(ierr); /* fill is a linked list of nonzeros in active row */ ierr = PetscMalloc((n+1)*sizeof(PetscInt),&fill);CHKERRQ(ierr); /* im is level for each filled value */ ierr = PetscMalloc((n+1)*sizeof(PetscInt),&im);CHKERRQ(ierr); /* dloc is location of diagonal in factor */ ierr = PetscMalloc((n+1)*sizeof(PetscInt),&dloc);CHKERRQ(ierr); dloc[0] = 0; for (prow=0; prow 0) { idx = *xi++; if (*flev + incrlev > levels) { flev++; continue; } do { m = fm; fm = fill[m]; } while (fm < idx); if (fm != idx) { im[idx] = *flev + incrlev; fill[m] = idx; fill[idx] = fm; fm = idx; nzf++; } else { if (im[idx] > *flev + incrlev) im[idx] = *flev+incrlev; } flev++; } row = fill[row]; nzi++; } /* copy new filled row into permanent storage */ ainew[prow+1] = ainew[prow] + nzf; if (ainew[prow+1] > jmax) { /* estimate how much additional space we will need */ /* use the strategy suggested by David Hysom */ /* just double the memory each time */ PetscInt maxadd = jmax; /* maxadd = (int)(((f*ai[n]+1)*(n-prow+5))/n); */ if (maxadd < nzf) maxadd = (n-prow)*(nzf+1); jmax += maxadd; /* allocate a longer ajnew and ajfill */ ierr = PetscMalloc(jmax*sizeof(PetscInt),&xi);CHKERRQ(ierr); ierr = PetscMemcpy(xi,ajnew,ainew[prow]*sizeof(PetscInt));CHKERRQ(ierr); ierr = PetscFree(ajnew);CHKERRQ(ierr); ajnew = xi; ierr = PetscMalloc(jmax*sizeof(PetscInt),&xi);CHKERRQ(ierr); ierr = PetscMemcpy(xi,ajfill,ainew[prow]*sizeof(PetscInt));CHKERRQ(ierr); ierr = PetscFree(ajfill);CHKERRQ(ierr); ajfill = xi; reallocate++; /* count how many reallocations are needed */ } xi = ajnew + ainew[prow]; flev = ajfill + ainew[prow]; dloc[prow] = nzi; fm = fill[n]; while (nzf--) { *xi++ = fm; *flev++ = im[fm]; fm = fill[fm]; } /* make sure row has diagonal entry */ if (ajnew[ainew[prow]+dloc[prow]] != prow) { SETERRQ1(PETSC_ERR_MAT_LU_ZRPVT,"Row %D has missing diagonal in factored matrix\n\ try running with -pc_ilu_nonzeros_along_diagonal or -pc_ilu_diagonal_fill",prow); } } ierr = PetscFree(ajfill);CHKERRQ(ierr); ierr = ISRestoreIndices(isrow,&r);CHKERRQ(ierr); ierr = ISRestoreIndices(isicol,&ic);CHKERRQ(ierr); ierr = PetscFree(fill);CHKERRQ(ierr); ierr = PetscFree(im);CHKERRQ(ierr); #if defined(PETSC_USE_DEBUG) { PetscReal af = ((PetscReal)ainew[n])/((PetscReal)ai[n]); ierr = PetscLogInfo((A,"MatILUFactorSymbolic_SeqBAIJ:Reallocs %D Fill ratio:given %g needed %g\n",reallocate,f,af));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatILUFactorSymbolic_SeqBAIJ:Run with -pc_ilu_fill %g or use \n",af));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatILUFactorSymbolic_SeqBAIJ:PCILUSetFill(pc,%g);\n",af));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatILUFactorSymbolic_SeqBAIJ:for best performance.\n"));CHKERRQ(ierr); if (diagonal_fill) { ierr = PetscLogInfo((A,"MatILUFactorSymbolic_SeqBAIJ:Detected and replaced %D missing diagonals\n",dcount));CHKERRQ(ierr); } } #endif /* put together the new matrix */ ierr = MatCreate(A->comm,fact);CHKERRQ(ierr); ierr = MatSetSizes(*fact,bs*n,bs*n,bs*n,bs*n);CHKERRQ(ierr); ierr = MatSetType(*fact,A->type_name);CHKERRQ(ierr); ierr = MatSeqBAIJSetPreallocation_SeqBAIJ(*fact,bs,MAT_SKIP_ALLOCATION,PETSC_NULL);CHKERRQ(ierr); ierr = PetscLogObjectParent(*fact,isicol);CHKERRQ(ierr); b = (Mat_SeqBAIJ*)(*fact)->data; b->singlemalloc = PETSC_FALSE; ierr = PetscMalloc(bs2*ainew[n]*sizeof(MatScalar),&b->a);CHKERRQ(ierr); b->j = ajnew; b->i = ainew; for (i=0; idiag = dloc; b->ilen = 0; b->imax = 0; b->row = isrow; b->col = iscol; b->pivotinblocks = (info->pivotinblocks) ? PETSC_TRUE : PETSC_FALSE; ierr = PetscObjectReference((PetscObject)isrow);CHKERRQ(ierr); ierr = PetscObjectReference((PetscObject)iscol);CHKERRQ(ierr); b->icol = isicol; ierr = PetscMalloc((bs*n+bs)*sizeof(PetscScalar),&b->solve_work);CHKERRQ(ierr); /* In b structure: Free imax, ilen, old a, old j. Allocate dloc, solve_work, new a, new j */ ierr = PetscLogObjectMemory(*fact,(ainew[n]-n)*(sizeof(PetscInt))+bs2*ainew[n]*sizeof(PetscScalar));CHKERRQ(ierr); b->maxnz = b->nz = ainew[n]; (*fact)->factor = FACTOR_LU; (*fact)->info.factor_mallocs = reallocate; (*fact)->info.fill_ratio_given = f; (*fact)->info.fill_ratio_needed = ((PetscReal)ainew[n])/((PetscReal)ai[prow]); } if (row_identity && col_identity) { ierr = MatSeqBAIJ_UpdateFactorNumeric_NaturalOrdering(*fact);CHKERRQ(ierr); } PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSetUnfactored_SeqBAIJ_4_NaturalOrdering_SSE" PetscErrorCode MatSetUnfactored_SeqBAIJ_4_NaturalOrdering_SSE(Mat A) { /* Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; */ /* int i,*AJ=a->j,nz=a->nz; */ PetscFunctionBegin; /* Undo Column scaling */ /* while (nz--) { */ /* AJ[i] = AJ[i]/4; */ /* } */ /* This should really invoke a push/pop logic, but we don't have that yet. */ A->ops->setunfactored = PETSC_NULL; PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSetUnfactored_SeqBAIJ_4_NaturalOrdering_SSE_usj" PetscErrorCode MatSetUnfactored_SeqBAIJ_4_NaturalOrdering_SSE_usj(Mat A) { Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; PetscInt *AJ=a->j,nz=a->nz; unsigned short *aj=(unsigned short *)AJ; PetscFunctionBegin; /* Is this really necessary? */ while (nz--) { AJ[nz] = (int)((unsigned int)aj[nz]); /* First extend, then convert to signed. */ } A->ops->setunfactored = PETSC_NULL; PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSeqBAIJ_UpdateFactorNumeric_NaturalOrdering" PetscErrorCode MatSeqBAIJ_UpdateFactorNumeric_NaturalOrdering(Mat inA) { PetscErrorCode ierr; /* Blocksize 2, 3, 4, 5, 6 and 7 have a special faster factorization/solver with natural ordering */ PetscFunctionBegin; inA->ops->solve = MatSolve_SeqBAIJ_Update; inA->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_Update; switch (inA->bs) { case 1: inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_1; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=1\n"));CHKERRQ(ierr); break; case 2: inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_2_NaturalOrdering; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=2\n"));CHKERRQ(ierr); break; case 3: inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_3_NaturalOrdering; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=3\n"));CHKERRQ(ierr); break; case 4: #if defined(PETSC_USE_MAT_SINGLE) { PetscTruth sse_enabled_local; PetscErrorCode ierr; ierr = PetscSSEIsEnabled(inA->comm,&sse_enabled_local,PETSC_NULL);CHKERRQ(ierr); if (sse_enabled_local) { # if defined(PETSC_HAVE_SSE) int i,*AJ=a->j,nz=a->nz,n=a->mbs; if (n==(unsigned short)n) { unsigned short *aj=(unsigned short *)AJ; for (i=0;iops->setunfactored = MatSetUnfactored_SeqBAIJ_4_NaturalOrdering_SSE_usj; inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_4_NaturalOrdering_SSE_usj; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special SSE, in-place natural ordering, ushort j index factor BS=4\n"));CHKERRQ(ierr); } else { /* Scale the column indices for easier indexing in MatSolve. */ /* for (i=0;iops->setunfactored = MatSetUnfactored_SeqBAIJ_4_NaturalOrdering_SSE; inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_4_NaturalOrdering_SSE; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special SSE, in-place natural ordering, int j index factor BS=4\n"));CHKERRQ(ierr); } # else /* This should never be reached. If so, problem in PetscSSEIsEnabled. */ SETERRQ(PETSC_ERR_SUP,"SSE Hardware unavailable"); # endif } else { inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_4_NaturalOrdering; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=4\n"));CHKERRQ(ierr); } } #else inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_4_NaturalOrdering; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=4\n"));CHKERRQ(ierr); #endif break; case 5: inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_5_NaturalOrdering; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=5\n"));CHKERRQ(ierr); break; case 6: inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_6_NaturalOrdering; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=6\n"));CHKERRQ(ierr); break; case 7: inA->ops->lufactornumeric = MatLUFactorNumeric_SeqBAIJ_7_NaturalOrdering; ierr = PetscLogInfo((inA,"MatILUFactor_SeqBAIJ:Using special in-place natural ordering factor BS=7\n"));CHKERRQ(ierr); break; } PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSeqBAIJ_UpdateSolvers" PetscErrorCode MatSeqBAIJ_UpdateSolvers(Mat A) { /* Blocksize 2, 3, 4, 5, 6 and 7 have a special faster factorization/solver with natural ordering */ Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data; IS row = a->row, col = a->col; PetscTruth row_identity, col_identity; PetscTruth use_natural; PetscErrorCode ierr; PetscFunctionBegin; use_natural = PETSC_FALSE; if (row && col) { ierr = ISIdentity(row,&row_identity);CHKERRQ(ierr); ierr = ISIdentity(col,&col_identity);CHKERRQ(ierr); if (row_identity && col_identity) { use_natural = PETSC_TRUE; } } else { use_natural = PETSC_TRUE; } switch (A->bs) { case 1: if (use_natural) { A->ops->solve = MatSolve_SeqBAIJ_1_NaturalOrdering; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_1_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using special in-place natural ordering solve BS=1\n"));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatSolveTranspose_SeqBAIJ:Using special in-place natural ordering solve BS=4\n"));CHKERRQ(ierr); } else { A->ops->solve = MatSolve_SeqBAIJ_1; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_1; } break; case 2: if (use_natural) { A->ops->solve = MatSolve_SeqBAIJ_2_NaturalOrdering; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_2_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using special in-place natural ordering solve BS=2\n"));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatSolveTranspose_SeqBAIJ:Using special in-place natural ordering solve BS=4\n"));CHKERRQ(ierr); } else { A->ops->solve = MatSolve_SeqBAIJ_2; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_2; } break; case 3: if (use_natural) { A->ops->solve = MatSolve_SeqBAIJ_3_NaturalOrdering; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_3_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using special in-place natural ordering solve BS=3\n"));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatSolveTranspose_SeqBAIJ:Using special in-place natural ordering solve BS=4\n"));CHKERRQ(ierr); } else { A->ops->solve = MatSolve_SeqBAIJ_3; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_3; } break; case 4: { PetscTruth sse_enabled_local; ierr = PetscSSEIsEnabled(A->comm,&sse_enabled_local,PETSC_NULL);CHKERRQ(ierr); if (use_natural) { #if defined(PETSC_USE_MAT_SINGLE) if (sse_enabled_local) { /* Natural + Single + SSE */ # if defined(PETSC_HAVE_SSE) PetscInt n=a->mbs; if (n==(unsigned short)n) { A->ops->solve = MatSolve_SeqBAIJ_4_NaturalOrdering_SSE_Demotion_usj; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using single precision, SSE, in-place, ushort j index, natural ordering solve BS=4\n"));CHKERRQ(ierr); } else { A->ops->solve = MatSolve_SeqBAIJ_4_NaturalOrdering_SSE_Demotion; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using single precision, SSE, in-place, int j index, natural ordering solve BS=4\n"));CHKERRQ(ierr); } # else /* This should never be reached, unless there is a bug in PetscSSEIsEnabled(). */ SETERRQ(PETSC_ERR_SUP,"SSE implementations are unavailable."); # endif } else { /* Natural + Single */ A->ops->solve = MatSolve_SeqBAIJ_4_NaturalOrdering_Demotion; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using single precision, in-place, natural ordering solve BS=4\n"));CHKERRQ(ierr); } #else A->ops->solve = MatSolve_SeqBAIJ_4_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using special in-place, natural ordering solve BS=4\n"));CHKERRQ(ierr); #endif A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_4_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolveTranspose_SeqBAIJ:Using special in-place, natural ordering solve BS=4\n"));CHKERRQ(ierr); } else { /* Arbitrary ordering */ #if defined(PETSC_USE_MAT_SINGLE) if (sse_enabled_local) { /* Arbitrary + Single + SSE */ # if defined(PETSC_HAVE_SSE) A->ops->solve = MatSolve_SeqBAIJ_4_SSE_Demotion; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using single precision, SSE solve BS=4\n"));CHKERRQ(ierr); # else /* This should never be reached, unless there is a bug in PetscSSEIsEnabled(). */ SETERRQ(PETSC_ERR_SUP,"SSE implementations are unavailable."); # endif } else { /* Arbitrary + Single */ A->ops->solve = MatSolve_SeqBAIJ_4_Demotion; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using single precision solve BS=4\n"));CHKERRQ(ierr); } #else A->ops->solve = MatSolve_SeqBAIJ_4; #endif A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_4; } } break; case 5: if (use_natural) { A->ops->solve = MatSolve_SeqBAIJ_5_NaturalOrdering; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_5_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using special in-place natural ordering solve BS=5\n"));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatSolveTranspose_SeqBAIJ:Using special in-place natural ordering solve BS=5\n"));CHKERRQ(ierr); } else { A->ops->solve = MatSolve_SeqBAIJ_5; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_5; } break; case 6: if (use_natural) { A->ops->solve = MatSolve_SeqBAIJ_6_NaturalOrdering; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_6_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using special in-place natural ordering solve BS=6\n"));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatSolveTranspose_SeqBAIJ:Using special in-place natural ordering solve BS=6\n"));CHKERRQ(ierr); } else { A->ops->solve = MatSolve_SeqBAIJ_6; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_6; } break; case 7: if (use_natural) { A->ops->solve = MatSolve_SeqBAIJ_7_NaturalOrdering; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_7_NaturalOrdering; ierr = PetscLogInfo((A,"MatSolve_SeqBAIJ:Using special in-place natural ordering solve BS=7\n"));CHKERRQ(ierr); ierr = PetscLogInfo((A,"MatSolveTranspose_SeqBAIJ:Using special in-place natural ordering solve BS=7\n"));CHKERRQ(ierr); } else { A->ops->solve = MatSolve_SeqBAIJ_7; A->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_7; } break; default: A->ops->solve = MatSolve_SeqBAIJ_N; break; } PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolve_SeqBAIJ_Update" PetscErrorCode MatSolve_SeqBAIJ_Update(Mat A,Vec x,Vec y) { PetscErrorCode ierr; PetscFunctionBegin; ierr = MatSeqBAIJ_UpdateSolvers(A); if (A->ops->solve != MatSolve_SeqBAIJ_Update) { ierr = (*A->ops->solve)(A,x,y);CHKERRQ(ierr); } else { SETERRQ(PETSC_ERR_SUP,"Something really wrong happened."); } PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "MatSolveTranspose_SeqBAIJ_Update" PetscErrorCode MatSolveTranspose_SeqBAIJ_Update(Mat A,Vec x,Vec y) { PetscErrorCode ierr; PetscFunctionBegin; ierr = MatSeqBAIJ_UpdateSolvers(A); ierr = (*A->ops->solvetranspose)(A,x,y);CHKERRQ(ierr); PetscFunctionReturn(0); }