1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2001-2002 Chris D. Faulhaber 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 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. 15 * 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 26 * SUCH DAMAGE. 27 */ 28 29 #include <sys/types.h> 30 #include "namespace.h" 31 #include <sys/acl.h> 32 #include "un-namespace.h" 33 34 #include <errno.h> 35 #include <stdlib.h> 36 37 /* 38 * acl_create_entry() (23.4.7): create a new ACL entry in the ACL pointed 39 * to by acl_p. 40 */ 41 int 42 acl_create_entry(acl_t *acl_p, acl_entry_t *entry_p) 43 { 44 struct acl *acl_int; 45 46 if (acl_p == NULL) { 47 errno = EINVAL; 48 return (-1); 49 } 50 51 acl_int = &(*acl_p)->ats_acl; 52 53 /* 54 * +1, because we are checking if there is space left for one more 55 * entry. 56 */ 57 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) { 58 errno = EINVAL; 59 return (-1); 60 } 61 62 *entry_p = &acl_int->acl_entry[acl_int->acl_cnt++]; 63 64 (**entry_p).ae_tag = ACL_UNDEFINED_TAG; 65 (**entry_p).ae_id = ACL_UNDEFINED_ID; 66 (**entry_p).ae_perm = ACL_PERM_NONE; 67 (**entry_p).ae_entry_type = 0; 68 (**entry_p).ae_flags = 0; 69 70 (*acl_p)->ats_cur_entry = 0; 71 72 return (0); 73 } 74 75 int 76 acl_create_entry_np(acl_t *acl_p, acl_entry_t *entry_p, int offset) 77 { 78 int i; 79 struct acl *acl_int; 80 81 if (acl_p == NULL) { 82 errno = EINVAL; 83 return (-1); 84 } 85 86 acl_int = &(*acl_p)->ats_acl; 87 88 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) { 89 errno = EINVAL; 90 return (-1); 91 } 92 93 if (offset < 0 || offset > acl_int->acl_cnt) { 94 errno = EINVAL; 95 return (-1); 96 } 97 98 /* Make room for the new entry. */ 99 for (i = acl_int->acl_cnt; i > offset; i--) 100 acl_int->acl_entry[i] = acl_int->acl_entry[i - 1]; 101 102 acl_int->acl_cnt++; 103 104 *entry_p = &acl_int->acl_entry[offset]; 105 106 (**entry_p).ae_tag = ACL_UNDEFINED_TAG; 107 (**entry_p).ae_id = ACL_UNDEFINED_ID; 108 (**entry_p).ae_perm = ACL_PERM_NONE; 109 (**entry_p).ae_entry_type = 0; 110 (**entry_p).ae_flags= 0; 111 112 (*acl_p)->ats_cur_entry = 0; 113 114 return (0); 115 } 116 117 /* 118 * acl_get_entry() (23.4.14): returns an ACL entry from an ACL 119 * indicated by entry_id. 120 */ 121 int 122 acl_get_entry(acl_t acl, int entry_id, acl_entry_t *entry_p) 123 { 124 struct acl *acl_int; 125 126 if (acl == NULL) { 127 errno = EINVAL; 128 return (-1); 129 } 130 acl_int = &acl->ats_acl; 131 132 switch(entry_id) { 133 case ACL_FIRST_ENTRY: 134 acl->ats_cur_entry = 0; 135 /* PASSTHROUGH */ 136 case ACL_NEXT_ENTRY: 137 if (acl->ats_cur_entry >= acl->ats_acl.acl_cnt) 138 return 0; 139 *entry_p = &acl_int->acl_entry[acl->ats_cur_entry++]; 140 return (1); 141 } 142 143 errno = EINVAL; 144 return (-1); 145 } 146