Cache optimized code on shared function info.

src/objects.cc

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 6130 matching lines @@
   if (slack != 0) {
     // Resize the initial map and all maps in its transition tree.
     map->TraverseTransitionTree(&ShrinkInstanceSize, &slack);
     // Give the correct expected_nof_properties to initial maps created later.
     ASSERT(expected_nof_properties() >= slack);
     set_expected_nof_properties(expected_nof_properties() - slack);
   }
 }
 
 
+Code* SharedFunctionInfo::SearchOptimizedCodeMap(Context* global_context) {
+  ASSERT(global_context->IsGlobalContext());
+  Object* value = optimized_code_map();
+  if (!value->IsSmi()) {
+    FixedArray* optimized_code_map = FixedArray::cast(value);
+    int length = optimized_code_map->length();
+    for (int i = 0; i < length; i += 2) {
+      if (optimized_code_map->get(i) == global_context) {
+        return Code::cast(optimized_code_map->get(i + 1));
+      }
+    }
+  }
+
+  return NULL;
+}
+
+
 void ObjectVisitor::VisitCodeTarget(RelocInfo* rinfo) {
   ASSERT(RelocInfo::IsCodeTarget(rinfo->rmode()));
   Object* target = Code::GetCodeFromTargetAddress(rinfo->target_address());
   Object* old_target = target;
   VisitPointer(&target);
   CHECK_EQ(target, old_target);  // VisitPointer doesn't change Code* *target.
 }
 
 
 void ObjectVisitor::VisitCodeEntry(Address entry_address) {
@@ skipping 186 matching lines @@
     if (FLAG_print_code_verbose) {
       PrintF(out, "  %s {count=%d}\n", Translation::StringFor(opcode),
              frame_count);
     }
 
     for (int i = 0; i < frame_count; ++i) {
       opcode = static_cast<Translation::Opcode>(iterator.Next());
       ASSERT(Translation::FRAME == opcode);
       int ast_id = iterator.Next();
       int function_id = iterator.Next();
-      JSFunction* function =
-          JSFunction::cast(LiteralArray()->get(function_id));
       unsigned height = iterator.Next();
       if (FLAG_print_code_verbose) {
         PrintF(out, "%24s  %s {ast_id=%d, function=",
                "", Translation::StringFor(opcode), ast_id);
-        function->PrintName(out);
+        if (function_id != Translation::kSelfLiteralId) {
+          Object* function = LiteralArray()->get(function_id);
+          JSFunction::cast(function)->PrintName(out);
+        } else {
+          PrintF(out, "<self>");
+        }
         PrintF(out, ", height=%u}\n", height);
       }
 
-      // Size of translation is height plus all incoming arguments including
-      // receiver.
-      int size = height + function->shared()->formal_parameter_count() + 1;
-      command_count += size;
-      for (int j = 0; j < size; ++j) {
+      while (iterator.HasNext()) {
         opcode = static_cast<Translation::Opcode>(iterator.Next());
+        if (opcode == Translation::FRAME
+            || opcode == Translation::BEGIN) {
+          iterator.Undo();
+          break;
+        }
+
+        command_count++;
+
         if (FLAG_print_code_verbose) {
           PrintF(out, "%24s    %s ", "", Translation::StringFor(opcode));
         }
 
         if (opcode == Translation::DUPLICATE) {
           opcode = static_cast<Translation::Opcode>(iterator.Next());
           if (FLAG_print_code_verbose) {
             PrintF(out, "%s ", Translation::StringFor(opcode));
           }
-          --j;  // Two commands share the same frame index.
         }
 
         switch (opcode) {
           case Translation::BEGIN:
           case Translation::FRAME:
           case Translation::DUPLICATE:
             UNREACHABLE();
             break;
 
           case Translation::REGISTER: {
@@ skipping 3894 matching lines @@
   if (break_point_objects()->IsUndefined()) return 0;
   // Single beak point.
   if (!break_point_objects()->IsFixedArray()) return 1;
   // Multiple break points.
   return FixedArray::cast(break_point_objects())->length();
 }
 #endif
 
 
 } }  // namespace v8::internal