| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 42 CALL_HEAP_FUNCTION(Heap::AllocateFixedArray(size, pretenure), FixedArray); | 42 CALL_HEAP_FUNCTION(Heap::AllocateFixedArray(size, pretenure), FixedArray); |
| 43 } | 43 } |
| 44 | 44 |
| 45 | 45 |
| 46 Handle<FixedArray> Factory::NewFixedArrayWithHoles(int size) { | 46 Handle<FixedArray> Factory::NewFixedArrayWithHoles(int size) { |
| 47 ASSERT(0 <= size); | 47 ASSERT(0 <= size); |
| 48 CALL_HEAP_FUNCTION(Heap::AllocateFixedArrayWithHoles(size), FixedArray); | 48 CALL_HEAP_FUNCTION(Heap::AllocateFixedArrayWithHoles(size), FixedArray); |
| 49 } | 49 } |
| 50 | 50 |
| 51 | 51 |
| 52 Handle<StringDictionary> Factory::NewStringDictionary(int at_least_space_for) { | 52 Handle<Dictionary> Factory::NewDictionary(int at_least_space_for) { |
| 53 ASSERT(0 <= at_least_space_for); | 53 ASSERT(0 <= at_least_space_for); |
| 54 CALL_HEAP_FUNCTION(StringDictionary::Allocate(at_least_space_for), | 54 CALL_HEAP_FUNCTION(Dictionary::Allocate(at_least_space_for), Dictionary); |
| 55 StringDictionary); | |
| 56 } | |
| 57 | |
| 58 | |
| 59 Handle<NumberDictionary> Factory::NewNumberDictionary(int at_least_space_for) { | |
| 60 ASSERT(0 <= at_least_space_for); | |
| 61 CALL_HEAP_FUNCTION(NumberDictionary::Allocate(at_least_space_for), | |
| 62 NumberDictionary); | |
| 63 } | 55 } |
| 64 | 56 |
| 65 | 57 |
| 66 Handle<DescriptorArray> Factory::NewDescriptorArray(int number_of_descriptors) { | 58 Handle<DescriptorArray> Factory::NewDescriptorArray(int number_of_descriptors) { |
| 67 ASSERT(0 <= number_of_descriptors); | 59 ASSERT(0 <= number_of_descriptors); |
| 68 CALL_HEAP_FUNCTION(DescriptorArray::Allocate(number_of_descriptors), | 60 CALL_HEAP_FUNCTION(DescriptorArray::Allocate(number_of_descriptors), |
| 69 DescriptorArray); | 61 DescriptorArray); |
| 70 } | 62 } |
| 71 | 63 |
| 72 | 64 |
| (...skipping 583 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 656 return result; | 648 return result; |
| 657 } | 649 } |
| 658 | 650 |
| 659 | 651 |
| 660 Handle<SharedFunctionInfo> Factory::NewSharedFunctionInfo(Handle<String> name) { | 652 Handle<SharedFunctionInfo> Factory::NewSharedFunctionInfo(Handle<String> name) { |
| 661 CALL_HEAP_FUNCTION(Heap::AllocateSharedFunctionInfo(*name), | 653 CALL_HEAP_FUNCTION(Heap::AllocateSharedFunctionInfo(*name), |
| 662 SharedFunctionInfo); | 654 SharedFunctionInfo); |
| 663 } | 655 } |
| 664 | 656 |
| 665 | 657 |
| 666 Handle<NumberDictionary> Factory::DictionaryAtNumberPut( | 658 Handle<Dictionary> Factory::DictionaryAtNumberPut(Handle<Dictionary> dictionary, |
| 667 Handle<NumberDictionary> dictionary, | 659 uint32_t key, |
| 668 uint32_t key, | 660 Handle<Object> value) { |
| 669 Handle<Object> value) { | 661 CALL_HEAP_FUNCTION(dictionary->AtNumberPut(key, *value), Dictionary); |
| 670 CALL_HEAP_FUNCTION(dictionary->AtNumberPut(key, *value), NumberDictionary); | |
| 671 } | 662 } |
| 672 | 663 |
| 673 | 664 |
| 674 Handle<JSFunction> Factory::NewFunctionHelper(Handle<String> name, | 665 Handle<JSFunction> Factory::NewFunctionHelper(Handle<String> name, |
| 675 Handle<Object> prototype) { | 666 Handle<Object> prototype) { |
| 676 Handle<SharedFunctionInfo> function_share = NewSharedFunctionInfo(name); | 667 Handle<SharedFunctionInfo> function_share = NewSharedFunctionInfo(name); |
| 677 CALL_HEAP_FUNCTION(Heap::AllocateFunction(*Top::function_map(), | 668 CALL_HEAP_FUNCTION(Heap::AllocateFunction(*Top::function_map(), |
| 678 *function_share, | 669 *function_share, |
| 679 *prototype), | 670 *prototype), |
| 680 JSFunction); | 671 JSFunction); |
| (...skipping 238 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 919 Execution::ConfigureInstance(instance, | 910 Execution::ConfigureInstance(instance, |
| 920 instance_template, | 911 instance_template, |
| 921 pending_exception); | 912 pending_exception); |
| 922 } else { | 913 } else { |
| 923 *pending_exception = false; | 914 *pending_exception = false; |
| 924 } | 915 } |
| 925 } | 916 } |
| 926 | 917 |
| 927 | 918 |
| 928 } } // namespace v8::internal | 919 } } // namespace v8::internal |
| OLD | NEW |