OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 123 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
134 isolate(), number_of_descriptors, slack), | 134 isolate(), number_of_descriptors, slack), |
135 DescriptorArray); | 135 DescriptorArray); |
136 } | 136 } |
137 | 137 |
138 | 138 |
139 Handle<DeoptimizationInputData> Factory::NewDeoptimizationInputData( | 139 Handle<DeoptimizationInputData> Factory::NewDeoptimizationInputData( |
140 int deopt_entry_count, | 140 int deopt_entry_count, |
141 PretenureFlag pretenure) { | 141 PretenureFlag pretenure) { |
142 ASSERT(deopt_entry_count > 0); | 142 ASSERT(deopt_entry_count > 0); |
143 CALL_HEAP_FUNCTION(isolate(), | 143 CALL_HEAP_FUNCTION(isolate(), |
144 DeoptimizationInputData::Allocate(deopt_entry_count, | 144 DeoptimizationInputData::Allocate(isolate(), |
| 145 deopt_entry_count, |
145 pretenure), | 146 pretenure), |
146 DeoptimizationInputData); | 147 DeoptimizationInputData); |
147 } | 148 } |
148 | 149 |
149 | 150 |
150 Handle<DeoptimizationOutputData> Factory::NewDeoptimizationOutputData( | 151 Handle<DeoptimizationOutputData> Factory::NewDeoptimizationOutputData( |
151 int deopt_entry_count, | 152 int deopt_entry_count, |
152 PretenureFlag pretenure) { | 153 PretenureFlag pretenure) { |
153 ASSERT(deopt_entry_count > 0); | 154 ASSERT(deopt_entry_count > 0); |
154 CALL_HEAP_FUNCTION(isolate(), | 155 CALL_HEAP_FUNCTION(isolate(), |
155 DeoptimizationOutputData::Allocate(deopt_entry_count, | 156 DeoptimizationOutputData::Allocate(isolate(), |
| 157 deopt_entry_count, |
156 pretenure), | 158 pretenure), |
157 DeoptimizationOutputData); | 159 DeoptimizationOutputData); |
158 } | 160 } |
159 | 161 |
160 | 162 |
161 Handle<AccessorPair> Factory::NewAccessorPair() { | 163 Handle<AccessorPair> Factory::NewAccessorPair() { |
162 CALL_HEAP_FUNCTION(isolate(), | 164 CALL_HEAP_FUNCTION(isolate(), |
163 isolate()->heap()->AllocateAccessorPair(), | 165 isolate()->heap()->AllocateAccessorPair(), |
164 AccessorPair); | 166 AccessorPair); |
165 } | 167 } |
(...skipping 1473 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1639 return Handle<Object>::null(); | 1641 return Handle<Object>::null(); |
1640 } | 1642 } |
1641 | 1643 |
1642 | 1644 |
1643 Handle<Object> Factory::ToBoolean(bool value) { | 1645 Handle<Object> Factory::ToBoolean(bool value) { |
1644 return value ? true_value() : false_value(); | 1646 return value ? true_value() : false_value(); |
1645 } | 1647 } |
1646 | 1648 |
1647 | 1649 |
1648 } } // namespace v8::internal | 1650 } } // namespace v8::internal |
OLD | NEW |