X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FNode.java;h=1168c78419ff63f58a555117096ae66a1d419c3c;hp=53782f7c65c83bb5960709499a0076e9e6a4815e;hb=9680415a3e36240dcac947b3d4d1ad6b312c4fce;hpb=a8478f5ddfbfbc8d910d09f27163cbd55752d3b6 diff --git a/src/edu/berkeley/sbp/Node.java b/src/edu/berkeley/sbp/Node.java index 53782f7..1168c78 100644 --- a/src/edu/berkeley/sbp/Node.java +++ b/src/edu/berkeley/sbp/Node.java @@ -1,147 +1,60 @@ -// 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, IntegerMappable, GraphViz.ToGraphViz { +class Node + implements IntegerMappable, + GraphViz.ToGraphViz, + Iterable { - public static int node_idx = 0; + protected FastSet predecessors = new FastSet(); + protected FastSet successors = new FastSet(); + //private HashSet predecessors = new HashSet(); + //private HashSet successors = new HashSet(); - private final GSS.Phase phase; + public Iterator iterator() { return predecessors.iterator(); } - public FastSet setx = new FastSet(); - public FastSet childs = new FastSet(); - - 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 resultMap = new HashSet(); - public Iterable results() { return resultMap; } - public Iterable 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; - } - - public void performReductions() { - if (allqueued) return; - allqueued = true; - state.invokeReductions(phase().token(), this, this, null); + public boolean noSuccessors() { return successors.size()==0; } + public boolean predecessorsContains(OtherNode n) { + return predecessors.contains(n); } - public void performReductions(Node n2) { - if (!allqueued) phase().reductionQueue.add(this);//performReductions(); - else state.invokeReductions(phase().token(), this, this, n2); - } - - 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 reduce(Position r, int pos, GSS.Phase target, Node only) { - Forest[] holder = r.holder; - Forest old = holder[pos]; - - //toplevel_reductions++; - HashSet rr = new HashSet(); - for(Forest result : results()) { - rr.add(result); - } - //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); - } - } - holder[pos] = old; - } - - 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); - } - - 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 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