| Index: src/heap.cc
|
| diff --git a/src/heap.cc b/src/heap.cc
|
| index 5713537b5ab301076c51706d77f3eef5e5713970..d0acfb29dd649795782c54bc6ca0c03dafe8c093 100644
|
| --- a/src/heap.cc
|
| +++ b/src/heap.cc
|
| @@ -3387,31 +3387,6 @@ MaybeObject* Heap::AllocateForeign(Address address, PretenureFlag pretenure) {
|
| }
|
|
|
|
|
| -MaybeObject* Heap::LookupSingleCharacterStringFromCode(uint16_t code) {
|
| - if (code <= String::kMaxOneByteCharCode) {
|
| - Object* value = single_character_string_cache()->get(code);
|
| - if (value != undefined_value()) return value;
|
| -
|
| - uint8_t buffer[1];
|
| - buffer[0] = static_cast<uint8_t>(code);
|
| - Object* result;
|
| - OneByteStringKey key(Vector<const uint8_t>(buffer, 1), HashSeed());
|
| - MaybeObject* maybe_result = InternalizeStringWithKey(&key);
|
| -
|
| - if (!maybe_result->ToObject(&result)) return maybe_result;
|
| - single_character_string_cache()->set(code, result);
|
| - return result;
|
| - }
|
| -
|
| - SeqTwoByteString* result;
|
| - { MaybeObject* maybe_result = AllocateRawTwoByteString(1, NOT_TENURED);
|
| - if (!maybe_result->To<SeqTwoByteString>(&result)) return maybe_result;
|
| - }
|
| - result->SeqTwoByteStringSet(0, code);
|
| - return result;
|
| -}
|
| -
|
| -
|
| MaybeObject* Heap::AllocateByteArray(int length, PretenureFlag pretenure) {
|
| if (length < 0 || length > ByteArray::kMaxLength) {
|
| v8::internal::Heap::FatalProcessOutOfMemory("invalid array length", true);
|
| @@ -4875,28 +4850,6 @@ void Heap::Verify() {
|
| #endif
|
|
|
|
|
| -MaybeObject* Heap::InternalizeUtf8String(Vector<const char> string) {
|
| - Utf8StringKey key(string, HashSeed());
|
| - return InternalizeStringWithKey(&key);
|
| -}
|
| -
|
| -
|
| -MaybeObject* Heap::InternalizeString(String* string) {
|
| - if (string->IsInternalizedString()) return string;
|
| - Object* result = NULL;
|
| - Object* new_table;
|
| - { MaybeObject* maybe_new_table =
|
| - string_table()->LookupString(string, &result);
|
| - if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table;
|
| - }
|
| - // Can't use set_string_table because StringTable::cast knows that
|
| - // StringTable is a singleton and checks for identity.
|
| - roots_[kStringTableRootIndex] = new_table;
|
| - ASSERT(result != NULL);
|
| - return result;
|
| -}
|
| -
|
| -
|
| bool Heap::InternalizeStringIfExists(String* string, String** result) {
|
| if (string->IsInternalizedString()) {
|
| *result = string;
|
| @@ -4906,21 +4859,6 @@ bool Heap::InternalizeStringIfExists(String* string, String** result) {
|
| }
|
|
|
|
|
| -MaybeObject* Heap::InternalizeStringWithKey(HashTableKey* key) {
|
| - Object* result = NULL;
|
| - Object* new_table;
|
| - { MaybeObject* maybe_new_table =
|
| - string_table()->LookupKey(key, &result);
|
| - if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table;
|
| - }
|
| - // Can't use set_string_table because StringTable::cast knows that
|
| - // StringTable is a singleton and checks for identity.
|
| - roots_[kStringTableRootIndex] = new_table;
|
| - ASSERT(result != NULL);
|
| - return result;
|
| -}
|
| -
|
| -
|
| void Heap::ZapFromSpace() {
|
| NewSpacePageIterator it(new_space_.FromSpaceStart(),
|
| new_space_.FromSpaceEnd());
|
|
|