inoinfo
struct inoinfo **inpp, *inp, *pinp;
struct inoinfo **inpend;
struct inoinfo *i_nexthash; /* next entry in hash chain */
struct inoinfo *i_child, *i_sibling, *i_parentp;
struct inoinfo *getinoinfo(ino_t);
struct inoinfo *inp;
struct inoinfo **inpp;
sizeof(struct inoinfo *));
struct inoinfo *
struct inoinfo *inp;
struct inoinfo **inpp;
struct inoinfo **inphead, **inpsort;
struct inoinfo *inp;
return ((* (struct inoinfo **) inpp1)->i_blks[0] -
(* (struct inoinfo **) inpp2)->i_blks[0]);
struct inoinfo **inpp, *inp;
struct inoinfo **inpend;
struct inoinfo **inpp, *inp;
inpsort = calloc((unsigned)listmax, sizeof(struct inoinfo *));
inphead = calloc((unsigned)numdirs, sizeof(struct inoinfo *));
(unsigned)(numdirs * sizeof(struct inoinfo *)));
struct inoinfo *inp;
struct inoinfo *inp;
struct inostat *inoinfo(ino_t);
struct inoinfo *i_nexthash; /* next entry in hash chain */
struct inoinfo *i_child, *i_sibling;
struct inoinfo *getinoinfo(ino_t);
#define GET_ISTATE(ino) (inoinfo(ino)->ino_state)
#define GET_ITYPE(ino) (inoinfo(ino)->ino_type)
#define ILNCOUNT(ino) (inoinfo(ino)->ino_linkcnt)
struct inoinfo *inp;
struct inoinfo **inpp, **newinpsort;
(unsigned)newlistmax, sizeof(struct inoinfo *));
struct inoinfo *
struct inoinfo *inp;
struct inoinfo **inpp;
info = inoinfo(ino);
struct inoinfo **inphead, **inpsort;
struct inoinfo *inp;
d = (* (struct inoinfo **) inpp1)->i_blks[0] -
(* (struct inoinfo **) inpp2)->i_blks[0];
struct inoinfo **inpp, *inp, *pinp;
struct inoinfo **inpend;
struct inoinfo **inpp, *inp, *pinp;
inpsort = calloc((unsigned)listmax, sizeof(struct inoinfo *));
(unsigned)listmax * sizeof(struct inoinfo *));
inphead = calloc((unsigned)numdirs, sizeof(struct inoinfo *));
(unsigned)numdirs * sizeof(struct inoinfo *));
struct inoinfo **inphead, **inpsort;
struct inoinfo *i_nexthash; /* next entry in hash chain */
struct inoinfo *i_child, *i_sibling, *i_parentp;
allocate += (MAXIMUM(ndir, 128) + 10) * sizeof(struct inoinfo);
allocate += MAXIMUM(ndir, 128) * sizeof(struct inoinfo);