Network packet sniffing is an essential skill in the toolbox of any systems programmer or network engineer. It enables
us to inspect network traffic, debug communication issues, and even learn how various networking protocols function
under the hood.
In this article, we will walk through the process of building a simple network packet sniffer in C using raw sockets.
Before we begin, it might help to run through a quick networking primer.
OSI and Networking Layers
Before diving into the code, let’s briefly revisit the OSI model—a conceptual framework that standardizes network
communication into seven distinct layers:
Physical Layer: Deals with the physical connection and transmission of raw data bits.
Data Link Layer: Responsible for framing and MAC addressing. Ethernet operates at this layer.
Network Layer: Handles logical addressing (IP addresses) and routing. This layer is where IP packets are structured.
Transport Layer: Ensures reliable data transfer with protocols like TCP and UDP.
Session Layer: Manages sessions between applications.
Presentation Layer: Transforms data formats (e.g., encryption, compression).
Application Layer: Interfaces directly with the user (e.g., HTTP, FTP).
Our packet sniffer focuses on Layers 2 through 4. By analyzing Ethernet, IP, TCP, UDP, and ICMP headers, we gain
insights into packet structure and how data travels across a network.
The Code
In this section, we’ll run through the functions that are needed to implement our packet sniffer. The layers that we’ll
focus on are:
Layer 2 (Data Link): Capturing raw Ethernet frames and extracting MAC addresses.
Layer 3 (Network): Parsing IP headers for source and destination IPs.
Layer 4 (Transport): Inspecting TCP, UDP, and ICMP protocols to understand port-level communication and message types.
Layer 2 (Data Link)
The Data Link Layer is responsible for the physical addressing of devices on a network. It includes the Ethernet
header, which contains the source and destination MAC addresses. In this section, we analyze and print the Ethernet
header.
The Network Layer handles logical addressing and routing. In our code, this corresponds to the IP header, where we
extract source and destination IP addresses.
voidprint_ip_header(unsignedchar*buffer,intsize){structiphdr*ip=(structiphdr*)(buffer+sizeof(structethhdr));printf("\nIP Header\n");printf(" |-Source IP : %s\n",inet_ntoa(*(structin_addr*)&ip->saddr));printf(" |-Destination IP : %s\n",inet_ntoa(*(structin_addr*)&ip->daddr));printf(" |-Protocol : %d\n",ip->protocol);}
Here, we use the iphdr structure to parse the IP header. The inet_ntoa function converts the source and destination
IP addresses from binary format to a human-readable string.
Layer 4 (Transport)
The Transport Layer ensures reliable data transfer and includes protocols like TCP,
UDP, and ICMP.
We have specific functions to parse and display these packets:
The TCP version of this function has a source and destination for the packet, but also has a sequence and
acknowledgement which are key features for this protocol.
voidprint_tcp_packet(unsignedchar*buffer,intsize){structiphdr*ip=(structiphdr*)(buffer+sizeof(structethhdr));structtcphdr*tcp=(structtcphdr*)(buffer+sizeof(structethhdr)+ip->ihl*4);printf("\nTCP Packet\n");print_ip_header(buffer,size);printf("\n |-Source Port : %u\n",ntohs(tcp->source));printf(" |-Destination Port : %u\n",ntohs(tcp->dest));printf(" |-Sequence Number : %u\n",ntohl(tcp->seq));printf(" |-Acknowledgement : %u\n",ntohl(tcp->ack_seq));}
The UDP counterpart doesn’t have the sequencing or acknowledgement as it’s a general broadcast protocol.
voidprint_udp_packet(unsignedchar*buffer,intsize){structiphdr*ip=(structiphdr*)(buffer+sizeof(structethhdr));structudphdr*udp=(structudphdr*)(buffer+sizeof(structethhdr)+ip->ihl*4);printf("\nUDP Packet\n");print_ip_header(buffer,size);printf("\n |-Source Port : %u\n",ntohs(udp->source));printf(" |-Destination Port : %u\n",ntohs(udp->dest));printf(" |-Length : %u\n",ntohs(udp->len));}
ICMP’s type, code, and checksum are used in the verification process of this protocol.
The architecture of this code is fairly simple. The main function sets up a loop which will continually receive raw
information from the socket. From there, a determination is made about what level the information is at. Using this
information we’ll call/dispatch to a function that specialises in that layer.
intmain(){intsock_raw;structsockaddrsaddr;socklen_tsaddr_len=sizeof(saddr);unsignedchar*buffer=(unsignedchar*)malloc(BUFFER_SIZE);if(buffer==NULL){perror("Failed to allocate memory");return1;}sock_raw=socket(AF_PACKET,SOCK_RAW,htons(ETH_P_ALL));if(sock_raw<0){perror("Socket Error");free(buffer);return1;}printf("Starting packet sniffer...\n");while(1){intdata_size=recvfrom(sock_raw,buffer,BUFFER_SIZE,0,&saddr,&saddr_len);if(data_size<0){perror("Failed to receive packets");break;}process_packet(buffer,data_size);}close(sock_raw);free(buffer);return0;}
The recvfrom receives the raw bytes in from the socket.
The process_packet function is responsible for the dispatch of the information. This is really a switch statement
focused on the incoming protocol:
Because of the nature of the information that this application will pull from your system, you will need to run this as
root. You need that low-level access to your networking stack.
sudo ./psniff
Conclusion
Building a network packet sniffer using raw sockets in C offers valuable insight into how data flows through the
network stack and how different protocols interact. By breaking down packets layer by layer—from the Data Link Layer
(Ethernet) to the Transport Layer (TCP, UDP, ICMP)—we gain a deeper understanding of networking concepts and
system-level programming.
This project demonstrates key topics such as:
Capturing raw packets using sockets.
Parsing headers to extract meaningful information.
Mapping functionality to specific OSI layers.
Packet sniffers like this are not only useful for learning but also serve as foundational tools for network
diagnostics, debugging, and security monitoring. However, it’s essential to use such tools ethically and responsibly,
adhering to legal and organizational guidelines.
In the future, we could extend this sniffer by writing packet payloads to a file, adding packet filtering (e.g., only
capturing HTTP or DNS traffic), or even integrating with libraries like libpcap for more advanced use cases.
A full gist of this code is available to check out.
n this tutorial, we will explore how to write a Linux kernel module that intercepts system calls using kernel probes
(kprobes).
Instead of modifying the syscall table—a risky and outdated approach—we will use kprobes, an officially supported and
safer method to trace and modify kernel behavior dynamically.
What Are System Calls?
System calls are the primary mechanism by which user-space applications interact with the operating system’s kernel.
They provide a controlled gateway to hardware and kernel services. For example, opening a file uses the open syscall,
while reading data from it uses the read syscall.
What Are Kernel Probes?
Kprobes are a powerful debugging and tracing mechanism in the Linux kernel. They allow developers to dynamically
intercept and inject logic into almost any kernel function, including system calls. Kprobes work by placing breakpoints
at specific addresses in kernel code, redirecting execution to custom handlers.
Using kprobes, you can intercept system calls like close to log parameters, modify behavior, or gather debugging
information, all without modifying the syscall table or kernel memory structures.
The Code
We have some preparation steps in order to be able to do Linux Kernel module development. If your system is already
setup to do this, you can skip the first section here.
Before we start, remember to do this in a safe environment. Use a virtual machine or a disposable system for
development. Debugging kernel modules can lead to crashes or instability.
Prerequisites
First up, we need to install the prerequisite software in order to write and build modules:
This tells the kernel which function to monitor dynamically.
The handler_pre function is executed before the intercepted function runs. It logs the file descriptor (fd) argument
passed to the close syscall:
staticinthandler_pre(structkprobe*p,structpt_regs*regs){printk(KERN_INFO"Intercepted close syscall: fd=%ld\n",regs->di);return0;}
In this case, regs->di contains the first argument to the syscall (the file descriptor).
The kprobe_init function initialises the kprobe, registers the handler, and logs its status. If registration fails, an
error message is printed:
staticint__initkprobe_init(void){intret;kp.pre_handler=handler_pre;ret=register_kprobe(&kp);if(ret<0){printk(KERN_ERR"register_kprobe failed, returned %d\n",ret);returnret;}printk(KERN_INFO"Kprobe registered\n");return0;}
The kprobe_exit function unregisters the kprobe to ensure no stale probes are left in the kernel:
Now that we’ve got our module code, we can can build and install our module. The following Makefile will allow us to
build our code:
obj-m += syscall_interceptor.o
all:
make -C /lib/modules/$(shell uname -r)/build M=$(PWD) modules
clean:
make -C /lib/modules/$(shell uname -r)/build M=$(PWD) clean
We build the module:
make
After a successful build, you should be left with a ko file. In my case it’s called syscall_interceptor.ko. This is
the module that we’ll install into the kernel with the following:
sudo insmod syscall_interceptor.ko
Verify
Let’s check dmesg to verify it’s working. As we’ve hooked the close call we should end up with a flood of messages
to verify:
dmesg | tail
You should see something like this:
[ 266.615596] Intercepted close syscall: fd=-60473131794600
[ 266.615596] Intercepted close syscall: fd=-60473131794600
[ 266.615597] Intercepted close syscall: fd=-60473131794600
[ 266.615600] Intercepted close syscall: fd=-60473131794600
[ 266.615731] Intercepted close syscall: fd=-60473131925672
You can unload this module with rmmod:
sudo rmmod syscall_interceptor
Understand Kprobe Handlers
Kprobe handlers allow you to execute custom logic at various stages of the probed function’s execution:
Pre-handler: Runs before the probed instruction.
Post-handler: Runs after the probed instruction (not used in this example).
Fault handler: Runs if an exception occurs during the probe.
Modify the module to add post- or fault-handling logic as needed.
Clean Up
Always unregister kprobes in the module’s exit function to prevent leaving stale probes in the kernel. Use dmesg to
debug any issues during module loading or unloading.
Caveats and Considerations
System Stability: Ensure your handlers execute quickly and avoid blocking operations to prevent affecting system performance.
Kernel Versions: Kprobes are supported in modern kernels, but some symbols may vary between versions.
Ethical Usage: Always ensure you have permission to test and use such modules.
Conclusion
Using kprobes, you can safely and dynamically intercept system calls without modifying critical kernel structures. This
tutorial demonstrates a clean and modern approach to syscall interception, avoiding deprecated or risky techniques like
syscall table modification.
PostgreSQL allows developers to extend its functionality with custom extensions written in C. This powerful feature can
be used to add new functions, data types, or even custom operators to your PostgreSQL instance.
In this blog post, I’ll guide you through creating a simple “Hello, World!” C extension for PostgreSQL and demonstrate
how to compile and test it in a Dockerized environment. Using Docker ensures that your local system remains clean while
providing a reproducible setup for development.
Development
There are a few steps that we need to walk through in order to get your development environment up and running as well
as some simple boilerplate code.
The Code
First, create a working directory for your project:
Now, create a file named example.c and add the following code:
#include"postgres.h"
#include"fmgr.h"
#include"utils/builtins.h" // For cstring_to_text functionPG_MODULE_MAGIC;PG_FUNCTION_INFO_V1(hello_world);Datumhello_world(PG_FUNCTION_ARGS){text*result=cstring_to_text("Hello, World!");PG_RETURN_TEXT_P(result);}
This code defines a simple PostgreSQL function hello_world() that returns the text “Hello, World!”. It uses
PostgreSQL’s C API, and the cstring_to_text function ensures that the string is properly converted to a PostgreSQL
text type.
Let’s take a closer look at a few pieces of that code snippet.
PG_MODULE_MAGIC
PG_MODULE_MAGIC;
This macro is mandatory in all PostgreSQL C extensions. It acts as a marker to ensure that the extension was compiled
with a compatible version of PostgreSQL. Without it, PostgreSQL will refuse to load the module, as it cannot verify
compatibility.
PG_FUNCTION_INFO_V1
PG_FUNCTION_INFO_V1(hello_world);
This macro declares the function hello_world() as a PostgreSQL-compatible function using version 1 of PostgreSQL’s
call convention. It ensures that the function can interact with PostgreSQL’s internal structures, such as argument
parsing and memory management.
Datum
Datumhello_world(PG_FUNCTION_ARGS)
Datum is a core PostgreSQL data type that represents any value passed to or returned by a PostgreSQL function. It is a general-purpose type used internally by PostgreSQL to handle various data types efficiently.
PG_FUNCTION_ARGS is a macro that defines the function signature expected by PostgreSQL for dynamically callable functions. It gives access to the arguments passed to the function.
In this example, Datum is the return type of the hello_world function.
cstring_to_text: This function converts a null-terminated C string (char *) into a PostgreSQL text type. PostgreSQL uses its own text structure to manage string data.
PG_RETURN_TEXT_P: This macro wraps a pointer to a text structure and converts it into a Datum, which is required for returning values from a PostgreSQL C function.
The flow in this function:
cstring_to_text("Hello, World!") creates a text * object in PostgreSQL’s memory context.
PG_RETURN_TEXT_P(result) ensures the text * is properly wrapped in a Datum so PostgreSQL can use the return value.
Control and SQL Files
A PostgreSQL extension requires a control file to describe its metadata and a SQL file to define the functions it
provides.
To build the C extension, you’ll need a Makefile. Create one in the project directory:
MODULES = example
EXTENSION = example
DATA = example--1.0.sql
PG_CONFIG = pg_config
OBJS = $(MODULES:%=%.o)
PGXS := $(shell $(PG_CONFIG) --pgxs)
include $(PGXS)
This Makefile uses PostgreSQL’s pgxs build system to compile the C code into a shared library that PostgreSQL can
load.
Build Environment
To keep your development environment clean, we’ll use Docker. Create a Dockerfile to set up a build environment and
compile the extension:
FROM postgres:latestRUN apt-get update && apt-get install-y\
build-essential \
postgresql-server-dev-all \
&&rm-rf /var/lib/apt/lists/*WORKDIR /usr/src/exampleCOPY . .RUN make && make install
Build the Docker image:
docker build -t postgres-c-extension .
Start a container using the custom image:
docker run --name pg-c-demo -ePOSTGRES_PASSWORD=postgres -d postgres-c-extension
Testing
Access the PostgreSQL shell in the running container:
docker exec-it pg-c-demo psql -U postgres
Run the following SQL commands to create and test the extension:
CREATEEXTENSIONexample;SELECThello_world();
You should see the output:
hello_world
--------------
Hello, World!
(1 row)
Cleaning Up
When you’re finished, stop and remove the container:
docker stop pg-c-demo && docker rm pg-c-demo
Conclusion
By following this guide, you’ve learned how to create a simple C extension for PostgreSQL, compile it, and test it in a
Dockerized environment. This example can serve as a starting point for creating more complex extensions that add custom
functionality to PostgreSQL. Using Docker ensures a clean and reproducible setup, making it easier to focus on
development without worrying about system dependencies.
The ? operator in Rust is one of the most powerful features for handling errors concisely and gracefully. However,
it’s often misunderstood as just syntactic sugar for .unwrap(). In this post, we’ll dive into how the ? operator
works, its differences from .unwrap(), and practical examples to highlight its usage.
What is it?
The ? operator is a shorthand for propagating errors in Rust. It simplifies error handling in functions that return a
Result or Option. Here’s what it does:
For Result:
If the value is Ok, the inner value is returned.
If the value is Err, the error is returned to the caller.
For Option:
If the value is Some, the inner value is returned.
If the value is None, it returns None to the caller.
This allows you to avoid manually matching on Result or Option in many cases, keeping your code clean and readable.
How ? Differs from .unwrap()
At first glance, the ? operator might look like a safer version of .unwrap(), but they serve different purposes:
Error Propagation:
? propagates the error to the caller, allowing the program to handle it later.
.unwrap() panics and crashes the program if the value is Err or None.
Use in Production:
? is ideal for production code where you want robust error handling.
.unwrap() should only be used when you are absolutely certain the value will never be an error (e.g., in tests or prototypes).
Examples
fnread_file(path:&str)->Result<String,std::io::Error>{letcontents=std::fs::read_to_string(path)?;// Propagate error if it occursOk(contents)}fnmain(){matchread_file("example.txt"){Ok(contents)=>println!("File contents:\n{}",contents),Err(err)=>eprintln!("Error reading file: {}",err),}}
In this example, the ? operator automatically returns any error from std::fs::read_to_string to the caller, saving
you from writing a verbose match.
The match is then left as an exercise to the calling code; in this case main.
How it Differs from .unwrap()
Compare the ? operator to .unwrap():
Using ?:
fnsafe_read_file(path:&str)->Result<String,std::io::Error>{letcontents=std::fs::read_to_string(path)?;// Error is propagatedOk(contents)}
Using .unwrap():
fnunsafe_read_file(path:&str)->String{letcontents=std::fs::read_to_string(path).unwrap();// Panics on errorcontents}
If std::fs::read_to_string fails:
The ? operator propagates the error to the caller.
.unwrap() causes the program to panic, potentially crashing your application.
Error Propagation in Action
The ? operator shines when you need to handle multiple fallible operations:
Here, the ? operator simplifies error handling for both read_to_string and write, keeping the code concise and
readable.
Saving typing
Using ? is equivalent to a common error propagation pattern:
Without ?:
fnread_file(path:&str)->Result<String,std::io::Error>{letcontents=matchstd::fs::read_to_string(path){Ok(val)=>val,Err(err)=>returnErr(err),// Explicitly propagate the error};Ok(contents)}
With ?:
fnread_file(path:&str)->Result<String,std::io::Error>{letcontents=std::fs::read_to_string(path)?;// Implicitly propagate the errorOk(contents)}
Chaining
You can also chain multiple operations with ?, making it ideal for error-prone workflows:
Rust’s async and await features bring modern asynchronous programming to the language, enabling developers to write
non-blocking code efficiently. In this blog post, we’ll explore how async and await work, when to use them, and
provide practical examples to demonstrate their power.
What Are async and await?
Rust uses an async and await model to handle concurrency. These features allow you to write asynchronous code that
doesn’t block the thread, making it perfect for tasks like I/O operations, networking, or any scenario where waiting on
external resources is necessary.
Key Concepts:
async:
Marks a function or block as asynchronous.
Returns a Future instead of executing immediately.
await:
Suspends the current function until the Future completes.
Only allowed inside an async function or block.
Getting Started
To use async and await, you’ll need an asynchronous runtime such as Tokio or
async-std. These provide the necessary infrastructure to execute asynchronous tasks.
say_hello is an async function that prints messages and waits for 2 seconds without blocking the thread.
The .await keyword pauses execution until the sleep operation completes.
Running Tasks Concurrently with join!
usetokio::time::{sleep,Duration};asyncfntask_one(){println!("Task one started");sleep(Duration::from_secs(2)).await;println!("Task one completed");}asyncfntask_two(){println!("Task two started");sleep(Duration::from_secs(1)).await;println!("Task two completed");}#[tokio::main]asyncfnmain(){tokio::join!(task_one(),task_two());println!("All tasks completed");}
Explanation:
join! runs multiple tasks concurrently.
Task two finishes first, even though task one started earlier, demonstrating concurrency.
Error handling is built-in with Result and the ? operator.
Spawning Tasks with tokio::task
usetokio::task;usetokio::time::{sleep,Duration};asyncfndo_work(id:u32){println!("Worker {} starting",id);sleep(Duration::from_secs(2)).await;println!("Worker {} finished",id);}#[tokio::main]asyncfnmain(){lethandles:Vec<_>=(1..=5).map(|id|task::spawn(do_work(id))).collect();forhandleinhandles{handle.await.unwrap();// Wait for each task to complete}}
You need an async runtime like Tokio or async-std to execute async functions.
Concurrency:
Rust’s async model is cooperative, meaning tasks must yield control for others to run.
Error Handling:
Combine async with Result for robust error management.
State Sharing:
Use Arc and Mutex for sharing state safely between async tasks.
Conclusion
Rust’s async and await features empower you to write efficient, non-blocking code that handles concurrency
seamlessly. By leveraging async runtimes and best practices, you can build high-performance applications that scale
effortlessly.
Start experimenting with these examples and see how async and await can make your Rust code more powerful and
expressive. Happy coding!