diff options
| author | rhaas <rhaas@c83d129a-5a75-4d5a-9c4d-ed3a5855bf45> | 2012-07-17 17:08:35 +0000 |
|---|---|---|
| committer | rhaas <rhaas@c83d129a-5a75-4d5a-9c4d-ed3a5855bf45> | 2012-07-17 17:08:35 +0000 |
| commit | 44d1685aa97b0161c4699fbbd64557f6d14fde17 (patch) | |
| tree | 67429472bf76f77c4e996099718a0cddeea66fc0 | |
| parent | 96c70bdb58674b6a26a1f6dabf16eaec93794c88 (diff) | |
GRHydro: remove comparison of logical to .true.
I appreciate the effort to make the code compile with gcc by no longer
using integers in place of logicals. I really do. However it seems that
F0RTRAN in its infinite wisdom requires you to write
... .and. mustbisect .eqv. .true.
(note the all important 'v') when testing logicals. I have instead opted
to remove the whole .eqv. term in favor of
... .and. mustbisect
From: Roland Haas <roland.haas@physics.gatech.edu>
git-svn-id: http://svn.einsteintoolkit.org/cactus/EinsteinEvolve/GRHydro/trunk@402 c83d129a-5a75-4d5a-9c4d-ed3a5855bf45
| -rw-r--r-- | src/GRHydro_Con2Prim.F90 | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/GRHydro_Con2Prim.F90 b/src/GRHydro_Con2Prim.F90 index 958d033..9f5e511 100644 --- a/src/GRHydro_Con2Prim.F90 +++ b/src/GRHydro_Con2Prim.F90 @@ -556,7 +556,7 @@ subroutine Con2Prim_pt(handle, dens, sx, sy, sz, tau, rho, velx, vely, & tmp = (utau + pnew + udens)**2 - s2 plow = max(pmin, sqrt(s2) - utau - udens) - if (pnew .lt. plow .or. tmp .le. 0.0d0 .or. mustbisect .eq. .true.) then + if (pnew .lt. plow .or. tmp .le. 0.0d0 .or. mustbisect) then ! Ok, Newton-Raphson ended up finding something unphysical. ! Let's try to find our root via bisection (which converges slower but is more robust) @@ -1039,7 +1039,7 @@ subroutine Con2Prim_pt_hot(cctk_iteration, ii,jj,kk,handle, dens, & tmp = (utau + pnew + udens)**2 - s2 plow = max(pminl, sqrt(s2) - utau - udens) - if (pnew .lt. plow .or. tmp .le. 0.0d0 .or. mustbisect .eq. .true.) then + if (pnew .lt. plow .or. tmp .le. 0.0d0 .or. mustbisect) then ! Ok, Newton-Raphson ended up finding something unphysical. ! Let's try to find our root via bisection (which converges slower but is more robust) |