2  * Copyright (C) 2008, 2009 Apple Inc. All rights reserved. 
   4  * Redistribution and use in source and binary forms, with or without 
   5  * modification, are permitted provided that the following conditions 
   8  * 1.  Redistributions of source code must retain the above copyright 
   9  *     notice, this list of conditions and the following disclaimer. 
  10  * 2.  Redistributions in binary form must reproduce the above copyright 
  11  *     notice, this list of conditions and the following disclaimer in the 
  12  *     documentation and/or other materials provided with the distribution. 
  13  * 3.  Neither the name of Apple Computer, Inc. ("Apple") nor the names of 
  14  *     its contributors may be used to endorse or promote products derived 
  15  *     from this software without specific prior written permission. 
  17  * THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY 
  18  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 
  19  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 
  20  * DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY 
  21  * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
  22  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 
  23  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 
  24  * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
  25  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 
  26  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 
  29 #ifndef RegisterFile_h 
  30 #define RegisterFile_h 
  32 #include "Collector.h" 
  33 #include "ExecutableAllocator.h" 
  36 #include <wtf/Noncopyable.h> 
  37 #include <wtf/VMTags.h> 
  47     A register file is a stack of register frames. We represent a register 
  48     frame by its offset from "base", the logical first entry in the register 
  49     file. The bottom-most register frame's offset from base is 0. 
  51     In a program where function "a" calls function "b" (global code -> a -> b), 
  52     the register file might look like this: 
  54     |       global frame     |        call frame      |        call frame      |     spare capacity     | 
  55     ----------------------------------------------------------------------------------------------------- 
  56     |  0 |  1 |  2 |  3 |  4 |  5 |  6 |  7 |  8 |  9 | 10 | 11 | 12 | 13 | 14 |    |    |    |    |    | <-- index in buffer 
  57     ----------------------------------------------------------------------------------------------------- 
  58     | -3 | -2 | -1 |  0 |  1 |  2 |  3 |  4 |  5 |  6 |  7 |  8 |  9 | 10 | 11 |    |    |    |    |    | <-- index relative to base 
  59     ----------------------------------------------------------------------------------------------------- 
  60     |    <-globals | temps-> |  <-vars | temps->      |                 <-vars | 
  63      buffer    base (frame 0)          frame 1                                 frame 2 
  65     Since all variables, including globals, are accessed by negative offsets 
  66     from their register frame pointers, to keep old global offsets correct, new 
  67     globals must appear at the beginning of the register file, shifting base 
  70     If we added one global variable to the register file depicted above, it 
  74     ------------------------------->                                                                    < 
  75     |  0 |  1 |  2 |  3 |  4 |  5 |<                             >snip<                                 > <-- index in buffer 
  76     ------------------------------->                                                                    < 
  77     | -4 | -3 | -2 | -1 |  0 |  1 |<                                                                    > <-- index relative to base 
  78     ------------------------------->                                                                    < 
  79     |         <-globals | temps-> | 
  84     As you can see, global offsets relative to base have stayed constant, 
  85     but base itself has moved. To keep up with possible changes to base, 
  86     clients keep an indirect pointer, so their calculations update 
  87     automatically when base changes. 
  89     For client simplicity, the RegisterFile measures size and capacity from 
  95     class RegisterFile 
: public Noncopyable 
{ 
  98         enum CallFrameHeaderEntry 
{ 
  99             CallFrameHeaderSize 
= 8, 
 104             ReturnPC 
= -5, // This is either an Instruction* or a pointer into JIT generated code stored as an Instruction*. 
 105             ReturnValueRegister 
= -4, 
 108             OptionalCalleeArguments 
= -1, 
 111         enum { ProgramCodeThisRegister 
= -CallFrameHeaderSize 
- 1 }; 
 112         enum { ArgumentsRegister 
= 0 }; 
 114         static const size_t defaultCapacity 
= 524288; 
 115         static const size_t defaultMaxGlobals 
= 8192; 
 116         static const size_t commitSize 
= 1 << 14; 
 117         // Allow 8k of excess registers before we start trying to reap the registerfile 
 118         static const ptrdiff_t maxExcessCapacity 
= 8 * 1024; 
 120         RegisterFile(size_t capacity 
= defaultCapacity
, size_t maxGlobals 
= defaultMaxGlobals
); 
 123         Register
* start() const { return m_start
; } 
 124         Register
* end() const { return m_end
; } 
 125         size_t size() const { return m_end 
- m_start
; } 
 127         void setGlobalObject(JSGlobalObject
* globalObject
) { m_globalObject 
= globalObject
; } 
 128         JSGlobalObject
* globalObject() { return m_globalObject
; } 
 130         bool grow(Register
* newEnd
); 
 131         void shrink(Register
* newEnd
); 
 133         void setNumGlobals(size_t numGlobals
) { m_numGlobals 
= numGlobals
; } 
 134         int numGlobals() const { return m_numGlobals
; } 
 135         size_t maxGlobals() const { return m_maxGlobals
; } 
 137         Register
* lastGlobal() const { return m_start 
- m_numGlobals
; } 
 139         void markGlobals(MarkStack
& markStack
, Heap
* heap
) { heap
->markConservatively(markStack
, lastGlobal(), m_start
); } 
 140         void markCallFrames(MarkStack
& markStack
, Heap
* heap
) { heap
->markConservatively(markStack
, m_start
, m_end
); } 
 143         void releaseExcessCapacity(); 
 145         const size_t m_maxGlobals
; 
 152 #if HAVE(VIRTUALALLOC) 
 153         Register
* m_commitEnd
; 
 156         JSGlobalObject
* m_globalObject
; // The global object whose vars are currently stored in the register file. 
 159     // FIXME: Add a generic getpagesize() to WTF, then move this function to WTF as well. 
 160     inline bool isPageAligned(size_t size
) { return size 
!= 0 && size 
% (8 * 1024) == 0; } 
 162     inline RegisterFile::RegisterFile(size_t capacity
, size_t maxGlobals
) 
 164         , m_maxGlobals(maxGlobals
) 
 171         // Verify that our values will play nice with mmap and VirtualAlloc. 
 172         ASSERT(isPageAligned(maxGlobals
)); 
 173         ASSERT(isPageAligned(capacity
)); 
 175         size_t bufferLength 
= (capacity 
+ maxGlobals
) * sizeof(Register
); 
 177         m_buffer 
= static_cast<Register
*>(mmap(0, bufferLength
, PROT_READ
|PROT_WRITE
, MAP_PRIVATE
|MAP_ANON
, VM_TAG_FOR_REGISTERFILE_MEMORY
, 0)); 
 178         if (m_buffer 
== MAP_FAILED
) { 
 180             fprintf(stderr
, "Could not allocate register file: %d\n", GetLastError()); 
 182             fprintf(stderr
, "Could not allocate register file: %d\n", errno
); 
 186     #elif HAVE(VIRTUALALLOC) 
 187         m_buffer 
= static_cast<Register
*>(VirtualAlloc(0, roundUpAllocationSize(bufferLength
, commitSize
), MEM_RESERVE
, PAGE_READWRITE
)); 
 190             fprintf(stderr
, "Could not allocate register file: %d\n", GetLastError()); 
 192             fprintf(stderr
, "Could not allocate register file: %d\n", errno
); 
 196         size_t committedSize 
= roundUpAllocationSize(maxGlobals 
* sizeof(Register
), commitSize
); 
 197         void* commitCheck 
= VirtualAlloc(m_buffer
, committedSize
, MEM_COMMIT
, PAGE_READWRITE
); 
 198         if (commitCheck 
!= m_buffer
) { 
 200             fprintf(stderr
, "Could not allocate register file: %d\n", GetLastError()); 
 202             fprintf(stderr
, "Could not allocate register file: %d\n", errno
); 
 206         m_commitEnd 
= reinterpret_cast<Register
*>(reinterpret_cast<char*>(m_buffer
) + committedSize
); 
 209          * If neither MMAP nor VIRTUALALLOC are available - use fastMalloc instead. 
 211          * Please note that this is the fallback case, which is non-optimal. 
 212          * If any possible, the platform should provide for a better memory 
 213          * allocation mechanism that allows for "lazy commit" or dynamic 
 214          * pre-allocation, similar to mmap or VirtualAlloc, to avoid waste of memory. 
 216         m_buffer 
= static_cast<Register
*>(fastMalloc(bufferLength
)); 
 218         m_start 
= m_buffer 
+ maxGlobals
; 
 221         m_max 
= m_start 
+ capacity
; 
 224     inline void RegisterFile::shrink(Register
* newEnd
) 
 229         if (m_end 
== m_start 
&& (m_maxUsed 
- m_start
) > maxExcessCapacity
) 
 230             releaseExcessCapacity(); 
 233     inline bool RegisterFile::grow(Register
* newEnd
) 
 241 #if !HAVE(MMAP) && HAVE(VIRTUALALLOC) 
 242         if (newEnd 
> m_commitEnd
) { 
 243             size_t size 
= roundUpAllocationSize(reinterpret_cast<char*>(newEnd
) - reinterpret_cast<char*>(m_commitEnd
), commitSize
); 
 244             if (!VirtualAlloc(m_commitEnd
, size
, MEM_COMMIT
, PAGE_READWRITE
)) { 
 246                 fprintf(stderr
, "Could not allocate register file: %d\n", GetLastError()); 
 248                 fprintf(stderr
, "Could not allocate register file: %d\n", errno
); 
 252             m_commitEnd 
= reinterpret_cast<Register
*>(reinterpret_cast<char*>(m_commitEnd
) + size
); 
 256         if (newEnd 
> m_maxUsed
) 
 265 #endif // RegisterFile_h