Searched refs:number_of_transitions (Results 1 - 10 of 10) sorted by relevance

/external/chromium_org/v8/src/
H A Dtransitions.cc16 int number_of_transitions) {
18 isolate->factory()->NewFixedArray(ToKeyIndex(number_of_transitions));
68 int nof = containing_map->transitions()->number_of_transitions();
73 int new_nof = containing_map->transitions()->number_of_transitions();
96 int number_of_transitions = map->transitions()->number_of_transitions(); local
97 int new_size = number_of_transitions;
110 if (array->number_of_transitions() != number_of_transitions) {
111 ASSERT(array->number_of_transitions() < number_of_transition
15 Allocate(Isolate* isolate, int number_of_transitions) argument
[all...]
H A Dtransitions-inl.h87 ASSERT(transition_number < number_of_transitions());
99 ASSERT(transition_number < number_of_transitions());
106 ASSERT(transition_number < number_of_transitions());
116 ASSERT(transition_number < number_of_transitions());
126 ASSERT(transition_number < number_of_transitions());
H A Dtransitions.h67 int number_of_transitions() { function in class:v8::internal::TransitionArray
73 inline int number_of_entries() { return number_of_transitions(); }
94 Isolate* isolate, int number_of_transitions);
H A Dobjects-printer.cc379 for (int i = 0; i < transitions->number_of_transitions(); i++) {
1234 PrintF(out, "Transition array %d\n", number_of_transitions());
1235 for (int i = 0; i < number_of_transitions(); i++) {
H A Dobjects-debug.cc1162 for (int i = 0; i < number_of_transitions(); i++) {
1186 for (int i = 0; i < number_of_transitions(); ++i) {
H A Dmark-compact.cc2571 int number_of_transitions = map->NumberOfProtoTransitions(); local
2579 for (int i = 0; i < number_of_transitions; i++) {
2602 if (new_number_of_transitions != number_of_transitions) {
2608 i < number_of_transitions * step;
H A Dobjects-visiting-inl.h698 for (int i = 0; i < transitions->number_of_transitions(); ++i) {
H A Dobjects.cc2347 for (int i = 0; i < transitions->number_of_transitions(); i++) {
2455 for (int i = 0; i < transitions->number_of_transitions(); ++i) {
7538 int number_of_transitions = transition_array_->number_of_transitions(); local
7539 while (index < number_of_transitions) {
9598 for (int i = 0; i < t->number_of_transitions(); ++i) {
9620 if (transition_index == t->number_of_transitions()) return;
9635 // such that number_of_transitions() == 0. If this assumption changes,
9638 int trim = t->number_of_transitions() - transition_index;
11794 int number_of_transitions local
[all...]
H A Dobjects-inl.h5039 for (int i = 0; i < transitions()->number_of_transitions(); i++) {
/external/chromium_org/v8/test/cctest/
H A Dtest-heap.cc2693 return map->transitions()->number_of_transitions();

Completed in 641 milliseconds