Home
last modified time | relevance | path

Searched refs:fstack (Results 1 – 5 of 5) sorted by relevance

/original-bsd/contrib/sort/
H A Dfiles.c42 rewind(fstack[infl0.top + i].fd);
43 fstack[infl0.top + i].max_o = 0;
49 maxb = fstack[infl0.top].maxb;
55 fd = fstack[infl0.top + cnt].fd;
60 fstack[infl0.top+cnt].max_o
64 fseek(fd, fstack[infl0.top+
121 if (!(fd = fstack[flno].fd))
152 if(flno >= 0) fstack[flno].fd = 0;
185 if (!(dbdesc = fstack[flno].fd))
297 fd = fstack[flno].fd;
[all …]
H A Dfsort.c29 struct tempfile fstack[MAXFCT]; variable
108 fstack[MAXFCT-16+mfct].fd = ftmp();
112 append(keylist, nelem, depth, fstack[
121 fstack[tfiles.top + ntfiles].fd
124 fstack[tfiles.top+ntfiles].fd,
133 fstack[tfiles.top + ntfiles].fd= ftmp();
135 weights, fstack[tfiles.top+ntfiles].fd);
168 fstack[tfiles.top].lastb = lastb;
169 fstack[tfiles.top].maxb = maxb;
H A Dfsort.h34 extern struct tempfile fstack[MAXFCT];
H A Dmsort.c73 l_fstack = fstack + files.top;
75 l_fstack = fstack;
/original-bsd/old/pcc/mip/
H A Dfort.c108 NODE * fstack[NSTACKSZ]; variable
132 fsp = fstack;
202 if( fsp >= &fstack[NSTACKSZ] ) uerror( "expression depth exceeded" );
250 if( fsp == fstack ) continue; /* filename only */
251 if( --fsp != fstack ) uerror( "expression poorly formed" );
254 p = fstack[0];