Lines Matching refs:map0
52 Handle<Map> map0 = Map::Create(isolate, 0);
54 Map::CopyWithField(map0, name1, handle(HeapType::Any(), isolate),
58 Map::CopyWithField(map0, name2, handle(HeapType::Any(), isolate),
62 CHECK(map0->raw_transitions()->IsSmi());
64 TransitionArray::Insert(map0, name1, map1, SIMPLE_PROPERTY_TRANSITION);
65 CHECK(TransitionArray::IsSimpleTransition(map0->raw_transitions()));
67 TransitionArray::SearchTransition(*map0, kData, *name1, attributes));
68 CHECK_EQ(1, TransitionArray::NumberOfTransitions(map0->raw_transitions()));
69 CHECK_EQ(*name1, TransitionArray::GetKey(map0->raw_transitions(), 0));
70 CHECK_EQ(*map1, TransitionArray::GetTarget(map0->raw_transitions(), 0));
72 TransitionArray::Insert(map0, name2, map2, SIMPLE_PROPERTY_TRANSITION);
73 CHECK(TransitionArray::IsFullTransitionArray(map0->raw_transitions()));
76 TransitionArray::SearchTransition(*map0, kData, *name1, attributes));
78 TransitionArray::SearchTransition(*map0, kData, *name2, attributes));
79 CHECK_EQ(2, TransitionArray::NumberOfTransitions(map0->raw_transitions()));
81 Name* key = TransitionArray::GetKey(map0->raw_transitions(), i);
82 Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i);
88 CHECK(TransitionArray::IsSortedNoDuplicates(*map0));
103 Handle<Map> map0 = Map::Create(isolate, 0);
105 Map::CopyWithField(map0, name1, handle(HeapType::Any(), isolate),
109 Map::CopyWithField(map0, name2, handle(HeapType::Any(), isolate),
113 CHECK(map0->raw_transitions()->IsSmi());
115 TransitionArray::Insert(map0, name1, map1, PROPERTY_TRANSITION);
116 CHECK(TransitionArray::IsFullTransitionArray(map0->raw_transitions()));
118 TransitionArray::SearchTransition(*map0, kData, *name1, attributes));
119 CHECK_EQ(1, TransitionArray::NumberOfTransitions(map0->raw_transitions()));
120 CHECK_EQ(*name1, TransitionArray::GetKey(map0->raw_transitions(), 0));
121 CHECK_EQ(*map1, TransitionArray::GetTarget(map0->raw_transitions(), 0));
123 TransitionArray::Insert(map0, name2, map2, PROPERTY_TRANSITION);
124 CHECK(TransitionArray::IsFullTransitionArray(map0->raw_transitions()));
127 TransitionArray::SearchTransition(*map0, kData, *name1, attributes));
129 TransitionArray::SearchTransition(*map0, kData, *name2, attributes));
130 CHECK_EQ(2, TransitionArray::NumberOfTransitions(map0->raw_transitions()));
132 Name* key = TransitionArray::GetKey(map0->raw_transitions(), i);
133 Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i);
139 CHECK(TransitionArray::IsSortedNoDuplicates(*map0));
155 Handle<Map> map0 = Map::Create(isolate, 0);
156 CHECK(map0->raw_transitions()->IsSmi());
163 Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate),
169 TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION);
174 *map0, kData, *names[i], attributes));
177 Name* key = TransitionArray::GetKey(map0->raw_transitions(), i);
178 Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i);
188 CHECK(TransitionArray::IsSortedNoDuplicates(*map0));
199 Handle<Map> map0 = Map::Create(isolate, 0);
200 CHECK(map0->raw_transitions()->IsSmi());
212 Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate),
217 TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION);
224 *map0, kData, *name, attributes));
227 CHECK_EQ(*name, TransitionArray::GetKey(map0->raw_transitions(), i));
231 CHECK(TransitionArray::IsSortedNoDuplicates(*map0));
246 Handle<Map> map0 = Map::Create(isolate, 0);
247 CHECK(map0->raw_transitions()->IsSmi());
255 Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate), NONE,
261 TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION);
274 Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate),
279 TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION);
286 TransitionArray::SearchTransition(*map0, kData, *name, attr));
291 TransitionArray::NumberOfTransitions(map0->raw_transitions()));
293 Name* key = TransitionArray::GetKey(map0->raw_transitions(), i);
294 Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i);
311 CHECK(TransitionArray::IsSortedNoDuplicates(*map0));
