acl_entry.c revision 208782 
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: head/lib/libc/posix1e/acl_entry.c 208782 2010-06-03 14:15:08Z 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	    (acl_int->acl_cnt < 0)) {
60		errno = EINVAL;
61		return (-1);
62	}
63
64	*entry_p = &acl_int->acl_entry[acl_int->acl_cnt++];
65
66	(**entry_p).ae_tag  = ACL_UNDEFINED_TAG;
67	(**entry_p).ae_id   = ACL_UNDEFINED_ID;
68	(**entry_p).ae_perm = ACL_PERM_NONE;
69	(**entry_p).ae_entry_type = 0;
70	(**entry_p).ae_flags = 0;
71
72	(*acl_p)->ats_cur_entry = 0;
73
74	return (0);
75}
76
77int
78acl_create_entry_np(acl_t *acl_p, acl_entry_t *entry_p, int offset)
79{
80	int i;
81	struct acl *acl_int;
82
83	if (acl_p == NULL) {
84		errno = EINVAL;
85		return (-1);
86	}
87
88	acl_int = &(*acl_p)->ats_acl;
89
90	if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) {
91		errno = EINVAL;
92		return (-1);
93	}
94
95	if (offset < 0 || offset >= acl_int->acl_cnt) {
96		errno = EINVAL;
97		return (-1);
98	}
99
100	/* Make room for the new entry. */
101	for (i = acl_int->acl_cnt; i > offset; i--)
102		acl_int->acl_entry[i] = acl_int->acl_entry[i - 1];
103
104	acl_int->acl_cnt++;
105
106	*entry_p = &acl_int->acl_entry[offset];
107
108	(**entry_p).ae_tag  = ACL_UNDEFINED_TAG;
109	(**entry_p).ae_id   = ACL_UNDEFINED_ID;
110	(**entry_p).ae_perm = ACL_PERM_NONE;
111	(**entry_p).ae_entry_type = 0;
112	(**entry_p).ae_flags= 0;
113
114	(*acl_p)->ats_cur_entry = 0;
115
116	return (0);
117}
118
119/*
120 * acl_get_entry() (23.4.14): returns an ACL entry from an ACL
121 * indicated by entry_id.
122 */
123int
124acl_get_entry(acl_t acl, int entry_id, acl_entry_t *entry_p)
125{
126	struct acl *acl_int;
127
128	if (acl == NULL) {
129		errno = EINVAL;
130		return (-1);
131	}
132	acl_int = &acl->ats_acl;
133
134	switch(entry_id) {
135	case ACL_FIRST_ENTRY:
136		acl->ats_cur_entry = 0;
137		/* PASSTHROUGH */
138	case ACL_NEXT_ENTRY:
139		if (acl->ats_cur_entry >= acl->ats_acl.acl_cnt)
140			return 0;
141		*entry_p = &acl_int->acl_entry[acl->ats_cur_entry++];
142		return (1);
143	}
144
145	errno = EINVAL;
146	return (-1);
147}
148