Otherwise the `make` fails with lack of `FlexLexer.h` error.
|1 day ago|
|.github/workflows||4 months ago|
|SPECS||2 years ago|
|cmake||1 month ago|
|debian||2 months ago|
|docs||2 weeks ago|
|examples||2 weeks ago|
|images||2 years ago|
|introspection||2 months ago|
|libbpf-tools||3 days ago|
|man||2 weeks ago|
|scripts||5 months ago|
|snap||1 year ago|
|src||3 days ago|
|tests||2 weeks ago|
|tools||1 week ago|
|.clang-format||4 years ago|
|.dockerignore||6 years ago|
|.gitignore||5 months ago|
|.gitmodules||2 years ago|
|.travis.yml||2 years ago|
|CMakeLists.txt||1 month ago|
|CODEOWNERS||4 years ago|
|CONTRIBUTING-SCRIPTS.md||2 years ago|
|Dockerfile.debian||4 years ago|
|Dockerfile.tests||5 months ago|
|Dockerfile.ubuntu||4 months ago|
|FAQ.txt||1 year ago|
|INSTALL.md||16 hours ago|
|LICENSE.txt||6 years ago|
|LINKS.md||1 year ago|
|QUICKSTART.md||4 years ago|
|README.md||2 weeks ago|
BCC is a toolkit for creating efficient kernel tracing and manipulation programs, and includes several useful tools and examples. It makes use of extended BPF (Berkeley Packet Filters), formally known as eBPF, a new feature that was first added to Linux 3.15. Much of what BCC uses requires Linux 4.1 and above.
eBPF was described by Ingo Molnár as:
One of the more interesting features in this cycle is the ability to attach eBPF programs (user-defined, sandboxed bytecode executed by the kernel) to kprobes. This allows user-defined instrumentation on a live kernel image that can never crash, hang or interfere with the kernel negatively.
BCC makes BPF programs easier to write, with kernel instrumentation in C (and includes a C wrapper around LLVM), and front-ends in Python and lua. It is suited for many tasks, including performance analysis and network traffic control.
This example traces a disk I/O kernel function, and populates an in-kernel power-of-2 histogram of the I/O size. For efficiency, only the histogram summary is returned to user-level.
# ./bitehist.py Tracing... Hit Ctrl-C to end. ^C kbytes : count distribution 0 -> 1 : 3 | | 2 -> 3 : 0 | | 4 -> 7 : 211 |********** | 8 -> 15 : 0 | | 16 -> 31 : 0 | | 32 -> 63 : 0 | | 64 -> 127 : 1 | | 128 -> 255 : 800 |**************************************|
The above output shows a bimodal distribution, where the largest mode of 800 I/O was between 128 and 255 Kbytes in size.
See the source: bitehist.py. What this traces, what this stores, and how the data is presented, can be entirely customized. This shows only some of many possible capabilities.
See INSTALL.md for installation steps on your platform.
See FAQ.txt for the most common troubleshoot questions.
See docs/reference_guide.md for the reference guide to the bcc and bcc/BPF APIs.
Some of these are single files that contain both C and Python, others have a pair of .c and .py files, and some are directories of files.
Tools that help to introspect BPF programs.
BPF guarantees that the programs loaded into the kernel cannot crash, and cannot run forever, but yet BPF is general purpose enough to perform many arbitrary types of computation. Currently, it is possible to write a program in C that will compile into a valid BPF program, yet it is vastly easier to write a C program that will compile into invalid BPF (C is like that). The user won't know until trying to run the program whether it was valid or not.
With a BPF-specific frontend, one should be able to write in a language and receive feedback from the compiler on the validity as it pertains to a BPF backend. This toolkit aims to provide a frontend that can only create valid BPF programs while still harnessing its full flexibility.
Furthermore, current integrations with BPF have a kludgy workflow, sometimes involving compiling directly in a linux kernel source tree. This toolchain aims to minimize the time that a developer spends getting BPF compiled, and instead focus on the applications that can be written and the problems that can be solved with BPF.
The features of this toolkit include:
In the future, more bindings besides python will likely be supported. Feel free to add support for the language of your choice and send a pull request!
At Red Hat Summit 2015, BCC was presented as part of a session on BPF. A multi-host vxlan environment is simulated and a BPF program used to monitor one of the physical interfaces. The BPF program keeps statistics on the inner and outer IP addresses traversing the interface, and the userspace component turns those statistics into a graph showing the traffic distribution at multiple granularities. See the code here.
Already pumped up to commit some code? Here are some resources to join the discussions in the IOVisor community and see what you want to work on.
Looking for more information on BCC and how it's being used? You can find links to other BCC content on the web in LINKS.md.