Fixes slow object pool search on x64.

runtime/vm/assembler_x64.h

Index: runtime/vm/assembler_x64.h
===================================================================
--- runtime/vm/assembler_x64.h	(revision 27303)
+++ runtime/vm/assembler_x64.h	(working copy)
@@ -12,6 +12,7 @@
 #include "platform/assert.h"
 #include "platform/utils.h"
 #include "vm/constants_x64.h"
+#include "vm/hash_map.h"
 
 namespace dart {
 
@@ -837,6 +838,35 @@
   // Patchability of pool entries.
   GrowableArray<Patchability> patchable_pool_entries_;
 
+  // Pair type parameter for DirectChainedHashMap.
+  class ObjIndexPair {
+   public:
+    typedef RawObject* Key;

[Florian Schneider, 2013/09/09 19:03:11]

The hash map contains raw pointers, but won't be visited by GC.

[zra, 2013/09/13 16:49:34]

After discussion with Ivan and fixing up the assertions around the object pool
in https://codereview.chromium.org/23454032/, we concluded that this is safe
because the raw pointers are all for Old objects, and because they are visited
when GC visits the object_pool_ Array. I have added a TODO and WARNING here to
explain.

+    typedef intptr_t Value;
+    typedef ObjIndexPair Pair;
+
+    ObjIndexPair(Key key, Value value) : key_(key), value_(value) { }
+
+    static Key KeyOf(Pair kv) { return kv.key_; }
+
+    static Value ValueOf(Pair kv) { return kv.value_; }
+
+    static intptr_t Hashcode(Key key) {
+      return String::Hash(reinterpret_cast<uint8_t*>(&key), sizeof(&key));
+    }
+
+    static inline bool IsKeyEqual(Pair kv, Key key) {
+      return kv.key_ == key;
+    }
+
+   private:
+    Key key_;
+    Value value_;
+  };
+
+  // Hashmap for fast lookup in object pool.
+  DirectChainedHashMap<ObjIndexPair> object_pool_index_table_;
+
   int prologue_offset_;
 
   class CodeComment : public ZoneAllocated {