ast.cc File Reference
#include "src/ast.h"#include <cmath>#include "src/builtins.h"#include "src/code-stubs.h"#include "src/contexts.h"#include "src/conversions.h"#include "src/hashmap.h"#include "src/parser.h"#include "src/property.h"#include "src/property-details.h"#include "src/scopes.h"#include "src/string-stream.h"#include "src/type-info.h"
Include dependency graph for ast.cc:Go to the source code of this file.
Classes | |
| class | v8::internal::FINAL< kOperandKind, kNumCachedOperands > |
| Source to read snapshot and builtins files from. More... | |
Namespaces | |
| v8 | |
| Debugger support for the V8 JavaScript engine. | |
| v8::internal | |
Macros | |
| #define | DECL_ACCEPT(type) void type::Accept(AstVisitor* v) { v->Visit##type(this); } |
| #define | MAKE_ACCEPT(Name) |
| #define | MAKE_TYPE_CASE(Name) |
| #define | MAKE_TYPE_CASE(Name) |
| #define | MAKE_CASE(Name) |
| #define | REGULAR_NODE(NodeType) |
| #define | REGULAR_NODE_WITH_FEEDBACK_SLOTS(NodeType) |
| #define | DONT_OPTIMIZE_NODE(NodeType) |
| #define | DONT_OPTIMIZE_NODE_WITH_FEEDBACK_SLOTS(NodeType) |
| #define | DONT_TURBOFAN_NODE(NodeType) |
| #define | DONT_SELFOPTIMIZE_NODE(NodeType) |
| #define | DONT_SELFOPTIMIZE_NODE_WITH_FEEDBACK_SLOTS(NodeType) |
| #define | DONT_CACHE_NODE(NodeType) |
Functions | |
| static bool | v8::internal::IsTypeof (Expression *expr) |
| static bool | v8::internal::MatchLiteralCompareTypeof (Expression *left, Token::Value op, Expression *right, Expression **expr, Handle< String > *check) |
| static bool | v8::internal::IsVoidOfLiteral (Expression *expr) |
| static bool | v8::internal::MatchLiteralCompareUndefined (Expression *left, Token::Value op, Expression *right, Expression **expr, Isolate *isolate) |
| static bool | v8::internal::MatchLiteralCompareNull (Expression *left, Token::Value op, Expression *right, Expression **expr) |
| static Interval | v8::internal::ListCaptureRegisters (ZoneList< RegExpTree * > *children) |
| static int | v8::internal::IncreaseBy (int previous, int increase) |
Macro Definition Documentation
◆ DECL_ACCEPT
| #define DECL_ACCEPT | ( | type | ) | void type::Accept(AstVisitor* v) { v->Visit##type(this); } |
◆ DONT_CACHE_NODE
| #define DONT_CACHE_NODE | ( | NodeType | ) |
Value:
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
set_dont_crankshaft_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \
add_flag(kDontCache); \
}
◆ DONT_OPTIMIZE_NODE
| #define DONT_OPTIMIZE_NODE | ( | NodeType | ) |
Value:
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
set_dont_crankshaft_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \
}
◆ DONT_OPTIMIZE_NODE_WITH_FEEDBACK_SLOTS
| #define DONT_OPTIMIZE_NODE_WITH_FEEDBACK_SLOTS | ( | NodeType | ) |
Value:
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_slot_node(node); \
set_dont_crankshaft_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \
}
◆ DONT_SELFOPTIMIZE_NODE
| #define DONT_SELFOPTIMIZE_NODE | ( | NodeType | ) |
Value:
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_flag(kDontSelfOptimize); \
}
◆ DONT_SELFOPTIMIZE_NODE_WITH_FEEDBACK_SLOTS
| #define DONT_SELFOPTIMIZE_NODE_WITH_FEEDBACK_SLOTS | ( | NodeType | ) |
Value:
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_slot_node(node); \
add_flag(kDontSelfOptimize); \
}
◆ DONT_TURBOFAN_NODE
| #define DONT_TURBOFAN_NODE | ( | NodeType | ) |
Value:
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
set_dont_crankshaft_reason(k##NodeType); \
set_dont_turbofan_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \
}
◆ MAKE_ACCEPT
| #define MAKE_ACCEPT | ( | Name | ) |
Value:
return visitor->Visit##Name(this, data); \
}
◆ MAKE_CASE
| #define MAKE_CASE | ( | Name | ) |
Value:
virtual void* Visit##Name(RegExp##Name*, \
void* data) OVERRIDE;
◆ MAKE_TYPE_CASE [1/2]
| #define MAKE_TYPE_CASE | ( | Name | ) |
Value:
RegExp##Name* RegExpTree::As##Name() { \
return NULL; \
} \
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS 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 enable alignment of csp to bytes on platforms which prefer the register to always be NULL
Definition: flag-definitions.h:407
bool Is(Object *obj)
◆ MAKE_TYPE_CASE [2/2]
| #define MAKE_TYPE_CASE | ( | Name | ) |
◆ REGULAR_NODE
| #define REGULAR_NODE | ( | NodeType | ) |
