| acl_delete_entry.c (75928) | acl_delete_entry.c (90781) |
|---|---|
| 1/* | 1/* |
| 2 * Copyright (c) 2001 Chris D. Faulhaber | 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 --- 7 unchanged lines hidden (view full) --- 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 * | 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 --- 7 unchanged lines hidden (view full) --- 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: head/lib/libc/posix1e/acl_delete_entry.c 75928 2001-04-24 22:45:41Z jedgar $ | 26 * $FreeBSD: head/lib/libc/posix1e/acl_delete_entry.c 90781 2002-02-17 20:05:20Z jedgar $ |
| 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 */ 40int 41acl_delete_entry(acl_t acl, acl_entry_t entry_d) 42{ 43 struct acl *acl_int; 44 int i; 45 | 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 */ 40int 41acl_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) { | 46 if (acl == NULL || entry_d == NULL) { |
| 47 errno = EINVAL; | 47 errno = EINVAL; |
| 48 return -1; | 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; | 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; | 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; | 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; | 71 return (0); |
| 72 } 73 } 74 75 76 errno = EINVAL; | 72 } 73 } 74 75 76 errno = EINVAL; |
| 77 return -1; | 77 return (-1); |
| 78} | 78} |