This article explains the nature of the 127.0.0.1 loopback address, why pinging it works without a physical network connection, the differences between 127.0.0.1, localhost and 0.0.0.0, and how the kernel processes loopback traffic using a virtual network interface.
This guide explains how Linux processes share physical memory using the shmget, shmat, and shmdt system calls, detailing their prototypes, parameters, example programs, kernel structures, and the internal workings of the associated kernel functions.
This article explains the inner workings of KernelAddressSanitizer (KASAN) in the Linux kernel, covering how to enable it, the shadow‑memory mechanism, redzone handling for heap, global and stack allocations, and how to interpret the detailed KASAN bug reports generated at runtime.
This article explains how Linux allocates memory for a process, the role of OOM when memory runs out, where different types of memory reside, the behavior of shared and private mappings, tmpfs usage, and both manual and automatic memory reclamation mechanisms.
This article explains Linux kernel memory management by covering process address space layout, allocation mechanisms, OOM killer behavior, overcommit settings, various types of file and anonymous mappings, tmpfs usage, and both manual and automatic memory reclamation techniques.
The article explains the Linux kernel boot process on ARM platforms, covering how the bootloader loads and decompresses the gzipped kernel image, the entry points of the compressed zImage, the early serial output, the initialization of the MMU and page tables, and the transition to the main C kernel code.
This article explains the layered architecture of the Linux network subsystem, the TCP/IP model implementation, how hardware and soft interrupts are registered and processed, the role of ksoftirqd and NAPI, and the complete send/receive packet flow from NIC to protocol stack.
A Chinese tech blogger retrieved the Android kernel source from UMIDIGI after a GPLv2 violation controversy, documented the process in a YouTube video, and made the code publicly available for developers to review.
This article explains the Linux kernel's process for selecting a client-side TCP port during connect() and bind(), covering the relevant source code, random port selection algorithm, conflict checks, and common error scenarios such as "Cannot assign requested address".
Linux cgroups are a kernel mechanism that groups processes into hierarchical directories, each subsystem (e.g., freezer, CPU, memory, IO) exposing control files such as cgroup.procs and freezer.state, with core data structures like cgroup_subsys, cgroup, css_set linking threads to multiple subsystems and enabling resource policies, freezing, throttling, and allocation.
This article explains the layered architecture of the Linux network stack, maps the TCP/IP model to Linux implementation, and details how hardware and soft interrupts, ksoftirqd threads, and NAPI cooperate with driver initialization to process packet reception and transmission.
This tutorial walks you through the Linux kernel source layout, required build tools, cross‑compilation setup, how to compile a kernel image, generate device‑tree blobs, build standalone .ko modules, and integrate those modules into a custom kernel for ARM boards.
This article explains the complete kernel‑level implementation of the TCP three‑way handshake, covering server listen queue allocation, client connect state handling, SYN/SYN‑ACK processing, syncookie protection, timer management, socket creation, and the accept path, with detailed code examples.
The Linux community announced the first release candidate of the 5.14 kernel, featuring contributions from about 1,650 developers, over 13,000 commits, new memfd_secret system call, extensive driver and architecture updates, and numerous core subsystem enhancements.
This article explains how Docker leverages Linux namespaces to isolate system resources, outlines the six core namespaces and newer additions, clarifies common misconceptions such as the Mount namespace flag, and details the internal nsproxy structure that links processes to their namespaces.
This article explains why Linux uses virtual IRQ numbers, describes the irq_domain framework and its data structures, compares linear, tree, and no‑mapping strategies, and walks through the complete interrupt‑mapping process on an ARM64 platform with code examples.
This article explains the object‑oriented design of the Linux VFS, details the four core VFS structures, shows how ext4 is registered and mounted via register_filesystem and ext4_mount, and walks through the six‑step ext4_fill_super process for initializing superblocks and related metadata.
This article explains the four core parts of a Linux system—kernel, shell, filesystem and applications—covering memory and process management, VFS architecture, file types, directory hierarchy, partitioning, mounting, links and essential command‑line tools.
On Linux, the client port used in a TCP connection is selected either by the kernel during the connect system call—randomly scanning the ip_local_port_range while respecting reserved ports—or by a prior bind call, with detailed kernel functions such as inet_hash_connect and __inet_hash_connect governing the process.
The article walks through Linux’s mmap file‑read workflow—from the kernel entry point and VMA creation, through page‑fault handling that allocates pages and invokes synchronous or asynchronous readahead, to munmap’s unmapping steps and the deferred file‑cache reclamation mechanisms.
An intermittent 403 error caused by nginx reuseport misrouting on a shared IP was traced to kernel listener hash table ordering; upgrading the Linux kernel from 4.14 to 4.16+ resolved the issue by prioritizing IP+PORT over INADDR_ANY lookups.
This article explains the Linux kernel scheduler's core concepts, walks through the initialization code of the 5.4 kernel (including run queues, scheduling classes, domains, and groups), and details how multi‑core and NUMA topologies are handled to achieve balanced CPU usage.
This article provides a comprehensive overview of Linux's core components—including the kernel, shell, virtual file system, various filesystem types, directory hierarchy, disk partition schemes, mounting procedures, and linking mechanisms—while illustrating key concepts with commands, code snippets, and diagrams for practical system administration.
This comprehensive guide walks through Linux memory management, explaining CPU memory access, virtual‑to‑physical address translation, page‑table initialization, zone organization, the buddy allocator, slab allocator, vmalloc, page‑fault handling, and CMA, providing code examples and diagrams to form a complete understanding.
The article surveys several unconventional Linux filesystems—OverlayFS for layered read‑only overlays, IncFS enabling incremental app loading, ZoneFS exposing zoned block device zones, LTFS bringing true file‑system semantics to magnetic tape, and StegFS hiding data steganographically—highlighting their unique designs and use cases.
This article explains Linux scheduling fundamentals, describing the task_struct fields, scheduling classes, runqueue organization, the scheduling workflow including flag setting and execution, and the details of the context_switch function that performs address‑space and register state switches.
This comprehensive guide walks you through selecting a secure Linux distribution, configuring kernel and sysctl parameters, applying boot‑time hardening, managing network and firewall rules, restricting root access, enabling MAC policies, sandboxing applications, and employing advanced memory and entropy techniques to dramatically improve system privacy and resilience against attacks.
This article explains the Linux PM QoS framework, detailing its background, system‑ and device‑level constraints, core data structures, key API functions, and a practical example of limiting CPU‑DMA latency for power‑efficient device operation.
This article provides a deep, step‑by‑step analysis of how Linux 3.10 processes a send() call—from user‑space socket handling through TCP, IP routing, queueing, driver DMA mapping, and both hard and soft interrupt handling—answering why CPU time appears in sy/si, why NET_RX softirqs dominate, and what memory copies occur during transmission.
This comprehensive guide explains how to dramatically improve Linux security and privacy by selecting hardened distributions, configuring kernel and boot parameters, applying sysctl tweaks, disabling unnecessary services, using MAC frameworks, sandboxing applications, hardening memory allocation, and following best‑practice system administration steps.
This guide explains why adhering to the Linux kernel coding style matters, introduces automatic tools such as checkpatch.pl, Lindent, and astyle for fixing style violations, and details the core conventions for indentation, line length, brace placement, naming, comments, macros, and other critical aspects of kernel C code.
After a week‑long delay, Linux Kernel 5.12 was officially released, introducing variable refresh‑rate support for Intel Xe GPUs, Radeon RX 6000 overclocking, Nintendo 64 mainline support, a PlayStation 5 DualSense driver, CXL 2.0 storage support, KFENCE, dynamic preemption, faster Clang linking, and numerous laptop‑related enhancements.
After a week-long delay, Linus Torvalds announced the official release of Linux kernel 5.12, highlighting support for Intel Xe GPU variable refresh rates, C language link‑time optimization (LTO), kernel fencing (KFENCE), and overclock profiles for AMD Radeon RX 6000 series, while noting it’s a modest update ahead of the larger 5.13.
Linux’s Virtual File System (VFS) acts as a glue layer between user space and various file systems, providing a unified interface and object model—including superblocks, inodes, file and dentry objects—and employs caching mechanisms like dcache to efficiently manage directory entries.
After a week-long series of experiments measuring TCP connections in various states—including ESTABLISH, client‑to‑server, server‑to‑client, and non‑ESTABLISH scenarios—the author quantifies per‑connection memory usage and shows how modern kernels reclaim buffers and reduce overhead, especially for TIME_WAIT.
This article breaks down Android's power‑button handling pipeline, detailing the hardware interrupt registration, kernel‑to‑user‑space event propagation, strategy‑based decision making, and the intricate wake‑up and sleep sequences that control screen illumination.
This article dissects Linux's synchronous blocking network I/O implementation, explaining how socket creation, recv handling, and soft‑interrupt processing each incur context‑switch overhead that makes BIO unsuitable for high‑concurrency server workloads.
This article explains why synchronous blocking network I/O (BIO) is a performance bottleneck in high‑concurrency Linux servers, detailing the kernel‑level steps of socket creation, the recv path, soft‑interrupt handling, and how processes are blocked and later awakened.
This article explains the Linux virtual file system (VFS) architecture, its role in abstracting concrete file systems, and details core kernel structures such as superblocks, inodes, dentries, file objects, and their relationships to processes, providing code examples and diagrams for clarity.
This comprehensive guide explores Linux's four main components—kernel, shell, filesystem, and applications—detailing kernel architecture, memory and process management, VFS, device drivers, networking, file types, directory structures, mounting, and practical commands for managing partitions and links.
This article explains the Linux I/O stack, detailing how data moves from user‑space buffers through libc and page cache to the disk, covering system calls, synchronization primitives, scheduler behavior, consistency, safety, and performance considerations.
This article explains the concept of per‑CPU variables in the Linux kernel, how they are defined with DEFINE_PER_CPU, linked into the .data..percpu section, initialized during boot, and accessed at runtime via the GS register and macro expansions such as this_cpu_read_stable.
This article provides a comprehensive, step‑by‑step walkthrough of how Linux handles system calls, covering the low‑level assembly entry point, register conventions, the sys_call_table registration process, struct pt_regs usage, and a practical write‑syscall example with a custom extension.
This article provides a detailed, step‑by‑step walkthrough of the Linux kernel’s packet‑receiving path, covering NIC DMA, hardware and soft interrupts, ksoftirqd threads, NAPI polling, protocol‑stack registration, IP/UDP processing, and the final recvfrom system call that delivers data to user space.
This article presents a seven‑day experiment measuring how much memory a TCP connection occupies in the kernel under various states such as ESTABLISH, data transfer, and TIME_WAIT, and summarizes the kernel's memory‑optimisation techniques for sockets.
The article explains how the Linux kernel discovers and calls module initialization functions like inet_init by using the fs_initcall macro, which creates static initcall variables placed in specially‑named sections that the linker groups and the kernel iterates at boot time.
This article explains how Linux 3.10 organizes memory using NUMA nodes, zones, the buddy system, and the SLAB allocator, providing commands, code examples, and visual diagrams to illustrate each layer of the kernel's efficient memory management.
This article explains the Linux kernel memory management hierarchy—including NUMA nodes, memory zones, the buddy system for free pages, and the SLAB allocator—providing command‑line examples, code snippets, and visual diagrams to illustrate how the kernel efficiently allocates and reclaims memory.
Teen developer Daniel Rodriguez repurposes a non‑functional iPhone 7 by jailbreaking it, building a custom Ubuntu 20.04 root filesystem, compiling a tailored kernel, and using projectsandcastle and PongoOS to boot Linux, effectively turning the device into a networked ARM64 server.
This article provides a comprehensive overview of Linux's core components—including the kernel, memory and process management, virtual file system, device drivers, network stack, shell variants, file types, directory hierarchy, partitioning, mounting, and essential command‑line tools—while illustrating each concept with diagrams and code examples.
This guide shows how to increase the number of concurrent TCP connections on a Linux server by adjusting kernel parameters, expanding file descriptor limits, and understanding the underlying socket structures and lookup mechanisms that govern connection handling.
This article explores Linux’s TCP socket implementation, showing how to adjust system limits, dissecting key kernel structures like sock_common, and walking through the tcp_v4_rcv processing path and inet lookup functions, ultimately revealing methods to scale client connections beyond the traditional 65 535 port limit.
A production Kubernetes cluster experienced intermittent network jitter caused by the IPVS estimation_timer soft‑interrupt, and the article details how BPF tracing, perf analysis, and a kpatch live‑patch were used to identify and eliminate the latency without rebooting the nodes.
This article explains the principles, use cases, and kernel implementation of Linux connection tracking (conntrack), covering its role in NAT, L4 load balancing, Netfilter hook mechanisms, key data structures, core functions, and performance considerations.
The article explains why a client can successfully write to a TCP socket after the server has closed its end, why the first write succeeds while the second fails, and how Linux kernel code and TCP state transitions cause this behavior.
This article explains the differences and purposes of Linux I/O flushing mechanisms—including fsync(), fdatasync(), sync(), the O_DIRECT and O_SYNC open flags, and the REQ_PREFLUSH and REQ_FUA bio request flags—illustrated with dd experiments, kernel flag tables, and practical commands for managing disk write caches.
This article walks through the complete Linux kernel path a network packet follows—from the NIC’s DMA and hardware interrupt, through soft‑interrupt handling, NAPI polling, protocol‑stack registration, IP and UDP processing, all the way to the user‑space recvfrom system call—revealing the many hidden steps that make packet reception possible.
Linux uses swapping to move rarely used memory pages to disk, alleviating memory pressure and reclaiming idle memory, but the performance impact of disk I/O can cause latency; this article explains the mechanisms, triggers, and kernel functions behind swapping, including direct reclaim, kswapd, and LRU lists.
This guide explains WireGuard's strict kernel requirements, shows how to upgrade kernels on various Linux distributions, provides detailed commands for installing WireGuard on older kernels, and introduces a one‑click script that automates configuration, firewall adjustments, and client management.
This article explains the fundamentals of Linux ftrace, details the event‑tracing mechanism and tracepoint macros, shows how to enable and filter events on ARM64 Android devices, and demonstrates a practical workflow for capturing low‑probability scheduling bugs in camera‑related processes.
An imaginative tale reveals how two covert agents exploit the Linux kernel’s DelayedACKLost counter via /proc/net/netstat, using it to infer TCP sequence numbers and perform a side‑channel hijack, while illustrating the underlying delayed ACK mechanism, related kernel functions, and the security implications of this hidden metric.
This article explains how to monitor and tune Linux network packet reception using tools such as ethtool, ifconfig, and procfs, covering RingBuffer inspection, hardware and soft interrupt analysis, multi‑queue configuration, interrupt coalescing, and GRO settings to improve throughput and reduce packet loss.
Linux 5.10 brings a slew of network upgrades—including bundled BPF programs, support for over 255 IPv4 multicast interfaces, MPTCP refinements, Intel IGB XDP support, new Wi‑Fi driver chips, up to 20% performance gains for Mellanox NICs, and a BPF helper that boosts TCP throughput from 10 Gbps to 15 Gbps.
This article explains the concepts of kernel space and user space in a 32‑bit OS, why they are separated, the distinction between kernel mode and user mode, how processes transition between them, and the overall Linux system structure.
A comprehensive guide walks through Linux fundamentals, covering the UNIX heritage, kernel structure, system calls, process and thread creation, inter‑process communication, memory management, file‑system design, I/O handling, scheduling algorithms, modules, and built‑in security mechanisms.
This article explains Linux process memory organization, detailing how task_struct and mm_struct describe virtual memory, the role of vm_area_struct for each segment, page table interactions, and the lazy allocation mechanism that maps physical memory only on page faults.
This comprehensive guide breaks down the four main parts of a Linux system—kernel, shell, filesystem and applications—detailing kernel subsystems such as memory and process management, shell variants, file types, directory hierarchy, partition handling, VFS, mounting procedures, link types and essential command‑line tools, while also touching on application bundles and kernel parameter tuning.
This article explains how a user‑level program becomes a Linux process, how the kernel views it through ELF loading, the role of the task_struct data structure, its key fields, task state transitions, and how the kernel stores the descriptor in memory.
The article explains that kernel code must copy user‑space buffers with copy_from_user rather than using memcpy, covering the necessity of copying, the built‑in access checks, page‑fault handling, security implications, and modern hardware safeguards like PAN.
This article provides a comprehensive, illustrated explanation of how Linux receives network packets—from hardware DMA and interrupt handling through soft‑interrupt processing, NAPI polling, protocol stack registration, and finally delivery to user‑space via recvfrom—detailing each kernel component and relevant source code.
This comprehensive guide explores Linux’s four core components—kernel, shell, filesystem, and applications—detailing kernel architecture, memory and process management, VFS, device drivers, network interfaces, shell types, file types, directory structures, mounting, and essential command-line tools for system administration.
This guide shows a quick user‑space technique to conceal a Linux process by overwriting its PID with an unused value using a short SystemTap script, includes the exact code, execution steps, detection method, and a brief explanation of why it works.
This comprehensive guide walks through Linux's core components—including the kernel, shell, and file system—explaining memory and process management, VFS architecture, partition types, mounting procedures, common commands, and optimization tips, all illustrated with diagrams and practical examples.
This article provides a comprehensive overview of Linux’s core architecture, detailing the kernel, shell, memory and process management, virtual file system, various file system types, directory structures, partitioning, mounting procedures, and link mechanisms, offering readers a solid foundation for mastering Linux systems.
This comprehensive guide explores Linux's core components—including the kernel, shell, memory and process management, file systems, device drivers, network interfaces, mounting mechanisms, and link types—providing clear explanations, diagrams, and command examples for anyone learning operating system fundamentals.
This article walks through the design and implementation of a tiny Linux filesystem called TinyFS, explaining the VFS layers, required POSIX interfaces, data structures, core kernel code, usage steps, current limitations, and a roadmap for extending it with proper superblocks, concurrency, and page‑cache integration.
This article explains how Linux organizes a process's address space into text, data, and stack segments, describes virtual memory concepts such as paging, page tables, and page faults, and details the kernel's allocation, deallocation, and memory‑mapping mechanisms including brk, mmap, and the buddy allocator.
This article details how to diagnose and resolve Nginx load‑balancing performance issues under extreme concurrency by analyzing NIC packet loss, kernel SYN drops, backlog limits, and applying systematic kernel, network‑card, and Nginx configuration optimizations that raise QPS from 20,000+ to over 40,000.
This comprehensive guide explores Linux memory fundamentals, address space layout, fragmentation, buddy and slab allocation algorithms, kernel and user‑space memory pools, DMA handling, common pitfalls in C/C++ memory management, and practical commands for monitoring and debugging memory usage on Linux systems.
This article explains the Linux CPU‑idle framework, detailing the idle governor architecture, the entry and exit flow, key data structures, and the menu governor’s prediction and correction algorithms that balance power savings with performance latency.
This article provides a comprehensive guide to Linux memory management, covering the memory organization, address spaces, fragmentation causes and mitigation, the buddy and slab allocation algorithms, kernel and user‑space memory pools, common pitfalls, and practical tools for monitoring and debugging memory usage.
This comprehensive guide explores Linux memory architecture, address spaces, paging, fragmentation, buddy and slab allocation algorithms, kernel and user‑space memory pools, DMA handling, practical usage scenarios, and common pitfalls, providing developers with actionable insights to optimize system performance.
The article explains how Android’s mount command shows numerous dm devices, detailing the Linux storage stack layers, using the OPPO Reno3 as a case study to illustrate the creation and purpose of dm devices, and poses why dm‑0 disappears from Android versions after Q.
Linux system calls provide the interface between user programs and the kernel, and this article explains the three implementation methods—software interrupts, fast syscall instructions (SYSENTER/SYSCALL), and the virtual dynamic shared object (vDSO)—detailing their operation, performance impact, and relevant assembly code examples.
sdcardfs is a kernel-space stackable virtual file system built on wrapfs, replacing FUSE on Android O, offering better I/O performance by reducing user‑kernel transitions and avoiding double caching, while not managing actual SD cards; it forwards operations directly, achieving near‑native speeds.
This article provides a comprehensive overview of Linux, covering its four main components—kernel, shell, file system, and applications—detailing kernel responsibilities such as memory and process management, the role of the virtual file system, device drivers, networking, shell types, file types, directory structures, disk partitioning, mounting mechanisms, hard and symbolic links, and essential command‑line tools for system administration.
This comprehensive guide explains over 190 fundamental operating system and computer architecture concepts—including OS kernels, memory management, process control, virtualization, storage, networking, and security—providing clear definitions, examples, and visual illustrations to help readers grasp the core building blocks of modern computing systems.
This article explains how Linux maps logical to physical addresses, describes the buddy and slab memory allocation mechanisms, outlines their limitations and improvements such as slub and vmalloc, and details the page‑fault handling process including registers involved and swap behavior.
This article explains how a simple read of a single byte in user space triggers a complex Linux I/O stack involving the read system call, VFS, page cache, generic block layer, and I/O scheduler, and clarifies when actual disk I/O occurs and how many bytes are transferred.
This article explains Linux’s layered filesystem architecture, detailing how generic API calls like read interact with the VFS, superblock, inode, dentry, and buffer cache, and demonstrates mounting a filesystem using loop devices, dd, losetup, mke2fs, and mount commands.
The article explains the design and operation of Linux’s BFQ (Budget Fair Queueing) I/O scheduler, its algorithmic advantages over CFQ, performance test results, and the reasons it outperforms other schedulers, concluding with its growing adoption in major projects.
This article provides a comprehensive overview of operating system fundamentals and computer architecture, covering topics such as OS components, kernel and user modes, memory management, process handling, hardware interfaces, storage hierarchies, virtualization, and related historical and modern systems in roughly eighty concise entries.
This article explains how Linux kernels receive network packets—from NIC hardware interrupts through NAPI polling, kernel TCP/IP processing, and finally to user‑space sockets—while also covering interrupt handling, buffer tuning, and performance‑optimizing techniques for SREs.
This article explains the Linux kernel's wait‑queue mechanism, the sleep and wake‑up logic behind socket events, and how the IO‑multiplexing models select, poll, and epoll are implemented, including their core code paths, performance trade‑offs, and edge versus level triggering.
The Linux 5.3 series receives its final maintenance release (5.3.18) with 59 file changes, after which support ends, prompting users and distro maintainers to upgrade to the newer 5.4 kernel, which introduces long‑awaited exFAT filesystem support and the Lockdown security feature.
A four‑year‑old girl submitted a one‑character patch to the Linux kernel that added a dash for proper alignment, illustrating the openness of the kernel project, the meticulous nature of its codebase, and the surprising impact of even the smallest contributions.
This article provides a comprehensive analysis of Linux's epoll mechanism, covering its fundamental data structures, key kernel functions, wait‑queue handling, event insertion, wake‑up logic, and the differences between edge‑triggered and level‑triggered modes, while including full source code excerpts for reference.
An extensive guide walks through Linux’s core components—kernel, memory and process management, VFS, device drivers, networking, shells, filesystem hierarchy, partitioning, mounting, and link types—detailing their structures, key commands, and practical examples for system administrators and developers.
This comprehensive guide explains the core components of a Linux system—including the kernel, memory management, process scheduling, device drivers, networking, shells, file‑system types, VFS architecture, mounting procedures, and link handling—providing clear examples, commands, and diagrams for each topic.
This article provides an in‑depth exploration of Linux’s timekeeping subsystem, covering how the kernel initializes and maintains system time, reads timestamps via vDSO and sequential locks, manages timers with various algorithms, and explains the underlying quartz crystal oscillator that generates the hardware clock.
