contrib/libpcap/bpf_dump.c

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