OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
63 Handle<FixedDoubleArray> Factory::NewFixedDoubleArray(int size, | 63 Handle<FixedDoubleArray> Factory::NewFixedDoubleArray(int size, |
64 PretenureFlag pretenure) { | 64 PretenureFlag pretenure) { |
65 ASSERT(0 <= size); | 65 ASSERT(0 <= size); |
66 CALL_HEAP_FUNCTION( | 66 CALL_HEAP_FUNCTION( |
67 isolate(), | 67 isolate(), |
68 isolate()->heap()->AllocateUninitializedFixedDoubleArray(size, pretenure), | 68 isolate()->heap()->AllocateUninitializedFixedDoubleArray(size, pretenure), |
69 FixedDoubleArray); | 69 FixedDoubleArray); |
70 } | 70 } |
71 | 71 |
72 | 72 |
73 Handle<StringDictionary> Factory::NewStringDictionary(int at_least_space_for) { | 73 Handle<NameDictionary> Factory::NewNameDictionary(int at_least_space_for) { |
74 ASSERT(0 <= at_least_space_for); | 74 ASSERT(0 <= at_least_space_for); |
75 CALL_HEAP_FUNCTION(isolate(), | 75 CALL_HEAP_FUNCTION(isolate(), |
76 StringDictionary::Allocate(at_least_space_for), | 76 NameDictionary::Allocate(at_least_space_for), |
77 StringDictionary); | 77 NameDictionary); |
78 } | 78 } |
79 | 79 |
80 | 80 |
81 Handle<SeededNumberDictionary> Factory::NewSeededNumberDictionary( | 81 Handle<SeededNumberDictionary> Factory::NewSeededNumberDictionary( |
82 int at_least_space_for) { | 82 int at_least_space_for) { |
83 ASSERT(0 <= at_least_space_for); | 83 ASSERT(0 <= at_least_space_for); |
84 CALL_HEAP_FUNCTION(isolate(), | 84 CALL_HEAP_FUNCTION(isolate(), |
85 SeededNumberDictionary::Allocate(at_least_space_for), | 85 SeededNumberDictionary::Allocate(at_least_space_for), |
86 SeededNumberDictionary); | 86 SeededNumberDictionary); |
87 } | 87 } |
(...skipping 1365 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1453 | 1453 |
1454 | 1454 |
1455 Handle<Object> Factory::ToBoolean(bool value) { | 1455 Handle<Object> Factory::ToBoolean(bool value) { |
1456 return Handle<Object>(value | 1456 return Handle<Object>(value |
1457 ? isolate()->heap()->true_value() | 1457 ? isolate()->heap()->true_value() |
1458 : isolate()->heap()->false_value()); | 1458 : isolate()->heap()->false_value()); |
1459 } | 1459 } |
1460 | 1460 |
1461 | 1461 |
1462 } } // namespace v8::internal | 1462 } } // namespace v8::internal |
OLD | NEW |