OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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_TRANSITIONS_INL_H_ | 5 #ifndef V8_TRANSITIONS_INL_H_ |
6 #define V8_TRANSITIONS_INL_H_ | 6 #define V8_TRANSITIONS_INL_H_ |
7 | 7 |
8 #include "src/transitions.h" | 8 #include "src/transitions.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
(...skipping 136 matching lines...) Loading... |
147 void TransitionArray::NoIncrementalWriteBarrierSet(int transition_number, | 147 void TransitionArray::NoIncrementalWriteBarrierSet(int transition_number, |
148 Name* key, | 148 Name* key, |
149 Map* target) { | 149 Map* target) { |
150 FixedArray::NoIncrementalWriteBarrierSet( | 150 FixedArray::NoIncrementalWriteBarrierSet( |
151 this, ToKeyIndex(transition_number), key); | 151 this, ToKeyIndex(transition_number), key); |
152 FixedArray::NoIncrementalWriteBarrierSet( | 152 FixedArray::NoIncrementalWriteBarrierSet( |
153 this, ToTargetIndex(transition_number), target); | 153 this, ToTargetIndex(transition_number), target); |
154 } | 154 } |
155 | 155 |
156 | 156 |
| 157 void TransitionArray::SetNumberOfTransitions(int number_of_transitions) { |
| 158 if (IsFullTransitionArray()) { |
| 159 DCHECK(number_of_transitions <= number_of_transitions_storage()); |
| 160 WRITE_FIELD(this, kTransitionLengthOffset, |
| 161 Smi::FromInt(number_of_transitions)); |
| 162 } |
| 163 } |
| 164 |
| 165 |
157 #undef FIELD_ADDR | 166 #undef FIELD_ADDR |
158 #undef WRITE_FIELD | 167 #undef WRITE_FIELD |
159 #undef CONDITIONAL_WRITE_BARRIER | 168 #undef CONDITIONAL_WRITE_BARRIER |
160 | 169 |
161 | 170 |
162 } } // namespace v8::internal | 171 } } // namespace v8::internal |
163 | 172 |
164 #endif // V8_TRANSITIONS_INL_H_ | 173 #endif // V8_TRANSITIONS_INL_H_ |
OLD | NEW |