Home
last modified time | relevance | path

Searched refs:n_sf (Results 1 – 11 of 11) sorted by relevance

/illumos-gate/usr/src/contrib/ast/src/lib/libast/sfio/
H A Dsfpool.c81 p->n_sf = 0;
180 p->n_sf -= 1;
181 for(; n < p->n_sf; ++n)
187 if(p->n_sf == 0 || p == &_Sfpool)
194 for(n = 0; n < p->n_sf; ++n)
197 if(n < p->n_sf && n > 0)
210 if(p->n_sf == 1 )
235 for(n = p->n_sf-1; n >= 0; --n)
307 for(k = 0; k < p->n_sf && pf == NIL(Sfio_t*); ++k)
346 p->n_sf += 1;
[all …]
H A Dsfclose.c83 for(n = 0; n < _Sfpool.n_sf; ++n)
87 _Sfpool.n_sf -= 1;
88 for(; n < _Sfpool.n_sf; ++n)
H A Dsfraise.c45 if(next->n_sf > 0)
47 for(n = 0; n < p->n_sf; ++n)
H A Dsfswap.c78 else for(f1pool = f1->pool->n_sf-1; f1pool >= 0; --f1pool)
83 else for(f2pool = f2->pool->n_sf-1; f2pool >= 0; --f2pool)
H A Dsfsync.c47 if(next->n_sf > 0) in _sfall()
51 for(n = 0; n < ((p == &_Sfpool) ? p->n_sf : 1); ++n) in _sfall()
H A Dsfmode.c83 { for(n = 0; n < p->n_sf; ++n) in _sfcleanup()
137 if(p->n_sf >= p->s_sf)
148 memcpy((Void_t*)array,(Void_t*)p->sf,p->n_sf*sizeof(Sfio_t*));
160 p->sf[p->n_sf++] = f;
H A Dsfwalk.c51 { for(n = 0; n < p->n_sf; )
H A Dsfrd.c42 { if(p->n_sf <= 0) in _sfwrsync()
51 for(n = 0; n < _Sfpool.n_sf; ++n) in _sfwrsync()
H A Dsfstack.c76 for(n = 1; n < f1->pool->n_sf; ++n)
H A Dsfhdr.h681 int n_sf; /* number currently in pool */ member
/illumos-gate/usr/src/contrib/ast/src/lib/libast/stdio/
H A Dfcloseall.c45 if(next->n_sf > 0) in fcloseall()
47 for(n = 0; n < ((p == &_Sfpool) ? p->n_sf : 1); ++n) in fcloseall()