mirror of https://github.com/saitohirga/WSJT-X.git
112 lines
2.8 KiB
Fortran
112 lines
2.8 KiB
Fortran
subroutine clockit(dname,k)
|
|
|
|
! Times procedure number n between a call with k=0 (tstart) and with
|
|
! k=1 (tstop). Accumulates sums of these times in array ut (user time).
|
|
! Also traces all calls (for debugging purposes) if limtrace.gt.0
|
|
|
|
character*8 dname,name(50),space,ename
|
|
character*16 sname
|
|
character*512 data_dir,fname
|
|
logical first,on(50)
|
|
real ut(50),ut0(50),dut(50),tt(2)
|
|
integer ncall(50),nlevel(50),nparent(50)
|
|
integer onlevel(0:10)
|
|
data first/.true./,eps/0.000001/,ntrace/0/
|
|
data level/0/,nmax/0/,space/' '/
|
|
data limtrace/0/,lu/29/,ntimer/1/
|
|
! data limtrace/1000000/,lu/29/,ntimer/1/
|
|
save
|
|
|
|
if(ntimer.eq.0) return
|
|
if(lu.lt.1) lu=6
|
|
if(k.gt.1) go to 40 !Check for "all done" (k>1)
|
|
onlevel(0)=0
|
|
|
|
do n=1,nmax !Check for existing name
|
|
if(name(n).eq.dname) go to 20
|
|
enddo
|
|
|
|
nmax=nmax+1 !This is a new one
|
|
n=nmax
|
|
ncall(n)=0
|
|
on(n)=.false.
|
|
ut(n)=eps
|
|
name(n)=dname
|
|
|
|
20 if(k.eq.0) then !Get start times (k=0)
|
|
if(on(n)) print*,'Error in timer: ',dname,' already on.'
|
|
level=level+1 !Increment the level
|
|
on(n)=.true.
|
|
ut0(n)=etime(tt)
|
|
ncall(n)=ncall(n)+1
|
|
if(ncall(n).gt.1.and.nlevel(n).ne.level) then
|
|
nlevel(n)=-1
|
|
else
|
|
nlevel(n)=level
|
|
endif
|
|
nparent(n)=onlevel(level-1)
|
|
onlevel(level)=n
|
|
|
|
else if(k.eq.1) then !Get stop times and accumulate sums. (k=1)
|
|
if(on(n)) then
|
|
on(n)=.false.
|
|
ut1=etime(tt)
|
|
ut(n)=ut(n)+ut1-ut0(n)
|
|
endif
|
|
level=level-1
|
|
endif
|
|
|
|
ntrace=ntrace+1
|
|
if(ntrace.lt.limtrace) write(28,1020) ntrace,dname,k,level,nparent(n)
|
|
1020 format(i8,': ',a8,3i5)
|
|
return
|
|
|
|
! Write out the timer statistics
|
|
|
|
40 open(lu,file=trim(fname),status='unknown')
|
|
write(lu,1040)
|
|
1040 format(/' name time frac dtime', &
|
|
' dfrac calls level parent'/73('-'))
|
|
|
|
if(k.gt.100) then
|
|
ndiv=k-100
|
|
do i=1,nmax
|
|
ncall(i)=ncall(i)/ndiv
|
|
ut(i)=ut(i)/ndiv
|
|
enddo
|
|
endif
|
|
|
|
total=ut(1)
|
|
sum=0.
|
|
sumf=0.
|
|
do i=1,nmax
|
|
dut(i)=ut(i)
|
|
do j=i,nmax
|
|
if(nparent(j).eq.i) dut(i)=dut(i)-ut(j)
|
|
enddo
|
|
utf=ut(i)/total
|
|
dutf=dut(i)/total
|
|
sum=sum+dut(i)
|
|
sumf=sumf+dutf
|
|
kk=nlevel(i)
|
|
sname=space(1:kk)//name(i)//space(1:8-kk)
|
|
ename=space
|
|
if(i.ge.2) ename=name(nparent(i))
|
|
write(lu,1060) float(i),sname,ut(i),utf,dut(i),dutf, &
|
|
ncall(i),nlevel(i),ename
|
|
1060 format(f4.0,a16,2(f10.2,f6.2),i7,i5,2x,a8)
|
|
enddo
|
|
|
|
write(lu,1070) sum,sumf
|
|
1070 format(/36x,f10.2,f6.2)
|
|
close(lu)
|
|
return
|
|
|
|
entry clockit2(data_dir)
|
|
l1=index(data_dir,char(0))-1
|
|
if(l1.ge.1) data_dir(l1+1:l1+1)='/'
|
|
fname=data_dir(1:l1+1)//'clockit.out'
|
|
return
|
|
|
|
end subroutine clockit
|