OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 1933 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1944 if (!maybe_result->To(&info)) return maybe_result; | 1944 if (!maybe_result->To(&info)) return maybe_result; |
1945 } | 1945 } |
1946 info->set_ic_total_count(0); | 1946 info->set_ic_total_count(0); |
1947 info->set_ic_with_typeinfo_count(0); | 1947 info->set_ic_with_typeinfo_count(0); |
1948 info->set_type_feedback_cells(TypeFeedbackCells::cast(empty_fixed_array()), | 1948 info->set_type_feedback_cells(TypeFeedbackCells::cast(empty_fixed_array()), |
1949 SKIP_WRITE_BARRIER); | 1949 SKIP_WRITE_BARRIER); |
1950 return info; | 1950 return info; |
1951 } | 1951 } |
1952 | 1952 |
1953 | 1953 |
| 1954 MaybeObject* Heap::AllocateAliasedArgumentsEntry(int aliased_context_slot) { |
| 1955 AliasedArgumentsEntry* entry; |
| 1956 { MaybeObject* maybe_result = AllocateStruct(ALIASED_ARGUMENTS_ENTRY_TYPE); |
| 1957 if (!maybe_result->To(&entry)) return maybe_result; |
| 1958 } |
| 1959 entry->set_aliased_context_slot(aliased_context_slot); |
| 1960 return entry; |
| 1961 } |
| 1962 |
| 1963 |
1954 const Heap::StringTypeTable Heap::string_type_table[] = { | 1964 const Heap::StringTypeTable Heap::string_type_table[] = { |
1955 #define STRING_TYPE_ELEMENT(type, size, name, camel_name) \ | 1965 #define STRING_TYPE_ELEMENT(type, size, name, camel_name) \ |
1956 {type, size, k##camel_name##MapRootIndex}, | 1966 {type, size, k##camel_name##MapRootIndex}, |
1957 STRING_TYPE_LIST(STRING_TYPE_ELEMENT) | 1967 STRING_TYPE_LIST(STRING_TYPE_ELEMENT) |
1958 #undef STRING_TYPE_ELEMENT | 1968 #undef STRING_TYPE_ELEMENT |
1959 }; | 1969 }; |
1960 | 1970 |
1961 | 1971 |
1962 const Heap::ConstantSymbolTable Heap::constant_symbol_table[] = { | 1972 const Heap::ConstantSymbolTable Heap::constant_symbol_table[] = { |
1963 #define CONSTANT_SYMBOL_ELEMENT(name, contents) \ | 1973 #define CONSTANT_SYMBOL_ELEMENT(name, contents) \ |
(...skipping 4966 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6930 isolate_->heap()->store_buffer()->Compact(); | 6940 isolate_->heap()->store_buffer()->Compact(); |
6931 isolate_->heap()->store_buffer()->Filter(MemoryChunk::ABOUT_TO_BE_FREED); | 6941 isolate_->heap()->store_buffer()->Filter(MemoryChunk::ABOUT_TO_BE_FREED); |
6932 for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) { | 6942 for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) { |
6933 next = chunk->next_chunk(); | 6943 next = chunk->next_chunk(); |
6934 isolate_->memory_allocator()->Free(chunk); | 6944 isolate_->memory_allocator()->Free(chunk); |
6935 } | 6945 } |
6936 chunks_queued_for_free_ = NULL; | 6946 chunks_queued_for_free_ = NULL; |
6937 } | 6947 } |
6938 | 6948 |
6939 } } // namespace v8::internal | 6949 } } // namespace v8::internal |
OLD | NEW |