xref: /haiku/src/bin/network/traceroute/ifaddrlist.c (revision 2b76973fa2401f7a5edf68e6470f3d3210cbcff3)
1 /*
2  * Copyright (c) 1997, 1998, 1999, 2000
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  * 3. All advertising materials mentioning features or use of this software
14  *    must display the following acknowledgement:
15  *	This product includes software developed by the Computer Systems
16  *	Engineering Group at Lawrence Berkeley Laboratory.
17  * 4. Neither the name of the University nor of the Laboratory may be used
18  *    to endorse or promote products derived from this software without
19  *    specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25  * FOR ANY 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 #ifndef lint
35 static const char rcsid[] =
36     "@(#) $Id: ifaddrlist.c,v 1.9 2000/11/23 20:01:55 leres Exp $ (LBL)";
37 #endif
38 
39 #include <sys/param.h>
40 #include <sys/ioctl.h>
41 #include <sys/socket.h>
42 #ifdef HAVE_SYS_SOCKIO_H
43 #include <sys/sockio.h>
44 #endif
45 #include <sys/time.h>				/* concession to AIX */
46 
47 #include <sys/sockio.h> /* for SIOCGIFCONF */
48 
49 #if __STDC__
50 struct mbuf;
51 struct rtentry;
52 #endif
53 
54 #include <net/if.h>
55 #include <netinet/in.h>
56 
57 #include <ctype.h>
58 #include <errno.h>
59 #include <memory.h>
60 #include <stdio.h>
61 #include <stdlib.h>
62 #include <string.h>
63 #include <unistd.h>
64 
65 #include "gnuc.h"
66 #ifdef HAVE_OS_PROTO_H
67 #include "os-proto.h"
68 #endif
69 
70 #include "ifaddrlist.h"
71 
72 /*
73  * Return the interface list
74  */
75 int
76 ifaddrlist(register struct ifaddrlist **ipaddrp, register char *errbuf)
77 {
78 	register int fd, nipaddr;
79 #ifdef HAVE_SOCKADDR_SA_LEN
80 	register int n;
81 #endif
82 	register struct ifreq *ifrp, *ifend, *ifnext, *mp;
83 	register struct sockaddr_in *sin;
84 	register struct ifaddrlist *al;
85 	struct ifconf ifc;
86 	struct ifreq ibuf[(32 * 1024) / sizeof(struct ifreq)], ifr;
87 #define MAX_IPADDR (sizeof(ibuf) / sizeof(ibuf[0]))
88 	static struct ifaddrlist ifaddrlist[MAX_IPADDR];
89 	char device[sizeof(ifr.ifr_name) + 1];
90 
91 	fd = socket(AF_INET, SOCK_DGRAM, 0);
92 	if (fd < 0) {
93 		(void)sprintf(errbuf, "socket: %s", strerror(errno));
94 		return (-1);
95 	}
96 	ifc.ifc_len = sizeof(ibuf);
97 	ifc.ifc_buf = (caddr_t)ibuf;
98 
99 	if (ioctl(fd, SIOCGIFCONF, (char *)&ifc) < 0) {
100 		if (errno == EINVAL)
101 			(void)sprintf(errbuf,
102 			    "SIOCGIFCONF: ifreq struct too small (%d bytes)",
103 			    sizeof(ibuf));
104 		else
105 			(void)sprintf(errbuf, "SIOCGIFCONF: %s",
106 			    strerror(errno));
107 		(void)close(fd);
108 		return (-1);
109 	}
110 	ifrp = ibuf;
111 	ifend = (struct ifreq *)((char *)ibuf + ifc.ifc_len);
112 
113 	al = ifaddrlist;
114 	mp = NULL;
115 	nipaddr = 0;
116 	for (; ifrp < ifend; ifrp = ifnext) {
117 #ifdef HAVE_SOCKADDR_SA_LEN
118 		n = _SIZEOF_ADDR_IFREQ(*ifrp);
119 		/*
120 		 * our ifreqs from SIOCGIFCONF dumps are very packed
121 		*/
122 		ifnext = (struct ifreq *)((char *)ifrp + n);
123 		if (ifrp->ifr_addr.sa_family != AF_INET)
124 			continue;
125 #else
126 		ifnext = ifrp + 1;
127 #endif
128 		/*
129 		 * Need a template to preserve address info that is
130 		 * used below to locate the next entry.  (Otherwise,
131 		 * SIOCGIFFLAGS stomps over it because the requests
132 		 * are returned in a union.)
133 		 */
134 		strncpy(ifr.ifr_name, ifrp->ifr_name, sizeof(ifr.ifr_name));
135 		if (ioctl(fd, SIOCGIFFLAGS, (char *)&ifr, sizeof(ifr)) < 0) {
136 			if (errno == ENXIO)
137 				continue;
138 			(void)sprintf(errbuf, "SIOCGIFFLAGS: %.*s: %s",
139 			    (int)sizeof(ifr.ifr_name), ifr.ifr_name,
140 			    strerror(errno));
141 			(void)close(fd);
142 			return (-1);
143 		}
144 
145 		/* Must be up */
146 		if ((ifr.ifr_flags & IFF_UP) == 0)
147 			continue;
148 
149 		/* don't use loopback */
150 		if ((ifr.ifr_flags & IFF_LOOPBACK) != 0)
151 			continue;
152 
153 		(void)strncpy(device, ifr.ifr_name, sizeof(ifr.ifr_name));
154 		device[sizeof(device) - 1] = '\0';
155 #ifdef sun
156 		/* Ignore sun virtual interfaces */
157 		if (strchr(device, ':') != NULL)
158 			continue;
159 #endif
160 		if (ioctl(fd, SIOCGIFADDR, (char *)&ifr, sizeof(ifr)) < 0) {
161 			(void)sprintf(errbuf, "SIOCGIFADDR: %s: %s",
162 			    device, strerror(errno));
163 			(void)close(fd);
164 			return (-1);
165 		}
166 
167 		if (nipaddr >= MAX_IPADDR) {
168 			(void)sprintf(errbuf, "Too many interfaces (%d)",
169 			    MAX_IPADDR);
170 			(void)close(fd);
171 			return (-1);
172 		}
173 		sin = (struct sockaddr_in *)&ifr.ifr_addr;
174 		al->addr = sin->sin_addr.s_addr;
175 		al->device = strdup(device);
176 		++al;
177 		++nipaddr;
178 	}
179 	(void)close(fd);
180 
181 	*ipaddrp = ifaddrlist;
182 	return (nipaddr);
183 }
184