Home
last modified time | relevance | path

Searched refs:inpsort (Results 1 – 6 of 6) sorted by relevance

/freebsd-12-stable/sbin/fsck_ffs/
Dpass2.c134 qsort((char *)inpsort, (size_t)inplast, sizeof *inpsort, blksort); in pass2()
141 inpend = &inpsort[inplast]; in pass2()
142 for (inpp = inpsort; inpp < inpend; inpp++) { in pass2()
145 inpp - inpsort, (int)inplast, in pass2()
146 (int)((inpp - inpsort) * 100 / inplast)); in pass2()
151 (int)((inpp - inpsort) * 100 / inplast)); in pass2()
203 for (inpp = inpsort; inpp < inpend; inpp++) { in pass2()
Dinode.c484 inpsort = (struct inoinfo **)reallocarray((char *)inpsort, in cacheino()
486 if (inpsort == NULL) in cacheino()
489 inpsort[inplast++] = inp; in cacheino()
519 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) in inocleanup()
522 free((char *)inpsort); in inocleanup()
523 inphead = inpsort = NULL; in inocleanup()
Dsetup.c61 struct inoinfo **inphead, **inpsort; variable
297 inpsort = (struct inoinfo **)Calloc(listmax, sizeof(struct inoinfo *)); in setup()
299 if (inpsort == NULL || inphead == NULL) { in setup()
Dpass3.c71 inp = inpsort[inpindex]; in pass3()
Ddir.c82 inpend = &inpsort[inplast]; in propagate()
85 for (inpp = inpsort; inpp < inpend; inpp++) { in propagate()
Dfsck.h288 } **inphead, **inpsort; variable