1: #include <stdio.h> 2: # 3: /* for testing only */ 4: #include "def.h" 5: #include "2.def.h" 6: 7: testaft() 8: { 9: int i; 10: for (i = 0; i < nodenum; ++i) 11: fprintf(stderr,"ntoaft[%d] = %d, ntobef[%d] = %d\n",i,ntoaft[i],i,ntobef[i]); 12: fprintf(stderr,"\n"); 13: for (i = 0; i < accessnum; ++i) 14: fprintf(stderr,"after[%d] = %d\n",i,after[i]); 15: } 16: 17: testhead(head) 18: VERT *head; 19: { 20: VERT v; 21: for (v = 0; v < nodenum; ++v) 22: fprintf(stderr,"head[%d] = %d\n",v,head[v]); 23: } 24: 25: testdom(dom) 26: VERT *dom; 27: { 28: VERT v; 29: for (v = 0; v < nodenum; ++v) 30: fprintf(stderr,"dom[%d] = %d\n",v,dom[v]); 31: } 32: 33: 34: testtree() 35: { 36: VERT v; 37: int i; 38: for (v = 0; v < nodenum; ++v) 39: { 40: fprintf(stderr,"%d: RSIB %d, ",v,RSIB(v)); 41: for (i = 0; i < CHILDNUM(v); ++i) 42: fprintf(stderr," %d",LCHILD(v,i)); 43: fprintf(stderr,"\n"); 44: } 45: }