2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2001-2002 Chris D. Faulhaber
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <sys/cdefs.h>
30 __FBSDID("$FreeBSD$");
32 #include <sys/types.h>
33 #include "namespace.h"
35 #include "un-namespace.h"
40 #include "acl_support.h"
43 _entry_matches(const acl_entry_t a, const acl_entry_t b)
46 * There is a semantical difference here between NFSv4 and POSIX
47 * draft ACLs. In POSIX, there may be only one entry for the particular
48 * user or group. In NFSv4 ACL, there may be any number of them. We're
49 * trying to be more specific here in that case.
51 switch (_entry_brand(a)) {
53 if (a->ae_tag != b->ae_tag || a->ae_entry_type != b->ae_entry_type)
56 /* If ae_ids matter, compare them as well. */
57 if (a->ae_tag == ACL_USER || a->ae_tag == ACL_GROUP) {
58 if (a->ae_id != b->ae_id)
65 if ((a->ae_tag == b->ae_tag) && (a->ae_id == b->ae_id))
73 * acl_delete_entry() (23.4.9): remove the ACL entry indicated by entry_d
77 acl_delete_entry(acl_t acl, acl_entry_t entry_d)
80 struct acl_entry entry_int;
83 if (acl == NULL || entry_d == NULL) {
88 acl_int = &acl->ats_acl;
90 if (_entry_brand(entry_d) != _acl_brand(acl)) {
95 if ((acl->ats_acl.acl_cnt < 1) ||
96 (acl->ats_acl.acl_cnt > ACL_MAX_ENTRIES)) {
101 /* Use a local copy to prevent deletion of more than this entry */
102 entry_int = *entry_d;
104 for (i = 0; i < acl->ats_acl.acl_cnt;) {
105 if (_entry_matches(&(acl->ats_acl.acl_entry[i]), &entry_int)) {
106 /* ...shift the remaining entries... */
107 for (j = i; j < acl->ats_acl.acl_cnt - 1; ++j)
108 acl->ats_acl.acl_entry[j] =
109 acl->ats_acl.acl_entry[j+1];
110 /* ...drop the count and zero the unused entry... */
111 acl->ats_acl.acl_cnt--;
112 bzero(&acl->ats_acl.acl_entry[j],
113 sizeof(struct acl_entry));
114 acl->ats_cur_entry = 0;
116 /* Continue with the loop to remove all matching entries. */
130 acl_delete_entry_np(acl_t acl, int offset)
140 acl_int = &acl->ats_acl;
142 if (offset < 0 || offset >= acl_int->acl_cnt) {
147 if ((acl->ats_acl.acl_cnt < 1) ||
148 (acl->ats_acl.acl_cnt > ACL_MAX_ENTRIES)) {
153 /* ...shift the remaining entries... */
154 for (i = offset; i < acl->ats_acl.acl_cnt - 1; ++i)
155 acl->ats_acl.acl_entry[i] =
156 acl->ats_acl.acl_entry[i+1];
157 /* ...drop the count and zero the unused entry... */
158 acl->ats_acl.acl_cnt--;
159 bzero(&acl->ats_acl.acl_entry[i],
160 sizeof(struct acl_entry));
161 acl->ats_cur_entry = 0;