1 /* $NetBSD: stdhosts.c,v 1.12 2000/07/30 02:25:08 itojun Exp $ */ 2 3 /* 4 * Copyright (c) 1994 Mats O Jansson <moj@stacken.kth.se> 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. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by Mats O Jansson 18 * 4. The name of the author may not be used to endorse or promote products 19 * derived from this software without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS 22 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 23 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY 25 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #include <sys/cdefs.h> 35 #ifndef lint 36 __RCSID("$NetBSD: stdhosts.c,v 1.12 2000/07/30 02:25:08 itojun Exp $"); 37 #endif 38 39 #include <sys/types.h> 40 #include <sys/socket.h> 41 #include <netinet/in.h> 42 #include <arpa/inet.h> 43 #include <ctype.h> 44 #include <err.h> 45 #include <limits.h> 46 #include <stdio.h> 47 #include <stdlib.h> 48 #include <string.h> 49 #include <util.h> 50 #include <unistd.h> 51 #include <netdb.h> 52 53 #include "protos.h" 54 55 int main __P((int, char *[])); 56 void usage __P((void)); 57 58 extern char *__progname; /* from crt0.o */ 59 60 int 61 main(argc, argv) 62 int argc; 63 char *argv[]; 64 { 65 struct in_addr host_addr; 66 FILE *data_file; 67 size_t line_no; 68 size_t len; 69 char *line, *k, *v, *addr_string, *fname; 70 int ch; 71 int af = 1 << 4; /*IPv4*/ 72 struct addrinfo hints, *res; 73 74 addr_string = NULL; /* XXX gcc -Wuninitialized */ 75 76 while ((ch = getopt(argc, argv, "n")) != EOF) { 77 switch (ch) { 78 case 'n': 79 af |= 1 << 6; /*IPv6*/ 80 break; 81 default: 82 usage(); 83 /* NOTREACHED */ 84 } 85 } 86 argc -= optind; 87 argv += optind; 88 89 if (argc > 1) 90 usage(); 91 92 if (argc == 1) { 93 fname = argv[0]; 94 data_file = fopen(fname, "r"); 95 if (data_file == NULL) 96 err(1, "%s", fname); 97 } else { 98 fname = "<stdin>"; 99 data_file = stdin; 100 } 101 102 line_no = 0; 103 for (; 104 (line = fparseln(data_file, &len, &line_no, NULL, 105 FPARSELN_UNESCALL)); 106 free(line)) { 107 if (len == 0) 108 continue; 109 110 v = line; 111 for (k = v; *v && !isspace(*v); v++) 112 ; 113 while (*v && isspace(*v)) 114 *v++ = '\0'; 115 116 memset(&hints, 0, sizeof(hints)); 117 hints.ai_socktype = SOCK_DGRAM; /*dummy*/ 118 hints.ai_flags = AI_NUMERICHOST; 119 120 if ((af & (1 << 4)) != 0 && inet_aton(k, &host_addr) == 1 && 121 (addr_string = inet_ntoa(host_addr)) != NULL) { 122 /* IPv4 */ 123 printf("%s %s\n", addr_string, v); 124 } else if ((af & (1 << 6)) != 0 && 125 getaddrinfo(k, "0", &hints, &res) == 0) { 126 /* IPv6, with scope extension permitted */ 127 freeaddrinfo(res); 128 printf("%s %s\n", k, v); 129 } else 130 warnx("%s line %lu: syntax error", fname, 131 (unsigned long)line_no); 132 } 133 134 exit(0); 135 } 136 137 void 138 usage() 139 { 140 141 fprintf(stderr, "usage: %s [-n] [file]\n", __progname); 142 exit(1); 143 } 144