+ public void performReductions(Node n2) {
+ if (!allqueued) performReductions();
+ else state.invokeReductions(token, this, this, n2);
+ }
+
+ public void performEmptyReductions() { state.invokeReductions(token, this, null, null); }
+ public final void invoke(Position r, Node n, Node n2) {
+ //if (r.owner().lame) return;
+ 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(), holder);
+ else n.reduce(r, r.pos-1, n.phase(), holder, null, n.pending(n));
+ } else {
+ Forest[] holder = new Forest[r.pos];
+ if (r.pos<=0) throw new Error("called wrong form of reduce()");
+ int pos = r.pos-1;
+ n.reduce(r, pos, n.phase(), holder, n2, n.pending(n));
+ }
+ }
+
+ /*
+ public void reduce(Position r, int pos, Phase target, Forest[] holder) {
+ reduce(r, pos, target, holder, null); }
+ public void reduce(Position r, int pos, Phase target, Forest[] holder, Node only) {
+ reduce(r, pos, target, holder, only, this.pending());
+ }
+ */
+ public void reduce(Position r, int pos, Phase target, Forest[] holder, Node only, Forest pending) {
+ Forest old = holder[pos];
+ holder[pos] = pending;
+ if (pos==0) {
+
+ // FIXME: I'm unsure about this -- basically we want to deal with the case where
+ // there are two nodes, each of whose Ref points to the same Forest instance.
+ // Some node in the next phase has both of these as parents. This might happen
+ // since the same reduction can appear in more than one state.
+
+ if (only != null) {
+ holder[pos] = pending(only);
+ System.arraycopy(holder, 0, r.holder, 0, holder.length);
+ for(int i=0; i<r.pos; i++) if (r.holder[i]==null) throw new Error("realbad");
+ Forest rex = null;
+ if (r.pos==1) rex = singularReductions.get(pending, r);
+ if (rex==null) {
+ rex = r.rewrite(phase().getLocation());
+ if (r.pos==1) singularReductions.put(pending, r, rex);
+ }
+ only.finish(r, rex, target, holder);
+ } else {
+ for(Forest result : results()) {
+ pending = holder[pos] = result;
+ System.arraycopy(holder, 0, r.holder, 0, holder.length);
+ for(int i=0; i<r.pos; i++) if (r.holder[i]==null) throw new Error("realbad");
+ Forest rex = null;
+ if (rex==null && r.pos==1) rex = singularReductions.get(pending, r);
+ if (rex==null) {
+ rex = r.rewrite(phase().getLocation());
+ if (r.pos==1) singularReductions.put(pending, r, rex);
+ }
+ for(Node child : parents()) {
+ if (pending(child)==result)
+ child.finish(r, rex, target, holder);
+ }
+ }
+ }
+ } else {
+ if (only != null) {
+ holder[pos] = pending(only);
+ only.reduce(r, pos-1, target, holder, null, only.pending(only));
+ } else {
+ for(Node child : this.parents()) {
+ holder[pos] = pending(child);
+ child.reduce(r, pos-1, target, holder, null, child.pending(child));
+ }
+ }
+ }
+ holder[pos] = old;