ruserpass.c revision 1.1
1 /* $NetBSD: ruserpass.c,v 1.1 1998/03/19 17:51:04 tv Exp $ */ 2 3 /* 4 * Copyright (c) 1985, 1993, 1994 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. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #ifndef lint 38 #if 0 39 static char sccsid[] = "@(#)ruserpass.c 8.4 (Berkeley) 4/27/95"; 40 #else 41 __RCSID("$NetBSD: ruserpass.c,v 1.1 1998/03/19 17:51:04 tv Exp $"); 42 #endif 43 #endif /* not lint */ 44 45 #include <sys/types.h> 46 #include <sys/stat.h> 47 #include <sys/param.h> 48 49 #include <ctype.h> 50 #include <err.h> 51 #include <errno.h> 52 #include <stdio.h> 53 #include <stdlib.h> 54 #include <string.h> 55 #include <unistd.h> 56 57 struct macel { 58 char mac_name[9]; /* macro name */ 59 char *mac_start; /* start of macro in macbuf */ 60 char *mac_end; /* end of macro in macbuf */ 61 }; 62 63 static int token __P((void)); 64 static FILE *cfile; 65 static int macnum; /* number of defined macros */ 66 static struct macel macros[16]; 67 static char macbuf[4096]; 68 69 #define DEFAULT 1 70 #define LOGIN 2 71 #define PASSWD 3 72 #define ACCOUNT 4 73 #define MACDEF 5 74 #define ID 10 75 #define MACH 11 76 77 static char tokval[100]; 78 79 static struct toktab { 80 char *tokstr; 81 int tval; 82 } toktab[]= { 83 { "default", DEFAULT }, 84 { "login", LOGIN }, 85 { "password", PASSWD }, 86 { "passwd", PASSWD }, 87 { "account", ACCOUNT }, 88 { "machine", MACH }, 89 { "macdef", MACDEF }, 90 { NULL, 0 } 91 }; 92 93 int ruserpass __P((const char *, char **, char **, char **)); 94 95 int 96 ruserpass(host, aname, apass, aacct) 97 const char *host; 98 char **aname, **apass, **aacct; 99 { 100 char *hdir, buf[BUFSIZ], *tmp; 101 char myname[MAXHOSTNAMELEN], *mydomain; 102 int t, i, c, usedefault = 0; 103 struct stat stb; 104 105 hdir = getenv("HOME"); 106 if (hdir == NULL) 107 hdir = "."; 108 if (strlen(hdir) + sizeof(".netrc") < sizeof(buf)) { 109 (void)snprintf(buf, sizeof buf, "%s/.netrc", hdir); 110 } else { 111 warnx("%s/.netrc: %s", hdir, strerror(ENAMETOOLONG)); 112 return (0); 113 } 114 cfile = fopen(buf, "r"); 115 if (cfile == NULL) { 116 if (errno != ENOENT) 117 warn("%s", buf); 118 return (0); 119 } 120 if (gethostname(myname, sizeof(myname)) < 0) 121 myname[0] = '\0'; 122 if ((mydomain = strchr(myname, '.')) == NULL) 123 mydomain = ""; 124 next: 125 while ((t = token())) switch(t) { 126 127 case DEFAULT: 128 usedefault = 1; 129 /* FALL THROUGH */ 130 131 case MACH: 132 if (!usedefault) { 133 if (token() != ID) 134 continue; 135 /* 136 * Allow match either for user's input host name 137 * or official hostname. Also allow match of 138 * incompletely-specified host in local domain. 139 */ 140 if (strcasecmp(host, tokval) == 0) 141 goto match; 142 if ((tmp = strchr(host, '.')) != NULL && 143 strcasecmp(tmp, mydomain) == 0 && 144 strncasecmp(host, tokval, tmp - host) == 0 && 145 tokval[tmp - host] == '\0') 146 goto match; 147 continue; 148 } 149 match: 150 while ((t = token()) && t != MACH && t != DEFAULT) switch(t) { 151 152 case LOGIN: 153 if (token()) 154 if (*aname == NULL) { 155 *aname = strdup(tokval); 156 if (*aname == NULL) 157 err(1, "can't strdup *aname"); 158 } else { 159 if (strcmp(*aname, tokval)) 160 goto next; 161 } 162 break; 163 case PASSWD: 164 if ((*aname == NULL || strcmp(*aname, "anonymous")) && 165 fstat(fileno(cfile), &stb) >= 0 && 166 (stb.st_mode & 077) != 0) { 167 warnx("Error: .netrc file is readable by others."); 168 warnx("Remove password or make file unreadable by others."); 169 goto bad; 170 } 171 if (token() && *apass == NULL) { 172 *apass = strdup(tokval); 173 if (*apass == NULL) 174 err(1, "can't strdup *apass"); 175 } 176 break; 177 case ACCOUNT: 178 if (fstat(fileno(cfile), &stb) >= 0 179 && (stb.st_mode & 077) != 0) { 180 warnx("Error: .netrc file is readable by others."); 181 warnx("Remove account or make file unreadable by others."); 182 goto bad; 183 } 184 if (token() && *aacct == NULL) { 185 *aacct = strdup(tokval); 186 if (*aacct == NULL) 187 err(1, "can't strdup *aacct"); 188 } 189 break; 190 case MACDEF: 191 while ((c=getc(cfile)) != EOF) 192 if (c != ' ' && c != '\t') 193 break; 194 if (c == EOF || c == '\n') { 195 puts("Missing macdef name argument."); 196 goto bad; 197 } 198 if (macnum == 16) { 199 puts( 200 "Limit of 16 macros have already been defined."); 201 goto bad; 202 } 203 tmp = macros[macnum].mac_name; 204 *tmp++ = c; 205 for (i=0; i < 8 && (c=getc(cfile)) != EOF && 206 !isspace(c); ++i) { 207 *tmp++ = c; 208 } 209 if (c == EOF) { 210 puts( 211 "Macro definition missing null line terminator."); 212 goto bad; 213 } 214 *tmp = '\0'; 215 if (c != '\n') { 216 while ((c=getc(cfile)) != EOF && c != '\n'); 217 } 218 if (c == EOF) { 219 puts( 220 "Macro definition missing null line terminator."); 221 goto bad; 222 } 223 if (macnum == 0) { 224 macros[macnum].mac_start = macbuf; 225 } 226 else { 227 macros[macnum].mac_start = 228 macros[macnum-1].mac_end + 1; 229 } 230 tmp = macros[macnum].mac_start; 231 while (tmp != macbuf + 4096) { 232 if ((c=getc(cfile)) == EOF) { 233 puts( 234 "Macro definition missing null line terminator."); 235 goto bad; 236 } 237 *tmp = c; 238 if (*tmp == '\n') { 239 if (*(tmp-1) == '\0') { 240 macros[macnum++].mac_end = tmp - 1; 241 break; 242 } 243 *tmp = '\0'; 244 } 245 tmp++; 246 } 247 if (tmp == macbuf + 4096) { 248 puts("4K macro buffer exceeded."); 249 goto bad; 250 } 251 break; 252 default: 253 warnx("Unknown .netrc keyword %s", tokval); 254 break; 255 } 256 goto done; 257 } 258 done: 259 (void)fclose(cfile); 260 return (0); 261 bad: 262 (void)fclose(cfile); 263 return (-1); 264 } 265 266 static int 267 token() 268 { 269 char *cp; 270 int c; 271 struct toktab *t; 272 273 if (feof(cfile) || ferror(cfile)) 274 return (0); 275 while ((c = getc(cfile)) != EOF && 276 (c == '\n' || c == '\t' || c == ' ' || c == ',')) 277 continue; 278 if (c == EOF) 279 return (0); 280 cp = tokval; 281 if (c == '"') { 282 while ((c = getc(cfile)) != EOF && c != '"') { 283 if (c == '\\') 284 c = getc(cfile); 285 *cp++ = c; 286 } 287 } else { 288 *cp++ = c; 289 while ((c = getc(cfile)) != EOF 290 && c != '\n' && c != '\t' && c != ' ' && c != ',') { 291 if (c == '\\') 292 c = getc(cfile); 293 *cp++ = c; 294 } 295 } 296 *cp = 0; 297 if (tokval[0] == 0) 298 return (0); 299 for (t = toktab; t->tokstr; t++) 300 if (!strcmp(t->tokstr, tokval)) 301 return (t->tval); 302 return (ID); 303 } 304
Indexes created Tue Sep 23 22:09:46 GMT 2025