0 views collected around this technical thread.
This article provides a comprehensive overview of glibc's heap memory management, explaining the role of brk and mmap, the organization of arenas, heaps, chunks, bin structures, allocation and deallocation strategies, and how these concepts are applied in security research and exploit development.
This article explains the role of glibc malloc in dynamic memory allocation, describes its internal data structures and allocation/free algorithms, provides a C code example, and offers practical optimization tips and common pitfalls for safe and efficient memory management.
The article examines a production RocksDB memory‑usage problem where two instances consumed 59 GB on a 32‑CPU, 64‑GB server, identifies glibc ptmalloc’s unreclaimed free memory as the main cause, and shows that switching to jemalloc cuts usage by roughly 25 % while improving I/O and CPU efficiency.
The article examines a real‑world memory alarm in a Vivo service, explains how glibc’s ptmalloc allocator manages heap memory via brk, sbrk, and mmap, shows why freed chunks stay in bins, and recommends limiting heap growth or switching to jemalloc for faster reclamation.
The article details the complete process of porting QQ's NTRTC audio/video SDK to Linux, covering platform surveys, packaging, build‑time issues like GLIBC mismatches and fPIC errors, debugging steps, Qt/Electron demos, GPU blocklist workarounds, and future compatibility plans.
This article recounts a failed Node.js installation on an older Ubuntu server caused by a missing GLIBC 2.28 library, details the attempted GLIBC upgrade script that led to system-wide segmentation faults, and explains how reinstalling a newer Ubuntu version resolved the issue while emphasizing careful backup practices.
This article explains how the glibc malloc implementation (ptmalloc) manages memory by using arenas, chunks, and various bin structures such as fastbins, smallbins, largebins, and unsorted bins, and describes the step‑by‑step allocation process performed by public_mALLOc and its helper functions.
The article explains how glibc’s default ptmalloc allocator structures memory into main and non‑main arenas, uses chunk‑based bins (fast, unsorted, small, large) for allocation and deallocation, details its locking and OS‑interaction mechanisms, and evaluates its design trade‑offs versus modern allocators.
This article explains CPU registers, stack layout, function call conventions, and provides detailed explanations of how glibc implements memcpy and memset both in C and in low‑level assembly, including code snippets and the handling of remaining bytes.
The article explains how salt‑minion’s DNS resolution can become stale after a data‑center migration because each Linux process caches resolver settings in a private _res structure initialized by glibc’s res_init(), and it offers practical ways to force a refresh or redesign the lookup mechanism.