splpkgmap.c revision 5c51f1241dbbdf2656d0e10011981411ed0c9673
0N/A * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
0N/A * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
0N/A#include <pkgstrct.h>
struct data {
struct class_type {
char *name;
int first;
int last;
static char **dirlist;
static int nclass;
int new_vol_set;
short new_vol;
if (f == NULL) {
nclass = 0;
errflg = 0;
total = 0;
for (i = 0; i < eptnum; i++) {
total +=
total +=
if (*pllimit != 0) {
for (i = 0; i < eptnum; i++) {
f[i].blks = 0;
for (j = 0; j < eptnum; j++) {
errflg++;
errflg++;
if (errflg)
ftotal++;
flag = 0;
for (j = 0; j < eptnum; ++j) {
else if (!flag++) {
ftotal++;
ftotal++;
errflg++;
if (errflg)
for (j = 0; j < eptnum; ++j) {
errflg++;
if (errflg)
if (order) {
for (i = 0; order[i]; ++i) {
for (i = 0; i < nclass; ++i) {
for (j = 0; j < eptnum; j++) {
if (btotal)
new_vol_set = 0;
for (j = 0; j < eptnum; j++) {
free(f);
for (i = 0; i < nclass; ++i)
for (i = 0; dirlist[i]; i++)
long ftemp;
select = 0;
for (i = 0; i < eptnum; ++i) {
choice = i;
if (!select)
if (choice < 0) {
int found;
char *pt;
if (dirlist) {
for (i = 0; dirlist[i]; i++)
pt++;
found = 0;
found++;
if (!found) {
if ((++i % MALSIZ) == 0) {
(i+MALSIZ) * sizeof (char *));
char *pt;
pt++;
count = 0;
found = 0;
for (i = 0; dirlist[i]; i++) {
found++;
if (!found)
count++;
return (count);
int newnodes;
if (volno) {
volno++;
allocnode((char *)0);
for (i = 0; i < eptnum; i++) {
limit);
ilimit);
for (i = 0; i < nclass; ++i) {
if (vol <= 0)
if (!cl) {
int nsf;
nsf = 0;
for (i = 0; i < eptnum; i++) {
for (j = 0; j < nsf; ++j) {
for (k = nsf; k > j; k--) {
sf[j] = &f[i];
nsf++;