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 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
43 Handle<FixedArrayBase> NewFixedDoubleArrayWithHoles( | 43 Handle<FixedArrayBase> NewFixedDoubleArrayWithHoles( |
44 int size, | 44 int size, |
45 PretenureFlag pretenure = NOT_TENURED); | 45 PretenureFlag pretenure = NOT_TENURED); |
46 | 46 |
47 Handle<ConstantPoolArray> NewConstantPoolArray( | 47 Handle<ConstantPoolArray> NewConstantPoolArray( |
48 int number_of_int64_entries, | 48 int number_of_int64_entries, |
49 int number_of_code_ptr_entries, | 49 int number_of_code_ptr_entries, |
50 int number_of_heap_ptr_entries, | 50 int number_of_heap_ptr_entries, |
51 int number_of_int32_entries); | 51 int number_of_int32_entries); |
52 | 52 |
53 Handle<ObjectHashTable> NewObjectHashTable( | |
54 int at_least_space_for, | |
55 MinimumCapacity capacity_option = USE_DEFAULT_MINIMUM_CAPACITY); | |
56 | |
57 Handle<OrderedHashSet> NewOrderedHashSet(); | 53 Handle<OrderedHashSet> NewOrderedHashSet(); |
58 Handle<OrderedHashMap> NewOrderedHashMap(); | 54 Handle<OrderedHashMap> NewOrderedHashMap(); |
59 | 55 |
60 Handle<WeakHashTable> NewWeakHashTable(int at_least_space_for); | |
61 | |
62 Handle<DeoptimizationInputData> NewDeoptimizationInputData( | 56 Handle<DeoptimizationInputData> NewDeoptimizationInputData( |
63 int deopt_entry_count, | 57 int deopt_entry_count, |
64 PretenureFlag pretenure); | 58 PretenureFlag pretenure); |
65 Handle<DeoptimizationOutputData> NewDeoptimizationOutputData( | 59 Handle<DeoptimizationOutputData> NewDeoptimizationOutputData( |
66 int deopt_entry_count, | 60 int deopt_entry_count, |
67 PretenureFlag pretenure); | 61 PretenureFlag pretenure); |
68 | 62 |
69 // Create a new boxed value. | 63 // Create a new boxed value. |
70 Handle<Box> NewBox(Handle<Object> value); | 64 Handle<Box> NewBox(Handle<Object> value); |
71 | 65 |
(...skipping 601 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
673 // the string representation of the number. Otherwise return undefined. | 667 // the string representation of the number. Otherwise return undefined. |
674 Handle<Object> GetNumberStringCache(Handle<Object> number); | 668 Handle<Object> GetNumberStringCache(Handle<Object> number); |
675 | 669 |
676 // Update the cache with a new number-string pair. | 670 // Update the cache with a new number-string pair. |
677 void SetNumberStringCache(Handle<Object> number, Handle<String> string); | 671 void SetNumberStringCache(Handle<Object> number, Handle<String> string); |
678 }; | 672 }; |
679 | 673 |
680 } } // namespace v8::internal | 674 } } // namespace v8::internal |
681 | 675 |
682 #endif // V8_FACTORY_H_ | 676 #endif // V8_FACTORY_H_ |
OLD | NEW |