| 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 25 matching lines...) Expand all Loading... |
| 36 namespace v8 { | 36 namespace v8 { |
| 37 namespace internal { | 37 namespace internal { |
| 38 | 38 |
| 39 | 39 |
| 40 Handle<FixedArray> Factory::NewFixedArray(int size, PretenureFlag pretenure) { | 40 Handle<FixedArray> Factory::NewFixedArray(int size, PretenureFlag pretenure) { |
| 41 ASSERT(0 <= size); | 41 ASSERT(0 <= size); |
| 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::NewUninitializedFixedArray(int size) { | |
| 47 ASSERT(0 <= size); | |
| 48 CALL_HEAP_FUNCTION(Heap::AllocateUninitializedFixedArray(size), FixedArray); | |
| 49 } | |
| 50 | |
| 51 | |
| 52 Handle<FixedArray> Factory::NewFixedArrayWithHoles(int size) { | 46 Handle<FixedArray> Factory::NewFixedArrayWithHoles(int size) { |
| 53 ASSERT(0 <= size); | 47 ASSERT(0 <= size); |
| 54 CALL_HEAP_FUNCTION(Heap::AllocateFixedArrayWithHoles(size), FixedArray); | 48 CALL_HEAP_FUNCTION(Heap::AllocateFixedArrayWithHoles(size), FixedArray); |
| 55 } | 49 } |
| 56 | 50 |
| 57 | 51 |
| 58 Handle<StringDictionary> Factory::NewStringDictionary(int at_least_space_for) { | 52 Handle<StringDictionary> Factory::NewStringDictionary(int at_least_space_for) { |
| 59 ASSERT(0 <= at_least_space_for); | 53 ASSERT(0 <= at_least_space_for); |
| 60 CALL_HEAP_FUNCTION(StringDictionary::Allocate(at_least_space_for), | 54 CALL_HEAP_FUNCTION(StringDictionary::Allocate(at_least_space_for), |
| 61 StringDictionary); | 55 StringDictionary); |
| (...skipping 900 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 962 Execution::ConfigureInstance(instance, | 956 Execution::ConfigureInstance(instance, |
| 963 instance_template, | 957 instance_template, |
| 964 pending_exception); | 958 pending_exception); |
| 965 } else { | 959 } else { |
| 966 *pending_exception = false; | 960 *pending_exception = false; |
| 967 } | 961 } |
| 968 } | 962 } |
| 969 | 963 |
| 970 | 964 |
| 971 } } // namespace v8::internal | 965 } } // namespace v8::internal |
| OLD | NEW |