1 // Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
3 package edu.berkeley.sbp;
4 import edu.berkeley.sbp.util.*;
5 import edu.berkeley.sbp.Sequence.Pos;
6 import edu.berkeley.sbp.Sequence.Pos;
11 implements GraphViz.ToGraphViz {
13 private Forest.Many f = new Forest.Many();
14 //private HashSet<StateNode> predecessors = new HashSet<StateNode>();
15 //private HashSet<StateNode> successors = new HashSet<StateNode>();
16 private FastSet<StateNode> predecessors = new FastSet<StateNode>();
17 private FastSet<StateNode> successors = new FastSet<StateNode>();
18 private boolean destroyed = false;
19 private boolean primordeal;
20 private int usedByNonDoomedNode = 0;
21 private Pos reduction;
22 private GSS.Phase predPhase;
24 public boolean predecessorsContains(StateNode n) {
25 return predecessors.contains(n);
27 public Pos reduction() { return reduction; }
28 public void merge(Forest newf) {
31 if (predecessors.contains(pred)) return;
33 if (fromEmptyReduction) return;
34 n.state().invokeReductions(n.phase().getToken(), n, this);
38 public boolean noSuccessors() { return successors.size()==0; }
40 public GSS.Phase phase() { return predPhase; }
41 public Forest getForest() { return f; }
42 public Iterable<StateNode> getPreds() { return predecessors; }
43 public void addSucc(StateNode succ) {
44 if (successors.contains(succ)) return;
46 usedByNonDoomedNode += succ.state().doomed ? 0 : 1;
47 if (predecessors.size() > 1) throw new Error();
49 public void removeSucc(StateNode succ) {
50 if (!successors.contains(succ)) return;
51 successors.remove(succ);
52 usedByNonDoomedNode -= succ.state().doomed ? 0 : 1;
56 public boolean usedByAnyNode() { return successors.size() > 0; }
57 public boolean usedByNonDoomedNode() { return usedByNonDoomedNode > 0; }
59 public String toString() { return super.toString()+"->"+predPhase; }
62 if (successors.size()==0) destroy();
63 else if (predecessors.size()==0) destroy();
65 public void destroy() {
66 if (destroyed) return;
67 if (primordeal) return; // never destroy the "primordeal" result
69 while(predecessors.size() > 0)
70 for(StateNode pred : predecessors) {
72 pred.removeSucc(this);
76 while(successors.size() > 0)
77 for(StateNode succ : successors) {
79 succ.removeResult(this);
85 public void removePred(StateNode pred) {
86 if (!predecessors.contains(pred)) return;
87 predecessors.remove(pred);
91 public void addPred(StateNode pred) {
92 if (predPhase==null) predPhase = pred.phase();
93 if (predPhase != pred.phase()) throw new Error();
94 predecessors.add(pred);
96 if (predecessors.size() > 1) throw new Error();
100 this(null, null, null);
101 this.primordeal = true;
103 public ResultNode(Forest f, Pos reduction, StateNode pred) {
105 this.reduction = reduction;
106 if (pred != null) addPred(pred);
109 // GraphViz //////////////////////////////////////////////////////////////////////////////
111 public GraphViz.StateNode toGraphViz(GraphViz gv) {
112 if (gv.hasNode(this)) return gv.createNode(this);
113 GraphViz.StateNode n = gv.createNode(this);
115 n.shape = "rectangle";
116 //if (pred()!=null) n.edge(pred, "");
119 ((GraphViz.Group)phase().toGraphViz(gv)).add(n);
122 public boolean isTransparent() { return false; }
123 public boolean isHidden() { return false; }