1
/* -*- Mode: Java; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
3
* The contents of this file are subject to the Netscape Public
4
* License Version 1.1 (the "License"); you may not use this file
5
* except in compliance with the License. You may obtain a copy of
6
* the License at http://www.mozilla.org/NPL/
8
* Software distributed under the License is distributed on an "AS
9
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
10
* implied. See the License for the specific language governing
11
* rights and limitations under the License.
13
* The Original Code is Mozilla Communicator client code, released
16
* The Initial Developer of the Original Code is Netscape
17
* Communications Corporation. Portions created by Netscape are
18
* Copyright (C) 1998 Netscape Communications Corporation. All
23
* Patrick C. Beard <beard@netscape.com>
25
* Alternatively, the contents of this file may be used under the
26
* terms of the GNU Public License (the "GPL"), in which case the
27
* provisions of the GPL are applicable instead of those above.
28
* If you wish to allow use of your version of this file only
29
* under the terms of the GPL and not to allow others to use your
30
* version of this file under the NPL, indicate your decision by
31
* deleting the provisions above and replace them with the notice
32
* and other provisions required by the GPL. If you do not delete
33
* the provisions above, a recipient may use your version of this
34
* file under either the NPL or the GPL.
37
import java.util.Enumeration;
38
import java.util.Vector;
41
* Represents a global tree of calls.
43
public class CallTree {
44
public static class Node {
49
public Node(int id, Node parent) {
55
private Vector nodes = new Vector(16000);
56
private StringTable strings;
58
public CallTree(StringTable strings) {
59
nodes.addElement(null);
60
this.strings = strings;
64
* Parses a line of the form:
65
* <c id=number pid=number>function[file,offset]</c>
67
public Node parseNode(String line) {
69
int start = 1 + line.indexOf('=');
70
int endTag = line.indexOf('>');
71
if (line.charAt(endTag - 1) == '/') {
72
// just references an already parsed node.
73
int id = Integer.parseInt(line.substring(start, endTag - 1));
74
return (Node) nodes.elementAt(id);
76
int end = line.indexOf(' ', start + 1);
77
int id = Integer.parseInt(line.substring(start, end));
78
start = 1 + line.indexOf('=', end + 1);
79
end = line.indexOf('>', start + 1);
80
int pid = Integer.parseInt(line.substring(start, end));
81
Node node = addNode(id, pid);
83
end = line.lastIndexOf('<');
84
node.data = strings.intern(line.substring(start, end));
87
} catch (NumberFormatException nfe) {
92
public Node addNode(int id, int pid) {
93
Node parent = (Node) nodes.elementAt(pid);
94
Node node = new Node(id, parent);
95
nodes.addElement(node);
96
if (nodes.size() != (id + 1))
97
throw new Error("inconsistent node id");
101
public Node getNode(int id) {
102
return (Node) nodes.elementAt(id);