X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FNode.java;h=83533849f3bc6e1b8ad7ee87004f5358ca5b38c6;hp=5c0f023558e93dc7ddaf1b1b25f0bb4fd1d24413;hb=14b3d2ee6a2d2ef84628e541ec291961f2061a5a;hpb=e84029a8b861075d6d0ed5040f919b2e4da4c98f diff --git a/src/edu/berkeley/sbp/Node.java b/src/edu/berkeley/sbp/Node.java index 5c0f023..8353384 100644 --- a/src/edu/berkeley/sbp/Node.java +++ b/src/edu/berkeley/sbp/Node.java @@ -1,34 +1,61 @@ -// 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, + implements Invokable, IntegerMappable, GraphViz.ToGraphViz, Iterable { /** which GSS.Phase this Node belongs to */ - public GSS.Phase phase() { return phase; } + public GSS.Phase phase() { return phase; } public Iterator iterator() { return results.iterator(); } public Parser.Table.State state() { return state; } public int toInt() { return idx; } - public boolean merge(Result r) { - if (results.contains(r)) return true; - results.add(r); - if (fromEmptyReduction) return false; - state.invokeReductions(phase().getToken(), this, false, r); - return false; + boolean destroyed = false; + + public void check() { + if (destroyed) return; + boolean dead = true; + // - all nodes must have a predecessor + // - non-doomed nodes must either: + // - be on the frontier or + // - have a non-doomed node closer to the frontier than themself + if (phase.isFrontier()) dead = false; + else for(Result r : successors) + if (state.doomed) { if (r.usedByAnyNode()) { dead = false; break; } } + else { if (r.usedByNonDoomedNode()) { dead = false; break; } } + dead |= results.size()==0; + if (!dead) return; + destroyed = true; + if (phase() != null && phase().hash != null) + phase().hash.remove(state, predPhase); + while(successors.size()>0) + for(Result r : successors) { + successors.remove(r); + r.removePred(this); + break; + } + while(results.size()>0) + for(Result r : results) { + results.remove(r); + r.removeSucc(this); + break; + } + results = null; + successors = null; } ////////////////////////////////////////////////////////////////////// @@ -37,68 +64,98 @@ final class Node private final int idx = node_idx++; private final GSS.Phase phase; + private final GSS.Phase predPhase; private final Parser.Table.State state; - private final boolean fromEmptyReduction; - //private FastSet results = new FastSet(); - private HashSet results = new HashSet(); - - public final void invoke(Position r, Boolean emptyProductions, Result only) { - if (emptyProductions != (r.pos==0)) return; - if (r.pos==0) finish(r, r.zero(phase().getLocation().createRegion(phase().getLocation())), phase()); - else reduce(r, r.pos-1, phase(), only); + private boolean fromEmptyReduction; + private FastSet results = new FastSet(); + private FastSet successors = new FastSet(); + //private HashSet results = new HashSet(); + //private HashSet successors = new HashSet(); + + public final void invoke(Pos r, Result only, Object o) { + boolean emptyProductions = only==null; + if (emptyProductions != (r.numPops()==0)) return; + if (r.numPops()!=0) reduce(r, r.numPops()-1, phase(), only); + else { + Input.Region region = phase().getLocation().createRegion(phase().getLocation()); + phase().newNodeFromReduction(r.rewrite(region), r, this); + } } - private void reduce(Position r, int pos, GSS.Phase target, Result only) { - Forest[] holder = r.holder; - Forest old = holder[pos]; + private void reduce(Pos r, int pos, GSS.Phase target, Result only) { for(Result res : results) - if (only == null || res == only) { - Node child = res.parent(); - holder[pos] = res.getForest(); - if (pos>0) child.reduce(r, pos-1, target, null); - else { - Reduction reduction = - new Reduction(child, r, r.rewrite(child.phase().getLocation().createRegion(target.getLocation())), target); - target.reductionQueue.add(reduction); - } - } - - holder[pos] = old; + if (only == null || res == only) + for(Node pred : res.getPreds()) + reduce2(r, pos, target, pred, res.getForest()); } - void finish(Position r, Forest forest, GSS.Phase target) { - Parser.Table.State state0 = (Parser.Table.State)state.gotoSetNonTerminals.get(r.owner()); - Result result = new Result(forest, this, r); - target.newNodeFromReduction(result, state0, r.pos<=0, r); + void reduce2(Pos r, int pos, GSS.Phase target, Node pred, Forest f) { + Forest[] holder = r.holder; + Forest old = pos >= holder.length ? null : holder[pos]; + if (pos < holder.length) holder[pos] = f; + if (pos>0) pred.reduce(r, pos-1, target, null); + else { + Input.Region region = pred.phase().getLocation().createRegion(target.getLocation()); + new Reduction(pred, r, r.rewrite(region), target); + } + if (pos < holder.length) holder[pos] = old; } - Node(GSS.Phase phase, Result result, State state, boolean fromEmptyReduction) { + Node(GSS.Phase phase, Forest f, Pos reduction, Node pred, State state, boolean fromEmptyReduction) { + this(phase, new Result(f, reduction, pred), state, fromEmptyReduction); + } + Node(GSS.Phase phase, Result pred, State state, boolean fromEmptyReduction) { this.phase = phase; this.state = state; this.fromEmptyReduction = fromEmptyReduction; - results.add(result); - if (phase.hash.get(state, result.phase()) != null) throw new Error("severe problem!"); - phase.hash.put(state, result.phase(), this); - - for(Object s : state.also) - phase.newNode(result, (State)s, fromEmptyReduction); + if (phase.hash.get(state, pred.phase()) != null) throw new Error("severe problem!"); + this.predPhase = pred.phase(); + phase.hash.put(state, pred.phase(), this); - state.invokeReductions(phase().token, this, true, null); + results.add(pred); + pred.addSucc(this); if (!fromEmptyReduction) - state.invokeReductions(phase().getToken(), this, false, null); + state.invokeReductions(phase().getToken(), this, pred); + + state.invokeEpsilonReductions(phase().token, this); + } + + // Add/Remove Successors/Results ////////////////////////////////////////////////////////////////////////////// + + public void removeSucc(Result succ) { + successors.remove(succ); + check(); + } + public void removeResult(Result result) { + results.remove(result); + check(); + } + public void addSucc(Result succ) { + successors.add(succ); + } + public void addResult(Forest f, Pos reduction, Node pred) { + for(Result r : results) + if (r.predecessorsContains(pred)) { + r.merge(f); + return; + } + Result result = new Result(f, reduction, pred); + results.add(result); + result.addSucc(this); + if (!this.fromEmptyReduction) state.invokeReductions(phase().getToken(), this, result); } // GraphViz ////////////////////////////////////////////////////////////////////////////// public GraphViz.Node toGraphViz(GraphViz gv) { + if (results.size()==0) return null; if (gv.hasNode(this)) return gv.createNode(this); GraphViz.Node n = gv.createNode(this); - n.label = ""+state.toStringx(); + n.label = "state["+state.toInt()+"]"; n.shape = "rectangle"; - boolean hasparents = false; - //for(Node parent : parents()) { hasparents = true; n.edge(parent, ""); } - //for(Forest result : resultMap) n.edge(result, ""); - n.color = !hasparents ? "blue" : /*state.evil ? "red" :*/ "green"; + boolean haspreds = false; + for(Result r : results) n.edge(r, ""); + n.color = state.doomed ? "red" : "green"; ((GraphViz.Group)phase().toGraphViz(gv)).add(n); return n; }