!===================================== ! ! ! ! Computational routines ! ! ! ! ! ! !===================================== subroutine d_csr_csmv_impl(alpha,a,x,beta,y,info,trans) use psb_error_mod use psb_string_mod use psb_d_csr_mat_mod, psb_protect_name => d_csr_csmv_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a real(psb_dpk_), intent(in) :: alpha, beta, x(:) real(psb_dpk_), intent(inout) :: y(:) integer, intent(out) :: info character, optional, intent(in) :: trans character :: trans_ integer :: i,j,k,m,n, nnz, ir, jc real(psb_dpk_) :: acc logical :: tra Integer :: err_act character(len=20) :: name='d_csr_csmv' logical, parameter :: debug=.false. call psb_erractionsave(err_act) info = 0 if (present(trans)) then trans_ = trans else trans_ = 'N' end if if (.not.a%is_asb()) then info = 1121 call psb_errpush(info,name) goto 9999 endif tra = (psb_toupper(trans_)=='T').or.(psb_toupper(trans_)=='C') if (tra) then m = a%get_ncols() n = a%get_nrows() else n = a%get_ncols() m = a%get_nrows() end if call d_csr_csmv_inner(m,n,alpha,a%irp,a%ja,a%val,& & a%is_triangle(),a%is_unit(),& & x,beta,y,tra) call psb_erractionrestore(err_act) return 9999 continue call psb_erractionrestore(err_act) if (err_act == psb_act_abort_) then call psb_error() return end if return contains subroutine d_csr_csmv_inner(m,n,alpha,irp,ja,val,is_triangle,is_unit,& & x,beta,y,tra) integer, intent(in) :: m,n,irp(*),ja(*) real(psb_dpk_), intent(in) :: alpha, beta, x(*),val(*) real(psb_dpk_), intent(inout) :: y(*) logical, intent(in) :: is_triangle,is_unit,tra integer :: i,j,k, ir, jc real(psb_dpk_) :: acc if (alpha == dzero) then if (beta == dzero) then do i = 1, m y(i) = dzero enddo else do i = 1, m y(i) = beta*y(i) end do endif return end if if (.not.tra) then if (beta == dzero) then if (alpha == done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = acc end do else if (alpha == -done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = -acc end do else do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = alpha*acc end do end if else if (beta == done) then if (alpha == done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = y(i) + acc end do else if (alpha == -done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = y(i) -acc end do else do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = y(i) + alpha*acc end do end if else if (beta == -done) then if (alpha == done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = -y(i) + acc end do else if (alpha == -done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = -y(i) -acc end do else do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = -y(i) + alpha*acc end do end if else if (alpha == done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = beta*y(i) + acc end do else if (alpha == -done) then do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = beta*y(i) - acc end do else do i=1,m acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j) * x(ja(j)) enddo y(i) = beta*y(i) + alpha*acc end do end if end if else if (tra) then if (beta == dzero) then do i=1, m y(i) = dzero end do else if (beta == done) then ! Do nothing else if (beta == -done) then do i=1, m y(i) = -y(i) end do else do i=1, m y(i) = beta*y(i) end do end if if (alpha == done) then do i=1,n do j=irp(i), irp(i+1)-1 ir = ja(j) y(ir) = y(ir) + val(j)*x(i) end do enddo else if (alpha == -done) then do i=1,n do j=irp(i), irp(i+1)-1 ir = ja(j) y(ir) = y(ir) - val(j)*x(i) end do enddo else do i=1,n do j=irp(i), irp(i+1)-1 ir = ja(j) y(ir) = y(ir) + alpha*val(j)*x(i) end do enddo end if endif if (is_triangle.and.is_unit) then do i=1, min(m,n) y(i) = y(i) + alpha*x(i) end do end if end subroutine d_csr_csmv_inner end subroutine d_csr_csmv_impl subroutine d_csr_csmm_impl(alpha,a,x,beta,y,info,trans) use psb_error_mod use psb_string_mod use psb_d_csr_mat_mod, psb_protect_name => d_csr_csmm_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a real(psb_dpk_), intent(in) :: alpha, beta, x(:,:) real(psb_dpk_), intent(inout) :: y(:,:) integer, intent(out) :: info character, optional, intent(in) :: trans character :: trans_ integer :: i,j,k,m,n, nnz, ir, jc, nc real(psb_dpk_), allocatable :: acc(:) logical :: tra Integer :: err_act character(len=20) :: name='d_csr_csmm' logical, parameter :: debug=.false. info = 0 call psb_erractionsave(err_act) if (present(trans)) then trans_ = trans else trans_ = 'N' end if if (.not.a%is_asb()) then info = 1121 call psb_errpush(info,name) goto 9999 endif tra = (psb_toupper(trans_)=='T').or.(psb_toupper(trans_)=='C') if (tra) then m = a%get_ncols() n = a%get_nrows() else n = a%get_ncols() m = a%get_nrows() end if nc = min(size(x,2) , size(y,2) ) allocate(acc(nc), stat=info) if(info /= 0) then info=4010 call psb_errpush(info,name,a_err='allocate') goto 9999 end if call d_csr_csmm_inner(m,n,nc,alpha,a%irp,a%ja,a%val, & & a%is_triangle(),a%is_unit(),x,size(x,1), & & beta,y,size(y,1),tra,acc) call psb_erractionrestore(err_act) return 9999 continue call psb_erractionrestore(err_act) if (err_act == psb_act_abort_) then call psb_error() return end if return contains subroutine d_csr_csmm_inner(m,n,nc,alpha,irp,ja,val,& & is_triangle,is_unit,x,ldx,beta,y,ldy,tra,acc) integer, intent(in) :: m,n,ldx,ldy,nc,irp(*),ja(*) real(psb_dpk_), intent(in) :: alpha, beta, x(ldx,*),val(*) real(psb_dpk_), intent(inout) :: y(ldy,*) logical, intent(in) :: is_triangle,is_unit,tra real(psb_dpk_), intent(inout) :: acc(*) integer :: i,j,k, ir, jc if (alpha == dzero) then if (beta == dzero) then do i = 1, m y(i,1:nc) = dzero enddo else do i = 1, m y(i,1:nc) = beta*y(i,1:nc) end do endif return end if if (.not.tra) then if (beta == dzero) then if (alpha == done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = acc(1:nc) end do else if (alpha == -done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = -acc(1:nc) end do else do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = alpha*acc(1:nc) end do end if else if (beta == done) then if (alpha == done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = y(i,1:nc) + acc(1:nc) end do else if (alpha == -done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = y(i,1:nc) -acc(1:nc) end do else do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = y(i,1:nc) + alpha*acc(1:nc) end do end if else if (beta == -done) then if (alpha == done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = -y(i,1:nc) + acc(1:nc) end do else if (alpha == -done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = -y(i,1:nc) -acc(1:nc) end do else do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = -y(i,1:nc) + alpha*acc(1:nc) end do end if else if (alpha == done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = beta*y(i,1:nc) + acc(1:nc) end do else if (alpha == -done) then do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = beta*y(i,1:nc) - acc(1:nc) end do else do i=1,m acc(1:nc) = dzero do j=irp(i), irp(i+1)-1 acc(1:nc) = acc(1:nc) + val(j) * x(ja(j),1:nc) enddo y(i,1:nc) = beta*y(i,1:nc) + alpha*acc(1:nc) end do end if end if else if (tra) then if (beta == dzero) then do i=1, m y(i,1:nc) = dzero end do else if (beta == done) then ! Do nothing else if (beta == -done) then do i=1, m y(i,1:nc) = -y(i,1:nc) end do else do i=1, m y(i,1:nc) = beta*y(i,1:nc) end do end if if (alpha == done) then do i=1,n do j=irp(i), irp(i+1)-1 ir = ja(j) y(ir,1:nc) = y(ir,1:nc) + val(j)*x(i,1:nc) end do enddo else if (alpha == -done) then do i=1,n do j=irp(i), irp(i+1)-1 ir = ja(j) y(ir,1:nc) = y(ir,1:nc) - val(j)*x(i,1:nc) end do enddo else do i=1,n do j=irp(i), irp(i+1)-1 ir = ja(j) y(ir,1:nc) = y(ir,1:nc) + alpha*val(j)*x(i,1:nc) end do enddo end if endif if (is_triangle.and.is_unit) then do i=1, min(m,n) y(i,1:nc) = y(i,1:nc) + alpha*x(i,1:nc) end do end if end subroutine d_csr_csmm_inner end subroutine d_csr_csmm_impl subroutine d_csr_cssv_impl(alpha,a,x,beta,y,info,trans) use psb_error_mod use psb_d_csr_mat_mod, psb_protect_name => d_csr_cssv_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a real(psb_dpk_), intent(in) :: alpha, beta, x(:) real(psb_dpk_), intent(inout) :: y(:) integer, intent(out) :: info character, optional, intent(in) :: trans character :: trans_ integer :: i,j,k,m,n, nnz, ir, jc real(psb_dpk_) :: acc real(psb_dpk_), allocatable :: tmp(:) logical :: tra Integer :: err_act character(len=20) :: name='d_csr_cssv' logical, parameter :: debug=.false. info = 0 call psb_erractionsave(err_act) if (present(trans)) then trans_ = trans else trans_ = 'N' end if if (.not.a%is_asb()) then info = 1121 call psb_errpush(info,name) goto 9999 endif tra = ((trans_=='T').or.(trans_=='t')) m = a%get_nrows() if (.not. (a%is_triangle())) then info = 1121 call psb_errpush(info,name) goto 9999 end if if (alpha == dzero) then if (beta == dzero) then do i = 1, m y(i) = dzero enddo else do i = 1, m y(i) = beta*y(i) end do endif return end if if (beta == dzero) then call inner_csrsv(tra,a%is_lower(),a%is_unit(),a%get_nrows(),& & a%irp,a%ja,a%val,x,y) if (alpha == done) then ! do nothing else if (alpha == -done) then do i = 1, m y(i) = -y(i) end do else do i = 1, m y(i) = alpha*y(i) end do end if else allocate(tmp(m), stat=info) if (info /= 0) then return end if tmp(1:m) = x(1:m) call inner_csrsv(tra,a%is_lower(),a%is_unit(),a%get_nrows(),& & a%irp,a%ja,a%val,tmp,y) do i = 1, m y(i) = alpha*tmp(i) + beta*y(i) end do end if call psb_erractionrestore(err_act) return 9999 continue call psb_erractionrestore(err_act) if (err_act == psb_act_abort_) then call psb_error() return end if return contains subroutine inner_csrsv(tra,lower,unit,n,irp,ja,val,x,y) implicit none logical, intent(in) :: tra,lower,unit integer, intent(in) :: irp(*), ja(*),n real(psb_dpk_), intent(in) :: val(*) real(psb_dpk_), intent(in) :: x(*) real(psb_dpk_), intent(out) :: y(*) integer :: i,j,k,m, ir, jc real(psb_dpk_) :: acc if (.not.tra) then if (lower) then if (unit) then do i=1, n acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j)*y(ja(j)) end do y(i) = x(i) - acc end do else if (.not.unit) then do i=1, n acc = dzero do j=irp(i), irp(i+1)-2 acc = acc + val(j)*y(ja(j)) end do y(i) = (x(i) - acc)/val(irp(i+1)-1) end do end if else if (.not.lower) then if (unit) then do i=n, 1, -1 acc = dzero do j=irp(i), irp(i+1)-1 acc = acc + val(j)*y(ja(j)) end do y(i) = x(i) - acc end do else if (.not.unit) then do i=n, 1, -1 acc = dzero do j=irp(i)+1, irp(i+1)-1 acc = acc + val(j)*y(ja(j)) end do y(i) = (x(i) - acc)/val(irp(i)) end do end if end if else if (tra) then do i=1, n y(i) = x(i) end do if (lower) then if (unit) then do i=n, 1, -1 acc = y(i) do j=irp(i), irp(i+1)-1 jc = ja(j) y(jc) = y(jc) - val(j)*acc end do end do else if (.not.unit) then do i=n, 1, -1 y(i) = y(i)/val(irp(i+1)-1) acc = y(i) do j=irp(i), irp(i+1)-2 jc = ja(j) y(jc) = y(jc) - val(j)*acc end do end do end if else if (.not.lower) then if (unit) then do i=1, n acc = y(i) do j=irp(i), irp(i+1)-1 jc = ja(j) y(jc) = y(jc) - val(j)*acc end do end do else if (.not.unit) then do i=1, n y(i) = y(i)/val(irp(i)) acc = y(i) do j=irp(i)+1, irp(i+1)-1 jc = ja(j) y(jc) = y(jc) - val(j)*acc end do end do end if end if end if end subroutine inner_csrsv end subroutine d_csr_cssv_impl subroutine d_csr_cssm_impl(alpha,a,x,beta,y,info,trans) use psb_error_mod use psb_d_csr_mat_mod, psb_protect_name => d_csr_cssm_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a real(psb_dpk_), intent(in) :: alpha, beta, x(:,:) real(psb_dpk_), intent(inout) :: y(:,:) integer, intent(out) :: info character, optional, intent(in) :: trans character :: trans_ integer :: i,j,k,m,n, nnz, ir, jc, nc real(psb_dpk_) :: acc real(psb_dpk_), allocatable :: tmp(:,:) logical :: tra Integer :: err_act character(len=20) :: name='d_base_csmm' logical, parameter :: debug=.false. info = 0 call psb_erractionsave(err_act) if (present(trans)) then trans_ = trans else trans_ = 'N' end if if (.not.a%is_asb()) then info = 1121 call psb_errpush(info,name) goto 9999 endif tra = ((trans_=='T').or.(trans_=='t')) m = a%get_nrows() nc = min(size(x,2) , size(y,2)) if (.not. (a%is_triangle())) then info = 1121 call psb_errpush(info,name) goto 9999 end if if (alpha == dzero) then if (beta == dzero) then do i = 1, m y(i,:) = dzero enddo else do i = 1, m y(i,:) = beta*y(i,:) end do endif return end if if (beta == dzero) then call inner_csrsm(tra,a%is_lower(),a%is_unit(),a%get_nrows(),nc,& & a%irp,a%ja,a%val,x,size(x,1),y,size(y,1),info) do i = 1, m y(i,1:nc) = alpha*y(i,1:nc) end do else allocate(tmp(m,nc), stat=info) if(info /= 0) then info=4010 call psb_errpush(info,name,a_err='allocate') goto 9999 end if tmp(1:m,:) = x(1:m,1:nc) call inner_csrsm(tra,a%is_lower(),a%is_unit(),a%get_nrows(),nc,& & a%irp,a%ja,a%val,tmp,size(tmp,1),y,size(y,1),info) do i = 1, m y(i,1:nc) = alpha*tmp(i,1:nc) + beta*y(i,1:nc) end do end if if(info /= 0) then info=4010 call psb_errpush(info,name,a_err='inner_csrsm') goto 9999 end if call psb_erractionrestore(err_act) return 9999 continue call psb_erractionrestore(err_act) if (err_act == psb_act_abort_) then call psb_error() return end if return contains subroutine inner_csrsm(tra,lower,unit,nr,nc,& & irp,ja,val,x,ldx,y,ldy,info) implicit none logical, intent(in) :: tra,lower,unit integer, intent(in) :: nr,nc,ldx,ldy,irp(*),ja(*) real(psb_dpk_), intent(in) :: val(*), x(ldx,*) real(psb_dpk_), intent(out) :: y(ldy,*) integer, intent(out) :: info integer :: i,j,k,m, ir, jc real(psb_dpk_), allocatable :: acc(:) info = 0 allocate(acc(nc), stat=info) if(info /= 0) then info=4010 return end if if (.not.tra) then if (lower) then if (unit) then do i=1, nr acc = dzero do j=a%irp(i), a%irp(i+1)-1 acc = acc + a%val(j)*y(a%ja(j),1:nc) end do y(i,1:nc) = x(i,1:nc) - acc end do else if (.not.unit) then do i=1, nr acc = dzero do j=a%irp(i), a%irp(i+1)-2 acc = acc + a%val(j)*y(a%ja(j),1:nc) end do y(i,1:nc) = (x(i,1:nc) - acc)/a%val(a%irp(i+1)-1) end do end if else if (.not.lower) then if (unit) then do i=nr, 1, -1 acc = dzero do j=a%irp(i), a%irp(i+1)-1 acc = acc + a%val(j)*y(a%ja(j),1:nc) end do y(i,1:nc) = x(i,1:nc) - acc end do else if (.not.unit) then do i=nr, 1, -1 acc = dzero do j=a%irp(i)+1, a%irp(i+1)-1 acc = acc + a%val(j)*y(a%ja(j),1:nc) end do y(i,1:nc) = (x(i,1:nc) - acc)/a%val(a%irp(i)) end do end if end if else if (tra) then do i=1, nr y(i,1:nc) = x(i,1:nc) end do if (lower) then if (unit) then do i=nr, 1, -1 acc = y(i,1:nc) do j=a%irp(i), a%irp(i+1)-1 jc = a%ja(j) y(jc,1:nc) = y(jc,1:nc) - a%val(j)*acc end do end do else if (.not.unit) then do i=nr, 1, -1 y(i,1:nc) = y(i,1:nc)/a%val(a%irp(i+1)-1) acc = y(i,1:nc) do j=a%irp(i), a%irp(i+1)-2 jc = a%ja(j) y(jc,1:nc) = y(jc,1:nc) - a%val(j)*acc end do end do end if else if (.not.lower) then if (unit) then do i=1, nr acc = y(i,1:nc) do j=a%irp(i), a%irp(i+1)-1 jc = a%ja(j) y(jc,1:nc) = y(jc,1:nc) - a%val(j)*acc end do end do else if (.not.unit) then do i=1, nr y(i,1:nc) = y(i,1:nc)/a%val(a%irp(i)) acc = y(i,1:nc) do j=a%irp(i)+1, a%irp(i+1)-1 jc = a%ja(j) y(jc,1:nc) = y(jc,1:nc) - a%val(j)*acc end do end do end if end if end if end subroutine inner_csrsm end subroutine d_csr_cssm_impl function d_csr_csnmi_impl(a) result(res) use psb_error_mod use psb_d_csr_mat_mod, psb_protect_name => d_csr_csnmi_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a real(psb_dpk_) :: res integer :: i,j,k,m,n, nr, ir, jc, nc real(psb_dpk_) :: acc logical :: tra Integer :: err_act character(len=20) :: name='d_csnmi' logical, parameter :: debug=.false. res = dzero do i = 1, a%get_nrows() acc = dzero do j=a%irp(i),a%irp(i+1)-1 acc = acc + abs(a%val(j)) end do res = max(res,acc) end do end function d_csr_csnmi_impl !===================================== ! ! ! ! Data management ! ! ! ! ! !===================================== subroutine d_csr_csgetptn_impl(imin,imax,a,nz,ia,ja,info,& & jmin,jmax,iren,append,nzin,rscale,cscale) ! Output is always in COO format use psb_error_mod use psb_const_mod use psb_error_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_csr_csgetptn_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a integer, intent(in) :: imin,imax integer, intent(out) :: nz integer, allocatable, intent(inout) :: ia(:), ja(:) integer,intent(out) :: info logical, intent(in), optional :: append integer, intent(in), optional :: iren(:) integer, intent(in), optional :: jmin,jmax, nzin logical, intent(in), optional :: rscale,cscale logical :: append_, rscale_, cscale_ integer :: nzin_, jmin_, jmax_, err_act, i character(len=20) :: name='csget' logical, parameter :: debug=.false. call psb_erractionsave(err_act) info = 0 if (present(jmin)) then jmin_ = jmin else jmin_ = 1 endif if (present(jmax)) then jmax_ = jmax else jmax_ = a%get_ncols() endif if ((imax d_csr_csgetrow_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a integer, intent(in) :: imin,imax integer, intent(out) :: nz integer, allocatable, intent(inout) :: ia(:), ja(:) real(psb_dpk_), allocatable, intent(inout) :: val(:) integer,intent(out) :: info logical, intent(in), optional :: append integer, intent(in), optional :: iren(:) integer, intent(in), optional :: jmin,jmax, nzin logical, intent(in), optional :: rscale,cscale logical :: append_, rscale_, cscale_ integer :: nzin_, jmin_, jmax_, err_act, i character(len=20) :: name='csget' logical, parameter :: debug=.false. call psb_erractionsave(err_act) info = 0 if (present(jmin)) then jmin_ = jmin else jmin_ = 1 endif if (present(jmax)) then jmax_ = jmax else jmax_ = a%get_ncols() endif if ((imax d_csr_csput_impl implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a real(psb_dpk_), intent(in) :: val(:) integer, intent(in) :: nz, ia(:), ja(:), imin,imax,jmin,jmax integer, intent(out) :: info integer, intent(in), optional :: gtl(:) Integer :: err_act character(len=20) :: name='d_csr_csput' logical, parameter :: debug=.false. integer :: nza, i,j,k, nzl, isza, int_err(5) info = 0 nza = a%get_nzeros() if (a%is_bld()) then ! Build phase should only ever be in COO info = 1121 else if (a%is_upd()) then call d_csr_srch_upd(nz,ia,ja,val,a,& & imin,imax,jmin,jmax,info,gtl) if (info /= 0) then info = 1121 end if else ! State is wrong. info = 1121 end if if (info /= 0) then call psb_errpush(info,name) goto 9999 end if call psb_erractionrestore(err_act) return 9999 continue call psb_erractionrestore(err_act) if (err_act == psb_act_abort_) then call psb_error() return end if return contains subroutine d_csr_srch_upd(nz,ia,ja,val,a,& & imin,imax,jmin,jmax,info,gtl) use psb_const_mod use psb_realloc_mod use psb_string_mod use psb_sort_mod implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a integer, intent(in) :: nz, imin,imax,jmin,jmax integer, intent(in) :: ia(:),ja(:) real(psb_dpk_), intent(in) :: val(:) integer, intent(out) :: info integer, intent(in), optional :: gtl(:) integer :: i,ir,ic, ilr, ilc, ip, & & i1,i2,nr,nc,nnz,dupl,ng integer :: debug_level, debug_unit character(len=20) :: name='d_csr_srch_upd' info = 0 debug_unit = psb_get_debug_unit() debug_level = psb_get_debug_level() dupl = a%get_dupl() if (.not.a%is_sorted()) then info = -4 return end if ilr = -1 ilc = -1 nnz = a%get_nzeros() nr = a%get_nrows() nc = a%get_ncols() if (present(gtl)) then ng = size(gtl) select case(dupl) case(psb_dupl_ovwrt_,psb_dupl_err_) ! Overwrite. ! Cannot test for error, should have been caught earlier. ilr = -1 ilc = -1 do i=1, nz ir = ia(i) ic = ja(i) if ((ir >=1).and.(ir<=ng).and.(ic>=1).and.(ic<=ng)) then ir = gtl(ir) ic = gtl(ic) if ((ir > 0).and.(ir <= nr)) then i1 = a%irp(ir) i2 = a%irp(ir+1) nc=i2-i1 ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) if (ip>0) then a%val(i1+ip-1) = val(i) else if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Was searching ',ic,' in: ',i1,i2,& & ' : ',a%ja(i1:i2-1) info = i return end if else if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Discarding row that does not belong to us.' end if end if end do case(psb_dupl_add_) ! Add ilr = -1 ilc = -1 do i=1, nz ir = ia(i) ic = ja(i) if ((ir >=1).and.(ir<=ng).and.(ic>=1).and.(ic<=ng)) then ir = gtl(ir) ic = gtl(ic) if ((ir > 0).and.(ir <= nr)) then i1 = a%irp(ir) i2 = a%irp(ir+1) nc = i2-i1 ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) if (ip>0) then a%val(i1+ip-1) = a%val(i1+ip-1) + val(i) else if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Was searching ',ic,' in: ',i1,i2,& & ' : ',a%ja(i1:i2-1) info = i return end if else if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Discarding row that does not belong to us.' end if end if end do case default info = -3 if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Duplicate handling: ',dupl end select else select case(dupl) case(psb_dupl_ovwrt_,psb_dupl_err_) ! Overwrite. ! Cannot test for error, should have been caught earlier. ilr = -1 ilc = -1 do i=1, nz ir = ia(i) ic = ja(i) if ((ir > 0).and.(ir <= nr)) then i1 = a%irp(ir) i2 = a%irp(ir+1) nc=i2-i1 ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) if (ip>0) then a%val(i1+ip-1) = val(i) else if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Was searching ',ic,' in: ',i1,i2,& & ' : ',a%ja(i1:i2-1) info = i return end if else if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Discarding row that does not belong to us.' end if end do case(psb_dupl_add_) ! Add ilr = -1 ilc = -1 do i=1, nz ir = ia(i) ic = ja(i) if ((ir > 0).and.(ir <= nr)) then i1 = a%irp(ir) i2 = a%irp(ir+1) nc = i2-i1 ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) if (ip>0) then a%val(i1+ip-1) = a%val(i1+ip-1) + val(i) else info = i return end if else if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Discarding row that does not belong to us.' end if end do case default info = -3 if (debug_level >= psb_debug_serial_) & & write(debug_unit,*) trim(name),& & ': Duplicate handling: ',dupl end select end if end subroutine d_csr_srch_upd end subroutine d_csr_csput_impl subroutine d_cp_csr_from_coo_impl(a,b,info) use psb_const_mod use psb_realloc_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_cp_csr_from_coo_impl implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a class(psb_d_coo_sparse_mat), intent(in) :: b integer, intent(out) :: info type(psb_d_coo_sparse_mat) :: tmp integer, allocatable :: itemp(:) !locals logical :: rwshr_ Integer :: nza, nr, i,j,irw, idl,err_act, nc Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 ! This is to have fix_coo called behind the scenes call tmp%cp_from_coo(b,info) if (info ==0) call a%mv_from_coo(tmp,info) end subroutine d_cp_csr_from_coo_impl subroutine d_cp_csr_to_coo_impl(a,b,info) use psb_const_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_cp_csr_to_coo_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a class(psb_d_coo_sparse_mat), intent(out) :: b integer, intent(out) :: info integer, allocatable :: itemp(:) !locals logical :: rwshr_ Integer :: nza, nr, nc,i,j,irw, idl,err_act Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 nr = a%get_nrows() nc = a%get_ncols() nza = a%get_nzeros() call b%allocate(nr,nc,nza) call b%psb_d_base_sparse_mat%cp_from(a%psb_d_base_sparse_mat) do i=1, nr do j=a%irp(i),a%irp(i+1)-1 b%ia(j) = i b%ja(j) = a%ja(j) b%val(j) = a%val(j) end do end do call b%set_nzeros(a%get_nzeros()) call b%fix(info) end subroutine d_cp_csr_to_coo_impl subroutine d_mv_csr_to_coo_impl(a,b,info) use psb_const_mod use psb_realloc_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_mv_csr_to_coo_impl implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a class(psb_d_coo_sparse_mat), intent(out) :: b integer, intent(out) :: info integer, allocatable :: itemp(:) !locals logical :: rwshr_ Integer :: nza, nr, nc,i,j,irw, idl,err_act Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 nr = a%get_nrows() nc = a%get_ncols() nza = a%get_nzeros() call b%psb_d_base_sparse_mat%mv_from(a%psb_d_base_sparse_mat) call b%set_nzeros(a%get_nzeros()) call move_alloc(a%ja,b%ja) call move_alloc(a%val,b%val) call psb_realloc(nza,b%ia,info) if (info /= 0) return do i=1, nr do j=a%irp(i),a%irp(i+1)-1 b%ia(j) = i end do end do call a%free() call b%fix(info) end subroutine d_mv_csr_to_coo_impl subroutine d_mv_csr_from_coo_impl(a,b,info) use psb_const_mod use psb_realloc_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_mv_csr_from_coo_impl implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a class(psb_d_coo_sparse_mat), intent(inout) :: b integer, intent(out) :: info integer, allocatable :: itemp(:) !locals logical :: rwshr_ Integer :: nza, nr, i,j,irw, idl,err_act, nc Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 call b%fix(info) if (info /= 0) return nr = b%get_nrows() nc = b%get_ncols() nza = b%get_nzeros() call a%psb_d_base_sparse_mat%mv_from(b%psb_d_base_sparse_mat) ! Dirty trick: call move_alloc to have the new data allocated just once. call move_alloc(b%ia,itemp) call move_alloc(b%ja,a%ja) call move_alloc(b%val,a%val) call psb_realloc(max(nr+1,nc+1),a%irp,info) call b%free() if (nza <= 0) then a%irp(:) = 1 else a%irp(1) = 1 if (nr < itemp(nza)) then write(debug_unit,*) trim(name),': RWSHR=.false. : ',& &nr,itemp(nza),' Expect trouble!' info = 12 end if j = 1 i = 1 irw = itemp(j) outer: do inner: do if (i >= irw) exit inner if (i>nr) then write(debug_unit,*) trim(name),& & 'Strange situation: i>nr ',i,nr,j,nza,irw,idl exit outer end if a%irp(i+1) = a%irp(i) i = i + 1 end do inner j = j + 1 if (j > nza) exit if (itemp(j) /= irw) then a%irp(i+1) = j irw = itemp(j) i = i + 1 endif if (i>nr) exit enddo outer ! ! Cleanup empty rows at the end ! if (j /= (nza+1)) then write(debug_unit,*) trim(name),': Problem from loop :',j,nza info = 13 endif do if (i>nr) exit a%irp(i+1) = j i = i + 1 end do endif end subroutine d_mv_csr_from_coo_impl subroutine d_mv_csr_to_fmt_impl(a,b,info) use psb_const_mod use psb_realloc_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_mv_csr_to_fmt_impl implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a class(psb_d_base_sparse_mat), intent(out) :: b integer, intent(out) :: info !locals type(psb_d_coo_sparse_mat) :: tmp logical :: rwshr_ Integer :: nza, nr, i,j,irw, idl,err_act, nc Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 select type (b) type is (psb_d_coo_sparse_mat) call a%mv_to_coo(b,info) ! Need to fix trivial copies! type is (psb_d_csr_sparse_mat) call b%psb_d_base_sparse_mat%mv_from(a%psb_d_base_sparse_mat) call move_alloc(a%irp, b%irp) call move_alloc(a%ja, b%ja) call move_alloc(a%val, b%val) call a%free() class default call tmp%mv_from_fmt(a,info) if (info == 0) call b%mv_from_coo(tmp,info) end select end subroutine d_mv_csr_to_fmt_impl subroutine d_cp_csr_to_fmt_impl(a,b,info) use psb_const_mod use psb_realloc_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_cp_csr_to_fmt_impl implicit none class(psb_d_csr_sparse_mat), intent(in) :: a class(psb_d_base_sparse_mat), intent(out) :: b integer, intent(out) :: info !locals type(psb_d_coo_sparse_mat) :: tmp logical :: rwshr_ Integer :: nza, nr, i,j,irw, idl,err_act, nc Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 select type (b) type is (psb_d_coo_sparse_mat) call a%cp_to_coo(b,info) type is (psb_d_csr_sparse_mat) b = a class default call tmp%cp_from_fmt(a,info) if (info == 0) call b%mv_from_coo(tmp,info) end select end subroutine d_cp_csr_to_fmt_impl subroutine d_mv_csr_from_fmt_impl(a,b,info) use psb_const_mod use psb_realloc_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_mv_csr_from_fmt_impl implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a class(psb_d_base_sparse_mat), intent(inout) :: b integer, intent(out) :: info !locals type(psb_d_coo_sparse_mat) :: tmp logical :: rwshr_ Integer :: nza, nr, i,j,irw, idl,err_act, nc Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 select type (b) type is (psb_d_coo_sparse_mat) call a%mv_from_coo(b,info) type is (psb_d_csr_sparse_mat) call a%psb_d_base_sparse_mat%mv_from(b%psb_d_base_sparse_mat) call move_alloc(b%irp, a%irp) call move_alloc(b%ja, a%ja) call move_alloc(b%val, a%val) call b%free() class default call tmp%mv_from_fmt(b,info) if (info == 0) call a%mv_from_coo(tmp,info) end select end subroutine d_mv_csr_from_fmt_impl subroutine d_cp_csr_from_fmt_impl(a,b,info) use psb_const_mod use psb_realloc_mod use psb_d_base_mat_mod use psb_d_csr_mat_mod, psb_protect_name => d_cp_csr_from_fmt_impl implicit none class(psb_d_csr_sparse_mat), intent(inout) :: a class(psb_d_base_sparse_mat), intent(in) :: b integer, intent(out) :: info !locals type(psb_d_coo_sparse_mat) :: tmp logical :: rwshr_ Integer :: nz, nr, i,j,irw, idl,err_act, nc Integer, Parameter :: maxtry=8 integer :: debug_level, debug_unit character(len=20) :: name info = 0 select type (b) type is (psb_d_coo_sparse_mat) call a%cp_from_coo(b,info) type is (psb_d_csr_sparse_mat) call a%psb_d_base_sparse_mat%cp_from(b%psb_d_base_sparse_mat) a%irp = b%irp a%ja = b%ja a%val = b%val class default call tmp%cp_from_fmt(b,info) if (info == 0) call a%mv_from_coo(tmp,info) end select end subroutine d_cp_csr_from_fmt_impl