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
|
/* $OpenBSD: pfvar.h,v 1.61 2002/01/11 20:13:11 mickey Exp $ */
/*
* Copyright (c) 2001 Daniel Hartmeier
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* - 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.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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
* COPYRIGHT HOLDERS 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 _NET_PFVAR_H_
#define _NET_PFVAR_H_
#include <sys/types.h>
#include <sys/queue.h>
enum { PF_IN=0, PF_OUT=1 };
enum { PF_PASS=0, PF_DROP=1, PF_SCRUB=2 };
enum { PF_OP_IRG=1, PF_OP_EQ=2, PF_OP_NE=3, PF_OP_LT=4,
PF_OP_LE=5, PF_OP_GT=6, PF_OP_GE=7, PF_OP_XRG=8 };
enum { PF_DEBUG_NONE=0, PF_DEBUG_URGENT=1, PF_DEBUG_MISC=2 };
enum { PF_CHANGE_ADD_HEAD=1, PF_CHANGE_ADD_TAIL=2,
PF_CHANGE_ADD_BEFORE=3, PF_CHANGE_ADD_AFTER=4,
PF_CHANGE_REMOVE=5 };
enum { PFTM_TCP_FIRST_PACKET=0, PFTM_TCP_OPENING=1, PFTM_TCP_ESTABLISHED=2,
PFTM_TCP_CLOSING=3, PFTM_TCP_FIN_WAIT=4, PFTM_TCP_CLOSED=5,
PFTM_UDP_FIRST_PACKET=6, PFTM_UDP_SINGLE=7, PFTM_UDP_MULTIPLE=8,
PFTM_ICMP_FIRST_PACKET=9, PFTM_ICMP_ERROR_REPLY=10,
PFTM_OTHER_FIRST_PACKET=11, PFTM_OTHER_SINGLE=12,
PFTM_OTHER_MULTIPLE=13, PFTM_FRAG=14, PFTM_INTERVAL=15, PFTM_MAX=16 };
enum { PF_FASTROUTE=1, PF_ROUTETO=2, PF_DUPTO=3 };
struct pf_addr {
union {
struct in_addr v4;
struct in6_addr v6;
u_int8_t addr8[16];
u_int16_t addr16[8];
u_int32_t addr32[4];
} pfa; /* 128-bit address */
#define v4 pfa.v4
#define v6 pfa.v6
#define addr8 pfa.addr8
#define addr16 pfa.addr16
#define addr32 pfa.addr32
};
/*
* Address manipulation macros
*/
#ifdef _KERNEL
#ifdef INET
#ifndef INET6
#define PF_INET_ONLY
#endif /* ! INET6 */
#endif /* INET */
#ifdef INET6
#ifndef INET
#define PF_INET6_ONLY
#endif /* ! INET */
#endif /* INET6 */
#ifdef INET
#ifdef INET6
#define PF_INET_INET6
#endif /* INET6 */
#endif /* INET */
#else
#define PF_INET_INET6
#endif /* _KERNEL */
/* Both IPv4 and IPv6 */
#ifdef PF_INET_INET6
#define PF_AEQ(a, b, c) \
((c == AF_INET && (a)->addr32[0] == (b)->addr32[0]) || \
(c == AF_INET6 && (a)->addr32[0] == (b)->addr32[0] && \
(a)->addr32[1] == (b)->addr32[1] && \
(a)->addr32[2] == (b)->addr32[2] && \
(a)->addr32[3] == (b)->addr32[3])) \
#define PF_ANEQ(a, b, c) \
((c == AF_INET && (a)->addr32[0] != (b)->addr32[0]) || \
(c == AF_INET6 && ((a)->addr32[0] != (b)->addr32[0] || \
(a)->addr32[1] != (b)->addr32[1] || \
(a)->addr32[2] != (b)->addr32[2] || \
(a)->addr32[3] != (b)->addr32[3]))) \
#define PF_AZERO(a, c) \
((c == AF_INET && !(a)->addr32[0]) || \
(c == AF_INET6 && !(a)->addr32[0] && \
!(a)->addr32[1] && !(a)->addr32[2] && \
!(a)->addr32[3] )) \
#define PF_MATCHA(n, a, m, b, f) \
pf_match_addr(n, a, m, b, f)
#define PF_ACPY(a, b, f) \
pf_addrcpy(a, b, f)
#else
/* Just IPv6 */
#ifdef PF_INET6_ONLY
#define PF_AEQ(a, b, c) \
((a)->addr32[0] == (b)->addr32[0] && \
(a)->addr32[1] == (b)->addr32[1] && \
(a)->addr32[2] == (b)->addr32[2] && \
(a)->addr32[3] == (b)->addr32[3]) \
#define PF_ANEQ(a, b, c) \
((a)->addr32[0] != (b)->addr32[0] || \
(a)->addr32[1] != (b)->addr32[1] || \
(a)->addr32[2] != (b)->addr32[2] || \
(a)->addr32[3] != (b)->addr32[3]) \
#define PF_AZERO(a, c) \
(!(a)->addr32[0] && \
!(a)->addr32[1] && \
!(a)->addr32[2] && \
!(a)->addr32[3] ) \
#define PF_MATCHA(n, a, m, b, f) \
pf_match_addr(n, a, m, b, f)
#define PF_ACPY(a, b, f) \
pf_addrcpy(a, b, f)
#else
/* Just IPv4 */
#ifdef PF_INET_ONLY
#define PF_AEQ(a, b, c) \
((a)->addr32[0] == (b)->addr32[0])
#define PF_ANEQ(a, b, c) \
((a)->addr32[0] != (b)->addr32[0])
#define PF_AZERO(a, c) \
(!(a)->addr32[0])
#define PF_MATCHA(n, a, m, b, f) \
pf_match_addr(n, a, m, b, f)
#define PF_ACPY(a, b, f) \
(a)->v4.s_addr = (b)->v4.s_addr
#endif /* PF_INET_ONLY */
#endif /* PF_INET6_ONLY */
#endif /* PF_INET_INET6 */
struct pf_rule_addr {
struct pf_addr addr;
struct pf_addr mask;
u_int16_t port[2];
u_int8_t not;
u_int8_t port_op;
};
struct pf_rule {
char ifname[IFNAMSIZ];
char rt_ifname[IFNAMSIZ];
#define PF_RULE_LABEL_SIZE 32
char label[PF_RULE_LABEL_SIZE];
struct ifnet *ifp;
struct ifnet *rt_ifp;
struct pf_rule_addr src;
struct pf_rule_addr dst;
struct pf_addr rt_addr;
#define PF_SKIP_IFP 0
#define PF_SKIP_AF 1
#define PF_SKIP_PROTO 2
#define PF_SKIP_SRC_ADDR 3
#define PF_SKIP_SRC_PORT 4
#define PF_SKIP_DST_ADDR 5
#define PF_SKIP_DST_PORT 6
#define PF_SKIP_COUNT 7
struct pf_rule *skip[PF_SKIP_COUNT];
TAILQ_ENTRY(pf_rule) entries;
u_int64_t evaluations;
u_int64_t packets;
u_int64_t bytes;
u_int16_t nr;
u_int16_t return_icmp;
u_int8_t action;
u_int8_t direction;
u_int8_t log;
u_int8_t quick;
#define PF_STATE_NORMAL 0x1
#define PF_STATE_MODULATE 0x2
u_int8_t keep_state;
u_int8_t af;
u_int8_t proto;
u_int8_t type;
u_int8_t code;
u_int8_t flags;
u_int8_t flagset;
u_int8_t rule_flag;
u_int8_t min_ttl; /* minimum ttl for packet normalize */
u_int8_t allow_opts;
u_int8_t rt;
};
#define PFRULE_RETURNRST 0x01
#define PFRULE_NODF 0x02
struct pf_state_host {
struct pf_addr addr;
u_int16_t port;
u_int16_t pad;
};
struct pf_state_peer {
u_int32_t seqlo; /* Max sequence number sent */
u_int32_t seqhi; /* Max the other end ACKd + win */
u_int32_t seqdiff; /* Sequence number modulator */
u_int16_t max_win;
u_int8_t state;
u_int8_t pad;
};
struct pf_state {
TAILQ_ENTRY(pf_state) entries;
struct pf_state_host lan;
struct pf_state_host gwy;
struct pf_state_host ext;
struct pf_state_peer src;
struct pf_state_peer dst;
struct pf_rule *rule;
u_int32_t creation;
u_int32_t expire;
u_int32_t packets;
u_int32_t bytes;
u_int8_t af;
u_int8_t proto;
u_int8_t direction;
u_int8_t log;
u_int8_t allow_opts;
};
#define MATCH_TUPLE(h,r,d,i,a) \
( \
(r->direction == d) && \
(r->ifp == NULL || r->ifp == i) && \
(!r->proto || r->proto == h->ip_p) && \
(!r->src.mask.addr32[0] || \
pf_match_addr(r->src.not, &(r)->src.addr, \
&(r)->src.mask, (struct pf_addr *)&h->ip_src.s_addr, a)) && \
(!r->dst.mask.addr32[0] || \
pf_match_addr(r->dst.not, &(r)->dst.addr, \
&(r)->dst.mask, (struct pf_addr *)&h->ip_dst.s_addr, a)) \
)
struct pf_nat {
char ifname[IFNAMSIZ];
struct ifnet *ifp;
TAILQ_ENTRY(pf_nat) entries;
struct pf_addr saddr;
struct pf_addr smask;
struct pf_addr daddr;
struct pf_addr dmask;
struct pf_addr raddr;
u_int8_t af;
u_int8_t proto;
u_int8_t snot;
u_int8_t dnot;
u_int8_t ifnot;
u_int8_t no;
};
struct pf_binat {
char ifname[IFNAMSIZ];
struct ifnet *ifp;
TAILQ_ENTRY(pf_binat) entries;
struct pf_addr saddr;
struct pf_addr daddr;
struct pf_addr dmask;
struct pf_addr raddr;
u_int8_t af;
u_int8_t proto;
u_int8_t dnot;
u_int8_t no;
};
struct pf_rdr {
char ifname[IFNAMSIZ];
struct ifnet *ifp;
TAILQ_ENTRY(pf_rdr) entries;
struct pf_addr saddr;
struct pf_addr smask;
struct pf_addr daddr;
struct pf_addr dmask;
struct pf_addr raddr;
u_int16_t dport;
u_int16_t dport2;
u_int16_t rport;
u_int8_t af;
u_int8_t proto;
u_int8_t snot;
u_int8_t dnot;
u_int8_t ifnot;
u_int8_t opts;
u_int8_t no;
};
struct pf_tree_key {
struct pf_addr addr[2];
u_int16_t port[2];
u_int8_t proto;
u_int8_t af;
};
TAILQ_HEAD(pf_rulequeue, pf_rule);
struct pf_pdesc {
struct pf_addr *src;
struct pf_addr *dst;
u_int16_t *ip_sum;
u_int64_t tot_len; /* Make Mickey money */
u_int32_t p_len; /* total length of payload */
u_int16_t flags; /* Let SCRUB trigger behavior in
* state code. Easier than tags */
u_int8_t af;
u_int8_t proto;
union {
struct tcphdr *tcp;
struct udphdr *udp;
struct icmp *icmp;
#ifdef INET6
struct icmp6_hdr *icmp6;
#endif /* INET6 */
void *any;
} hdr;
};
/* flags for RDR options */
#define PF_DPORT_RANGE 0x01 /* Dest port uses range */
#define PF_RPORT_RANGE 0x02 /* RDR'ed port uses range */
/* Reasons code for passing/dropping a packet */
#define PFRES_MATCH 0 /* Explicit match of a rule */
#define PFRES_BADOFF 1 /* Bad offset for pull_hdr */
#define PFRES_FRAG 2 /* Dropping following fragment */
#define PFRES_SHORT 3 /* Dropping short packet */
#define PFRES_NORM 4 /* Dropping by normalizer */
#define PFRES_MEMORY 5 /* Dropped due to lacking mem */
#define PFRES_MAX 6 /* total+1 */
#define PFRES_NAMES { \
"match", \
"bad-offset", \
"fragment", \
"short", \
"normalize", \
"memory", \
NULL \
}
#define FCNT_STATE_SEARCH 0
#define FCNT_STATE_INSERT 1
#define FCNT_STATE_REMOVALS 2
#define FCNT_MAX 3
#define FCNT_NAMES { \
"state searches", \
"state inserts", \
"state removals", \
NULL \
}
#define ACTION_SET(a, x) \
do { \
if ((a) != NULL) \
*(a) = (x); \
} while (0)
#define REASON_SET(a, x) \
do { \
if ((a) != NULL) \
*(a) = (x); \
if (x < PFRES_MAX) \
pf_status.counters[x]++; \
} while (0)
struct pf_status {
u_int64_t counters[PFRES_MAX];
u_int64_t fcounters[FCNT_MAX];
u_int64_t pcounters[2][2][3];
u_int64_t bcounters[2][2];
u_int32_t running;
u_int32_t states;
u_int32_t since;
u_int32_t debug;
};
/*
* ioctl parameter structures
*/
struct pfioc_rule {
u_int32_t ticket;
u_int32_t nr;
struct pf_rule rule;
};
struct pfioc_changerule {
u_int32_t action;
struct pf_rule oldrule;
struct pf_rule newrule;
};
struct pfioc_nat {
u_int32_t ticket;
u_int32_t nr;
struct pf_nat nat;
};
struct pfioc_changenat {
u_int32_t action;
struct pf_nat oldnat;
struct pf_nat newnat;
};
struct pfioc_natlook {
struct pf_addr saddr;
struct pf_addr daddr;
struct pf_addr rsaddr;
struct pf_addr rdaddr;
u_int16_t sport;
u_int16_t dport;
u_int16_t rsport;
u_int16_t rdport;
u_int8_t af;
u_int8_t proto;
u_int8_t direction;
};
struct pfioc_binat {
u_int32_t ticket;
u_int32_t nr;
struct pf_binat binat;
};
struct pfioc_changebinat {
u_int32_t action;
struct pf_binat oldbinat;
struct pf_binat newbinat;
};
struct pfioc_rdr {
u_int32_t ticket;
u_int32_t nr;
struct pf_rdr rdr;
};
struct pfioc_changerdr {
u_int32_t action;
struct pf_rdr oldrdr;
struct pf_rdr newrdr;
};
struct pfioc_state {
u_int32_t nr;
struct pf_state state;
};
struct pfioc_states {
int ps_len;
union {
caddr_t psu_buf;
struct pf_state *psu_states;
} ps_u;
#define ps_buf ps_u.psu_buf
#define ps_states ps_u.psu_states
};
struct pfioc_if {
char ifname[IFNAMSIZ];
};
struct pfioc_tm {
int timeout;
int seconds;
};
/*
* ioctl operations
*/
#define DIOCSTART _IO ('D', 1)
#define DIOCSTOP _IO ('D', 2)
#define DIOCBEGINRULES _IOWR('D', 3, u_int32_t)
#define DIOCADDRULE _IOWR('D', 4, struct pfioc_rule)
#define DIOCCOMMITRULES _IOWR('D', 5, u_int32_t)
#define DIOCGETRULES _IOWR('D', 6, struct pfioc_rule)
#define DIOCGETRULE _IOWR('D', 7, struct pfioc_rule)
#define DIOCBEGINNATS _IOWR('D', 8, u_int32_t)
#define DIOCADDNAT _IOWR('D', 9, struct pfioc_nat)
#define DIOCCOMMITNATS _IOWR('D', 10, u_int32_t)
#define DIOCGETNATS _IOWR('D', 11, struct pfioc_nat)
#define DIOCGETNAT _IOWR('D', 12, struct pfioc_nat)
#define DIOCBEGINRDRS _IOWR('D', 13, u_int32_t)
#define DIOCADDRDR _IOWR('D', 14, struct pfioc_rdr)
#define DIOCCOMMITRDRS _IOWR('D', 15, u_int32_t)
#define DIOCGETRDRS _IOWR('D', 16, struct pfioc_rdr)
#define DIOCGETRDR _IOWR('D', 17, struct pfioc_rdr)
#define DIOCCLRSTATES _IO ('D', 18)
#define DIOCGETSTATE _IOWR('D', 19, struct pfioc_state)
#define DIOCSETSTATUSIF _IOWR('D', 20, struct pfioc_if)
#define DIOCGETSTATUS _IOWR('D', 21, struct pf_status)
#define DIOCCLRSTATUS _IO ('D', 22)
#define DIOCNATLOOK _IOWR('D', 23, struct pfioc_natlook)
#define DIOCSETDEBUG _IOWR('D', 24, u_int32_t)
#define DIOCGETSTATES _IOWR('D', 25, struct pfioc_states)
#define DIOCCHANGERULE _IOWR('D', 26, struct pfioc_changerule)
#define DIOCCHANGENAT _IOWR('D', 27, struct pfioc_changenat)
#define DIOCCHANGERDR _IOWR('D', 28, struct pfioc_changerdr)
#define DIOCSETTIMEOUT _IOWR('D', 29, struct pfioc_tm)
#define DIOCGETTIMEOUT _IOWR('D', 30, struct pfioc_tm)
#define DIOCBEGINBINATS _IOWR('D', 31, u_int32_t)
#define DIOCADDBINAT _IOWR('D', 32, struct pfioc_binat)
#define DIOCCOMMITBINATS _IOWR('D', 33, u_int32_t)
#define DIOCGETBINATS _IOWR('D', 34, struct pfioc_binat)
#define DIOCGETBINAT _IOWR('D', 35, struct pfioc_binat)
#define DIOCCHANGEBINAT _IOWR('D', 36, struct pfioc_changebinat)
#define DIOCADDSTATE _IOWR('D', 37, struct pfioc_state)
#define DIOCCLRRULECTRS _IO ('D', 38)
#ifdef _KERNEL
#ifdef INET
int pf_test(int, struct ifnet *, struct mbuf **);
#endif /* INET */
#ifdef INET6
int pf_test6(int, struct ifnet *, struct mbuf **);
#endif /* INET */
struct pf_tree_node;
struct pf_state
*pf_find_state(struct pf_tree_node *, struct pf_tree_key *);
int pf_tree_insert(struct pf_tree_node **, struct pf_tree_node *,
struct pf_tree_key *, struct pf_state *);
int pf_tree_remove(struct pf_tree_node **, struct pf_tree_node *,
struct pf_tree_key *);
int pflog_packet(struct ifnet *, struct mbuf *, int, u_short, u_short,
struct pf_rule *);
int pf_match_addr(u_int8_t, struct pf_addr *, struct pf_addr *,
struct pf_addr *, int);
int pf_match_port(u_int8_t, u_int16_t, u_int16_t, u_int16_t);
void pf_normalize_init(void);
int pf_normalize_ip(struct mbuf **, int, struct ifnet *, u_short *);
void pf_purge_expired_fragments(void);
extern struct pf_rulequeue *pf_rules_active;
extern struct pf_status pf_status;
#endif /* _KERNEL */
#endif /* _NET_PFVAR_H_ */
|