dma: rework config parsing
[dragonfly.git] / contrib / tcpdump / bpf_dump.c
blobf509b7edbfcba378182dbb2581121d3758a8519a
1 /*
2 * Copyright (c) 1992, 1993, 1994, 1995, 1996
3 * The Regents of the University of California. All rights reserved.
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.
21 #ifndef lint
22 static const char rcsid[] _U_ =
23 "@(#) $Header: /tcpdump/master/tcpdump/bpf_dump.c,v 1.16.4.1 2008-02-14 20:54:53 guy Exp $ (LBL)";
24 #endif
26 #ifdef HAVE_CONFIG_H
27 #include "config.h"
28 #endif
30 #include <tcpdump-stdinc.h>
32 #include <pcap.h>
33 #include <stdio.h>
35 #include "interface.h"
37 void
38 bpf_dump(const struct bpf_program *p, int option)
40 struct bpf_insn *insn;
41 int i;
42 int n = p->bf_len;
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);
51 return ;
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;
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));