Reorder switch clauses using newly-introduced execution counters in

src/objects.h

Index: src/objects.h
diff --git a/src/objects.h b/src/objects.h
index 8420069b2627e75384591bb81295871029570efe..b8c95ab197c5f8d57c7a0c6b483d46b1752a322f 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -4492,6 +4492,9 @@ class Code: public HeapObject {
   // [deoptimization_data]: Array containing data for deopt.
   DECL_ACCESSORS(deoptimization_data, FixedArray)
 
+  // [deopt_counter_cells]: Array containing data for deopt counters.
+  DECL_ACCESSORS(deopt_counter_cells, FixedArray)

[Sven Panne, 2013/06/03 07:30:44]

Do we really have space left without going over our size threshold here?

[indutny, 2013/06/03 07:50:53]

Well... no assertion happens for me, so it seems like yes?

[Sven Panne, 2013/06/03 09:22:02]

I was not concerned about correctness, I was concerned about wasting memory
because of alignment constraints.

+
   // [type_feedback_info]: Struct containing type feedback information for
   // unoptimized code. Optimized code can temporarily store the head of
   // the list of the dependent optimized functions during deoptimization.
@@ -4818,8 +4821,10 @@ class Code: public HeapObject {
   static const int kHandlerTableOffset = kRelocationInfoOffset + kPointerSize;
   static const int kDeoptimizationDataOffset =
       kHandlerTableOffset + kPointerSize;
-  static const int kTypeFeedbackInfoOffset =
+  static const int kDeoptCounterCellsOffset =
       kDeoptimizationDataOffset + kPointerSize;
+  static const int kTypeFeedbackInfoOffset =
+      kDeoptCounterCellsOffset + kPointerSize;
   static const int kGCMetadataOffset = kTypeFeedbackInfoOffset + kPointerSize;
   static const int kICAgeOffset =
       kGCMetadataOffset + kPointerSize;