48       isolate()->heap()->AllocateBox(*value, pretenure),
 
   57       isolate()->heap()->AllocateFixedArray(size, pretenure),
 
   67       isolate()->heap()->AllocateFixedArrayWithHoles(size, pretenure),
 
   75       isolate()->heap()->AllocateUninitializedFixedArray(size),
 
   85       isolate()->heap()->AllocateUninitializedFixedDoubleArray(size, pretenure),
 
   91     int number_of_int64_entries,
 
   92     int number_of_code_ptr_entries,
 
   93     int number_of_heap_ptr_entries,
 
   94     int number_of_int32_entries) {
 
   95   ASSERT(number_of_int64_entries > 0 || number_of_code_ptr_entries > 0 ||
 
   96          number_of_heap_ptr_entries > 0 || number_of_int32_entries > 0);
 
   99       isolate()->heap()->AllocateConstantPoolArray(number_of_int64_entries,
 
  100                                                    number_of_code_ptr_entries,
 
  101                                                    number_of_heap_ptr_entries,
 
  102                                                    number_of_int32_entries),
 
  108   ASSERT(0 <= at_least_space_for);
 
  117     int at_least_space_for) {
 
  118   ASSERT(0 <= at_least_space_for);
 
  127     int at_least_space_for) {
 
  128   ASSERT(0 <= at_least_space_for);
 
  137   ASSERT(0 <= at_least_space_for);
 
  146     int at_least_space_for,
 
  148   ASSERT(0 <= at_least_space_for);
 
  158   ASSERT(0 <= at_least_space_for);
 
  171   ASSERT(0 <= number_of_descriptors);
 
  174                          isolate(), number_of_descriptors, slack),
 
  180     int deopt_entry_count,
 
  182   ASSERT(deopt_entry_count > 0);
 
  192     int deopt_entry_count,
 
  194   ASSERT(deopt_entry_count > 0);
 
  205                      isolate()->heap()->AllocateAccessorPair(),
 
  212                      isolate()->heap()->AllocateTypeFeedbackInfo(),
 
  251 template<
class StringTableKey>
 
  269       isolate()->heap()->AllocateStringFromOneByte(
string, pretenure),
 
  277       isolate()->heap()->AllocateStringFromUtf8(
string, pretenure),
 
  286       isolate()->heap()->AllocateStringFromTwoByte(
string, pretenure),
 
  295       isolate()->heap()->AllocateRawOneByteString(length, pretenure),
 
  304       isolate()->heap()->AllocateRawTwoByteString(length, pretenure),
 
  310 static inline bool Between(uint32_t character, uint32_t from, uint32_t to) {
 
  312   return character - from <= to - from;
 
  321   if (!Between(c1, 
'0', 
'9') || !Between(c2, 
'0', 
'9')) {
 
  323     StringTable* table = isolate->heap()->string_table();
 
  324     if (table->LookupTwoCharsStringIfExists(c1, c2, &result)) {
 
  334     Handle<SeqOneByteString> str = isolate->factory()->NewRawOneByteString(2);
 
  335     uint8_t* dest = str->GetChars();
 
  336     dest[0] = 
static_cast<uint8_t
>(c1);
 
  337     dest[1] = 
static_cast<uint8_t
>(c2);
 
  340     Handle<SeqTwoByteString> str = isolate->factory()->NewRawTwoByteString(2);
 
  341     uc16* dest = str->GetChars();
 
  349 template<
typename SinkChar, 
typename StringType>
 
  354   SinkChar* sink = result->GetChars();
 
  363       ? cons_ascii_string_map() : cons_string_map();
 
  365                      isolate()->heap()->Allocate(*map, 
NEW_SPACE),
 
  372   int left_length = left->length();
 
  373   if (left_length == 0) 
return right;
 
  374   int right_length = right->length();
 
  375   if (right_length == 0) 
return left;
 
  377   int length = left_length + right_length;
 
  382     return MakeOrFindTwoCharacterString(isolate(), c1, c2);
 
  388     isolate()->ThrowInvalidStringLength();
 
  392   bool left_is_one_byte = left->IsOneByteRepresentation();
 
  393   bool right_is_one_byte = right->IsOneByteRepresentation();
 
  394   bool is_one_byte = left_is_one_byte && right_is_one_byte;
 
  395   bool is_one_byte_data_in_two_byte_string = 
false;
 
  400     is_one_byte_data_in_two_byte_string =
 
  401         left->HasOnlyOneByteChars() && right->HasOnlyOneByteChars();
 
  402     if (is_one_byte_data_in_two_byte_string) {
 
  403       isolate()->counters()->string_add_runtime_ext_to_ascii()->Increment();
 
  418       uint8_t* dest = result->GetChars();
 
  420       const uint8_t* src = left->IsExternalString()
 
  423       for (
int i = 0; i < left_length; i++) *dest++ = src[i];
 
  425       src = right->IsExternalString()
 
  428       for (
int i = 0; i < right_length; i++) *dest++ = src[i];
 
  432     return (is_one_byte_data_in_two_byte_string)
 
  438       (is_one_byte || is_one_byte_data_in_two_byte_string)
 
  446   result->set_length(length);
 
  447   result->set_first(*left, mode);
 
  448   result->set_second(*right, mode);
 
  455   int total_length = first->length() + second->length();
 
  456   if (first->IsOneByteRepresentation() && second->IsOneByteRepresentation()) {
 
  457     return ConcatStringContent<uint8_t>(
 
  460     return ConcatStringContent<uc16>(
 
  468       ? sliced_ascii_string_map() : sliced_string_map();
 
  470                      isolate()->heap()->Allocate(*map, 
NEW_SPACE),
 
  479   if (FLAG_verify_heap) str->StringVerify();
 
  481   ASSERT(begin > 0 || end < str->length());
 
  483   int length = end - begin;
 
  484   if (length <= 0) 
return empty_string();
 
  494     return MakeOrFindTwoCharacterString(isolate(), c1, c2);
 
  498     if (str->IsOneByteRepresentation()) {
 
  501       uint8_t* dest = result->GetChars();
 
  508       uc16* dest = result->GetChars();
 
  517   while (str->IsConsString()) {
 
  519     int split = cons->first()->length();
 
  520     if (split <= offset) {
 
  525     } 
else if (offset + length <= split) {
 
  533   if (str->IsSlicedString()) {
 
  536     offset += slice->offset();
 
  541   ASSERT(str->IsSeqString() || str->IsExternalString());
 
  547   slice->set_length(length);
 
  548   slice->set_parent(*str);
 
  549   slice->set_offset(offset);
 
  558       isolate()->heap()->AllocateExternalStringFromAscii(resource),
 
  567       isolate()->heap()->AllocateExternalStringFromTwoByte(resource),
 
  575       isolate()->heap()->AllocateSymbol(),
 
  583       isolate()->heap()->AllocatePrivateSymbol(),
 
  591       isolate()->heap()->AllocateNativeContext(),
 
  600       isolate()->heap()->AllocateGlobalContext(*
function, *scope_info),
 
  608       isolate()->heap()->AllocateModuleContext(*scope_info),
 
  617       isolate()->heap()->AllocateFunctionContext(length, *
function),
 
  628       isolate()->heap()->AllocateCatchContext(*
function,
 
  641       isolate()->heap()->AllocateWithContext(*
function, *previous, *extension),
 
  651       isolate()->heap()->AllocateBlockContext(*
function,
 
  661       isolate()->heap()->AllocateStruct(type),
 
  667     int aliased_context_slot) {
 
  670   entry->set_aliased_context_slot(aliased_context_slot);
 
  701   Heap* heap = isolate()->heap();
 
  702   int id = heap->last_script_id()->value() + 1;
 
  709   script->set_source(*source);
 
  710   script->set_name(heap->undefined_value());
 
  714   script->set_context_data(heap->undefined_value());
 
  716   script->set_wrapper(*wrapper);
 
  717   script->set_line_ends(heap->undefined_value());
 
  718   script->set_eval_from_shared(heap->undefined_value());
 
  719   script->set_eval_from_instructions_offset(
Smi::FromInt(0));
 
  728                      isolate()->heap()->AllocateForeign(addr, pretenure),
 
  742       isolate()->heap()->AllocateByteArray(length, pretenure),
 
  749                                                 void* external_pointer,
 
  754       isolate()->heap()->AllocateExternalArray(length,
 
  769       isolate()->heap()->AllocateFixedTypedArray(length,
 
  780       isolate()->heap()->AllocateCell(*value),
 
  788       isolate()->heap()->AllocatePropertyCell(),
 
  804       isolate()->heap()->AllocateAllocationSite(),
 
  814       isolate()->heap()->AllocateMap(type, instance_size, elements_kind),
 
  824   if (function->shared()->is_generator()) {
 
  827     new_map = 
handle(native_context->generator_object_prototype_map());
 
  832     ASSERT(object_function->has_initial_map());
 
  838   if (!function->shared()->is_generator()) {
 
  840                                                constructor_string(),
 
  851       isolate(), src->CopyWithPreallocatedFieldDescriptors(), 
Map);
 
  856                              int extra_inobject_properties) {
 
  860   int instance_size_delta = extra_inobject_properties * 
kPointerSize;
 
  861   int max_instance_size_delta =
 
  864   if (extra_inobject_properties > max_extra_properties) {
 
  867     instance_size_delta = max_instance_size_delta;
 
  868     extra_inobject_properties = max_extra_properties;
 
  871   int inobject_properties =
 
  872       copy->inobject_properties() + extra_inobject_properties;
 
  873   copy->set_inobject_properties(inobject_properties);
 
  874   copy->set_unused_property_fields(inobject_properties);
 
  875   copy->set_instance_size(copy->instance_size() + instance_size_delta);
 
  893   ASSERT(isolate()->heap()->InNewSpace(*array));
 
  904                      array->CopySize(new_length, pretenure),
 
  927       isolate()->heap()->AllocateFunction(*function_map,
 
  929                                           isolate()->heap()->the_hole_value(),
 
  939                                             function_info->is_generator());
 
  950       MapForNewFunction(isolate(), function_info),
 
  954     function_info->ResetForNewContext(isolate()->heap()->global_ic_age());
 
  957   result->set_context(*context);
 
  959   int index = function_info->SearchOptimizedCodeMap(context->native_context(),
 
  961   if (!function_info->bound() && index < 0) {
 
  962     int number_of_literals = function_info->num_literals();
 
  964     if (number_of_literals > 0) {
 
  969                     context->native_context());
 
  971     result->set_literals(*literals);
 
  977         function_info->GetLiteralsFromOptimizedCodeMap(index);
 
  978     if (literals != 
NULL) result->set_literals(literals);
 
  979     Code* 
code = function_info->GetCodeFromOptimizedCodeMap(index);
 
  981     result->ReplaceCode(code);
 
  985   if (isolate()->use_crankshaft() &&
 
  987       result->is_compiled() &&
 
  988       !function_info->is_toplevel() &&
 
  989       function_info->allows_lazy_compilation() &&
 
  990       !function_info->optimization_disabled() &&
 
  992     result->MarkForOptimization();
 
 1002       isolate()->heap()->NumberFromDouble(value, pretenure), 
Object);
 
 1010       isolate()->heap()->NumberFromInt32(value, pretenure), 
Object);
 
 1018       isolate()->heap()->NumberFromUint32(value, pretenure), 
Object);
 
 1026       isolate()->heap()->AllocateHeapNumber(value, pretenure), 
HeapNumber);
 
 1033       isolate()->heap()->AllocateJSObjectFromMap(
 
 1034           isolate()->heap()->neander_map()),
 
 1041   return NewError(
"MakeTypeError", message, args);
 
 1046   return NewError(
"$TypeError", message);
 
 1052   return NewError(
"MakeRangeError", message, args);
 
 1057   return NewError(
"$RangeError", message);
 
 1063   return NewError(
"MakeSyntaxError", message, args);
 
 1068   return NewError(
"$SyntaxError", message);
 
 1074   return NewError(
"MakeReferenceError", message, args);
 
 1080   return NewError(
"MakeReferenceError", message, args);
 
 1085   return NewError(
"$ReferenceError", message);
 
 1095   for (
int i = 0; i < args.length(); i++) {
 
 1096     array->set(i, *args[i]);
 
 1100   return result.EscapeFrom(&scope);
 
 1106   return NewError(
"MakeEvalError", message, args);
 
 1112   return NewError(
"MakeError", message, args);
 
 1118   const int kBufferSize = 1000;
 
 1119   char buffer[kBufferSize];
 
 1120   size_t space = kBufferSize;
 
 1121   char* p = &buffer[0];
 
 1125   space -= 
Min(space, strlen(message));
 
 1126   p = &buffer[kBufferSize] - space;
 
 1128   for (
unsigned i = 0; i < 
ARRAY_SIZE(args); i++) {
 
 1138         space -= 
Min(space, strlen(arg.
get()));
 
 1139         p = &buffer[kBufferSize] - space;
 
 1146     buffer[kBufferSize - 1] = 
'\0';
 
 1149   return error_string;
 
 1158       isolate()->js_builtins_object()->GetPropertyNoExceptionThrown(*make_str),
 
 1162   if (!fun_obj->IsJSFunction()) {
 
 1171   bool caught_exception;
 
 1173                                              isolate()->js_builtins_object(),
 
 1182   return NewError(
"$Error", message);
 
 1191                        GetPropertyNoExceptionThrown(*constr)));
 
 1196   bool caught_exception;
 
 1198                                              isolate()->js_builtins_object(),
 
 1210                                         bool force_initial_map) {
 
 1216   function->shared()->set_code(*code);
 
 1217   function->set_code(*code);
 
 1219   if (force_initial_map ||
 
 1224     initial_map->set_prototype(*prototype);
 
 1225     function->set_initial_map(*initial_map);
 
 1226     initial_map->set_constructor(*
function);
 
 1228     ASSERT(!function->has_initial_map());
 
 1229     ASSERT(!function->has_prototype());
 
 1241                                                      bool force_initial_map) {
 
 1247   function->shared()->set_code(*code);
 
 1248   function->set_code(*code);
 
 1250   if (force_initial_map ||
 
 1256     function->set_initial_map(*initial_map);
 
 1257     initial_map->set_constructor(*
function);
 
 1268   function->shared()->set_code(*code);
 
 1269   function->set_code(*code);
 
 1270   ASSERT(!function->has_initial_map());
 
 1271   ASSERT(!function->has_prototype());
 
 1279       isolate()->heap()->AllocateScopeInfo(length),
 
 1286                      isolate()->heap()->AllocateExternal(value),
 
 1296                               int prologue_offset) {
 
 1299                          desc, flags, self_ref, immovable, crankshafted,
 
 1307                      isolate()->heap()->
CopyCode(*code),
 
 1314                      isolate()->heap()->
CopyCode(*code, reloc_info),
 
 1324       isolate()->heap()->AllocateJSObject(*constructor, pretenure), 
JSObject);
 
 1334       isolate()->heap()->AllocateJSObject(*constructor, 
NOT_TENURED, *site),
 
 1343       isolate()->heap()->AllocateJSModule(*context, *scope_info), 
JSModule);
 
 1351                                                 PropertyDetails details) {
 
 1353                      dict->Add(*name, *value, details),
 
 1367   ASSERT(constructor->has_initial_map());
 
 1369   ASSERT(map->is_dictionary_map());
 
 1374   ASSERT(map->NextFreePropertyIndex() == 0);
 
 1378   ASSERT(map->unused_property_fields() == 0);
 
 1379   ASSERT(map->inobject_properties() == 0);
 
 1387   int at_least_space_for = map->NumberOfOwnDescriptors() * 2 + initial_size;
 
 1393   for (
int i = 0; i < map->NumberOfOwnDescriptors(); i++) {
 
 1394     PropertyDetails details = descs->GetDetails(i);
 
 1396     PropertyDetails d = PropertyDetails(details.attributes(), 
CALLBACKS, i + 1);
 
 1400     NameDictionaryAdd(dictionary, name, cell, d);
 
 1405   isolate()->heap()->InitializeJSObjectFromMap(*global, *dictionary, *map);
 
 1409   new_map->set_dictionary_map(
true);
 
 1412   global->set_map(*new_map);
 
 1413   global->set_properties(*dictionary);
 
 1416   ASSERT(global->IsGlobalObject() && !global->HasFastProperties());
 
 1428       isolate()->heap()->AllocateJSObjectFromMap(
 
 1432           allocation_site.
is_null() ? 
NULL : *allocation_site),
 
 1442   if (capacity != 0) {
 
 1446                      isolate()->heap()->AllocateJSArrayAndStorage(
 
 1460   ASSERT(length <= elements->length());
 
 1463       isolate()->heap()->AllocateJSArrayWithElements(*elements,
 
 1476                           isolate()->heap()->AllocateJSArrayStorage(*array,
 
 1485   ASSERT(function->shared()->is_generator());
 
 1491       isolate()->heap()->AllocateJSObjectFromMap(*map),
 
 1498       isolate()->context()->native_context()->array_buffer_fun());
 
 1501       isolate()->heap()->AllocateJSObject(*array_buffer_fun),
 
 1508       isolate()->context()->native_context()->data_view_fun());
 
 1511       isolate()->heap()->AllocateJSObject(*data_view_fun),
 
 1520 #define TYPED_ARRAY_FUN(Type, type, TYPE, ctype, size)                        \ 
 1521     case kExternal##Type##Array:                                              \ 
 1522       return native_context->type##_array_fun(); 
 1525 #undef TYPED_ARRAY_FUN 
 1539       isolate()->heap()->AllocateJSObject(*typed_array_fun_handle),
 
 1548       isolate()->heap()->AllocateJSProxy(*handler, *prototype),
 
 1556       isolate()->heap()->ReinitializeJSReceiver(
 
 1564       isolate()->heap()->ReinitializeJSReceiver(
 
 1571     int number_of_literals,
 
 1576   shared->set_code(*code);
 
 1577   shared->set_scope_info(*scope_info);
 
 1578   int literals_array_size = number_of_literals;
 
 1582   if (number_of_literals > 0) {
 
 1585   shared->set_num_literals(literals_array_size);
 
 1587     shared->set_instance_class_name(isolate()->heap()->Generator_string());
 
 1588     shared->DisableOptimization(kGenerator);
 
 1602                      isolate()->heap()->AllocateJSMessageObject(*type,
 
 1614                      isolate()->heap()->AllocateSharedFunctionInfo(*name),
 
 1636                      dictionary->AtNumberPut(key, *value),
 
 1646                      dictionary->AtNumberPut(key, *value),
 
 1656       isolate()->heap()->AllocateFunction(*isolate()->sloppy_function_map(),
 
 1666   fun->set_context(isolate()->context()->native_context());
 
 1676       ? isolate()->sloppy_function_without_prototype_map()
 
 1677       : isolate()->strict_function_without_prototype_map();
 
 1679                      isolate()->heap()->AllocateFunction(
 
 1691   fun->set_context(isolate()->context()->native_context());
 
 1707 #ifdef ENABLE_DEBUGGER_SUPPORT 
 1727   debug_info->set_shared(*shared);
 
 1728   debug_info->set_original_code(*original_code);
 
 1729   debug_info->set_code(*
code);
 
 1730   debug_info->set_break_points(*break_points);
 
 1733   shared->set_debug_info(*debug_info);
 
 1744       isolate()->heap()->AllocateArgumentsObject(*callee, length), 
JSObject);
 
 1754   if (!obj->instance_template()->IsUndefined()) {
 
 1758     internal_field_count =
 
 1759         Smi::cast(instance_template->internal_field_count())->value();
 
 1766   switch (instance_type) {
 
 1793   result->shared()->set_length(obj->length());
 
 1798     result->shared()->set_instance_class_name(*class_name);
 
 1799     result->shared()->set_name(*class_name);
 
 1805   if (obj->undetectable()) {
 
 1806     map->set_is_undetectable();
 
 1810   if (obj->hidden_prototype()) {
 
 1811     map->set_is_hidden_prototype();
 
 1815   if (obj->needs_access_check()) {
 
 1816     map->set_is_access_check_needed(
true);
 
 1820   if (!obj->named_property_handler()->IsUndefined()) {
 
 1821     map->set_has_named_interceptor();
 
 1823   if (!obj->indexed_property_handler()->IsUndefined()) {
 
 1824     map->set_has_indexed_interceptor();
 
 1828   if (!obj->instance_call_handler()->IsUndefined()) {
 
 1829     map->set_has_instance_call_handler();
 
 1832   result->shared()->set_function_data(*obj);
 
 1833   result->shared()->set_construct_stub(*construct_stub);
 
 1834   result->shared()->DontAdaptArguments();
 
 1838   int max_number_of_additional_properties = 0;
 
 1839   int max_number_of_static_properties = 0;
 
 1842     if (!info->instance_template()->IsUndefined()) {
 
 1845               info->instance_template())->property_accessors();
 
 1846       if (!props->IsUndefined()) {
 
 1849         max_number_of_additional_properties += props_array.
length();
 
 1852     if (!info->property_accessors()->IsUndefined()) {
 
 1853       Object* props = info->property_accessors();
 
 1854       if (!props->IsUndefined()) {
 
 1857         max_number_of_static_properties += props_array.
length();
 
 1860     Object* parent = info->parent_template();
 
 1861     if (parent->IsUndefined()) 
break;
 
 1868   int valid_descriptors = 0;
 
 1870   if (max_number_of_static_properties > 0) {
 
 1876     if (!obj->instance_template()->IsUndefined()) {
 
 1882       if (!props->IsUndefined()) {
 
 1887     if (!obj->property_accessors()->IsUndefined()) {
 
 1900   for (
int i = 0; i < valid_descriptors; i++) {
 
 1905   ASSERT(result->shared()->IsApiFunction());
 
 1913                                         at_least_space_for),
 
 1922   { MaybeObject* maybe_result =
 
 1924     if (!maybe_result->ToObject(&result)) 
return maybe_result;
 
 1931 Handle<MapCache> Factory::AddToMapCache(Handle<Context> context,
 
 1932                                         Handle<FixedArray> keys,
 
 1935                      UpdateMapCacheWith(*context, *keys, *map), MapCache);
 
 1941   if (context->map_cache()->IsUndefined()) {
 
 1944     context->set_map_cache(*new_cache);
 
 1955   AddToMapCache(context, keys, map);
 
 1971   regexp->set_data(*store);
 
 1978                                     int capture_count) {
 
 1991   regexp->set_data(*store);
 
 1998                                 bool* pending_exception) {
 
 2001   Handle<Object> instance_template(desc->instance_template(), isolate());
 
 2002   if (!instance_template->IsUndefined()) {
 
 2008     *pending_exception = 
false;
 
 2015   if (name->Equals(h->undefined_string())) 
return undefined_value();
 
 2016   if (name->Equals(h->nan_string())) 
return nan_value();
 
 2017   if (name->Equals(h->infinity_string())) 
return infinity_value();
 
 2023   return value ? true_value() : false_value();
 
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
Handle< Object > NewEvalError(const char *message, Vector< Handle< Object > > args)
static void SetValueInferType(Handle< PropertyCell > cell, Handle< Object > value)
Handle< ObjectHashTable > NewObjectHashTable(int at_least_space_for, MinimumCapacity capacity_option=USE_DEFAULT_MINIMUM_CAPACITY)
Handle< JSObject > NewFunctionPrototype(Handle< JSFunction > function)
static MUST_USE_RESULT MaybeObject * Allocate(Isolate *isolate, int number_of_deopt_points, PretenureFlag pretenure)
Handle< FixedArray > CopyAndTenureFixedCOWArray(Handle< FixedArray > array)
Handle< JSObject > NewJSObject(Handle< JSFunction > constructor, PretenureFlag pretenure=NOT_TENURED)
Handle< String > NewExternalStringFromAscii(const ExternalAsciiString::Resource *resource)
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 only print modified registers Don t break for ASM_UNIMPLEMENTED_BREAK macros print stack trace when an illegal exception is thrown randomize hashes to avoid predictable hash Fixed seed to use to hash property keys(0 means random)" "(with snapshots this option cannot override the baked-in seed)")  DEFINE_bool(profile_deserialization
static const int kIrregexpMaxRegisterCountIndex
Handle< Context > NewModuleContext(Handle< ScopeInfo > scope_info)
static void EnsureHasInitialMap(Handle< JSFunction > function)
Handle< JSFunction > NewFunctionFromSharedFunctionInfo(Handle< SharedFunctionInfo > function_info, Handle< Context > context, PretenureFlag pretenure=TENURED)
Handle< String > ConcatStringContent(Handle< StringType > result, Handle< String > first, Handle< String > second)
static Handle< Object > TryCall(Handle< JSFunction > func, Handle< Object > receiver, int argc, Handle< Object > argv[], bool *caught_exception)
MUST_USE_RESULT MaybeObject * CopyDropDescriptors()
Handle< FixedTypedArrayBase > NewFixedTypedArray(int length, ExternalArrayType array_type, PretenureFlag pretenure=NOT_TENURED)
Handle< String > InternalizeString(Handle< String > str)
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 map
static int FunctionMapIndex(StrictMode strict_mode, bool is_generator)
Handle< PropertyCell > NewPropertyCell(Handle< Object > value)
static int AppendUnique(Handle< Object > descriptors, Handle< FixedArray > array, int valid_descriptors)
static MapCache * cast(Object *obj)
static void SetPrototype(Handle< JSFunction > function, Handle< Object > value)
Handle< DescriptorArray > NewDescriptorArray(int number_of_descriptors, int slack=0)
void NewJSArrayStorage(Handle< JSArray > array, int length, int capacity, ArrayStorageAllocationMode mode=DONT_INITIALIZE_ARRAY_ELEMENTS)
Handle< SlicedString > NewRawSlicedString(String::Encoding encoding)
Handle< FixedArray > NewFixedArrayWithHoles(int size, PretenureFlag pretenure=NOT_TENURED)
static Smi * FromInt(int value)
Handle< Script > NewScript(Handle< String > source)
Handle< JSFunction > BaseNewFunctionFromSharedFunctionInfo(Handle< SharedFunctionInfo > function_info, Handle< Map > function_map, PretenureFlag pretenure)
static ObjectTemplateInfo * cast(Object *obj)
Handle< String > NewStringFromOneByte(Vector< const uint8_t > str, PretenureFlag pretenure=NOT_TENURED)
static Handle< T > cast(Handle< S > that)
Handle< JSDataView > NewJSDataView()
Handle< Context > NewCatchContext(Handle< JSFunction > function, Handle< Context > previous, Handle< String > name, Handle< Object > thrown_object)
static const int kIrregexpDataSize
static Map * cast(Object *obj)
Handle< DeclaredAccessorDescriptor > NewDeclaredAccessorDescriptor()
kSerializedDataOffset Object
Handle< Symbol > NewPrivateSymbol()
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 only print modified registers Don t break for ASM_UNIMPLEMENTED_BREAK macros print stack trace when an illegal exception is thrown randomize hashes to avoid predictable hash Fixed seed to use to hash property Print the time it takes to deserialize the snapshot testing_bool_flag testing_int_flag string flag tmp file in which to serialize heap Print the time it takes to lazily compile hydrogen code stubs concurrent_recompilation concurrent_sweeping Print usage message
Handle< String > EmergencyNewError(const char *message, Handle< JSArray > args)
Handle< JSArray > NewJSArrayWithElements(Handle< FixedArrayBase > elements, ElementsKind elements_kind, int length, PretenureFlag pretenure=NOT_TENURED)
Handle< Context > NewFunctionContext(int length, Handle< JSFunction > function)
Handle< String > NewFlatConcatString(Handle< String > first, Handle< String > second)
bool marked_for_deoptimization()
static Handle< Object > GetElementNoExceptionThrown(Isolate *isolate, Handle< Object > object, uint32_t index)
static const int kIrregexpASCIICodeIndex
static const int kIrregexpUC16CodeIndex
#define ASSERT(condition)
static const int kIrregexpASCIICodeSavedIndex
static void AppendCallbackDescriptors(Handle< Map > map, Handle< Object > descriptors)
static Handle< Object > SetLocalPropertyIgnoreAttributes(Handle< JSObject > object, Handle< Name > key, Handle< Object > value, PropertyAttributes attributes, ValueType value_type=OPTIMAL_REPRESENTATION, StoreMode mode=ALLOW_AS_CONSTANT, ExtensibilityCheck extensibility_check=PERFORM_EXTENSIBILITY_CHECK)
Handle< JSFunction > NewFunctionWithPrototype(Handle< String > name, InstanceType type, int instance_size, Handle< JSObject > prototype, Handle< Code > code, bool force_initial_map)
const int kPointerSizeLog2
#define CALL_HEAP_FUNCTION_VOID(ISOLATE, FUNCTION_CALL)
static const uint32_t kMaxOneByteCharCodeU
Handle< Object > NewRangeError(const char *message, Vector< Handle< Object > > args)
Handle< JSGeneratorObject > NewJSGeneratorObject(Handle< JSFunction > function)
static const int kSourceIndex
static Handle< Object > SetAccessor(Handle< JSObject > object, Handle< AccessorInfo > info)
static MUST_USE_RESULT MaybeObject * Allocate(Isolate *isolate, int number_of_descriptors, int slack=0)
Handle< Object > NewNumber(double value, PretenureFlag pretenure=NOT_TENURED)
Handle< JSObject > NewArgumentsObject(Handle< Object > callee, int length)
Handle< Code > CopyCode(Handle< Code > code)
Handle< String > NumberToString(Handle< Object > number)
MUST_USE_RESULT MaybeObject * Copy()
ArrayStorageAllocationMode
kSerializedDataOffset kPrototypeTemplateOffset kIndexedPropertyHandlerOffset kInstanceCallHandlerOffset internal_field_count
static Smi * cast(Object *object)
Handle< String > FlattenGetString(Handle< String > string)
Handle< SharedFunctionInfo > NewSharedFunctionInfo(Handle< String > name, int number_of_literals, bool is_generator, Handle< Code > code, Handle< ScopeInfo > scope_info)
Handle< SeededNumberDictionary > DictionaryAtNumberPut(Handle< SeededNumberDictionary >, uint32_t key, Handle< Object > value)
static const int kMinLength
Handle< String > NewStringFromUtf8(Vector< const char > str, PretenureFlag pretenure=NOT_TENURED)
void ConfigureInstance(Handle< FunctionTemplateInfo > desc, Handle< JSObject > instance, bool *pending_exception)
static const int kLiteralNativeContextIndex
Handle< JSObject > NewJSObjectFromMap(Handle< Map > map, PretenureFlag pretenure=NOT_TENURED, bool allocate_properties=true, Handle< AllocationSite > allocation_site=Handle< AllocationSite >::null())
Handle< Map > CopyWithPreallocatedFieldDescriptors(Handle< Map > map)
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 mode(MIPS only)")  DEFINE_string(expose_natives_as
Handle< Map > CopyMap(Handle< Map > map, int extra_inobject_props)
static const int kIrregexpUC16CodeSavedIndex
Handle< JSFunction > NewFunction(Handle< String > name, Handle< Object > prototype)
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
Handle< Object > NewReferenceError(const char *message, Vector< Handle< Object > > args)
Handle< SeqTwoByteString > NewRawTwoByteString(int length, PretenureFlag pretenure=NOT_TENURED)
Handle< JSFunction > NewFunctionWithoutPrototype(Handle< String > name, StrictMode strict_mode)
Handle< PropertyCell > NewPropertyCellWithHole()
STATIC_ASSERT(sizeof(CPURegister)==sizeof(Register))
Handle< JSObject > NewNeanderObject()
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 only print modified registers Don t break for ASM_UNIMPLEMENTED_BREAK macros print stack trace when an illegal exception is thrown randomize hashes to avoid predictable hash Fixed seed to use to hash property Print the time it takes to deserialize the snapshot testing_bool_flag testing_int_flag string flag tmp file in which to serialize heap Print the time it takes to lazily compile hydrogen code stubs concurrent_recompilation concurrent_sweeping Print usage including flags
Handle< ScopeInfo > NewScopeInfo(int length)
Context * native_context()
static bool IsValid(intptr_t value)
#define CALL_HEAP_FUNCTION(ISOLATE, FUNCTION_CALL, TYPE)
void SetRegExpAtomData(Handle< JSRegExp > regexp, JSRegExp::Type type, Handle< String > source, JSRegExp::Flags flags, Handle< Object > match_pattern)
Handle< Object > NewTypeError(const char *message, Vector< Handle< Object > > args)
Handle< String > InternalizeStringWithKey(StringTableKey *key)
Handle< WeakHashTable > NewWeakHashTable(int at_least_space_for)
Handle< Object > ToBoolean(bool value)
static const int kMaxInstanceSize
Handle< ExecutableAccessorInfo > NewExecutableAccessorInfo()
Handle< JSArrayBuffer > NewJSArrayBuffer()
Handle< Object > GlobalConstantFor(Handle< String > name)
static void ConfigureInstance(Isolate *isolate, Handle< Object > instance, Handle< Object > data, bool *exc)
Handle< JSTypedArray > NewJSTypedArray(ExternalArrayType type)
Handle< HeapNumber > NewHeapNumber(double value, PretenureFlag pretenure=NOT_TENURED)
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 code(assertions) for debugging") DEFINE_bool(code_comments
static MUST_USE_RESULT MaybeObject * Allocate(Heap *heap, int at_least_space_for, PretenureFlag pretenure=NOT_TENURED)
Handle< JSObject > NewExternal(void *value)
Handle< String > NewStringFromTwoByte(Vector< const uc16 > str, PretenureFlag pretenure=NOT_TENURED)
Handle< ExternalArray > NewExternalArray(int length, ExternalArrayType array_type, void *external_pointer, PretenureFlag pretenure=NOT_TENURED)
Handle< ByteArray > NewByteArray(int length, PretenureFlag pretenure=NOT_TENURED)
static FunctionTemplateInfo * cast(Object *obj)
Handle< FixedDoubleArray > NewFixedDoubleArray(int size, PretenureFlag pretenure=NOT_TENURED)
Handle< FixedArray > NewFixedArray(int size, PretenureFlag pretenure=NOT_TENURED)
static void EnsureDescriptorSlack(Handle< Map > map, int slack)
Handle< AliasedArgumentsEntry > NewAliasedArgumentsEntry(int aliased_context_slot)
Handle< AllocationSite > NewAllocationSite()
Handle< GlobalObject > NewGlobalObject(Handle< JSFunction > constructor)
static const int kMinLength
Handle< Cell > NewCell(Handle< Object > value)
Handle< DeclaredAccessorInfo > NewDeclaredAccessorInfo()
static const int kIrregexpCaptureCountIndex
Handle< Object > ToObject(Handle< Object > object)
V8_INLINE bool IsUndefined() const 
Handle< Context > NewBlockContext(Handle< JSFunction > function, Handle< Context > previous, Handle< ScopeInfo > scope_info)
Handle< FixedArray > CopyFixedArray(Handle< FixedArray > array)
Vector< const char > CStrVector(const char *data)
i::Code * CreateCode(LocalContext *env)
V8_INLINE bool IsString() const 
Handle< Object > NewNumberFromInt(int32_t value, PretenureFlag pretenure=NOT_TENURED)
Handle< String > NewProperSubString(Handle< String > str, int begin, int end)
Handle< DeoptimizationInputData > NewDeoptimizationInputData(int deopt_entry_count, PretenureFlag pretenure)
Handle< Box > NewBox(Handle< Object > value, PretenureFlag pretenure=NOT_TENURED)
Handle< JSProxy > NewJSProxy(Handle< Object > handler, Handle< Object > prototype)
#define TYPED_ARRAY_FUN(Type, type, TYPE, ctype, size)
Handle< DeoptimizationOutputData > NewDeoptimizationOutputData(int deopt_entry_count, PretenureFlag pretenure)
Handle< Object > NewSyntaxError(const char *message, Handle< JSArray > args)
Handle< String > InternalizeTwoByteString(Vector< const uc16 > str)
static const int kAtomDataSize
static void WriteToFlat(String *source, sinkchar *sink, int from, int to)
static MUST_USE_RESULT MaybeObject * Allocate(Heap *heap, int at_least_space_for, MinimumCapacity capacity_option=USE_DEFAULT_MINIMUM_CAPACITY, PretenureFlag pretenure=NOT_TENURED)
Handle< String > NewExternalStringFromTwoByte(const ExternalTwoByteString::Resource *resource)
Handle< String > InternalizeOneByteString(Vector< const uint8_t > str)
Handle< TypeFeedbackInfo > NewTypeFeedbackInfo()
Handle< T > handle(T *t, Isolate *isolate)
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
Handle< JSFunction > CreateApiFunction(Handle< FunctionTemplateInfo > data, ApiInstanceType type=JavaScriptObject)
Handle< String > LookupSingleCharacterStringFromCode(Isolate *isolate, uint32_t index)
static const int kAtomPatternIndex
Handle< ConstantPoolArray > NewConstantPoolArray(int number_of_int64_entries, int number_of_code_ptr_entries, int number_of_heap_ptr_entries, int number_of_int32_entries)
ElementsKind GetInitialFastElementsKind()
void BecomeJSObject(Handle< JSReceiver > object)
Handle< Symbol > NewSymbol()
Handle< NameDictionary > NewNameDictionary(int at_least_space_for)
Handle< String > InternalizeUtf8String(Vector< const char > str)
bool DebuggerHasBreakPoints()
Handle< JSModule > NewJSModule(Handle< Context > context, Handle< ScopeInfo > scope_info)
Handle< Code > NewCode(const CodeDesc &desc, Code::Flags flags, Handle< Object > self_reference, bool immovable=false, bool crankshafted=false, int prologue_offset=Code::kPrologueOffsetNotSet)
static Handle< T > null()
Handle< SeqOneByteString > NewRawOneByteString(int length, PretenureFlag pretenure=NOT_TENURED)
Handle< Context > NewGlobalContext(Handle< JSFunction > function, Handle< ScopeInfo > scope_info)
Handle< Map > ObjectLiteralMapFromCache(Handle< Context > context, Handle< FixedArray > keys)
Handle< Foreign > NewForeign(Address addr, PretenureFlag pretenure=NOT_TENURED)
Handle< String > Uint32ToString(uint32_t value)
static void StrNCpy(Vector< char > dest, const char *src, size_t n)
Handle< ConstantPoolArray > CopyConstantPoolArray(Handle< ConstantPoolArray > array)
static AccessorInfo * cast(Object *obj)
static const int kHeaderSize
Handle< ConsString > NewRawConsString(String::Encoding encoding)
Handle< FixedDoubleArray > CopyFixedDoubleArray(Handle< FixedDoubleArray > array)
static const int kFlagsIndex
static VisitorId GetVisitorId(int instance_type, int instance_size)
Handle< Context > NewWithContext(Handle< JSFunction > function, Handle< Context > previous, Handle< JSObject > extension)
Local< Object > ToObject() const 
Handle< Struct > NewStruct(InstanceType type)
static const int kTagIndex
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric literals(0o77, 0b11)") DEFINE_bool(harmony_strings
Handle< JSMessageObject > NewJSMessageObject(Handle< String > type, Handle< JSArray > arguments, int start_position, int end_position, Handle< Object > script, Handle< Object > stack_frames)
Handle< String > NewConsString(Handle< String > left, Handle< String > right)
static const int kMaxLength
Handle< Object > NewError(const char *maker, const char *message, Handle< JSArray > args)
void SetRegExpIrregexpData(Handle< JSRegExp > regexp, JSRegExp::Type type, Handle< String > source, JSRegExp::Flags flags, int capture_count)
Handle< AccessorPair > NewAccessorPair()
Handle< Context > NewNativeContext()
Handle< JSObject > NewJSObjectWithMemento(Handle< JSFunction > constructor, Handle< AllocationSite > site)
Handle< FixedArray > NewUninitializedFixedArray(int size)
static const int kEmptyHashField
Handle< FixedArray > CopySizeFixedArray(Handle< FixedArray > array, int new_length, PretenureFlag pretenure=NOT_TENURED)
static const int kUninitializedValue
Handle< Map > NewMap(InstanceType type, int instance_size, ElementsKind elements_kind=TERMINAL_FAST_ELEMENTS_KIND)
static const int kMaxValue
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
Handle< Object > NewNumberFromUint(uint32_t value, PretenureFlag pretenure=NOT_TENURED)
Handle< ObjectHashSet > NewObjectHashSet(int at_least_space_for)
ElementsKind GetHoleyElementsKind(ElementsKind packed_kind)
Handle< UnseededNumberDictionary > NewUnseededNumberDictionary(int at_least_space_for)
Handle< JSArray > NewJSArray(ElementsKind elements_kind, int length, int capacity, ArrayStorageAllocationMode mode=INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE, PretenureFlag pretenure=NOT_TENURED)
void BecomeJSFunction(Handle< JSReceiver > object)
Handle< SeededNumberDictionary > NewSeededNumberDictionary(int at_least_space_for)
static const int kLiteralsPrefixSize
static JSFunction * cast(Object *obj)