51 return zone->New(static_cast<int>(
size));
53 void operator delete(
void* pointer,
Zone* zone) { }
54 void operator delete(
void* pointer) { }
64 static const int kNoVar = INT_MIN;
74 void NarrowType(Expression* e,
Bounds b) {
77 void NarrowLowerType(Expression* e,
Type* t) {
81 Effects EnterEffects() {
82 store_ = store_.
Push();
85 void ExitEffects() { store_ = store_.
Pop(); }
87 int parameter_index(
int index) {
return -index - 2; }
88 int stack_local_index(
int index) {
return index; }
90 int variable_index(Variable* var) {
94 return var->IsStackLocal() ? stack_local_index(var->index()) :
95 var->IsParameter() ? parameter_index(var->index()) : kNoVar;
98 void VisitDeclarations(ZoneList<Declaration*>* declarations);
99 void VisitStatements(ZoneList<Statement*>* statements);
101 #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
105 DISALLOW_COPY_AND_ASSIGN(AstTyper);
110 #endif // V8_TYPING_H_
BoundsImpl< ZoneTypeConfig > Bounds
TypeImpl< ZoneTypeConfig > Type
#define DECLARE_VISIT(type)
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
DEFINE_AST_VISITOR_SUBCLASS_MEMBERS()
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
Effects< Var, kNoVar > Top()
static BoundsImpl Both(BoundsImpl b1, BoundsImpl b2, Region *region)
static BoundsImpl NarrowLower(BoundsImpl b, TypeHandle t, Region *region)
static void Run(CompilationInfo *info)