Fix a potential overflow of binary search

src/objects-inl.h

Index: src/objects-inl.h
diff --git a/src/objects-inl.h b/src/objects-inl.h
index 5b3c38e1e2958326a9ecff327c2f7f7227430b88..85b9835417e1619c1321ab1d629154ebcbdc3bb1 100644
--- a/src/objects-inl.h
+++ b/src/objects-inl.h
@@ -2784,7 +2784,7 @@ int BinarySearch(T* array, Name* name, int low, int high, int valid_entries,
   DCHECK(low <= high);
 
   while (low != high) {
-    int mid = (low + high) / 2;
+    int mid = low + (high - low) / 2;
     Name* mid_name = array->GetSortedKey(mid);
     uint32_t mid_hash = mid_name->Hash();