258 lines
5.8 KiB
C
Executable File
258 lines
5.8 KiB
C
Executable File
#ifndef lint
|
|
static char sccsid[] = "@(#)aclcheck.c 1.4 94/07/13 SMI";
|
|
#endif
|
|
/*
|
|
* Copyright (c) 1993, 1994 by Sun Microsystems, Inc.
|
|
*/
|
|
|
|
|
|
/*
|
|
* aclcheck(): check validity of an ACL
|
|
* A valid ACL is defined as follows:
|
|
* There must be exactly one USER_OBJ, GROUP_OBJ, and OTHER_OBJ entry.
|
|
* If there are any USER entries, then the user id must be unique.
|
|
* If there are any GROUP entries, then the group id must be unique.
|
|
* If there are any GROUP or USER entries, there must be exactly one
|
|
* CLASS_OBJ entry.
|
|
* The same rules apply to default ACL entries.
|
|
*/
|
|
|
|
#include <errno.h>
|
|
#include <stdlib.h>
|
|
#include <sys/acl.h>
|
|
|
|
struct entry {
|
|
int count;
|
|
uid_t *id;
|
|
};
|
|
|
|
struct entry_stat {
|
|
struct entry user_obj;
|
|
struct entry user;
|
|
struct entry group_obj;
|
|
struct entry group;
|
|
struct entry other_obj;
|
|
struct entry class_obj;
|
|
struct entry def_user_obj;
|
|
struct entry def_user;
|
|
struct entry def_group_obj;
|
|
struct entry def_group;
|
|
struct entry def_other_obj;
|
|
struct entry def_class_obj;
|
|
};
|
|
|
|
static void free_mem(struct entry_stat *);
|
|
static int check_dup(int, uid_t *, uid_t, struct entry_stat *);
|
|
|
|
int
|
|
aclcheck(aclent_t *aclbufp, int nentries, int *which)
|
|
{
|
|
struct entry_stat tally;
|
|
aclent_t *aclentp;
|
|
uid_t **idp;
|
|
int cnt;
|
|
|
|
*which = -1;
|
|
memset(&tally, '\0', sizeof (tally));
|
|
|
|
for (aclentp = aclbufp; nentries-- > 0; aclentp++) {
|
|
switch (aclentp->a_type) {
|
|
case USER_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.user_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (USER_ERROR);
|
|
}
|
|
tally.user_obj.count = 1;
|
|
break;
|
|
|
|
case GROUP_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.group_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (GRP_ERROR);
|
|
}
|
|
tally.group_obj.count = 1;
|
|
break;
|
|
|
|
case OTHER_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.other_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (OTHER_ERROR);
|
|
}
|
|
tally.other_obj.count = 1;
|
|
break;
|
|
|
|
case CLASS_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.class_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (CLASS_ERROR);
|
|
}
|
|
tally.class_obj.count = 1;
|
|
break;
|
|
|
|
case USER:
|
|
case GROUP:
|
|
case DEF_USER:
|
|
case DEF_GROUP:
|
|
/* check duplicate */
|
|
if (aclentp->a_type == DEF_USER) {
|
|
cnt = (tally.def_user.count)++;
|
|
idp = &(tally.def_user.id);
|
|
} else if (aclentp->a_type == DEF_GROUP) {
|
|
cnt = (tally.def_group.count)++;
|
|
idp = &(tally.def_group.id);
|
|
} else if (aclentp->a_type == USER) {
|
|
cnt = (tally.user.count)++;
|
|
idp = &(tally.user.id);
|
|
} else {
|
|
cnt = (tally.group.count)++;
|
|
idp = &(tally.group.id);
|
|
}
|
|
|
|
if (cnt == 0) {
|
|
*idp = (uid_t *) calloc(sizeof (uid_t),
|
|
nentries);
|
|
if (*idp == NULL)
|
|
return (MEM_ERROR);
|
|
} else {
|
|
if (check_dup(cnt, *idp, aclentp->a_id,
|
|
&tally) == -1) {
|
|
*which = aclentp - aclbufp;
|
|
return (DUPLICATE_ERROR);
|
|
}
|
|
}
|
|
(*idp)[cnt] = aclentp->a_id;
|
|
break;
|
|
|
|
case DEF_USER_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.def_user_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (USER_ERROR);
|
|
}
|
|
tally.def_user_obj.count = 1;
|
|
break;
|
|
|
|
case DEF_GROUP_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.def_group_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (GRP_ERROR);
|
|
}
|
|
tally.def_group_obj.count = 1;
|
|
break;
|
|
|
|
case DEF_OTHER_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.def_other_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (OTHER_ERROR);
|
|
}
|
|
tally.def_other_obj.count = 1;
|
|
break;
|
|
|
|
case DEF_CLASS_OBJ:
|
|
/* check uniqueness */
|
|
if (tally.def_class_obj.count > 0) {
|
|
*which = aclentp - aclbufp;
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (CLASS_ERROR);
|
|
}
|
|
tally.def_class_obj.count = 1;
|
|
break;
|
|
|
|
default:
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
*which = aclentp - aclbufp;
|
|
return (ENTRY_ERROR);
|
|
}
|
|
}
|
|
/* If there are group or user entries, there must be one class entry */
|
|
if (tally.user.count > 0 || tally.group.count > 0)
|
|
if (tally.class_obj.count != 1) {
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (MISS_ERROR);
|
|
}
|
|
/* same is true for default entries */
|
|
if (tally.def_user.count > 0 || tally.def_group.count > 0)
|
|
if (tally.def_class_obj.count != 1) {
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (MISS_ERROR);
|
|
}
|
|
|
|
/* there must be exactly one user_obj, group_obj, and other_obj entry */
|
|
if (tally.user_obj.count != 1 ||
|
|
tally.group_obj.count != 1 ||
|
|
tally.other_obj.count != 1) {
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (MISS_ERROR);
|
|
}
|
|
|
|
/* has default? same rules apply to default entries */
|
|
if (tally.def_user.count > 0 ||
|
|
tally.def_user_obj.count > 0 ||
|
|
tally.def_group.count > 0 ||
|
|
tally.def_group_obj.count > 0 ||
|
|
tally.def_class_obj.count > 0 ||
|
|
tally.def_other_obj.count > 0)
|
|
if (tally.def_user_obj.count != 1 ||
|
|
tally.def_group_obj.count != 1 ||
|
|
tally.def_other_obj.count != 1) {
|
|
(void) free_mem(&tally);
|
|
errno = EINVAL;
|
|
return (MISS_ERROR);
|
|
}
|
|
(void) free_mem(&tally);
|
|
return (0);
|
|
}
|
|
|
|
static void
|
|
free_mem(struct entry_stat *tallyp)
|
|
{
|
|
if ((tallyp->user).count > 0)
|
|
free((tallyp->user).id);
|
|
if ((tallyp->group).count > 0)
|
|
free((tallyp->group).id);
|
|
if ((tallyp->def_user).count > 0)
|
|
free((tallyp->def_user).id);
|
|
if ((tallyp->def_group).count > 0)
|
|
free((tallyp->def_group).id);
|
|
}
|
|
|
|
static int
|
|
check_dup(int count, uid_t *ids, uid_t newid, struct entry_stat *tallyp)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < count; i++) {
|
|
if (ids[i] == newid) {
|
|
errno = EINVAL;
|
|
(void) free_mem(tallyp);
|
|
return (-1);
|
|
}
|
|
}
|
|
return (0);
|
|
}
|