pw_scan.c revision 1.15
1 /* $NetBSD: pw_scan.c,v 1.15 2005/01/19 19:13:38 christos Exp $ */ 2 3 /* 4 * Copyright (c) 1987, 1993, 1994, 1995 5 * The Regents of the University of California. 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 the University 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 THE REGENTS 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 THE REGENTS 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 #if HAVE_NBTOOL_CONFIG_H 33 #include "nbtool_config.h" 34 #include "compat_pwd.h" 35 36 #else 37 #include <sys/cdefs.h> 38 #if defined(LIBC_SCCS) && !defined(lint) 39 __RCSID("$NetBSD: pw_scan.c,v 1.15 2005/01/19 19:13:38 christos Exp $"); 40 #endif /* LIBC_SCCS and not lint */ 41 42 #if defined(_LIBC) 43 #include "namespace.h" 44 #endif 45 #include <sys/types.h> 46 47 #include <assert.h> 48 #include <err.h> 49 #include <limits.h> 50 #include <pwd.h> 51 #include <stdio.h> 52 #include <stdlib.h> 53 #include <string.h> 54 #include <unistd.h> 55 #include <errno.h> 56 57 #ifdef _LIBC 58 #include "pw_private.h" 59 #endif 60 #endif /* ! HAVE_NBTOOL_CONFIG_H */ 61 62 static int 63 gettime(time_t *t, const char *p, int *flags, int dowarn, int flag) 64 { 65 long l; 66 char *ep; 67 68 if (*p == '\0') { 69 if (flags) 70 *flags |= flag; 71 *t = 0; 72 return 1; 73 } 74 l = strtol(p, &ep, 0); 75 if (p == ep || *ep != '\0') { 76 ep = __UNCONST("Invalid number"); 77 goto done; 78 } 79 if (errno == ERANGE && (l == LONG_MAX || l == LONG_MIN)) { 80 ep = strerror(errno); 81 goto done; 82 } 83 84 *t = (time_t)l; 85 return 1; 86 done: 87 if (dowarn) { 88 warnx("%s value `%s' for %s time", ep, p, 89 flag == _PASSWORD_NOEXP ? "expiration" : "change"); 90 } 91 return 0; 92 93 } 94 95 static int 96 getid(unsigned long *res, const char *p, int *flags, int dowarn, int flag) 97 { 98 long ul; 99 char *ep; 100 101 if (*p == '\0') { 102 if (flags) 103 *flags |= flag; 104 *res = 0; 105 return 1; 106 } 107 ul = strtoul(p, &ep, 0); 108 if (p == ep || *ep != '\0') { 109 ep = __UNCONST("Invalid number"); 110 goto done; 111 } 112 if (errno == ERANGE && ul == ULONG_MAX) { 113 ep = strerror(errno); 114 goto done; 115 } 116 if (ul > *res) { 117 ep = strerror(ERANGE); 118 goto done; 119 } 120 121 *res = ul; 122 return 1; 123 done: 124 if (dowarn) 125 warnx("%s %s value `%s'", ep, 126 flag == _PASSWORD_NOUID ? "uid" : "gid", p); 127 return 0; 128 129 } 130 int 131 #ifdef _LIBC 132 __pw_scan(char *bp, struct passwd *pw, int *flags) 133 #else 134 pw_scan( char *bp, struct passwd *pw, int *flags) 135 #endif 136 { 137 unsigned long id; 138 int root, inflags; 139 int dowarn = !(inflags & _PASSWORD_NOWARN); 140 const char *p, *sh; 141 142 _DIAGASSERT(bp != NULL); 143 _DIAGASSERT(pw != NULL); 144 145 inflags = 0; 146 if (flags) { 147 inflags = *flags; 148 *flags = 0; 149 } 150 151 if (!(pw->pw_name = strsep(&bp, ":"))) /* login */ 152 goto fmt; 153 if (strlen(pw->pw_name) > (LOGIN_NAME_MAX - 1)) { 154 if (dowarn) 155 warnx("username too long, `%s' > %d", pw->pw_name, 156 LOGIN_NAME_MAX - 1); 157 return 0; 158 } 159 160 root = !strcmp(pw->pw_name, "root"); 161 162 if (!(pw->pw_passwd = strsep(&bp, ":"))) /* passwd */ 163 goto fmt; 164 165 if (!(p = strsep(&bp, ":"))) /* uid */ 166 goto fmt; 167 168 id = UID_MAX; 169 if (!getid(&id, p, flags, dowarn, _PASSWORD_NOUID)) 170 return 0; 171 172 if (root && id) { 173 if (dowarn) 174 warnx("root uid should be 0"); 175 return 0; 176 } 177 178 pw->pw_uid = (uid_t)id; 179 180 if (!(p = strsep(&bp, ":"))) /* gid */ 181 goto fmt; 182 183 id = GID_MAX; 184 if (!getid(&id, p, flags, dowarn, _PASSWORD_NOGID)) 185 return 0; 186 187 pw->pw_gid = (gid_t)id; 188 189 if (inflags & _PASSWORD_OLDFMT) { 190 pw->pw_class = __UNCONST(""); 191 pw->pw_change = 0; 192 pw->pw_expire = 0; 193 if (flags) 194 *flags |= (_PASSWORD_NOCHG | _PASSWORD_NOEXP); 195 } else { 196 pw->pw_class = strsep(&bp, ":"); /* class */ 197 if (!(p = strsep(&bp, ":"))) /* change */ 198 goto fmt; 199 if (!gettime(&pw->pw_change, p, flags, dowarn, _PASSWORD_NOCHG)) 200 return 0; 201 if (!(p = strsep(&bp, ":"))) /* expire */ 202 goto fmt; 203 if (!gettime(&pw->pw_expire, p, flags, dowarn, _PASSWORD_NOEXP)) 204 return 0; 205 } 206 207 pw->pw_gecos = strsep(&bp, ":"); /* gecos */ 208 pw->pw_dir = strsep(&bp, ":"); /* directory */ 209 if (!(pw->pw_shell = strsep(&bp, ":"))) /* shell */ 210 goto fmt; 211 212 #if ! HAVE_NBTOOL_CONFIG_H 213 p = pw->pw_shell; 214 if (root && *p) /* empty == /bin/sh */ 215 for (setusershell();;) { 216 if (!(sh = getusershell())) { 217 if (dowarn) 218 warnx("warning, unknown root shell"); 219 break; 220 } 221 if (!strcmp(p, sh)) 222 break; 223 } 224 #endif 225 226 if ((p = strsep(&bp, ":")) != NULL) { /* too many */ 227 fmt: 228 if (dowarn) 229 warnx("corrupted entry"); 230 return 0; 231 } 232 233 return 1; 234 } 235
Indexes created Tue Sep 23 07:09:52 GMT 2025