xref: /freebsd/contrib/tcpdump/bpf_dump.c (revision 0bc7cf6fde4083c1a0cdf29b26075699028909e0)
1 /*
2  * Copyright (c) 1992, 1993, 1994, 1995, 1996
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that: (1) source code distributions
7  * retain the above copyright notice and this paragraph in its entirety, (2)
8  * distributions including binary code include the above copyright notice and
9  * this paragraph in its entirety in the documentation or other materials
10  * provided with the distribution, and (3) all advertising materials mentioning
11  * features or use of this software display the following acknowledgement:
12  * ``This product includes software developed by the University of California,
13  * Lawrence Berkeley Laboratory and its contributors.'' Neither the name of
14  * the University nor the names of its contributors may be used to endorse
15  * or promote products derived from this software without specific prior
16  * written permission.
17  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
18  * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
19  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
20  */
21 #ifndef lint
22 static const char rcsid[] _U_ =
23     "@(#) $Header: /tcpdump/master/tcpdump/bpf_dump.c,v 1.17 2008-02-14 20:53:49 guy Exp $ (LBL)";
24 #endif
25 
26 #ifdef HAVE_CONFIG_H
27 #include "config.h"
28 #endif
29 
30 #include <tcpdump-stdinc.h>
31 
32 #include <pcap.h>
33 #include <stdio.h>
34 
35 #include "interface.h"
36 
37 void
38 bpf_dump(const struct bpf_program *p, int option)
39 {
40 	struct bpf_insn *insn;
41 	int i;
42 	int n = p->bf_len;
43 
44 	insn = p->bf_insns;
45 	if (option > 2) {
46 		printf("%d\n", n);
47 		for (i = 0; i < n; ++insn, ++i) {
48 			printf("%u %u %u %u\n", insn->code,
49 			       insn->jt, insn->jf, insn->k);
50 		}
51 		return ;
52 	}
53 	if (option > 1) {
54 		for (i = 0; i < n; ++insn, ++i)
55 			printf("{ 0x%x, %d, %d, 0x%08x },\n",
56 			       insn->code, insn->jt, insn->jf, insn->k);
57 		return;
58 	}
59 	for (i = 0; i < n; ++insn, ++i) {
60 #ifdef BDEBUG
61 		extern int bids[];
62 		printf(bids[i] > 0 ? "[%02d]" : " -- ", bids[i] - 1);
63 #endif
64 		puts(bpf_image(insn, i));
65 	}
66 }
67