v8  3.25.30(node0.11.13)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
allocation.h
Go to the documentation of this file.
1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 
28 #ifndef V8_ALLOCATION_H_
29 #define V8_ALLOCATION_H_
30 
31 #include "globals.h"
32 
33 namespace v8 {
34 namespace internal {
35 
36 // Called when allocation routines fail to allocate.
37 // This function should not return, but should terminate the current
38 // processing.
39 void FatalProcessOutOfMemory(const char* message);
40 
41 // Superclass for classes managed with new & delete.
42 class Malloced {
43  public:
44  void* operator new(size_t size) { return New(size); }
45  void operator delete(void* p) { Delete(p); }
46 
47  static void FatalProcessOutOfMemory();
48  static void* New(size_t size);
49  static void Delete(void* p);
50 };
51 
52 
53 // A macro is used for defining the base class used for embedded instances.
54 // The reason is some compilers allocate a minimum of one word for the
55 // superclass. The macro prevents the use of new & delete in debug mode.
56 // In release mode we are not willing to pay this overhead.
57 
58 #ifdef DEBUG
59 // Superclass for classes with instances allocated inside stack
60 // activations or inside other objects.
61 class Embedded {
62  public:
63  void* operator new(size_t size);
64  void operator delete(void* p);
65 };
66 #define BASE_EMBEDDED : public Embedded
67 #else
68 #define BASE_EMBEDDED
69 #endif
70 
71 
72 // Superclass for classes only using statics.
73 class AllStatic {
74 #ifdef DEBUG
75  public:
76  void* operator new(size_t size);
77  void operator delete(void* p);
78 #endif
79 };
80 
81 
82 template <typename T>
83 T* NewArray(size_t size) {
84  T* result = new T[size];
85  if (result == NULL) Malloced::FatalProcessOutOfMemory();
86  return result;
87 }
88 
89 
90 template <typename T>
91 void DeleteArray(T* array) {
92  delete[] array;
93 }
94 
95 
96 // The normal strdup functions use malloc. These versions of StrDup
97 // and StrNDup uses new and calls the FatalProcessOutOfMemory handler
98 // if allocation fails.
99 char* StrDup(const char* str);
100 char* StrNDup(const char* str, int n);
101 
102 
103 // Allocation policy for allocating in the C free store using malloc
104 // and free. Used as the default policy for lists.
106  public:
107  INLINE(void* New(size_t size)) { return Malloced::New(size); }
108  INLINE(static void Delete(void* p)) { Malloced::Delete(p); }
109 };
110 
111 
112 void* AlignedAlloc(size_t size, size_t alignment);
113 void AlignedFree(void *ptr);
114 
115 } } // namespace v8::internal
116 
117 #endif // V8_ALLOCATION_H_
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Definition: flags.cc:269
static void Delete(void *p)
Definition: allocation.cc:51
static void * New(size_t size)
Definition: allocation.cc:42
INLINE(void *New(size_t size))
Definition: allocation.h:107
char * StrNDup(const char *str, int n)
Definition: allocation.cc:98
static void FatalProcessOutOfMemory()
Definition: allocation.cc:56
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in only print modified registers Don t break for ASM_UNIMPLEMENTED_BREAK macros print stack trace when an illegal exception is thrown randomize hashes to avoid predictable hash Fixed seed to use to hash property Print the time it takes to deserialize the snapshot testing_bool_flag testing_int_flag string flag tmp file in which to serialize heap Print the time it takes to lazily compile hydrogen code stubs concurrent_recompilation concurrent_sweeping Print usage message
Definition: flags.cc:665
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object size
Definition: flags.cc:211
T * NewArray(size_t size)
Definition: allocation.h:83
void FatalProcessOutOfMemory(const char *message)
#define T(name, string, precedence)
Definition: token.cc:48
void AlignedFree(void *ptr)
Definition: allocation.cc:125
void * AlignedAlloc(size_t size, size_t alignment)
Definition: allocation.cc:108
char * StrDup(const char *str)
Definition: allocation.cc:89
void DeleteArray(T *array)
Definition: allocation.h:91
INLINE(static void Delete(void *p))
Definition: allocation.h:108