Robert Griebl | 1fca558 | 2002-06-04 20:45:46 +0000 | [diff] [blame] | 1 | /* vi: set sw=4 ts=4: */ |
| 2 | /* |
| 3 | * Copyright 1989 - 1994, Julianne Frances Haugh |
| 4 | * <jockgrrl@austin.rr.com>, <jfh@austin.ibm.com> |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions |
| 9 | * are met: |
| 10 | * 1. Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright |
| 13 | * notice, this list of conditions and the following disclaimer in the |
| 14 | * documentation and/or other materials provided with the distribution. |
| 15 | * 3. Neither the name of Julianne F. Haugh nor the names of its contributors |
| 16 | * may be used to endorse or promote products derived from this software |
| 17 | * without specific prior written permission. |
| 18 | * |
| 19 | * THIS SOFTWARE IS PROVIDED BY JULIE HAUGH AND CONTRIBUTORS ``AS IS'' AND |
| 20 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 21 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 22 | * ARE DISCLAIMED. IN NO EVENT SHALL JULIE HAUGH OR CONTRIBUTORS BE LIABLE |
| 23 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 24 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 25 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 26 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 27 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 28 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 29 | * SUCH DAMAGE. |
| 30 | */ |
| 31 | |
| 32 | /* TODO: fgetspent_r.c getspent_r.c getspnam_r.c sgetspent_r.c |
| 33 | * lckpwdf ulckpwdf |
| 34 | */ |
| 35 | |
| 36 | #include "busybox.h" |
| 37 | |
| 38 | #include <stdio.h> |
| 39 | #include <stdlib.h> |
| 40 | #include <string.h> |
| 41 | #include <unistd.h> |
Eric Andersen | 7234c3a | 2002-07-03 04:47:43 +0000 | [diff] [blame] | 42 | #include "shadow_.h" |
Robert Griebl | 1fca558 | 2002-06-04 20:45:46 +0000 | [diff] [blame] | 43 | |
| 44 | static FILE *shadow; |
| 45 | static char spwbuf[BUFSIZ]; |
| 46 | static struct spwd spwd; |
| 47 | |
| 48 | #define FIELDS 9 |
| 49 | #define OFIELDS 5 |
| 50 | |
| 51 | /* setspent - initialize access to shadow text and DBM files */ |
| 52 | void setspent(void) |
| 53 | { |
| 54 | if (shadow) { |
| 55 | rewind(shadow); |
| 56 | } else { |
| 57 | if ((shadow = fopen("/etc/shadow", "r")) == NULL) |
| 58 | perror_msg_and_die("/etc/shadow"); |
| 59 | } |
| 60 | } |
| 61 | |
| 62 | /* endspent - terminate access to shadow text and DBM files */ |
| 63 | void endspent(void) |
| 64 | { |
| 65 | if (shadow) |
| 66 | (void) fclose(shadow); |
| 67 | shadow = (FILE *) 0; |
| 68 | } |
| 69 | |
| 70 | /* getspent - get a (struct spwd *) from the current shadow file */ |
| 71 | struct spwd *getspent(void) |
| 72 | { |
| 73 | if (!shadow) |
| 74 | setspent(); |
| 75 | return (fgetspent(shadow)); |
| 76 | } |
| 77 | |
| 78 | /* getspnam - get a shadow entry by name */ |
| 79 | struct spwd *getspnam(const char *name) |
| 80 | { |
| 81 | struct spwd *sp; |
| 82 | |
| 83 | if (!name || !strlen(name)) |
| 84 | return NULL; |
| 85 | |
| 86 | setspent(); |
| 87 | while ((sp = getspent()) != NULL) { |
| 88 | if (strcmp(name, sp->sp_namp) == 0) |
| 89 | break; |
| 90 | } |
| 91 | endspent(); |
| 92 | return (sp); |
| 93 | } |
| 94 | |
| 95 | |
| 96 | /* sgetspent - convert string in shadow file format to (struct spwd *) */ |
| 97 | /* returns NULL on error */ |
| 98 | struct spwd *sgetspent(const char *string) |
| 99 | { |
| 100 | char *fields[FIELDS]; |
| 101 | char *cp; |
| 102 | char *cpp; |
| 103 | int i; |
| 104 | |
| 105 | /* |
| 106 | * Copy string to local buffer. It has to be tokenized and we |
| 107 | * have to do that to our private copy. |
| 108 | */ |
| 109 | |
| 110 | if (strlen(string) >= sizeof spwbuf) |
| 111 | /* return 0; */ |
| 112 | return NULL; |
| 113 | strcpy(spwbuf, string); |
| 114 | |
| 115 | if ((cp = strrchr(spwbuf, '\n'))) |
| 116 | *cp = '\0'; |
| 117 | |
| 118 | /* |
| 119 | * Tokenize the string into colon separated fields. Allow up to |
| 120 | * FIELDS different fields. |
| 121 | */ |
| 122 | |
| 123 | for (cp = spwbuf, i = 0; *cp && i < FIELDS; i++) { |
| 124 | fields[i] = cp; |
| 125 | while (*cp && *cp != ':') |
| 126 | cp++; |
| 127 | |
| 128 | if (*cp) |
| 129 | *cp++ = '\0'; |
| 130 | } |
| 131 | |
| 132 | /* |
| 133 | * It is acceptable for the last SVR4 field to be blank. This |
| 134 | * results in the loop being terminated early. In which case, |
| 135 | * we just make the last field be blank and be done with it. |
| 136 | */ |
| 137 | |
| 138 | if (i == (FIELDS - 1)) |
| 139 | fields[i++] = cp; |
| 140 | |
| 141 | if ((cp && *cp) || (i != FIELDS && i != OFIELDS)) |
| 142 | /* return 0; */ |
| 143 | return NULL; |
| 144 | |
| 145 | /* |
| 146 | * Start populating the structure. The fields are all in |
| 147 | * static storage, as is the structure we pass back. If we |
| 148 | * ever see a name with '+' as the first character, we try |
| 149 | * to turn on NIS processing. |
| 150 | */ |
| 151 | |
| 152 | spwd.sp_namp = fields[0]; |
| 153 | spwd.sp_pwdp = fields[1]; |
| 154 | |
| 155 | /* |
| 156 | * Get the last changed date. For all of the integer fields, |
| 157 | * we check for proper format. It is an error to have an |
| 158 | * incorrectly formatted number, unless we are using NIS. |
| 159 | */ |
| 160 | |
| 161 | if ((spwd.sp_lstchg = strtol(fields[2], &cpp, 10)) == 0 && *cpp) { |
| 162 | /* return 0; */ |
| 163 | return NULL; |
| 164 | } else if (fields[2][0] == '\0') |
| 165 | spwd.sp_lstchg = -1; |
| 166 | |
| 167 | /* |
| 168 | * Get the minimum period between password changes. |
| 169 | */ |
| 170 | |
| 171 | if ((spwd.sp_min = strtol(fields[3], &cpp, 10)) == 0 && *cpp) { |
| 172 | /* return 0; */ |
| 173 | return NULL; |
| 174 | } else if (fields[3][0] == '\0') |
| 175 | spwd.sp_min = -1; |
| 176 | |
| 177 | /* |
| 178 | * Get the maximum number of days a password is valid. |
| 179 | */ |
| 180 | |
| 181 | if ((spwd.sp_max = strtol(fields[4], &cpp, 10)) == 0 && *cpp) { |
| 182 | /* return 0; */ |
| 183 | return NULL; |
| 184 | } else if (fields[4][0] == '\0') |
| 185 | spwd.sp_max = -1; |
| 186 | |
| 187 | /* |
| 188 | * If there are only OFIELDS fields (this is a SVR3.2 /etc/shadow |
| 189 | * formatted file), initialize the other field members to -1. |
| 190 | */ |
| 191 | |
| 192 | if (i == OFIELDS) { |
| 193 | spwd.sp_warn = spwd.sp_inact = spwd.sp_expire = spwd.sp_flag = -1; |
| 194 | |
| 195 | return &spwd; |
| 196 | } |
| 197 | |
| 198 | /* |
| 199 | * The rest of the fields are mandatory for SVR4, but optional |
| 200 | * for anything else. However, if one is present the others |
| 201 | * must be as well. |
| 202 | */ |
| 203 | |
| 204 | /* |
| 205 | * Get the number of days of password expiry warning. |
| 206 | */ |
| 207 | |
| 208 | if ((spwd.sp_warn = strtol(fields[5], &cpp, 10)) == 0 && *cpp) { |
| 209 | /* return 0; */ |
| 210 | return NULL; |
| 211 | } else if (fields[5][0] == '\0') |
| 212 | spwd.sp_warn = -1; |
| 213 | |
| 214 | /* |
| 215 | * Get the number of days of inactivity before an account is |
| 216 | * disabled. |
| 217 | */ |
| 218 | |
| 219 | if ((spwd.sp_inact = strtol(fields[6], &cpp, 10)) == 0 && *cpp) { |
| 220 | /* return 0; */ |
| 221 | return NULL; |
| 222 | } else if (fields[6][0] == '\0') |
| 223 | spwd.sp_inact = -1; |
| 224 | |
| 225 | /* |
| 226 | * Get the number of days after the epoch before the account is |
| 227 | * set to expire. |
| 228 | */ |
| 229 | |
| 230 | if ((spwd.sp_expire = strtol(fields[7], &cpp, 10)) == 0 && *cpp) { |
| 231 | /* return 0; */ |
| 232 | return NULL; |
| 233 | } else if (fields[7][0] == '\0') |
| 234 | spwd.sp_expire = -1; |
| 235 | |
| 236 | /* |
| 237 | * This field is reserved for future use. But it isn't supposed |
| 238 | * to have anything other than a valid integer in it. |
| 239 | */ |
| 240 | |
| 241 | if ((spwd.sp_flag = strtol(fields[8], &cpp, 10)) == 0 && *cpp) { |
| 242 | /* return 0; */ |
| 243 | return NULL; |
| 244 | } else if (fields[8][0] == '\0') |
| 245 | spwd.sp_flag = -1; |
| 246 | |
| 247 | return (&spwd); |
| 248 | } |
| 249 | |
| 250 | /* fgetspent - get an entry from an /etc/shadow formatted stream */ |
| 251 | struct spwd *fgetspent(FILE *fp) |
| 252 | { |
| 253 | char buf[BUFSIZ]; |
| 254 | char *cp; |
| 255 | |
| 256 | if (!fp) |
| 257 | /* return (0); */ |
| 258 | return NULL; |
| 259 | |
| 260 | if (fgets(buf, sizeof buf, fp) != (char *) 0) { |
| 261 | if ((cp = strchr(buf, '\n'))) |
| 262 | *cp = '\0'; |
| 263 | return (sgetspent(buf)); |
| 264 | } |
| 265 | /* return 0; */ |
| 266 | return NULL; |
| 267 | } |
| 268 | |
| 269 | /* |
| 270 | * putspent - put a (struct spwd *) into the (FILE *) you provide. |
| 271 | * |
| 272 | * this was described in shadow_.h but not implemented, so here |
| 273 | * I go. -beppu |
| 274 | * |
| 275 | */ |
| 276 | int putspent(const struct spwd *sp, FILE *fp) |
| 277 | { |
| 278 | int ret; |
| 279 | |
| 280 | /* seek to end */ |
| 281 | ret = fseek(fp, 0, SEEK_END); |
| 282 | if (ret == -1) { |
| 283 | /* return -1; */ |
| 284 | return 1; |
| 285 | } |
| 286 | |
| 287 | /* powered by fprintf */ |
| 288 | fprintf(fp, "%s:%s:%ld:%ld:%ld:%ld:%ld:%ld:%s\n", sp->sp_namp, /* login name */ |
| 289 | sp->sp_pwdp, /* encrypted password */ |
| 290 | sp->sp_lstchg, /* date of last change */ |
| 291 | sp->sp_min, /* minimum number of days between changes */ |
| 292 | sp->sp_max, /* maximum number of days between changes */ |
| 293 | sp->sp_warn, /* number of days of warning before password expires */ |
| 294 | sp->sp_inact, /* number of days after password expires until |
| 295 | the account becomes unusable */ |
| 296 | sp->sp_expire, /* days since 1/1/70 until account expires */ |
| 297 | ""); |
| 298 | return 0; |
| 299 | } |
| 300 | |
| 301 | |