You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2982 lines
71 KiB
Fortran
2982 lines
71 KiB
Fortran
!!$
|
|
!!$ Parallel Sparse BLAS version 3.1
|
|
!!$ (C) Copyright 2006, 2007, 2008, 2009, 2010, 2012, 2013
|
|
!!$ Salvatore Filippone University of Rome Tor Vergata
|
|
!!$ Alfredo Buttari CNRS-IRIT, Toulouse
|
|
!!$
|
|
!!$ Redistribution and use in source and binary forms, with or without
|
|
!!$ modification, are permitted provided that the following conditions
|
|
!!$ are met:
|
|
!!$ 1. Redistributions of source code must retain the above copyright
|
|
!!$ notice, this list of conditions and the following disclaimer.
|
|
!!$ 2. Redistributions in binary form must reproduce the above copyright
|
|
!!$ notice, this list of conditions, and the following disclaimer in the
|
|
!!$ documentation and/or other materials provided with the distribution.
|
|
!!$ 3. The name of the PSBLAS group or the names of its contributors may
|
|
!!$ not be used to endorse or promote products derived from this
|
|
!!$ software without specific written permission.
|
|
!!$
|
|
!!$ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
!!$ ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
!!$ TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
!!$ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS
|
|
!!$ BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
!!$ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
!!$ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
!!$ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
!!$ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
!!$ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
!!$ POSSIBILITY OF SUCH DAMAGE.
|
|
!!$
|
|
!!$
|
|
|
|
! == ===================================
|
|
!
|
|
!
|
|
!
|
|
! Computational routines
|
|
!
|
|
!
|
|
!
|
|
!
|
|
!
|
|
!
|
|
! == ===================================
|
|
|
|
subroutine psb_s_csc_csmv(alpha,a,x,beta,y,info,trans)
|
|
use psb_error_mod
|
|
use psb_string_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csmv
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(in) :: alpha, beta, x(:)
|
|
real(psb_spk_), intent(inout) :: y(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
character, optional, intent(in) :: trans
|
|
|
|
character :: trans_
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc
|
|
real(psb_spk_) :: acc
|
|
logical :: tra
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_csmv'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
|
|
if (present(trans)) then
|
|
trans_ = trans
|
|
else
|
|
trans_ = 'N'
|
|
end if
|
|
|
|
if (.not.a%is_asb()) then
|
|
info = psb_err_invalid_mat_state_
|
|
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
|
|
|
|
|
|
if (size(x,1)<n) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 3; ierr(2) = n;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (size(y,1)<m) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 5; ierr(2) = m;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
if (alpha == szero) then
|
|
if (beta == szero) then
|
|
do i = 1, m
|
|
y(i) = szero
|
|
enddo
|
|
else
|
|
do i = 1, m
|
|
y(i) = beta*y(i)
|
|
end do
|
|
endif
|
|
return
|
|
end if
|
|
|
|
if (tra) then
|
|
|
|
if (beta == szero) then
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = -acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
|
|
else if (beta == sone) then
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = y(i) + acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = y(i) -acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = y(i) + alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
else if (beta == -sone) then
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = -y(i) + acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = -y(i) -acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = -y(i) + alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
else
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = beta*y(i) + acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = beta*y(i) - acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j))
|
|
enddo
|
|
y(i) = beta*y(i) + alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
end if
|
|
|
|
else if (.not.tra) then
|
|
|
|
if (beta == szero) then
|
|
do i=1, m
|
|
y(i) = szero
|
|
end do
|
|
else if (beta == sone) then
|
|
! Do nothing
|
|
else if (beta == -sone) 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 == sone) then
|
|
|
|
do i=1,n
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
ir = a%ia(j)
|
|
y(ir) = y(ir) + a%val(j)*x(i)
|
|
end do
|
|
enddo
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,n
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
ir = a%ia(j)
|
|
y(ir) = y(ir) - a%val(j)*x(i)
|
|
end do
|
|
enddo
|
|
|
|
else
|
|
|
|
do i=1,n
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
ir = a%ia(j)
|
|
y(ir) = y(ir) + alpha*a%val(j)*x(i)
|
|
end do
|
|
enddo
|
|
|
|
end if
|
|
|
|
endif
|
|
|
|
if (a%is_unit()) then
|
|
do i=1, min(m,n)
|
|
y(i) = y(i) + alpha*x(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
|
|
|
|
end subroutine psb_s_csc_csmv
|
|
|
|
subroutine psb_s_csc_csmm(alpha,a,x,beta,y,info,trans)
|
|
use psb_error_mod
|
|
use psb_string_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csmm
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(in) :: alpha, beta, x(:,:)
|
|
real(psb_spk_), intent(inout) :: y(:,:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
character, optional, intent(in) :: trans
|
|
|
|
character :: trans_
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc
|
|
real(psb_spk_), allocatable :: acc(:)
|
|
logical :: tra
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_csmm'
|
|
logical, parameter :: debug=.false.
|
|
|
|
info = psb_success_
|
|
call psb_erractionsave(err_act)
|
|
|
|
if (present(trans)) then
|
|
trans_ = trans
|
|
else
|
|
trans_ = 'N'
|
|
end if
|
|
|
|
tra = (psb_toupper(trans_) == 'T').or.(psb_toupper(trans_)=='C')
|
|
if (.not.a%is_asb()) then
|
|
info = psb_err_invalid_mat_state_
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
endif
|
|
|
|
if (tra) then
|
|
m = a%get_ncols()
|
|
n = a%get_nrows()
|
|
else
|
|
n = a%get_ncols()
|
|
m = a%get_nrows()
|
|
end if
|
|
|
|
if (size(x,1)<n) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 3; ierr(2) = n;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (size(y,1)<m) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 5; ierr(2) = m;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
nc = min(size(x,2) , size(y,2) )
|
|
|
|
allocate(acc(nc), stat=info)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
call psb_errpush(info,name,a_err='allocate')
|
|
goto 9999
|
|
end if
|
|
|
|
if (alpha == szero) then
|
|
if (beta == szero) then
|
|
do i = 1, m
|
|
y(i,:) = szero
|
|
enddo
|
|
else
|
|
do i = 1, m
|
|
y(i,:) = beta*y(i,:)
|
|
end do
|
|
endif
|
|
return
|
|
end if
|
|
|
|
if (tra) then
|
|
|
|
if (beta == szero) then
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = -acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
|
|
else if (beta == sone) then
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = y(i,:) + acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = y(i,:) -acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = y(i,:) + alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
else if (beta == -sone) then
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = -y(i,:) + acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = -y(i,:) -acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = -y(i,:) + alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
else
|
|
|
|
if (alpha == sone) then
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = beta*y(i,:) + acc
|
|
end do
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = beta*y(i,:) - acc
|
|
end do
|
|
|
|
else
|
|
|
|
do i=1,m
|
|
acc = szero
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
acc = acc + a%val(j) * x(a%ia(j),:)
|
|
enddo
|
|
y(i,:) = beta*y(i,:) + alpha*acc
|
|
end do
|
|
|
|
end if
|
|
|
|
end if
|
|
|
|
else if (.not.tra) then
|
|
|
|
if (beta == szero) then
|
|
do i=1, m
|
|
y(i,:) = szero
|
|
end do
|
|
else if (beta == sone) then
|
|
! Do nothing
|
|
else if (beta == -sone) 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 == sone) then
|
|
|
|
do i=1,n
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
ir = a%ia(j)
|
|
y(ir,:) = y(ir,:) + a%val(j)*x(i,:)
|
|
end do
|
|
enddo
|
|
|
|
else if (alpha == -sone) then
|
|
|
|
do i=1,n
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
ir = a%ia(j)
|
|
y(ir,:) = y(ir,:) - a%val(j)*x(i,:)
|
|
end do
|
|
enddo
|
|
|
|
else
|
|
|
|
do i=1,n
|
|
do j=a%icp(i), a%icp(i+1)-1
|
|
ir = a%ia(j)
|
|
y(ir,:) = y(ir,:) + alpha*a%val(j)*x(i,:)
|
|
end do
|
|
enddo
|
|
|
|
end if
|
|
|
|
endif
|
|
|
|
if (a%is_unit()) then
|
|
do i=1, min(m,n)
|
|
y(i,:) = y(i,:) + alpha*x(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
|
|
|
|
end subroutine psb_s_csc_csmm
|
|
|
|
|
|
subroutine psb_s_csc_cssv(alpha,a,x,beta,y,info,trans)
|
|
use psb_error_mod
|
|
use psb_string_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_cssv
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(in) :: alpha, beta, x(:)
|
|
real(psb_spk_), intent(inout) :: y(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
character, optional, intent(in) :: trans
|
|
|
|
character :: trans_
|
|
integer(psb_ipk_) :: i,j,k,m, nnz, ir, jc
|
|
real(psb_spk_) :: acc
|
|
real(psb_spk_), allocatable :: tmp(:)
|
|
logical :: tra
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_cssv'
|
|
logical, parameter :: debug=.false.
|
|
|
|
info = psb_success_
|
|
call psb_erractionsave(err_act)
|
|
if (present(trans)) then
|
|
trans_ = trans
|
|
else
|
|
trans_ = 'N'
|
|
end if
|
|
if (.not.a%is_asb()) then
|
|
info = psb_err_invalid_mat_state_
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
endif
|
|
|
|
tra = (psb_toupper(trans_) == 'T').or.(psb_toupper(trans_)=='C')
|
|
m = a%get_nrows()
|
|
|
|
if (.not. (a%is_triangle())) then
|
|
info = psb_err_invalid_mat_state_
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
if (size(x,1)<m) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 3; ierr(2) = m;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (size(y,1)<m) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 5; ierr(2) = m;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
|
|
if (alpha == szero) then
|
|
if (beta == szero) then
|
|
do i = 1, m
|
|
y(i) = szero
|
|
enddo
|
|
else
|
|
do i = 1, m
|
|
y(i) = beta*y(i)
|
|
end do
|
|
endif
|
|
return
|
|
end if
|
|
|
|
if (beta == szero) then
|
|
call inner_cscsv(tra,a%is_lower(),a%is_unit(),a%get_nrows(),&
|
|
& a%icp,a%ia,a%val,x,y)
|
|
if (alpha == sone) then
|
|
! do nothing
|
|
else if (alpha == -sone) 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 /= psb_success_) then
|
|
return
|
|
end if
|
|
tmp(1:m) = x(1:m)
|
|
call inner_cscsv(tra,a%is_lower(),a%is_unit(),a%get_nrows(),&
|
|
& a%icp,a%ia,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_cscsv(tra,lower,unit,n,icp,ia,val,x,y)
|
|
implicit none
|
|
logical, intent(in) :: tra,lower,unit
|
|
integer(psb_ipk_), intent(in) :: icp(*), ia(*),n
|
|
real(psb_spk_), intent(in) :: val(*)
|
|
real(psb_spk_), intent(in) :: x(*)
|
|
real(psb_spk_), intent(out) :: y(*)
|
|
|
|
integer(psb_ipk_) :: i,j,k,m, ir, jc
|
|
real(psb_spk_) :: acc
|
|
|
|
if (tra) then
|
|
|
|
if (lower) then
|
|
if (unit) then
|
|
do i=n, 1, -1
|
|
acc = szero
|
|
do j=icp(i), icp(i+1)-1
|
|
acc = acc + val(j)*y(ia(j))
|
|
end do
|
|
y(i) = x(i) - acc
|
|
end do
|
|
else if (.not.unit) then
|
|
do i=n, 1, -1
|
|
acc = szero
|
|
do j=icp(i)+1, icp(i+1)-1
|
|
acc = acc + val(j)*y(ia(j))
|
|
end do
|
|
y(i) = (x(i) - acc)/val(icp(i))
|
|
end do
|
|
end if
|
|
|
|
else if (.not.lower) then
|
|
|
|
if (unit) then
|
|
do i=1, n
|
|
acc = szero
|
|
do j=icp(i), icp(i+1)-1
|
|
acc = acc + val(j)*y(ia(j))
|
|
end do
|
|
y(i) = x(i) - acc
|
|
end do
|
|
else if (.not.unit) then
|
|
do i=1, n
|
|
acc = szero
|
|
do j=icp(i), icp(i+1)-2
|
|
acc = acc + val(j)*y(ia(j))
|
|
end do
|
|
y(i) = (x(i) - acc)/val(icp(i+1)-1)
|
|
end do
|
|
end if
|
|
|
|
end if
|
|
|
|
else if (.not.tra) then
|
|
|
|
do i=1, n
|
|
y(i) = x(i)
|
|
end do
|
|
|
|
if (lower) then
|
|
|
|
if (unit) then
|
|
do i=1, n
|
|
acc = y(i)
|
|
do j=icp(i), icp(i+1)-1
|
|
jc = ia(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(icp(i))
|
|
acc = y(i)
|
|
do j=icp(i)+1, icp(i+1)-1
|
|
jc = ia(j)
|
|
y(jc) = y(jc) - val(j)*acc
|
|
end do
|
|
end do
|
|
end if
|
|
|
|
else if (.not.lower) then
|
|
|
|
if (unit) then
|
|
do i=n, 1, -1
|
|
acc = y(i)
|
|
do j=icp(i), icp(i+1)-1
|
|
jc = ia(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(icp(i+1)-1)
|
|
acc = y(i)
|
|
do j=icp(i), icp(i+1)-2
|
|
jc = ia(j)
|
|
y(jc) = y(jc) - val(j)*acc
|
|
end do
|
|
end do
|
|
end if
|
|
|
|
end if
|
|
end if
|
|
end subroutine inner_cscsv
|
|
|
|
end subroutine psb_s_csc_cssv
|
|
|
|
|
|
|
|
subroutine psb_s_csc_cssm(alpha,a,x,beta,y,info,trans)
|
|
use psb_error_mod
|
|
use psb_string_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_cssm
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(in) :: alpha, beta, x(:,:)
|
|
real(psb_spk_), intent(inout) :: y(:,:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
character, optional, intent(in) :: trans
|
|
|
|
character :: trans_
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc
|
|
real(psb_spk_) :: acc
|
|
real(psb_spk_), allocatable :: tmp(:,:)
|
|
logical :: tra
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_base_csmm'
|
|
logical, parameter :: debug=.false.
|
|
|
|
info = psb_success_
|
|
call psb_erractionsave(err_act)
|
|
|
|
if (present(trans)) then
|
|
trans_ = trans
|
|
else
|
|
trans_ = 'N'
|
|
end if
|
|
if (.not.a%is_asb()) then
|
|
info = psb_err_invalid_mat_state_
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
endif
|
|
|
|
|
|
tra = (psb_toupper(trans_) == 'T').or.(psb_toupper(trans_)=='C')
|
|
m = a%get_nrows()
|
|
|
|
if (size(x,1)<m) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 3; ierr(2) = m;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (size(y,1)<m) then
|
|
info = psb_err_input_asize_small_i_
|
|
ierr(1) = 5; ierr(2) = m;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
nc = min(size(x,2) , size(y,2))
|
|
|
|
if (.not. (a%is_triangle())) then
|
|
info = psb_err_invalid_mat_state_
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
if (alpha == szero) then
|
|
if (beta == szero) then
|
|
do i = 1, m
|
|
y(i,:) = szero
|
|
enddo
|
|
else
|
|
do i = 1, m
|
|
y(i,:) = beta*y(i,:)
|
|
end do
|
|
endif
|
|
return
|
|
end if
|
|
|
|
if (beta == szero) then
|
|
call inner_cscsm(tra,a%is_lower(),a%is_unit(),a%get_nrows(),nc,&
|
|
& a%icp,a%ia,a%val,x,size(x,1,kind=psb_ipk_),y,size(y,1,kind=psb_ipk_),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 /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
call psb_errpush(info,name,a_err='allocate')
|
|
goto 9999
|
|
end if
|
|
|
|
tmp(1:m,:) = x(1:m,1:nc)
|
|
call inner_cscsm(tra,a%is_lower(),a%is_unit(),a%get_nrows(),nc,&
|
|
& a%icp,a%ia,a%val,tmp,size(tmp,1,kind=psb_ipk_),y,size(y,1,kind=psb_ipk_),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 /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
call psb_errpush(info,name,a_err='inner_cscsm')
|
|
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_cscsm(tra,lower,unit,nr,nc,&
|
|
& icp,ia,val,x,ldx,y,ldy,info)
|
|
implicit none
|
|
logical, intent(in) :: tra,lower,unit
|
|
integer(psb_ipk_), intent(in) :: nr,nc,ldx,ldy,icp(*),ia(*)
|
|
real(psb_spk_), intent(in) :: val(*), x(ldx,*)
|
|
real(psb_spk_), intent(out) :: y(ldy,*)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
integer(psb_ipk_) :: i,j,k,m, ir, jc
|
|
real(psb_spk_), allocatable :: acc(:)
|
|
|
|
info = psb_success_
|
|
allocate(acc(nc), stat=info)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
return
|
|
end if
|
|
|
|
|
|
if (tra) then
|
|
|
|
if (lower) then
|
|
if (unit) then
|
|
do i=nr, 1, -1
|
|
acc = szero
|
|
do j=icp(i), icp(i+1)-1
|
|
acc = acc + val(j)*y(ia(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 = szero
|
|
do j=icp(i)+1, icp(i+1)-1
|
|
acc = acc + val(j)*y(ia(j),1:nc)
|
|
end do
|
|
y(i,1:nc) = (x(i,1:nc) - acc)/val(icp(i))
|
|
end do
|
|
end if
|
|
|
|
else if (.not.lower) then
|
|
|
|
if (unit) then
|
|
do i=1, nr
|
|
acc = szero
|
|
do j=icp(i), icp(i+1)-1
|
|
acc = acc + val(j)*y(ia(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 = szero
|
|
do j=icp(i), icp(i+1)-2
|
|
acc = acc + val(j)*y(ia(j),1:nc)
|
|
end do
|
|
y(i,1:nc) = (x(i,1:nc) - acc)/val(icp(i+1)-1)
|
|
end do
|
|
end if
|
|
|
|
end if
|
|
|
|
else if (.not.tra) then
|
|
|
|
do i=1, nr
|
|
y(i,1:nc) = x(i,1:nc)
|
|
end do
|
|
|
|
if (lower) then
|
|
|
|
if (unit) then
|
|
do i=1, nr
|
|
acc = y(i,1:nc)
|
|
do j=icp(i), icp(i+1)-1
|
|
jc = ia(j)
|
|
y(jc,1:nc) = y(jc,1:nc) - val(j)*acc
|
|
end do
|
|
end do
|
|
else if (.not.unit) then
|
|
do i=1, nr
|
|
y(i,1:nc) = y(i,1:nc)/val(icp(i))
|
|
acc = y(i,1:nc)
|
|
do j=icp(i)+1, icp(i+1)-1
|
|
jc = ia(j)
|
|
y(jc,1:nc) = y(jc,1:nc) - val(j)*acc
|
|
end do
|
|
end do
|
|
end if
|
|
|
|
else if (.not.lower) then
|
|
|
|
if (unit) then
|
|
do i=nr, 1, -1
|
|
acc = y(i,1:nc)
|
|
do j=icp(i), icp(i+1)-1
|
|
jc = ia(j)
|
|
y(jc,1:nc) = y(jc,1:nc) - 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)/val(icp(i+1)-1)
|
|
acc = y(i,1:nc)
|
|
do j=icp(i), icp(i+1)-2
|
|
jc = ia(j)
|
|
y(jc,1:nc) = y(jc,1:nc) - val(j)*acc
|
|
end do
|
|
end do
|
|
end if
|
|
|
|
end if
|
|
end if
|
|
end subroutine inner_cscsm
|
|
|
|
end subroutine psb_s_csc_cssm
|
|
|
|
function psb_s_csc_maxval(a) result(res)
|
|
use psb_error_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_maxval
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_) :: res
|
|
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc, info
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_maxval'
|
|
logical, parameter :: debug=.false.
|
|
|
|
|
|
if (a%is_unit()) then
|
|
res = sone
|
|
else
|
|
res = szero
|
|
end if
|
|
|
|
nnz = a%get_nzeros()
|
|
if (allocated(a%val)) then
|
|
nnz = min(nnz,size(a%val))
|
|
res = maxval(abs(a%val(1:nnz)))
|
|
end if
|
|
end function psb_s_csc_maxval
|
|
|
|
function psb_s_csc_csnmi(a) result(res)
|
|
use psb_error_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csnmi
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_) :: res
|
|
|
|
integer(psb_ipk_) :: i,j,k,m,n, nr, ir, jc, nc, info
|
|
real(psb_spk_), allocatable :: acc(:)
|
|
logical :: tra
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csnmi'
|
|
logical, parameter :: debug=.false.
|
|
|
|
|
|
res = szero
|
|
nr = a%get_nrows()
|
|
nc = a%get_ncols()
|
|
allocate(acc(nr),stat=info)
|
|
if (info /= psb_success_) then
|
|
return
|
|
end if
|
|
if (a%is_unit()) then
|
|
acc = sone
|
|
else
|
|
acc = szero
|
|
end if
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
acc(a%ia(j)) = acc(a%ia(j)) + abs(a%val(j))
|
|
end do
|
|
end do
|
|
do i=1, nr
|
|
res = max(res,acc(i))
|
|
end do
|
|
deallocate(acc)
|
|
|
|
end function psb_s_csc_csnmi
|
|
|
|
|
|
function psb_s_csc_csnm1(a) result(res)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csnm1
|
|
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_) :: res
|
|
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc, info
|
|
real(psb_spk_) :: acc
|
|
real(psb_spk_), allocatable :: vt(:)
|
|
logical :: tra, is_unit
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_csnm1'
|
|
logical, parameter :: debug=.false.
|
|
|
|
|
|
res = szero
|
|
m = a%get_nrows()
|
|
n = a%get_ncols()
|
|
is_unit = a%is_unit()
|
|
do j=1, n
|
|
if (is_unit) then
|
|
acc = sone
|
|
else
|
|
acc = szero
|
|
end if
|
|
do k=a%icp(j),a%icp(j+1)-1
|
|
acc = acc + abs(a%val(k))
|
|
end do
|
|
res = max(res,acc)
|
|
end do
|
|
|
|
return
|
|
|
|
end function psb_s_csc_csnm1
|
|
|
|
subroutine psb_s_csc_colsum(d,a)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_colsum
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(out) :: d(:)
|
|
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc
|
|
real(psb_spk_) :: acc
|
|
real(psb_spk_), allocatable :: vt(:)
|
|
logical :: tra, is_unit
|
|
integer(psb_ipk_) :: err_act, info
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='colsum'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
|
|
m = a%get_ncols()
|
|
if (size(d) < m) then
|
|
info=psb_err_input_asize_small_i_
|
|
ierr(1) = 1; ierr(2) = size(d); ierr(3) = m
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
is_unit = a%is_unit()
|
|
do i = 1, a%get_ncols()
|
|
if (is_unit) then
|
|
d(i) = sone
|
|
else
|
|
d(i) = szero
|
|
end if
|
|
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
d(i) = d(i) + (a%val(j))
|
|
end do
|
|
end do
|
|
|
|
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
|
|
|
|
end subroutine psb_s_csc_colsum
|
|
|
|
subroutine psb_s_csc_aclsum(d,a)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_aclsum
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(out) :: d(:)
|
|
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc
|
|
real(psb_spk_) :: acc
|
|
real(psb_spk_), allocatable :: vt(:)
|
|
logical :: tra, is_unit
|
|
integer(psb_ipk_) :: err_act, info
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='colsum'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
|
|
m = a%get_ncols()
|
|
if (size(d) < m) then
|
|
info=psb_err_input_asize_small_i_
|
|
ierr(1) = 1; ierr(2) = size(d); ierr(3) = m
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
is_unit = a%is_unit()
|
|
do i = 1, a%get_ncols()
|
|
if (is_unit) then
|
|
d(i) = sone
|
|
else
|
|
d(i) = szero
|
|
end if
|
|
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
d(i) = d(i) + abs(a%val(j))
|
|
end do
|
|
end do
|
|
|
|
if (a%is_unit()) then
|
|
do i=1, a%get_ncols()
|
|
d(i) = d(i) + sone
|
|
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
|
|
|
|
end subroutine psb_s_csc_aclsum
|
|
|
|
subroutine psb_s_csc_rowsum(d,a)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_rowsum
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(out) :: d(:)
|
|
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc
|
|
real(psb_spk_) :: acc
|
|
real(psb_spk_), allocatable :: vt(:)
|
|
logical :: tra
|
|
integer(psb_ipk_) :: err_act, info
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='rowsum'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
|
|
m = a%get_ncols()
|
|
n = a%get_nrows()
|
|
if (size(d) < n) then
|
|
info=psb_err_input_asize_small_i_
|
|
ierr(1) = 1; ierr(2) = size(d); ierr(3) = n
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (a%is_unit()) then
|
|
d = sone
|
|
else
|
|
d = szero
|
|
end if
|
|
|
|
do i=1, m
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
k = a%ia(j)
|
|
d(k) = d(k) + (a%val(k))
|
|
end do
|
|
end do
|
|
|
|
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
|
|
|
|
end subroutine psb_s_csc_rowsum
|
|
|
|
subroutine psb_s_csc_arwsum(d,a)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_arwsum
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(out) :: d(:)
|
|
|
|
integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc
|
|
real(psb_spk_) :: acc
|
|
real(psb_spk_), allocatable :: vt(:)
|
|
logical :: tra
|
|
integer(psb_ipk_) :: err_act, info
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='arwsum'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
|
|
m = a%get_ncols()
|
|
n = a%get_nrows()
|
|
if (size(d) < n) then
|
|
info=psb_err_input_asize_small_i_
|
|
ierr(1) = 1; ierr(2) = size(d); ierr(3) = n
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (a%is_unit()) then
|
|
d = sone
|
|
else
|
|
d = szero
|
|
end if
|
|
|
|
do i=1, m
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
k = a%ia(j)
|
|
d(k) = d(k) + abs(a%val(k))
|
|
end do
|
|
end do
|
|
|
|
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
|
|
|
|
end subroutine psb_s_csc_arwsum
|
|
|
|
|
|
subroutine psb_s_csc_get_diag(a,d,info)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_get_diag
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
real(psb_spk_), intent(out) :: d(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
integer(psb_ipk_) :: err_act, mnm, i, j, k
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='get_diag'
|
|
logical, parameter :: debug=.false.
|
|
|
|
info = psb_success_
|
|
call psb_erractionsave(err_act)
|
|
|
|
mnm = min(a%get_nrows(),a%get_ncols())
|
|
if (size(d) < mnm) then
|
|
info=psb_err_input_asize_invalid_i_
|
|
ierr(1) = 2; ierr(2) = size(d);
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
if (a%is_unit()) then
|
|
d(1:mnm) = sone
|
|
else
|
|
do i=1, mnm
|
|
d(i) = szero
|
|
do k=a%icp(i),a%icp(i+1)-1
|
|
j=a%ia(k)
|
|
if ((j == i) .and.(j <= mnm )) then
|
|
d(i) = a%val(k)
|
|
endif
|
|
enddo
|
|
end do
|
|
endif
|
|
do i=mnm+1,size(d)
|
|
d(i) = szero
|
|
end do
|
|
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
|
|
|
|
end subroutine psb_s_csc_get_diag
|
|
|
|
|
|
subroutine psb_s_csc_scal(d,a,info,side)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_scal
|
|
use psb_string_mod
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
real(psb_spk_), intent(in) :: d(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
character, intent(in), optional :: side
|
|
|
|
integer(psb_ipk_) :: err_act,mnm, i, j, n
|
|
type(psb_s_coo_sparse_mat) :: tmp
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='scal'
|
|
character :: side_
|
|
logical :: left
|
|
logical, parameter :: debug=.false.
|
|
|
|
info = psb_success_
|
|
call psb_erractionsave(err_act)
|
|
|
|
side_ = 'L'
|
|
if (present(side)) then
|
|
side_ = psb_toupper(side)
|
|
end if
|
|
|
|
if (a%is_unit()) then
|
|
call a%make_nonunit()
|
|
end if
|
|
|
|
left = (side_ == 'L')
|
|
|
|
if (left) then
|
|
n = a%get_ncols()
|
|
if (size(d) < n) then
|
|
info=psb_err_input_asize_invalid_i_
|
|
ierr(1) = 2; ierr(2) = size(d);
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
do i=1, a%get_nzeros()
|
|
a%val(i) = a%val(i) * d(a%ia(i))
|
|
enddo
|
|
else
|
|
n = a%get_nrows()
|
|
if (size(d) < n) then
|
|
info=psb_err_input_asize_invalid_i_
|
|
ierr(1) = 2; ierr(2) = size(d);
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
do j=1, n
|
|
do i = a%icp(j), a%icp(j+1) -1
|
|
a%val(i) = a%val(i) * d(j)
|
|
end do
|
|
enddo
|
|
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
|
|
|
|
end subroutine psb_s_csc_scal
|
|
|
|
|
|
subroutine psb_s_csc_scals(d,a,info)
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_scals
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
real(psb_spk_), intent(in) :: d
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
integer(psb_ipk_) :: err_act,mnm, i, j, m
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='scal'
|
|
logical, parameter :: debug=.false.
|
|
|
|
info = psb_success_
|
|
call psb_erractionsave(err_act)
|
|
|
|
if (a%is_unit()) then
|
|
call a%make_nonunit()
|
|
end if
|
|
|
|
do i=1,a%get_nzeros()
|
|
a%val(i) = a%val(i) * d
|
|
enddo
|
|
|
|
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
|
|
|
|
end subroutine psb_s_csc_scals
|
|
|
|
|
|
! == ===================================
|
|
!
|
|
!
|
|
!
|
|
! Data management
|
|
!
|
|
!
|
|
!
|
|
!
|
|
!
|
|
! == ===================================
|
|
|
|
subroutine psb_s_csc_csgetptn(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_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csgetptn
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
integer(psb_ipk_), intent(in) :: imin,imax
|
|
integer(psb_ipk_), intent(out) :: nz
|
|
integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:)
|
|
integer(psb_ipk_),intent(out) :: info
|
|
logical, intent(in), optional :: append
|
|
integer(psb_ipk_), intent(in), optional :: iren(:)
|
|
integer(psb_ipk_), intent(in), optional :: jmin,jmax, nzin
|
|
logical, intent(in), optional :: rscale,cscale
|
|
|
|
logical :: append_, rscale_, cscale_
|
|
integer(psb_ipk_) :: nzin_, jmin_, jmax_, err_act, i
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='csget'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
|
|
if (present(jmin)) then
|
|
jmin_ = jmin
|
|
else
|
|
jmin_ = 1
|
|
endif
|
|
if (present(jmax)) then
|
|
jmax_ = jmax
|
|
else
|
|
jmax_ = a%get_ncols()
|
|
endif
|
|
|
|
if ((imax<imin).or.(jmax_<jmin_)) return
|
|
|
|
if (present(append)) then
|
|
append_=append
|
|
else
|
|
append_=.false.
|
|
endif
|
|
if ((append_).and.(present(nzin))) then
|
|
nzin_ = nzin
|
|
else
|
|
nzin_ = 0
|
|
endif
|
|
if (present(rscale)) then
|
|
rscale_ = rscale
|
|
else
|
|
rscale_ = .false.
|
|
endif
|
|
if (present(cscale)) then
|
|
cscale_ = cscale
|
|
else
|
|
cscale_ = .false.
|
|
endif
|
|
if ((rscale_.or.cscale_).and.(present(iren))) then
|
|
info = psb_err_many_optional_arg_
|
|
call psb_errpush(info,name,a_err='iren (rscale.or.cscale)')
|
|
goto 9999
|
|
end if
|
|
|
|
call csc_getptn(imin,imax,jmin_,jmax_,a,nz,ia,ja,nzin_,append_,info,iren)
|
|
|
|
if (rscale_) then
|
|
do i=nzin_+1, nzin_+nz
|
|
ia(i) = ia(i) - imin + 1
|
|
end do
|
|
end if
|
|
if (cscale_) then
|
|
do i=nzin_+1, nzin_+nz
|
|
ja(i) = ja(i) - jmin_ + 1
|
|
end do
|
|
end if
|
|
|
|
if (info /= psb_success_) goto 9999
|
|
|
|
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 csc_getptn(imin,imax,jmin,jmax,a,nz,ia,ja,nzin,append,info,&
|
|
& iren)
|
|
|
|
use psb_const_mod
|
|
use psb_error_mod
|
|
use psb_realloc_mod
|
|
use psb_sort_mod
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
integer(psb_ipk_) :: imin,imax,jmin,jmax
|
|
integer(psb_ipk_), intent(out) :: nz
|
|
integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:)
|
|
integer(psb_ipk_), intent(in) :: nzin
|
|
logical, intent(in) :: append
|
|
integer(psb_ipk_) :: info
|
|
integer(psb_ipk_), optional :: iren(:)
|
|
integer(psb_ipk_) :: nzin_, nza, idx,i,j,k, nzt, irw, lrw, icl, lcl,m,isz
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name='coo_getrow'
|
|
|
|
debug_unit = psb_get_debug_unit()
|
|
debug_level = psb_get_debug_level()
|
|
|
|
nza = a%get_nzeros()
|
|
irw = imin
|
|
lrw = min(imax,a%get_nrows())
|
|
icl = jmin
|
|
lcl = min(jmax,a%get_ncols())
|
|
if (irw<0) then
|
|
info = psb_err_pivot_too_small_
|
|
return
|
|
end if
|
|
|
|
if (append) then
|
|
nzin_ = nzin
|
|
else
|
|
nzin_ = 0
|
|
endif
|
|
|
|
|
|
nzt = min((a%icp(lcl+1)-a%icp(icl)),&
|
|
& ((nza*(lcl+1-icl))/a%get_ncols()) )
|
|
nz = 0
|
|
|
|
|
|
call psb_ensure_size(nzin_+nzt,ia,info)
|
|
if (info == psb_success_) call psb_ensure_size(nzin_+nzt,ja,info)
|
|
|
|
if (info /= psb_success_) return
|
|
isz = min(size(ia),size(ja))
|
|
if (present(iren)) then
|
|
do i=icl, lcl
|
|
do j=a%icp(i), a%icp(i+1) - 1
|
|
if ((imin <= a%ia(j)).and.(a%ia(j)<=imax)) then
|
|
nzin_ = nzin_ + 1
|
|
if (nzin_>isz) then
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ia,info)
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ja,info)
|
|
isz = min(size(ia),size(ja))
|
|
end if
|
|
nz = nz + 1
|
|
ia(nzin_) = iren(a%ia(j))
|
|
ja(nzin_) = iren(i)
|
|
end if
|
|
enddo
|
|
end do
|
|
else
|
|
do i=icl, lcl
|
|
do j=a%icp(i), a%icp(i+1) - 1
|
|
if ((imin <= a%ia(j)).and.(a%ia(j)<=imax)) then
|
|
nzin_ = nzin_ + 1
|
|
if (nzin_>isz) then
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ia,info)
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ja,info)
|
|
isz = min(size(ia),size(ja))
|
|
end if
|
|
nz = nz + 1
|
|
ia(nzin_) = (a%ia(j))
|
|
ja(nzin_) = (i)
|
|
end if
|
|
enddo
|
|
end do
|
|
end if
|
|
|
|
end subroutine csc_getptn
|
|
|
|
end subroutine psb_s_csc_csgetptn
|
|
|
|
|
|
|
|
|
|
subroutine psb_s_csc_csgetrow(imin,imax,a,nz,ia,ja,val,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_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csgetrow
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
integer(psb_ipk_), intent(in) :: imin,imax
|
|
integer(psb_ipk_), intent(out) :: nz
|
|
integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:)
|
|
real(psb_spk_), allocatable, intent(inout) :: val(:)
|
|
integer(psb_ipk_),intent(out) :: info
|
|
logical, intent(in), optional :: append
|
|
integer(psb_ipk_), intent(in), optional :: iren(:)
|
|
integer(psb_ipk_), intent(in), optional :: jmin,jmax, nzin
|
|
logical, intent(in), optional :: rscale,cscale
|
|
|
|
logical :: append_, rscale_, cscale_
|
|
integer(psb_ipk_) :: nzin_, jmin_, jmax_, err_act, i
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='csget'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
|
|
if (present(jmin)) then
|
|
jmin_ = jmin
|
|
else
|
|
jmin_ = 1
|
|
endif
|
|
if (present(jmax)) then
|
|
jmax_ = jmax
|
|
else
|
|
jmax_ = a%get_ncols()
|
|
endif
|
|
|
|
if ((imax<imin).or.(jmax_<jmin_)) return
|
|
|
|
if (present(append)) then
|
|
append_=append
|
|
else
|
|
append_=.false.
|
|
endif
|
|
if ((append_).and.(present(nzin))) then
|
|
nzin_ = nzin
|
|
else
|
|
nzin_ = 0
|
|
endif
|
|
if (present(rscale)) then
|
|
rscale_ = rscale
|
|
else
|
|
rscale_ = .false.
|
|
endif
|
|
if (present(cscale)) then
|
|
cscale_ = cscale
|
|
else
|
|
cscale_ = .false.
|
|
endif
|
|
if ((rscale_.or.cscale_).and.(present(iren))) then
|
|
info = psb_err_many_optional_arg_
|
|
call psb_errpush(info,name,a_err='iren (rscale.or.cscale)')
|
|
goto 9999
|
|
end if
|
|
|
|
call csc_getrow(imin,imax,jmin_,jmax_,a,nz,ia,ja,val,nzin_,append_,info,&
|
|
& iren)
|
|
|
|
if (rscale_) then
|
|
do i=nzin_+1, nzin_+nz
|
|
ia(i) = ia(i) - imin + 1
|
|
end do
|
|
end if
|
|
if (cscale_) then
|
|
do i=nzin_+1, nzin_+nz
|
|
ja(i) = ja(i) - jmin_ + 1
|
|
end do
|
|
end if
|
|
|
|
if (info /= psb_success_) goto 9999
|
|
|
|
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 csc_getrow(imin,imax,jmin,jmax,a,nz,ia,ja,val,nzin,append,info,&
|
|
& iren)
|
|
|
|
use psb_const_mod
|
|
use psb_error_mod
|
|
use psb_realloc_mod
|
|
use psb_sort_mod
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
integer(psb_ipk_) :: imin,imax,jmin,jmax
|
|
integer(psb_ipk_), intent(out) :: nz
|
|
integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:)
|
|
real(psb_spk_), allocatable, intent(inout) :: val(:)
|
|
integer(psb_ipk_), intent(in) :: nzin
|
|
logical, intent(in) :: append
|
|
integer(psb_ipk_) :: info
|
|
integer(psb_ipk_), optional :: iren(:)
|
|
integer(psb_ipk_) :: nzin_, nza, idx,i,j,k, nzt, irw, lrw, icl, lcl,isz,m
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name='coo_getrow'
|
|
|
|
debug_unit = psb_get_debug_unit()
|
|
debug_level = psb_get_debug_level()
|
|
|
|
m = a%get_nrows()
|
|
nza = a%get_nzeros()
|
|
irw = imin
|
|
lrw = min(imax,a%get_nrows())
|
|
icl = jmin
|
|
lcl = min(jmax,a%get_ncols())
|
|
if (irw<0) then
|
|
info = psb_err_pivot_too_small_
|
|
return
|
|
end if
|
|
|
|
if (append) then
|
|
nzin_ = nzin
|
|
else
|
|
nzin_ = 0
|
|
endif
|
|
|
|
nzt = min((a%icp(lcl+1)-a%icp(icl)),&
|
|
& ((nza*(lrw+1-irw))/m) )
|
|
nz = 0
|
|
|
|
|
|
call psb_ensure_size(nzin_+nzt,ia,info)
|
|
if (info == psb_success_) call psb_ensure_size(nzin_+nzt,ja,info)
|
|
if (info == psb_success_) call psb_ensure_size(nzin_+nzt,val,info)
|
|
|
|
if (info /= psb_success_) return
|
|
isz = min(size(ia),size(ja),size(val))
|
|
if (present(iren)) then
|
|
do i=icl, lcl
|
|
do j=a%icp(i), a%icp(i+1) - 1
|
|
if ((imin <= a%ia(j)).and.(a%ia(j)<=imax)) then
|
|
nzin_ = nzin_ + 1
|
|
if (nzin_>isz) then
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ia,info)
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ja,info)
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,val,info)
|
|
isz = min(size(ia),size(ja),size(val))
|
|
end if
|
|
nz = nz + 1
|
|
val(nzin_) = a%val(j)
|
|
ia(nzin_) = iren(a%ia(j))
|
|
ja(nzin_) = iren(i)
|
|
end if
|
|
enddo
|
|
end do
|
|
else
|
|
do i=icl, lcl
|
|
do j=a%icp(i), a%icp(i+1) - 1
|
|
if ((imin <= a%ia(j)).and.(a%ia(j)<=imax)) then
|
|
nzin_ = nzin_ + 1
|
|
if (nzin_>isz) then
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ia,info)
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,ja,info)
|
|
call psb_ensure_size(int(1.25*nzin_)+ione,val,info)
|
|
isz = min(size(ia),size(ja),size(val))
|
|
end if
|
|
nz = nz + 1
|
|
val(nzin_) = a%val(j)
|
|
ia(nzin_) = (a%ia(j))
|
|
ja(nzin_) = (i)
|
|
end if
|
|
enddo
|
|
end do
|
|
end if
|
|
end subroutine csc_getrow
|
|
|
|
end subroutine psb_s_csc_csgetrow
|
|
|
|
|
|
|
|
subroutine psb_s_csc_csput(nz,ia,ja,val,a,imin,imax,jmin,jmax,info,gtl)
|
|
use psb_error_mod
|
|
use psb_realloc_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csput
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
real(psb_spk_), intent(in) :: val(:)
|
|
integer(psb_ipk_), intent(in) :: nz, ia(:), ja(:), imin,imax,jmin,jmax
|
|
integer(psb_ipk_), intent(out) :: info
|
|
integer(psb_ipk_), intent(in), optional :: gtl(:)
|
|
|
|
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_csput'
|
|
logical, parameter :: debug=.false.
|
|
integer(psb_ipk_) :: nza, i,j,k, nzl, isza
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
|
|
if (nz <= 0) then
|
|
info = psb_err_iarg_neg_
|
|
ierr(1)=1
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
if (size(ia) < nz) then
|
|
info = psb_err_input_asize_invalid_i_
|
|
ierr(1)=2
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (size(ja) < nz) then
|
|
info = psb_err_input_asize_invalid_i_
|
|
ierr(1)=3
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
if (size(val) < nz) then
|
|
info = psb_err_input_asize_invalid_i_
|
|
ierr(1)=4
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
end if
|
|
|
|
if (nz == 0) return
|
|
|
|
nza = a%get_nzeros()
|
|
|
|
if (a%is_bld()) then
|
|
! Build phase should only ever be in COO
|
|
info = psb_err_invalid_mat_state_
|
|
|
|
else if (a%is_upd()) then
|
|
call psb_s_csc_srch_upd(nz,ia,ja,val,a,&
|
|
& imin,imax,jmin,jmax,info,gtl)
|
|
|
|
if (info /= psb_success_) then
|
|
|
|
info = psb_err_invalid_mat_state_
|
|
end if
|
|
|
|
else
|
|
! State is wrong.
|
|
info = psb_err_invalid_mat_state_
|
|
end if
|
|
if (info /= psb_success_) 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 psb_s_csc_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_s_csc_sparse_mat), intent(inout) :: a
|
|
integer(psb_ipk_), intent(in) :: nz, imin,imax,jmin,jmax
|
|
integer(psb_ipk_), intent(in) :: ia(:),ja(:)
|
|
real(psb_spk_), intent(in) :: val(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
integer(psb_ipk_), intent(in), optional :: gtl(:)
|
|
integer(psb_ipk_) :: i,ir,ic, ilr, ilc, ip, &
|
|
& i1,i2,nr,nc,nnz,dupl,ng, nar, nac
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name='s_csc_srch_upd'
|
|
|
|
info = psb_success_
|
|
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()
|
|
nar = a%get_nrows()
|
|
nac = 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 ((ic > 0).and.(ic <= nac)) then
|
|
i1 = a%icp(ic)
|
|
i2 = a%icp(ic+1)
|
|
nr=i2-i1
|
|
|
|
ip = psb_ibsrch(ir,nr,a%ia(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 ',ir,' in: ',i1,i2,&
|
|
& ' : ',a%ia(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 ((ic > 0).and.(ic <= nac)) then
|
|
i1 = a%icp(ic)
|
|
i2 = a%icp(ic+1)
|
|
nr=i2-i1
|
|
|
|
ip = psb_ibsrch(ir,nr,a%ia(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 ',ir,' in: ',i1,i2,&
|
|
& ' : ',a%ia(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 ((ic > 0).and.(ic <= nac)) then
|
|
i1 = a%icp(ic)
|
|
i2 = a%icp(ic+1)
|
|
nr=i2-i1
|
|
|
|
ip = psb_ibsrch(ir,nr,a%ia(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 ',ir,' in: ',i1,i2,&
|
|
& ' : ',a%ia(i1:i2-1)
|
|
info = i
|
|
return
|
|
end if
|
|
|
|
else
|
|
if (debug_level >= psb_debug_serial_) &
|
|
& write(debug_unit,*) trim(name),&
|
|
& ': Discarding col 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 ((ic > 0).and.(ic <= nac)) then
|
|
i1 = a%icp(ic)
|
|
i2 = a%icp(ic+1)
|
|
nr=i2-i1
|
|
|
|
ip = psb_ibsrch(ir,nr,a%ia(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 ',ir,' in: ',i1,i2,&
|
|
& ' : ',a%ia(i1:i2-1)
|
|
info = i
|
|
return
|
|
end if
|
|
else
|
|
if (debug_level >= psb_debug_serial_) &
|
|
& write(debug_unit,*) trim(name),&
|
|
& ': Discarding col 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 psb_s_csc_srch_upd
|
|
|
|
end subroutine psb_s_csc_csput
|
|
|
|
|
|
|
|
subroutine psb_s_cp_csc_from_coo(a,b,info)
|
|
use psb_const_mod
|
|
use psb_realloc_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_cp_csc_from_coo
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
class(psb_s_coo_sparse_mat), intent(in) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
type(psb_s_coo_sparse_mat) :: tmp
|
|
integer(psb_ipk_), allocatable :: itemp(:)
|
|
!locals
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name
|
|
|
|
info = psb_success_
|
|
! We need to make a copy because mv_from will have to
|
|
! sort in column-major order.
|
|
call tmp%cp_from_coo(b,info)
|
|
if (info == psb_success_) call a%mv_from_coo(tmp,info)
|
|
|
|
end subroutine psb_s_cp_csc_from_coo
|
|
|
|
|
|
|
|
subroutine psb_s_cp_csc_to_coo(a,b,info)
|
|
use psb_const_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_cp_csc_to_coo
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
class(psb_s_coo_sparse_mat), intent(inout) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
integer(psb_ipk_), allocatable :: itemp(:)
|
|
!locals
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, nc,i,j,irw, err_act
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name
|
|
|
|
info = psb_success_
|
|
|
|
nr = a%get_nrows()
|
|
nc = a%get_ncols()
|
|
nza = a%get_nzeros()
|
|
|
|
call b%allocate(nr,nc,nza)
|
|
b%psb_s_base_sparse_mat = a%psb_s_base_sparse_mat
|
|
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
b%ia(j) = a%ia(j)
|
|
b%ja(j) = i
|
|
b%val(j) = a%val(j)
|
|
end do
|
|
end do
|
|
|
|
call b%set_nzeros(a%get_nzeros())
|
|
call b%fix(info)
|
|
|
|
|
|
end subroutine psb_s_cp_csc_to_coo
|
|
|
|
|
|
subroutine psb_s_mv_csc_to_coo(a,b,info)
|
|
use psb_const_mod
|
|
use psb_realloc_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_mv_csc_to_coo
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
class(psb_s_coo_sparse_mat), intent(inout) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
integer(psb_ipk_), allocatable :: itemp(:)
|
|
!locals
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, nc,i,j,irw, err_act
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name
|
|
|
|
info = psb_success_
|
|
|
|
nr = a%get_nrows()
|
|
nc = a%get_ncols()
|
|
nza = a%get_nzeros()
|
|
|
|
b%psb_s_base_sparse_mat = a%psb_s_base_sparse_mat
|
|
call b%set_nzeros(a%get_nzeros())
|
|
call move_alloc(a%ia,b%ia)
|
|
call move_alloc(a%val,b%val)
|
|
call psb_realloc(nza,b%ja,info)
|
|
if (info /= psb_success_) return
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
b%ja(j) = i
|
|
end do
|
|
end do
|
|
call a%free()
|
|
call b%fix(info)
|
|
|
|
end subroutine psb_s_mv_csc_to_coo
|
|
|
|
|
|
|
|
subroutine psb_s_mv_csc_from_coo(a,b,info)
|
|
use psb_const_mod
|
|
use psb_realloc_mod
|
|
use psb_error_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_mv_csc_from_coo
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
class(psb_s_coo_sparse_mat), intent(inout) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
integer(psb_ipk_), allocatable :: itemp(:)
|
|
!locals
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc, icl
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name='s_mv_csc_from_coo'
|
|
|
|
info = psb_success_
|
|
debug_unit = psb_get_debug_unit()
|
|
debug_level = psb_get_debug_level()
|
|
|
|
|
|
call b%fix(info, idir=psb_col_major_)
|
|
if (info /= psb_success_) return
|
|
|
|
nr = b%get_nrows()
|
|
nc = b%get_ncols()
|
|
nza = b%get_nzeros()
|
|
|
|
a%psb_s_base_sparse_mat = b%psb_s_base_sparse_mat
|
|
|
|
! Dirty trick: call move_alloc to have the new data allocated just once.
|
|
call move_alloc(b%ja,itemp)
|
|
call move_alloc(b%ia,a%ia)
|
|
call move_alloc(b%val,a%val)
|
|
call psb_realloc(max(nr+1,nc+1),a%icp,info)
|
|
call b%free()
|
|
|
|
if (nza <= 0) then
|
|
a%icp(:) = 1
|
|
else
|
|
a%icp(1) = 1
|
|
if (nc < itemp(nza)) then
|
|
write(debug_unit,*) trim(name),': CLSHR=.false. : ',&
|
|
&nc,itemp(nza),' Expect trouble!'
|
|
info = 12
|
|
end if
|
|
|
|
j = 1
|
|
i = 1
|
|
icl = itemp(j)
|
|
|
|
outer: do
|
|
inner: do
|
|
if (i >= icl) exit inner
|
|
if (i > nc) then
|
|
write(debug_unit,*) trim(name),&
|
|
& 'Strange situation: i>nr ',i,nc,j,nza,icl
|
|
exit outer
|
|
end if
|
|
a%icp(i+1) = a%icp(i)
|
|
i = i + 1
|
|
end do inner
|
|
j = j + 1
|
|
if (j > nza) exit
|
|
if (itemp(j) /= icl) then
|
|
a%icp(i+1) = j
|
|
icl = itemp(j)
|
|
i = i + 1
|
|
endif
|
|
if (i > nc) 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 > nc) exit
|
|
a%icp(i+1) = j
|
|
i = i + 1
|
|
end do
|
|
|
|
endif
|
|
|
|
|
|
end subroutine psb_s_mv_csc_from_coo
|
|
|
|
|
|
subroutine psb_s_mv_csc_to_fmt(a,b,info)
|
|
use psb_const_mod
|
|
use psb_realloc_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_mv_csc_to_fmt
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
class(psb_s_base_sparse_mat), intent(inout) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
!locals
|
|
type(psb_s_coo_sparse_mat) :: tmp
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name
|
|
|
|
info = psb_success_
|
|
|
|
select type (b)
|
|
type is (psb_s_coo_sparse_mat)
|
|
call a%mv_to_coo(b,info)
|
|
! Need to fix trivial copies!
|
|
type is (psb_s_csc_sparse_mat)
|
|
b%psb_s_base_sparse_mat = a%psb_s_base_sparse_mat
|
|
call move_alloc(a%icp, b%icp)
|
|
call move_alloc(a%ia, b%ia)
|
|
call move_alloc(a%val, b%val)
|
|
call a%free()
|
|
|
|
class default
|
|
call a%mv_to_coo(tmp,info)
|
|
if (info == psb_success_) call b%mv_from_coo(tmp,info)
|
|
end select
|
|
|
|
end subroutine psb_s_mv_csc_to_fmt
|
|
!!$
|
|
|
|
subroutine psb_s_cp_csc_to_fmt(a,b,info)
|
|
use psb_const_mod
|
|
use psb_realloc_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_cp_csc_to_fmt
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
class(psb_s_base_sparse_mat), intent(inout) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
!locals
|
|
type(psb_s_coo_sparse_mat) :: tmp
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name
|
|
|
|
info = psb_success_
|
|
|
|
|
|
select type (b)
|
|
type is (psb_s_coo_sparse_mat)
|
|
call a%cp_to_coo(b,info)
|
|
|
|
type is (psb_s_csc_sparse_mat)
|
|
b%psb_s_base_sparse_mat = a%psb_s_base_sparse_mat
|
|
if (info == 0) call psb_safe_cpy( a%icp, b%icp , info)
|
|
if (info == 0) call psb_safe_cpy( a%ia , b%ia , info)
|
|
if (info == 0) call psb_safe_cpy( a%val, b%val , info)
|
|
|
|
class default
|
|
call a%cp_to_coo(tmp,info)
|
|
if (info == psb_success_) call b%mv_from_coo(tmp,info)
|
|
end select
|
|
|
|
end subroutine psb_s_cp_csc_to_fmt
|
|
|
|
|
|
subroutine psb_s_mv_csc_from_fmt(a,b,info)
|
|
use psb_const_mod
|
|
use psb_realloc_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_mv_csc_from_fmt
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
class(psb_s_base_sparse_mat), intent(inout) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
!locals
|
|
type(psb_s_coo_sparse_mat) :: tmp
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name
|
|
|
|
info = psb_success_
|
|
|
|
select type (b)
|
|
type is (psb_s_coo_sparse_mat)
|
|
call a%mv_from_coo(b,info)
|
|
|
|
type is (psb_s_csc_sparse_mat)
|
|
a%psb_s_base_sparse_mat = b%psb_s_base_sparse_mat
|
|
call move_alloc(b%icp, a%icp)
|
|
call move_alloc(b%ia, a%ia)
|
|
call move_alloc(b%val, a%val)
|
|
call b%free()
|
|
|
|
class default
|
|
call b%mv_to_coo(tmp,info)
|
|
if (info == psb_success_) call a%mv_from_coo(tmp,info)
|
|
end select
|
|
|
|
end subroutine psb_s_mv_csc_from_fmt
|
|
|
|
|
|
|
|
subroutine psb_s_cp_csc_from_fmt(a,b,info)
|
|
use psb_const_mod
|
|
use psb_realloc_mod
|
|
use psb_s_base_mat_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_cp_csc_from_fmt
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
class(psb_s_base_sparse_mat), intent(in) :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
!locals
|
|
type(psb_s_coo_sparse_mat) :: tmp
|
|
logical :: rwshr_
|
|
integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc
|
|
integer(psb_ipk_), Parameter :: maxtry=8
|
|
integer(psb_ipk_) :: debug_level, debug_unit
|
|
character(len=20) :: name
|
|
|
|
info = psb_success_
|
|
|
|
select type (b)
|
|
type is (psb_s_coo_sparse_mat)
|
|
call a%cp_from_coo(b,info)
|
|
|
|
type is (psb_s_csc_sparse_mat)
|
|
a%psb_s_base_sparse_mat = b%psb_s_base_sparse_mat
|
|
if (info == 0) call psb_safe_cpy( b%icp, a%icp , info)
|
|
if (info == 0) call psb_safe_cpy( b%ia , a%ia , info)
|
|
if (info == 0) call psb_safe_cpy( b%val, a%val , info)
|
|
|
|
class default
|
|
call b%cp_to_coo(tmp,info)
|
|
if (info == psb_success_) call a%mv_from_coo(tmp,info)
|
|
end select
|
|
|
|
end subroutine psb_s_cp_csc_from_fmt
|
|
|
|
|
|
subroutine psb_s_csc_mold(a,b,info)
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_mold
|
|
use psb_error_mod
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
class(psb_s_base_sparse_mat), intent(inout), allocatable :: b
|
|
integer(psb_ipk_), intent(out) :: info
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='csc_mold'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_get_erraction(err_act)
|
|
|
|
info = 0
|
|
if (allocated(b)) then
|
|
call b%free()
|
|
deallocate(b,stat=info)
|
|
end if
|
|
if (info == 0) allocate(psb_s_csc_sparse_mat :: b, stat=info)
|
|
|
|
if (info /= 0) then
|
|
info = psb_err_alloc_dealloc_
|
|
call psb_errpush(info, name)
|
|
goto 9999
|
|
end if
|
|
return
|
|
9999 continue
|
|
if (err_act /= psb_act_ret_) then
|
|
call psb_error()
|
|
end if
|
|
return
|
|
|
|
end subroutine psb_s_csc_mold
|
|
|
|
subroutine psb_s_csc_reallocate_nz(nz,a)
|
|
use psb_error_mod
|
|
use psb_realloc_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_reallocate_nz
|
|
implicit none
|
|
integer(psb_ipk_), intent(in) :: nz
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
integer(psb_ipk_) :: err_act, info
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_reallocate_nz'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
|
|
call psb_realloc(nz,a%ia,info)
|
|
if (info == psb_success_) call psb_realloc(nz,a%val,info)
|
|
if (info == psb_success_) call psb_realloc(max(nz,a%get_nrows()+1,a%get_ncols()+1),a%icp,info)
|
|
if (info /= psb_success_) then
|
|
call psb_errpush(psb_err_alloc_dealloc_,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
|
|
|
|
end subroutine psb_s_csc_reallocate_nz
|
|
|
|
|
|
|
|
subroutine psb_s_csc_csgetblk(imin,imax,a,b,info,&
|
|
& jmin,jmax,iren,append,rscale,cscale)
|
|
! Output is always in COO format
|
|
use psb_error_mod
|
|
use psb_const_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_csgetblk
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
class(psb_s_coo_sparse_mat), intent(inout) :: b
|
|
integer(psb_ipk_), intent(in) :: imin,imax
|
|
integer(psb_ipk_),intent(out) :: info
|
|
logical, intent(in), optional :: append
|
|
integer(psb_ipk_), intent(in), optional :: iren(:)
|
|
integer(psb_ipk_), intent(in), optional :: jmin,jmax
|
|
logical, intent(in), optional :: rscale,cscale
|
|
integer(psb_ipk_) :: err_act, nzin, nzout
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='csget'
|
|
logical :: append_
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
|
|
if (present(append)) then
|
|
append_ = append
|
|
else
|
|
append_ = .false.
|
|
endif
|
|
if (append_) then
|
|
nzin = a%get_nzeros()
|
|
else
|
|
nzin = 0
|
|
endif
|
|
|
|
call a%csget(imin,imax,nzout,b%ia,b%ja,b%val,info,&
|
|
& jmin=jmin, jmax=jmax, iren=iren, append=append_, &
|
|
& nzin=nzin, rscale=rscale, cscale=cscale)
|
|
|
|
if (info /= psb_success_) goto 9999
|
|
|
|
call b%set_nzeros(nzin+nzout)
|
|
call b%fix(info)
|
|
if (info /= psb_success_) goto 9999
|
|
|
|
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
|
|
|
|
end subroutine psb_s_csc_csgetblk
|
|
|
|
subroutine psb_s_csc_reinit(a,clear)
|
|
use psb_error_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_reinit
|
|
implicit none
|
|
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
logical, intent(in), optional :: clear
|
|
|
|
integer(psb_ipk_) :: err_act, info
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='reinit'
|
|
logical :: clear_
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
|
|
|
|
if (present(clear)) then
|
|
clear_ = clear
|
|
else
|
|
clear_ = .true.
|
|
end if
|
|
|
|
if (a%is_bld() .or. a%is_upd()) then
|
|
! do nothing
|
|
return
|
|
else if (a%is_asb()) then
|
|
if (clear_) a%val(:) = szero
|
|
call a%set_upd()
|
|
else
|
|
info = psb_err_invalid_mat_state_
|
|
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
|
|
|
|
end subroutine psb_s_csc_reinit
|
|
|
|
subroutine psb_s_csc_trim(a)
|
|
use psb_realloc_mod
|
|
use psb_error_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_trim
|
|
implicit none
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
integer(psb_ipk_) :: err_act, info, nz, n
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='trim'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
n = a%get_ncols()
|
|
nz = a%get_nzeros()
|
|
if (info == psb_success_) call psb_realloc(n+1,a%icp,info)
|
|
if (info == psb_success_) call psb_realloc(nz,a%ia,info)
|
|
if (info == psb_success_) call psb_realloc(nz,a%val,info)
|
|
|
|
if (info /= psb_success_) goto 9999
|
|
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
|
|
|
|
end subroutine psb_s_csc_trim
|
|
|
|
subroutine psb_s_csc_allocate_mnnz(m,n,a,nz)
|
|
use psb_error_mod
|
|
use psb_realloc_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_allocate_mnnz
|
|
implicit none
|
|
integer(psb_ipk_), intent(in) :: m,n
|
|
class(psb_s_csc_sparse_mat), intent(inout) :: a
|
|
integer(psb_ipk_), intent(in), optional :: nz
|
|
integer(psb_ipk_) :: err_act, info, nz_
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='allocate_mnz'
|
|
logical, parameter :: debug=.false.
|
|
|
|
call psb_erractionsave(err_act)
|
|
info = psb_success_
|
|
if (m < 0) then
|
|
info = psb_err_iarg_neg_
|
|
ierr(1) = ione; ierr(2) = izero;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
endif
|
|
if (n < 0) then
|
|
info = psb_err_iarg_neg_
|
|
ierr(1) = 2; ierr(2) = izero;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
endif
|
|
if (present(nz)) then
|
|
nz_ = nz
|
|
else
|
|
nz_ = max(7*m,7*n,1)
|
|
end if
|
|
if (nz_ < 0) then
|
|
info = psb_err_iarg_neg_
|
|
ierr(1) = 3; ierr(2) = izero;
|
|
call psb_errpush(info,name,i_err=ierr)
|
|
goto 9999
|
|
endif
|
|
|
|
if (info == psb_success_) call psb_realloc(n+1,a%icp,info)
|
|
if (info == psb_success_) call psb_realloc(nz_,a%ia,info)
|
|
if (info == psb_success_) call psb_realloc(nz_,a%val,info)
|
|
if (info == psb_success_) then
|
|
a%icp=0
|
|
call a%set_nrows(m)
|
|
call a%set_ncols(n)
|
|
call a%set_bld()
|
|
call a%set_triangle(.false.)
|
|
call a%set_unit(.false.)
|
|
call a%set_dupl(psb_dupl_def_)
|
|
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
|
|
|
|
end subroutine psb_s_csc_allocate_mnnz
|
|
|
|
subroutine psb_s_csc_print(iout,a,iv,head,ivr,ivc)
|
|
use psb_string_mod
|
|
use psb_s_csc_mat_mod, psb_protect_name => psb_s_csc_print
|
|
implicit none
|
|
|
|
integer(psb_ipk_), intent(in) :: iout
|
|
class(psb_s_csc_sparse_mat), intent(in) :: a
|
|
integer(psb_ipk_), intent(in), optional :: iv(:)
|
|
character(len=*), optional :: head
|
|
integer(psb_ipk_), intent(in), optional :: ivr(:), ivc(:)
|
|
|
|
integer(psb_ipk_) :: err_act
|
|
integer(psb_ipk_) :: ierr(5)
|
|
character(len=20) :: name='s_csc_print'
|
|
logical, parameter :: debug=.false.
|
|
|
|
character(len=*), parameter :: datatype='real'
|
|
character(len=80) :: frmtv
|
|
integer(psb_ipk_) :: i,j, nmx, ni, nr, nc, nz
|
|
|
|
if (present(head)) then
|
|
write(iout,'(a)') '%%MatrixMarket matrix coordinate real general'
|
|
write(iout,'(a,a)') '% ',head
|
|
write(iout,'(a)') '%'
|
|
write(iout,'(a,a)') '% COO'
|
|
endif
|
|
|
|
nr = a%get_nrows()
|
|
nc = a%get_ncols()
|
|
nz = a%get_nzeros()
|
|
nmx = max(nr,nc,1)
|
|
ni = floor(log10(1.0*nmx)) + 1
|
|
|
|
if (datatype=='real') then
|
|
write(frmtv,'(a,i3.3,a,i3.3,a)') '(2(i',ni,',1x),es26.18,1x,2(i',ni,',1x))'
|
|
else
|
|
write(frmtv,'(a,i3.3,a,i3.3,a)') '(2(i',ni,',1x),2(es26.18,1x),2(i',ni,',1x))'
|
|
end if
|
|
write(iout,*) nr, nc, nz
|
|
if(present(iv)) then
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
write(iout,frmtv) iv(a%ia(j)),iv(i),a%val(j)
|
|
end do
|
|
enddo
|
|
else
|
|
if (present(ivr).and..not.present(ivc)) then
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
write(iout,frmtv) ivr(a%ia(j)),i,a%val(j)
|
|
end do
|
|
enddo
|
|
else if (present(ivr).and.present(ivc)) then
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
write(iout,frmtv) ivr(a%ia(j)),ivc(i),a%val(j)
|
|
end do
|
|
enddo
|
|
else if (.not.present(ivr).and.present(ivc)) then
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
write(iout,frmtv) (a%ia(j)),ivc(i),a%val(j)
|
|
end do
|
|
enddo
|
|
else if (.not.present(ivr).and..not.present(ivc)) then
|
|
do i=1, nc
|
|
do j=a%icp(i),a%icp(i+1)-1
|
|
write(iout,frmtv) (a%ia(j)),(i),a%val(j)
|
|
end do
|
|
enddo
|
|
endif
|
|
endif
|
|
|
|
end subroutine psb_s_csc_print
|
|
|