LCPQ/qp2
9
1
Fork 0
mirror of https://github.com/QuantumPackage/qp2.git synced 2025-01-02 08:35:38 +01:00
Code Releases Activity

Merge pull request #192 from Ydrnan/qp2_dev

Browse Source 
csf fix segfault
This commit is contained in:
Anthony Scemama 2022-03-28 16:43:32 +02:00 committed by GitHub
commit 1dac2bd9b2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 34 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
src/csf/sigma_vector.irp.f
View File

@ -51,11 +51,24 @@
if(cfg_seniority_index(i+2) > ncfgpersomo) then if(cfg_seniority_index(i+2) > ncfgpersomo) then
ncfgpersomo = cfg_seniority_index(i+2) ncfgpersomo = cfg_seniority_index(i+2)
else else
k = 0 ! l = i+k+2
do while(cfg_seniority_index(i+2+k) < ncfgpersomo) ! Loop over l with a constraint to ensure that l <= size(cfg_seniority_index,1)-1
k = k + 2 ! Old version commented just below
ncfgpersomo = cfg_seniority_index(i+2+k) do l = min(size(cfg_seniority_index,1)-1, i+2), size(cfg_seniority_index,1)-1, 2
if (cfg_seniority_index(l) >= ncfgpersomo) then
ncfgpersomo = cfg_seniority_index(l)
endif
enddo enddo
!k = 0
!if ((i+2+k) < size(cfg_seniority_index,1)) then
! do while(cfg_seniority_index(i+2+k) < ncfgpersomo)
! k = k + 2
! if ((i+2+k) >= size(cfg_seniority_index,1)) then
! exit
! endif
! ncfgpersomo = cfg_seniority_index(i+2+k)
! enddo
!endif
endif endif
endif endif
ncfg = ncfgpersomo - ncfgprev ncfg = ncfgpersomo - ncfgprev
@ -74,11 +87,24 @@
if(cfg_seniority_index(i+2) > ncfgprev) then if(cfg_seniority_index(i+2) > ncfgprev) then
ncfgprev = cfg_seniority_index(i+2) ncfgprev = cfg_seniority_index(i+2)
else else
k = 0 ! l = i+k+2
do while(cfg_seniority_index(i+2+k) < ncfgprev) ! Loop over l with a constraint to ensure that l <= size(cfg_seniority_index,1)-1
k = k + 2 ! Old version commented just below
ncfgprev = cfg_seniority_index(i+2+k) do l = min(size(cfg_seniority_index,1)-1, i+2), size(cfg_seniority_index,1)-1, 2
if (cfg_seniority_index(l) >= ncfgprev) then
ncfgprev = cfg_seniority_index(l)
endif
enddo enddo
!k = 0
!if ((i+2+k) < size(cfg_seniority_index,1)) then
! do while(cfg_seniority_index(i+2+k) < ncfgprev)
! k = k + 2
! if ((i+2+k) >= size(cfg_seniority_index,1)) then
! exit
! endif
! ncfgprev = cfg_seniority_index(i+2+k)
! enddo
!endif
endif endif
enddo enddo
END_PROVIDER END_PROVIDER