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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/* Routines for vectors of uids/gids
Copyright (C) 1995 Free Software Foundation, Inc.
Written by Miles Bader <miles@gnu.ai.mit.edu>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2, 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
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <malloc.h>
#include <string.h>
#include <idvec.h>
typedef uid_t id_t;
/* Return a new, empty, idvec, or NULL if there wasn't enough memory. */
struct idvec *
make_idvec ()
{
struct idvec *idvec = malloc (sizeof (struct idvec));
if (idvec)
{
idvec->alloced = idvec->num = 0;
idvec->ids = 0;
}
return idvec;
}
/* Free's IDVEC, but not the storage pointed to by the IDS field. */
void
idvec_free_wrapper (struct idvec *idvec)
{
free (idvec);
}
void
idvec_free (struct idvec *idvec)
{
if (idvec->alloced)
free (idvec->ids);
free (idvec);
}
/* Ensure that IDVEC has enough spaced allocated to hold NUM ids, thus
ensuring that any subsequent ids added won't return a memory allocation
error unless it would result in more ids that NUM. ENOMEM is returned if
a memory allocation error occurs. */
error_t
idvec_ensure (struct idvec *idvec, unsigned num)
{
if (num > idvec->alloced)
{
id_t *_ids = realloc (idvec->ids, num);
if (! _ids)
return ENOMEM;
idvec->ids = _ids;
idvec->alloced = num;
}
return 0;
}
/* Like idvec_ensure(), but takes INC, the increment of the number of ids
already in IDVEC as an argument. */
error_t
idvec_grow (struct idvec *idvec, unsigned inc)
{
return idvec_ensure (idvec, idvec->num + inc);
}
/* Returns true if IDVEC contains ID, at or after position POS. */
int
idvec_tail_contains (struct idvec *idvec, unsigned pos, id_t id)
{
while (pos < idvec->num)
if (idvec->ids[pos++] == id)
return 1;
return 0;
}
/* Returns true if IDVEC contains ID. */
int
idvec_contains (struct idvec *idvec, id_t id)
{
return idvec_tail_contains (idvec, 0, id);
}
/* Insert ID into IDVEC at position POS, returning ENOMEM if there wasn't
enough memory, or 0. */
error_t
idvec_insert (struct idvec *idvec, unsigned pos, id_t id)
{
error_t err = 0;
unsigned num = idvec->num;
if (idvec->alloced == num)
/* If we seem to be growing by just one, actually prealloc some more. */
err = idvec_grow (idvec, num + 1);
else
err = idvec_grow (idvec, 1);
if (! err)
{
id_t *ids = idvec->ids;
if (pos < num)
bcopy (ids + pos, ids + pos + 1, (num - pos) * sizeof (id_t));
else if (pos > num)
bzero (ids + num, (pos - num) * sizeof (id_t));
ids[pos] = id;
idvec->num = num + 1;
}
return err;
}
/* Add ID onto the end of IDVEC, returning ENOMEM if there's not enough memory,
or 0. */
error_t
idvec_add (struct idvec *idvec, id_t id)
{
return idvec_insert (idvec, idvec->num, id);
}
/* IF IDVEC doesn't contain ID, add it onto the end, returning ENOMEM if
there's not enough memory; otherwise, do nothing. */
error_t
idvec_add_new (struct idvec *idvec, id_t id)
{
if (idvec_contains (idvec, id))
return 0;
else
return idvec_add (idvec, id);
}
/* IF IDVEC doesn't contain ID at position POS or after, insert it at POS,
returning ENOMEM if there's not enough memory; otherwise, do nothing. */
error_t
idvec_insert_new (struct idvec *idvec, unsigned pos, id_t id)
{
if (idvec_tail_contains (idvec, pos, id))
return 0;
else
return idvec_insert (idvec, pos, id);
}
/* Adds each id in the vector IDS (NUM elements long) to IDVEC, as if with
idvec_add_new(). */
error_t
idvec_merge_ids (struct idvec *idvec, id_t *ids, unsigned num)
{
error_t err = 0;
while (num-- > 0 && !err)
err = idvec_add_new (idvec, *ids++);
return err;
}
/* EFF and AVAIL should be idvec's corresponding to a processes effective and
available ids. ID replaces the first id in EFF, and what it replaces is
preserved by adding it to AVAIL (if not already present). If SECURE is
non-NULL, and ID was not previously present in either EFF or AVAIL, then
*SECURE is set to true. ENOMEM is returned if a malloc fails, otherwise
0. The return parameters are only touched if this call succeeds. */
error_t
idvec_setid (struct idvec *eff, struct idvec *avail, id_t id, int *secure)
{
error_t err;
/* True if ID was not previously present in either EFF or AVAIL. */
int _secure = !idvec_contains (eff, id) && !idvec_contains (avail, id);
if (eff->num > 0)
/* If there are any old effective ids, we replace eff[0] with ID, and try
to preserve the old eff[0] by putting it in AVAIL list if necessary. */
{
if (avail->num == 0)
/* The old eff[0] becomes avail[0] (the posix real id). */
err = idvec_add (avail, eff->ids[0]);
else
/* We preserve the old real id, and add eff[0] to the list of saved
ids (if necessary). Inserting it means that the latest id saved
will correspond to the (single) posix saved id. */
err = idvec_insert_new (avail, 1, eff->ids[0]);
/* Replace eff[0] with the new id. */
eff->ids[0] = id;
}
else
/* No previous effective ids, just make ID the first one. */
err = idvec_add (eff, id);
if (err)
return err;
if (_secure && secure && !*secure)
*secure = 1;
return 0;
}
|
