1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
/*
File: sequence.c
(Linux Access Control List Management)
Copyright (C) 1999, 2000
Andreas Gruenbacher, <a.gruenbacher@bestbits.at>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "config.h"
#include <stdlib.h>
#include "sequence.h"
cmd_t
cmd_init(
void)
{
cmd_t cmd;
cmd = malloc(sizeof(struct cmd_obj));
if (cmd) {
cmd->c_tag = ACL_UNDEFINED_TAG;
cmd->c_perm = 0;
}
return cmd;
}
void
cmd_free(
cmd_t cmd)
{
free(cmd);
}
seq_t
seq_init(
void)
{
seq_t seq = (seq_t)malloc(sizeof(struct seq_obj));
if (seq == NULL)
return NULL;
seq->s_first = seq->s_last = NULL;
return seq;
}
int
seq_free(
seq_t seq)
{
cmd_t cmd = seq->s_first;
while (cmd) {
seq->s_first = seq->s_first->c_next;
cmd_free(cmd);
cmd = seq->s_first;
}
free(seq);
return 0;
}
int
seq_empty(
seq_t seq)
{
return (seq->s_first == NULL);
}
int
seq_append(
seq_t seq,
cmd_t cmd)
{
cmd->c_next = NULL;
if (seq->s_first == NULL) {
seq->s_first = seq->s_last = cmd;
} else {
seq->s_last->c_next = cmd;
seq->s_last = cmd;
}
return 0;
}
int
seq_append_cmd(
seq_t seq,
cmd_tag_t cmd,
acl_type_t type)
{
cmd_t cmd_d = cmd_init();
if (cmd_d == NULL)
return -1;
cmd_d->c_cmd = cmd;
cmd_d->c_type = type;
if (seq_append(seq, cmd_d) != 0) {
cmd_free(cmd_d);
return -1;
}
return 0;
}
int
seq_get_cmd(
seq_t seq,
int which,
cmd_t *cmd)
{
if (which == SEQ_FIRST_CMD) {
if (seq->s_first == NULL)
return 0;
if (cmd)
*cmd = seq->s_first;
return 1;
} else if (which == SEQ_NEXT_CMD) {
if (cmd == NULL)
return -1;
if (*cmd) {
*cmd = (*cmd)->c_next;
return (*cmd == NULL) ? 0 : 1;
}
return 0;
} else {
return -1;
}
}
int
seq_delete_cmd(
seq_t seq,
cmd_t cmd)
{
cmd_t prev = seq->s_first;
if (cmd == seq->s_first) {
seq->s_first = seq->s_first->c_next;
cmd_free(cmd);
return 0;
}
while (prev != NULL && prev->c_next != cmd)
prev = prev->c_next;
if (prev == NULL)
return -1;
if (cmd == seq->s_last)
seq->s_last = prev;
prev->c_next = cmd->c_next;
cmd_free(cmd);
return 0;
}
|
