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
Data Structures | Namespaces | Macros | Enumerations | Functions
spaces.h File Reference
#include "allocation.h"
#include "hashmap.h"
#include "list.h"
#include "log.h"
#include "platform/mutex.h"
#include "v8utils.h"
Include dependency graph for spaces.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  MarkBit
 
class  Bitmap
 
class  Bitmap::CellPrinter
 
class  MemoryChunk
 
class  Page
 
class  LargePage
 
class  Space
 
class  CodeRange
 
class  SkipList
 
class  MemoryAllocator
 
class  ObjectIterator
 
class  HeapObjectIterator
 
class  BASE_EMBEDDED< Visitor >
 
class  AllocationInfo
 
class  BASE_EMBEDDED< Visitor >
 
class  FreeListNode
 
class  FreeListCategory
 
class  FreeList
 
class  PagedSpace
 
struct  PagedSpace::SizeStats
 
class  BASE_EMBEDDED< Visitor >
 
class  HistogramInfo
 
class  NewSpacePage
 
class  SemiSpace
 
class  SemiSpaceIterator
 
class  BASE_EMBEDDED< Visitor >
 
class  NewSpace
 
class  OldSpace
 
class  MapSpace
 
class  CellSpace
 
class  PropertyCellSpace
 
class  LargeObjectSpace
 
class  LargeObjectIterator
 
class  BASE_EMBEDDED< Visitor >
 

Namespaces

 v8
 
 v8::internal
 

Macros

#define ASSERT_PAGE_ALIGNED(address)   ASSERT((OffsetFrom(address) & Page::kPageAlignmentMask) == 0)
 
#define ASSERT_OBJECT_ALIGNED(address)   ASSERT((OffsetFrom(address) & kObjectAlignmentMask) == 0)
 
#define ASSERT_OBJECT_SIZE(size)   ASSERT((0 < size) && (size <= Page::kMaxRegularHeapObjectSize))
 
#define ASSERT_PAGE_OFFSET(offset)
 
#define ASSERT_MAP_PAGE_INDEX(index)   ASSERT((0 <= index) && (index <= MapSpace::kMaxMapPageIndex))
 
#define FRAGMENTATION_STATS_ACCESSORS(type, name)
 
#define ASSERT_SEMISPACE_ALLOCATION_INFO(info, space)
 

Enumerations

enum  SemiSpaceId { kFromSpace = 0, kToSpace = 1 }
 

Functions

 STATIC_CHECK (sizeof(MemoryChunk)<=MemoryChunk::kHeaderSize)
 
 STATIC_CHECK (sizeof(Page)<=MemoryChunk::kHeaderSize)
 
 STATIC_CHECK (sizeof(LargePage)<=MemoryChunk::kHeaderSize)
 

Macro Definition Documentation

#define ASSERT_MAP_PAGE_INDEX (   index)    ASSERT((0 <= index) && (index <= MapSpace::kMaxMapPageIndex))

Definition at line 112 of file spaces.h.

#define ASSERT_OBJECT_ALIGNED (   address)    ASSERT((OffsetFrom(address) & kObjectAlignmentMask) == 0)

Definition at line 102 of file spaces.h.

Referenced by SeqString::Truncate().

#define ASSERT_OBJECT_SIZE (   size)    ASSERT((0 < size) && (size <= Page::kMaxRegularHeapObjectSize))

Definition at line 105 of file spaces.h.

Referenced by v8::internal::RUNTIME_FUNCTION().

#define ASSERT_PAGE_ALIGNED (   address)    ASSERT((OffsetFrom(address) & Page::kPageAlignmentMask) == 0)

Definition at line 99 of file spaces.h.

#define ASSERT_PAGE_OFFSET (   offset)
Value:
ASSERT((Page::kObjectStartOffset <= offset) \
&& (offset <= Page::kPageSize))
ASSERT
#define ASSERT(condition)
Definition: checks.h:329

Definition at line 108 of file spaces.h.

Referenced by Page::OffsetToAddress().

#define ASSERT_SEMISPACE_ALLOCATION_INFO (   info,
  space 
)
Value:
SLOW_ASSERT((space).page_low() <= (info).top() \
&& (info).top() <= (space).page_high() \
&& (info).limit() <= (space).page_high())
SLOW_ASSERT
#define SLOW_ASSERT(condition)
Definition: checks.h:306
info
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 info
Definition: flag-definitions.h:316

Definition at line 2690 of file spaces.h.

Referenced by NewSpace::Grow(), NewSpace::Shrink(), and NewSpace::UpdateInlineAllocationLimit().

#define FRAGMENTATION_STATS_ACCESSORS (   type,
  name 
)
Value:
type name() { return name##_; } \
void set_##name(type name) { name##_ = name; } \
void add_##name(type name) { name##_ += name; }
name
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 name
Definition: flag-definitions.h:504
_
#define _
Definition: mark-compact.cc:3681

Definition at line 846 of file spaces.h.