Landing for Justin Schuh....

src/spaces.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 473 matching lines @@
 // The fact that pages for paged spaces are allocated and deallocated in chunks
 // induces a constraint on the order of pages in a linked lists. We say that
 // pages are linked in the chunk-order if and only if every two consecutive
 // pages from the same chunk are consecutive in the linked list.
 //
 
 
 class MemoryAllocator : public AllStatic {
  public:
   // Initializes its internal bookkeeping structures.
-  // Max capacity of the total space.
-  static bool Setup(intptr_t max_capacity);
+  // Max capacity of the total space and executable memory limit.
+  static bool Setup(int max_capacity, int capacity_executable);
 
   // Deletes valid chunks.
   static void TearDown();
 
   // Reserves an initial address range of virtual memory to be split between
   // the two new space semispaces, the old space, and the map space.  The
   // memory is not yet committed or assigned to spaces and split into pages.
   // The initial chunk is unmapped when the memory allocator is torn down.
   // This function should only be called when there is not already a reserved
   // initial chunk (initial_chunk_ should be NULL).  It returns the start
@@ skipping 77 matching lines @@
       MemoryAllocationCallback callback);
 
   // Returns the maximum available bytes of heaps.
   static intptr_t Available() {
     return capacity_ < size_ ? 0 : capacity_ - size_;
   }
 
   // Returns allocated spaces in bytes.
   static intptr_t Size() { return size_; }
 
+  // Returns the maximum available executable bytes of heaps.
+  static int AvailableExecutable() {
+    if (capacity_executable_ < size_executable_) return 0;
+    return capacity_executable_ - size_executable_;
+  }
+
   // Returns allocated executable spaces in bytes.
   static intptr_t SizeExecutable() { return size_executable_; }
 
   // Returns maximum available bytes that the old space can have.
   static intptr_t MaxAvailable() {
     return (Available() / Page::kPageSize) * Page::kObjectAreaSize;
   }
 
   // Links two pages.
   static inline void SetNextPage(Page* prev, Page* next);
@@ skipping 43 matching lines @@
 #ifdef V8_TARGET_ARCH_X64
   static const int kPagesPerChunk = 32;
 #else
   static const int kPagesPerChunk = 16;
 #endif
   static const int kChunkSize = kPagesPerChunk * Page::kPageSize;
 
  private:
   // Maximum space size in bytes.
   static intptr_t capacity_;
+  // Maximum subset of capacity_ that can be executable
+  static intptr_t capacity_executable_;
 
   // Allocated space size in bytes.
   static intptr_t size_;
   // Allocated executable space size in bytes.
   static intptr_t size_executable_;
 
   struct MemoryAllocationCallbackRegistration {
     MemoryAllocationCallbackRegistration(MemoryAllocationCallback callback,
                                          ObjectSpace space,
                                          AllocationAction action)
@@ skipping 1595 matching lines @@
 
  private:
   LargeObjectChunk* current_;
   HeapObjectCallback size_func_;
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_H_