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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
|
/* vi: set sw=4 ts=4: */
/*
* Copyright 1989 - 1994, Julianne Frances Haugh
* <jockgrrl@austin.rr.com>, <jfh@austin.ibm.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of Julianne F. Haugh nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY JULIE HAUGH AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL JULIE HAUGH OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/* TODO: fgetspent_r.c getspent_r.c getspnam_r.c sgetspent_r.c
* lckpwdf ulckpwdf
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "busybox.h"
#include "shadow_.h"
static FILE *shadow;
static char spwbuf[BUFSIZ];
static struct spwd spwd;
#define FIELDS 9
#define OFIELDS 5
/* setspent - initialize access to shadow text and DBM files */
void setspent(void)
{
if (shadow) {
rewind(shadow);
} else {
shadow = bb_xfopen(SHADOW_FILE, "r");
}
}
/* endspent - terminate access to shadow text and DBM files */
void endspent(void)
{
if (shadow)
(void) fclose(shadow);
shadow = (FILE *) 0;
}
/* getspent - get a (struct spwd *) from the current shadow file */
struct spwd *getspent(void)
{
if (!shadow)
setspent();
return (fgetspent(shadow));
}
/* getspnam - get a shadow entry by name */
struct spwd *getspnam(const char *name)
{
struct spwd *sp;
if (!name || !strlen(name))
return NULL;
setspent();
while ((sp = getspent()) != NULL) {
if (strcmp(name, sp->sp_namp) == 0)
break;
}
endspent();
return (sp);
}
/* sgetspent - convert string in shadow file format to (struct spwd *) */
/* returns NULL on error */
struct spwd *sgetspent(const char *string)
{
char *fields[FIELDS];
char *cp;
char *cpp;
int i;
/*
* Copy string to local buffer. It has to be tokenized and we
* have to do that to our private copy.
*/
if (strlen(string) >= sizeof spwbuf)
/* return 0; */
return NULL;
strcpy(spwbuf, string);
if ((cp = strrchr(spwbuf, '\n')))
*cp = '\0';
/*
* Tokenize the string into colon separated fields. Allow up to
* FIELDS different fields.
*/
for (cp = spwbuf, i = 0; *cp && i < FIELDS; i++) {
fields[i] = cp;
while (*cp && *cp != ':')
cp++;
if (*cp)
*cp++ = '\0';
}
/*
* It is acceptable for the last SVR4 field to be blank. This
* results in the loop being terminated early. In which case,
* we just make the last field be blank and be done with it.
*/
if (i == (FIELDS - 1))
fields[i++] = cp;
if ((cp && *cp) || (i != FIELDS && i != OFIELDS))
/* return 0; */
return NULL;
/*
* Start populating the structure. The fields are all in
* static storage, as is the structure we pass back. If we
* ever see a name with '+' as the first character, we try
* to turn on NIS processing.
*/
spwd.sp_namp = fields[0];
spwd.sp_pwdp = fields[1];
/*
* Get the last changed date. For all of the integer fields,
* we check for proper format. It is an error to have an
* incorrectly formatted number, unless we are using NIS.
*/
if ((spwd.sp_lstchg = strtol(fields[2], &cpp, 10)) == 0 && *cpp) {
/* return 0; */
return NULL;
} else if (fields[2][0] == '\0')
spwd.sp_lstchg = -1;
/*
* Get the minimum period between password changes.
*/
if ((spwd.sp_min = strtol(fields[3], &cpp, 10)) == 0 && *cpp) {
/* return 0; */
return NULL;
} else if (fields[3][0] == '\0')
spwd.sp_min = -1;
/*
* Get the maximum number of days a password is valid.
*/
if ((spwd.sp_max = strtol(fields[4], &cpp, 10)) == 0 && *cpp) {
/* return 0; */
return NULL;
} else if (fields[4][0] == '\0')
spwd.sp_max = -1;
/*
* If there are only OFIELDS fields (this is a SVR3.2 /etc/shadow
* formatted file), initialize the other field members to -1.
*/
if (i == OFIELDS) {
spwd.sp_warn = spwd.sp_inact = spwd.sp_expire = spwd.sp_flag = -1;
return &spwd;
}
/*
* The rest of the fields are mandatory for SVR4, but optional
* for anything else. However, if one is present the others
* must be as well.
*/
/*
* Get the number of days of password expiry warning.
*/
if ((spwd.sp_warn = strtol(fields[5], &cpp, 10)) == 0 && *cpp) {
/* return 0; */
return NULL;
} else if (fields[5][0] == '\0')
spwd.sp_warn = -1;
/*
* Get the number of days of inactivity before an account is
* disabled.
*/
if ((spwd.sp_inact = strtol(fields[6], &cpp, 10)) == 0 && *cpp) {
/* return 0; */
return NULL;
} else if (fields[6][0] == '\0')
spwd.sp_inact = -1;
/*
* Get the number of days after the epoch before the account is
* set to expire.
*/
if ((spwd.sp_expire = strtol(fields[7], &cpp, 10)) == 0 && *cpp) {
/* return 0; */
return NULL;
} else if (fields[7][0] == '\0')
spwd.sp_expire = -1;
/*
* This field is reserved for future use. But it isn't supposed
* to have anything other than a valid integer in it.
*/
if ((spwd.sp_flag = strtol(fields[8], &cpp, 10)) == 0 && *cpp) {
/* return 0; */
return NULL;
} else if (fields[8][0] == '\0')
spwd.sp_flag = -1;
return (&spwd);
}
/* fgetspent - get an entry from an /etc/shadow formatted stream */
struct spwd *fgetspent(FILE *fp)
{
char buf[BUFSIZ];
char *cp;
if (!fp)
/* return (0); */
return NULL;
if (fgets(buf, sizeof buf, fp) != (char *) 0) {
if ((cp = strchr(buf, '\n')))
*cp = '\0';
return (sgetspent(buf));
}
/* return 0; */
return NULL;
}
/*
* putspent - put a (struct spwd *) into the (FILE *) you provide.
*
* this was described in shadow_.h but not implemented, so here
* I go. -beppu
*
*/
int putspent(const struct spwd *sp, FILE *fp)
{
int ret;
/* seek to end */
ret = fseek(fp, 0, SEEK_END);
if (ret == -1) {
/* return -1; */
return 1;
}
/* powered by fprintf */
fprintf(fp, "%s:%s:%ld:%ld:%ld:%ld:%ld:%ld:%s\n", sp->sp_namp, /* login name */
sp->sp_pwdp, /* encrypted password */
sp->sp_lstchg, /* date of last change */
sp->sp_min, /* minimum number of days between changes */
sp->sp_max, /* maximum number of days between changes */
sp->sp_warn, /* number of days of warning before password expires */
sp->sp_inact, /* number of days after password expires until
the account becomes unusable */
sp->sp_expire, /* days since 1/1/70 until account expires */
"");
return 0;
}
|