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 | Typedefs
simulator-mips.h File Reference
#include "allocation.h"
#include "constants-mips.h"
Include dependency graph for simulator-mips.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  SimulatorStack
 

Namespaces

 v8
 
 v8::internal
 

Macros

#define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4)   entry(p0, p1, p2, p3, p4)
 
#define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6, p7, p8)
 
#define TRY_CATCH_FROM_ADDRESS(try_catch_address)   reinterpret_cast<TryCatch*>(try_catch_address)
 
#define GENERATED_CODE_STACK_LIMIT(limit)
 

Typedefs

typedef int(* mips_regexp_matcher )(String *, int, const byte *, const byte *, void *, int *, int, Address, int, Isolate *)
 

Macro Definition Documentation

#define CALL_GENERATED_CODE (   entry,
  p0,
  p1,
  p2,
  p3,
  p4 
)    entry(p0, p1, p2, p3, p4)

Definition at line 49 of file simulator-mips.h.

#define CALL_GENERATED_REGEXP_CODE (   entry,
  p0,
  p1,
  p2,
  p3,
  p4,
  p5,
  p6,
  p7,
  p8 
)
Value:
(FUNCTION_CAST<mips_regexp_matcher>(entry)( \
p0, p1, p2, p3, NULL, p4, p5, p6, p7, p8))
NULL
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: flag-definitions.h:268

Definition at line 60 of file simulator-mips.h.

#define GENERATED_CODE_STACK_LIMIT (   limit)
Value:
(reinterpret_cast<uintptr_t>(this) >= limit ? \
reinterpret_cast<uintptr_t>(this) - limit : 0)

Definition at line 92 of file simulator-mips.h.

#define TRY_CATCH_FROM_ADDRESS (   try_catch_address)    reinterpret_cast<TryCatch*>(try_catch_address)

Definition at line 64 of file simulator-mips.h.