OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 13 matching lines...) Expand all Loading... |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "v8.h" | 28 #include "v8.h" |
29 | 29 |
30 #include "heap-snapshot-generator-inl.h" | 30 #include "heap-snapshot-generator-inl.h" |
31 | 31 |
32 #include "allocation-tracker.h" | 32 #include "allocation-tracker.h" |
33 #include "code-stubs.h" | 33 #include "code-stubs.h" |
| 34 #include "conversions.h" |
| 35 #include "debug.h" |
34 #include "heap-profiler.h" | 36 #include "heap-profiler.h" |
35 #include "debug.h" | |
36 #include "types.h" | 37 #include "types.h" |
37 #include "v8conversions.h" | |
38 | 38 |
39 namespace v8 { | 39 namespace v8 { |
40 namespace internal { | 40 namespace internal { |
41 | 41 |
42 | 42 |
43 HeapGraphEdge::HeapGraphEdge(Type type, const char* name, int from, int to) | 43 HeapGraphEdge::HeapGraphEdge(Type type, const char* name, int from, int to) |
44 : type_(type), | 44 : type_(type), |
45 from_index_(from), | 45 from_index_(from), |
46 to_index_(to), | 46 to_index_(to), |
47 name_(name) { | 47 name_(name) { |
(...skipping 3112 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3160 writer_->AddString("\"<dummy>\""); | 3160 writer_->AddString("\"<dummy>\""); |
3161 for (int i = 1; i < sorted_strings.length(); ++i) { | 3161 for (int i = 1; i < sorted_strings.length(); ++i) { |
3162 writer_->AddCharacter(','); | 3162 writer_->AddCharacter(','); |
3163 SerializeString(sorted_strings[i]); | 3163 SerializeString(sorted_strings[i]); |
3164 if (writer_->aborted()) return; | 3164 if (writer_->aborted()) return; |
3165 } | 3165 } |
3166 } | 3166 } |
3167 | 3167 |
3168 | 3168 |
3169 } } // namespace v8::internal | 3169 } } // namespace v8::internal |
OLD | NEW |