acl_delete_entry.c revision 124176 
1/*
2 * Copyright (c) 2001-2002 Chris D. Faulhaber
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 */
26
27#include <sys/cdefs.h>
28__FBSDID("$FreeBSD: head/lib/libc/posix1e/acl_delete_entry.c 124176 2004-01-06 18:43:31Z nectar $");
29
30#include <sys/types.h>
31#include "namespace.h"
32#include <sys/acl.h>
33#include "un-namespace.h"
34#include <errno.h>
35#include <string.h>
36
37/*
38 * acl_delete_entry() (23.4.9): remove the ACL entry indicated by entry_d
39 * from acl.
40 */
41int
42acl_delete_entry(acl_t acl, acl_entry_t entry_d)
43{
44	struct acl *acl_int;
45	int i;
46
47	if (acl == NULL || entry_d == NULL) {
48		errno = EINVAL;
49		return (-1);
50	}
51
52	acl_int = &acl->ats_acl;
53
54	if ((acl->ats_acl.acl_cnt < 1) ||
55	    (acl->ats_acl.acl_cnt > ACL_MAX_ENTRIES)) {
56		errno = EINVAL;
57		return (-1);
58	}
59	for (i = 0; i < acl->ats_acl.acl_cnt; i++) {
60		/* if this is our entry... */
61		if ((acl->ats_acl.acl_entry[i].ae_tag == entry_d->ae_tag) &&
62		    (acl->ats_acl.acl_entry[i].ae_id == entry_d->ae_id)) {
63			/* ...shift the remaining entries... */
64			for (; i < acl->ats_acl.acl_cnt - 1; ++i)
65				acl->ats_acl.acl_entry[i] =
66				    acl->ats_acl.acl_entry[i];
67			/* ...drop the count and zero the unused entry... */
68			acl->ats_acl.acl_cnt--;
69			bzero(&acl->ats_acl.acl_entry[i],
70			    sizeof(struct acl_entry));
71			acl->ats_cur_entry = 0;
72			return (0);
73		}
74	}
75
76
77	errno = EINVAL;
78	return (-1);
79}
80