95 static void	sortsize(struct data *f, struct data **sf, unsigned int eptnum);
102 	struct data	*f, **sf;  in splpkgmap()  local
118 	sf = (struct data **)calloc(eptnum, sizeof (struct data *));  in splpkgmap()
119 	if (sf == NULL) {  in splpkgmap()
257 	sortsize(f, sf, eptnum);  in splpkgmap()
262 	newvolume(sf, eptnum, *plimit, *pilimit);  in splpkgmap()
334 			while (store(sf, eptnum, order[i], *plimit, *pilimit))  in splpkgmap()
340 	while (store(sf, eptnum, (char *)0, *plimit, *pilimit))  in splpkgmap()
366 		newvolume(sf, eptnum, *plimit, *pilimit);  in splpkgmap()
391 	free(sf);  in splpkgmap()
403 store(struct data **sf, unsigned int eptnum, char *aclass, fsblkcnt_t limit,  in store()  argument
414 		if (sf[i]->ept->volno || strchr("sldxcbp", sf[i]->ept->ftype))  in store()
416 		if (aclass && strcmp(aclass, sf[i]->ept->pkg_class))  in store()
419 		ftemp = nodecount(sf[i]->ept->path);  in store()
420 		btemp = sf[i]->blks + (ftemp * DIRSIZE);  in store()
433 		newvolume(sf, eptnum, limit, ilimit);  in store()
434 		return (store(sf, eptnum, aclass, limit, ilimit));  in store()
436 	sf[choice]->ept->volno = (char)volno;  in store()
438 	btotal += sf[choice]->blks + (svnodes * DIRSIZE);  in store()
439 	allocnode(sf[i]->ept->path);  in store()
440 	addclass(sf[choice]->ept->pkg_class, volno);  in store()
537 newvolume(struct data **sf, unsigned int eptnum, fsblkcnt_t limit,  in newvolume()  argument
568 		if (sf[i]->ept->volno == volno) {  in newvolume()
569 			newnodes = nodecount(sf[i]->ept->path);  in newvolume()
571 			btotal += sf[i]->blks + (newnodes * DIRSIZE);  in newvolume()
615 sortsize(struct data *f, struct data **sf, unsigned int eptnum)  in sortsize()  argument
624 			if (f[i].blks > sf[j]->blks) {  in sortsize()
626 					sf[k] = sf[k-1];  in sortsize()
631 		sf[j] = &f[i];  in sortsize()