1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD 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/cdefs.h> 30 #if 0 31 __FBSDID("$FreeBSD: head/lib/libc/posix1e/acl_entry.c 326193 2017-11-25 17:12:48Z pfg $"); 32 #else 33 __RCSID("$NetBSD: acl_entry.c,v 1.1 2020/05/16 18:31:47 christos Exp $"); 34 #endif 35 36 #include "namespace.h" 37 #include <sys/types.h> 38 #include <sys/acl.h> 39 40 #include <errno.h> 41 #include <stdlib.h> 42 43 /* 44 * acl_create_entry() (23.4.7): create a new ACL entry in the ACL pointed 45 * to by acl_p. 46 */ 47 int 48 acl_create_entry(acl_t *acl_p, acl_entry_t *entry_p) 49 { 50 struct acl *acl_int; 51 52 if (acl_p == NULL) { 53 errno = EINVAL; 54 return (-1); 55 } 56 57 acl_int = &(*acl_p)->ats_acl; 58 59 /* 60 * +1, because we are checking if there is space left for one more 61 * entry. 62 */ 63 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) { 64 errno = EINVAL; 65 return (-1); 66 } 67 68 *entry_p = &acl_int->acl_entry[acl_int->acl_cnt++]; 69 70 (**entry_p).ae_tag = ACL_UNDEFINED_TAG; 71 (**entry_p).ae_id = ACL_UNDEFINED_ID; 72 (**entry_p).ae_perm = ACL_PERM_NONE; 73 (**entry_p).ae_entry_type = 0; 74 (**entry_p).ae_flags = 0; 75 76 (*acl_p)->ats_cur_entry = 0; 77 78 return (0); 79 } 80 81 int 82 acl_create_entry_np(acl_t *acl_p, acl_entry_t *entry_p, int offset) 83 { 84 int i; 85 struct acl *acl_int; 86 87 if (acl_p == NULL) { 88 errno = EINVAL; 89 return (-1); 90 } 91 92 acl_int = &(*acl_p)->ats_acl; 93 94 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) { 95 errno = EINVAL; 96 return (-1); 97 } 98 99 if (offset < 0 || (size_t)offset > acl_int->acl_cnt) { 100 errno = EINVAL; 101 return (-1); 102 } 103 104 /* Make room for the new entry. */ 105 for (i = acl_int->acl_cnt; i > offset; i--) 106 acl_int->acl_entry[i] = acl_int->acl_entry[i - 1]; 107 108 acl_int->acl_cnt++; 109 110 *entry_p = &acl_int->acl_entry[offset]; 111 112 (**entry_p).ae_tag = ACL_UNDEFINED_TAG; 113 (**entry_p).ae_id = ACL_UNDEFINED_ID; 114 (**entry_p).ae_perm = ACL_PERM_NONE; 115 (**entry_p).ae_entry_type = 0; 116 (**entry_p).ae_flags= 0; 117 118 (*acl_p)->ats_cur_entry = 0; 119 120 return (0); 121 } 122 123 /* 124 * acl_get_entry() (23.4.14): returns an ACL entry from an ACL 125 * indicated by entry_id. 126 */ 127 int 128 acl_get_entry(acl_t acl, int entry_id, acl_entry_t *entry_p) 129 { 130 struct acl *acl_int; 131 132 if (acl == NULL) { 133 errno = EINVAL; 134 return (-1); 135 } 136 acl_int = &acl->ats_acl; 137 138 switch(entry_id) { 139 case ACL_FIRST_ENTRY: 140 acl->ats_cur_entry = 0; 141 /* FALLTHROUGH */ 142 case ACL_NEXT_ENTRY: 143 if (acl->ats_cur_entry >= acl->ats_acl.acl_cnt) 144 return 0; 145 *entry_p = &acl_int->acl_entry[acl->ats_cur_entry++]; 146 return (1); 147 } 148 149 errno = EINVAL; 150 return (-1); 151 } 152