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