// filter out children which do not match filter
public void filterChildren(ProfileNodeFilter pnf, int level, Object context) {
ArrayList<String> keysToRemove = new ArrayList<String>();
for (String childKey : children.keySet()) {
SFNode child = children.get(childKey);
boolean acceptNode = pnf.accept(child, level, context);
child.filterChildren(pnf, level + 1, context); // first filter out the children
if (!acceptNode) {
keysToRemove.add(childKey);
}
}
// if we are about to remove this child then we take all its children and fuse them to this
// node....
for (String key : keysToRemove) {
SFNode child = children.get(key);
children.remove(key);
for (String grandchildKey : child.children.keySet()) {
if (children.get(grandchildKey) == null) { // / there is no child with grandchildKey
children.put(grandchildKey, child.children.get(grandchildKey));
} else {
SFNode newChild = children.get(grandchildKey);
newChild.mergeToNode(child.children.get(grandchildKey));
}
}
}
}
public SFNode deepClone() {
SFNode clone = new SFNode();
clone.count = this.count;
clone.sf = this.sf;
for (String key : children.keySet()) {
clone.children.put(key, children.get(key).deepClone());
}
return clone;
}
// Visit all chlidren of a node recursively with a ProfileVisitor
public void visitChildren(ProfileVisitor pv, int level) {
pv.visit(this, level);
HashMap<String, SFNode> newChildren = new HashMap<String, SFNode>();
for (SFNode child : children.values()) { // visit all childred
child.visitChildren(pv, level + 1);
newChildren.put(child.getStackFrame(), child);
}
children = newChildren;
}
public void mergeToNode(SFNode that) {
this.count += that.count;
// merge children
for (String key : that.children.keySet()) {
SFNode thisChild = this.children.get(key);
SFNode thatChild = that.children.get(key);
if (thisChild != null) {
thisChild.mergeToNode(thatChild);
} else {
children.put(key, thatChild.deepClone());
}
}
}
public String toStringMulti(int lvl, HashSet<Integer> brkPts, int countall) {
String a = "";
if (sf != null) { // we do not want to print the root node
for (int i = 0; i < lvl; i++) {
if (brkPts.contains(i)) {
a += GREEN() + "|" + NC();
} else a += " ";
}
String ch = "\\";
if (children.size() > 1) {
ch = "X";
brkPts.add(lvl);
}
if (children.size() == 0) {
ch = "V";
}
String bb = String.format("[%d/%d]", count, countall);
a =
String.format("%6.2f%%%10s", 100f * (float) count / countall, bb)
+ a
+ GREEN()
+ ch
+ NC()
+ " "
+ sf;
a += "\n";
}
int t = 0;
for (SFNode n : children.values()) {
if (t == children.size() - 1) {
brkPts.remove(lvl);
}
t++;
a += n.toStringMulti(lvl + 1, brkPts, countall);
}
return a;
}