Annotation of src/usr.bin/systat/pftop.c, Revision 1.44
1.44 ! deraadt 1: /* $OpenBSD: pftop.c,v 1.43 2019/02/18 13:11:44 bluhm Exp $ */
1.1 canacar 2: /*
3: * Copyright (c) 2001, 2007 Can Erkin Acar
4: * Copyright (c) 2001 Daniel Hartmeier
5: * All rights reserved.
6: *
7: * Redistribution and use in source and binary forms, with or without
8: * modification, are permitted provided that the following conditions
9: * are met:
10: *
11: * - Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * - Redistributions in binary form must reproduce the above
14: * copyright notice, this list of conditions and the following
15: * disclaimer in the documentation and/or other materials provided
16: * with the distribution.
17: *
18: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19: * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20: * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
21: * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
22: * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
23: * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
24: * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25: * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26: * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
28: * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29: * POSSIBILITY OF SUCH DAMAGE.
30: *
31: */
32:
33: #include <sys/types.h>
34: #include <sys/ioctl.h>
35: #include <sys/socket.h>
36:
37: #include <net/if.h>
38: #include <netinet/in.h>
1.8 mcbride 39: #include <netinet/tcp.h>
1.1 canacar 40: #include <netinet/tcp_fsm.h>
41: #include <net/pfvar.h>
42: #include <arpa/inet.h>
43:
1.22 henning 44: #include <net/hfsc.h>
45:
1.1 canacar 46: #include <ctype.h>
47: #include <curses.h>
48: #include <err.h>
49: #include <errno.h>
50: #include <fcntl.h>
51: #include <netdb.h>
52: #include <signal.h>
53: #include <stdio.h>
54: #include <stdlib.h>
55: #include <string.h>
56: #include <unistd.h>
1.30 deraadt 57: #include <limits.h>
1.1 canacar 58: #include <stdarg.h>
59:
1.6 canacar 60: #include "systat.h"
1.1 canacar 61: #include "engine.h"
62: #include "cache.h"
63:
64: extern const char *tcpstates[];
65:
66: #define MIN_NUM_STATES 1024
67: #define NUM_STATE_INC 1024
68:
69: #define DEFAULT_CACHE_SIZE 10000
70:
71: /* XXX must also check type before use */
72: #define PT_ADDR(x) (&(x)->addr.v.a.addr)
73:
74: /* XXX must also check type before use */
75: #define PT_MASK(x) (&(x)->addr.v.a.mask)
76:
77: #define PT_NOROUTE(x) ((x)->addr.type == PF_ADDR_NOROUTE)
78:
79: /* view management */
80: int select_states(void);
81: int read_states(void);
82: void sort_states(void);
83: void print_states(void);
84:
85: int select_rules(void);
86: int read_rules(void);
87: void print_rules(void);
88:
89: int select_queues(void);
90: int read_queues(void);
91: void print_queues(void);
92:
1.7 canacar 93: void update_cache(void);
94:
1.1 canacar 95: /* qsort callbacks */
96: int sort_size_callback(const void *s1, const void *s2);
97: int sort_exp_callback(const void *s1, const void *s2);
98: int sort_pkt_callback(const void *s1, const void *s2);
99: int sort_age_callback(const void *s1, const void *s2);
100: int sort_sa_callback(const void *s1, const void *s2);
101: int sort_sp_callback(const void *s1, const void *s2);
102: int sort_da_callback(const void *s1, const void *s2);
103: int sort_dp_callback(const void *s1, const void *s2);
104: int sort_rate_callback(const void *s1, const void *s2);
105: int sort_peak_callback(const void *s1, const void *s2);
106: int pf_dev = -1;
107:
108: struct sc_ent **state_cache = NULL;
1.4 canacar 109: struct pfsync_state *state_buf = NULL;
1.43 bluhm 110: size_t state_buf_len = 0;
111: size_t *state_ord = NULL;
112: size_t num_states = 0;
113: size_t num_states_all = 0;
1.1 canacar 114: u_int32_t num_rules = 0;
115: u_int32_t num_queues = 0;
116: int cachestates = 0;
117:
118: char *filter_string = NULL;
119:
120: #define MIN_LABEL_SIZE 5
121: #define ANCHOR_FLD_SIZE 12
122:
123: /* Define fields */
124: field_def fields[] = {
125: {"SRC", 20, 45, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
126: {"DEST", 20, 45, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
127: {"GW", 20, 45, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
128: {"STATE", 5, 23, 18, FLD_ALIGN_COLUMN, -1, 0, 0, 0},
129: {"AGE", 5, 9, 4, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
130: {"EXP", 5, 9, 4, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
131: {"PR ", 4, 9, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
132: {"DIR", 1, 3, 2, FLD_ALIGN_CENTER, -1, 0, 0, 0},
133: {"PKTS", 5, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
134: {"BYTES", 5, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
135: {"RULE", 2, 4, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
136: {"LABEL", MIN_LABEL_SIZE, MIN_LABEL_SIZE, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
137: {"STATES", 5, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
138: {"EVAL", 5, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
139: {"ACTION", 1, 8, 4, FLD_ALIGN_LEFT, -1, 0, 0, 0},
140: {"LOG", 1, 3, 2, FLD_ALIGN_LEFT, -1, 0, 0, 0},
141: {"QUICK", 1, 1, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
142: {"KS", 1, 1, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
1.35 jasper 143: {"IF", 4, 7, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
1.1 canacar 144: {"INFO", 40, 80, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
1.4 canacar 145: {"MAX", 3, 5, 2, FLD_ALIGN_RIGHT, -1, 0, 0},
1.1 canacar 146: {"RATE", 5, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
147: {"AVG", 5, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
148: {"PEAK", 5, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
1.4 canacar 149: {"ANCHOR", 6, 16, 1, FLD_ALIGN_LEFT, -1, 0, 0},
1.1 canacar 150: {"QUEUE", 15, 30, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
1.39 mikeb 151: {"BW/FL", 4, 5, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
1.1 canacar 152: {"SCH", 3, 4, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
153: {"DROP_P", 6, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
154: {"DROP_B", 6, 8, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
155: {"QLEN", 4, 4, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
156: {"BORROW", 4, 6, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
157: {"SUSPENDS", 4, 6, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
158: {"P/S", 3, 7, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
159: {"B/S", 4, 7, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0}
160: };
161:
162:
163: /* for states */
1.18 jasper 164: #define FLD_SRC FIELD_ADDR(fields,0)
165: #define FLD_DEST FIELD_ADDR(fields,1)
166: #define FLD_GW FIELD_ADDR(fields,2)
167: #define FLD_STATE FIELD_ADDR(fields,3)
168: #define FLD_AGE FIELD_ADDR(fields,4)
169: #define FLD_EXP FIELD_ADDR(fields,5)
1.1 canacar 170: /* common */
1.18 jasper 171: #define FLD_PROTO FIELD_ADDR(fields,6)
172: #define FLD_DIR FIELD_ADDR(fields,7)
173: #define FLD_PKTS FIELD_ADDR(fields,8)
174: #define FLD_BYTES FIELD_ADDR(fields,9)
175: #define FLD_RULE FIELD_ADDR(fields,10)
1.1 canacar 176: /* for rules */
1.18 jasper 177: #define FLD_LABEL FIELD_ADDR(fields,11)
178: #define FLD_STATS FIELD_ADDR(fields,12)
179: #define FLD_EVAL FIELD_ADDR(fields,13)
180: #define FLD_ACTION FIELD_ADDR(fields,14)
181: #define FLD_LOG FIELD_ADDR(fields,15)
182: #define FLD_QUICK FIELD_ADDR(fields,16)
183: #define FLD_KST FIELD_ADDR(fields,17)
184: #define FLD_IF FIELD_ADDR(fields,18)
185: #define FLD_RINFO FIELD_ADDR(fields,19)
186: #define FLD_STMAX FIELD_ADDR(fields,20)
1.1 canacar 187: /* other */
1.18 jasper 188: #define FLD_SI FIELD_ADDR(fields,21) /* instantaneous speed */
189: #define FLD_SA FIELD_ADDR(fields,22) /* average speed */
190: #define FLD_SP FIELD_ADDR(fields,23) /* peak speed */
191: #define FLD_ANCHOR FIELD_ADDR(fields,24)
1.1 canacar 192: /* for queues */
1.18 jasper 193: #define FLD_QUEUE FIELD_ADDR(fields,25)
194: #define FLD_BANDW FIELD_ADDR(fields,26)
195: #define FLD_SCHED FIELD_ADDR(fields,27)
1.37 mikeb 196: #define FLD_DROPP FIELD_ADDR(fields,28)
197: #define FLD_DROPB FIELD_ADDR(fields,29)
198: #define FLD_QLEN FIELD_ADDR(fields,30)
199: #define FLD_BORR FIELD_ADDR(fields,31)
200: #define FLD_SUSP FIELD_ADDR(fields,32)
201: #define FLD_PKTSPS FIELD_ADDR(fields,33)
202: #define FLD_BYTESPS FIELD_ADDR(fields,34)
1.1 canacar 203:
204: /* Define views */
205: field_def *view0[] = {
206: FLD_PROTO, FLD_DIR, FLD_SRC, FLD_DEST, FLD_STATE,
207: FLD_AGE, FLD_EXP, FLD_PKTS, FLD_BYTES, NULL
208: };
209:
210: field_def *view1[] = {
211: FLD_PROTO, FLD_DIR, FLD_SRC, FLD_DEST, FLD_GW, FLD_STATE, FLD_AGE,
212: FLD_EXP, FLD_PKTS, FLD_BYTES, FLD_SI, FLD_SP, FLD_SA, FLD_RULE, NULL
213: };
214:
215: field_def *view2[] = {
216: FLD_PROTO, FLD_DIR, FLD_SRC, FLD_DEST, FLD_STATE, FLD_AGE, FLD_EXP,
217: FLD_PKTS, FLD_BYTES, FLD_SI, FLD_SP, FLD_SA, FLD_RULE, FLD_GW, NULL
218: };
219:
220: field_def *view3[] = {
221: FLD_PROTO, FLD_DIR, FLD_SRC, FLD_DEST, FLD_AGE, FLD_EXP, FLD_PKTS,
222: FLD_BYTES, FLD_STATE, FLD_SI, FLD_SP, FLD_SA, FLD_RULE, FLD_GW, NULL
223: };
224:
225: field_def *view4[] = {
226: FLD_PROTO, FLD_DIR, FLD_SRC, FLD_DEST, FLD_PKTS, FLD_BYTES, FLD_STATE,
227: FLD_AGE, FLD_EXP, FLD_SI, FLD_SP, FLD_SA, FLD_RULE, FLD_GW, NULL
228: };
229:
230: field_def *view5[] = {
231: FLD_RULE, FLD_ANCHOR, FLD_ACTION, FLD_DIR, FLD_LOG, FLD_QUICK, FLD_IF,
232: FLD_PROTO, FLD_KST, FLD_PKTS, FLD_BYTES, FLD_STATS, FLD_STMAX,
233: FLD_RINFO, NULL
234: };
235:
236: field_def *view6[] = {
237: FLD_RULE, FLD_LABEL, FLD_PKTS, FLD_BYTES, FLD_STATS, FLD_STMAX,
238: FLD_ACTION, FLD_DIR, FLD_LOG, FLD_QUICK, FLD_IF, FLD_PROTO,
239: FLD_ANCHOR, FLD_KST, NULL
240: };
241:
242: field_def *view7[] = {
243: FLD_PROTO, FLD_DIR, FLD_SRC, FLD_DEST, FLD_SI, FLD_SP, FLD_SA,
244: FLD_BYTES, FLD_STATE, FLD_PKTS, FLD_AGE, FLD_EXP, FLD_RULE, FLD_GW, NULL
245: };
246:
247: field_def *view8[] = {
1.37 mikeb 248: FLD_QUEUE, FLD_BANDW, FLD_SCHED, FLD_PKTS, FLD_BYTES,
1.1 canacar 249: FLD_DROPP, FLD_DROPB, FLD_QLEN, FLD_BORR, FLD_SUSP, FLD_PKTSPS,
250: FLD_BYTESPS, NULL
251: };
252:
253: /* Define orderings */
254: order_type order_list[] = {
255: {"none", "none", 'N', NULL},
256: {"bytes", "bytes", 'B', sort_size_callback},
257: {"expiry", "exp", 'E', sort_exp_callback},
258: {"packets", "pkt", 'P', sort_pkt_callback},
259: {"age", "age", 'A', sort_age_callback},
260: {"source addr", "src", 'F', sort_sa_callback},
261: {"dest. addr", "dest", 'T', sort_da_callback},
262: {"source port", "sport", 'S', sort_sp_callback},
263: {"dest. port", "dport", 'D', sort_dp_callback},
264: {"rate", "rate", 'R', sort_rate_callback},
265: {"peak", "peak", 'K', sort_peak_callback},
266: {NULL, NULL, 0, NULL}
267: };
268:
269: /* Define view managers */
270: struct view_manager state_mgr = {
271: "States", select_states, read_states, sort_states, print_header,
1.41 martijn 272: print_states, keyboard_callback, order_list, order_list
1.1 canacar 273: };
274:
275: struct view_manager rule_mgr = {
276: "Rules", select_rules, read_rules, NULL, print_header,
277: print_rules, keyboard_callback, NULL, NULL
278: };
279:
280: struct view_manager queue_mgr = {
281: "Queues", select_queues, read_queues, NULL, print_header,
282: print_queues, keyboard_callback, NULL, NULL
283: };
284:
285: field_view views[] = {
286: {view2, "states", '8', &state_mgr},
287: {view5, "rules", '9', &rule_mgr},
288: {view8, "queues", 'Q', &queue_mgr},
289: {NULL, NULL, 0, NULL}
290: };
291:
1.22 henning 292: /* queue structures from pfctl */
293:
294: struct queue_stats {
295: struct hfsc_class_stats data;
296: int valid;
297: struct timeval timestamp;
298: };
299:
300: struct pfctl_queue_node {
301: TAILQ_ENTRY(pfctl_queue_node) entries;
302: struct pf_queuespec qs;
303: struct queue_stats qstats;
304: struct queue_stats qstats_last;
305: int depth;
306: };
307: TAILQ_HEAD(qnodes, pfctl_queue_node) qnodes = TAILQ_HEAD_INITIALIZER(qnodes);
1.1 canacar 308:
309: /* ordering functions */
310:
311: int
312: sort_size_callback(const void *s1, const void *s2)
313: {
1.43 bluhm 314: u_int64_t b1 = COUNTER(state_buf[* (size_t *) s1].bytes[0]) +
315: COUNTER(state_buf[* (size_t *) s1].bytes[1]);
316: u_int64_t b2 = COUNTER(state_buf[* (size_t *) s2].bytes[0]) +
317: COUNTER(state_buf[* (size_t *) s2].bytes[1]);
1.1 canacar 318: if (b2 > b1)
319: return sortdir;
320: if (b2 < b1)
321: return -sortdir;
322: return 0;
323: }
324:
325: int
326: sort_pkt_callback(const void *s1, const void *s2)
327: {
1.43 bluhm 328: u_int64_t p1 = COUNTER(state_buf[* (size_t *) s1].packets[0]) +
329: COUNTER(state_buf[* (size_t *) s1].packets[1]);
330: u_int64_t p2 = COUNTER(state_buf[* (size_t *) s2].packets[0]) +
331: COUNTER(state_buf[* (size_t *) s2].packets[1]);
1.1 canacar 332: if (p2 > p1)
333: return sortdir;
334: if (p2 < p1)
335: return -sortdir;
336: return 0;
337: }
338:
339: int
340: sort_age_callback(const void *s1, const void *s2)
341: {
1.43 bluhm 342: if (ntohl(state_buf[* (size_t *) s2].creation) >
343: ntohl(state_buf[* (size_t *) s1].creation))
1.1 canacar 344: return sortdir;
1.43 bluhm 345: if (ntohl(state_buf[* (size_t *) s2].creation) <
346: ntohl(state_buf[* (size_t *) s1].creation))
1.1 canacar 347: return -sortdir;
348: return 0;
349: }
350:
351: int
352: sort_exp_callback(const void *s1, const void *s2)
353: {
1.43 bluhm 354: if (ntohl(state_buf[* (size_t *) s2].expire) >
355: ntohl(state_buf[* (size_t *) s1].expire))
1.1 canacar 356: return sortdir;
1.43 bluhm 357: if (ntohl(state_buf[* (size_t *) s2].expire) <
358: ntohl(state_buf[* (size_t *) s1].expire))
1.1 canacar 359: return -sortdir;
360: return 0;
361: }
362:
363: int
364: sort_rate_callback(const void *s1, const void *s2)
365: {
366: struct sc_ent *e1 = state_cache[* (u_int32_t *) s1];
367: struct sc_ent *e2 = state_cache[* (u_int32_t *) s2];
368:
369: if (e1 == NULL)
370: return sortdir;
371: if (e2 == NULL)
372: return -sortdir;
1.26 sthen 373:
1.1 canacar 374: if (e2->rate > e1 -> rate)
375: return sortdir;
376: if (e2->rate < e1 -> rate)
377: return -sortdir;
378: return 0;
379: }
380:
381: int
382: sort_peak_callback(const void *s1, const void *s2)
383: {
384: struct sc_ent *e1 = state_cache[* (u_int32_t *) s1];
385: struct sc_ent *e2 = state_cache[* (u_int32_t *) s2];
386:
387: if (e2 == NULL)
388: return -sortdir;
389: if (e1 == NULL || e2 == NULL)
390: return 0;
1.26 sthen 391:
1.1 canacar 392: if (e2->peak > e1 -> peak)
393: return sortdir;
394: if (e2->peak < e1 -> peak)
395: return -sortdir;
396: return 0;
397: }
398:
399: int
400: compare_addr(int af, const struct pf_addr *a, const struct pf_addr *b)
401: {
402: switch (af) {
403: case AF_INET:
404: if (ntohl(a->addr32[0]) > ntohl(b->addr32[0]))
405: return 1;
406: if (a->addr32[0] != b->addr32[0])
407: return -1;
408: break;
409: case AF_INET6:
410: if (ntohl(a->addr32[0]) > ntohl(b->addr32[0]))
411: return 1;
412: if (a->addr32[0] != b->addr32[0])
413: return -1;
414: if (ntohl(a->addr32[1]) > ntohl(b->addr32[1]))
415: return 1;
416: if (a->addr32[1] != b->addr32[1])
417: return -1;
418: if (ntohl(a->addr32[2]) > ntohl(b->addr32[2]))
419: return 1;
420: if (a->addr32[2] != b->addr32[2])
421: return -1;
422: if (ntohl(a->addr32[3]) > ntohl(b->addr32[3]))
423: return 1;
424: if (a->addr32[3] != b->addr32[3])
425: return -1;
426: break;
427: }
1.26 sthen 428:
1.1 canacar 429: return 0;
430: }
431:
1.13 jsg 432: static __inline int
1.4 canacar 433: sort_addr_callback(const struct pfsync_state *s1,
434: const struct pfsync_state *s2, int dir)
1.1 canacar 435: {
436: const struct pf_addr *aa, *ab;
437: u_int16_t pa, pb;
1.20 claudio 438: int af, side, ret, ii, io;
1.1 canacar 439:
1.20 claudio 440: side = s1->direction == PF_IN ? PF_SK_STACK : PF_SK_WIRE;
1.1 canacar 441:
1.20 claudio 442: if (s1->key[side].af > s2->key[side].af)
1.1 canacar 443: return sortdir;
1.20 claudio 444: if (s1->key[side].af < s2->key[side].af)
1.1 canacar 445: return -sortdir;
1.20 claudio 446:
1.26 sthen 447: ii = io = 0;
1.1 canacar 448:
449: if (dir == PF_OUT) /* looking for source addr */
450: io = 1;
451: else /* looking for dest addr */
452: ii = 1;
1.20 claudio 453:
454: if (s1->key[PF_SK_STACK].af != s1->key[PF_SK_WIRE].af) {
455: dir = PF_OUT;
456: side = PF_SK_STACK;
457: } else {
458: dir = s1->direction;
459: side = PF_SK_WIRE;
460: }
461:
462: if (dir == PF_IN) {
1.1 canacar 463: aa = &s1->key[PF_SK_STACK].addr[ii];
464: pa = s1->key[PF_SK_STACK].port[ii];
1.20 claudio 465: af = s1->key[PF_SK_STACK].af;
466: } else {
467: aa = &s1->key[side].addr[io];
468: pa = s1->key[side].port[io];
469: af = s1->key[side].af;
470: }
471:
472: if (s2->key[PF_SK_STACK].af != s2->key[PF_SK_WIRE].af) {
473: dir = PF_OUT;
474: side = PF_SK_STACK;
1.1 canacar 475: } else {
1.20 claudio 476: dir = s2->direction;
477: side = PF_SK_WIRE;
1.1 canacar 478: }
479:
1.20 claudio 480: if (dir == PF_IN) {
1.16 deraadt 481: ab = &s2->key[PF_SK_STACK].addr[ii];
1.1 canacar 482: pb = s2->key[PF_SK_STACK].port[ii];
1.20 claudio 483: af = s1->key[PF_SK_STACK].af;
1.1 canacar 484: } else {
1.20 claudio 485: ab = &s2->key[side].addr[io];
486: pb = s2->key[side].port[io];
487: af = s1->key[side].af;
1.1 canacar 488: }
489:
490: ret = compare_addr(af, aa, ab);
491: if (ret)
492: return ret * sortdir;
493:
494: if (ntohs(pa) > ntohs(pb))
495: return sortdir;
496: return -sortdir;
497: }
498:
1.13 jsg 499: static __inline int
1.4 canacar 500: sort_port_callback(const struct pfsync_state *s1,
501: const struct pfsync_state *s2, int dir)
1.1 canacar 502: {
503: const struct pf_addr *aa, *ab;
504: u_int16_t pa, pb;
1.20 claudio 505: int af, side, ret, ii, io;
1.1 canacar 506:
1.20 claudio 507: side = s1->direction == PF_IN ? PF_SK_STACK : PF_SK_WIRE;
1.1 canacar 508:
1.20 claudio 509: if (s1->key[side].af > s2->key[side].af)
1.1 canacar 510: return sortdir;
1.20 claudio 511: if (s1->key[side].af < s2->key[side].af)
1.1 canacar 512: return -sortdir;
1.20 claudio 513:
1.26 sthen 514: ii = io = 0;
1.1 canacar 515:
516: if (dir == PF_OUT) /* looking for source addr */
517: io = 1;
518: else /* looking for dest addr */
519: ii = 1;
1.20 claudio 520:
521: if (s1->key[PF_SK_STACK].af != s1->key[PF_SK_WIRE].af) {
522: dir = PF_OUT;
523: side = PF_SK_STACK;
524: } else {
525: dir = s1->direction;
526: side = PF_SK_WIRE;
527: }
528:
529: if (dir == PF_IN) {
1.1 canacar 530: aa = &s1->key[PF_SK_STACK].addr[ii];
531: pa = s1->key[PF_SK_STACK].port[ii];
1.20 claudio 532: af = s1->key[PF_SK_STACK].af;
1.1 canacar 533: } else {
1.20 claudio 534: aa = &s1->key[side].addr[io];
535: pa = s1->key[side].port[io];
536: af = s1->key[side].af;
1.1 canacar 537: }
538:
1.20 claudio 539: if (s2->key[PF_SK_STACK].af != s2->key[PF_SK_WIRE].af) {
540: dir = PF_OUT;
541: side = PF_SK_STACK;
542: } else {
543: dir = s2->direction;
544: side = PF_SK_WIRE;
545: }
546:
547: if (dir == PF_IN) {
1.16 deraadt 548: ab = &s2->key[PF_SK_STACK].addr[ii];
1.1 canacar 549: pb = s2->key[PF_SK_STACK].port[ii];
1.20 claudio 550: af = s1->key[PF_SK_STACK].af;
1.1 canacar 551: } else {
1.20 claudio 552: ab = &s2->key[side].addr[io];
553: pb = s2->key[side].port[io];
554: af = s1->key[side].af;
1.1 canacar 555: }
556:
557:
558: if (ntohs(pa) > ntohs(pb))
559: return sortdir;
560: if (ntohs(pa) < ntohs(pb))
561: return - sortdir;
562:
563: ret = compare_addr(af, aa, ab);
564: if (ret)
565: return ret * sortdir;
566: return -sortdir;
567: }
568:
569: int
1.4 canacar 570: sort_sa_callback(const void *p1, const void *p2)
1.1 canacar 571: {
1.43 bluhm 572: struct pfsync_state *s1 = state_buf + (* (size_t *) p1);
573: struct pfsync_state *s2 = state_buf + (* (size_t *) p2);
1.4 canacar 574: return sort_addr_callback(s1, s2, PF_OUT);
1.1 canacar 575: }
576:
577: int
1.4 canacar 578: sort_da_callback(const void *p1, const void *p2)
1.1 canacar 579: {
1.43 bluhm 580: struct pfsync_state *s1 = state_buf + (* (size_t *) p1);
581: struct pfsync_state *s2 = state_buf + (* (size_t *) p2);
1.1 canacar 582: return sort_addr_callback(s1, s2, PF_IN);
583: }
584:
585: int
586: sort_sp_callback(const void *p1, const void *p2)
587: {
1.43 bluhm 588: struct pfsync_state *s1 = state_buf + (* (size_t *) p1);
589: struct pfsync_state *s2 = state_buf + (* (size_t *) p2);
1.1 canacar 590: return sort_port_callback(s1, s2, PF_OUT);
591: }
592:
593: int
594: sort_dp_callback(const void *p1, const void *p2)
595: {
1.43 bluhm 596: struct pfsync_state *s1 = state_buf + (* (size_t *) p1);
597: struct pfsync_state *s2 = state_buf + (* (size_t *) p2);
1.1 canacar 598: return sort_port_callback(s1, s2, PF_IN);
599: }
600:
601: void
602: sort_states(void)
603: {
604: order_type *ordering;
605:
606: if (curr_mgr == NULL)
607: return;
608:
609: ordering = curr_mgr->order_curr;
610:
611: if (ordering == NULL)
612: return;
613: if (ordering->func == NULL)
614: return;
615: if (state_buf == NULL)
616: return;
617: if (num_states <= 0)
618: return;
619:
1.43 bluhm 620: mergesort(state_ord, num_states, sizeof(size_t), ordering->func);
1.1 canacar 621: }
622:
623: /* state management functions */
624:
625: void
1.43 bluhm 626: alloc_buf(size_t ns)
1.1 canacar 627: {
1.43 bluhm 628: size_t len;
1.1 canacar 629:
630: if (ns < MIN_NUM_STATES)
631: ns = MIN_NUM_STATES;
632:
633: len = ns;
634:
635: if (len >= state_buf_len) {
636: len += NUM_STATE_INC;
1.29 doug 637: state_buf = reallocarray(state_buf, len,
638: sizeof(struct pfsync_state));
1.43 bluhm 639: state_ord = reallocarray(state_ord, len, sizeof(size_t));
1.29 doug 640: state_cache = reallocarray(state_cache, len,
641: sizeof(struct sc_ent *));
1.1 canacar 642: if (state_buf == NULL || state_ord == NULL ||
643: state_cache == NULL)
644: err(1, "realloc");
645: state_buf_len = len;
646: }
647: }
648:
649: int
650: select_states(void)
651: {
652: num_disp = num_states;
653: return (0);
654: }
655:
656: int
657: read_states(void)
658: {
659: struct pfioc_states ps;
1.43 bluhm 660: size_t n;
1.1 canacar 661:
662: if (pf_dev == -1)
663: return -1;
664:
665: for (;;) {
1.43 bluhm 666: size_t sbytes = state_buf_len * sizeof(struct pfsync_state);
1.1 canacar 667:
668: ps.ps_len = sbytes;
1.43 bluhm 669: ps.ps_states = state_buf;
1.1 canacar 670:
1.44 ! deraadt 671: if (ioctl(pf_dev, DIOCGETSTATES, &ps) == -1) {
1.1 canacar 672: error("DIOCGETSTATES");
673: }
1.4 canacar 674: num_states_all = ps.ps_len / sizeof(struct pfsync_state);
1.1 canacar 675:
676: if (ps.ps_len < sbytes)
677: break;
678:
679: alloc_buf(num_states_all);
680: }
681:
1.43 bluhm 682: num_states = num_states_all;
683: for (n = 0; n < num_states_all; n++)
1.1 canacar 684: state_ord[n] = n;
685:
686: if (cachestates) {
687: for (n = 0; n < num_states; n++)
688: state_cache[n] = cache_state(state_buf + n);
689: cache_endupdate();
690: }
691:
692: num_disp = num_states;
693: return 0;
694: }
695:
696: int
1.42 kn 697: unmask(struct pf_addr * m)
1.1 canacar 698: {
1.42 kn 699: int i = 31, j = 0, b = 0;
1.1 canacar 700: u_int32_t tmp;
701:
1.42 kn 702: while (j < 4 && m->addr32[j] == 0xffffffff) {
1.1 canacar 703: b += 32;
704: j++;
705: }
1.42 kn 706: if (j < 4) {
1.1 canacar 707: tmp = ntohl(m->addr32[j]);
708: for (i = 31; tmp & (1 << i); --i)
709: b++;
710: }
711: return (b);
712: }
713:
714: /* display functions */
715:
716: void
717: tb_print_addr(struct pf_addr * addr, struct pf_addr * mask, int af)
718: {
1.26 sthen 719: switch (af) {
720: case AF_INET: {
1.15 giovanni 721: tbprintf("%s", inetname(addr->v4));
722: break;
1.26 sthen 723: }
724: case AF_INET6: {
1.15 giovanni 725: tbprintf("%s", inet6name(&addr->v6));
726: break;
1.26 sthen 727: }
1.15 giovanni 728: }
1.1 canacar 729:
730: if (mask != NULL) {
731: if (!PF_AZERO(mask, af))
1.42 kn 732: tbprintf("/%u", unmask(mask));
1.1 canacar 733: }
734: }
1.4 canacar 735:
1.1 canacar 736: void
737: print_fld_host2(field_def *fld, struct pfsync_state_key *ks,
1.20 claudio 738: struct pfsync_state_key *kn, int idx)
1.1 canacar 739: {
740: struct pf_addr *as = &ks->addr[idx];
741: struct pf_addr *an = &kn->addr[idx];
742:
743: u_int16_t ps = ntohs(ks->port[idx]);
744: u_int16_t pn = ntohs(kn->port[idx]);
745:
1.20 claudio 746: int asf = ks->af;
747: int anf = kn->af;
748:
1.1 canacar 749: if (fld == NULL)
750: return;
751:
752: if (fld->width < 3) {
753: print_fld_str(fld, "*");
754: return;
755: }
756:
757: tb_start();
1.20 claudio 758: tb_print_addr(as, NULL, asf);
1.1 canacar 759:
1.20 claudio 760: if (asf == AF_INET)
1.1 canacar 761: tbprintf(":%u", ps);
762: else
763: tbprintf("[%u]", ps);
764:
765: print_fld_tb(fld);
766:
1.20 claudio 767: if (asf != anf || PF_ANEQ(as, an, asf) || ps != pn) {
1.1 canacar 768: tb_start();
1.20 claudio 769: tb_print_addr(an, NULL, anf);
1.1 canacar 770:
1.20 claudio 771: if (anf == AF_INET)
1.1 canacar 772: tbprintf(":%u", pn);
773: else
774: tbprintf("[%u]", pn);
775: print_fld_tb(FLD_GW);
776: }
777:
778: }
779:
780: void
781: print_fld_state(field_def *fld, unsigned int proto,
782: unsigned int s1, unsigned int s2)
783: {
784: int len;
1.26 sthen 785:
1.1 canacar 786: if (fld == NULL)
787: return;
788:
789: len = fld->width;
790: if (len < 1)
791: return;
1.26 sthen 792:
1.1 canacar 793: tb_start();
794:
795: if (proto == IPPROTO_TCP) {
796: if (s1 <= TCPS_TIME_WAIT && s2 <= TCPS_TIME_WAIT)
797: tbprintf("%s:%s", tcpstates[s1], tcpstates[s2]);
798: #ifdef PF_TCPS_PROXY_SRC
799: else if (s1 == PF_TCPS_PROXY_SRC ||
800: s2 == PF_TCPS_PROXY_SRC)
801: tbprintf("PROXY:SRC\n");
802: else if (s1 == PF_TCPS_PROXY_DST ||
803: s2 == PF_TCPS_PROXY_DST)
804: tbprintf("PROXY:DST\n");
805: #endif
806: else
807: tbprintf("<BAD STATE LEVELS>");
808: } else if (proto == IPPROTO_UDP && s1 < PFUDPS_NSTATES &&
809: s2 < PFUDPS_NSTATES) {
810: const char *states[] = PFUDPS_NAMES;
811: tbprintf("%s:%s", states[s1], states[s2]);
812: } else if (proto != IPPROTO_ICMP && s1 < PFOTHERS_NSTATES &&
813: s2 < PFOTHERS_NSTATES) {
814: /* XXX ICMP doesn't really have state levels */
815: const char *states[] = PFOTHERS_NAMES;
816: tbprintf("%s:%s", states[s1], states[s2]);
817: } else {
818: tbprintf("%u:%u", s1, s2);
819: }
820:
821: if (strlen(tmp_buf) > len) {
822: tb_start();
823: tbprintf("%u:%u", s1, s2);
824: }
825:
826: print_fld_tb(fld);
827: }
828:
829: int
1.4 canacar 830: print_state(struct pfsync_state * s, struct sc_ent * ent)
1.1 canacar 831: {
1.4 canacar 832: struct pfsync_state_peer *src, *dst;
1.1 canacar 833: struct protoent *p;
1.4 canacar 834: u_int64_t sz;
1.20 claudio 835: int afto, dir;
836:
837: afto = s->key[PF_SK_STACK].af == s->key[PF_SK_WIRE].af ? 0 : 1;
838: dir = afto ? PF_OUT : s->direction;
1.1 canacar 839:
1.20 claudio 840: if (dir == PF_OUT) {
1.1 canacar 841: src = &s->src;
842: dst = &s->dst;
843: } else {
844: src = &s->dst;
845: dst = &s->src;
846: }
847:
848: p = getprotobynumber(s->proto);
849:
850: if (p != NULL)
851: print_fld_str(FLD_PROTO, p->p_name);
852: else
853: print_fld_uint(FLD_PROTO, s->proto);
854:
1.20 claudio 855: if (dir == PF_OUT) {
856: print_fld_host2(FLD_SRC,
857: &s->key[afto ? PF_SK_STACK : PF_SK_WIRE],
858: &s->key[PF_SK_STACK], 1);
859: print_fld_host2(FLD_DEST,
860: &s->key[afto ? PF_SK_STACK : PF_SK_WIRE],
861: &s->key[afto ? PF_SK_WIRE : PF_SK_STACK], 0);
1.1 canacar 862: } else {
863: print_fld_host2(FLD_SRC, &s->key[PF_SK_STACK],
1.20 claudio 864: &s->key[PF_SK_WIRE], 0);
1.1 canacar 865: print_fld_host2(FLD_DEST, &s->key[PF_SK_STACK],
1.20 claudio 866: &s->key[PF_SK_WIRE], 1);
1.1 canacar 867: }
868:
1.20 claudio 869: if (dir == PF_OUT)
1.1 canacar 870: print_fld_str(FLD_DIR, "Out");
871: else
872: print_fld_str(FLD_DIR, "In");
873:
874: print_fld_state(FLD_STATE, s->proto, src->state, dst->state);
1.3 mcbride 875: print_fld_age(FLD_AGE, ntohl(s->creation));
876: print_fld_age(FLD_EXP, ntohl(s->expire));
1.4 canacar 877:
878: sz = COUNTER(s->bytes[0]) + COUNTER(s->bytes[1]);
879:
880: print_fld_size(FLD_PKTS, COUNTER(s->packets[0]) +
881: COUNTER(s->packets[1]));
882: print_fld_size(FLD_BYTES, sz);
1.3 mcbride 883: print_fld_rate(FLD_SA, (s->creation) ?
1.33 canacar 884: ((double)sz/(double)ntohl(s->creation)) : -1);
1.1 canacar 885:
1.9 canacar 886: print_fld_uint(FLD_RULE, ntohl(s->rule));
1.1 canacar 887: if (cachestates && ent != NULL) {
888: print_fld_rate(FLD_SI, ent->rate);
889: print_fld_rate(FLD_SP, ent->peak);
890: }
891:
892: end_line();
893: return 1;
894: }
895:
896: void
897: print_states(void)
898: {
899: int n, count = 0;
900:
901: for (n = dispstart; n < num_disp; n++) {
902: count += print_state(state_buf + state_ord[n],
903: state_cache[state_ord[n]]);
904: if (maxprint > 0 && count >= maxprint)
905: break;
906: }
907: }
908:
909: /* rule display */
910:
911: struct pf_rule *rules = NULL;
912: u_int32_t alloc_rules = 0;
913:
914: int
915: select_rules(void)
916: {
917: num_disp = num_rules;
918: return (0);
919: }
920:
921:
922: void
923: add_rule_alloc(u_int32_t nr)
924: {
925: if (nr == 0)
926: return;
927:
928: num_rules += nr;
929:
930: if (rules == NULL) {
1.29 doug 931: rules = reallocarray(NULL, num_rules, sizeof(struct pf_rule));
1.1 canacar 932: if (rules == NULL)
933: err(1, "malloc");
934: alloc_rules = num_rules;
935: } else if (num_rules > alloc_rules) {
1.29 doug 936: rules = reallocarray(rules, num_rules, sizeof(struct pf_rule));
1.1 canacar 937: if (rules == NULL)
938: err(1, "realloc");
939: alloc_rules = num_rules;
940: }
941: }
942:
943: int label_length;
944:
945: int
946: read_anchor_rules(char *anchor)
947: {
948: struct pfioc_rule pr;
949: u_int32_t nr, num, off;
1.4 canacar 950: int len;
1.1 canacar 951:
952: if (pf_dev < 0)
953: return (-1);
954:
955: memset(&pr, 0, sizeof(pr));
956: strlcpy(pr.anchor, anchor, sizeof(pr.anchor));
1.4 canacar 957:
1.44 ! deraadt 958: if (ioctl(pf_dev, DIOCGETRULES, &pr) == -1) {
1.1 canacar 959: error("anchor %s: %s", anchor, strerror(errno));
960: return (-1);
961: }
962:
963: off = num_rules;
964: num = pr.nr;
965: add_rule_alloc(num);
966:
967: for (nr = 0; nr < num; ++nr) {
968: pr.nr = nr;
1.44 ! deraadt 969: if (ioctl(pf_dev, DIOCGETRULE, &pr) == -1) {
1.1 canacar 970: error("DIOCGETRULE: %s", strerror(errno));
971: return (-1);
972: }
973: /* XXX overload pr.anchor, to store a pointer to
974: * anchor name */
975: pr.rule.anchor = (struct pf_anchor *) anchor;
1.4 canacar 976: len = strlen(pr.rule.label);
977: if (len > label_length)
978: label_length = len;
1.1 canacar 979: rules[off + nr] = pr.rule;
980: }
981:
982: return (num);
983: }
984:
985: struct anchor_name {
1.30 deraadt 986: char name[PATH_MAX];
1.1 canacar 987: struct anchor_name *next;
988: u_int32_t ref;
989: };
990:
991: struct anchor_name *anchor_root = NULL;
992: struct anchor_name *anchor_end = NULL;
993: struct anchor_name *anchor_free = NULL;
994:
995: struct anchor_name*
996: alloc_anchor_name(const char *path)
997: {
998: struct anchor_name *a;
999:
1000: a = anchor_free;
1001: if (a == NULL) {
1.32 deraadt 1002: a = malloc(sizeof(struct anchor_name));
1.1 canacar 1003: if (a == NULL)
1004: return (NULL);
1005: } else
1006: anchor_free = a->next;
1007:
1008: if (anchor_root == NULL)
1009: anchor_end = a;
1010:
1011: a->next = anchor_root;
1012: anchor_root = a;
1013:
1014: a->ref = 0;
1015: strlcpy(a->name, path, sizeof(a->name));
1016: return (a);
1017: }
1018:
1019: void
1020: reset_anchor_names(void)
1021: {
1022: if (anchor_end == NULL)
1023: return;
1024:
1025: anchor_end->next = anchor_free;
1026: anchor_free = anchor_root;
1027: anchor_root = anchor_end = NULL;
1028: }
1029:
1030: struct pfioc_ruleset ruleset;
1031: char *rs_end = NULL;
1032:
1033: int
1034: read_rulesets(const char *path)
1035: {
1036: char *pre;
1037: struct anchor_name *a;
1038: u_int32_t nr, ns;
1039: int len;
1040:
1041: if (path == NULL)
1042: ruleset.path[0] = '\0';
1043: else if (strlcpy(ruleset.path, path, sizeof(ruleset.path)) >=
1044: sizeof(ruleset.path))
1045: return (-1);
1046:
1047: /* a persistent storage for anchor names */
1048: a = alloc_anchor_name(ruleset.path);
1049: if (a == NULL)
1050: return (-1);
1051:
1052: len = read_anchor_rules(a->name);
1053: if (len < 0)
1054: return (-1);
1055:
1056: a->ref += len;
1057:
1.44 ! deraadt 1058: if (ioctl(pf_dev, DIOCGETRULESETS, &ruleset) == -1) {
1.1 canacar 1059: error("DIOCGETRULESETS: %s", strerror(errno));
1060: return (-1);
1061: }
1062:
1063: ns = ruleset.nr;
1064:
1065: if (rs_end == NULL)
1066: rs_end = ruleset.path + sizeof(ruleset.path);
1067:
1068: /* 'pre' tracks the previous level on the anchor */
1069: pre = strchr(ruleset.path, 0);
1070: len = rs_end - pre;
1071: if (len < 1)
1072: return (-1);
1073: --len;
1074:
1075: for (nr = 0; nr < ns; ++nr) {
1076: ruleset.nr = nr;
1.44 ! deraadt 1077: if (ioctl(pf_dev, DIOCGETRULESET, &ruleset) == -1) {
1.1 canacar 1078: error("DIOCGETRULESET: %s", strerror(errno));
1079: return (-1);
1080: }
1081: *pre = '/';
1082: if (strlcpy(pre + 1, ruleset.name, len) < len)
1083: read_rulesets(ruleset.path);
1084: *pre = '\0';
1085: }
1086:
1087: return (0);
1088: }
1089:
1090: void
1091: compute_anchor_field(void)
1092: {
1093: struct anchor_name *a;
1094: int sum, cnt, mx, nx;
1095: sum = cnt = mx = 0;
1096:
1097: for (a = anchor_root; a != NULL; a = a->next, cnt++) {
1098: int len;
1099: if (a->ref == 0)
1100: continue;
1101: len = strlen(a->name);
1102: sum += len;
1103: if (len > mx)
1104: mx = len;
1105: }
1106:
1107: nx = sum/cnt;
1108: if (nx < ANCHOR_FLD_SIZE)
1109: nx = (mx < ANCHOR_FLD_SIZE) ? mx : ANCHOR_FLD_SIZE;
1110:
1111: if (FLD_ANCHOR->max_width != mx ||
1112: FLD_ANCHOR->norm_width != nx) {
1113: FLD_ANCHOR->max_width = mx;
1114: FLD_ANCHOR->norm_width = nx;
1115: field_setup();
1116: need_update = 1;
1117: }
1118: }
1119:
1120: int
1121: read_rules(void)
1122: {
1.4 canacar 1123: int ret, nw, mw;
1.1 canacar 1124: num_rules = 0;
1125:
1126: if (pf_dev == -1)
1127: return (-1);
1128:
1129: label_length = MIN_LABEL_SIZE;
1130:
1131: reset_anchor_names();
1132: ret = read_rulesets(NULL);
1133: compute_anchor_field();
1134:
1.4 canacar 1135: nw = mw = label_length;
1136: if (nw > 16)
1137: nw = 16;
1138:
1139: if (FLD_LABEL->norm_width != nw ||
1140: FLD_LABEL->max_width != mw) {
1141: FLD_LABEL->norm_width = nw;
1142: FLD_LABEL->max_width = mw;
1143: field_setup();
1144: need_update = 1;
1.1 canacar 1145: }
1146:
1147: num_disp = num_rules;
1148: return (ret);
1149: }
1150:
1151: void
1152: tb_print_addrw(struct pf_addr_wrap *addr, struct pf_addr *mask, u_int8_t af)
1153: {
1154: switch (addr->type) {
1155: case PF_ADDR_ADDRMASK:
1156: tb_print_addr(&addr->v.a.addr, mask, af);
1157: break;
1158: case PF_ADDR_NOROUTE:
1159: tbprintf("noroute");
1160: break;
1161: case PF_ADDR_DYNIFTL:
1162: tbprintf("(%s)", addr->v.ifname);
1163: break;
1164: case PF_ADDR_TABLE:
1165: tbprintf("<%s>", addr->v.tblname);
1166: break;
1167: default:
1168: tbprintf("UNKNOWN");
1169: break;
1170: }
1171: }
1172:
1173: void
1174: tb_print_op(u_int8_t op, const char *a1, const char *a2)
1175: {
1176: if (op == PF_OP_IRG)
1177: tbprintf("%s >< %s ", a1, a2);
1178: else if (op == PF_OP_XRG)
1179: tbprintf("%s <> %s ", a1, a2);
1180: else if (op == PF_OP_RRG)
1181: tbprintf("%s:%s ", a1, a2);
1182: else if (op == PF_OP_EQ)
1183: tbprintf("= %s ", a1);
1184: else if (op == PF_OP_NE)
1185: tbprintf("!= %s ", a1);
1186: else if (op == PF_OP_LT)
1187: tbprintf("< %s ", a1);
1188: else if (op == PF_OP_LE)
1189: tbprintf("<= %s ", a1);
1190: else if (op == PF_OP_GT)
1191: tbprintf("> %s ", a1);
1192: else if (op == PF_OP_GE)
1193: tbprintf(">= %s ", a1);
1194: }
1195:
1196: void
1197: tb_print_port(u_int8_t op, u_int16_t p1, u_int16_t p2, char *proto)
1198: {
1199: char a1[6], a2[6];
1200: struct servent *s = getservbyport(p1, proto);
1201:
1202: p1 = ntohs(p1);
1203: p2 = ntohs(p2);
1204: snprintf(a1, sizeof(a1), "%u", p1);
1205: snprintf(a2, sizeof(a2), "%u", p2);
1206: tbprintf("port ");
1207: if (s != NULL && (op == PF_OP_EQ || op == PF_OP_NE))
1208: tb_print_op(op, s->s_name, a2);
1209: else
1210: tb_print_op(op, a1, a2);
1211: }
1212:
1213: void
1214: tb_print_fromto(struct pf_rule_addr *src, struct pf_rule_addr *dst,
1215: u_int8_t af, u_int8_t proto)
1216: {
1217: if (
1218: PF_AZERO(PT_ADDR(src), AF_INET6) &&
1219: PF_AZERO(PT_ADDR(dst), AF_INET6) &&
1220: ! PT_NOROUTE(src) && ! PT_NOROUTE(dst) &&
1221: PF_AZERO(PT_MASK(src), AF_INET6) &&
1222: PF_AZERO(PT_MASK(dst), AF_INET6) &&
1223: !src->port_op && !dst->port_op)
1224: tbprintf("all ");
1225: else {
1226: tbprintf("from ");
1227: if (PT_NOROUTE(src))
1228: tbprintf("no-route ");
1229: else if (PF_AZERO(PT_ADDR(src), AF_INET6) &&
1230: PF_AZERO(PT_MASK(src), AF_INET6))
1231: tbprintf("any ");
1232: else {
1233: if (src->neg)
1234: tbprintf("! ");
1235: tb_print_addrw(&src->addr, PT_MASK(src), af);
1236: tbprintf(" ");
1237: }
1238: if (src->port_op)
1239: tb_print_port(src->port_op, src->port[0],
1240: src->port[1],
1241: proto == IPPROTO_TCP ? "tcp" : "udp");
1.26 sthen 1242:
1.1 canacar 1243: tbprintf("to ");
1244: if (PT_NOROUTE(dst))
1245: tbprintf("no-route ");
1246: else if (PF_AZERO(PT_ADDR(dst), AF_INET6) &&
1247: PF_AZERO(PT_MASK(dst), AF_INET6))
1248: tbprintf("any ");
1249: else {
1250: if (dst->neg)
1251: tbprintf("! ");
1252: tb_print_addrw(&dst->addr, PT_MASK(dst), af);
1253: tbprintf(" ");
1254: }
1255: if (dst->port_op)
1256: tb_print_port(dst->port_op, dst->port[0],
1257: dst->port[1],
1258: proto == IPPROTO_TCP ? "tcp" : "udp");
1259: }
1260: }
1261:
1262: void
1263: tb_print_ugid(u_int8_t op, unsigned u1, unsigned u2,
1264: const char *t, unsigned umax)
1265: {
1266: char a1[11], a2[11];
1267:
1268: snprintf(a1, sizeof(a1), "%u", u1);
1269: snprintf(a2, sizeof(a2), "%u", u2);
1270:
1271: tbprintf("%s ", t);
1272: if (u1 == umax && (op == PF_OP_EQ || op == PF_OP_NE))
1273: tb_print_op(op, "unknown", a2);
1274: else
1275: tb_print_op(op, a1, a2);
1276: }
1277:
1278: void
1279: tb_print_flags(u_int8_t f)
1280: {
1281: const char *tcpflags = "FSRPAUEW";
1282: int i;
1283:
1284: for (i = 0; tcpflags[i]; ++i)
1285: if (f & (1 << i))
1286: tbprintf("%c", tcpflags[i]);
1287: }
1288:
1289: void
1290: print_rule(struct pf_rule *pr)
1291: {
1.11 henning 1292: static const char *actiontypes[] = { "Pass", "Block", "Scrub",
1293: "no Scrub", "Nat", "no Nat", "Binat", "no Binat", "Rdr",
1294: "no Rdr", "SynProxy Block", "Defer", "Match" };
1.1 canacar 1295: int numact = sizeof(actiontypes) / sizeof(char *);
1296:
1297: static const char *routetypes[] = { "", "fastroute", "route-to",
1298: "dup-to", "reply-to" };
1299:
1300: int numroute = sizeof(routetypes) / sizeof(char *);
1301:
1302: if (pr == NULL) return;
1303:
1304: print_fld_str(FLD_LABEL, pr->label);
1305: print_fld_size(FLD_STATS, pr->states_tot);
1306:
1307: print_fld_size(FLD_PKTS, pr->packets[0] + pr->packets[1]);
1308: print_fld_size(FLD_BYTES, pr->bytes[0] + pr->bytes[1]);
1.4 canacar 1309:
1.1 canacar 1310: print_fld_uint(FLD_RULE, pr->nr);
1.5 sthen 1311: if (pr->direction == PF_OUT)
1312: print_fld_str(FLD_DIR, "Out");
1313: else if (pr->direction == PF_IN)
1314: print_fld_str(FLD_DIR, "In");
1315: else
1316: print_fld_str(FLD_DIR, "Any");
1317:
1.1 canacar 1318: if (pr->quick)
1319: print_fld_str(FLD_QUICK, "Quick");
1320:
1321: if (pr->keep_state == PF_STATE_NORMAL)
1322: print_fld_str(FLD_KST, "Keep");
1323: else if (pr->keep_state == PF_STATE_MODULATE)
1324: print_fld_str(FLD_KST, "Mod");
1.31 jsg 1325: else if (pr->keep_state == PF_STATE_SYNPROXY)
1.1 canacar 1326: print_fld_str(FLD_KST, "Syn");
1327: if (pr->log == 1)
1328: print_fld_str(FLD_LOG, "Log");
1329: else if (pr->log == 2)
1330: print_fld_str(FLD_LOG, "All");
1331:
1.12 canacar 1332: if (pr->action >= numact)
1.1 canacar 1333: print_fld_uint(FLD_ACTION, pr->action);
1334: else print_fld_str(FLD_ACTION, actiontypes[pr->action]);
1.12 canacar 1335:
1.1 canacar 1336: if (pr->proto) {
1337: struct protoent *p = getprotobynumber(pr->proto);
1338:
1339: if (p != NULL)
1340: print_fld_str(FLD_PROTO, p->p_name);
1341: else
1342: print_fld_uint(FLD_PROTO, pr->proto);
1343: }
1344:
1345: if (pr->ifname[0]) {
1346: tb_start();
1347: if (pr->ifnot)
1348: tbprintf("!");
1349: tbprintf("%s", pr->ifname);
1350: print_fld_tb(FLD_IF);
1351: }
1352: if (pr->max_states)
1353: print_fld_uint(FLD_STMAX, pr->max_states);
1.4 canacar 1354:
1.1 canacar 1355: /* print info field */
1356:
1357: tb_start();
1.4 canacar 1358:
1.1 canacar 1359: if (pr->action == PF_DROP) {
1360: if (pr->rule_flag & PFRULE_RETURNRST)
1361: tbprintf("return-rst ");
1362: #ifdef PFRULE_RETURN
1363: else if (pr->rule_flag & PFRULE_RETURN)
1364: tbprintf("return ");
1365: #endif
1366: #ifdef PFRULE_RETURNICMP
1367: else if (pr->rule_flag & PFRULE_RETURNICMP)
1368: tbprintf("return-icmp ");
1369: #endif
1370: else
1371: tbprintf("drop ");
1372: }
1373:
1374: if (pr->rt > 0 && pr->rt < numroute) {
1375: tbprintf("%s ", routetypes[pr->rt]);
1376: }
1.4 canacar 1377:
1.1 canacar 1378: if (pr->af) {
1379: if (pr->af == AF_INET)
1380: tbprintf("inet ");
1381: else
1382: tbprintf("inet6 ");
1383: }
1384:
1385: tb_print_fromto(&pr->src, &pr->dst, pr->af, pr->proto);
1.4 canacar 1386:
1.1 canacar 1387: if (pr->uid.op)
1388: tb_print_ugid(pr->uid.op, pr->uid.uid[0], pr->uid.uid[1],
1389: "user", UID_MAX);
1390: if (pr->gid.op)
1391: tb_print_ugid(pr->gid.op, pr->gid.gid[0], pr->gid.gid[1],
1392: "group", GID_MAX);
1393:
1.8 mcbride 1394: if (pr->action == PF_PASS &&
1395: (pr->proto == 0 || pr->proto == IPPROTO_TCP) &&
1396: (pr->flags != TH_SYN || pr->flagset != (TH_SYN | TH_ACK) )) {
1397: tbprintf("flags ");
1398: if (pr->flags || pr->flagset) {
1399: tb_print_flags(pr->flags);
1400: tbprintf("/");
1401: tb_print_flags(pr->flagset);
1402: } else
1403: tbprintf("any ");
1.1 canacar 1404: }
1405:
1406: tbprintf(" ");
1407:
1408: if (pr->tos)
1409: tbprintf("tos 0x%2.2x ", pr->tos);
1410: #ifdef PFRULE_FRAGMENT
1411: if (pr->rule_flag & PFRULE_FRAGMENT)
1412: tbprintf("fragment ");
1413: #endif
1414: #ifdef PFRULE_NODF
1415: if (pr->rule_flag & PFRULE_NODF)
1416: tbprintf("no-df ");
1417: #endif
1418: #ifdef PFRULE_RANDOMID
1419: if (pr->rule_flag & PFRULE_RANDOMID)
1420: tbprintf("random-id ");
1421: #endif
1422: if (pr->min_ttl)
1423: tbprintf("min-ttl %d ", pr->min_ttl);
1424: if (pr->max_mss)
1425: tbprintf("max-mss %d ", pr->max_mss);
1426: if (pr->allow_opts)
1427: tbprintf("allow-opts ");
1428:
1.10 henning 1429: /* XXX more missing */
1.1 canacar 1430:
1431: if (pr->qname[0] && pr->pqname[0])
1432: tbprintf("queue(%s, %s) ", pr->qname, pr->pqname);
1433: else if (pr->qname[0])
1434: tbprintf("queue %s ", pr->qname);
1.4 canacar 1435:
1.1 canacar 1436: if (pr->tagname[0])
1437: tbprintf("tag %s ", pr->tagname);
1438: if (pr->match_tagname[0]) {
1439: if (pr->match_tag_not)
1440: tbprintf("! ");
1441: tbprintf("tagged %s ", pr->match_tagname);
1442: }
1.4 canacar 1443:
1.1 canacar 1444: print_fld_tb(FLD_RINFO);
1445:
1446: /* XXX anchor field overloaded with anchor name */
1447: print_fld_str(FLD_ANCHOR, (char *)pr->anchor);
1448: tb_end();
1449:
1450: end_line();
1451: }
1452:
1453: void
1454: print_rules(void)
1455: {
1456: u_int32_t n, count = 0;
1.26 sthen 1457:
1.1 canacar 1458: for (n = dispstart; n < num_rules; n++) {
1459: print_rule(rules + n);
1460: count ++;
1461: if (maxprint > 0 && count >= maxprint)
1462: break;
1463: }
1464: }
1465:
1466: /* queue display */
1.22 henning 1467: struct pfctl_queue_node *
1468: pfctl_find_queue_node(const char *qname, const char *ifname)
1469: {
1470: struct pfctl_queue_node *node;
1471:
1472: TAILQ_FOREACH(node, &qnodes, entries)
1473: if (!strcmp(node->qs.qname, qname)
1474: && !(strcmp(node->qs.ifname, ifname)))
1475: return (node);
1476: return (NULL);
1477: }
1478:
1479: void
1480: pfctl_insert_queue_node(const struct pf_queuespec qs,
1481: const struct queue_stats qstats)
1482: {
1483: struct pfctl_queue_node *node, *parent;
1484:
1485: node = calloc(1, sizeof(struct pfctl_queue_node));
1486: if (node == NULL)
1487: err(1, "pfctl_insert_queue_node: calloc");
1488: memcpy(&node->qs, &qs, sizeof(qs));
1489: memcpy(&node->qstats, &qstats, sizeof(qstats));
1490:
1491: if (node->qs.parent[0]) {
1492: parent = pfctl_find_queue_node(node->qs.parent,
1493: node->qs.ifname);
1494: if (parent)
1495: node->depth = parent->depth + 1;
1496: }
1497:
1498: TAILQ_INSERT_TAIL(&qnodes, node, entries);
1499: }
1500:
1501: int
1502: pfctl_update_qstats(void)
1503: {
1504: struct pfctl_queue_node *node;
1505: struct pfioc_queue pq;
1506: struct pfioc_qstats pqs;
1507: u_int32_t mnr, nr;
1508: struct queue_stats qstats;
1509: static u_int32_t last_ticket;
1510:
1511: memset(&pq, 0, sizeof(pq));
1512: memset(&pqs, 0, sizeof(pqs));
1513: memset(&qstats, 0, sizeof(qstats));
1514:
1515: if (pf_dev < 0)
1516: return (-1);
1517:
1.44 ! deraadt 1518: if (ioctl(pf_dev, DIOCGETQUEUES, &pq) == -1) {
1.22 henning 1519: error("DIOCGETQUEUES: %s", strerror(errno));
1520: return (-1);
1521: }
1522:
1523: /* if a new set is found, start over */
1524: if (pq.ticket != last_ticket)
1.23 pelikan 1525: while ((node = TAILQ_FIRST(&qnodes)) != NULL) {
1.22 henning 1526: TAILQ_REMOVE(&qnodes, node, entries);
1.23 pelikan 1527: free(node);
1528: }
1.22 henning 1529: last_ticket = pq.ticket;
1530:
1531: num_queues = mnr = pq.nr;
1532: for (nr = 0; nr < mnr; ++nr) {
1533: pqs.nr = nr;
1534: pqs.ticket = pq.ticket;
1535: pqs.buf = &qstats.data;
1536: pqs.nbytes = sizeof(qstats.data);
1.44 ! deraadt 1537: if (ioctl(pf_dev, DIOCGETQSTATS, &pqs) == -1) {
1.22 henning 1538: error("DIOCGETQSTATS: %s", strerror(errno));
1539: return (-1);
1540: }
1.36 mikeb 1541: qstats.valid = 1;
1542: gettimeofday(&qstats.timestamp, NULL);
1543: if ((node = pfctl_find_queue_node(pqs.queue.qname,
1544: pqs.queue.ifname)) != NULL) {
1545: memcpy(&node->qstats_last, &node->qstats,
1546: sizeof(struct queue_stats));
1547: memcpy(&node->qstats, &qstats,
1548: sizeof(struct queue_stats));
1549: } else {
1550: pfctl_insert_queue_node(pqs.queue, qstats);
1551: }
1.22 henning 1552: }
1553: return (0);
1554: }
1555:
1.1 canacar 1556: int
1557: select_queues(void)
1558: {
1.24 henning 1559: num_disp = num_queues;
1.1 canacar 1560: return (0);
1561: }
1562:
1563: int
1564: read_queues(void)
1565: {
1.24 henning 1566: num_disp = num_queues = 0;
1.22 henning 1567:
1568: if (pfctl_update_qstats() < 0)
1.1 canacar 1569: return (-1);
1.24 henning 1570: num_disp = num_queues;
1.25 sthen 1571:
1.1 canacar 1572: return(0);
1573: }
1574:
1575: double
1576: calc_interval(struct timeval *cur_time, struct timeval *last_time)
1577: {
1578: double sec;
1579:
1580: sec = (double)(cur_time->tv_sec - last_time->tv_sec) +
1581: (double)(cur_time->tv_usec - last_time->tv_usec) / 1000000;
1582:
1583: return (sec);
1584: }
1585:
1586: double
1587: calc_rate(u_int64_t new_bytes, u_int64_t last_bytes, double interval)
1588: {
1589: double rate;
1590:
1591: rate = (double)(new_bytes - last_bytes) / interval;
1592: return (rate);
1593: }
1594:
1595: double
1596: calc_pps(u_int64_t new_pkts, u_int64_t last_pkts, double interval)
1597: {
1598: double pps;
1599:
1600: pps = (double)(new_pkts - last_pkts) / interval;
1601: return (pps);
1602: }
1603:
1604: void
1.22 henning 1605: print_queue_node(struct pfctl_queue_node *node)
1606: {
1.38 mikeb 1607: u_int rate, rtmp;
1.22 henning 1608: int i;
1609: double interval, pps, bps;
1610: static const char unit[] = " KMG";
1611:
1612: tb_start();
1613: for (i = 0; i < node->depth; i++)
1614: tbprintf(" ");
1615: tbprintf("%s", node->qs.qname);
1.28 sthen 1616: if (i == 0 && node->qs.ifname[0])
1617: tbprintf(" on %s ", node->qs.ifname);
1.22 henning 1618: print_fld_tb(FLD_QUEUE);
1619:
1620: // XXX: missing min, max, burst
1621: tb_start();
1.40 mikeb 1622: rate = node->qs.linkshare.m2.absolute;
1623: for (i = 0; rate > 9999 && i <= 3; i++) {
1624: rtmp = rate / 1000;
1625: if (rtmp <= 9999)
1626: rtmp += (rate % 1000) / 500;
1627: rate = rtmp;
1628: }
1629: if (rate == 0 && (node->qs.flags & PFQS_FLOWQUEUE)) {
1.39 mikeb 1630: /*
1631: * XXX We're abusing the fact that 'flows' in
1632: * the fqcodel_stats structure is at the same
1633: * spot as the 'period' in hfsc_class_stats.
1634: */
1635: tbprintf("%u", node->qstats.data.period);
1.40 mikeb 1636: } else
1.39 mikeb 1637: tbprintf("%u%c", rate, unit[i]);
1.22 henning 1638: print_fld_tb(FLD_BANDW);
1.39 mikeb 1639:
1640: print_fld_str(FLD_SCHED, node->qs.flags & PFQS_FLOWQUEUE ?
1641: "flow" : "fifo");
1.22 henning 1642:
1643: if (node->qstats.valid && node->qstats_last.valid)
1644: interval = calc_interval(&node->qstats.timestamp,
1645: &node->qstats_last.timestamp);
1646: else
1647: interval = 0;
1648:
1649: print_fld_size(FLD_PKTS, node->qstats.data.xmit_cnt.packets);
1650: print_fld_size(FLD_BYTES, node->qstats.data.xmit_cnt.bytes);
1651: print_fld_size(FLD_DROPP, node->qstats.data.drop_cnt.packets);
1652: print_fld_size(FLD_DROPB, node->qstats.data.drop_cnt.bytes);
1653: print_fld_size(FLD_QLEN, node->qstats.data.qlength);
1654:
1655: if (interval > 0) {
1656: pps = calc_pps(node->qstats.data.xmit_cnt.packets,
1657: node->qstats_last.data.xmit_cnt.packets, interval);
1658: bps = calc_rate(node->qstats.data.xmit_cnt.bytes,
1659: node->qstats_last.data.xmit_cnt.bytes, interval);
1660:
1661: tb_start();
1662: if (pps > 0 && pps < 1)
1663: tbprintf("%-3.1lf", pps);
1664: else
1665: tbprintf("%u", (unsigned int)pps);
1666:
1667: print_fld_tb(FLD_PKTSPS);
1668: print_fld_bw(FLD_BYTESPS, bps);
1669: }
1670: }
1671:
1672: void
1.1 canacar 1673: print_queues(void)
1674: {
1.22 henning 1675: uint32_t n, count, start;
1676: struct pfctl_queue_node *node;
1677:
1678: n = count = 0;
1679: start = dispstart;
1680:
1681: TAILQ_FOREACH(node, &qnodes, entries) {
1682: if (n < start) {
1683: n++;
1684: continue;
1685: }
1686: print_queue_node(node);
1687: end_line();
1688: count++;
1689: if (maxprint > 0 && count >= maxprint)
1690: return;
1.1 canacar 1691: }
1692: }
1693:
1694: /* main program functions */
1695:
1696: void
1.7 canacar 1697: update_cache(void)
1.1 canacar 1698: {
1699: static int pstate = -1;
1700: if (pstate == cachestates)
1701: return;
1702:
1703: pstate = cachestates;
1704: if (cachestates) {
1705: show_field(FLD_SI);
1706: show_field(FLD_SP);
1707: gotsig_alarm = 1;
1708: } else {
1709: hide_field(FLD_SI);
1710: hide_field(FLD_SP);
1711: need_update = 1;
1712: }
1713: field_setup();
1714: }
1715:
1.7 canacar 1716: int
1.1 canacar 1717: initpftop(void)
1718: {
1719: struct pf_status status;
1720: field_view *v;
1721: int cachesize = DEFAULT_CACHE_SIZE;
1722:
1723: v = views;
1724: while(v->name != NULL)
1725: add_view(v++);
1726:
1727: pf_dev = open("/dev/pf", O_RDONLY);
1728: if (pf_dev == -1) {
1729: alloc_buf(0);
1.44 ! deraadt 1730: } else if (ioctl(pf_dev, DIOCGETSTATUS, &status) == -1) {
1.1 canacar 1731: warn("DIOCGETSTATUS");
1732: alloc_buf(0);
1733: } else
1734: alloc_buf(status.states);
1735:
1736: /* initialize cache with given size */
1737: if (cache_init(cachesize))
1738: warnx("Failed to initialize cache.");
1739: else if (interactive && cachesize > 0)
1740: cachestates = 1;
1741:
1742: update_cache();
1743:
1744: show_field(FLD_STMAX);
1745: show_field(FLD_ANCHOR);
1.7 canacar 1746:
1747: return (1);
1.1 canacar 1748: }
![[BACK]](/icons/back.gif){kind=icon}
Return to pftop.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / systat