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 24 matching lines...) Expand all Loading... |
35 | 35 |
36 namespace v8 { namespace internal { | 36 namespace v8 { namespace internal { |
37 | 37 |
38 | 38 |
39 Handle<FixedArray> Factory::NewFixedArray(int size, PretenureFlag pretenure) { | 39 Handle<FixedArray> Factory::NewFixedArray(int size, PretenureFlag pretenure) { |
40 ASSERT(0 <= size); | 40 ASSERT(0 <= size); |
41 CALL_HEAP_FUNCTION(Heap::AllocateFixedArray(size, pretenure), FixedArray); | 41 CALL_HEAP_FUNCTION(Heap::AllocateFixedArray(size, pretenure), FixedArray); |
42 } | 42 } |
43 | 43 |
44 | 44 |
| 45 Handle<FixedArray> Factory::NewFixedArrayWithHoles(int size) { |
| 46 ASSERT(0 <= size); |
| 47 CALL_HEAP_FUNCTION(Heap::AllocateFixedArrayWithHoles(size), FixedArray); |
| 48 } |
| 49 |
| 50 |
45 Handle<Dictionary> Factory::NewDictionary(int at_least_space_for) { | 51 Handle<Dictionary> Factory::NewDictionary(int at_least_space_for) { |
46 ASSERT(0 <= at_least_space_for); | 52 ASSERT(0 <= at_least_space_for); |
47 CALL_HEAP_FUNCTION(Dictionary::Allocate(at_least_space_for), Dictionary); | 53 CALL_HEAP_FUNCTION(Dictionary::Allocate(at_least_space_for), Dictionary); |
48 } | 54 } |
49 | 55 |
50 | 56 |
51 Handle<DescriptorArray> Factory::NewDescriptorArray(int number_of_descriptors) { | 57 Handle<DescriptorArray> Factory::NewDescriptorArray(int number_of_descriptors) { |
52 ASSERT(0 <= number_of_descriptors); | 58 ASSERT(0 <= number_of_descriptors); |
53 CALL_HEAP_FUNCTION(DescriptorArray::Allocate(number_of_descriptors), | 59 CALL_HEAP_FUNCTION(DescriptorArray::Allocate(number_of_descriptors), |
54 DescriptorArray); | 60 DescriptorArray); |
(...skipping 783 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
838 Execution::ConfigureInstance(instance, | 844 Execution::ConfigureInstance(instance, |
839 instance_template, | 845 instance_template, |
840 pending_exception); | 846 pending_exception); |
841 } else { | 847 } else { |
842 *pending_exception = false; | 848 *pending_exception = false; |
843 } | 849 } |
844 } | 850 } |
845 | 851 |
846 | 852 |
847 } } // namespace v8::internal | 853 } } // namespace v8::internal |
OLD | NEW |