Home | History | Annotate | Download | only in cctest

Lines Matching refs:CHECK_EQ

38   CHECK_EQ(TokenEnumerator::kNoSecurityToken, te.GetTokenId(NULL));
41 CHECK_EQ(0, te.GetTokenId(*v8::Utils::OpenHandle(*token1)));
42 CHECK_EQ(0, te.GetTokenId(*v8::Utils::OpenHandle(*token1)));
44 CHECK_EQ(1, te.GetTokenId(*v8::Utils::OpenHandle(*token2)));
45 CHECK_EQ(1, te.GetTokenId(*v8::Utils::OpenHandle(*token2)));
46 CHECK_EQ(0, te.GetTokenId(*v8::Utils::OpenHandle(*token1)));
50 CHECK_EQ(2, te.GetTokenId(*v8::Utils::OpenHandle(*token3)));
51 CHECK_EQ(1, te.GetTokenId(*v8::Utils::OpenHandle(*token2)));
52 CHECK_EQ(0, te.GetTokenId(*v8::Utils::OpenHandle(*token1)));
57 CHECK_EQ(1, te.GetTokenId(*v8::Utils::OpenHandle(*token2)));
58 CHECK_EQ(0, te.GetTokenId(*v8::Utils::OpenHandle(*token1)));
68 CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
74 CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
75 CHECK_EQ(childNode2, node.FindOrAddChild(&entry2));
82 CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
83 CHECK_EQ(childNode2, node.FindOrAddChild(&entry2));
84 CHECK_EQ(childNode3, node.FindOrAddChild(&entry3));
96 CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
100 CHECK_EQ(childNode1, node.FindOrAddChild(&entry2));
104 CHECK_EQ(childNode1, node.FindOrAddChild(&entry3));
146 CHECK_EQ(NULL, helper.Walk(&entry1));
147 CHECK_EQ(NULL, helper.Walk(&entry2));
148 CHECK_EQ(NULL, helper.Walk(&entry3));
153 CHECK_EQ(NULL, helper.Walk(&entry2));
154 CHECK_EQ(NULL, helper.Walk(&entry3));
157 CHECK_EQ(0, node1->total_ticks());
158 CHECK_EQ(0, node1->self_ticks());
159 CHECK_EQ(NULL, helper.Walk(&entry1, &entry1));
160 CHECK_EQ(NULL, helper.Walk(&entry1, &entry3));
164 CHECK_EQ(0, node2->total_ticks());
165 CHECK_EQ(0, node2->self_ticks());
166 CHECK_EQ(NULL, helper.Walk(&entry1, &entry2, &entry1));
167 CHECK_EQ(NULL, helper.Walk(&entry1, &entry2, &entry2));
172 CHECK_EQ(0, node3->total_ticks());
173 CHECK_EQ(1, node3->self_ticks());
176 CHECK_EQ(node1, helper.Walk(&entry1));
177 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
178 CHECK_EQ(node3, helper.Walk(&entry1, &entry2, &entry3));
179 CHECK_EQ(0, node1->total_ticks());
180 CHECK_EQ(0, node1->self_ticks());
181 CHECK_EQ(0, node2->total_ticks());
182 CHECK_EQ(0, node2->self_ticks());
183 CHECK_EQ(0, node3->total_ticks());
184 CHECK_EQ(2, node3->self_ticks());
189 CHECK_EQ(NULL, helper.Walk(&entry2));
190 CHECK_EQ(NULL, helper.Walk(&entry3));
191 CHECK_EQ(node1, helper.Walk(&entry1));
192 CHECK_EQ(NULL, helper.Walk(&entry1, &entry1));
193 CHECK_EQ(NULL, helper.Walk(&entry1, &entry3));
194 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
195 CHECK_EQ(NULL, helper.Walk(&entry1, &entry2, &entry1));
196 CHECK_EQ(node3, helper.Walk(&entry1, &entry2, &entry3));
197 CHECK_EQ(0, node3->total_ticks());
198 CHECK_EQ(2, node3->self_ticks());
202 CHECK_EQ(0, node4->total_ticks());
203 CHECK_EQ(1, node4->self_ticks());
216 CHECK_EQ(NULL, helper.Walk(&entry1));
217 CHECK_EQ(NULL, helper.Walk(&entry2));
218 CHECK_EQ(NULL, helper.Walk(&entry3));
223 CHECK_EQ(NULL, helper.Walk(&entry2));
224 CHECK_EQ(NULL, helper.Walk(&entry3));
227 CHECK_EQ(0, node1->total_ticks());
228 CHECK_EQ(0, node1->self_ticks());
229 CHECK_EQ(NULL, helper.Walk(&entry1, &entry1));
230 CHECK_EQ(NULL, helper.Walk(&entry1, &entry3));
234 CHECK_EQ(0, node2->total_ticks());
235 CHECK_EQ(0, node2->self_ticks());
236 CHECK_EQ(NULL, helper.Walk(&entry1, &entry2, &entry1));
237 CHECK_EQ(NULL, helper.Walk(&entry1, &entry2, &entry2));
242 CHECK_EQ(0, node3->total_ticks());
243 CHECK_EQ(1, node3->self_ticks());
246 CHECK_EQ(node1, helper.Walk(&entry1));
247 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
248 CHECK_EQ(node3, helper.Walk(&entry1, &entry2, &entry3));
249 CHECK_EQ(0, node1->total_ticks());
250 CHECK_EQ(0, node1->self_ticks());
251 CHECK_EQ(0, node2->total_ticks());
252 CHECK_EQ(0, node2->self_ticks());
253 CHECK_EQ(0, node3->total_ticks());
254 CHECK_EQ(2, node3->self_ticks());
259 CHECK_EQ(NULL, helper.Walk(&entry2));
260 CHECK_EQ(NULL, helper.Walk(&entry3));
261 CHECK_EQ(node1, helper.Walk(&entry1));
262 CHECK_EQ(NULL, helper.Walk(&entry1, &entry1));
263 CHECK_EQ(NULL, helper.Walk(&entry1, &entry3));
264 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
265 CHECK_EQ(NULL, helper.Walk(&entry1, &entry2, &entry1));
266 CHECK_EQ(node3, helper.Walk(&entry1, &entry2, &entry3));
267 CHECK_EQ(0, node3->total_ticks());
268 CHECK_EQ(2, node3->self_ticks());
272 CHECK_EQ(0, node4->total_ticks());
273 CHECK_EQ(1, node4->self_ticks());
279 CHECK_EQ(0, empty_tree.root()->total_ticks());
280 CHECK_EQ(0, empty_tree.root()->self_ticks());
282 CHECK_EQ(0, empty_tree.root()->total_ticks());
283 CHECK_EQ(0, empty_tree.root()->self_ticks());
285 CHECK_EQ(0, empty_tree.root()->total_ticks());
286 CHECK_EQ(1, empty_tree.root()->self_ticks());
288 CHECK_EQ(1, empty_tree.root()->total_ticks());
289 CHECK_EQ(1, empty_tree.root()->self_ticks());
300 CHECK_EQ(0, single_child_tree.root()->total_ticks());
301 CHECK_EQ(1, single_child_tree.root()->self_ticks());
305 CHECK_EQ(0, node1->total_ticks());
306 CHECK_EQ(1, node1->self_ticks());
308 CHECK_EQ(2, single_child_tree.root()->total_ticks());
309 CHECK_EQ(1, single_child_tree.root()->self_ticks());
310 CHECK_EQ(1, node1->total_ticks());
311 CHECK_EQ(1, node1->self_ticks());
327 CHECK_EQ(0, flat_tree.root()->total_ticks());
328 CHECK_EQ(0, flat_tree.root()->self_ticks());
331 CHECK_EQ(0, node1->total_ticks());
332 CHECK_EQ(2, node1->self_ticks());
335 CHECK_EQ(0, node2->total_ticks());
336 CHECK_EQ(3, node2->self_ticks());
339 CHECK_EQ(5, flat_tree.root()->total_ticks());
340 CHECK_EQ(0, flat_tree.root()->self_ticks());
341 CHECK_EQ(5, node1->total_ticks());
342 CHECK_EQ(2, node1->self_ticks());
343 CHECK_EQ(3, node2->total_ticks());
344 CHECK_EQ(3, node2->self_ticks());
370 CHECK_EQ(0, wide_tree.root()->total_ticks());
371 CHECK_EQ(0, wide_tree.root()->self_ticks());
374 CHECK_EQ(0, node1->total_ticks());
375 CHECK_EQ(2, node1->self_ticks());
378 CHECK_EQ(0, node1_2->total_ticks());
379 CHECK_EQ(1, node1_2->self_ticks());
382 CHECK_EQ(0, node2->total_ticks());
383 CHECK_EQ(3, node2->self_ticks());
386 CHECK_EQ(0, node3->total_ticks());
387 CHECK_EQ(4, node3->self_ticks());
392 CHECK_EQ(10, wide_tree.root()->total_ticks());
393 CHECK_EQ(0, wide_tree.root()->self_ticks());
394 CHECK_EQ(3, node1->total_ticks());
395 CHECK_EQ(2, node1->self_ticks());
396 CHECK_EQ(1, node1_2->total_ticks());
397 CHECK_EQ(1, node1_2->self_ticks());
398 CHECK_EQ(3, node2->total_ticks());
399 CHECK_EQ(3, node2->self_ticks());
400 CHECK_EQ(4, node3->total_ticks());
401 CHECK_EQ(4, node3->self_ticks());
437 CHECK_EQ(4, source_tree.root()->total_ticks());
438 CHECK_EQ(0, source_tree.root()->self_ticks());
447 CHECK_EQ(4, token0_tree.root()->total_ticks());
448 CHECK_EQ(1, token0_tree.root()->self_ticks());
452 CHECK_EQ(1, node1->total_ticks());
453 CHECK_EQ(1, node1->self_ticks());
454 CHECK_EQ(NULL, token0_helper.Walk(&entry2));
457 CHECK_EQ(2, node3->total_ticks());
458 CHECK_EQ(1, node3->self_ticks());
461 CHECK_EQ(1, node3_1->total_ticks());
462 CHECK_EQ(1, node3_1->self_ticks());
463 CHECK_EQ(NULL, token0_helper.Walk(&entry3, &entry2));
473 CHECK_EQ(4, token1_tree.root()->total_ticks());
474 CHECK_EQ(1, token1_tree.root()->self_ticks());
476 CHECK_EQ(NULL, token1_helper.Walk(&entry1));
477 CHECK_EQ(NULL, token1_helper.Walk(&entry3));
480 CHECK_EQ(3, node2->total_ticks());
481 CHECK_EQ(2, node2->self_ticks());
484 CHECK_EQ(1, node2_4->total_ticks());
485 CHECK_EQ(1, node2_4->self_ticks());
494 CHECK_EQ(4, token2_tree.root()->total_ticks());
495 CHECK_EQ(4, token2_tree.root()->self_ticks());
497 CHECK_EQ(NULL, token2_helper.Walk(&entry1));
498 CHECK_EQ(NULL, token2_helper.Walk(&entry2));
499 CHECK_EQ(NULL, token2_helper.Walk(&entry3));
522 CHECK_EQ(NULL, code_map.FindEntry(0));
523 CHECK_EQ(NULL, code_map.FindEntry(ToAddress(0x1500 - 1)));
524 CHECK_EQ(&entry1, code_map.FindEntry(ToAddress(0x1500)));
525 CHECK_EQ(&entry1, code_map.FindEntry(ToAddress(0x1500 + 0x100)));
526 CHECK_EQ(&entry1, code_map.FindEntry(ToAddress(0x1500 + 0x200 - 1)));
527 CHECK_EQ(&entry2, code_map.FindEntry(ToAddress(0x1700)));
528 CHECK_EQ(&entry2, code_map.FindEntry(ToAddress(0x1700 + 0x50)));
529 CHECK_EQ(&entry2, code_map.FindEntry(ToAddress(0x1700 + 0x100 - 1)));
530 CHECK_EQ(NULL, code_map.FindEntry(ToAddress(0x1700 + 0x100)));
531 CHECK_EQ(NULL, code_map.FindEntry(ToAddress(0x1900 - 1)));
532 CHECK_EQ(&entry3, code_map.FindEntry(ToAddress(0x1900)));
533 CHECK_EQ(&entry3, code_map.FindEntry(ToAddress(0x1900 + 0x28)));
534 CHECK_EQ(&entry4, code_map.FindEntry(ToAddress(0x1950)));
535 CHECK_EQ(&entry4, code_map.FindEntry(ToAddress(0x1950 + 0x7)));
536 CHECK_EQ(&entry4, code_map.FindEntry(ToAddress(0x1950 + 0x10 - 1)));
537 CHECK_EQ(NULL, code_map.FindEntry(ToAddress(0x1950 + 0x10)));
538 CHECK_EQ(NULL, code_map.FindEntry(ToAddress(0xFFFFFFFF)));
550 CHECK_EQ(&entry1, code_map.FindEntry(ToAddress(0x1500)));
551 CHECK_EQ(&entry2, code_map.FindEntry(ToAddress(0x1700)));
553 CHECK_EQ(NULL, code_map.FindEntry(ToAddress(0x1500)));
554 CHECK_EQ(&entry1, code_map.FindEntry(ToAddress(0x1700)));
558 CHECK_EQ(NULL, code_map.FindEntry(ToAddress(0x1700)));
559 CHECK_EQ(&entry3, code_map.FindEntry(ToAddress(0x1750)));
624 CHECK_EQ(NULL, top_down_test_helper.Walk(entry2));
625 CHECK_EQ(NULL, top_down_test_helper.Walk(entry3));
628 CHECK_EQ(entry1, node1->entry());
631 CHECK_EQ(entry1, node2->entry());
634 CHECK_EQ(entry3, node3->entry());
637 CHECK_EQ(entry1, node4->entry());
648 CHECK_EQ(kSamplingIntervalMs, calc1.ticks_per_ms());
650 CHECK_EQ(kSamplingIntervalMs, calc1.ticks_per_ms());
653 CHECK_EQ(kSamplingIntervalMs, calc1.ticks_per_ms());
656 CHECK_EQ(kSamplingIntervalMs, calc1.ticks_per_ms());
659 CHECK_EQ(kSamplingIntervalMs, calc1.ticks_per_ms());
663 CHECK_EQ(kSamplingIntervalMs, calc2.ticks_per_ms());
665 CHECK_EQ(kSamplingIntervalMs, calc2.ticks_per_ms());
669 CHECK_EQ(kSamplingIntervalMs * 1.5, calc2.ticks_per_ms());
673 CHECK_EQ(kSamplingIntervalMs * 5.0, floor(calc2.ticks_per_ms() * 3.0 + 0.5));
677 CHECK_EQ(kSamplingIntervalMs, calc3.ticks_per_ms());
679 CHECK_EQ(kSamplingIntervalMs, calc3.ticks_per_ms());
683 CHECK_EQ(kSamplingIntervalMs * 0.75, calc3.ticks_per_ms());
687 CHECK_EQ(kSamplingIntervalMs * 2.0, floor(calc3.ticks_per_ms() * 3.0 + 0.5));
770 CHECK_EQ(0, CpuProfiler::GetProfilesCount());
777 CHECK_EQ(1, CpuProfiler::GetProfilesCount());
804 CHECK_EQ(0, current->children()->length());