xref: /phasta/phSolver/compressible/tnanqe.f (revision 595995161822a203c8467e0e4a253d7bd7d6df32)
1      subroutine tnanqe (u, n, arrname)
2
3      include "common.h"
4
5      dimension   u(npro,n),rnan(2)
6      character*8 arrname
7
8      nnanq = 0
9      nlarge=0
10      DO j = 1,n
11	DO i = 1,npro
12          if(abs(u(i,j)).gt.1.0e10)  nlarge=nlarge+1
13	  IF (u(i,j) .ne. u(i,j)) then
14	    write(*,*) myrank, i,j
15             nnanq = nnanq + 1
16             u(i,j)=9.876543e21
17	endif
18	ENDDO
19      ENDDO
20        rnan(1)=nnanq
21        rnan(2)=nlarge
22        call sumgatN(rnan,2,summed,1)
23      if (summed.ge.1) then
24	do i=1,npro
25	write(8+myrank,245) (u(i,j), j=1,n)
26	enddo
27	call error('tnanqe  ',arrname,nnanq)
28      endif
29245   format(10(e14.7,2x))
30      return
31      end
32