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.
115 lines
3.8 KiB
Fortran
115 lines
3.8 KiB
Fortran
!!$
|
|
!!$ Parallel Sparse BLAS v2.0
|
|
!!$ (C) Copyright 2006 Salvatore Filippone University of Rome Tor Vergata
|
|
!!$ Alfredo Buttari University of Rome Tor Vergata
|
|
!!$
|
|
!!$ 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.
|
|
!!$
|
|
!!$
|
|
! File: psb_drwextd.f90
|
|
! Subroutine:
|
|
! Parameters:
|
|
|
|
subroutine psb_drwextd(nr,a,info,b)
|
|
use psb_spmat_type
|
|
use psb_error_mod
|
|
implicit none
|
|
|
|
! Extend matrix A up to NR rows with empty ones (i.e.: all zeroes)
|
|
integer, intent(in) :: nr
|
|
type(psb_dspmat_type), intent(inout) :: a
|
|
integer,intent(out) :: info
|
|
type(psb_dspmat_type), intent(in), optional :: b
|
|
integer :: i,j,ja,jb,err_act
|
|
character(len=20) :: name, ch_err
|
|
|
|
name='psb_drwextd'
|
|
info = 0
|
|
call psb_erractionsave(err_act)
|
|
|
|
if (nr > a%m) then
|
|
|
|
if (a%fida == 'CSR') then
|
|
call psb_realloc(nr+1,a%ia2,info)
|
|
if (present(b)) then
|
|
jb = b%ia2(b%m+1)-1
|
|
call psb_realloc(size(a%ia1)+jb,a%ia1,info)
|
|
call psb_realloc(size(a%aspk)+jb,a%aspk,info)
|
|
do i=1, min(nr-a%m,b%m)
|
|
! Should use spgtblk.
|
|
! Don't care for the time being.
|
|
a%ia2(a%m+i+1) = a%ia2(a%m+i) + b%ia2(i+1) - b%ia2(i)
|
|
ja = a%ia2(a%m+i)
|
|
jb = b%ia2(i)
|
|
do
|
|
if (jb >= b%ia2(i+1)) exit
|
|
a%aspk(ja) = b%aspk(jb)
|
|
a%ia1(ja) = b%ia1(jb)
|
|
ja = ja + 1
|
|
jb = jb + 1
|
|
end do
|
|
end do
|
|
do j=i,nr-a%m
|
|
a%ia2(a%m+i+1) = a%ia2(a%m+i)
|
|
end do
|
|
|
|
else
|
|
do i=a%m+2,nr+1
|
|
a%ia2(i) = a%ia2(i-1)
|
|
end do
|
|
end if
|
|
a%m = nr
|
|
else if (a%fida == 'COO') then
|
|
if (present(b)) then
|
|
else
|
|
endif
|
|
a%m = nr
|
|
else if (a%fida == 'JAD') then
|
|
info=135
|
|
ch_err=a%fida(1:3)
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
else
|
|
info=136
|
|
ch_err=a%fida(1:3)
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
end if
|
|
|
|
end if
|
|
|
|
call psb_erractionrestore(err_act)
|
|
return
|
|
|
|
9999 continue
|
|
call psb_erractionrestore(err_act)
|
|
if (err_act.eq.psb_act_abort_) then
|
|
call psb_error()
|
|
return
|
|
end if
|
|
return
|
|
|
|
end subroutine psb_drwextd
|