35 #define MAJOR_VERSION 3
36 #define MINOR_VERSION 25
37 #define BUILD_NUMBER 30
41 #define IS_CANDIDATE_VERSION 0
48 #if IS_CANDIDATE_VERSION
49 #define CANDIDATE_STRING " (candidate)"
51 #define CANDIDATE_STRING ""
58 #define VERSION_STRING \
59 S(MAJOR_VERSION) "." S(MINOR_VERSION) "." S(BUILD_NUMBER) "." \
60 S(PATCH_LEVEL) CANDIDATE_STRING
62 #define VERSION_STRING \
63 S(MAJOR_VERSION) "." S(MINOR_VERSION) "." S(BUILD_NUMBER) \
75 const char* Version::soname_ =
SONAME;
80 const char* candidate =
IsCandidate() ?
" (candidate)" :
"";
82 const char* is_simulator =
" SIMULATOR";
84 const char* is_simulator =
"";
85 #endif // USE_SIMULATOR
100 if (soname_ ==
NULL || *soname_ ==
'\0') {
102 const char* candidate =
IsCandidate() ?
"-candidate" :
"";
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
static void GetString(Vector< char > str)
#define IS_CANDIDATE_VERSION
static void GetSONAME(Vector< char > str)
static bool IsCandidate()
static int SNPrintF(Vector< char > str, const char *format,...)