Deleted Added
full compact
acl_entry.c (75928) acl_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_entry.c 75928 2001-04-24 22:45:41Z jedgar $
26 * $FreeBSD: head/lib/libc/posix1e/acl_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
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 */
41int
42acl_create_entry(acl_t *acl_p, acl_entry_t *entry_p)
43{
44 struct acl *acl_int;
45
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 */
41int
42acl_create_entry(acl_t *acl_p, acl_entry_t *entry_p)
43{
44 struct acl *acl_int;
45
46 if (!acl_p) {
46 if (acl_p == NULL) {
47 errno = EINVAL;
47 errno = EINVAL;
48 return -1;
48 return (-1);
49 }
50
51 acl_int = &(*acl_p)->ats_acl;
52
53 if ((acl_int->acl_cnt >= ACL_MAX_ENTRIES) || (acl_int->acl_cnt < 0)) {
54 errno = EINVAL;
49 }
50
51 acl_int = &(*acl_p)->ats_acl;
52
53 if ((acl_int->acl_cnt >= ACL_MAX_ENTRIES) || (acl_int->acl_cnt < 0)) {
54 errno = EINVAL;
55 return -1;
55 return (-1);
56 }
57
58 *entry_p = &acl_int->acl_entry[acl_int->acl_cnt++];
59
60 (**entry_p).ae_tag = ACL_UNDEFINED_TAG;
61 (**entry_p).ae_id = ACL_UNDEFINED_ID;
62 (**entry_p).ae_perm = ACL_PERM_NONE;
63
64 (*acl_p)->ats_cur_entry = 0;
65
56 }
57
58 *entry_p = &acl_int->acl_entry[acl_int->acl_cnt++];
59
60 (**entry_p).ae_tag = ACL_UNDEFINED_TAG;
61 (**entry_p).ae_id = ACL_UNDEFINED_ID;
62 (**entry_p).ae_perm = ACL_PERM_NONE;
63
64 (*acl_p)->ats_cur_entry = 0;
65
66 return 0;
66 return (0);
67}
68
69/*
70 * acl_get_entry() (23.4.14): returns an ACL entry from an ACL
71 * indicated by entry_id.
72 */
73int
74acl_get_entry(acl_t acl, int entry_id, acl_entry_t *entry_p)
75{
76 struct acl *acl_int;
77
67}
68
69/*
70 * acl_get_entry() (23.4.14): returns an ACL entry from an ACL
71 * indicated by entry_id.
72 */
73int
74acl_get_entry(acl_t acl, int entry_id, acl_entry_t *entry_p)
75{
76 struct acl *acl_int;
77
78 if (!acl) {
78 if (acl == NULL) {
79 errno = EINVAL;
79 errno = EINVAL;
80 return -1;
80 return (-1);
81 }
82 acl_int = &acl->ats_acl;
83
84 switch(entry_id) {
85 case ACL_FIRST_ENTRY:
86 acl->ats_cur_entry = 0;
87 /* PASSTHROUGH */
88 case ACL_NEXT_ENTRY:
89 if (acl->ats_cur_entry >= acl->ats_acl.acl_cnt)
90 return 0;
91 *entry_p = &acl_int->acl_entry[acl->ats_cur_entry++];
81 }
82 acl_int = &acl->ats_acl;
83
84 switch(entry_id) {
85 case ACL_FIRST_ENTRY:
86 acl->ats_cur_entry = 0;
87 /* PASSTHROUGH */
88 case ACL_NEXT_ENTRY:
89 if (acl->ats_cur_entry >= acl->ats_acl.acl_cnt)
90 return 0;
91 *entry_p = &acl_int->acl_entry[acl->ats_cur_entry++];
92 return 1;
92 return (1);
93 }
94
95 errno = EINVAL;
93 }
94
95 errno = EINVAL;
96 return -1;
96 return (-1);
97}
97}