Fix a potential overflow in BinarySearch, same as Issue 344513004

src/objects-inl.h

Index: src/objects-inl.h
diff --git a/src/objects-inl.h b/src/objects-inl.h
index 83c81690e1ce4191305c150a80696c41b49c80af..6191fe0daa14543f203e6eb5f71331d1393ff63e 100644
--- a/src/objects-inl.h
+++ b/src/objects-inl.h
@@ -2765,7 +2765,7 @@ int BinarySearch(T* array, Name* name, int low, int high, int valid_entries) {
   ASSERT(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();