1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263
|
/*
* The Wackamole Program.
*
* The contents of this file are subject to the CNDS Open Source
* License, Version 1.0 (the ``License''); you may not use
* this file except in compliance with the License. You may obtain a
* copy of the License at:
*
* http://www.backhand.org/wackamole/license/
*
* or in the file ``license.txt'' found in this distribution.
*
* Software distributed under the License is distributed on an AS IS basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Creators of Wackamole are:
* Yair Amir, Ryan Caudy, Aashima Munjal and Theo Schlossnagle.
*
* Copyright (C) 2000-2001 The Johns Hopkins University
* All Rights Reserved.
*
* This product uses the Spread toolkit, developed by Spread Concepts LLC.
* For more information about Spread see http://www.spread.org
*
* Wackamole development was partially funded by a grant from the Defense
* Advanced Research Projects Agency (DARPA) to Johns Hopkins University. The
* U.S. Government retains certain rights in this software.
*
*/
#include "config.h"
#include "alarm.h"
#include "arpcache.h"
#include "abt.h"
static int arpcache_psize = 0;
static address *arpcache_private = NULL;
static abt *arpcache_shared = NULL;
#define ROUNDUP(a) \
((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
#if defined(HAVE_PROC_NET_ARP)
void sample_arp_cache()
{
char line[200];
char ip[100];
int hw_type, flags;
char hw_address[100]; /* MAC address */
char mask[100];
char device[100];
FILE *fp;
int num,count=0;
int tmp_size;
/* read the arp cache entries from the kernel via /proc */
if ((fp = fopen("/proc/net/arp", "r")) == NULL) {
/* perror("can not read arp cache"); */
Alarm(DEBUG, "Can not read arp cache");
return;
}
/* start with the assumption that the old size is the new size */
tmp_size = arpcache_psize;
if (fgets(line, sizeof(line), fp) != (char *) NULL){ /* skip first line */
strcpy(mask, "-");
strcpy(device, "-");
/* read cache entries line by line */
for ( count=0; fgets(line, sizeof(line), fp);){
num = sscanf(line, "%s 0x%x 0x%x %100s %100s %100s",
ip, &hw_type, &flags, hw_address, mask, device);
if (num < 6)
break;
if( count+1 > tmp_size ){
if( tmp_size > 0 ){
tmp_size *= 2;
arpcache_private = realloc(arpcache_private,
sizeof(address)*(tmp_size+1));
} else {
tmp_size = 2;
arpcache_private = malloc(sizeof(address)*(tmp_size+1));
}
}
arpcache_private[count] = (address)inet_addr( ip );
count++;
}
}
if( count == 0 && arpcache_psize > 0 ){
arpcache_psize = 0;
if(arpcache_private) free(arpcache_private);
} else {
/* adjust array size (FIXME: should we really do this?) */
if( count != tmp_size ){
arpcache_private = realloc(arpcache_private,sizeof(address)*(count+1));
}
arpcache_psize = count;
arpcache_private[count] = 0;
}
fclose(fp);
}
#elif defined(CTL_NET)
void sample_arp_cache() {
int len = 0, count = 0;
struct rt_msghdr *rtm;
struct sockaddr_inarp *sa;
struct sockaddr_dl *sdl;
char *arpdata, *cp;
int mib[6] = { CTL_NET, PF_ROUTE, 0, AF_INET, NET_RT_FLAGS, RTF_LLINFO };
sysctl(mib, 6, NULL, &len, NULL, 0);
arpdata = malloc(len);
sysctl(mib, 6, arpdata, &len, NULL, 0);
for(cp = arpdata; cp < (arpdata+len); cp+=rtm->rtm_msglen) {
rtm = (struct rt_msghdr *)cp;
sa = (struct sockaddr_inarp *)(rtm+1);
(char *)sdl = (char *)sa + ROUNDUP(sa->sin_len);
count++;
}
if(arpcache_psize != count) {
if(arpcache_private) free(arpcache_private);
arpcache_private = malloc(sizeof(address)*(count+1));
arpcache_psize = count;
}
count = 0;
for(cp = arpdata; cp < (arpdata+len); cp+=rtm->rtm_msglen) {
rtm = (struct rt_msghdr *)cp;
sa = (struct sockaddr_inarp *)(rtm+1);
(char *)sdl = (char *)sa + ROUNDUP(sa->sin_len);
arpcache_private[count++] = sa->sin_addr.s_addr;
}
arpcache_private[count] = 0;
free(arpdata);
}
#elif defined(DL_UDERROR_IND)
void sample_arp_cache() {
static int s=-1;
dl_data_ack_ind_t *req;
dl_connect_res_t *ack;
struct strbuf buf;
int offset = 0;
char buffer[512];
char *dbuffer = NULL;
int flagsp = 0;
req = (dl_data_ack_ind_t *)buffer;
ack = (dl_connect_res_t *)buffer;
if(!arpcache_private) {
arpcache_psize = 2;
arpcache_private = malloc(arpcache_psize);
arpcache_private[0] = 0;
}
if(s < 0) {
if((s = open("/dev/ip", O_RDWR)) < 0) {
Alarm(PRINT, "open(\"/dev/ip\", O_RDWR) for arp collection failed: %s", strerror(errno));
return;
}
if(ioctl(s, I_PUSH, "arp") ||
ioctl(s, I_PUSH, "tcp") ||
ioctl(s, I_PUSH, "udp") ||
ioctl(s, I_PUSH, "icmp") ) {
Alarm(PRINT, "ioctl() failed: %s", strerror(errno));
close(s);
s = -1;
return;
}
}
req->dl_primitive = DL_UDERROR_IND;
req->dl_dest_addr_length = 0x0c;
req->dl_dest_addr_offset = 0x10;
req->dl_src_addr_length = 0x80;
req->dl_src_addr_offset = 0x104;
buf.maxlen = 0;
buf.len = sizeof(dl_data_ack_ind_t);
buf.buf = (caddr_t)req;
putmsg(s, &buf, NULL, 0);
buf.maxlen = sizeof(buffer);
buf.len = 0;
buf.buf = (caddr_t)ack;
while(1) {
int data[7];
buf.maxlen = sizeof(data);
buf.len = 0;
buf.buf = (caddr_t)data;
if(getmsg(s, &buf, NULL, &flagsp) != MOREDATA)
break;
if(dbuffer)
dbuffer = realloc(dbuffer, offset+data[6]);
else
dbuffer = malloc(offset+data[6]);
buf.maxlen = data[6];
buf.buf = (caddr_t)((char *)dbuffer + offset);
if(getmsg(s, NULL, &buf, &flagsp))
break;
offset+=data[6];
}
if(dbuffer) {
int r, count=0;
for(r=0; r<offset/4; r++) {
unsigned int *b = (int *)dbuffer+r;
unsigned char *h;
struct in_addr a;
if(b[0] == 0x8 && b[1] > 0x0 && b[1] < IFNAMSIZ) {
char *ifname = (char *)(b+2);
ifname[b[1]] = '\0';
b += 2;
b += IFNAMSIZ/sizeof(unsigned int);
b += 4; /* something else here */
if(*b != sizeof(ether_addr_t)) /* sizeof mac address */
continue;
h = (unsigned char *)(b+1);
if(b[11] != sizeof(struct in_addr)) /* sizeof ipv4 address */
continue;
a.s_addr = b[9]; /* the address */
if(count >= arpcache_psize) {
arpcache_psize <<= 1;
arpcache_private = realloc(arpcache_private, arpcache_psize);
}
arpcache_private[count++] = a.s_addr;
Alarm(ARPING, "Adding: (%s) %s [%02x:%02x:%02x:%02x:%02x:%02x]",
ifname, inet_ntoa(a),
*(h++), *(h++), *(h++), *(h++), *(h++), *(h++));
}
}
arpcache_private[count] = 0;
free(dbuffer);
}
}
#else
void sample_arp_cache() {
if(!arpcache_private) {
arpcache_psize = 0;
arpcache_private = malloc(sizeof(address));
arpcache_private[0] = 0;
}
}
#endif
void insert_arp_cache_shared(int a) {
struct in_addr ad;
ad.s_addr = a;
if(!arpcache_shared) arpcache_shared = new_abt();
Alarm(DEBUG, "Adding %s to the shared arp cache", inet_ntoa(ad));
add_abt(arpcache_shared, a);
}
address *reference_private_arp_cache() {
return arpcache_private;
}
address *fetch_shared_arp_cache() {
int n=0;
int *nl;
if(!arpcache_shared) arpcache_shared = new_abt();
n = arpcache_shared->size;
nl = malloc(sizeof(int) * (n+1));
memcpy(nl, arpcache_shared->data, sizeof(int)*n);
nl[n] = 0;
return nl;
}
|