Home | History | Annotate | Download | only in src

Lines Matching refs:number_of_transitions

64   int number_of_transitions = 0;
75 number_of_transitions = array->number_of_transitions();
76 new_nof = number_of_transitions;
91 DCHECK(insertion_index >= 0 && insertion_index <= number_of_transitions);
96 for (index = number_of_transitions; index > insertion_index; --index) {
110 Map::SlackForArraySize(number_of_transitions, kMaxNumberOfTransitions));
118 if (array->number_of_transitions() != number_of_transitions) {
119 DCHECK(array->number_of_transitions() < number_of_transitions);
121 number_of_transitions = array->number_of_transitions();
122 new_nof = number_of_transitions;
135 DCHECK(insertion_index >= 0 && insertion_index <= number_of_transitions);
150 for (int i = insertion_index; i < number_of_transitions; ++i) {
231 return transitions->number_of_transitions() < kMaxNumberOfTransitions;
240 int number_of_transitions = NumberOfPrototypeTransitions(array);
241 if (number_of_transitions == 0) {
246 for (int i = 0; i < number_of_transitions; i++) {
256 for (int i = new_number_of_transitions; i < number_of_transitions; i++) {
259 if (number_of_transitions != new_number_of_transitions) {
262 return new_number_of_transitions < number_of_transitions;
334 int number_of_transitions = NumberOfPrototypeTransitions(cache);
335 for (int i = 0; i < number_of_transitions; i++) {
378 return TransitionArray::cast(raw_transitions)->number_of_transitions();
394 int number_of_transitions,
397 LengthFor(number_of_transitions + slack));
399 array->set(kTransitionLengthIndex, Smi::FromInt(number_of_transitions));
481 for (int i = 0; i < transitions->number_of_transitions(); ++i) {
498 for (int i = 0; i < old_transitions->number_of_transitions(); i++) {
524 int nof_transitions = number_of_transitions();