1 /* 2 * Copyright (c) 2001 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 * $FreeBSD$ 27 */ 28 29 #include <sys/types.h> 30 #include "namespace.h" 31 #include <sys/acl.h> 32 #include "un-namespace.h" 33 #include <errno.h> 34 #include <string.h> 35 36 /* 37 * acl_delete_entry() (23.4.9): remove the ACL entry indicated by entry_d 38 * from acl. 39 */ 40 int 41 acl_delete_entry(acl_t acl, acl_entry_t entry_d) 42 { 43 struct acl *acl_int; 44 int i; 45 46 if (!acl || !entry_d) { 47 errno = EINVAL; 48 return -1; 49 } 50 51 acl_int = &acl->ats_acl; 52 53 if ((acl->ats_acl.acl_cnt < 1) || 54 (acl->ats_acl.acl_cnt > ACL_MAX_ENTRIES)) { 55 errno = EINVAL; 56 return -1; 57 } 58 for (i = 0; i < acl->ats_acl.acl_cnt; i++) { 59 /* if this is our entry... */ 60 if ((acl->ats_acl.acl_entry[i].ae_tag == entry_d->ae_tag) && 61 (acl->ats_acl.acl_entry[i].ae_id == entry_d->ae_id)) { 62 /* ...shift the remaining entries... */ 63 while (i < acl->ats_acl.acl_cnt - 1) 64 acl->ats_acl.acl_entry[i] = 65 acl->ats_acl.acl_entry[++i]; 66 /* ...drop the count and zero the unused entry... */ 67 acl->ats_acl.acl_cnt--; 68 bzero(&acl->ats_acl.acl_entry[i], 69 sizeof(struct acl_entry)); 70 acl->ats_cur_entry = 0; 71 return 0; 72 } 73 } 74 75 76 errno = EINVAL; 77 return -1; 78 } 79