📄 bpf_dump.c
字号:
/*
* Copyright (c) 1992, 1993, 1994, 1995
* 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.
*/
#include <stdio.h>
#include <sys/types.h>
#include "interfac.h"
void bpf_dump (struct bpf_program *p, int option)
{
#ifdef BDEBUG
extern int bids[];
#endif
struct bpf_insn *insn = p->bf_insns;
int i, n = p->bf_len;
if (option > 2)
{
printf ("%d\n", n);
for (i = 0; i < n; insn++, i++)
printf ("%3u %3u %3u %lu\n", insn->code, insn->jt, insn->jf, insn->k);
return;
}
if (option > 1)
{
for (i = 0; i < n; insn++, i++)
printf ("{ 0x%02x, %2d, %2d, 0x%08lx },\n",
insn->code, insn->jt, insn->jf, insn->k);
return;
}
for (i = 0; i < n; ++insn, i++)
{
if (i == 0)
#ifdef BDEBUG
printf (" Addr instr jump true false\n");
printf (bids[i] > 0 ? "[%02d]" : " -- ", bids[i] - 1);
#else
printf (" Addr instr jump true false\n");
#endif
puts (bpf_image(insn,i));
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -