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
|
/* $FreeBSD$ */
/*
* Copyright (C) 2002 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
#define PRINTF (void)printf
#define FPRINTF (void)fprintf
iphtable_t *printhash(hp, copyfunc, name, opts)
iphtable_t *hp;
copyfunc_t copyfunc;
char *name;
int opts;
{
iphtent_t *ipep, **table;
iphtable_t iph;
int i, printed;
size_t sz;
if ((*copyfunc)((char *)hp, (char *)&iph, sizeof(iph)))
return NULL;
if ((name != NULL) && strncmp(name, iph.iph_name, FR_GROUPLEN))
return iph.iph_next;
if ((opts & OPT_DEBUG) == 0) {
if ((iph.iph_type & IPHASH_ANON) == IPHASH_ANON)
PRINTF("# 'anonymous' table\n");
switch (iph.iph_type & ~IPHASH_ANON)
{
case IPHASH_LOOKUP :
PRINTF("table");
break;
case IPHASH_GROUPMAP :
PRINTF("group-map");
if (iph.iph_flags & FR_INQUE)
PRINTF(" in");
else if (iph.iph_flags & FR_OUTQUE)
PRINTF(" out");
else
PRINTF(" ???");
break;
default :
PRINTF("%#x", iph.iph_type);
break;
}
PRINTF(" role = ");
} else {
PRINTF("Hash Table Number: %s", iph.iph_name);
if ((iph.iph_type & IPHASH_ANON) == IPHASH_ANON)
PRINTF("(anon)");
putchar(' ');
PRINTF("Role: ");
}
switch (iph.iph_unit)
{
case IPL_LOGNAT :
PRINTF("nat");
break;
case IPL_LOGIPF :
PRINTF("ipf");
break;
case IPL_LOGAUTH :
PRINTF("auth");
break;
case IPL_LOGCOUNT :
PRINTF("count");
break;
default :
PRINTF("#%d", iph.iph_unit);
break;
}
if ((opts & OPT_DEBUG) == 0) {
if ((iph.iph_type & ~IPHASH_ANON) == IPHASH_LOOKUP)
PRINTF(" type = hash");
PRINTF(" number = %s size = %lu",
iph.iph_name, (u_long)iph.iph_size);
if (iph.iph_seed != 0)
PRINTF(" seed = %lu", iph.iph_seed);
putchar('\n');
} else {
PRINTF(" Type: ");
switch (iph.iph_type & ~IPHASH_ANON)
{
case IPHASH_LOOKUP :
PRINTF("lookup");
break;
case IPHASH_GROUPMAP :
PRINTF("groupmap Group. %s", iph.iph_name);
break;
default :
break;
}
putchar('\n');
PRINTF("\t\tSize: %lu\tSeed: %lu",
(u_long)iph.iph_size, iph.iph_seed);
PRINTF("\tRef. Count: %d\tMasks: %#x\n", iph.iph_ref,
iph.iph_masks);
}
if ((opts & OPT_DEBUG) != 0) {
struct in_addr m;
for (i = 0; i < 32; i++) {
if ((1 << i) & iph.iph_masks) {
ntomask(4, i, &m.s_addr);
PRINTF("\t\tMask: %s\n", inet_ntoa(m));
}
}
}
if ((opts & OPT_DEBUG) == 0)
PRINTF("\t{");
sz = iph.iph_size * sizeof(*table);
table = malloc(sz);
if ((*copyfunc)((char *)iph.iph_table, (char *)table, sz))
return NULL;
for (i = 0, printed = 0; i < iph.iph_size; i++) {
for (ipep = table[i]; ipep != NULL; ) {
ipep = printhashnode(&iph, ipep, copyfunc, opts);
printed++;
}
}
if (printed == 0)
putchar(';');
free(table);
if ((opts & OPT_DEBUG) == 0)
PRINTF(" };\n");
return iph.iph_next;
}
|
