/* * Copyright (c) 1992, 1993, 1994, 1995, 1996 *	The Regents of the University of California.  All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that: (1) source code distributions * retain the above copyright notice and this paragraph in its entirety, (2) * distributions including binary code include the above copyright notice and * this paragraph in its entirety in the documentation or other materials * provided with the distribution, and (3) all advertising materials mentioning * features or use of this software display the following acknowledgement: * ``This product includes software developed by the University of California, * Lawrence Berkeley Laboratory and its contributors.'' Neither the name of * the University nor the names of its contributors may be used to endorse * or promote products derived from this software without specific prior * written permission. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. */#ifndef lintstatic const char rcsid[] _U_ =    "@(#) $Header: /tcpdump/master/tcpdump/bpf_dump.c,v 1.16.4.1 2008-02-14 20:54:53 guy Exp $ (LBL)";#endif#ifdef HAVE_CONFIG_H#include "config.h"#endif#include <tcpdump-stdinc.h>#include <pcap.h>#include <stdio.h>#include "interface.h"voidbpf_dump(const struct bpf_program *p, int option){	struct bpf_insn *insn;	int i;	int n = p->bf_len;	insn = p->bf_insns;	if (option > 2) {		printf("%d\n", n);		for (i = 0; i < n; ++insn, ++i) {			printf("%u %u %u %u\n", insn->code,			       insn->jt, insn->jf, insn->k);		}		return ;	}	if (option > 1) {		for (i = 0; i < n; ++insn, ++i)			printf("{ 0x%x, %d, %d, 0x%08x },\n",			       insn->code, insn->jt, insn->jf, insn->k);		return;	}	for (i = 0; i < n; ++insn, ++i) {#ifdef BDEBUG		extern int bids[];		printf(bids[i] > 0 ? "[%02d]" : " -- ", bids[i] - 1);#endif		puts(bpf_image(insn, i));	}}