-// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
package edu.berkeley.sbp;
import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
import edu.berkeley.sbp.Parser.Table.*;
-import edu.berkeley.sbp.Sequence.Position;
+import edu.berkeley.sbp.Sequence.Pos;
+import edu.berkeley.sbp.Sequence.Pos;
import java.io.*;
import java.util.*;
import java.lang.reflect.*;
-/** a node in the GSS */
-final class Node implements Invokable<Position, Node, Node>, IntegerMappable, GraphViz.ToGraphViz {
-
- public static int node_idx = 0;
+abstract class Node<OtherNode extends Node>
+ implements IntegerMappable,
+ GraphViz.ToGraphViz,
+ Iterable<OtherNode> {
private final GSS.Phase phase;
-
- public FastSet<Node> setx = new FastSet<Node>();
- public FastSet<Node> childs = new FastSet<Node>();
-
- private boolean allqueued = false;
-
- /** what state this node is in */
- public final Parser.Table.State state;
-
- /** which GSS.Phase this Node belongs to (node that Node is also a non-static inner class of GSS.Phase) */
- public GSS.Phase phase() { return phase; }
-
- private HashSet<Forest.Many> resultMap = new HashSet<Forest.Many>();
- public Iterable<Forest.Many> results() { return resultMap; }
- public Iterable<Node> parents() { return setx; }
- public void addParent(Node n, boolean b) {
- if (n==null) return;
- setx.add(n, b);
- n.childs.add(this, true);
- //else
- //System.out.println("************ evilstate: " + this);
- }
- public boolean merge(Node parent, Forest result) {
- // FIXME: inefficient!
- for(Forest.Many f : results()) {
- if (f.parents.contains(parent) /* UGLY: */ && f.parents.size()==1) {
- f.merge(result);
- return true;
- }
- }
- Forest.Many f = new Forest.Many();
- f.parents.add(parent);
- f.merge(result);
- resultMap.add(f);
- addParent(parent, true);
- return false;
+ private final GSS.Phase predecessorPhase;
+ protected boolean destroyed = false;
+ private int numNonDoomedSuccessors = 0;
+ private boolean hasPathToRoot = false;
+
+ private FastSet<OtherNode> predecessors = new FastSet<OtherNode>();
+ private FastSet<OtherNode> successors = new FastSet<OtherNode>();
+ //protected HashSet<OtherNode> predecessors = new HashSet<OtherNode>();
+ //protected HashSet<OtherNode> successors = new HashSet<OtherNode>();
+
+ public GSS.Phase phase() { return phase; }
+ public GSS.Phase predecessorPhase() { return predecessorPhase; }
+ public boolean hasPredecessors() { return predecessors.size() > 0; }
+ public boolean hasSuccessors() { return successors.size() > 0; }
+ public boolean hasNonDoomedSuccessors() { return numNonDoomedSuccessors > 0; }
+
+ public boolean hasPathToRoot() { return hasPathToRoot; }
+ public void updatePathsToRootAfterRemoval() {
+ if (!hasPathToRoot()) return;
+ for(OtherNode on : predecessors)
+ if (on.hasPathToRoot())
+ return;
+ hasPathToRoot = false;
+ for(OtherNode on : successors)
+ on.updatePathsToRootAfterRemoval();
}
- public void performReductions() {
- if (allqueued) return;
- allqueued = true;
- state.invokeReductions(phase().token(), this, this, null);
+ /**
+ * Every Node has a phase; StateNodes belong to the phase in
+ * which they were shifted, ResultNodes belong to the phase of
+ * their predecessors. All of the predecessors of a given node
+ * must belong to the same phase
+ */
+ public Node(GSS.Phase phase, GSS.Phase predecessorPhase) {
+ this.phase = phase;
+ this.predecessorPhase = predecessorPhase;
}
- public void performReductions(Node n2) {
- if (!allqueued) phase().reductionQueue.add(this);//performReductions();
- else state.invokeReductions(phase().token(), this, this, n2);
+ /** only to be invoked (or overridden as public) by the subclass */
+ protected void addPred(OtherNode pred) {
+ if (predecessors.contains(pred)) throw new Error("a predecessor was added twice");
+ if (pred.phase() != predecessorPhase()) throw new Error();
+ predecessors.add(pred);
+ pred.addSucc(this);
+ if (pred.hasPathToRoot()) hasPathToRoot = true;
}
-
- public Parser.Table.State state() { return state; }
-
- public void performEmptyReductions() { state.invokeReductions(phase().token, this, null, null); }
- public final void invoke(Position r, Node n, Node n2) {
- //reductions++;
- //if (r.pos==1) single_newnode++;
- //if (r.pos>1) multi_newnode++;
- if (n==null || n2==null || r.pos==0) {
- if (r.pos==0) {
- if (n==null) n = this;
- else return;
- }
- if (n==null) return;
- Forest[] holder = new Forest[r.pos];
- if (r.pos==0) n.finish(r, r.zero(n.phase().getLocation().createRegion(n.phase().getLocation())), n.phase());
- else n.reduce(r, r.pos-1, n.phase(), null);
- } else {
- if (r.pos<=0) throw new Error("called wrong form of reduce()");
- int pos = r.pos-1;
- n.reduce(r, pos, n.phase(), n2);
- }
+ public void addSucc(OtherNode succ) {
+ if (successors.contains(succ)) throw new Error("a predecessor was added twice");
+ successors.add(succ);
+ numNonDoomedSuccessors += succ.isDoomedState() ? 0 : 1;
+ if (predecessors.size() > 1 && (((Object)this) instanceof ResultNode)) throw new Error();
}
- public void reduce(Position r, int pos, GSS.Phase target, Node only) {
- Forest[] holder = r.holder;
- Forest old = holder[pos];
-
- //toplevel_reductions++;
- HashSet<Forest> rr = new HashSet<Forest>();
- for(Forest result : results()) {
- rr.add(result);
+ protected void destroy() {
+ destroyed = true;
+ while(predecessors.size() > 0) {
+ OtherNode pred = predecessors.first();
+ removePred(pred);
+ pred.removeSucc(this);
}
- //System.out.println(r);
- for(Forest result : rr) {
- for(Node child : ((Forest.Many<?>)result).parents) {
- if (only != null && child!=only) continue;
- holder[pos] = result;
- if (pos==0) child.finish(r, r.rewrite(child.phase().getLocation().createRegion(target.getLocation())), target);
- else child.reduce(r, pos-1, target, null);
- }
+ predecessors = null;
+ while(successors.size() > 0) {
+ OtherNode succ = successors.first();
+ removeSucc(succ);
+ succ.removePred(this);
}
- holder[pos] = old;
+ successors = null;
}
-
- public void finish(Position r, Forest result, GSS.Phase target) {
- Parser.Table.State state0 = (Parser.Table.State)state.gotoSetNonTerminals.get(r.owner());
- if (result==null) throw new Error();
- if (state0!=null)
- target.newNode(this, result, state0, r.pos<=0, r);
+ public void removeSucc(OtherNode succ) {
+ if (!successors.contains(succ)) return;
+ successors.remove(succ);
+ numNonDoomedSuccessors -= succ.isDoomedState() ? 0 : 1;
+ check();
+ }
+ public void removePred(OtherNode pred) {
+ if (!predecessors.contains(pred)) return;
+ predecessors.remove(pred);
+ updatePathsToRootAfterRemoval();
+ check();
}
- Node(GSS.Phase phase, Node parent, Forest pending, State state) {
- this.phase = phase;
- this.state = state;
- this.merge(parent, pending);
- GSS.Phase start = parent==null ? null : parent.phase();
- if (parent != null) addParent(parent, true);
- if (phase.hash.get(state, start) != null) throw new Error("severe problem!");
- phase.hash.put(state, start, this);
+
+ public abstract boolean isDoomedState();
+ protected abstract void check();
+
+ public Iterator<OtherNode> iterator() { return predecessors.iterator(); }
+ public Iterable<OtherNode> successors() { return successors; }
+
+ public boolean noSuccessors() { return successors.size()==0; }
+ public boolean predecessorsContains(OtherNode n) {
+ return predecessors.contains(n);
}
- public int toInt() { return idx; }
- private final int idx = node_idx++;
// GraphViz //////////////////////////////////////////////////////////////////////////////
- public GraphViz.Node toGraphViz(GraphViz gv) {
+ public GraphViz.StateNode toGraphViz(GraphViz gv) {
if (gv.hasNode(this)) return gv.createNode(this);
- GraphViz.Node n = gv.createNode(this);
- n.label = ""+state.toStringx();
+ GraphViz.StateNode n = gv.createNode(this);
+ /*
+ n.label = ""+f;
+ n.shape = "rectangle";
+ //if (pred()!=null) n.edge(pred, "");
+ n.color = "blue";
+ if (phase() != null)
+ ((GraphViz.Group)phase().toGraphViz(gv)).add(n);
+ n.label = "state["+state.toInt()+"]";
n.shape = "rectangle";
- boolean hasparents = false;
- for(Node parent : parents()) { hasparents = true; n.edge(parent, ""); }
- for(Forest result : results()) n.edge(result, "");
- n.color = !hasparents ? "blue" : /*state.evil ? "red" :*/ "green";
+ boolean haspreds = false;
+ for(ResultNode r : results) n.edge(r, "");
+ n.color = state.doomed ? "red" : "green";
((GraphViz.Group)phase().toGraphViz(gv)).add(n);
+ */
return n;
}
public boolean isTransparent() { return false; }
public boolean isHidden() { return false; }
-}
+ // IntegerMappable ////////////////////////////////////////////////////////////
+
+ private static int node_idx = 0;
+ private final int idx = node_idx++;
+ public int toInt() { return idx; }
+
+}
\ No newline at end of file