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
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
|
/*
* Copyright (c) 1983 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 the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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 BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
char copyright[] =
"@(#) Copyright (c) 1983 Regents of the University of California.\n\
All rights reserved.\n";
#endif /* not lint */
#ifndef lint
/*static char sccsid[] = "from: @(#)htable.c 5.10 (Berkeley) 2/6/91";*/
static char rcsid[] = "$Id: htable.c,v 1.1 1995/10/18 08:47:36 deraadt Exp $";
#endif /* not lint */
/*
* htable - convert NIC host table into a UNIX format.
* NIC format is described in RFC 810, 1 March 1982.
*/
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <errno.h>
#include <netdb.h>
#include "htable.h" /* includes <sys/types.h> */
#include <sys/socket.h>
#include <arpa/inet.h>
#include <stdlib.h>
#define DATELINES 3 /* these lines usually contain the date */
#define MAXNETS 30 /* array size for local, connected nets */
FILE *hf; /* hosts file */
FILE *gf; /* gateways file */
FILE *nf; /* networks file */
struct gateway *savegateway(), *gatewayto();
int connected_nets[MAXNETS];
int nconnected;
int local_nets[MAXNETS];
int nlocal;
char *myname;
main(argc, argv)
int argc;
char *argv[];
{
int errs;
infile = "(stdin)";
myname = argv[0];
argc--;
argv++;
while (argc--) {
if (*argv[0] == '-') {
switch (argv[0][1]) {
case 'c':
nconnected = addlocal(argv[1], connected_nets);
argv++;
argc--;
break;
case 'l':
nlocal = addlocal(argv[1], local_nets);
argv++;
argc--;
break;
default:
usage();
/*NOTREACHED*/
}
} else {
infile = argv[0];
if (freopen(infile, "r", stdin) == NULL) {
perror(infile);
exit(1);
}
}
argv++;
}
hf = fopen("hosts", "w");
if (hf == NULL) {
perror("hosts");
exit(1);
}
copylocal(hf, "localhosts");
gf = fopen("gateways", "w");
if (gf == NULL) {
perror("gateways");
exit(1);
}
copygateways("localgateways");
nf = fopen("networks", "w");
if (nf == NULL) {
perror("networks");
exit(1);
}
copylocal(nf, "localnetworks");
copycomments(stdin, hf, DATELINES);
errs = yyparse();
dogateways();
exit(errs);
}
usage()
{
fprintf(stderr,
"usage: %s [ -c connected-nets ] [-l local-nets ] [ input-file ]\n",
myname);
exit(1);
}
/*
* Turn a comma-separated list of network names or numbers in dot notation
* (e.g. "arpanet, 128.32") into an array of net numbers.
*/
addlocal(arg, nets)
char *arg;
int *nets;
{
register char *p, c;
register int nfound = 0;
do {
p = arg;
while (*p && *p != ',' && !isspace(*p))
p++;
c = *p;
*p = 0;
while (*arg && isspace(*arg))
arg++;
if (*arg == 0)
continue;
if (nfound == MAXNETS) {
fprintf(stderr, "%s: Too many networks in list\n",
myname);
return (nfound);
}
if (getnetaddr(arg, &nets[nfound]))
nfound++;
else {
fprintf(stderr, "%s: %s: unknown network\n",
myname, arg);
exit(1);
}
arg = p + 1;
} while (c);
return (nfound);
}
struct name *
newname(str)
char *str;
{
char *p;
struct name *nm;
p = malloc(strlen(str) + 1);
strcpy(p, str);
nm = (struct name *)malloc(sizeof (struct name));
nm->name_val = p;
nm->name_link = NONAME;
return (nm);
}
char *
lower(str)
char *str;
{
register char *cp = str;
while (*cp) {
if (isupper(*cp))
*cp = tolower(*cp);
cp++;
}
return (str);
}
do_entry(keyword, addrlist, namelist, cputype, opsys, protos)
int keyword;
struct addr *addrlist;
struct name *namelist, *cputype, *opsys, *protos;
{
register struct addr *al, *al2;
register struct name *nl;
struct addr *connect_addr;
char *cp;
switch (keyword) {
case KW_NET:
nl = namelist;
if (nl == NONAME) {
fprintf(stderr, "htable: net");
putnet(stderr, inet_netof(addrlist->addr_val));
fprintf(stderr, " missing names.\n");
break;
}
fprintf(nf, "%-16.16s", lower(nl->name_val));
al2 = addrlist;
while (al = al2) {
char *cp;
putnet(nf, inet_netof(al->addr_val));
cp = "\t%s";
while (nl = nl->name_link) {
fprintf(nf, cp, lower(nl->name_val));
cp = " %s";
}
putc('\n', nf);
al2 = al->addr_link;
free((char *)al);
}
break;
case KW_GATEWAY:
/* locate locally connected address, if one */
for (al = addrlist; al; al = al->addr_link)
if (connectedto(inet_netof(al->addr_val)))
break;
if (al == NULL) {
/*
* Not connected to known networks. Save for later.
*/
struct gateway *gw, *firstgw = (struct gateway *) NULL;
for (al = addrlist; al; al = al->addr_link) {
register int net;
net = inet_netof(al->addr_val);
gw = savegateway(namelist, net,
al->addr_val, 0);
if (firstgw == (struct gateway *) NULL)
firstgw = gw;
gw->g_firstent = firstgw;
}
freeaddrs(addrlist);
goto dontfree;
}
/*
* Connected to a known network.
* Mark this as the gateway to all other networks
* that are on the addrlist (unless we already have
* gateways to them).
*/
connect_addr = al;
for (al = addrlist; al; al = al->addr_link) {
register int net;
/* suppress duplicates -- not optimal */
net = inet_netof(al->addr_val);
if (connectedto(net) || gatewayto(net))
continue;
printgateway(net, namelist->name_val, 1);
(void) savegateway(namelist, net, al->addr_val, 1);
}
/*
* Put the gateway in the hosts file.
*/
putaddr(hf, connect_addr->addr_val);
cp = "%s";
for (nl = namelist; nl; nl = nl->name_link) {
fprintf(hf, cp, lower(nl->name_val));
cp = " %s";
}
fprintf(hf, "\t# gateway\n");
freeaddrs(addrlist);
goto dontfree;
case KW_HOST:
al2 = addrlist;
while (al = al2) {
if (!local(inet_netof(al->addr_val))) {
char *cp;
putaddr(hf, al->addr_val);
cp = "%s";
for (nl = namelist; nl; nl = nl->name_link) {
fprintf(hf, cp, lower(nl->name_val));
cp = " %s";
}
putc('\n', hf);
}
al2 = al->addr_link;
free((char *)al);
}
break;
default:
fprintf(stderr, "Unknown keyword: %d.\n", keyword);
}
freenames(namelist);
dontfree:
freenames(protos);
}
printgateway(net, name, metric)
int net;
char *name;
int metric;
{
struct netent *np;
fprintf(gf, "net ");
np = getnetbyaddr(net, AF_INET);
if (np)
fprintf(gf, "%s", np->n_name);
else
putnet(gf, net);
fprintf(gf, " gateway %s metric %d passive\n",
lower(name), metric);
}
copylocal(f, filename)
FILE *f;
char *filename;
{
register FILE *lhf;
register cc;
char buf[BUFSIZ];
extern int errno;
lhf = fopen(filename, "r");
if (lhf == NULL) {
if (errno != ENOENT) {
perror(filename);
exit(1);
}
fprintf(stderr, "Warning, no %s file.\n", filename);
return;
}
while (cc = fread(buf, 1, sizeof(buf), lhf))
fwrite(buf, 1, cc, f);
fclose(lhf);
}
copygateways(filename)
char *filename;
{
register FILE *lhf;
struct name *nl;
char type[80];
char dname[80];
char gname[80];
char junk[80];
char buf[500];
struct in_addr addr;
int net, metric;
extern int errno;
lhf = fopen(filename, "r");
if (lhf == NULL) {
if (errno != ENOENT) {
perror(filename);
exit(1);
}
fprintf(stderr, "Warning, no %s file.\n", filename);
return;
}
/* format: {net | host} XX gateway XX metric DD [passive]\n */
for (;;) {
junk[0] = 0;
if (fgets(buf, sizeof(buf), lhf) == (char *)NULL)
break;
fputs(buf, gf);
if (buf[0] == '#' ||
sscanf(buf, "%s %s gateway %s metric %d %s",
type, dname, gname, &metric, junk) < 5)
continue;
if (strcmp(type, "net"))
continue;
if (!getnetaddr(dname, &net))
continue;
if (!gethostaddr(gname, &addr.s_addr))
continue;
nl = newname(gname);
(void) savegateway(nl, net, addr, metric);
}
fclose(lhf);
}
getnetaddr(name, addr)
char *name;
int *addr;
{
struct netent *np = getnetbyname(name);
if (np == 0) {
*addr = inet_network(name);
return (*addr != -1);
} else {
if (np->n_addrtype != AF_INET)
return (0);
*addr = np->n_net;
return (1);
}
}
gethostaddr(name, addr)
char *name;
u_long *addr;
{
struct hostent *hp;
hp = gethostbyname(name);
if (hp) {
*addr = *(u_long *)(hp->h_addr);
return (1);
}
*addr = inet_addr(name);
return (*addr != -1);
}
copycomments(in, out, ccount)
FILE *in, *out;
int ccount;
{
int count;
char buf[BUFSIZ], *fgets();
for (count=0; count < ccount; count++) {
if ((fgets(buf, sizeof(buf), in) == NULL) || (buf[0] != ';'))
return;
buf[0] = '#';
fputs(buf, out);
}
return;
}
#define UC(b) (((int)(b))&0xff)
/*
* Print network number in internet-standard dot notation;
* v is in host byte order.
*/
putnet(f, v)
FILE *f;
register int v;
{
if (v < 128)
fprintf(f, "%d", v);
else if (v < 65536)
fprintf(f, "%d.%d", UC(v >> 8), UC(v));
else
fprintf(f, "%d.%d.%d", UC(v >> 16), UC(v >> 8), UC(v));
}
putaddr(f, v)
FILE *f;
struct in_addr v;
{
fprintf(f, "%-16.16s", inet_ntoa(v));
}
freenames(list)
struct name *list;
{
register struct name *nl, *nl2;
nl2 = list;
while (nl = nl2) {
nl2 = nl->name_link;
free(nl->name_val);
free((char *)nl);
}
}
freeaddrs(list)
struct addr *list;
{
register struct addr *al, *al2;
al2 = list;
while (al = al2)
al2 = al->addr_link, free((char *)al);
}
struct gateway *gateways = 0;
struct gateway *lastgateway = 0;
struct gateway *
gatewayto(net)
register int net;
{
register struct gateway *gp;
for (gp = gateways; gp; gp = gp->g_link)
if ((gp->g_net == net) && (gp->g_metric > 0))
return (gp);
return ((struct gateway *) NULL);
}
struct gateway *
savegateway(namelist, net, addr, metric)
struct name *namelist;
struct in_addr addr;
int net, metric;
{
register struct gateway *gp;
gp = (struct gateway *)malloc(sizeof (struct gateway));
if (gp == 0) {
fprintf(stderr, "htable: out of memory\n");
exit(1);
}
gp->g_link = (struct gateway *) NULL;
if (lastgateway)
lastgateway->g_link = gp;
else
gateways = gp;
lastgateway = gp;
gp->g_name = namelist;
gp->g_net = net;
gp->g_addr = addr;
gp->g_metric = metric;
if (metric == 1)
gp->g_dst = gp;
return (gp);
}
connectedto(net)
u_long net;
{
register i;
for (i = 0; i < nconnected; i++)
if (connected_nets[i] == net)
return(1);
return(0);
}
local(net)
u_long net;
{
register i;
for (i = 0; i < nlocal; i++)
if (local_nets[i] == net)
return(1);
return(0);
}
#define MAXHOPS 10
/*
* Go through list of gateways, finding connections for gateways
* that are not yet connected.
*/
dogateways()
{
register struct gateway *gp, *gw, *ggp;
register int hops, changed = 1;
struct name *nl;
char *cp;
for (hops = 0; hops < MAXHOPS && changed; hops++, changed = 0) {
for (gp = gateways; gp; gp = gp->g_link)
if ((gp->g_metric == 0) && (gw = gatewayto(gp->g_net))) {
/*
* Found a new connection.
* For each other network that this gateway is on,
* add a new gateway to that network.
*/
changed = 1;
gp->g_dst = gw->g_dst;
gp->g_metric = gw->g_metric + 1;
for (ggp = gp->g_firstent; ggp->g_name == gp->g_name;
ggp = ggp->g_link) {
if (ggp == gp)
continue;
if (gatewayto(ggp->g_net))
continue;
ggp->g_dst = gp->g_dst;
ggp->g_metric = gp->g_metric;
printgateway(ggp->g_net,
gw->g_dst->g_name->name_val, gp->g_metric);
}
/*
* Put the gateway in the hosts file,
* using the address for the connected net.
*/
putaddr(hf, gp->g_addr);
cp = "%s";
for (nl = gp->g_name; nl; nl = nl->name_link) {
fprintf(hf, cp, lower(nl->name_val));
cp = " %s";
}
fprintf(hf, "\t# gateway\n");
}
}
}
|