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