2 * Copyright (c) 2001-2002 Chris D. Faulhaber
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
30 #include <sys/types.h>
31 #include "namespace.h"
33 #include "un-namespace.h"
39 * acl_create_entry() (23.4.7): create a new ACL entry in the ACL pointed
43 acl_create_entry(acl_t *acl_p, acl_entry_t *entry_p)
52 acl_int = &(*acl_p)->ats_acl;
55 * +1, because we are checking if there is space left for one more
58 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) {
63 *entry_p = &acl_int->acl_entry[acl_int->acl_cnt++];
65 (**entry_p).ae_tag = ACL_UNDEFINED_TAG;
66 (**entry_p).ae_id = ACL_UNDEFINED_ID;
67 (**entry_p).ae_perm = ACL_PERM_NONE;
68 (**entry_p).ae_entry_type = 0;
69 (**entry_p).ae_flags = 0;
71 (*acl_p)->ats_cur_entry = 0;
77 acl_create_entry_np(acl_t *acl_p, acl_entry_t *entry_p, int offset)
87 acl_int = &(*acl_p)->ats_acl;
89 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) {
94 if (offset < 0 || offset >= acl_int->acl_cnt) {
99 /* Make room for the new entry. */
100 for (i = acl_int->acl_cnt; i > offset; i--)
101 acl_int->acl_entry[i] = acl_int->acl_entry[i - 1];
105 *entry_p = &acl_int->acl_entry[offset];
107 (**entry_p).ae_tag = ACL_UNDEFINED_TAG;
108 (**entry_p).ae_id = ACL_UNDEFINED_ID;
109 (**entry_p).ae_perm = ACL_PERM_NONE;
110 (**entry_p).ae_entry_type = 0;
111 (**entry_p).ae_flags= 0;
113 (*acl_p)->ats_cur_entry = 0;
119 * acl_get_entry() (23.4.14): returns an ACL entry from an ACL
120 * indicated by entry_id.
123 acl_get_entry(acl_t acl, int entry_id, acl_entry_t *entry_p)
131 acl_int = &acl->ats_acl;
134 case ACL_FIRST_ENTRY:
135 acl->ats_cur_entry = 0;
138 if (acl->ats_cur_entry >= acl->ats_acl.acl_cnt)
140 *entry_p = &acl_int->acl_entry[acl->ats_cur_entry++];