This article explains the inner workings of the classic strace command by building a minimal tracer in C, detailing how ptrace attaches to a target process, sets up syscall tracing, waits for signals, reads the ORIG_RAX register, and prints system call names, while also exposing the relevant Linux kernel source.
The article explains how memory pools reduce allocation overhead and fragmentation by pre‑allocating large memory blocks, describes their implementation in C++ and the Linux kernel, compares various pool designs, and shows practical scenarios where pools improve performance and stability.
The Word Break problem (LeetCode 139) asks whether a given string can be segmented into a sequence of dictionary words, and can be solved efficiently with dynamic programming by tracking reachable prefixes in a boolean array, as demonstrated by concise Java and C++ implementations.
This article introduces log.c, a compact C99 logging library suitable for any platform—including embedded systems—covers its key features, demonstrates usage with code examples, and explains how to configure log levels, file output, callbacks, multithreading, and colored output.
Microsoft rewrote the TypeScript compiler in Go, achieving a nine‑to‑tenfold speed boost, and explains that Go’s low‑level design, built‑in garbage collection, cross‑platform compilation, and functional‑style compatibility made it a better fit than C#, reflecting both technical advantages and Microsoft’s internal “Eat Dog Food” culture.
This article benchmarks dozens of programming languages by measuring the time to execute a one‑billion‑iteration nested loop on an M3 MacBook Pro, revealing that compiled languages like C, Rust and Java finish in about half a second while interpreted languages such as Python and Ruby take tens of seconds, and provides detailed version information, test commands, and additional results for many other languages.
This article walks through the LeetCode 77 "Combinations" problem, explaining the backtracking approach, presenting detailed examples, constraints, and providing complete implementations in Java, C++, and Python for generating all k‑element subsets of the range [1, n].
The article explains what the C/C++ runtime library is, how it implements essential services such as memory allocation, I/O and language features, compares it to Java, Python and JavaScript runtimes, details platform‑specific implementations (glibc, MSVC CRT, libc++, Bionic, etc.), and warns about common pitfalls like multiple CRT instances or version mismatches that can cause crashes.
This article explains how to identify and resolve multithreaded deadlocks in Linux C++ programs by using shell utilities such as ps and top for initial diagnosis, then attaching GDB to inspect thread stacks and pinpoint the exact lock contention causing the freeze.
The TIOBE February 2025 index shows Python leading, C++ rising to second, Go staying in the top ten and Rust hitting a 1.47 % share, while a 1‑billion‑loop benchmark on a MacBook Pro finds Zig, Rust and C finishing in ~0.5 s versus Python’s 31.6 s and R’s 72.6 s, and survey data highlight Python’s dominance across data analysis, web development, DevOps, web crawling, machine learning and education.
This article explains why Linux programs may exit unexpectedly, introduces the backtrace utility and its underlying call‑stack mechanism, and provides step‑by‑step instructions—including compilation flags, signal handling, and address‑to‑source mapping—to accurately locate the root cause of crashes.
This article explains common causes of unexpected Linux program termination and demonstrates how to employ the backtrace utility, along with signal handling and related functions, to capture and analyze stack traces, enabling precise identification and resolution of issues such as memory overflows, null pointer dereferences, and other runtime errors.
This article explains the LeetCode 75 "Sort Colors" challenge, detailing the problem statement, constraints, a three‑pointer Dutch National Flag solution, and provides complete implementations in Java, C++, C, and Python without using built‑in sorting functions.
The Next Permutation problem asks to rearrange an integer array into the immediate lexicographically larger ordering—or the smallest order if none exists—by scanning from the right to find the first decreasing pair, swapping with the next larger element, and reversing the suffix, using O(1) extra space, with implementations provided in Java, C++, and Python.
This article explains the fundamentals of shared memory as an efficient inter‑process communication method on Linux, covering its principles, core system calls, usage steps, advantages, synchronization challenges, and real‑world case studies with complete C code examples.
LeetCode 57 asks you to insert a new interval into a sorted list of non‑overlapping intervals, merging any overlaps so the result stays sorted and disjoint, and the article explains the O(n) algorithm and provides concise implementations in Java, C++ and Python.
The article explains that the prevalence of programming languages beginning with “C” stems from the historical evolution of BCPL to B to C, after which numerous C‑based derivatives such as C++, C#, Objective‑C, and even unrelated CSS emerged, highlighting C’s foundational role in language design.
This tutorial walks through the motivation for Nvidia GPU kernel interception, explains Linux kernel module basics and privilege rings, shows how to set up an Ubuntu environment, write and compile a minimal LKM, load and test it, then create a fake GPU character device and mount it into a Docker container for verification.
This guide shows how to benchmark C code by measuring elapsed time using the standard time() function for second‑level precision, clock() for higher CPU‑time accuracy, and gettimeofday() for microsecond‑level resolution, including complete example programs and key considerations.
This article explains why the traffic team switched from traditional MQ to Redis Stream, covering the underlying concepts, design choices, implementation details, load‑balancing strategies, cross‑datacenter handling, monitoring metrics, performance benchmarks, and practical lessons learned.
This article walks you through why CMake is a more elegant, cross‑platform alternative to hand‑written Makefiles, explains its core benefits, and provides a complete, hands‑on tutorial that covers the basic workflow, a minimal project example, multi‑source handling, and multi‑directory organization with clear code snippets.
This article explains why finite state machines (FSM) are essential for game development, outlines their core concepts, demonstrates common pitfalls of if‑else logic, and provides step‑by‑step Unity C# examples for object state switching and intelligent NPC patrol behavior, including code snippets and integration tips.
This article dissects iOS blocks, explaining their struct‑based memory layout, the three block types, how they are transformed into C++ code with clang, and the impact of capturing variables—including value, static, global, and object references—on block behavior and lifecycle.
Researchers from Inria and Microsoft have devised a method to automatically translate a subset of C code, called Mini‑C, into memory‑safe Rust, using the KaRaMeL compiler framework, demonstrating comparable performance on cryptographic libraries while reducing vulnerability risks.
This article explains how Rust's memory safety, concurrency guarantees, explicit error handling, and modern tooling make it a safer and more maintainable alternative to C for developing Linux kernel modules.
The article explains how the Linux kernel’s initcall mechanism automatically orders and executes driver initialization functions through specially defined macros and linker sections, improving maintainability, memory usage, and system stability during the boot process.
This article provides a comprehensive introduction to Android NDK development, covering JNI fundamentals, data type mappings, method registration (static and dynamic), JNIEnv usage, CMake build configuration, and multiple practical code examples in Kotlin, C++, and C.
This article presents a collection of handy C code snippets that demonstrate how to quickly obtain struct member sizes and offsets, read CPU temperature, determine file sizes, fetch system timestamps, retrieve MAC and IP addresses, perform file I/O, display progress bars, format log output, and enable core dump generation, each accompanied by sample usage and expected results.
The article explains LeetCode 491, requiring all non‑decreasing subsequences of length ≥2 from an integer array, and details a depth‑first search approach that uses a per‑level set to skip duplicates, with complete example implementations in Java, C++, C, and Python.
This article details JD's self‑built HarmonyOS image library (DImage), covering its background, research on existing solutions, C++‑based cross‑platform architecture, core modules, performance‑focused pipeline, monitoring and recovery mechanisms, and future optimization directions, all aimed at high‑performance image handling for the JD app on HarmonyOS.
This article provides a comprehensive analysis of the Linux kernel's task_struct data structure, detailing its members such as task IDs, parent‑child relationships, state flags, credentials, scheduling information, signal handling, memory and file management, kernel stack layout, and its role in process creation via system calls like fork.
This article explains the purpose, prototype, and usage of C's malloc function, delves into its underlying implementation using free‑list mechanisms, virtual‑memory translation, system calls like brk and mmap, and compares it with related functions such as calloc, realloc and new, while providing practical code examples and best‑practice guidelines.
This article provides a comprehensive overview of Linux socket programming, covering socket definitions, classifications such as stream, datagram, and raw sockets, connection-oriented versus connectionless communication, IP/port/MAC addressing, byte order considerations, and practical C API examples for creating and using sockets.
This article provides a comprehensive overview of the Linux ptrace system call, explaining its role in process debugging, detailing request parameters, demonstrating practical C examples for tracing system calls, single‑stepping, setting breakpoints, and exploring how DWARF debugging information links source code to executable addresses.
The article explains LeetCode 814, where a binary tree of 0s and 1s is pruned by recursively removing subtrees lacking a 1, using a post‑order traversal that returns null for nodes with value 0 and no retained children, achieving O(n) time and O(h) space.
This guide demonstrates how to use the C standard library functions time(), clock(), and the POSIX gettimeofday() to measure code execution duration, comparing their precision levels and showing sample code snippets that illustrate typical usage and output.
This article examines how strict adherence to clean‑code principles in C++—such as using polymorphism, limiting function size, and avoiding internal knowledge—affects runtime performance, comparing virtual‑function hierarchies, switch‑based implementations, and table‑driven approaches, and revealing up to fifteen‑fold speed differences.
This article explains the LeetCode 739 'Daily Temperatures' problem, describing how to compute the next warmer day for each temperature using a monotonic stack, and provides complete implementations in Java, C++, and Python, along with step‑by‑step analysis and example walkthroughs.
This article explains Netty’s asynchronous architecture, compares classic multithread, Reactor, select, poll and epoll models, clarifies level‑triggered versus edge‑triggered event handling, and provides step‑by‑step JNI and hand‑written epoll server examples in C to illustrate high‑performance backend development.
LeetCode 34 asks for the first and last indices of a target in a non‑decreasing integer array, returning [-1,-1] when absent, and can be solved in O(log n) time by applying two binary‑search passes—one locating the leftmost occurrence and the other the rightmost—illustrated with Java, C++, and Python implementations.
This tutorial walks through the complete RDMA programming workflow using the ibverbs API, covering device initialization, memory registration, completion queue and queue pair creation, state transitions, send/receive operations, completion handling, and resource cleanup with concrete C code examples.
This article details JD's development of a modular, C++‑based image library for HarmonyOS, explaining the shortcomings of native components, the design of a cross‑platform architecture, core modules, performance pipelines, monitoring, and future optimization plans.
Ben Dicken benchmarked a double‑nested loop of 10 000 × 100 000 iterations across dozens of languages, publishing the source code and fastest‑run results that show C, Zig and Rust consistently topping the performance chart, illustrated with an animated speed comparison.
This article explores how Taro integrates C++ via Harmony's C‑API to create a high‑performance, cross‑language event system that enhances rendering speed, improves lifecycle management, and overcomes ArkTS limitations for Harmony OS applications.
This guide explains how to enable CLR integration on Alibaba Cloud RDS SQL Server, walk through a C# sentiment‑analysis demo, show step‑by‑step deployment of the CLR assembly, test the function with sample data, and discuss security options and best‑practice considerations.
After 22 years at Microsoft, Herb Sutter departs for Citadel while staying ISO C++ chair, declaring 2024 pivotal as C++26 introduces reflection‑driven compile‑time libraries and default safety—potentially the most impactful release since C++11—while U.S. CISA and the FBI urge memory‑unsafe language users to publish safety roadmaps by January 2026.
This guide walks through using SQLite's C API—including opening databases, executing queries with and without callbacks, handling results, and performing insert, delete, and display operations—complete with code snippets, table schemas, and compilation instructions.
This article explains the end‑to‑end architecture, principles, and code implementation of the dynamic cross‑platform framework (Roma/Dynamic) on HarmonyOS, covering template loading, JS‑C++‑ArkTS instance creation, V‑Dom and Component tree construction, rendering pipeline, view updates, and performance optimizations.
This article explains how the Huolala mobile team built a stable symbol demangling system using the open‑source symbolic‑demangle tool, covering the concepts of name mangling, why symbolic was chosen, step‑by‑step adaptation for newer Swift versions, Linux Python‑wheel building, and practical troubleshooting tips.
This article details Ctrip's end‑to‑end weak‑network identification model, covering background, metric selection, data collection on iOS and Android, processing pipelines with dynamic weighting, weighted median calculations, success‑rate trends, threshold tuning, and deployment results across multiple platforms.
QuickJS manages memory using reference counting for each object combined with a cycle‑collector that periodically scans roots, decrements child references, and frees objects whose counts drop to zero, while also supporting traditional reachability‑based garbage‑collection techniques such as mark‑sweep, copying, and generational collection.
This article explains the technical mechanisms behind game memory modifiers—including memory scanning, DLL injection, debugging tools, file editing, anti‑cheat evasion, and pointer scanning—using the "Black Myth: Wukong" trainer as a concrete example, and provides complete C++ code samples.
This article explains how the Python interpreter initializes its runtime environment, compiles source code into PyCodeObject bytecode, creates stack frames, and executes the bytecode using functions like PyEval_EvalFrame and _PyEval_EvalFrameDefault while detailing the role of the runtime stack and its associated C macros.
The article explains how Linux manages memory page watermarks, when the allocator falls back to kswapd, and the exact conditions that trigger direct compaction via __alloc_pages_direct_compact, then walks through the core compaction functions—try_to_compact_pages, compact_zone_order, compact_zone, and the page‑migration helpers—illustrated with flow diagrams and real kernel code.
This article explains how Redis implements dynamic string expansion using the Simple Dynamic String (SDS) structure, detailing the sdsMakeRoomFor function, its allocation strategy, type handling, and the architectural changes introduced in Redis 7.0.
This article examines the concept of weak pointers and weak references in Go, Rust, Java, and C#, comparing their implementations, explaining their memory‑management semantics, presenting concrete code examples, and discussing the upcoming Go weak‑pointer proposal and practical scenarios such as caching and event handling.
The article explains how to ensure data correctness in Linux inter‑process shared memory communication by using synchronization mechanisms—semaphores, mutexes, and condition variables—providing step‑by‑step code examples for each method and discussing their proper initialization, usage, and potential pitfalls.
This article presents a curated collection of high‑impact C utility code examples—including a circular buffer, assertion macro, bit‑reversal function, fixed‑point arithmetic, endianness conversion, bit masks, timer handling, binary search, and a simple bitset—explaining their purpose and showing ready‑to‑use implementations for embedded systems.
The article analyses the design of Rust’s Mutex API, compares it with the classic C/POSIX mutex API, explores alternative Rust designs that mimic C, and demonstrates through concrete code examples why Rust’s guard‑based approach preserves safety while a C‑style API would re‑introduce data‑race hazards.
This guide explains how to replicate Linux kernel's initcall mechanism in STM32 projects by using function‑pointer sections, modifying the linker script, and defining ordered initialization macros to replace sequential main‑function calls, enabling modular and loosely‑coupled code execution.
This article explains how to use eBPF fentry and fexit probes to monitor the Linux unlink system call, compares them with kprobes, provides complete C and Go examples, shows compilation with eunomia‑bpf, and discusses the low‑overhead advantages of fentry for kernel tracing.
This article explains how to create and bind native UI components in HarmonyOS by leveraging ArkUI's C/C++ API, covering project setup, library linking, module interface acquisition, node creation, attribute setting, and integration with ArkTS through NodeContent and ContentSlot.
This article walks through creating a first eBPF program using C and Go on Ubuntu 22.04, covering required dependencies, kernel‑space vs user‑space concepts, event selection, BPF map definition, and a tracepoint function that measures per‑process CPU time.
This article explains C function pointers—from basic declaration and typedef usage to calling functions, passing pointers as parameters for callbacks, returning pointers from functions, and creating pointer arrays—illustrated with complete code samples and practical use cases.
The article examines the launch of the Chinese 3A title "Black Myth: Wukong", analyzes programmers' challenges in high‑cost game development, presents survey data on AI coding tools, introduces Tencent Cloud AI Code Assistant, and provides a step‑by‑step tutorial for integrating the assistant into Unreal Engine projects using Rider.
This guide walks through the complete GCC compilation pipeline—preprocessing, compilation, assembly, and linking—demonstrates how to build a simple C program, inspect the resulting ELF file, and use Binutils tools to analyze sections and disassemble the binary.
The article examines the technology behind the Chinese AAA title “Black Myth: Wukong”, revealing its use of Unreal Engine 5 with C++ as the core language, additional JavaScript integration via Unreal.js, and discusses community speculation about tools like PuerTS while also containing promotional material for development tools.
The article examines how the Chinese AAA title “Black Myth: Wukong” leverages Unreal Engine 5, C++, Blueprint visual scripting, and even a custom C#‑based USharp plugin to deliver cutting‑edge graphics, physics, AI, and culturally rich gameplay, illustrating the convergence of advanced technology and Chinese heritage in modern game development.
The article explains that Black Myth: Wukong is built mainly with C++ on Unreal Engine, outlines the engine's royalty model, and uses this case to highlight why Chinese developers favor Java and Python over C++, the challenges of low‑level software development in China, and the need for more domestic C/C++ talent.
This article reviews the evolution of hot‑update methods in games, critiques Lua, PuerTS, and HybridCLR, and proposes a minimalist Unity solution that combines AssetBundle resource updates with runtime DLL loading via reflection, demonstrating a simple, low‑dependency architecture validated on Android VR projects.
This article explores the classic “Hello World” program across five popular programming languages—Python, C#, C++, JavaScript, and PHP—detailing each language’s syntax, key functions, and code snippets, while reflecting on the significance of this introductory example for beginners.
This article explains why memory leaks occur only with heap allocations in C, describes how malloc and related functions allocate memory, outlines two common ways to obtain heap memory, identifies the three essential elements of a leak, debunks common freeing misconceptions, and provides practical inspection steps to prevent leaks.
This article explains how to implement finite state machines in C using three classic approaches—switch‑case, table‑driven, and function‑pointer—detailing their structures, code examples, trade‑offs, and safety considerations for embedded and general‑purpose software development.
The article examines DARPA's TRACTOR project, which aims to use large‑language‑model AI to automatically translate legacy C and C++ code into safe Rust, discusses the memory‑safety motivations, technical challenges, community reactions, and the broader push by US agencies to abandon unsafe languages.
This article explains how C's /* */ and // comment delimiters work, shows edge cases where they appear inside strings, macros, or line continuations, and provides concrete code examples illustrating correct and incorrect usages along with the compiler errors they may trigger.
This article explains three core ways to implement finite state machines in C—switch‑case, table‑driven, and function‑pointer approaches—detailing their structures, code examples, advantages, pitfalls, and how they relate to extended and hierarchical state machines.
This article explains the differences between array‑based sequential storage and pointer‑based linked storage, introduces singly, doubly and circular linked lists, and provides complete C implementations for creation, insertion, deletion, and traversal with clear diagrams and step‑by‑step code examples.
This guide explains core C programming concepts—including bitwise operators, macro definitions, conditional compilation directives, extern declarations, typedef aliases, struct usage, and the static keyword—providing clear examples and code snippets to help developers write more efficient and maintainable code.
Domain-Driven Design (DDD) is a software development methodology that bridges business and technology by defining clear domain models, improving communication, code quality, and handling complexity through layered architecture, with concrete C# examples of entities, value objects, aggregates, and domain services.
The article explains that __disable_irq() and __enable_irq() are compiler‑provided intrinsics that expand to CPSID i and CPSIE i instructions, return the prior PRIMASK state, globally mask CPU interrupt handling without stopping hardware events, and contrasts them with CMSIS __NVIC_DisableIRQ/EnableIRQ which control individual interrupt lines.
This article reviews JetBrains AI, an LLM‑powered assistant for JetBrains IDEs, exploring its code‑completion, code‑explanation, unit‑test generation, and refactoring capabilities through real C# examples and discussing its impact on developer workflows.
This guide explains how LCDs work as LED matrices, how to create and use dot‑matrix font libraries, the various modulo methods for mapping bits to bytes, differences between vector and bitmap fonts, and the Chinese character encodings (GB2312, GBK, GB18030) needed for multilingual embedded displays.
Multithreaded programming splits tasks across logical and hardware threads to exploit multicore CPUs, requiring careful use of synchronization primitives such as mutexes, read‑write locks, condition variables, and lock‑free atomics, while avoiding pitfalls like race conditions, deadlocks, and false sharing for correct, high‑performance software.
The article presents a detailed engineering analysis of RaftKeeper v2.1.0, describing benchmark methodology, performance gains across create, mixed, and list workloads, and four major optimizations—including response serialization parallelism, list‑request handling, system‑call reduction, thread‑pool redesign, and asynchronous snapshot processing—demonstrating substantial throughput and latency improvements in large‑scale ClickHouse deployments.
The article explains how encapsulating peripheral registers in a struct rather than using separate global variables reduces literal‑pool usage, cuts instruction count, and improves execution speed on Cortex‑A9, providing step‑by‑step assembly analysis, compilation commands, and further optimization techniques.
This article shows how C can achieve object‑oriented‑style design by using structs to model classes and function pointers as methods, providing concrete code examples such as a linked‑list implementation, interface definition, and test harness to illustrate the technique.
This article reports that C++ has overtaken C to rank second in the latest TIOBE index, outlines the historical evolution of C++ across three phases, highlights the recent record climbs of Go and Rust, and notes the broader usage of these languages despite the presence of promotional material.
Meituan enhances Apache Spark by integrating the Gluten‑Velox vectorized execution engine, converting row‑wise operations to columnar SIMD processing, which yields over 40 % memory savings and up to 13 % faster runtimes across thousands of ETL jobs, while addressing stability, ORC support, shuffle redesign, and off‑heap memory optimization.
TBOX is a C‑based cross‑platform development library that unifies interfaces for multiple operating systems, offers a rich set of modules such as streams, coroutines, databases, networking, and utilities, and provides detailed build instructions and example code for rapid integration.
This article explains how to use the C standard library functions setjmp and longjmp to create a lightweight cooperative multitasking scheduler without timers, covering their mechanics, stack handling, task creation, time‑slice yielding, and provides complete example code and a Git repository link.
This article explains how to implement finite state machines in C using three approaches—switch‑case, table‑driven, and function‑pointer—detailing their structures, code examples, trade‑offs, and extensions such as compressed tables and hierarchical state machines for robust embedded systems.
This article introduces Reader, an open‑source Jina AI tool that converts any web URL into a format optimized for large language models, and llm.c, a minimalist C and CUDA project that demonstrates how to train a GPT‑2‑style LLM from scratch.
This article provides a comprehensive, hands‑on tutorial for Windows developers on how to set up the Visual Studio environment and use the cl.exe command‑line compiler to build, link, and optimize C++ programs, covering basic commands, common options, and practical examples.
This guide introduces Microsoft Visual C++ (MSVC), covering its key features, installation via Visual Studio or Build Tools, command‑line and VS Code integration, step‑by‑step compilation commands, and advanced options like parallel builds and PGO, helping developers efficiently build C/C++ projects on Windows.
This article explains the evolution of iLogtail from a single‑file collector to a multi‑language, plugin‑based observability pipeline, outlines the motivations for refactoring, describes the new unified data model, plugin abstractions, pipeline design, configuration management, hot‑reload mechanisms, and the separation of enterprise and open‑source code, providing a comprehensive view of the architectural upgrade.
The May 2024 TIOBE index shows an unchanged Top 5 with Python as the sole language gaining market share, while C and C++ fall due to memory‑safety concerns and PHP drops to a historic low amid competition from modern web frameworks.
This article describes how a C++‑based cross‑platform framework and a unified routing mechanism were built for WeChat Pay to eliminate platform‑specific bugs, streamline data flow, improve crash stability, cut code size by nearly 45%, and boost development productivity across iOS and Android.
This article explains how to invoke Go functions from C within the same process, covering the three‑step implementation, the required cgo compilation commands, the generated intermediate files, and the runtime mechanisms such as crosscall2 and stack switching that make cross‑language calls possible.
The article presents MaxSDK, a unified C# SDK for Unity that abstracts platform‑specific native SDKs across Android, iOS, Windows, macOS and future platforms, offering a singleton interface, abstract base classes, data models, and callback listeners to dramatically cut integration effort, maintenance cost, and enable easy extension to other engines.
This article explains the classic producer‑consumer synchronization challenge, describes its importance in concurrent programming, and provides two complete C implementations—one using mutexes and condition variables and another using semaphores—along with detailed code and sample output.
