6376579f4d
R=dslomov@chromium.org Review URL: https://codereview.chromium.org/238543004 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@20761 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2031 lines
68 KiB
C++
2031 lines
68 KiB
C++
// Copyright 2014 the V8 project authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
#include "factory.h"
|
|
|
|
#include "isolate-inl.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
Handle<Box> Factory::NewBox(Handle<Object> value) {
|
|
Handle<Box> result = Handle<Box>::cast(NewStruct(BOX_TYPE));
|
|
result->set_value(*value);
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<FixedArray> Factory::NewFixedArray(int size, PretenureFlag pretenure) {
|
|
ASSERT(0 <= size);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateFixedArray(size, pretenure),
|
|
FixedArray);
|
|
}
|
|
|
|
|
|
Handle<FixedArray> Factory::NewFixedArrayWithHoles(int size,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(0 <= size);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateFixedArrayWithFiller(size,
|
|
pretenure,
|
|
*the_hole_value()),
|
|
FixedArray);
|
|
}
|
|
|
|
|
|
Handle<FixedArray> Factory::NewUninitializedFixedArray(int size) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateUninitializedFixedArray(size),
|
|
FixedArray);
|
|
}
|
|
|
|
|
|
Handle<FixedDoubleArray> Factory::NewFixedDoubleArray(int size,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(0 <= size);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateUninitializedFixedDoubleArray(size, pretenure),
|
|
FixedDoubleArray);
|
|
}
|
|
|
|
|
|
Handle<FixedDoubleArray> Factory::NewFixedDoubleArrayWithHoles(
|
|
int size,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(0 <= size);
|
|
Handle<FixedDoubleArray> array = NewFixedDoubleArray(size, pretenure);
|
|
for (int i = 0; i < size; ++i) {
|
|
array->set_the_hole(i);
|
|
}
|
|
return array;
|
|
}
|
|
|
|
|
|
Handle<ConstantPoolArray> Factory::NewConstantPoolArray(
|
|
int number_of_int64_entries,
|
|
int number_of_code_ptr_entries,
|
|
int number_of_heap_ptr_entries,
|
|
int number_of_int32_entries) {
|
|
ASSERT(number_of_int64_entries > 0 || number_of_code_ptr_entries > 0 ||
|
|
number_of_heap_ptr_entries > 0 || number_of_int32_entries > 0);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateConstantPoolArray(number_of_int64_entries,
|
|
number_of_code_ptr_entries,
|
|
number_of_heap_ptr_entries,
|
|
number_of_int32_entries),
|
|
ConstantPoolArray);
|
|
}
|
|
|
|
|
|
Handle<NameDictionary> Factory::NewNameDictionary(int at_least_space_for) {
|
|
ASSERT(0 <= at_least_space_for);
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
NameDictionary::Allocate(isolate()->heap(),
|
|
at_least_space_for),
|
|
NameDictionary);
|
|
}
|
|
|
|
|
|
Handle<SeededNumberDictionary> Factory::NewSeededNumberDictionary(
|
|
int at_least_space_for) {
|
|
ASSERT(0 <= at_least_space_for);
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
SeededNumberDictionary::Allocate(isolate()->heap(),
|
|
at_least_space_for),
|
|
SeededNumberDictionary);
|
|
}
|
|
|
|
|
|
Handle<UnseededNumberDictionary> Factory::NewUnseededNumberDictionary(
|
|
int at_least_space_for) {
|
|
ASSERT(0 <= at_least_space_for);
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
UnseededNumberDictionary::Allocate(isolate()->heap(),
|
|
at_least_space_for),
|
|
UnseededNumberDictionary);
|
|
}
|
|
|
|
|
|
Handle<OrderedHashSet> Factory::NewOrderedHashSet() {
|
|
return OrderedHashSet::Allocate(isolate(), 4);
|
|
}
|
|
|
|
|
|
Handle<OrderedHashMap> Factory::NewOrderedHashMap() {
|
|
return OrderedHashMap::Allocate(isolate(), 4);
|
|
}
|
|
|
|
|
|
Handle<ObjectHashTable> Factory::NewObjectHashTable(
|
|
int at_least_space_for,
|
|
MinimumCapacity capacity_option) {
|
|
ASSERT(0 <= at_least_space_for);
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
ObjectHashTable::Allocate(isolate()->heap(),
|
|
at_least_space_for,
|
|
capacity_option),
|
|
ObjectHashTable);
|
|
}
|
|
|
|
|
|
Handle<WeakHashTable> Factory::NewWeakHashTable(int at_least_space_for) {
|
|
ASSERT(0 <= at_least_space_for);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
WeakHashTable::Allocate(isolate()->heap(),
|
|
at_least_space_for,
|
|
USE_DEFAULT_MINIMUM_CAPACITY,
|
|
TENURED),
|
|
WeakHashTable);
|
|
}
|
|
|
|
|
|
Handle<DeoptimizationInputData> Factory::NewDeoptimizationInputData(
|
|
int deopt_entry_count,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(deopt_entry_count > 0);
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
DeoptimizationInputData::Allocate(isolate(),
|
|
deopt_entry_count,
|
|
pretenure),
|
|
DeoptimizationInputData);
|
|
}
|
|
|
|
|
|
Handle<DeoptimizationOutputData> Factory::NewDeoptimizationOutputData(
|
|
int deopt_entry_count,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(deopt_entry_count > 0);
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
DeoptimizationOutputData::Allocate(isolate(),
|
|
deopt_entry_count,
|
|
pretenure),
|
|
DeoptimizationOutputData);
|
|
}
|
|
|
|
|
|
Handle<AccessorPair> Factory::NewAccessorPair() {
|
|
Handle<AccessorPair> accessors =
|
|
Handle<AccessorPair>::cast(NewStruct(ACCESSOR_PAIR_TYPE));
|
|
accessors->set_getter(*the_hole_value(), SKIP_WRITE_BARRIER);
|
|
accessors->set_setter(*the_hole_value(), SKIP_WRITE_BARRIER);
|
|
accessors->set_access_flags(Smi::FromInt(0), SKIP_WRITE_BARRIER);
|
|
return accessors;
|
|
}
|
|
|
|
|
|
Handle<TypeFeedbackInfo> Factory::NewTypeFeedbackInfo() {
|
|
Handle<TypeFeedbackInfo> info =
|
|
Handle<TypeFeedbackInfo>::cast(NewStruct(TYPE_FEEDBACK_INFO_TYPE));
|
|
info->initialize_storage();
|
|
info->set_feedback_vector(*empty_fixed_array(), SKIP_WRITE_BARRIER);
|
|
return info;
|
|
}
|
|
|
|
|
|
// Internalized strings are created in the old generation (data space).
|
|
Handle<String> Factory::InternalizeUtf8String(Vector<const char> string) {
|
|
Utf8StringKey key(string, isolate()->heap()->HashSeed());
|
|
return InternalizeStringWithKey(&key);
|
|
}
|
|
|
|
|
|
// Internalized strings are created in the old generation (data space).
|
|
Handle<String> Factory::InternalizeString(Handle<String> string) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->InternalizeString(*string),
|
|
String);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::InternalizeOneByteString(Vector<const uint8_t> string) {
|
|
OneByteStringKey key(string, isolate()->heap()->HashSeed());
|
|
return InternalizeStringWithKey(&key);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::InternalizeOneByteString(
|
|
Handle<SeqOneByteString> string, int from, int length) {
|
|
SubStringKey<uint8_t> key(string, from, length);
|
|
return InternalizeStringWithKey(&key);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::InternalizeTwoByteString(Vector<const uc16> string) {
|
|
TwoByteStringKey key(string, isolate()->heap()->HashSeed());
|
|
return InternalizeStringWithKey(&key);
|
|
}
|
|
|
|
|
|
template<class StringTableKey>
|
|
Handle<String> Factory::InternalizeStringWithKey(StringTableKey* key) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->InternalizeStringWithKey(key),
|
|
String);
|
|
}
|
|
|
|
|
|
template Handle<String> Factory::InternalizeStringWithKey<
|
|
SubStringKey<uint8_t> > (SubStringKey<uint8_t>* key);
|
|
template Handle<String> Factory::InternalizeStringWithKey<
|
|
SubStringKey<uint16_t> > (SubStringKey<uint16_t>* key);
|
|
|
|
|
|
Handle<String> Factory::NewStringFromOneByte(Vector<const uint8_t> string,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateStringFromOneByte(string, pretenure),
|
|
String);
|
|
}
|
|
|
|
Handle<String> Factory::NewStringFromUtf8(Vector<const char> string,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateStringFromUtf8(string, pretenure),
|
|
String);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::NewStringFromTwoByte(Vector<const uc16> string,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateStringFromTwoByte(string, pretenure),
|
|
String);
|
|
}
|
|
|
|
|
|
MaybeHandle<SeqOneByteString> Factory::NewRawOneByteString(
|
|
int length, PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateRawOneByteString(length, pretenure),
|
|
SeqOneByteString);
|
|
}
|
|
|
|
|
|
MaybeHandle<SeqTwoByteString> Factory::NewRawTwoByteString(
|
|
int length, PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateRawTwoByteString(length, pretenure),
|
|
SeqTwoByteString);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::LookupSingleCharacterStringFromCode(uint32_t index) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->LookupSingleCharacterStringFromCode(index),
|
|
String);
|
|
}
|
|
|
|
|
|
// Returns true for a character in a range. Both limits are inclusive.
|
|
static inline bool Between(uint32_t character, uint32_t from, uint32_t to) {
|
|
// This makes uses of the the unsigned wraparound.
|
|
return character - from <= to - from;
|
|
}
|
|
|
|
|
|
static inline Handle<String> MakeOrFindTwoCharacterString(Isolate* isolate,
|
|
uint16_t c1,
|
|
uint16_t c2) {
|
|
// Numeric strings have a different hash algorithm not known by
|
|
// LookupTwoCharsStringIfExists, so we skip this step for such strings.
|
|
if (!Between(c1, '0', '9') || !Between(c2, '0', '9')) {
|
|
String* result;
|
|
StringTable* table = isolate->heap()->string_table();
|
|
if (table->LookupTwoCharsStringIfExists(c1, c2, &result)) {
|
|
return handle(result);
|
|
}
|
|
}
|
|
|
|
// Now we know the length is 2, we might as well make use of that fact
|
|
// when building the new string.
|
|
if (static_cast<unsigned>(c1 | c2) <= String::kMaxOneByteCharCodeU) {
|
|
// We can do this.
|
|
ASSERT(IsPowerOf2(String::kMaxOneByteCharCodeU + 1)); // because of this.
|
|
Handle<SeqOneByteString> str =
|
|
isolate->factory()->NewRawOneByteString(2).ToHandleChecked();
|
|
uint8_t* dest = str->GetChars();
|
|
dest[0] = static_cast<uint8_t>(c1);
|
|
dest[1] = static_cast<uint8_t>(c2);
|
|
return str;
|
|
} else {
|
|
Handle<SeqTwoByteString> str =
|
|
isolate->factory()->NewRawTwoByteString(2).ToHandleChecked();
|
|
uc16* dest = str->GetChars();
|
|
dest[0] = c1;
|
|
dest[1] = c2;
|
|
return str;
|
|
}
|
|
}
|
|
|
|
|
|
template<typename SinkChar, typename StringType>
|
|
Handle<String> ConcatStringContent(Handle<StringType> result,
|
|
Handle<String> first,
|
|
Handle<String> second) {
|
|
DisallowHeapAllocation pointer_stays_valid;
|
|
SinkChar* sink = result->GetChars();
|
|
String::WriteToFlat(*first, sink, 0, first->length());
|
|
String::WriteToFlat(*second, sink + first->length(), 0, second->length());
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<ConsString> Factory::NewRawConsString(String::Encoding encoding) {
|
|
Handle<Map> map = (encoding == String::ONE_BYTE_ENCODING)
|
|
? cons_ascii_string_map() : cons_string_map();
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->Allocate(*map, NEW_SPACE),
|
|
ConsString);
|
|
}
|
|
|
|
|
|
MaybeHandle<String> Factory::NewConsString(Handle<String> left,
|
|
Handle<String> right) {
|
|
int left_length = left->length();
|
|
if (left_length == 0) return right;
|
|
int right_length = right->length();
|
|
if (right_length == 0) return left;
|
|
|
|
int length = left_length + right_length;
|
|
|
|
if (length == 2) {
|
|
uint16_t c1 = left->Get(0);
|
|
uint16_t c2 = right->Get(0);
|
|
return MakeOrFindTwoCharacterString(isolate(), c1, c2);
|
|
}
|
|
|
|
// Make sure that an out of memory exception is thrown if the length
|
|
// of the new cons string is too large.
|
|
if (length > String::kMaxLength || length < 0) {
|
|
return isolate()->Throw<String>(
|
|
isolate()->factory()->NewInvalidStringLengthError());
|
|
}
|
|
|
|
bool left_is_one_byte = left->IsOneByteRepresentation();
|
|
bool right_is_one_byte = right->IsOneByteRepresentation();
|
|
bool is_one_byte = left_is_one_byte && right_is_one_byte;
|
|
bool is_one_byte_data_in_two_byte_string = false;
|
|
if (!is_one_byte) {
|
|
// At least one of the strings uses two-byte representation so we
|
|
// can't use the fast case code for short ASCII strings below, but
|
|
// we can try to save memory if all chars actually fit in ASCII.
|
|
is_one_byte_data_in_two_byte_string =
|
|
left->HasOnlyOneByteChars() && right->HasOnlyOneByteChars();
|
|
if (is_one_byte_data_in_two_byte_string) {
|
|
isolate()->counters()->string_add_runtime_ext_to_ascii()->Increment();
|
|
}
|
|
}
|
|
|
|
// If the resulting string is small make a flat string.
|
|
if (length < ConsString::kMinLength) {
|
|
// Note that neither of the two inputs can be a slice because:
|
|
STATIC_ASSERT(ConsString::kMinLength <= SlicedString::kMinLength);
|
|
ASSERT(left->IsFlat());
|
|
ASSERT(right->IsFlat());
|
|
|
|
STATIC_ASSERT(ConsString::kMinLength <= String::kMaxLength);
|
|
if (is_one_byte) {
|
|
Handle<SeqOneByteString> result =
|
|
NewRawOneByteString(length).ToHandleChecked();
|
|
DisallowHeapAllocation no_gc;
|
|
uint8_t* dest = result->GetChars();
|
|
// Copy left part.
|
|
const uint8_t* src = left->IsExternalString()
|
|
? Handle<ExternalAsciiString>::cast(left)->GetChars()
|
|
: Handle<SeqOneByteString>::cast(left)->GetChars();
|
|
for (int i = 0; i < left_length; i++) *dest++ = src[i];
|
|
// Copy right part.
|
|
src = right->IsExternalString()
|
|
? Handle<ExternalAsciiString>::cast(right)->GetChars()
|
|
: Handle<SeqOneByteString>::cast(right)->GetChars();
|
|
for (int i = 0; i < right_length; i++) *dest++ = src[i];
|
|
return result;
|
|
}
|
|
|
|
return (is_one_byte_data_in_two_byte_string)
|
|
? ConcatStringContent<uint8_t>(
|
|
NewRawOneByteString(length).ToHandleChecked(), left, right)
|
|
: ConcatStringContent<uc16>(
|
|
NewRawTwoByteString(length).ToHandleChecked(), left, right);
|
|
}
|
|
|
|
Handle<ConsString> result = NewRawConsString(
|
|
(is_one_byte || is_one_byte_data_in_two_byte_string)
|
|
? String::ONE_BYTE_ENCODING
|
|
: String::TWO_BYTE_ENCODING);
|
|
|
|
DisallowHeapAllocation no_gc;
|
|
WriteBarrierMode mode = result->GetWriteBarrierMode(no_gc);
|
|
|
|
result->set_hash_field(String::kEmptyHashField);
|
|
result->set_length(length);
|
|
result->set_first(*left, mode);
|
|
result->set_second(*right, mode);
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<String> Factory::NewFlatConcatString(Handle<String> first,
|
|
Handle<String> second) {
|
|
int total_length = first->length() + second->length();
|
|
if (first->IsOneByteRepresentation() && second->IsOneByteRepresentation()) {
|
|
return ConcatStringContent<uint8_t>(
|
|
NewRawOneByteString(total_length).ToHandleChecked(), first, second);
|
|
} else {
|
|
return ConcatStringContent<uc16>(
|
|
NewRawTwoByteString(total_length).ToHandleChecked(), first, second);
|
|
}
|
|
}
|
|
|
|
|
|
Handle<SlicedString> Factory::NewRawSlicedString(String::Encoding encoding) {
|
|
Handle<Map> map = (encoding == String::ONE_BYTE_ENCODING)
|
|
? sliced_ascii_string_map() : sliced_string_map();
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->Allocate(*map, NEW_SPACE),
|
|
SlicedString);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::NewProperSubString(Handle<String> str,
|
|
int begin,
|
|
int end) {
|
|
#if VERIFY_HEAP
|
|
if (FLAG_verify_heap) str->StringVerify();
|
|
#endif
|
|
ASSERT(begin > 0 || end < str->length());
|
|
|
|
int length = end - begin;
|
|
if (length <= 0) return empty_string();
|
|
if (length == 1) {
|
|
return LookupSingleCharacterStringFromCode(str->Get(begin));
|
|
}
|
|
if (length == 2) {
|
|
// Optimization for 2-byte strings often used as keys in a decompression
|
|
// dictionary. Check whether we already have the string in the string
|
|
// table to prevent creation of many unnecessary strings.
|
|
uint16_t c1 = str->Get(begin);
|
|
uint16_t c2 = str->Get(begin + 1);
|
|
return MakeOrFindTwoCharacterString(isolate(), c1, c2);
|
|
}
|
|
|
|
if (!FLAG_string_slices || length < SlicedString::kMinLength) {
|
|
if (str->IsOneByteRepresentation()) {
|
|
Handle<SeqOneByteString> result =
|
|
NewRawOneByteString(length).ToHandleChecked();
|
|
uint8_t* dest = result->GetChars();
|
|
DisallowHeapAllocation no_gc;
|
|
String::WriteToFlat(*str, dest, begin, end);
|
|
return result;
|
|
} else {
|
|
Handle<SeqTwoByteString> result =
|
|
NewRawTwoByteString(length).ToHandleChecked();
|
|
uc16* dest = result->GetChars();
|
|
DisallowHeapAllocation no_gc;
|
|
String::WriteToFlat(*str, dest, begin, end);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
int offset = begin;
|
|
|
|
while (str->IsConsString()) {
|
|
Handle<ConsString> cons = Handle<ConsString>::cast(str);
|
|
int split = cons->first()->length();
|
|
if (split <= offset) {
|
|
// Slice is fully contained in the second part.
|
|
str = Handle<String>(cons->second(), isolate());
|
|
offset -= split; // Adjust for offset.
|
|
continue;
|
|
} else if (offset + length <= split) {
|
|
// Slice is fully contained in the first part.
|
|
str = Handle<String>(cons->first(), isolate());
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
|
|
if (str->IsSlicedString()) {
|
|
Handle<SlicedString> slice = Handle<SlicedString>::cast(str);
|
|
str = Handle<String>(slice->parent(), isolate());
|
|
offset += slice->offset();
|
|
} else {
|
|
str = String::Flatten(str);
|
|
}
|
|
|
|
ASSERT(str->IsSeqString() || str->IsExternalString());
|
|
Handle<SlicedString> slice = NewRawSlicedString(
|
|
str->IsOneByteRepresentation() ? String::ONE_BYTE_ENCODING
|
|
: String::TWO_BYTE_ENCODING);
|
|
|
|
slice->set_hash_field(String::kEmptyHashField);
|
|
slice->set_length(length);
|
|
slice->set_parent(*str);
|
|
slice->set_offset(offset);
|
|
return slice;
|
|
}
|
|
|
|
|
|
MaybeHandle<String> Factory::NewExternalStringFromAscii(
|
|
const ExternalAsciiString::Resource* resource) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateExternalStringFromAscii(resource),
|
|
String);
|
|
}
|
|
|
|
|
|
MaybeHandle<String> Factory::NewExternalStringFromTwoByte(
|
|
const ExternalTwoByteString::Resource* resource) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateExternalStringFromTwoByte(resource),
|
|
String);
|
|
}
|
|
|
|
|
|
Handle<Symbol> Factory::NewSymbol() {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateSymbol(),
|
|
Symbol);
|
|
}
|
|
|
|
|
|
Handle<Symbol> Factory::NewPrivateSymbol() {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocatePrivateSymbol(),
|
|
Symbol);
|
|
}
|
|
|
|
|
|
Handle<Context> Factory::NewNativeContext() {
|
|
Handle<FixedArray> array = NewFixedArray(Context::NATIVE_CONTEXT_SLOTS);
|
|
array->set_map_no_write_barrier(*native_context_map());
|
|
Handle<Context> context = Handle<Context>::cast(array);
|
|
context->set_js_array_maps(*undefined_value());
|
|
ASSERT(context->IsNativeContext());
|
|
return context;
|
|
}
|
|
|
|
|
|
Handle<Context> Factory::NewGlobalContext(Handle<JSFunction> function,
|
|
Handle<ScopeInfo> scope_info) {
|
|
Handle<FixedArray> array =
|
|
NewFixedArray(scope_info->ContextLength(), TENURED);
|
|
array->set_map_no_write_barrier(*global_context_map());
|
|
Handle<Context> context = Handle<Context>::cast(array);
|
|
context->set_closure(*function);
|
|
context->set_previous(function->context());
|
|
context->set_extension(*scope_info);
|
|
context->set_global_object(function->context()->global_object());
|
|
ASSERT(context->IsGlobalContext());
|
|
return context;
|
|
}
|
|
|
|
|
|
Handle<Context> Factory::NewModuleContext(Handle<ScopeInfo> scope_info) {
|
|
Handle<FixedArray> array =
|
|
NewFixedArray(scope_info->ContextLength(), TENURED);
|
|
array->set_map_no_write_barrier(*module_context_map());
|
|
// Instance link will be set later.
|
|
Handle<Context> context = Handle<Context>::cast(array);
|
|
context->set_extension(Smi::FromInt(0));
|
|
return context;
|
|
}
|
|
|
|
|
|
Handle<Context> Factory::NewFunctionContext(int length,
|
|
Handle<JSFunction> function) {
|
|
ASSERT(length >= Context::MIN_CONTEXT_SLOTS);
|
|
Handle<FixedArray> array = NewFixedArray(length);
|
|
array->set_map_no_write_barrier(*function_context_map());
|
|
Handle<Context> context = Handle<Context>::cast(array);
|
|
context->set_closure(*function);
|
|
context->set_previous(function->context());
|
|
context->set_extension(Smi::FromInt(0));
|
|
context->set_global_object(function->context()->global_object());
|
|
return context;
|
|
}
|
|
|
|
|
|
Handle<Context> Factory::NewCatchContext(Handle<JSFunction> function,
|
|
Handle<Context> previous,
|
|
Handle<String> name,
|
|
Handle<Object> thrown_object) {
|
|
STATIC_ASSERT(Context::MIN_CONTEXT_SLOTS == Context::THROWN_OBJECT_INDEX);
|
|
Handle<FixedArray> array = NewFixedArray(Context::MIN_CONTEXT_SLOTS + 1);
|
|
array->set_map_no_write_barrier(*catch_context_map());
|
|
Handle<Context> context = Handle<Context>::cast(array);
|
|
context->set_closure(*function);
|
|
context->set_previous(*previous);
|
|
context->set_extension(*name);
|
|
context->set_global_object(previous->global_object());
|
|
context->set(Context::THROWN_OBJECT_INDEX, *thrown_object);
|
|
return context;
|
|
}
|
|
|
|
|
|
Handle<Context> Factory::NewWithContext(Handle<JSFunction> function,
|
|
Handle<Context> previous,
|
|
Handle<JSReceiver> extension) {
|
|
Handle<FixedArray> array = NewFixedArray(Context::MIN_CONTEXT_SLOTS);
|
|
array->set_map_no_write_barrier(*with_context_map());
|
|
Handle<Context> context = Handle<Context>::cast(array);
|
|
context->set_closure(*function);
|
|
context->set_previous(*previous);
|
|
context->set_extension(*extension);
|
|
context->set_global_object(previous->global_object());
|
|
return context;
|
|
}
|
|
|
|
|
|
Handle<Context> Factory::NewBlockContext(Handle<JSFunction> function,
|
|
Handle<Context> previous,
|
|
Handle<ScopeInfo> scope_info) {
|
|
Handle<FixedArray> array =
|
|
NewFixedArrayWithHoles(scope_info->ContextLength());
|
|
array->set_map_no_write_barrier(*block_context_map());
|
|
Handle<Context> context = Handle<Context>::cast(array);
|
|
context->set_closure(*function);
|
|
context->set_previous(*previous);
|
|
context->set_extension(*scope_info);
|
|
context->set_global_object(previous->global_object());
|
|
return context;
|
|
}
|
|
|
|
|
|
Handle<Struct> Factory::NewStruct(InstanceType type) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateStruct(type),
|
|
Struct);
|
|
}
|
|
|
|
|
|
Handle<AliasedArgumentsEntry> Factory::NewAliasedArgumentsEntry(
|
|
int aliased_context_slot) {
|
|
Handle<AliasedArgumentsEntry> entry = Handle<AliasedArgumentsEntry>::cast(
|
|
NewStruct(ALIASED_ARGUMENTS_ENTRY_TYPE));
|
|
entry->set_aliased_context_slot(aliased_context_slot);
|
|
return entry;
|
|
}
|
|
|
|
|
|
Handle<DeclaredAccessorDescriptor> Factory::NewDeclaredAccessorDescriptor() {
|
|
return Handle<DeclaredAccessorDescriptor>::cast(
|
|
NewStruct(DECLARED_ACCESSOR_DESCRIPTOR_TYPE));
|
|
}
|
|
|
|
|
|
Handle<DeclaredAccessorInfo> Factory::NewDeclaredAccessorInfo() {
|
|
Handle<DeclaredAccessorInfo> info =
|
|
Handle<DeclaredAccessorInfo>::cast(
|
|
NewStruct(DECLARED_ACCESSOR_INFO_TYPE));
|
|
info->set_flag(0); // Must clear the flag, it was initialized as undefined.
|
|
return info;
|
|
}
|
|
|
|
|
|
Handle<ExecutableAccessorInfo> Factory::NewExecutableAccessorInfo() {
|
|
Handle<ExecutableAccessorInfo> info =
|
|
Handle<ExecutableAccessorInfo>::cast(
|
|
NewStruct(EXECUTABLE_ACCESSOR_INFO_TYPE));
|
|
info->set_flag(0); // Must clear the flag, it was initialized as undefined.
|
|
return info;
|
|
}
|
|
|
|
|
|
Handle<Script> Factory::NewScript(Handle<String> source) {
|
|
// Generate id for this script.
|
|
Heap* heap = isolate()->heap();
|
|
int id = heap->last_script_id()->value() + 1;
|
|
if (!Smi::IsValid(id) || id < 0) id = 1;
|
|
heap->set_last_script_id(Smi::FromInt(id));
|
|
|
|
// Create and initialize script object.
|
|
Handle<Foreign> wrapper = NewForeign(0, TENURED);
|
|
Handle<Script> script = Handle<Script>::cast(NewStruct(SCRIPT_TYPE));
|
|
script->set_source(*source);
|
|
script->set_name(heap->undefined_value());
|
|
script->set_id(Smi::FromInt(id));
|
|
script->set_line_offset(Smi::FromInt(0));
|
|
script->set_column_offset(Smi::FromInt(0));
|
|
script->set_context_data(heap->undefined_value());
|
|
script->set_type(Smi::FromInt(Script::TYPE_NORMAL));
|
|
script->set_wrapper(*wrapper);
|
|
script->set_line_ends(heap->undefined_value());
|
|
script->set_eval_from_shared(heap->undefined_value());
|
|
script->set_eval_from_instructions_offset(Smi::FromInt(0));
|
|
script->set_flags(Smi::FromInt(0));
|
|
|
|
return script;
|
|
}
|
|
|
|
|
|
Handle<Foreign> Factory::NewForeign(Address addr, PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->AllocateForeign(addr, pretenure),
|
|
Foreign);
|
|
}
|
|
|
|
|
|
Handle<Foreign> Factory::NewForeign(const AccessorDescriptor* desc) {
|
|
return NewForeign((Address) desc, TENURED);
|
|
}
|
|
|
|
|
|
Handle<ByteArray> Factory::NewByteArray(int length, PretenureFlag pretenure) {
|
|
ASSERT(0 <= length);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateByteArray(length, pretenure),
|
|
ByteArray);
|
|
}
|
|
|
|
|
|
Handle<ExternalArray> Factory::NewExternalArray(int length,
|
|
ExternalArrayType array_type,
|
|
void* external_pointer,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(0 <= length && length <= Smi::kMaxValue);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateExternalArray(length,
|
|
array_type,
|
|
external_pointer,
|
|
pretenure),
|
|
ExternalArray);
|
|
}
|
|
|
|
|
|
Handle<FixedTypedArrayBase> Factory::NewFixedTypedArray(
|
|
int length,
|
|
ExternalArrayType array_type,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(0 <= length && length <= Smi::kMaxValue);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateFixedTypedArray(length,
|
|
array_type,
|
|
pretenure),
|
|
FixedTypedArrayBase);
|
|
}
|
|
|
|
|
|
Handle<Cell> Factory::NewCell(Handle<Object> value) {
|
|
AllowDeferredHandleDereference convert_to_cell;
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateCell(*value),
|
|
Cell);
|
|
}
|
|
|
|
|
|
Handle<PropertyCell> Factory::NewPropertyCellWithHole() {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocatePropertyCell(),
|
|
PropertyCell);
|
|
}
|
|
|
|
|
|
Handle<PropertyCell> Factory::NewPropertyCell(Handle<Object> value) {
|
|
AllowDeferredHandleDereference convert_to_cell;
|
|
Handle<PropertyCell> cell = NewPropertyCellWithHole();
|
|
PropertyCell::SetValueInferType(cell, value);
|
|
return cell;
|
|
}
|
|
|
|
|
|
Handle<AllocationSite> Factory::NewAllocationSite() {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateAllocationSite(),
|
|
AllocationSite);
|
|
}
|
|
|
|
|
|
Handle<Map> Factory::NewMap(InstanceType type,
|
|
int instance_size,
|
|
ElementsKind elements_kind) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateMap(type, instance_size, elements_kind),
|
|
Map);
|
|
}
|
|
|
|
|
|
Handle<JSObject> Factory::NewFunctionPrototype(Handle<JSFunction> function) {
|
|
// Make sure to use globals from the function's context, since the function
|
|
// can be from a different context.
|
|
Handle<Context> native_context(function->context()->native_context());
|
|
Handle<Map> new_map;
|
|
if (function->shared()->is_generator()) {
|
|
// Generator prototypes can share maps since they don't have "constructor"
|
|
// properties.
|
|
new_map = handle(native_context->generator_object_prototype_map());
|
|
} else {
|
|
// Each function prototype gets a fresh map to avoid unwanted sharing of
|
|
// maps between prototypes of different constructors.
|
|
Handle<JSFunction> object_function(native_context->object_function());
|
|
ASSERT(object_function->has_initial_map());
|
|
new_map = Map::Copy(handle(object_function->initial_map()));
|
|
}
|
|
|
|
Handle<JSObject> prototype = NewJSObjectFromMap(new_map);
|
|
|
|
if (!function->shared()->is_generator()) {
|
|
JSObject::SetLocalPropertyIgnoreAttributes(prototype,
|
|
constructor_string(),
|
|
function,
|
|
DONT_ENUM).Assert();
|
|
}
|
|
|
|
return prototype;
|
|
}
|
|
|
|
|
|
Handle<FixedArray> Factory::CopyFixedArray(Handle<FixedArray> array) {
|
|
CALL_HEAP_FUNCTION(isolate(), array->Copy(), FixedArray);
|
|
}
|
|
|
|
|
|
Handle<FixedArray> Factory::CopyAndTenureFixedCOWArray(
|
|
Handle<FixedArray> array) {
|
|
ASSERT(isolate()->heap()->InNewSpace(*array));
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->CopyAndTenureFixedCOWArray(*array),
|
|
FixedArray);
|
|
}
|
|
|
|
|
|
Handle<FixedArray> Factory::CopySizeFixedArray(Handle<FixedArray> array,
|
|
int new_length,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
array->CopySize(new_length, pretenure),
|
|
FixedArray);
|
|
}
|
|
|
|
|
|
Handle<FixedDoubleArray> Factory::CopyFixedDoubleArray(
|
|
Handle<FixedDoubleArray> array) {
|
|
CALL_HEAP_FUNCTION(isolate(), array->Copy(), FixedDoubleArray);
|
|
}
|
|
|
|
|
|
Handle<ConstantPoolArray> Factory::CopyConstantPoolArray(
|
|
Handle<ConstantPoolArray> array) {
|
|
CALL_HEAP_FUNCTION(isolate(), array->Copy(), ConstantPoolArray);
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::BaseNewFunctionFromSharedFunctionInfo(
|
|
Handle<SharedFunctionInfo> function_info,
|
|
Handle<Map> function_map,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateFunction(*function_map,
|
|
*function_info,
|
|
isolate()->heap()->the_hole_value(),
|
|
pretenure),
|
|
JSFunction);
|
|
}
|
|
|
|
|
|
static Handle<Map> MapForNewFunction(Isolate *isolate,
|
|
Handle<SharedFunctionInfo> function_info) {
|
|
Context *context = isolate->context()->native_context();
|
|
int map_index = Context::FunctionMapIndex(function_info->strict_mode(),
|
|
function_info->is_generator());
|
|
return Handle<Map>(Map::cast(context->get(map_index)));
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunctionFromSharedFunctionInfo(
|
|
Handle<SharedFunctionInfo> function_info,
|
|
Handle<Context> context,
|
|
PretenureFlag pretenure) {
|
|
Handle<JSFunction> result = BaseNewFunctionFromSharedFunctionInfo(
|
|
function_info,
|
|
MapForNewFunction(isolate(), function_info),
|
|
pretenure);
|
|
|
|
if (function_info->ic_age() != isolate()->heap()->global_ic_age()) {
|
|
function_info->ResetForNewContext(isolate()->heap()->global_ic_age());
|
|
}
|
|
|
|
result->set_context(*context);
|
|
|
|
int index = function_info->SearchOptimizedCodeMap(context->native_context(),
|
|
BailoutId::None());
|
|
if (!function_info->bound() && index < 0) {
|
|
int number_of_literals = function_info->num_literals();
|
|
Handle<FixedArray> literals = NewFixedArray(number_of_literals, pretenure);
|
|
if (number_of_literals > 0) {
|
|
// Store the native context in the literals array prefix. This
|
|
// context will be used when creating object, regexp and array
|
|
// literals in this function.
|
|
literals->set(JSFunction::kLiteralNativeContextIndex,
|
|
context->native_context());
|
|
}
|
|
result->set_literals(*literals);
|
|
}
|
|
|
|
if (index > 0) {
|
|
// Caching of optimized code enabled and optimized code found.
|
|
FixedArray* literals =
|
|
function_info->GetLiteralsFromOptimizedCodeMap(index);
|
|
if (literals != NULL) result->set_literals(literals);
|
|
Code* code = function_info->GetCodeFromOptimizedCodeMap(index);
|
|
ASSERT(!code->marked_for_deoptimization());
|
|
result->ReplaceCode(code);
|
|
return result;
|
|
}
|
|
|
|
if (isolate()->use_crankshaft() &&
|
|
FLAG_always_opt &&
|
|
result->is_compiled() &&
|
|
!function_info->is_toplevel() &&
|
|
function_info->allows_lazy_compilation() &&
|
|
!function_info->optimization_disabled() &&
|
|
!isolate()->DebuggerHasBreakPoints()) {
|
|
result->MarkForOptimization();
|
|
}
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewNumber(double value,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->NumberFromDouble(value, pretenure), Object);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewNumberFromInt(int32_t value,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->NumberFromInt32(value, pretenure), Object);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewNumberFromUint(uint32_t value,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->NumberFromUint32(value, pretenure), Object);
|
|
}
|
|
|
|
|
|
Handle<HeapNumber> Factory::NewHeapNumber(double value,
|
|
PretenureFlag pretenure) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateHeapNumber(value, pretenure), HeapNumber);
|
|
}
|
|
|
|
|
|
Handle<JSObject> Factory::NewNeanderObject() {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObjectFromMap(
|
|
isolate()->heap()->neander_map()),
|
|
JSObject);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewTypeError(const char* message,
|
|
Vector< Handle<Object> > args) {
|
|
return NewError("MakeTypeError", message, args);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewTypeError(Handle<String> message) {
|
|
return NewError("$TypeError", message);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewRangeError(const char* message,
|
|
Vector< Handle<Object> > args) {
|
|
return NewError("MakeRangeError", message, args);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewRangeError(Handle<String> message) {
|
|
return NewError("$RangeError", message);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewSyntaxError(const char* message,
|
|
Handle<JSArray> args) {
|
|
return NewError("MakeSyntaxError", message, args);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewSyntaxError(Handle<String> message) {
|
|
return NewError("$SyntaxError", message);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewReferenceError(const char* message,
|
|
Vector< Handle<Object> > args) {
|
|
return NewError("MakeReferenceError", message, args);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewReferenceError(const char* message,
|
|
Handle<JSArray> args) {
|
|
return NewError("MakeReferenceError", message, args);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewReferenceError(Handle<String> message) {
|
|
return NewError("$ReferenceError", message);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewError(const char* maker,
|
|
const char* message,
|
|
Vector< Handle<Object> > args) {
|
|
// Instantiate a closeable HandleScope for EscapeFrom.
|
|
v8::EscapableHandleScope scope(reinterpret_cast<v8::Isolate*>(isolate()));
|
|
Handle<FixedArray> array = NewFixedArray(args.length());
|
|
for (int i = 0; i < args.length(); i++) {
|
|
array->set(i, *args[i]);
|
|
}
|
|
Handle<JSArray> object = NewJSArrayWithElements(array);
|
|
Handle<Object> result = NewError(maker, message, object);
|
|
return result.EscapeFrom(&scope);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewEvalError(const char* message,
|
|
Vector< Handle<Object> > args) {
|
|
return NewError("MakeEvalError", message, args);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewError(const char* message,
|
|
Vector< Handle<Object> > args) {
|
|
return NewError("MakeError", message, args);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::EmergencyNewError(const char* message,
|
|
Handle<JSArray> args) {
|
|
const int kBufferSize = 1000;
|
|
char buffer[kBufferSize];
|
|
size_t space = kBufferSize;
|
|
char* p = &buffer[0];
|
|
|
|
Vector<char> v(buffer, kBufferSize);
|
|
OS::StrNCpy(v, message, space);
|
|
space -= Min(space, strlen(message));
|
|
p = &buffer[kBufferSize] - space;
|
|
|
|
for (unsigned i = 0; i < ARRAY_SIZE(args); i++) {
|
|
if (space > 0) {
|
|
*p++ = ' ';
|
|
space--;
|
|
if (space > 0) {
|
|
Handle<String> arg_str = Handle<String>::cast(
|
|
Object::GetElement(isolate(), args, i).ToHandleChecked());
|
|
SmartArrayPointer<char> arg = arg_str->ToCString();
|
|
Vector<char> v2(p, static_cast<int>(space));
|
|
OS::StrNCpy(v2, arg.get(), space);
|
|
space -= Min(space, strlen(arg.get()));
|
|
p = &buffer[kBufferSize] - space;
|
|
}
|
|
}
|
|
}
|
|
if (space > 0) {
|
|
*p = '\0';
|
|
} else {
|
|
buffer[kBufferSize - 1] = '\0';
|
|
}
|
|
Handle<String> error_string = NewStringFromUtf8(CStrVector(buffer), TENURED);
|
|
return error_string;
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewError(const char* maker,
|
|
const char* message,
|
|
Handle<JSArray> args) {
|
|
Handle<String> make_str = InternalizeUtf8String(maker);
|
|
Handle<Object> fun_obj = Object::GetProperty(
|
|
isolate()->js_builtins_object(), make_str).ToHandleChecked();
|
|
// If the builtins haven't been properly configured yet this error
|
|
// constructor may not have been defined. Bail out.
|
|
if (!fun_obj->IsJSFunction()) {
|
|
return EmergencyNewError(message, args);
|
|
}
|
|
Handle<JSFunction> fun = Handle<JSFunction>::cast(fun_obj);
|
|
Handle<Object> message_obj = InternalizeUtf8String(message);
|
|
Handle<Object> argv[] = { message_obj, args };
|
|
|
|
// Invoke the JavaScript factory method. If an exception is thrown while
|
|
// running the factory method, use the exception as the result.
|
|
Handle<Object> result;
|
|
Handle<Object> exception;
|
|
if (!Execution::TryCall(fun,
|
|
isolate()->js_builtins_object(),
|
|
ARRAY_SIZE(argv),
|
|
argv,
|
|
&exception).ToHandle(&result)) {
|
|
return exception;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewError(Handle<String> message) {
|
|
return NewError("$Error", message);
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::NewError(const char* constructor,
|
|
Handle<String> message) {
|
|
Handle<String> constr = InternalizeUtf8String(constructor);
|
|
Handle<JSFunction> fun = Handle<JSFunction>::cast(Object::GetProperty(
|
|
isolate()->js_builtins_object(), constr).ToHandleChecked());
|
|
Handle<Object> argv[] = { message };
|
|
|
|
// Invoke the JavaScript factory method. If an exception is thrown while
|
|
// running the factory method, use the exception as the result.
|
|
Handle<Object> result;
|
|
Handle<Object> exception;
|
|
if (!Execution::TryCall(fun,
|
|
isolate()->js_builtins_object(),
|
|
ARRAY_SIZE(argv),
|
|
argv,
|
|
&exception).ToHandle(&result)) {
|
|
return exception;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunction(Handle<String> name,
|
|
InstanceType type,
|
|
int instance_size,
|
|
Handle<Code> code,
|
|
bool force_initial_map) {
|
|
// Allocate the function
|
|
Handle<JSFunction> function = NewFunction(name, the_hole_value());
|
|
|
|
// Set up the code pointer in both the shared function info and in
|
|
// the function itself.
|
|
function->shared()->set_code(*code);
|
|
function->set_code(*code);
|
|
|
|
if (force_initial_map ||
|
|
type != JS_OBJECT_TYPE ||
|
|
instance_size != JSObject::kHeaderSize) {
|
|
Handle<Map> initial_map = NewMap(type, instance_size);
|
|
Handle<JSObject> prototype = NewFunctionPrototype(function);
|
|
initial_map->set_prototype(*prototype);
|
|
function->set_initial_map(*initial_map);
|
|
initial_map->set_constructor(*function);
|
|
} else {
|
|
ASSERT(!function->has_initial_map());
|
|
ASSERT(!function->has_prototype());
|
|
}
|
|
|
|
return function;
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunctionWithPrototype(Handle<String> name,
|
|
InstanceType type,
|
|
int instance_size,
|
|
Handle<JSObject> prototype,
|
|
Handle<Code> code,
|
|
bool force_initial_map) {
|
|
// Allocate the function.
|
|
Handle<JSFunction> function = NewFunction(name, prototype);
|
|
|
|
// Set up the code pointer in both the shared function info and in
|
|
// the function itself.
|
|
function->shared()->set_code(*code);
|
|
function->set_code(*code);
|
|
|
|
if (force_initial_map ||
|
|
type != JS_OBJECT_TYPE ||
|
|
instance_size != JSObject::kHeaderSize) {
|
|
Handle<Map> initial_map = NewMap(type,
|
|
instance_size,
|
|
GetInitialFastElementsKind());
|
|
function->set_initial_map(*initial_map);
|
|
initial_map->set_constructor(*function);
|
|
}
|
|
|
|
JSFunction::SetPrototype(function, prototype);
|
|
return function;
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunctionWithoutPrototype(Handle<String> name,
|
|
Handle<Code> code) {
|
|
Handle<JSFunction> function = NewFunctionWithoutPrototype(name, SLOPPY);
|
|
function->shared()->set_code(*code);
|
|
function->set_code(*code);
|
|
ASSERT(!function->has_initial_map());
|
|
ASSERT(!function->has_prototype());
|
|
return function;
|
|
}
|
|
|
|
|
|
Handle<ScopeInfo> Factory::NewScopeInfo(int length) {
|
|
Handle<FixedArray> array = NewFixedArray(length, TENURED);
|
|
array->set_map_no_write_barrier(*scope_info_map());
|
|
Handle<ScopeInfo> scope_info = Handle<ScopeInfo>::cast(array);
|
|
return scope_info;
|
|
}
|
|
|
|
|
|
Handle<JSObject> Factory::NewExternal(void* value) {
|
|
Handle<Foreign> foreign = NewForeign(static_cast<Address>(value));
|
|
Handle<JSObject> external = NewJSObjectFromMap(external_map());
|
|
external->SetInternalField(0, *foreign);
|
|
return external;
|
|
}
|
|
|
|
|
|
Handle<Code> Factory::NewCode(const CodeDesc& desc,
|
|
Code::Flags flags,
|
|
Handle<Object> self_ref,
|
|
bool immovable,
|
|
bool crankshafted,
|
|
int prologue_offset) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->CreateCode(
|
|
desc, flags, self_ref, immovable, crankshafted,
|
|
prologue_offset),
|
|
Code);
|
|
}
|
|
|
|
|
|
Handle<Code> Factory::CopyCode(Handle<Code> code) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->CopyCode(*code),
|
|
Code);
|
|
}
|
|
|
|
|
|
Handle<Code> Factory::CopyCode(Handle<Code> code, Vector<byte> reloc_info) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->CopyCode(*code, reloc_info),
|
|
Code);
|
|
}
|
|
|
|
|
|
Handle<JSObject> Factory::NewJSObject(Handle<JSFunction> constructor,
|
|
PretenureFlag pretenure) {
|
|
JSFunction::EnsureHasInitialMap(constructor);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObject(*constructor, pretenure), JSObject);
|
|
}
|
|
|
|
|
|
Handle<JSObject> Factory::NewJSObjectWithMemento(
|
|
Handle<JSFunction> constructor,
|
|
Handle<AllocationSite> site) {
|
|
JSFunction::EnsureHasInitialMap(constructor);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObject(*constructor, NOT_TENURED, *site),
|
|
JSObject);
|
|
}
|
|
|
|
|
|
Handle<JSModule> Factory::NewJSModule(Handle<Context> context,
|
|
Handle<ScopeInfo> scope_info) {
|
|
// Allocate a fresh map. Modules do not have a prototype.
|
|
Handle<Map> map = NewMap(JS_MODULE_TYPE, JSModule::kSize);
|
|
// Allocate the object based on the map.
|
|
Handle<JSModule> module =
|
|
Handle<JSModule>::cast(NewJSObjectFromMap(map, TENURED));
|
|
module->set_context(*context);
|
|
module->set_scope_info(*scope_info);
|
|
return module;
|
|
}
|
|
|
|
|
|
static Handle<GlobalObject> NewGlobalObjectFromMap(Isolate* isolate,
|
|
Handle<Map> map) {
|
|
CALL_HEAP_FUNCTION(isolate,
|
|
isolate->heap()->Allocate(*map, OLD_POINTER_SPACE),
|
|
GlobalObject);
|
|
}
|
|
|
|
|
|
Handle<GlobalObject> Factory::NewGlobalObject(Handle<JSFunction> constructor) {
|
|
ASSERT(constructor->has_initial_map());
|
|
Handle<Map> map(constructor->initial_map());
|
|
ASSERT(map->is_dictionary_map());
|
|
|
|
// Make sure no field properties are described in the initial map.
|
|
// This guarantees us that normalizing the properties does not
|
|
// require us to change property values to PropertyCells.
|
|
ASSERT(map->NextFreePropertyIndex() == 0);
|
|
|
|
// Make sure we don't have a ton of pre-allocated slots in the
|
|
// global objects. They will be unused once we normalize the object.
|
|
ASSERT(map->unused_property_fields() == 0);
|
|
ASSERT(map->inobject_properties() == 0);
|
|
|
|
// Initial size of the backing store to avoid resize of the storage during
|
|
// bootstrapping. The size differs between the JS global object ad the
|
|
// builtins object.
|
|
int initial_size = map->instance_type() == JS_GLOBAL_OBJECT_TYPE ? 64 : 512;
|
|
|
|
// Allocate a dictionary object for backing storage.
|
|
int at_least_space_for = map->NumberOfOwnDescriptors() * 2 + initial_size;
|
|
Handle<NameDictionary> dictionary = NewNameDictionary(at_least_space_for);
|
|
|
|
// The global object might be created from an object template with accessors.
|
|
// Fill these accessors into the dictionary.
|
|
Handle<DescriptorArray> descs(map->instance_descriptors());
|
|
for (int i = 0; i < map->NumberOfOwnDescriptors(); i++) {
|
|
PropertyDetails details = descs->GetDetails(i);
|
|
ASSERT(details.type() == CALLBACKS); // Only accessors are expected.
|
|
PropertyDetails d = PropertyDetails(details.attributes(), CALLBACKS, i + 1);
|
|
Handle<Name> name(descs->GetKey(i));
|
|
Handle<Object> value(descs->GetCallbacksObject(i), isolate());
|
|
Handle<PropertyCell> cell = NewPropertyCell(value);
|
|
NameDictionary::AddNameEntry(dictionary, name, cell, d);
|
|
}
|
|
|
|
// Allocate the global object and initialize it with the backing store.
|
|
Handle<GlobalObject> global = NewGlobalObjectFromMap(isolate(), map);
|
|
isolate()->heap()->InitializeJSObjectFromMap(*global, *dictionary, *map);
|
|
|
|
// Create a new map for the global object.
|
|
Handle<Map> new_map = Map::CopyDropDescriptors(map);
|
|
new_map->set_dictionary_map(true);
|
|
|
|
// Set up the global object as a normalized object.
|
|
global->set_map(*new_map);
|
|
global->set_properties(*dictionary);
|
|
|
|
// Make sure result is a global object with properties in dictionary.
|
|
ASSERT(global->IsGlobalObject() && !global->HasFastProperties());
|
|
return global;
|
|
}
|
|
|
|
|
|
Handle<JSObject> Factory::NewJSObjectFromMap(
|
|
Handle<Map> map,
|
|
PretenureFlag pretenure,
|
|
bool alloc_props,
|
|
Handle<AllocationSite> allocation_site) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObjectFromMap(
|
|
*map,
|
|
pretenure,
|
|
alloc_props,
|
|
allocation_site.is_null() ? NULL : *allocation_site),
|
|
JSObject);
|
|
}
|
|
|
|
|
|
Handle<JSArray> Factory::NewJSArray(ElementsKind elements_kind,
|
|
PretenureFlag pretenure) {
|
|
Context* native_context = isolate()->context()->native_context();
|
|
JSFunction* array_function = native_context->array_function();
|
|
Map* map = array_function->initial_map();
|
|
Map* transition_map = isolate()->get_initial_js_array_map(elements_kind);
|
|
if (transition_map != NULL) map = transition_map;
|
|
return Handle<JSArray>::cast(NewJSObjectFromMap(handle(map), pretenure));
|
|
}
|
|
|
|
|
|
Handle<JSArray> Factory::NewJSArray(ElementsKind elements_kind,
|
|
int length,
|
|
int capacity,
|
|
ArrayStorageAllocationMode mode,
|
|
PretenureFlag pretenure) {
|
|
Handle<JSArray> array = NewJSArray(elements_kind, pretenure);
|
|
NewJSArrayStorage(array, length, capacity, mode);
|
|
return array;
|
|
}
|
|
|
|
|
|
Handle<JSArray> Factory::NewJSArrayWithElements(Handle<FixedArrayBase> elements,
|
|
ElementsKind elements_kind,
|
|
int length,
|
|
PretenureFlag pretenure) {
|
|
ASSERT(length <= elements->length());
|
|
Handle<JSArray> array =
|
|
isolate()->factory()->NewJSArray(elements_kind, pretenure);
|
|
|
|
array->set_elements(*elements);
|
|
array->set_length(Smi::FromInt(length));
|
|
JSObject::ValidateElements(array);
|
|
return array;
|
|
}
|
|
|
|
|
|
void Factory::NewJSArrayStorage(Handle<JSArray> array,
|
|
int length,
|
|
int capacity,
|
|
ArrayStorageAllocationMode mode) {
|
|
ASSERT(capacity >= length);
|
|
|
|
if (capacity == 0) {
|
|
array->set_length(Smi::FromInt(0));
|
|
array->set_elements(*empty_fixed_array());
|
|
return;
|
|
}
|
|
|
|
Handle<FixedArrayBase> elms;
|
|
ElementsKind elements_kind = array->GetElementsKind();
|
|
if (IsFastDoubleElementsKind(elements_kind)) {
|
|
if (mode == DONT_INITIALIZE_ARRAY_ELEMENTS) {
|
|
elms = NewFixedDoubleArray(capacity);
|
|
} else {
|
|
ASSERT(mode == INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
|
|
elms = NewFixedDoubleArrayWithHoles(capacity);
|
|
}
|
|
} else {
|
|
ASSERT(IsFastSmiOrObjectElementsKind(elements_kind));
|
|
if (mode == DONT_INITIALIZE_ARRAY_ELEMENTS) {
|
|
elms = NewUninitializedFixedArray(capacity);
|
|
} else {
|
|
ASSERT(mode == INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
|
|
elms = NewFixedArrayWithHoles(capacity);
|
|
}
|
|
}
|
|
|
|
array->set_elements(*elms);
|
|
array->set_length(Smi::FromInt(length));
|
|
}
|
|
|
|
|
|
Handle<JSGeneratorObject> Factory::NewJSGeneratorObject(
|
|
Handle<JSFunction> function) {
|
|
ASSERT(function->shared()->is_generator());
|
|
JSFunction::EnsureHasInitialMap(function);
|
|
Handle<Map> map(function->initial_map());
|
|
ASSERT(map->instance_type() == JS_GENERATOR_OBJECT_TYPE);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObjectFromMap(*map),
|
|
JSGeneratorObject);
|
|
}
|
|
|
|
|
|
Handle<JSArrayBuffer> Factory::NewJSArrayBuffer() {
|
|
Handle<JSFunction> array_buffer_fun(
|
|
isolate()->context()->native_context()->array_buffer_fun());
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObject(*array_buffer_fun),
|
|
JSArrayBuffer);
|
|
}
|
|
|
|
|
|
Handle<JSDataView> Factory::NewJSDataView() {
|
|
Handle<JSFunction> data_view_fun(
|
|
isolate()->context()->native_context()->data_view_fun());
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObject(*data_view_fun),
|
|
JSDataView);
|
|
}
|
|
|
|
|
|
static JSFunction* GetTypedArrayFun(ExternalArrayType type,
|
|
Isolate* isolate) {
|
|
Context* native_context = isolate->context()->native_context();
|
|
switch (type) {
|
|
#define TYPED_ARRAY_FUN(Type, type, TYPE, ctype, size) \
|
|
case kExternal##Type##Array: \
|
|
return native_context->type##_array_fun();
|
|
|
|
TYPED_ARRAYS(TYPED_ARRAY_FUN)
|
|
#undef TYPED_ARRAY_FUN
|
|
|
|
default:
|
|
UNREACHABLE();
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
|
|
Handle<JSTypedArray> Factory::NewJSTypedArray(ExternalArrayType type) {
|
|
Handle<JSFunction> typed_array_fun_handle(GetTypedArrayFun(type, isolate()));
|
|
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSObject(*typed_array_fun_handle),
|
|
JSTypedArray);
|
|
}
|
|
|
|
|
|
Handle<JSProxy> Factory::NewJSProxy(Handle<Object> handler,
|
|
Handle<Object> prototype) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSProxy(*handler, *prototype),
|
|
JSProxy);
|
|
}
|
|
|
|
|
|
Handle<JSProxy> Factory::NewJSFunctionProxy(Handle<Object> handler,
|
|
Handle<Object> call_trap,
|
|
Handle<Object> construct_trap,
|
|
Handle<Object> prototype) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateJSFunctionProxy(
|
|
*handler, *call_trap, *construct_trap, *prototype),
|
|
JSProxy);
|
|
}
|
|
|
|
|
|
void Factory::BecomeJSObject(Handle<JSReceiver> object) {
|
|
CALL_HEAP_FUNCTION_VOID(
|
|
isolate(),
|
|
isolate()->heap()->ReinitializeJSReceiver(
|
|
*object, JS_OBJECT_TYPE, JSObject::kHeaderSize));
|
|
}
|
|
|
|
|
|
void Factory::BecomeJSFunction(Handle<JSReceiver> object) {
|
|
CALL_HEAP_FUNCTION_VOID(
|
|
isolate(),
|
|
isolate()->heap()->ReinitializeJSReceiver(
|
|
*object, JS_FUNCTION_TYPE, JSFunction::kSize));
|
|
}
|
|
|
|
|
|
Handle<SharedFunctionInfo> Factory::NewSharedFunctionInfo(
|
|
Handle<String> name,
|
|
int number_of_literals,
|
|
bool is_generator,
|
|
Handle<Code> code,
|
|
Handle<ScopeInfo> scope_info) {
|
|
Handle<SharedFunctionInfo> shared = NewSharedFunctionInfo(name);
|
|
shared->set_code(*code);
|
|
shared->set_scope_info(*scope_info);
|
|
int literals_array_size = number_of_literals;
|
|
// If the function contains object, regexp or array literals,
|
|
// allocate extra space for a literals array prefix containing the
|
|
// context.
|
|
if (number_of_literals > 0) {
|
|
literals_array_size += JSFunction::kLiteralsPrefixSize;
|
|
}
|
|
shared->set_num_literals(literals_array_size);
|
|
if (is_generator) {
|
|
shared->set_instance_class_name(isolate()->heap()->Generator_string());
|
|
shared->DisableOptimization(kGenerator);
|
|
}
|
|
return shared;
|
|
}
|
|
|
|
|
|
Handle<JSMessageObject> Factory::NewJSMessageObject(
|
|
Handle<String> type,
|
|
Handle<JSArray> arguments,
|
|
int start_position,
|
|
int end_position,
|
|
Handle<Object> script,
|
|
Handle<Object> stack_frames) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->AllocateJSMessageObject(*type,
|
|
*arguments,
|
|
start_position,
|
|
end_position,
|
|
*script,
|
|
*stack_frames),
|
|
JSMessageObject);
|
|
}
|
|
|
|
|
|
Handle<SharedFunctionInfo> Factory::NewSharedFunctionInfo(Handle<String> name) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->AllocateSharedFunctionInfo(*name),
|
|
SharedFunctionInfo);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::NumberToString(Handle<Object> number,
|
|
bool check_number_string_cache) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->NumberToString(
|
|
*number, check_number_string_cache),
|
|
String);
|
|
}
|
|
|
|
|
|
Handle<String> Factory::Uint32ToString(uint32_t value) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->Uint32ToString(value), String);
|
|
}
|
|
|
|
|
|
Handle<SeededNumberDictionary> Factory::DictionaryAtNumberPut(
|
|
Handle<SeededNumberDictionary> dictionary,
|
|
uint32_t key,
|
|
Handle<Object> value) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
dictionary->AtNumberPut(key, *value),
|
|
SeededNumberDictionary);
|
|
}
|
|
|
|
|
|
Handle<UnseededNumberDictionary> Factory::DictionaryAtNumberPut(
|
|
Handle<UnseededNumberDictionary> dictionary,
|
|
uint32_t key,
|
|
Handle<Object> value) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
dictionary->AtNumberPut(key, *value),
|
|
UnseededNumberDictionary);
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunctionHelper(Handle<String> name,
|
|
Handle<Object> prototype) {
|
|
Handle<SharedFunctionInfo> function_share = NewSharedFunctionInfo(name);
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateFunction(*isolate()->sloppy_function_map(),
|
|
*function_share,
|
|
*prototype),
|
|
JSFunction);
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunction(Handle<String> name,
|
|
Handle<Object> prototype) {
|
|
Handle<JSFunction> fun = NewFunctionHelper(name, prototype);
|
|
fun->set_context(isolate()->context()->native_context());
|
|
return fun;
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunctionWithoutPrototypeHelper(
|
|
Handle<String> name,
|
|
StrictMode strict_mode) {
|
|
Handle<SharedFunctionInfo> function_share = NewSharedFunctionInfo(name);
|
|
Handle<Map> map = strict_mode == SLOPPY
|
|
? isolate()->sloppy_function_without_prototype_map()
|
|
: isolate()->strict_function_without_prototype_map();
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
isolate()->heap()->AllocateFunction(
|
|
*map,
|
|
*function_share,
|
|
*the_hole_value()),
|
|
JSFunction);
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::NewFunctionWithoutPrototype(
|
|
Handle<String> name,
|
|
StrictMode strict_mode) {
|
|
Handle<JSFunction> fun = NewFunctionWithoutPrototypeHelper(name, strict_mode);
|
|
fun->set_context(isolate()->context()->native_context());
|
|
return fun;
|
|
}
|
|
|
|
|
|
#ifdef ENABLE_DEBUGGER_SUPPORT
|
|
Handle<DebugInfo> Factory::NewDebugInfo(Handle<SharedFunctionInfo> shared) {
|
|
// Get the original code of the function.
|
|
Handle<Code> code(shared->code());
|
|
|
|
// Create a copy of the code before allocating the debug info object to avoid
|
|
// allocation while setting up the debug info object.
|
|
Handle<Code> original_code(*Factory::CopyCode(code));
|
|
|
|
// Allocate initial fixed array for active break points before allocating the
|
|
// debug info object to avoid allocation while setting up the debug info
|
|
// object.
|
|
Handle<FixedArray> break_points(
|
|
NewFixedArray(Debug::kEstimatedNofBreakPointsInFunction));
|
|
|
|
// Create and set up the debug info object. Debug info contains function, a
|
|
// copy of the original code, the executing code and initial fixed array for
|
|
// active break points.
|
|
Handle<DebugInfo> debug_info =
|
|
Handle<DebugInfo>::cast(NewStruct(DEBUG_INFO_TYPE));
|
|
debug_info->set_shared(*shared);
|
|
debug_info->set_original_code(*original_code);
|
|
debug_info->set_code(*code);
|
|
debug_info->set_break_points(*break_points);
|
|
|
|
// Link debug info to function.
|
|
shared->set_debug_info(*debug_info);
|
|
|
|
return debug_info;
|
|
}
|
|
#endif
|
|
|
|
|
|
Handle<JSObject> Factory::NewArgumentsObject(Handle<Object> callee,
|
|
int length) {
|
|
CALL_HEAP_FUNCTION(
|
|
isolate(),
|
|
isolate()->heap()->AllocateArgumentsObject(*callee, length), JSObject);
|
|
}
|
|
|
|
|
|
Handle<JSFunction> Factory::CreateApiFunction(
|
|
Handle<FunctionTemplateInfo> obj, ApiInstanceType instance_type) {
|
|
Handle<Code> code = isolate()->builtins()->HandleApiCall();
|
|
Handle<Code> construct_stub = isolate()->builtins()->JSConstructStubApi();
|
|
|
|
int internal_field_count = 0;
|
|
if (!obj->instance_template()->IsUndefined()) {
|
|
Handle<ObjectTemplateInfo> instance_template =
|
|
Handle<ObjectTemplateInfo>(
|
|
ObjectTemplateInfo::cast(obj->instance_template()));
|
|
internal_field_count =
|
|
Smi::cast(instance_template->internal_field_count())->value();
|
|
}
|
|
|
|
// TODO(svenpanne) Kill ApiInstanceType and refactor things by generalizing
|
|
// JSObject::GetHeaderSize.
|
|
int instance_size = kPointerSize * internal_field_count;
|
|
InstanceType type;
|
|
switch (instance_type) {
|
|
case JavaScriptObject:
|
|
type = JS_OBJECT_TYPE;
|
|
instance_size += JSObject::kHeaderSize;
|
|
break;
|
|
case InnerGlobalObject:
|
|
type = JS_GLOBAL_OBJECT_TYPE;
|
|
instance_size += JSGlobalObject::kSize;
|
|
break;
|
|
case OuterGlobalObject:
|
|
type = JS_GLOBAL_PROXY_TYPE;
|
|
instance_size += JSGlobalProxy::kSize;
|
|
break;
|
|
default:
|
|
UNREACHABLE();
|
|
type = JS_OBJECT_TYPE; // Keep the compiler happy.
|
|
break;
|
|
}
|
|
|
|
Handle<JSFunction> result =
|
|
NewFunction(Factory::empty_string(),
|
|
type,
|
|
instance_size,
|
|
code,
|
|
true);
|
|
|
|
// Set length.
|
|
result->shared()->set_length(obj->length());
|
|
|
|
// Set class name.
|
|
Handle<Object> class_name = Handle<Object>(obj->class_name(), isolate());
|
|
if (class_name->IsString()) {
|
|
result->shared()->set_instance_class_name(*class_name);
|
|
result->shared()->set_name(*class_name);
|
|
}
|
|
|
|
Handle<Map> map = Handle<Map>(result->initial_map());
|
|
|
|
// Mark as undetectable if needed.
|
|
if (obj->undetectable()) {
|
|
map->set_is_undetectable();
|
|
}
|
|
|
|
// Mark as hidden for the __proto__ accessor if needed.
|
|
if (obj->hidden_prototype()) {
|
|
map->set_is_hidden_prototype();
|
|
}
|
|
|
|
// Mark as needs_access_check if needed.
|
|
if (obj->needs_access_check()) {
|
|
map->set_is_access_check_needed(true);
|
|
}
|
|
|
|
// Set interceptor information in the map.
|
|
if (!obj->named_property_handler()->IsUndefined()) {
|
|
map->set_has_named_interceptor();
|
|
}
|
|
if (!obj->indexed_property_handler()->IsUndefined()) {
|
|
map->set_has_indexed_interceptor();
|
|
}
|
|
|
|
// Set instance call-as-function information in the map.
|
|
if (!obj->instance_call_handler()->IsUndefined()) {
|
|
map->set_has_instance_call_handler();
|
|
}
|
|
|
|
result->shared()->set_function_data(*obj);
|
|
result->shared()->set_construct_stub(*construct_stub);
|
|
result->shared()->DontAdaptArguments();
|
|
|
|
// Recursively copy parent instance templates' accessors,
|
|
// 'data' may be modified.
|
|
int max_number_of_additional_properties = 0;
|
|
int max_number_of_static_properties = 0;
|
|
FunctionTemplateInfo* info = *obj;
|
|
while (true) {
|
|
if (!info->instance_template()->IsUndefined()) {
|
|
Object* props =
|
|
ObjectTemplateInfo::cast(
|
|
info->instance_template())->property_accessors();
|
|
if (!props->IsUndefined()) {
|
|
Handle<Object> props_handle(props, isolate());
|
|
NeanderArray props_array(props_handle);
|
|
max_number_of_additional_properties += props_array.length();
|
|
}
|
|
}
|
|
if (!info->property_accessors()->IsUndefined()) {
|
|
Object* props = info->property_accessors();
|
|
if (!props->IsUndefined()) {
|
|
Handle<Object> props_handle(props, isolate());
|
|
NeanderArray props_array(props_handle);
|
|
max_number_of_static_properties += props_array.length();
|
|
}
|
|
}
|
|
Object* parent = info->parent_template();
|
|
if (parent->IsUndefined()) break;
|
|
info = FunctionTemplateInfo::cast(parent);
|
|
}
|
|
|
|
Map::EnsureDescriptorSlack(map, max_number_of_additional_properties);
|
|
|
|
// Use a temporary FixedArray to acculumate static accessors
|
|
int valid_descriptors = 0;
|
|
Handle<FixedArray> array;
|
|
if (max_number_of_static_properties > 0) {
|
|
array = NewFixedArray(max_number_of_static_properties);
|
|
}
|
|
|
|
while (true) {
|
|
// Install instance descriptors
|
|
if (!obj->instance_template()->IsUndefined()) {
|
|
Handle<ObjectTemplateInfo> instance =
|
|
Handle<ObjectTemplateInfo>(
|
|
ObjectTemplateInfo::cast(obj->instance_template()), isolate());
|
|
Handle<Object> props = Handle<Object>(instance->property_accessors(),
|
|
isolate());
|
|
if (!props->IsUndefined()) {
|
|
Map::AppendCallbackDescriptors(map, props);
|
|
}
|
|
}
|
|
// Accumulate static accessors
|
|
if (!obj->property_accessors()->IsUndefined()) {
|
|
Handle<Object> props = Handle<Object>(obj->property_accessors(),
|
|
isolate());
|
|
valid_descriptors =
|
|
AccessorInfo::AppendUnique(props, array, valid_descriptors);
|
|
}
|
|
// Climb parent chain
|
|
Handle<Object> parent = Handle<Object>(obj->parent_template(), isolate());
|
|
if (parent->IsUndefined()) break;
|
|
obj = Handle<FunctionTemplateInfo>::cast(parent);
|
|
}
|
|
|
|
// Install accumulated static accessors
|
|
for (int i = 0; i < valid_descriptors; i++) {
|
|
Handle<AccessorInfo> accessor(AccessorInfo::cast(array->get(i)));
|
|
JSObject::SetAccessor(result, accessor);
|
|
}
|
|
|
|
ASSERT(result->shared()->IsApiFunction());
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<MapCache> Factory::NewMapCache(int at_least_space_for) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
MapCache::Allocate(isolate()->heap(),
|
|
at_least_space_for),
|
|
MapCache);
|
|
}
|
|
|
|
|
|
MUST_USE_RESULT static MaybeObject* UpdateMapCacheWith(Context* context,
|
|
FixedArray* keys,
|
|
Map* map) {
|
|
Object* result;
|
|
{ MaybeObject* maybe_result =
|
|
MapCache::cast(context->map_cache())->Put(keys, map);
|
|
if (!maybe_result->ToObject(&result)) return maybe_result;
|
|
}
|
|
context->set_map_cache(MapCache::cast(result));
|
|
return result;
|
|
}
|
|
|
|
|
|
Handle<MapCache> Factory::AddToMapCache(Handle<Context> context,
|
|
Handle<FixedArray> keys,
|
|
Handle<Map> map) {
|
|
CALL_HEAP_FUNCTION(isolate(),
|
|
UpdateMapCacheWith(*context, *keys, *map), MapCache);
|
|
}
|
|
|
|
|
|
Handle<Map> Factory::ObjectLiteralMapFromCache(Handle<Context> context,
|
|
Handle<FixedArray> keys) {
|
|
if (context->map_cache()->IsUndefined()) {
|
|
// Allocate the new map cache for the native context.
|
|
Handle<MapCache> new_cache = NewMapCache(24);
|
|
context->set_map_cache(*new_cache);
|
|
}
|
|
// Check to see whether there is a matching element in the cache.
|
|
Handle<MapCache> cache =
|
|
Handle<MapCache>(MapCache::cast(context->map_cache()));
|
|
Handle<Object> result = Handle<Object>(cache->Lookup(*keys), isolate());
|
|
if (result->IsMap()) return Handle<Map>::cast(result);
|
|
// Create a new map and add it to the cache.
|
|
Handle<Map> map = Map::Create(
|
|
handle(context->object_function()), keys->length());
|
|
AddToMapCache(context, keys, map);
|
|
return map;
|
|
}
|
|
|
|
|
|
void Factory::SetRegExpAtomData(Handle<JSRegExp> regexp,
|
|
JSRegExp::Type type,
|
|
Handle<String> source,
|
|
JSRegExp::Flags flags,
|
|
Handle<Object> data) {
|
|
Handle<FixedArray> store = NewFixedArray(JSRegExp::kAtomDataSize);
|
|
|
|
store->set(JSRegExp::kTagIndex, Smi::FromInt(type));
|
|
store->set(JSRegExp::kSourceIndex, *source);
|
|
store->set(JSRegExp::kFlagsIndex, Smi::FromInt(flags.value()));
|
|
store->set(JSRegExp::kAtomPatternIndex, *data);
|
|
regexp->set_data(*store);
|
|
}
|
|
|
|
void Factory::SetRegExpIrregexpData(Handle<JSRegExp> regexp,
|
|
JSRegExp::Type type,
|
|
Handle<String> source,
|
|
JSRegExp::Flags flags,
|
|
int capture_count) {
|
|
Handle<FixedArray> store = NewFixedArray(JSRegExp::kIrregexpDataSize);
|
|
Smi* uninitialized = Smi::FromInt(JSRegExp::kUninitializedValue);
|
|
store->set(JSRegExp::kTagIndex, Smi::FromInt(type));
|
|
store->set(JSRegExp::kSourceIndex, *source);
|
|
store->set(JSRegExp::kFlagsIndex, Smi::FromInt(flags.value()));
|
|
store->set(JSRegExp::kIrregexpASCIICodeIndex, uninitialized);
|
|
store->set(JSRegExp::kIrregexpUC16CodeIndex, uninitialized);
|
|
store->set(JSRegExp::kIrregexpASCIICodeSavedIndex, uninitialized);
|
|
store->set(JSRegExp::kIrregexpUC16CodeSavedIndex, uninitialized);
|
|
store->set(JSRegExp::kIrregexpMaxRegisterCountIndex, Smi::FromInt(0));
|
|
store->set(JSRegExp::kIrregexpCaptureCountIndex,
|
|
Smi::FromInt(capture_count));
|
|
regexp->set_data(*store);
|
|
}
|
|
|
|
|
|
|
|
MaybeHandle<FunctionTemplateInfo> Factory::ConfigureInstance(
|
|
Handle<FunctionTemplateInfo> desc, Handle<JSObject> instance) {
|
|
// Configure the instance by adding the properties specified by the
|
|
// instance template.
|
|
Handle<Object> instance_template(desc->instance_template(), isolate());
|
|
if (!instance_template->IsUndefined()) {
|
|
RETURN_ON_EXCEPTION(
|
|
isolate(),
|
|
Execution::ConfigureInstance(isolate(), instance, instance_template),
|
|
FunctionTemplateInfo);
|
|
}
|
|
return desc;
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::GlobalConstantFor(Handle<String> name) {
|
|
if (String::Equals(name, undefined_string())) return undefined_value();
|
|
if (String::Equals(name, nan_string())) return nan_value();
|
|
if (String::Equals(name, infinity_string())) return infinity_value();
|
|
return Handle<Object>::null();
|
|
}
|
|
|
|
|
|
Handle<Object> Factory::ToBoolean(bool value) {
|
|
return value ? true_value() : false_value();
|
|
}
|
|
|
|
} } // namespace v8::internal
|