[runtime] Simplify handler table lookup semantics.

src/deoptimizer.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/deoptimizer.h"
 
 #include <memory>
 
 #include "src/accessors.h"
 #include "src/ast/prettyprinter.h"
@@ skipping 624 matching lines @@
           HandlerTable::cast(non_optimized_code->handler_table());
       DCHECK_EQ(0, table->NumberOfRangeEntries());
 #endif
       break;
     }
     case TranslatedFrame::kInterpretedFunction: {
       int bytecode_offset = translated_frame->node_id().ToInt();
       JSFunction* function =
           JSFunction::cast(translated_frame->begin()->GetRawValue());
       BytecodeArray* bytecode = function->shared()->bytecode_array();
-      return bytecode->LookupRangeInHandlerTable(bytecode_offset, data_out,
-                                                 nullptr);
+      HandlerTable* table = HandlerTable::cast(bytecode->handler_table());
+      return table->LookupRange(bytecode_offset, data_out, nullptr);
     }
     default:
       break;
   }
   return -1;
 }
 
 }  // namespace
 
 // We rely on this function not causing a GC.  It is called from generated code
@@ skipping 3354 matching lines @@
       CHECK(value_info->IsMaterializedObject());
 
       value_info->value_ =
           Handle<Object>(previously_materialized_objects->get(i), isolate_);
     }
   }
 }
 
 }  // namespace internal
 }  // namespace v8