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;
9 final class Result implements GraphViz.ToGraphViz {
11 private Forest.Many f = new Forest.Many();
12 //private HashSet<Node> predecessors = new HashSet<Node>();
13 //private HashSet<Node> successors = new HashSet<Node>();
14 private FastSet<Node> predecessors = new FastSet<Node>();
15 private FastSet<Node> successors = new FastSet<Node>();
16 private boolean destroyed = false;
17 private boolean primordeal;
18 private int usedByNonDoomedNode = 0;
19 private Pos reduction;
20 private GSS.Phase predPhase;
22 public boolean predecessorsContains(Node n) {
23 return predecessors.contains(n);
25 public Pos reduction() { return reduction; }
26 public void merge(Forest newf) {
29 if (predecessors.contains(pred)) return;
31 if (fromEmptyReduction) return;
32 n.state().invokeReductions(n.phase().getToken(), n, this);
36 public boolean noSuccessors() { return successors.size()==0; }
38 public GSS.Phase phase() { return predPhase; }
39 public Forest getForest() { return f; }
40 public Iterable<Node> getPreds() { return predecessors; }
41 public void addSucc(Node succ) {
42 if (successors.contains(succ)) return;
44 usedByNonDoomedNode += succ.state().doomed ? 0 : 1;
45 if (predecessors.size() > 1) throw new Error();
47 public void removeSucc(Node succ) {
48 if (!successors.contains(succ)) return;
49 successors.remove(succ);
50 usedByNonDoomedNode -= succ.state().doomed ? 0 : 1;
54 public boolean usedByAnyNode() { return successors.size() > 0; }
55 public boolean usedByNonDoomedNode() { return usedByNonDoomedNode > 0; }
57 public String toString() { return super.toString()+"->"+predPhase; }
60 if (successors.size()==0) destroy();
61 else if (predecessors.size()==0) destroy();
63 public void destroy() {
64 if (destroyed) return;
65 if (primordeal) return; // never destroy the "primordeal" result
67 while(predecessors.size() > 0)
68 for(Node pred : predecessors) {
70 pred.removeSucc(this);
74 while(successors.size() > 0)
75 for(Node succ : successors) {
77 succ.removeResult(this);
83 public void removePred(Node pred) {
84 if (!predecessors.contains(pred)) return;
85 predecessors.remove(pred);
89 public void addPred(Node pred) {
90 if (predPhase==null) predPhase = pred.phase();
91 if (predPhase != pred.phase()) throw new Error();
92 predecessors.add(pred);
94 if (predecessors.size() > 1) throw new Error();
98 this(null, null, null);
99 this.primordeal = true;
101 public Result(Forest f, Pos reduction, Node pred) {
103 this.reduction = reduction;
104 if (pred != null) addPred(pred);
107 // GraphViz //////////////////////////////////////////////////////////////////////////////
109 public GraphViz.Node toGraphViz(GraphViz gv) {
110 if (gv.hasNode(this)) return gv.createNode(this);
111 GraphViz.Node n = gv.createNode(this);
113 n.shape = "rectangle";
114 //if (pred()!=null) n.edge(pred, "");
117 ((GraphViz.Group)phase().toGraphViz(gv)).add(n);
120 public boolean isTransparent() { return false; }
121 public boolean isHidden() { return false; }