Lines Matching defs:transitions
5 #include "src/transitions.h"
8 #include "src/transitions-inl.h"
21 // If the map doesn't have any transitions at all yet, install the new one.
174 TransitionArray* transitions = TransitionArray::cast(raw_transitions);
175 int transition = transitions->Search(kind, name, attributes);
177 return transitions->GetTarget(transition);
187 TransitionArray* transitions = TransitionArray::cast(raw_transitions);
188 int transition = transitions->SearchSpecial(name);
190 return transitions->GetTarget(transition);
232 TransitionArray* transitions = TransitionArray::cast(raw_transitions);
233 return transitions->number_of_transitions() < kMaxNumberOfTransitions;
278 // There was no prototype transitions array before, so the size
288 FixedArray* transitions = GetPrototypeTransitions(map);
289 CompactPrototypeTransitionArray(transitions);
290 return TransitionArray::NumberOfPrototypeTransitions(transitions);
310 int transitions = NumberOfPrototypeTransitions(*cache) + 1;
312 if (transitions > capacity) {
316 cache = GrowPrototypeTransitionArray(cache, 2 * transitions,
322 // Reload number of transitions as they might have been compacted.
356 TransitionArray* transitions = TransitionArray::cast(raw_transitions);
357 if (!transitions->HasPrototypeTransitions()) {
360 return transitions->GetPrototypeTransitions();
377 // Prototype maps don't have transitions.
407 void TransitionArray::ZapTransitionArray(TransitionArray* transitions) {
410 MemsetPointer(transitions->data_start() + kPrototypeTransitionsIndex,
411 transitions->GetHeap()->the_hole_value(),
412 transitions->length() - kPrototypeTransitionsIndex);
413 transitions->SetNumberOfTransitions(0);
439 TransitionArray* transitions = TransitionArray::cast(map->raw_transitions());
440 transitions->SetPrototypeTransitions(*proto_transitions);
471 TransitionArray* transitions = TransitionArray::cast(raw_transitions);
472 if (transitions->HasPrototypeTransitions()) {
473 FixedArray* proto_trans = transitions->GetPrototypeTransitions();
483 for (int i = 0; i < transitions->number_of_transitions(); ++i) {
484 TraverseTransitionTreeInternal(transitions->GetTarget(i), callback, data);
496 Handle<Map> map, TransitionArray* old_transitions, Object* transitions) {
498 DCHECK(IsFullTransitionArray(transitions));
499 TransitionArray* new_transitions = TransitionArray::cast(transitions);
