* Copyright (c) 1991 The Regents of the University of California.
* %sccs.include.redist.c%
* @(#)misc.c 5.2 (Berkeley) %G%
char *name
; /* key name */
/* NB: the following table must be sorted lexically. */
"cksum", F_CKSUM
, NEEDVALUE
,
"gname", F_GNAME
, NEEDVALUE
,
"link", F_SLINK
, NEEDVALUE
,
"mode", F_MODE
, NEEDVALUE
,
"nlink", F_NLINK
, NEEDVALUE
,
"size", F_SIZE
, NEEDVALUE
,
"time", F_TIME
, NEEDVALUE
,
"type", F_TYPE
, NEEDVALUE
,
"uname", F_UNAME
, NEEDVALUE
,
parsekey(name
, needvaluep
)
int keycompare
__P((const void *, const void *));
k
= (KEY
*)bsearch(&tmp
, keylist
, sizeof(keylist
) / sizeof(KEY
),
sizeof(KEY
), keycompare
);
err("unknown keyword %s", name
);
*needvaluep
= k
->flags
& NEEDVALUE
? 1 : 0;
return (strcmp(((KEY
*)a
)->name
, ((KEY
*)b
)->name
));
err(const char *fmt
, ...)
(void)fprintf(stderr
, "mtree: ");
(void)vfprintf(stderr
, fmt
, ap
);
(void)fprintf(stderr
, "\n");
"mtree: failed at line %d of the specification\n", lineno
);