OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_FACTORY_H_ | 5 #ifndef V8_FACTORY_H_ |
6 #define V8_FACTORY_H_ | 6 #define V8_FACTORY_H_ |
7 | 7 |
8 #include "isolate.h" | 8 #include "isolate.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
(...skipping 30 matching lines...) Expand all Loading... |
41 Handle<FixedDoubleArray> NewFixedDoubleArrayWithHoles( | 41 Handle<FixedDoubleArray> NewFixedDoubleArrayWithHoles( |
42 int size, | 42 int size, |
43 PretenureFlag pretenure = NOT_TENURED); | 43 PretenureFlag pretenure = NOT_TENURED); |
44 | 44 |
45 Handle<ConstantPoolArray> NewConstantPoolArray( | 45 Handle<ConstantPoolArray> NewConstantPoolArray( |
46 int number_of_int64_entries, | 46 int number_of_int64_entries, |
47 int number_of_code_ptr_entries, | 47 int number_of_code_ptr_entries, |
48 int number_of_heap_ptr_entries, | 48 int number_of_heap_ptr_entries, |
49 int number_of_int32_entries); | 49 int number_of_int32_entries); |
50 | 50 |
51 Handle<SeededNumberDictionary> NewSeededNumberDictionary( | |
52 int at_least_space_for); | |
53 | |
54 Handle<UnseededNumberDictionary> NewUnseededNumberDictionary( | |
55 int at_least_space_for); | |
56 | |
57 Handle<NameDictionary> NewNameDictionary(int at_least_space_for); | |
58 | |
59 Handle<ObjectHashTable> NewObjectHashTable( | 51 Handle<ObjectHashTable> NewObjectHashTable( |
60 int at_least_space_for, | 52 int at_least_space_for, |
61 MinimumCapacity capacity_option = USE_DEFAULT_MINIMUM_CAPACITY); | 53 MinimumCapacity capacity_option = USE_DEFAULT_MINIMUM_CAPACITY); |
62 | 54 |
63 Handle<OrderedHashSet> NewOrderedHashSet(); | 55 Handle<OrderedHashSet> NewOrderedHashSet(); |
64 Handle<OrderedHashMap> NewOrderedHashMap(); | 56 Handle<OrderedHashMap> NewOrderedHashMap(); |
65 | 57 |
66 Handle<WeakHashTable> NewWeakHashTable(int at_least_space_for); | 58 Handle<WeakHashTable> NewWeakHashTable(int at_least_space_for); |
67 | 59 |
68 Handle<DeoptimizationInputData> NewDeoptimizationInputData( | 60 Handle<DeoptimizationInputData> NewDeoptimizationInputData( |
(...skipping 610 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
679 // the string representation of the number. Otherwise return undefined. | 671 // the string representation of the number. Otherwise return undefined. |
680 Handle<Object> GetNumberStringCache(Handle<Object> number); | 672 Handle<Object> GetNumberStringCache(Handle<Object> number); |
681 | 673 |
682 // Update the cache with a new number-string pair. | 674 // Update the cache with a new number-string pair. |
683 void SetNumberStringCache(Handle<Object> number, Handle<String> string); | 675 void SetNumberStringCache(Handle<Object> number, Handle<String> string); |
684 }; | 676 }; |
685 | 677 |
686 } } // namespace v8::internal | 678 } } // namespace v8::internal |
687 | 679 |
688 #endif // V8_FACTORY_H_ | 680 #endif // V8_FACTORY_H_ |
OLD | NEW |