Searched refs:inpsort (Results 1 – 6 of 6) sorted by relevance
129 qsort((char *)inpsort, (size_t)inplast, sizeof *inpsort, blksort); in pass2()136 inpend = &inpsort[inplast]; in pass2()137 for (inpp = inpsort; inpp < inpend; inpp++) { in pass2()140 inpp - inpsort, (int)inplast, in pass2()141 (int)((inpp - inpsort) * 100 / inplast)); in pass2()146 (int)((inpp - inpsort) * 100 / inplast)); in pass2()200 for (inpp = inpsort; inpp < inpend; inpp++) { in pass2()
1177 inpsort = (struct inoinfo **)reallocarray((char *)inpsort, in cacheino() 1179 if (inpsort == NULL) in cacheino() 1182 inpsort[inplast++] = inp; in cacheino() 1217 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) { in removecachedino() 1220 *inpp = inpsort[inplast - 1]; in removecachedino() 1243 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) in inocleanup() 1247 free((char *)inpsort); in inocleanup() [all...]
53 struct inoinfo **inpsort; /* disk order list of directory inodes */ variable167 inpsort = (struct inoinfo **)Calloc(listmax, sizeof(struct inoinfo *)); in setup()169 if (inpsort == NULL || inphash == NULL) { in setup()
64 inp = inpsort[inpindex]; in pass3()
73 inpend = &inpsort[inplast]; in propagate() 76 for (inpp = inpsort; inpp < inpend; inpp++) { in propagate()
313 extern struct inoinfo **inpsort;