p.holder.merge(pending);
if (p.parents().contains(parent)) return true;
p.parents().add(parent, true);
- if (p!=parent && !fromEmptyReduction && reducing) p.queueReductions(parent);
+ if (p!=parent && !fromEmptyReduction && reducing) p.performReductions(parent);
return true;
}
private boolean newNode3(Node parent, Forest pending, State state, boolean fromEmptyReduction) {
Node n = new Node(parent, pending, state); // ALLOC
if (reducing) {
- n.queueEmptyReductions();
- if (!fromEmptyReduction) n.queueReductions(parent);
+ n.performEmptyReductions();
+ if (!fromEmptyReduction) n.performReductions(parent);
}
return true;
}
int num = hash.size();
for(int i=0; i<num; i++) {
Node n = reducing_list[i];
- n.queueEmptyReductions();
+ n.performEmptyReductions();
// INVARIANT: we never "see" a node until its parent-set is complete, modulo merges
}
for(int i=0; i<num; i++) {
Node n = reducing_list[i];
reducing_list[i] = null;
- n.queueReductions();
+ n.performReductions();
}
} catch (Reset r) {
reset();
public Forest pending() { return Phase.this.closed ? holder().resolve() : holder; }
public FastSet<Node> parents() { return this; }
- public void queueReductions() {
+ public void performReductions() {
if (allqueued) return;
allqueued = true;
state.invokeReductions(token, this, this, null);
}
- public void queueReductions(Node n2) {
- if (!allqueued) { queueReductions(); return; }
- state.invokeReductions(token, this, this, n2);
+ public void performReductions(Node n2) {
+ if (!allqueued) performReductions();
+ else state.invokeReductions(token, this, this, n2);
}
public final void invoke(Reduction r, Node n, Node n2) {
- if (n==null) {
- if (r.position.pos==0) r.reduce(this);
- } else if (r.position.pos==0) return;
- else if (n2==null) r.reduce(n);
- else r.reduce(n, n2);
+ if (n==null || n2==null || r.position.pos==0) {
+ if (r.position.pos==0) {
+ if (n==null) n = this;
+ else return;
+ }
+ if (n==null) return;
+ Forest[] holder = new Forest[r.position.pos];
+ if (r.position.pos==0) r.finish(n, r.zero(), n.phase(), holder);
+ else r.reduce(n, r.position.pos-1, n.phase(), holder);
+ } else {
+ r.reduce(n, n2);
+ }
}
- public void queueEmptyReductions() { state.invokeReductions(token, this, null, null); }
+ public void performEmptyReductions() { state.invokeReductions(token, this, null, null); }
- public boolean dead = false;
- public boolean redo = false;
private Node(Node parent, Forest pending, State state) {
this.state = state;
this.holder().merge(pending);