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[] = 23 "@(#) $Header: /tcpdump/master/tcpdump/bpf_dump.c,v 1.10 1999/11/21 09:36:44 fenner Exp $ (LBL)"; 24 #endif 25 26 #ifdef HAVE_CONFIG_H 27 #include "config.h" 28 #endif 29 30 #include <sys/types.h> 31 #include <sys/time.h> 32 33 #include <pcap.h> 34 #include <stdio.h> 35 36 #include "interface.h" 37 38 extern void bpf_dump(struct bpf_program *, int); 39 40 void 41 bpf_dump(struct bpf_program *p, int option) 42 { 43 struct bpf_insn *insn; 44 int i; 45 int n = p->bf_len; 46 47 insn = p->bf_insns; 48 if (option > 2) { 49 printf("%d\n", n); 50 for (i = 0; i < n; ++insn, ++i) { 51 printf("%u %u %u %u\n", insn->code, 52 insn->jt, insn->jf, insn->k); 53 } 54 return ; 55 } 56 if (option > 1) { 57 for (i = 0; i < n; ++insn, ++i) 58 printf("{ 0x%x, %d, %d, 0x%08x },\n", 59 insn->code, insn->jt, insn->jf, insn->k); 60 return; 61 } 62 for (i = 0; i < n; ++insn, ++i) { 63 #ifdef BDEBUG 64 extern int bids[]; 65 printf(bids[i] > 0 ? "[%02d]" : " -- ", bids[i] - 1); 66 #endif 67 puts(bpf_image(insn, i)); 68 } 69 } 70