1 files changed, 49 insertions, 49 deletions

diff --git a/src/node.c b/src/node.c
index 2b76ae8..9ce7a31 100644
--- a/src/node.c
+++ b/src/node.c
@@ -2,12 +2,12 @@
 Copyright 1991 by Stichting Mathematisch Centrum, Amsterdam, The
 Netherlands.
 
- All Rights Reserved
+                        All Rights Reserved
 
-Permission to use, copy, modify, and distribute this software and its
-documentation for any purpose and without fee is hereby granted,
+Permission to use, copy, modify, and distribute this software and its 
+documentation for any purpose and without fee is hereby granted, 
 provided that the above copyright notice appear in all copies and that
-both that copyright notice and this permission notice appear in
+both that copyright notice and this permission notice appear in 
 supporting documentation, and that the names of Stichting Mathematisch
 Centrum or CWI not be used in advertising or publicity pertaining to
 distribution of the software without specific, written prior permission.
@@ -29,17 +29,17 @@ OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 
 node *
 newtree(type)
- int type;
+	int type;
 {
- node *n = NEW(node, 1);
- if (n == NULL)
- return NULL;
- n->n_type = type;
- n->n_str = NULL;
- n->n_lineno = 0;
- n->n_nchildren = 0;
- n->n_child = NULL;
- return n;
+	node *n = NEW(node, 1);
+	if (n == NULL)
+		return NULL;
+	n->n_type = type;
+	n->n_str = NULL;
+	n->n_lineno = 0;
+	n->n_nchildren = 0;
+	n->n_child = NULL;
+	return n;
 }
 
 #define XXX 3 /* Node alignment factor to speed up realloc */
@@ -47,29 +47,29 @@ newtree(type)
 
 node *
 addchild(n1, type, str, lineno)
- register node *n1;
- int type;
- char *str;
- int lineno;
+	register node *n1;
+	int type;
+	char *str;
+	int lineno;
 {
- register int nch = n1->n_nchildren;
- register int nch1 = nch+1;
- register node *n;
- if (XXXROUNDUP(nch) < nch1) {
- n = n1->n_child;
- nch1 = XXXROUNDUP(nch1);
- RESIZE(n, node, nch1);
- if (n == NULL)
- return NULL;
- n1->n_child = n;
- }
- n = &n1->n_child[n1->n_nchildren++];
- n->n_type = type;
- n->n_str = str;
- n->n_lineno = lineno;
- n->n_nchildren = 0;
- n->n_child = NULL;
- return n;
+	register int nch = n1->n_nchildren;
+	register int nch1 = nch+1;
+	register node *n;
+	if (XXXROUNDUP(nch) < nch1) {
+		n = n1->n_child;
+		nch1 = XXXROUNDUP(nch1);
+		RESIZE(n, node, nch1);
+		if (n == NULL)
+			return NULL;
+		n1->n_child = n;
+	}
+	n = &n1->n_child[n1->n_nchildren++];
+	n->n_type = type;
+	n->n_str = str;
+	n->n_lineno = lineno;
+	n->n_nchildren = 0;
+	n->n_child = NULL;
+	return n;
 }
 
 /* Forward */
@@ -78,23 +78,23 @@ static void freechildren PROTO((node *));
 
 void
 freetree(n)
- node *n;
+	node *n;
 {
- if (n != NULL) {
- freechildren(n);
- DEL(n);
- }
+	if (n != NULL) {
+		freechildren(n);
+		DEL(n);
+	}
 }
 
 static void
 freechildren(n)
- node *n;
+	node *n;
 {
- int i;
- for (i = NCH(n); --i >= 0; )
- freechildren(CHILD(n, i));
- if (n->n_child != NULL)
- DEL(n->n_child);
- if (STR(n) != NULL)
- DEL(STR(n));
+	int i;
+	for (i = NCH(n); --i >= 0; )
+		freechildren(CHILD(n, i));
+	if (n->n_child != NULL)
+		DEL(n->n_child);
+	if (STR(n) != NULL)
+		DEL(STR(n));
 }