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 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407
|
/*
* Copyright (c) 1990, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that: (1) source code distributions
* retain the above copyright notice and this paragraph in its entirety, (2)
* distributions including binary code include the above copyright notice and
* this paragraph in its entirety in the documentation or other materials
* provided with the distribution, and (3) all advertising materials mentioning
* features or use of this software display the following acknowledgement:
* ``This product includes software developed by the University of California,
* Lawrence Berkeley Laboratory and its contributors.'' Neither the name of
* the University nor the names of its contributors may be used to endorse
* or promote products derived from this software without specific prior
* written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
#ifndef lint
static const char rcsid[] =
"@(#) $Id: db.c,v 1.34 2000/09/30 23:39:57 leres Exp $ (LBL)";
#endif
/*
* db - arpwatch database routines
*/
#include <sys/types.h>
#include <netinet/in.h>
#include <ctype.h>
#ifdef HAVE_MEMORY_H
#include <memory.h>
#endif
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <unistd.h>
#include "gnuc.h"
#ifdef HAVE_OS_PROTO_H
#include "os-proto.h"
#endif
#include "arpwatch.h"
#include "db.h"
#include "dns.h"
#include "ec.h"
#include "report.h"
#include "util.h"
#define HASHSIZE (2 << 15)
#define NEWACTIVITY_DELTA (6*30*24*60*60) /* 6 months in seconds */
#define FLIPFLIP_DELTA (24*60*60) /* 24 hours in seconds */
/* Ethernet info */
struct einfo {
u_char e[6]; /* ether address */
char h[34]; /* simple hostname */
time_t t; /* timestamp */
char i[16]; /* interface */
};
/* Address info */
struct ainfo {
u_int32_t a; /* ip address */
struct einfo **elist; /* array of pointers */
int ecount; /* elements in use of elist */
int esize; /* size of elist */
struct ainfo *next;
};
/* Address hash table */
static struct ainfo ainfo_table[HASHSIZE];
static void alist_alloc(struct ainfo *);
int cmpeinfo(const void *, const void *);
static struct einfo *elist_alloc(u_int32_t, u_char *, time_t, char *, char *);
static struct ainfo *ainfo_find(u_int32_t);
static void check_hname(struct ainfo *);
struct ainfo *newainfo(void);
int
ent_add(register u_int32_t a, register u_char *e, time_t t, register char *h,
char *interface)
{
register struct ainfo *ap;
register struct einfo *ep;
register int i;
register u_int len;
u_char *e2;
time_t t2;
/* Ignore 0.0.0.0 */
if (a == 0) {
return(1);
}
/* Lookup ip address */
ap = ainfo_find(a);
/* Check for the usual case first */
if (ap->ecount > 0) {
ep = ap->elist[0];
if (MEMCMP(e, ep->e, 6) == 0) {
if (t - ep->t > NEWACTIVITY_DELTA) {
report("new activity", a, e, NULL, &t, &ep->t,
interface);
check_hname(ap);
}
ep->t = t;
return (1);
}
}
/* Check for a virgin ainfo record */
if (ap->ecount == 0) {
ap->ecount = 1;
ap->elist[0] = elist_alloc(a, e, t, h, interface);
report("new station", a, e, NULL, &t, NULL, interface);
return (1);
}
/* Check for a flip-flop */
if (ap->ecount > 1) {
ep = ap->elist[1];
if (MEMCMP(e, ep->e, 6) == 0) {
/*
* Suppress report when less than
* FLIPFLOP_DELTA and one of the two ethernet
* addresses is a DECnet logical.
*/
t2 = ap->elist[0]->t;
e2 = ap->elist[0]->e;
if (t - t2 < FLIPFLIP_DELTA &&
(isdecnet(e) || isdecnet(e2)))
dosyslog(LOG_INFO,
"suppressed DECnet flip flop", a, e, e2,
interface);
else
report("flip flop", a, e, e2, &t, &t2,
interface);
ap->elist[1] = ap->elist[0];
ap->elist[0] = ep;
ep->t = t;
check_hname(ap);
return (1);
}
}
for (i = 2; i < ap->ecount; ++i) {
ep = ap->elist[i];
if (MEMCMP(e, ep->e, 6) == 0) {
/* An old entry comes to life */
e2 = ap->elist[0]->e;
t2 = ap->elist[0]->t;
dosyslog(LOG_NOTICE, "reused old ethernet address",
a, e, e2, interface);
/* Shift entries down */
len = i * sizeof(ap->elist[0]);
BCOPY(&ap->elist[0], &ap->elist[1], len);
ap->elist[0] = ep;
ep->t = t;
check_hname(ap);
return (1);
}
}
/* New ether address */
e2 = ap->elist[0]->e;
t2 = ap->elist[0]->t;
report("changed ethernet address", a, e, e2, &t, &t2, interface);
/* Make room at head of list */
alist_alloc(ap);
len = ap->ecount * sizeof(ap->elist[0]);
BCOPY(&ap->elist[0], &ap->elist[1], len);
ap->elist[0] = elist_alloc(a, e, t, h, interface);
++ap->ecount;
return (1);
}
static struct ainfo *
ainfo_find(register u_int32_t a)
{
register u_int size;
register struct ainfo *ap;
ap = &ainfo_table[a & (HASHSIZE - 1)];
for (;;) {
if (ap->esize == 0) {
/* Emtpy cell; use it */
ap->a = a;
break;
}
if (a == ap->a)
break;
if (ap->next != NULL) {
/* Try linked cell */
ap = ap->next;
continue;
}
/* We collided, allocate new struct */
ap->next = newainfo();
ap = ap->next;
ap->a = a;
break;
}
if (ap->esize == 0) {
ap->esize = 2;
size = sizeof(ap->elist[0]) * ap->esize;
ap->elist = (struct einfo **)malloc(size);
if (ap->elist == NULL) {
syslog(LOG_ERR, "ainfo_find(): malloc: %m");
exit(1);
}
MEMSET(ap->elist, 0, size);
}
return (ap);
}
int
ent_loop(ent_process fn)
{
register int i, j, n;
register struct ainfo *ap;
register struct einfo *ep;
n = 0;
for (i = 0; i < HASHSIZE; ++i)
for (ap = &ainfo_table[i]; ap != NULL; ap = ap->next)
for (j = 0; j < ap->ecount; ++j) {
ep = ap->elist[j];
(*fn)(ap->a, ep->e, ep->t, ep->h, ep->i);
++n;
}
return (n);
}
/* Insure enough room for at least one more einfo pointer */
static void
alist_alloc(register struct ainfo *ap)
{
register u_int size;
if (ap->esize == 0) {
syslog(LOG_ERR, "alist_alloc(): esize 0, can't happen");
exit(1);
}
if (ap->ecount < ap->esize)
return;
ap->esize += 2;
size = ap->esize * sizeof(ap->elist[0]);
ap->elist = (struct einfo **)realloc(ap->elist, size);
if (ap->elist == NULL) {
syslog(LOG_ERR, "alist_alloc(): realloc(): %m");
exit(1);
}
size = (ap->esize - ap->ecount) * sizeof(ap->elist[0]);
MEMSET(&ap->elist[ap->ecount], 0, size);
}
/* Allocate and initialize a elist struct */
static struct einfo *
elist_alloc(register u_int32_t a, register u_char *e, register time_t t,
register char *h, char *interface)
{
register struct einfo *ep;
register u_int size;
static struct einfo *elist = NULL;
static int eleft = 0;
if (eleft <= 0) {
/* Allocate some more */
eleft = 16;
size = eleft * sizeof(struct einfo);
elist = (struct einfo *)malloc(size);
if (elist == NULL) {
syslog(LOG_ERR, "elist_alloc(): malloc: %m");
exit(1);
}
MEMSET(elist, 0, size);
}
ep = elist++;
--eleft;
BCOPY(e, ep->e, 6);
if (h == NULL && !initializing)
h = getsname(a);
if (h != NULL && !isdigit((int)*h)) {
strncpy(ep->h, h, 34);
ep->h[33] = '\0';
}
ep->t = t;
if (interface != NULL) {
strncpy(ep->i, interface, 16);
ep->i[15] = '\0';
}
return (ep);
}
/* Check to see if the simple hostname needs updating; syslog if so */
static void
check_hname(register struct ainfo *ap)
{
register struct einfo *ep;
register char *h;
/* Don't waste time if we're loading the initial arp.dat */
if (initializing)
return;
ep = ap->elist[0];
h = getsname(ap->a);
if (!isdigit((int)*h) && strcmp(h, ep->h) != 0) {
syslog(LOG_INFO, "hostname changed %s %s %s -> %s",
intoa(ap->a), e2str(ep->e), ep->h, h);
strncpy(ep->h, h, 34);
ep->h[33] = '\0';
}
}
int
cmpeinfo(register const void *p1, register const void *p2)
{
register time_t t1, t2;
t1 = (*(struct einfo **)p1)->t;
t2 = (*(struct einfo **)p2)->t;
if (t1 > t2)
return (-1);
if (t1 < t2)
return (1);
return (0);
}
void
sorteinfo(void)
{
register int i;
register struct ainfo *ap;
for (i = 0; i < HASHSIZE; ++i)
for (ap = &ainfo_table[i]; ap != NULL; ap = ap->next)
if (ap->ecount > 0)
qsort(ap->elist, ap->ecount,
sizeof(ap->elist[0]), cmpeinfo);
}
struct ainfo *
newainfo(void)
{
register struct ainfo *ap;
register u_int size;
static struct ainfo *ainfoptr = NULL;
static u_int ainfosize = 0;
if (ainfosize == 0) {
ainfosize = 512;
size = ainfosize * sizeof(*ap);
ap = (struct ainfo *)malloc(size);
if (ap == NULL) {
syslog(LOG_ERR, "newainfo(): malloc: %m");
exit(1);
}
memset((char *)ap, 0, size);
ainfoptr = ap;
}
ap = ainfoptr++;
--ainfosize;
return (ap);
}
#ifdef DEBUG
void
debugdump(void)
{
register int i, j;
register time_t t;
register struct ainfo *ap;
register struct einfo *ep;
for (i = 0; i < HASHSIZE; ++i)
for (ap = &ainfo_table[i]; ap != NULL; ap = ap->next) {
if (ap->esize == 0)
continue;
if (ap->ecount == 0) {
printf("%s\n", intoa(ap->a));
continue;
}
t = 0;
for (j = 0; j < ap->ecount; ++j) {
ep = ap->elist[j];
if (t != 0 && t < ep->t)
printf("*");
printf("%s\t%s\t%u\t%s\n", intoa(ap->a),
e2str(ep->e), (u_int)ep->t, ep->h);
t = ep->t;
}
}
}
#endif
|