Patch for allowing several V8 instances in process:...

src/spaces-inl.h

 // Copyright 2006-2008 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 159 matching lines @@
   return (Memory::uint32_at(rset_address) & bitmask) != 0;
 }
 
 
 // -----------------------------------------------------------------------------
 // MemoryAllocator
 
 bool MemoryAllocator::IsValidChunk(int chunk_id) {
   if (!IsValidChunkId(chunk_id)) return false;
 
-  ChunkInfo& c = chunks_[chunk_id];
+  MemoryAllocatorData::ChunkInfo& c =
+    v8_context()->memory_allocator_data_.chunks_[chunk_id];
   return (c.address() != NULL) && (c.size() != 0) && (c.owner() != NULL);
 }
 
 
 bool MemoryAllocator::IsValidChunkId(int chunk_id) {
-  return (0 <= chunk_id) && (chunk_id < max_nof_chunks_);
+  return (0 <= chunk_id) &&
+    (chunk_id < v8_context()->memory_allocator_data_.max_nof_chunks_);
 }
 
 
 bool MemoryAllocator::IsPageInSpace(Page* p, PagedSpace* space) {
   ASSERT(p->is_valid());
 
   int chunk_id = GetChunkId(p);
   if (!IsValidChunkId(chunk_id)) return false;
 
-  ChunkInfo& c = chunks_[chunk_id];
+  MemoryAllocatorData::ChunkInfo& c =
+    v8_context()->memory_allocator_data_.chunks_[chunk_id];
   return (c.address() <= p->address()) &&
          (p->address() < c.address() + c.size()) &&
          (space == c.owner());
 }
 
 
 Page* MemoryAllocator::GetNextPage(Page* p) {
   ASSERT(p->is_valid());
   intptr_t raw_addr = p->opaque_header & ~Page::kPageAlignmentMask;
   return Page::FromAddress(AddressFrom<Address>(raw_addr));
@@ skipping 10 matching lines @@
   ASSERT(prev->is_valid());
   int chunk_id = GetChunkId(prev);
   ASSERT_PAGE_ALIGNED(next->address());
   prev->opaque_header = OffsetFrom(next->address()) | chunk_id;
 }
 
 
 PagedSpace* MemoryAllocator::PageOwner(Page* page) {
   int chunk_id = GetChunkId(page);
   ASSERT(IsValidChunk(chunk_id));
-  return chunks_[chunk_id].owner();
+  return v8_context()->memory_allocator_data_.chunks_[chunk_id].owner();
 }
 
 
 bool MemoryAllocator::InInitialChunk(Address address) {
-  if (initial_chunk_ == NULL) return false;
+  MemoryAllocatorData& data = v8_context()->memory_allocator_data_;
+  if (data.initial_chunk_ == NULL) return false;
 
-  Address start = static_cast<Address>(initial_chunk_->address());
-  return (start <= address) && (address < start + initial_chunk_->size());
+  Address start = static_cast<Address>(data.initial_chunk_->address());
+  return (start <= address) && (address < start + data.initial_chunk_->size());
 }
 
 
 #ifdef ENABLE_HEAP_PROTECTION
 
 void MemoryAllocator::Protect(Address start, size_t size) {
   OS::Protect(start, size);
 }
 
 
@@ skipping 117 matching lines @@
 
 bool FreeListNode::IsFreeListNode(HeapObject* object) {
   return object->map() == Heap::raw_unchecked_byte_array_map()
       || object->map() == Heap::raw_unchecked_one_pointer_filler_map()
       || object->map() == Heap::raw_unchecked_two_pointer_filler_map();
 }
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_INL_H_