OLD | NEW |
---|---|
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // | 2 // |
3 // Tests for heap profiler | 3 // Tests for heap profiler |
4 | 4 |
5 #include <ctype.h> | |
mnaganov (inactive)
2012/04/19 20:02:54
Sorry, didn't spot that in your original CL. "v8.h
| |
6 | |
5 #include "v8.h" | 7 #include "v8.h" |
6 | 8 |
7 #include <ctype.h> | |
8 | |
9 #include "cctest.h" | 9 #include "cctest.h" |
10 #include "heap-profiler.h" | 10 #include "heap-profiler.h" |
11 #include "snapshot.h" | 11 #include "snapshot.h" |
12 #include "debug.h" | 12 #include "debug.h" |
13 #include "utils-inl.h" | 13 #include "utils-inl.h" |
14 #include "../include/v8-profiler.h" | 14 #include "../include/v8-profiler.h" |
15 | 15 |
16 namespace { | 16 namespace { |
17 | 17 |
18 class NamedEntriesDetector { | 18 class NamedEntriesDetector { |
(...skipping 1619 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
1638 const v8::HeapGraphNode* strong_roots = GetNode( | 1638 const v8::HeapGraphNode* strong_roots = GetNode( |
1639 gc_roots, v8::HeapGraphNode::kObject, "(Strong roots)"); | 1639 gc_roots, v8::HeapGraphNode::kObject, "(Strong roots)"); |
1640 CHECK_NE(NULL, strong_roots); | 1640 CHECK_NE(NULL, strong_roots); |
1641 for (int i = 0; i < strong_roots->GetChildrenCount(); ++i) { | 1641 for (int i = 0; i < strong_roots->GetChildrenCount(); ++i) { |
1642 const v8::HeapGraphEdge* edge = strong_roots->GetChild(i); | 1642 const v8::HeapGraphEdge* edge = strong_roots->GetChild(i); |
1643 CHECK_EQ(v8::HeapGraphEdge::kInternal, edge->GetType()); | 1643 CHECK_EQ(v8::HeapGraphEdge::kInternal, edge->GetType()); |
1644 v8::String::AsciiValue name(edge->GetName()); | 1644 v8::String::AsciiValue name(edge->GetName()); |
1645 CHECK(isalpha(**name)); | 1645 CHECK(isalpha(**name)); |
1646 } | 1646 } |
1647 } | 1647 } |
OLD | NEW |