[interpreter] Translate exception handlers into graph.

test/cctest/interpreter/test-bytecode-generator.cc

 // Copyright 2015 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/v8.h"
 
 #include "src/compiler.h"
 #include "src/interpreter/bytecode-array-iterator.h"
 #include "src/interpreter/bytecode-generator.h"
 #include "src/interpreter/interpreter.h"
@@ skipping 194 matching lines @@
     CHECK_EQ(CcTest::heap()->empty_fixed_array(), actual->constant_pool());
   } else {
     CHECK_EQ(expected.constant_count, actual->constant_pool()->length());
     for (int i = 0; i < expected.constant_count; i++) {
       CheckConstant(expected.constants[i], actual->constant_pool()->get(i));
     }
   }
   if (expected.handler_count == 0) {
     CHECK_EQ(CcTest::heap()->empty_fixed_array(), actual->handler_table());
   } else {
-    static const int kHTSize = 4;     // see HandlerTable::kRangeEntrySize
-    static const int kHTStart = 0;    // see HandlerTable::kRangeStartIndex
-    static const int kHTEnd = 1;      // see HandlerTable::kRangeEndIndex
-    static const int kHTHandler = 2;  // see HandlerTable::kRangeHandlerIndex
     HandlerTable* table = HandlerTable::cast(actual->handler_table());
-    CHECK_EQ(expected.handler_count * kHTSize, table->length());
+    CHECK_EQ(expected.handler_count, table->NumberOfRangeEntries());
     for (int i = 0; i < expected.handler_count; i++) {
-      int start = Smi::cast(table->get(i * kHTSize + kHTStart))->value();
-      int end = Smi::cast(table->get(i * kHTSize + kHTEnd))->value();
-      int handler = Smi::cast(table->get(i * kHTSize + kHTHandler))->value();
-      CHECK_EQ(expected.handlers[i].start, start);
-      CHECK_EQ(expected.handlers[i].end, end);
-      CHECK_EQ(expected.handlers[i].handler, handler >> 1);
+      CHECK_EQ(expected.handlers[i].start, table->GetRangeStart(i));
+      CHECK_EQ(expected.handlers[i].end, table->GetRangeEnd(i));
+      CHECK_EQ(expected.handlers[i].handler, table->GetRangeHandler(i));
     }
   }
 
   BytecodeArrayIterator iterator(actual);
   int i = 0;
   while (!iterator.done()) {
     int bytecode_index = i++;
     Bytecode bytecode = iterator.current_bytecode();
     if (Bytecodes::ToByte(bytecode) != expected.bytecode[bytecode_index]) {
       std::ostringstream stream;
@@ skipping 7328 matching lines @@
     Handle<BytecodeArray> bytecode_array =
         helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
     CheckBytecodeArrayEqual(snippets[i], bytecode_array);
   }
   FLAG_harmony_do_expressions = old_flag;
 }
 
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8