1 files changed, 0 insertions, 214 deletions
diff --git a/nim/trees.pas b/nim/trees.pas
deleted file mode 100755
index 0e0c04a22..000000000
--- a/nim/trees.pas
+++ /dev/null
@@ -1,214 +0,0 @@
-//
-//
-//           The Nimrod Compiler
-//        (c) Copyright 2008 Andreas Rumpf
-//
-//    See the file "copying.txt", included in this
-//    distribution, for details about the copyright.
-//
-unit trees;
-
-// tree helper routines
-
-interface
-
-{$include 'config.inc'}
-
-uses
-  nsystem, ast, astalgo, scanner, msgs, strutils;
-
-function getMagic(op: PNode): TMagic;
-
-// function getConstExpr(const t: TNode; out res: TNode): Boolean;
-
-function isConstExpr(n: PNode): Boolean;
-
-
-function flattenTree(root: PNode; op: TMagic): PNode;
-
-function TreeToSym(t: PNode): PSym;
-
-procedure SwapOperands(op: PNode);
-function getOpSym(op: PNode): PSym;
-
-function getProcSym(call: PNode): PSym;
-
-function ExprStructuralEquivalent(a, b: PNode): Boolean;
-
-function sameTree(a, b: PNode): boolean;
-function cyclicTree(n: PNode): boolean;
-
-implementation
-
-function hasSon(father, son: PNode): boolean;
-var
-  i: int;
-begin
-  for i := 0 to sonsLen(father)-1 do 
-    if father.sons[i] = son then begin result := true; exit end;
-  result := false
-end;
-
-function cyclicTreeAux(n, s: PNode): boolean;
-var
-  i, m: int;
-begin
-  if n = nil then begin result := false; exit end;
-  if hasSon(s, n) then begin result := true; exit end;
-  m := sonsLen(s);
-  addSon(s, n);
-  if not (n.kind in [nkEmpty..nkNilLit]) then 
-    for i := 0 to sonsLen(n)-1 do 
-      if cyclicTreeAux(n.sons[i], s) then begin  
-        result := true; exit 
-      end;
-  result := false;
-  delSon(s, m);
-end;
-
-function cyclicTree(n: PNode): boolean;
-var
-  s: PNode;
-begin
-  s := newNodeI(nkEmpty, n.info);
-  result := cyclicTreeAux(n, s);
-end;
-
-function ExprStructuralEquivalent(a, b: PNode): Boolean;
-var
-  i: int;
-begin
-  result := false;
-  if a = b then begin
-    result := true
-  end
-  else if (a <> nil) and (b <> nil) and (a.kind = b.kind) then
-    case a.kind of
-      nkSym: // don't go nuts here: same symbol as string is enough:
-        result := a.sym.name.id = b.sym.name.id;
-      nkIdent:
-        result := a.ident.id = b.ident.id;
-      nkCharLit..nkInt64Lit:
-        result := a.intVal = b.intVal;
-      nkFloatLit..nkFloat64Lit:
-        result := a.floatVal = b.floatVal;
-      nkStrLit..nkTripleStrLit:
-        result := a.strVal = b.strVal;
-      nkEmpty, nkNilLit, nkType: result := true;
-      else if sonsLen(a) = sonsLen(b) then begin
-        for i := 0 to sonsLen(a)-1 do
-          if not ExprStructuralEquivalent(a.sons[i], b.sons[i]) then exit;
-        result := true
-      end
-    end
-end;
-
-function sameTree(a, b: PNode): Boolean;
-var
-  i: int;
-begin
-  result := false;
-  if a = b then begin
-    result := true
-  end
-  else if (a <> nil) and (b <> nil) and (a.kind = b.kind) then begin
-    if a.flags <> b.flags then exit;
-    if a.info.line <> b.info.line then exit;
-    if a.info.col <> b.info.col then exit;
-    //if a.info.fileIndex <> b.info.fileIndex then exit;
-    case a.kind of
-      nkSym: // don't go nuts here: same symbol as string is enough:
-        result := a.sym.name.id = b.sym.name.id;
-      nkIdent:
-        result := a.ident.id = b.ident.id;
-      nkCharLit..nkInt64Lit:
-        result := a.intVal = b.intVal;
-      nkFloatLit..nkFloat64Lit:
-        result := a.floatVal = b.floatVal;
-      nkStrLit..nkTripleStrLit:
-        result := a.strVal = b.strVal;
-      nkEmpty, nkNilLit, nkType: result := true;
-      else if sonsLen(a) = sonsLen(b) then begin
-        for i := 0 to sonsLen(a)-1 do
-          if not sameTree(a.sons[i], b.sons[i]) then exit;
-        result := true
-      end
-    end
-  end
-end;
-
-function getProcSym(call: PNode): PSym;
-begin
-  result := call.sons[0].sym;
-end;
-
-function getOpSym(op: PNode): PSym;
-begin
-  if not (op.kind in [nkCall, nkHiddenCallConv, nkCommand, nkCallStrLit]) then
-    result := nil
-  else begin
-    if (sonsLen(op) <= 0) then InternalError(op.info, 'getOpSym');
-    if op.sons[0].Kind = nkSym then result := op.sons[0].sym
-    else result := nil
-  end
-end;
-
-function getMagic(op: PNode): TMagic;
-begin
-  case op.kind of
-    nkCall, nkHiddenCallConv, nkCommand, nkCallStrLit: begin
-      case op.sons[0].Kind of
-        nkSym: begin
-          result := op.sons[0].sym.magic;
-        end;
-        else result := mNone
-      end
-    end;
-    else
-      result := mNone
-  end
-end;
-
-function TreeToSym(t: PNode): PSym;
-begin
-  result := t.sym
-end;
-
-function isConstExpr(n: PNode): Boolean;
-begin
-  result := (n.kind in [nkCharLit..nkInt64Lit, nkStrLit..nkTripleStrLit,
-                       nkFloatLit..nkFloat64Lit, nkNilLit]) 
-                       or (nfAllConst in n.flags)
-end;
-
-procedure flattenTreeAux(d, a: PNode; op: TMagic);
-var
-  i: int;
-begin
-  if (getMagic(a) = op) then // BUGFIX
-    for i := 1 to sonsLen(a)-1 do // BUGFIX
-      flattenTreeAux(d, a.sons[i], op)
-  else
-    // a is a "leaf", so add it:
-    addSon(d, copyTree(a))
-end;
-
-function flattenTree(root: PNode; op: TMagic): PNode;
-begin
-  result := copyNode(root);
-  if (getMagic(root) = op) then begin // BUGFIX: forget to copy prc
-    addSon(result, copyNode(root.sons[0]));
-    flattenTreeAux(result, root, op)
-  end
-end;
-
-procedure SwapOperands(op: PNode);
-var
-  tmp: PNode;
-begin
-  tmp := op.sons[1];
-  op.sons[1] := op.sons[2];
-  op.sons[2] := tmp;
-end;
-
-end.