Implement a hash based look-up to speed up containing address check in large

src/spaces.h

Index: src/spaces.h
===================================================================
--- src/spaces.h	(revision 10961)
+++ src/spaces.h	(working copy)
@@ -31,6 +31,7 @@
 #include "allocation.h"
 #include "list.h"
 #include "log.h"
+#include "hashmap.h"
 
 namespace v8 {
 namespace internal {
@@ -2536,6 +2537,7 @@
   intptr_t size_;  // allocated bytes
   int page_count_;  // number of chunks
   intptr_t objects_size_;  // size of objects
+  HashMap map_;  // speed up containing pointer check

[Vyacheslav Egorov (Chromium), 2012/03/08 11:41:23]

Consider more meaningful name and comment. For example:

// Map MemoryChunk::kAlignment-aligned chunks to large pages covering them.
chunk_map_;  

 
   friend class LargeObjectIterator;