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.
595 lines
16 KiB
Fortran
595 lines
16 KiB
Fortran
!!$
|
|
!!$ Parallel Sparse BLAS version 3.0
|
|
!!$ (C) Copyright 2006, 2007, 2008, 2009, 2010
|
|
!!$ 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.
|
|
!!$
|
|
!!$
|
|
!
|
|
!
|
|
! package: psb_repl_map_mod
|
|
! Defines the REPL_MAP type.
|
|
! This is a replicated index space. It is also used
|
|
! when NP=1. The answer to the query for the owning process
|
|
! is always the local process, after all it's supposed to be
|
|
! replicated; also, global to local index mapping is just the
|
|
! identity, only thing to be done is to check the bounds.
|
|
!
|
|
!
|
|
module psb_repl_map_mod
|
|
use psb_const_mod
|
|
use psb_desc_const_mod
|
|
use psb_indx_map_mod
|
|
|
|
type, extends(psb_indx_map) :: psb_repl_map
|
|
|
|
contains
|
|
|
|
procedure, pass(idxmap) :: repl_map_init => repl_init
|
|
|
|
procedure, nopass :: is_repl => repl_is_repl
|
|
procedure, pass(idxmap) :: asb => repl_asb
|
|
procedure, pass(idxmap) :: free => repl_free
|
|
procedure, pass(idxmap) :: clone => repl_clone
|
|
procedure, nopass :: get_fmt => repl_get_fmt
|
|
|
|
procedure, pass(idxmap) :: l2gs1 => repl_l2gs1
|
|
procedure, pass(idxmap) :: l2gs2 => repl_l2gs2
|
|
procedure, pass(idxmap) :: l2gv1 => repl_l2gv1
|
|
procedure, pass(idxmap) :: l2gv2 => repl_l2gv2
|
|
|
|
procedure, pass(idxmap) :: g2ls1 => repl_g2ls1
|
|
procedure, pass(idxmap) :: g2ls2 => repl_g2ls2
|
|
procedure, pass(idxmap) :: g2lv1 => repl_g2lv1
|
|
procedure, pass(idxmap) :: g2lv2 => repl_g2lv2
|
|
|
|
procedure, pass(idxmap) :: g2ls1_ins => repl_g2ls1_ins
|
|
procedure, pass(idxmap) :: g2ls2_ins => repl_g2ls2_ins
|
|
procedure, pass(idxmap) :: g2lv1_ins => repl_g2lv1_ins
|
|
procedure, pass(idxmap) :: g2lv2_ins => repl_g2lv2_ins
|
|
|
|
procedure, pass(idxmap) :: fnd_owner => repl_fnd_owner
|
|
|
|
end type psb_repl_map
|
|
|
|
private :: repl_init, repl_is_repl, repl_asb, repl_free,&
|
|
& repl_get_fmt, repl_l2gs1, repl_l2gs2, repl_l2gv1,&
|
|
& repl_l2gv2, repl_g2ls1, repl_g2ls2, repl_g2lv1,&
|
|
& repl_g2lv2, repl_g2ls1_ins, repl_g2ls2_ins,&
|
|
& repl_g2lv1_ins, repl_g2lv2_ins
|
|
|
|
|
|
contains
|
|
|
|
function repl_is_repl() result(val)
|
|
implicit none
|
|
logical :: val
|
|
val = .true.
|
|
end function repl_is_repl
|
|
|
|
|
|
function repl_sizeof(idxmap) result(val)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_long_int_k_) :: val
|
|
|
|
val = idxmap%psb_indx_map%sizeof()
|
|
|
|
end function repl_sizeof
|
|
|
|
|
|
|
|
subroutine repl_l2gs1(idx,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(inout) :: idx
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask
|
|
logical, intent(in), optional :: owned
|
|
integer(psb_ipk_) :: idxv(1)
|
|
info = 0
|
|
if (present(mask)) then
|
|
if (.not.mask) return
|
|
end if
|
|
|
|
idxv(1) = idx
|
|
call idxmap%l2g(idxv,info,owned=owned)
|
|
idx = idxv(1)
|
|
|
|
end subroutine repl_l2gs1
|
|
|
|
subroutine repl_l2gs2(idxin,idxout,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(in) :: idxin
|
|
integer(psb_ipk_), intent(out) :: idxout
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask
|
|
logical, intent(in), optional :: owned
|
|
|
|
idxout = idxin
|
|
call idxmap%l2g(idxout,info,mask,owned)
|
|
|
|
end subroutine repl_l2gs2
|
|
|
|
|
|
subroutine repl_l2gv1(idx,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(inout) :: idx(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask(:)
|
|
logical, intent(in), optional :: owned
|
|
integer(psb_ipk_) :: i
|
|
logical :: owned_
|
|
info = 0
|
|
|
|
if (present(mask)) then
|
|
if (size(mask) < size(idx)) then
|
|
info = -1
|
|
return
|
|
end if
|
|
end if
|
|
if (present(owned)) then
|
|
owned_ = owned
|
|
else
|
|
owned_ = .false.
|
|
end if
|
|
|
|
if (present(mask)) then
|
|
|
|
do i=1, size(idx)
|
|
if (mask(i)) then
|
|
if ((1<=idx(i)).and.(idx(i) <= idxmap%local_rows)) then
|
|
! do nothing
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end if
|
|
end do
|
|
|
|
else if (.not.present(mask)) then
|
|
|
|
do i=1, size(idx)
|
|
if ((1<=idx(i)).and.(idx(i) <= idxmap%local_rows)) then
|
|
! do nothing
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end do
|
|
|
|
end if
|
|
|
|
end subroutine repl_l2gv1
|
|
|
|
subroutine repl_l2gv2(idxin,idxout,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(in) :: idxin(:)
|
|
integer(psb_ipk_), intent(out) :: idxout(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask(:)
|
|
logical, intent(in), optional :: owned
|
|
integer(psb_ipk_) :: is, im
|
|
|
|
is = size(idxin)
|
|
im = min(is,size(idxout))
|
|
idxout(1:im) = idxin(1:im)
|
|
call idxmap%l2g(idxout(1:im),info,mask,owned)
|
|
if (is > im) info = -3
|
|
|
|
end subroutine repl_l2gv2
|
|
|
|
|
|
subroutine repl_g2ls1(idx,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(inout) :: idx
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask
|
|
logical, intent(in), optional :: owned
|
|
integer(psb_ipk_) :: idxv(1)
|
|
info = 0
|
|
|
|
if (present(mask)) then
|
|
if (.not.mask) return
|
|
end if
|
|
|
|
idxv(1) = idx
|
|
call idxmap%g2l(idxv,info,owned=owned)
|
|
idx = idxv(1)
|
|
|
|
end subroutine repl_g2ls1
|
|
|
|
subroutine repl_g2ls2(idxin,idxout,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(in) :: idxin
|
|
integer(psb_ipk_), intent(out) :: idxout
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask
|
|
logical, intent(in), optional :: owned
|
|
|
|
idxout = idxin
|
|
call idxmap%g2l(idxout,info,mask,owned)
|
|
|
|
end subroutine repl_g2ls2
|
|
|
|
|
|
subroutine repl_g2lv1(idx,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(inout) :: idx(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask(:)
|
|
logical, intent(in), optional :: owned
|
|
integer(psb_ipk_) :: i, is
|
|
logical :: owned_
|
|
|
|
info = 0
|
|
|
|
if (present(mask)) then
|
|
if (size(mask) < size(idx)) then
|
|
info = -1
|
|
return
|
|
end if
|
|
end if
|
|
if (present(owned)) then
|
|
owned_ = owned
|
|
else
|
|
owned_ = .false.
|
|
end if
|
|
|
|
is = size(idx)
|
|
|
|
if (present(mask)) then
|
|
|
|
if (idxmap%is_asb()) then
|
|
do i=1, is
|
|
if (mask(i)) then
|
|
if ((1<= idx(i)).and.(idx(i) <= idxmap%global_rows)) then
|
|
! do nothing
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end if
|
|
end do
|
|
else if (idxmap%is_valid()) then
|
|
do i=1,is
|
|
if (mask(i)) then
|
|
if ((1<= idx(i)).and.(idx(i) <= idxmap%global_rows)) then
|
|
! do nothing
|
|
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end if
|
|
end do
|
|
else
|
|
idx(1:is) = -1
|
|
info = -1
|
|
end if
|
|
|
|
else if (.not.present(mask)) then
|
|
|
|
if (idxmap%is_asb()) then
|
|
do i=1, is
|
|
if ((1<= idx(i)).and.(idx(i) <= idxmap%global_rows)) then
|
|
! do nothing
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end do
|
|
else if (idxmap%is_valid()) then
|
|
do i=1,is
|
|
if ((1<= idx(i)).and.(idx(i) <= idxmap%global_rows)) then
|
|
! do nothing
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end do
|
|
else
|
|
idx(1:is) = -1
|
|
info = -1
|
|
end if
|
|
|
|
end if
|
|
|
|
end subroutine repl_g2lv1
|
|
|
|
subroutine repl_g2lv2(idxin,idxout,idxmap,info,mask,owned)
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(in) :: idxin(:)
|
|
integer(psb_ipk_), intent(out) :: idxout(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask(:)
|
|
logical, intent(in), optional :: owned
|
|
|
|
integer(psb_ipk_) :: is, im
|
|
|
|
is = size(idxin)
|
|
im = min(is,size(idxout))
|
|
idxout(1:im) = idxin(1:im)
|
|
call idxmap%g2l(idxout(1:im),info,mask,owned)
|
|
if (is > im) info = -3
|
|
|
|
end subroutine repl_g2lv2
|
|
|
|
|
|
|
|
subroutine repl_g2ls1_ins(idx,idxmap,info,mask)
|
|
use psb_realloc_mod
|
|
use psb_sort_mod
|
|
implicit none
|
|
class(psb_repl_map), intent(inout) :: idxmap
|
|
integer(psb_ipk_), intent(inout) :: idx
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask
|
|
|
|
integer(psb_ipk_) :: idxv(1)
|
|
|
|
info = 0
|
|
if (present(mask)) then
|
|
if (.not.mask) return
|
|
end if
|
|
idxv(1) = idx
|
|
call idxmap%g2l_ins(idxv,info)
|
|
idx = idxv(1)
|
|
|
|
end subroutine repl_g2ls1_ins
|
|
|
|
subroutine repl_g2ls2_ins(idxin,idxout,idxmap,info,mask)
|
|
implicit none
|
|
class(psb_repl_map), intent(inout) :: idxmap
|
|
integer(psb_ipk_), intent(in) :: idxin
|
|
integer(psb_ipk_), intent(out) :: idxout
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask
|
|
|
|
idxout = idxin
|
|
call idxmap%g2l_ins(idxout,info,mask=mask)
|
|
|
|
end subroutine repl_g2ls2_ins
|
|
|
|
|
|
subroutine repl_g2lv1_ins(idx,idxmap,info,mask)
|
|
use psb_realloc_mod
|
|
use psb_sort_mod
|
|
implicit none
|
|
class(psb_repl_map), intent(inout) :: idxmap
|
|
integer(psb_ipk_), intent(inout) :: idx(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask(:)
|
|
integer(psb_ipk_) :: i, is
|
|
|
|
info = 0
|
|
is = size(idx)
|
|
|
|
if (present(mask)) then
|
|
if (size(mask) < size(idx)) then
|
|
info = -1
|
|
return
|
|
end if
|
|
end if
|
|
|
|
|
|
if (idxmap%is_asb()) then
|
|
! State is wrong for this one !
|
|
idx = -1
|
|
info = -1
|
|
|
|
else if (idxmap%is_valid()) then
|
|
|
|
if (present(mask)) then
|
|
do i=1, is
|
|
if (mask(i)) then
|
|
if ((1<= idx(i)).and.(idx(i) <= idxmap%global_rows)) then
|
|
! do nothing
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end if
|
|
end do
|
|
|
|
else if (.not.present(mask)) then
|
|
|
|
do i=1, is
|
|
if ((1<= idx(i)).and.(idx(i) <= idxmap%global_rows)) then
|
|
! do nothing
|
|
else
|
|
idx(i) = -1
|
|
end if
|
|
end do
|
|
end if
|
|
|
|
else
|
|
idx = -1
|
|
info = -1
|
|
end if
|
|
|
|
end subroutine repl_g2lv1_ins
|
|
|
|
subroutine repl_g2lv2_ins(idxin,idxout,idxmap,info,mask)
|
|
implicit none
|
|
class(psb_repl_map), intent(inout) :: idxmap
|
|
integer(psb_ipk_), intent(in) :: idxin(:)
|
|
integer(psb_ipk_), intent(out) :: idxout(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
logical, intent(in), optional :: mask(:)
|
|
integer(psb_ipk_) :: is, im
|
|
|
|
is = size(idxin)
|
|
im = min(is,size(idxout))
|
|
idxout(1:im) = idxin(1:im)
|
|
call idxmap%g2l_ins(idxout(1:im),info,mask)
|
|
if (is > im) info = -3
|
|
|
|
end subroutine repl_g2lv2_ins
|
|
|
|
|
|
subroutine repl_fnd_owner(idx,iprc,idxmap,info)
|
|
use psb_penv_mod
|
|
implicit none
|
|
integer(psb_ipk_), intent(in) :: idx(:)
|
|
integer(psb_ipk_), allocatable, intent(out) :: iprc(:)
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
integer(psb_ipk_), intent(out) :: info
|
|
integer(psb_ipk_) :: nv
|
|
integer(psb_mpik_) :: ictxt, iam, np
|
|
|
|
ictxt = idxmap%get_ctxt()
|
|
call psb_info(ictxt,iam,np)
|
|
|
|
nv = size(idx)
|
|
allocate(iprc(nv),stat=info)
|
|
if (info /= 0) then
|
|
write(0,*) 'Memory allocation failure in repl_map_fnd-owner'
|
|
return
|
|
end if
|
|
iprc(1:nv) = iam
|
|
|
|
end subroutine repl_fnd_owner
|
|
|
|
|
|
subroutine repl_init(idxmap,ictxt,nl,info)
|
|
use psb_penv_mod
|
|
use psb_error_mod
|
|
implicit none
|
|
class(psb_repl_map), intent(inout) :: idxmap
|
|
integer(psb_ipk_), intent(in) :: nl
|
|
integer(psb_mpik_), intent(in) :: ictxt
|
|
integer(psb_ipk_), intent(out) :: info
|
|
! To be implemented
|
|
integer(psb_mpik_) :: iam, np
|
|
|
|
info = 0
|
|
call psb_info(ictxt,iam,np)
|
|
if (np < 0) then
|
|
write(psb_err_unit,*) 'Invalid ictxt:',ictxt
|
|
info = -1
|
|
return
|
|
end if
|
|
|
|
|
|
idxmap%global_rows = nl
|
|
idxmap%global_cols = nl
|
|
idxmap%local_rows = nl
|
|
idxmap%local_cols = nl
|
|
idxmap%ictxt = ictxt
|
|
idxmap%state = psb_desc_bld_
|
|
call psb_get_mpicomm(ictxt,idxmap%mpic)
|
|
call idxmap%set_state(psb_desc_bld_)
|
|
|
|
end subroutine repl_init
|
|
|
|
|
|
subroutine repl_asb(idxmap,info)
|
|
use psb_penv_mod
|
|
use psb_error_mod
|
|
implicit none
|
|
class(psb_repl_map), intent(inout) :: idxmap
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
integer(psb_mpik_) :: ictxt, iam, np
|
|
|
|
info = 0
|
|
ictxt = idxmap%get_ctxt()
|
|
call psb_info(ictxt,iam,np)
|
|
|
|
call idxmap%set_state(psb_desc_asb_)
|
|
|
|
end subroutine repl_asb
|
|
|
|
subroutine repl_free(idxmap)
|
|
implicit none
|
|
class(psb_repl_map), intent(inout) :: idxmap
|
|
|
|
call idxmap%psb_indx_map%free()
|
|
|
|
end subroutine repl_free
|
|
|
|
|
|
function repl_get_fmt() result(res)
|
|
implicit none
|
|
character(len=5) :: res
|
|
res = 'REPL'
|
|
end function repl_get_fmt
|
|
|
|
|
|
subroutine repl_clone(idxmap,outmap,info)
|
|
use psb_penv_mod
|
|
use psb_error_mod
|
|
use psb_realloc_mod
|
|
implicit none
|
|
class(psb_repl_map), intent(in) :: idxmap
|
|
class(psb_indx_map), allocatable, intent(out) :: outmap
|
|
integer(psb_ipk_), intent(out) :: info
|
|
integer(psb_ipk_) :: err_act
|
|
character(len=20) :: name='repl_clone'
|
|
logical, parameter :: debug=.false.
|
|
|
|
info = psb_success_
|
|
call psb_get_erraction(err_act)
|
|
if (allocated(outmap)) then
|
|
write(0,*) 'Error: should not be allocated on input'
|
|
info = -87
|
|
goto 9999
|
|
end if
|
|
|
|
allocate(psb_repl_map :: outmap, stat=info)
|
|
if (info /= psb_success_) then
|
|
info = psb_err_alloc_dealloc_
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
select type (outmap)
|
|
type is (psb_repl_map)
|
|
outmap%psb_indx_map = idxmap%psb_indx_map
|
|
class default
|
|
! This should be impossible
|
|
info = -1
|
|
end select
|
|
|
|
if (info /= psb_success_) then
|
|
info = psb_err_from_subroutine_
|
|
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_ret_) then
|
|
call psb_error()
|
|
end if
|
|
return
|
|
end subroutine repl_clone
|
|
end module psb_repl_map_mod
|