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"
41 * acl_create_entry() (23.4.7): create a new ACL entry in the ACL pointed
45 acl_create_entry(acl_t *acl_p, acl_entry_t *entry_p)
54 acl_int = &(*acl_p)->ats_acl;
57 * +1, because we are checking if there is space left for one more
60 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) {
65 *entry_p = &acl_int->acl_entry[acl_int->acl_cnt++];
67 (**entry_p).ae_tag = ACL_UNDEFINED_TAG;
68 (**entry_p).ae_id = ACL_UNDEFINED_ID;
69 (**entry_p).ae_perm = ACL_PERM_NONE;
70 (**entry_p).ae_entry_type = 0;
71 (**entry_p).ae_flags = 0;
73 (*acl_p)->ats_cur_entry = 0;
79 acl_create_entry_np(acl_t *acl_p, acl_entry_t *entry_p, int offset)
89 acl_int = &(*acl_p)->ats_acl;
91 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) {
96 if (offset < 0 || offset > acl_int->acl_cnt) {
101 /* Make room for the new entry. */
102 for (i = acl_int->acl_cnt; i > offset; i--)
103 acl_int->acl_entry[i] = acl_int->acl_entry[i - 1];
107 *entry_p = &acl_int->acl_entry[offset];
109 (**entry_p).ae_tag = ACL_UNDEFINED_TAG;
110 (**entry_p).ae_id = ACL_UNDEFINED_ID;
111 (**entry_p).ae_perm = ACL_PERM_NONE;
112 (**entry_p).ae_entry_type = 0;
113 (**entry_p).ae_flags= 0;
115 (*acl_p)->ats_cur_entry = 0;
121 * acl_get_entry() (23.4.14): returns an ACL entry from an ACL
122 * indicated by entry_id.
125 acl_get_entry(acl_t acl, int entry_id, acl_entry_t *entry_p)
133 acl_int = &acl->ats_acl;
136 case ACL_FIRST_ENTRY:
137 acl->ats_cur_entry = 0;
140 if (acl->ats_cur_entry >= acl->ats_acl.acl_cnt)
142 *entry_p = &acl_int->acl_entry[acl->ats_cur_entry++];