crlf->lf

NN/stack.c

-	static struct node
-	{ int key; struct node *next; };
-	static struct node *head, *z, *t;
-	stackinit_() 
-	   {
-	     head = (struct node *) malloc(sizeof *head);
-	     z = (struct node *) malloc(sizeof *z);
-	     head->next = z; head->key=0;
-	     z->next = z;
-	     z->key = 0;
-	   }
-	push_(p)
-           int *p;
-	   {
-	     int v;
-	     v = *p;
-	     t = (struct node *) malloc(sizeof *t);	
-	     t->key = v; t->next = head->next;	
-	     head->next =t;	
-	   }
-	pop_(x)
-           int *x;
-	   {
-	     t = head->next; head->next = t->next;
-	     *x = t->key;
-	     free(t);
-	   }
-	stackempty_(i)
-          int *i;
-	  { 
-	    *i = 0;
-            if(head->next == z) *i = 1;
-          }
-        stackflush_()
-           {
-             free(head);
-             free(z);
-           }
+	static struct node
+	{ int key; struct node *next; };
+	static struct node *head, *z, *t;
+	stackinit_() 
+	   {
+	     head = (struct node *) malloc(sizeof *head);
+	     z = (struct node *) malloc(sizeof *z);
+	     head->next = z; head->key=0;
+	     z->next = z;
+	     z->key = 0;
+	   }
+	push_(p)
+           int *p;
+	   {
+	     int v;
+	     v = *p;
+	     t = (struct node *) malloc(sizeof *t);	
+	     t->key = v; t->next = head->next;	
+	     head->next =t;	
+	   }
+	pop_(x)
+           int *x;
+	   {
+	     t = head->next; head->next = t->next;
+	     *x = t->key;
+	     free(t);
+	   }
+	stackempty_(i)
+          int *i;
+	  { 
+	    *i = 0;
+            if(head->next == z) *i = 1;
+          }
+        stackflush_()
+           {
+             free(head);
+             free(z);
+           }

NN/stackpair.c

-	static struct node
-	{ int key; struct node *next; };
-	static struct node *heada, *za, *ta;
-	static struct node *headb, *zb, *tb;
-	stackpairinit_() 
-	   {
-	     heada = (struct node *) malloc(sizeof *heada);
-	     za = (struct node *) malloc(sizeof *za);
-	     heada->next = za; heada->key=0;
-	     za->next = za;
-	     za->key = 0;
-
-	     headb = (struct node *) malloc(sizeof *headb);
-	     zb = (struct node *) malloc(sizeof *zb);
-	     headb->next = zb; headb->key=0;
-	     zb->next = zb;
-	     zb->key = 0;
-	   }
-	stackpairflush_() 
-	   {
-             free(heada);
-             free(headb);
-             free(za);
-             free(zb);
-	   }
-	pushpair_(pa, pb)
-             int *pa;
-             int *pb;
-	   {
-	     int va;
-	     int vb;
-	     va = *pa;
-	     ta = (struct node *) malloc(sizeof *ta);	
-	     ta->key = va; ta->next = heada->next;	
-	     heada->next =ta;	
-
-	     vb = *pb;
-	     tb = (struct node *) malloc(sizeof *tb);	
-	     tb->key = vb; tb->next = headb->next;	
-	     headb->next =tb;	
-	   }
-	poppair_(xa,xb)
-             int *xa;
-             int *xb;
-	   {
-	     ta = heada->next; heada->next = ta->next;
-	     *xa = ta->key;
-	     free(ta);
-	     tb = headb->next; headb->next = tb->next;
-	     *xb = tb->key;
-	     free(tb);
-	   }
-	stackpairempty_(i)
-            int *i;
-	  { 
-	    *i = 0;
-            if(heada->next == za) *i = 1;
-          }
+	static struct node
+	{ int key; struct node *next; };
+	static struct node *heada, *za, *ta;
+	static struct node *headb, *zb, *tb;
+	stackpairinit_() 
+	   {
+	     heada = (struct node *) malloc(sizeof *heada);
+	     za = (struct node *) malloc(sizeof *za);
+	     heada->next = za; heada->key=0;
+	     za->next = za;
+	     za->key = 0;
+
+	     headb = (struct node *) malloc(sizeof *headb);
+	     zb = (struct node *) malloc(sizeof *zb);
+	     headb->next = zb; headb->key=0;
+	     zb->next = zb;
+	     zb->key = 0;
+	   }
+	stackpairflush_() 
+	   {
+             free(heada);
+             free(headb);
+             free(za);
+             free(zb);
+	   }
+	pushpair_(pa, pb)
+             int *pa;
+             int *pb;
+	   {
+	     int va;
+	     int vb;
+	     va = *pa;
+	     ta = (struct node *) malloc(sizeof *ta);	
+	     ta->key = va; ta->next = heada->next;	
+	     heada->next =ta;	
+
+	     vb = *pb;
+	     tb = (struct node *) malloc(sizeof *tb);	
+	     tb->key = vb; tb->next = headb->next;	
+	     headb->next =tb;	
+	   }
+	poppair_(xa,xb)
+             int *xa;
+             int *xb;
+	   {
+	     ta = heada->next; heada->next = ta->next;
+	     *xa = ta->key;
+	     free(ta);
+	     tb = headb->next; headb->next = tb->next;
+	     *xb = tb->key;
+	     free(tb);
+	   }
+	stackpairempty_(i)
+            int *i;
+	  { 
+	    *i = 0;
+            if(heada->next == za) *i = 1;
+          }