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
22 #ifdef HAVE_CONFIG_H
23 #include <config.h>
24 #endif
25
26 #include <pcap.h>
27 #include <stdio.h>
28
29 #include "optimize.h"
30
31 void
bpf_dump(const struct bpf_program * p,int option)32 bpf_dump(const struct bpf_program *p, int option)
33 {
34 const struct bpf_insn *insn;
35 int i;
36 int n = p->bf_len;
37
38 insn = p->bf_insns;
39 if (option > 2) {
40 printf("%d\n", n);
41 for (i = 0; i < n; ++insn, ++i) {
42 printf("%u %u %u %u\n", insn->code,
43 insn->jt, insn->jf, insn->k);
44 }
45 return ;
46 }
47 if (option > 1) {
48 for (i = 0; i < n; ++insn, ++i)
49 printf("{ 0x%x, %d, %d, 0x%08x },\n",
50 insn->code, insn->jt, insn->jf, insn->k);
51 return;
52 }
53 for (i = 0; i < n; ++insn, ++i) {
54 #ifdef BDEBUG
55 if (i < NBIDS && bids[i] > 0)
56 printf("[%02d]", bids[i] - 1);
57 else
58 printf(" -- ");
59 #endif
60 puts(bpf_image(insn, i));
61 }
62 }
63