Searched refs:inpsort (Results 1 – 6 of 6) sorted by relevance
135 qsort((char *)inpsort, (size_t)inplast, sizeof *inpsort, blksort); in pass2()142 inpend = &inpsort[inplast]; in pass2()143 for (inpp = inpsort; inpp < inpend; inpp++) { in pass2()146 inpp - inpsort, (int)inplast, in pass2()147 (int)((inpp - inpsort) * 100 / inplast)); in pass2()152 (int)((inpp - inpsort) * 100 / inplast)); in pass2()206 for (inpp = inpsort; inpp < inpend; inpp++) { in pass2()
1183 inpsort = (struct inoinfo **)reallocarray((char *)inpsort, in cacheino()1185 if (inpsort == NULL) in cacheino()1188 inpsort[inplast++] = inp; in cacheino()1223 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) { in removecachedino()1226 *inpp = inpsort[inplast - 1]; in removecachedino()1249 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) in inocleanup()1253 free((char *)inpsort); in inocleanup()1254 inpsort = NULL; in inocleanup()
60 struct inoinfo **inpsort; /* disk order list of directory inodes */ variable175 inpsort = (struct inoinfo **)Calloc(listmax, sizeof(struct inoinfo *)); in setup()177 if (inpsort == NULL || inphash == NULL) { in setup()
70 inp = inpsort[inpindex]; in pass3()
79 inpend = &inpsort[inplast]; in propagate()82 for (inpp = inpsort; inpp < inpend; inpp++) { in propagate()
313 extern struct inoinfo **inpsort;