Welcome to mirror list, hosted at ThFree Co, Russian Federation.

HeapExplorerTreeModel.cs « heap-snapshot-explorer « Mono.Profiler - github.com/mono/mono-tools.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 512ce0eddf54cc913722dc3d9d35baed1f848b3b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
// Author:
// Massimiliano Mantione (massi@ximian.com)
//
// (C) 2008 Novell, Inc  http://www.novell.com
//

//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
// 
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
// 
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//

using System;
using System.Collections.Generic;
using Gtk;

namespace Mono.Profiler
{
	public class HeapExplorerTreeModel {
		public abstract class Node {
			public abstract HeapObjectSet Objects {
				get;
			}
			public abstract string Description {
				get;
			}
			
			protected HeapExplorerTreeModel model;
			TreeIter treeIter;
			public TreeIter TreeIter {
				get {
					return treeIter;
				}
			}
			
			Node parent;
			public Node Parent {
				get {
					return parent;
				}
			}
			
			public Node Root {
				get {
					if (parent != null) {
						return parent.Root;
					} else {
						return this;
					}
				}
			}
			
			public string Count {
				get {
					if (Objects != null) {
						return Objects.HeapObjects.Length.ToString ();
					} else {
						return "";
					}
				}
			}
			public string AllocatedBytes {
				get {
					if (Objects != null) {
						return Objects.AllocatedBytes.ToString ();
					} else {
						return "";
					}
				}
			}
			
			protected TreeIter HandleNodeCreation () {
				if (parent != null) {
					TreeIter result = model.Model.AppendNode (parent.TreeIter);
					model.Model.SetValue (result, 0, this);
					return result;
				} else {
					return model.Model.AppendValues (this);
				}
			}
			
			public SubSetNode Filter (IHeapObjectFilter filter) {
				HeapObjectSetFromFilter subSet = new HeapObjectSetFromFilter (Objects, filter);
				SubSetNode result = new SubSetNode (model, this, subSet);
				return result;
			}
			
			public static void PerformComparison (Node firstNode, Node secondNode, out SubSetNode onlyInFirstNode, out SubSetNode onlyInSecondNode) {
				HeapObjectSet onlyInFirstSet;
				HeapObjectSet onlyInSecondSet;
				HeapObjectSetFromComparison.PerformComparison (firstNode.Objects, secondNode.Objects, out onlyInFirstSet, out onlyInSecondSet);
				onlyInFirstNode = new SubSetNode (firstNode.model, firstNode, onlyInFirstSet);
				onlyInSecondNode = new SubSetNode (secondNode.model, secondNode, onlyInSecondSet);
			}
			
			protected Node (HeapExplorerTreeModel model, Node parent) {
				this.model = model;
				this.parent = parent;
				this.treeIter = HandleNodeCreation ();
			}
		}
		
		public class SnapshotNode : Node {
			SeekableLogFileReader.Block heapBlock;
			
			HeapSnapshot snapshot;
			public HeapSnapshot Snapshot {
				get {
					return snapshot;
				}
			}
			
			HeapObjectSetFromSnapshot objects;
			public override HeapObjectSet Objects {
				get {
					return objects;
				}
			}
			
			public void ReadSnapshot () {
				model.Reader.ReadBlock (heapBlock).Decode (model.heapEventProcessor, model.Reader);
				snapshot = model.heapEventProcessor.LastHeapSnapshot;
				objects = new HeapObjectSetFromSnapshot (snapshot);
				model.Model.SetValue (TreeIter, 0, this);
			}
			
			public override string Description {
				get {
					return heapBlock.TimeFromStart.ToString ();
				}
			}
			
			public SnapshotNode (HeapExplorerTreeModel model, SeekableLogFileReader.Block heapBlock) : base (model, null) {
				this.heapBlock = heapBlock;
				this.objects = null;
				this.snapshot = null;
			}
		}
		
		public class SubSetNode : Node {
			HeapObjectSet objects;
			public override HeapObjectSet Objects {
				get {
					return objects;
				}
			}
			
			public override string Description {
				get {
					return objects.ShortDescription;
				}
			}
			
			public SubSetNode (HeapExplorerTreeModel model, Node parent, HeapObjectSet objects) : base (model, parent) {
				this.objects = objects;
			}
		}
		
		TreeStore model;
		public TreeStore Model {
			get {
				return model;
			}
		}
		
		SeekableLogFileReader reader;
		public SeekableLogFileReader Reader {
			get {
				return reader;
			}
		}
		
		protected class HeapEventProcessor : ProfilerEventHandler {
			HeapSnapshot lastHeapSnapshot = null;
			public HeapSnapshot LastHeapSnapshot {
				get {
					return lastHeapSnapshot;
				}
			}
			
			public override void HeapReportStart (HeapSnapshot snapshot) {
				lastHeapSnapshot = snapshot;
			}
			public override void HeapObjectUnreachable (LoadedClass c, uint size) {
				lastHeapSnapshot.HeapObjectUnreachable (c, size);
			}
			public override void HeapObjectReachable (HeapObject<LoadedClass> o) {
			}
			public override void HeapReportEnd (HeapSnapshot snapshot) {
				lastHeapSnapshot.InitializeBackReferences ();
			}
		}
		protected HeapEventProcessor heapEventProcessor;
		
		List<SnapshotNode> rootNodes;
		public SnapshotNode[] RootNodes {
			get {
				return rootNodes.ToArray ();
			}
		}
		
		public void Initialize () {
			Reset ();
			
			foreach (SeekableLogFileReader.Block block in reader.Blocks) {
				if (block.Code == BlockCode.HEAP_DATA) {
					SnapshotNode node = new SnapshotNode (this, block);
					rootNodes.Add (node);
				} else if (block.Code == BlockCode.MAPPING) {
					reader.ReadBlock (block).Decode (heapEventProcessor, reader);
				}
			}
		}
		
		public void Reset () {
			model.Clear ();
		}
		
		public HeapExplorerTreeModel (SeekableLogFileReader reader) {
			model = new TreeStore (new Type [] {typeof (Node)});
			heapEventProcessor = new HeapEventProcessor ();
			this.reader = reader;
			rootNodes = new List<SnapshotNode> ();
		}
	}
}