Lines Matching refs:nonodes

34 long nonodes, endsite, outgrno, nextree, which;  variable
87 void freetree2 (pointarray treenode, long nonodes) in freetree2() argument
99 for (i = spp; i < nonodes; i++) { in freetree2()
215 void alloctree(pointarray *treenode, long nonodes, boolean usertree) in alloctree() argument
222 *treenode = (pointarray)Malloc(nonodes*sizeof(node *)); in alloctree()
232 for (i = spp; i < nonodes; i++) { in alloctree()
250 void allocx(long nonodes, long rcategs, pointarray treenode, boolean usertree) in allocx() argument
264 for (i = spp; i < nonodes; i++) { in allocx()
278 void prot_allocx(long nonodes, long rcategs, pointarray treenode, in prot_allocx() argument
293 for (i = spp; i < nonodes; i++) { in prot_allocx()
309 void setuptree(pointarray treenode, long nonodes, boolean usertree) in setuptree() argument
315 for (i = 1; i <= nonodes; i++) { in setuptree()
327 for (i = spp + 1; i <= nonodes; i++) { in setuptree()
694 setuptree(treenode, nonodes, usertree); in makevalues()
698 for (i = spp; i < nonodes; i++) { in makevalues()
1603 last = nonodes; in flipindexes()
1657 min = nonodes; in smallest()
1798 for (i = nextnode; i <= nonodes; i++) in savetree()
1801 for (i = 0; i < nonodes; i++) in savetree()
1911 for (i = 0; i < nonodes; i++) { in clearcollapse()
1930 for (i = 0; i < nonodes; i++) { in clearbottom()
2363 for (i = 0; i < nonodes; i++) { in clearvisited()
3411 void copy_(tree *a, tree *b, long nonodes, long categs) in copy_() argument
3429 for (i = spp; i < nonodes; i++) { in copy_()
3464 void prot_copy_(tree *a, tree *b, long nonodes, long categs) in prot_copy_() argument
3485 for (i = spp; i < nonodes; i++) { in prot_copy_()
3830 void freenodes(long nonodes, pointarray treenode) in freenodes() argument
3838 for (i = spp; i < nonodes; i++) { in freenodes()
3860 void freetree(long nonodes, pointarray treenode) in freetree() argument
3868 for (i = spp; i < nonodes; i++) { in freetree()
3883 void prot_freex_notip(long nonodes, pointarray treenode) in prot_freex_notip() argument
3889 for (i = spp; i < nonodes; i++) { in prot_freex_notip()
3907 void prot_freex(long nonodes, pointarray treenode) in prot_freex() argument
3919 for (i = spp; i < nonodes; i++) { in prot_freex()
3932 void freex_notip(long nonodes, pointarray treenode) in freex_notip() argument
3938 for (i = spp; i < nonodes; i++) { in freex_notip()
3952 void freex(long nonodes, pointarray treenode) in freex() argument
3964 for (i = spp; i < nonodes; i++) { in freex()
4050 for(i = (index2-1); i < nonodes-1 && treenode[i+1]; i++){ in collapsetree()
4068 treenode[nonodes-1]=x2; in collapsetree()