From c72b32f6ea026250f8dd07389dd4c44cbc9a9169 Mon Sep 17 00:00:00 2001
From: Weiqun Zhang <weiqunzhang@lbl.gov>
Date: Tue, 27 Sep 2022 21:23:15 -0700
Subject: [PATCH] Fix int overflow in amrex::bisect

Change from (lo+hi)/2 to lo+(hi-lo)/2.  Although it's very unlikely, it's
possible (lo+hi), where both lo and hi are integers, could overflow.
---
 Src/Base/AMReX_Algorithm.H | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Src/Base/AMReX_Algorithm.H b/Src/Base/AMReX_Algorithm.H
index 18c9b59b28b..65a5f8cb763 100644
--- a/Src/Base/AMReX_Algorithm.H
+++ b/Src/Base/AMReX_Algorithm.H
@@ -145,7 +145,7 @@ namespace amrex
     AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
     I bisect (T const* d, I lo, I hi, T const& v) {
         while (lo <= hi) {
-            int mid = (lo+hi)/2;
+            int mid = lo + (hi-lo)/2;
             if (v >= d[mid] && v < d[mid+1]) {
                 return mid;
             } else if (v < d[mid]) {