C++ Blogs, the last 7 days

Thursday, July 16, 2026

Egerton MS 1995Previously on this blog: “The Book of St Albans (1486)” (2026-05-22), in which I made a table of terms of venery, a.k.a. company terms, e.g. “an exaltation of larks,” as in the eponymous book by James Lipton. I mentioned that the Book of St Albans actually has “an exaltyng of larkis,” and that it’s only in Egerton MS 1995 (circa 1450), according to Lipton, that we find “an exaltacyon of larkys” proper. But I couldn’t find any digitized copy of Egerton MS 1995 to verify that claim.Arthur O’Dwyer

If this page is useful, please consider donating a coffee

Wednesday, July 15, 2026

Reduce LLVM Build Artifact Storage Costs by 50% with Content-Defined ChunkingReduce LLVM Build Artifact Storage Costs by 50% with Content-Defined Chunking One of the classic strategies to speed up a system is to avoid redundant work. Scalable build systems like Bazel and Buck2 heavily employ this strategy in various ways, with remote caching and content-addressable storage being two prominent examples. While remote caching prevents repeating redundant build actions, content-addressable storage (CAS) exists for the purpose of data deduplication. However, traditionally CAS operates at the granularity of a single file. When you modify a single byte in a file and store it in a CAS, the CAS stores a second, complete file. Deduplication at the file level is quite palatable for smaller files; a single build invocation typically contains many thousands of small files. Who cares if we store a couple more? However, as file sizes increase, the cost of storing yet another slightly modified version of a file becomes more expensive. Instead of tossing a couple extra kilobytes into storage, you might be storing a few more gigabytes . Now, consider where these large files come from. These large files are often outputs of build actions, and those build actions depend on many smaller inputs. As those many inputs churn, the outputs also churn. Suddenly the cost of touching a tiny little source file isn’t just the cost of uploading a new version of the source file to CAS–it’s now also the cost of all the large outputs that are produced by the build. This dictates the growth rate of your CAS storage costs, which scales directly with the number of incoming builds. At AI-scale, these costs have become more important than ever before.EngFlow Blog

Tuesday, July 14, 2026

Rethinking C++ Performance: Faster Code Navigation and GitHub Copilot Tools with Whole Codebase IndexingIn large C++ codebases, your code understanding and navigation depend on quickly determining how symbols, declarations, definitions, and references are connected across your project. In Visual Studio Insiders 18.9, the new whole codebase indexing (WCI) enhances the existing browse database via a deeper, more comprehensive indexing approach. This preview feature allows Visual Studio to access […] The post Rethinking C++ Performance: Faster Code Navigation and GitHub Copilot Tools with Whole Codebase Indexing appeared first on C++ Team Blog .C++ Team Blog

Monday, July 13, 2026

Pure Virtual C++ 2026 [Meet the Speakers, Part 2]: The AI-Native C++ Developer WorkflowPure Virtual C++ 2026 streams Tuesday, July 21, 2026 at 9:00 AM PT, a free, one-day virtual conference for the whole C++ community, live on YouTube (Microsoft Reactor) and Twitch, with on-demand recordings on the Visual Studio YouTube channel afterward. Register now → Welcome to part two of our Meet the Speakers series. In part one we looked at building and running […] The post Pure Virtual C++ 2026 [Meet the Speakers, Part 2]: The AI-Native C++ Developer Workflow appeared first on C++ Team Blog .C++ Team Blog

Sunday, July 12, 2026

Irreducible loopsThe dominator tree lets us identify natural loops : a back edge T->H whose head H dominates its tail T defines a loop with the single entry H . This works only for reducible control flow graphs. Optimized machine code and decompiler output routinely contain irreducible loops, which have more than one entry and thus no dominating header, so the dominator-based method cannot see them. This post builds a loop-nesting forest for an arbitrary CFG with the single-pass depth-first search of 韦韬、毛剑、邹维、陈宇(Tao Wei, Jian Mao, Wei Zou & Yu Chen) A New Algorithm for Identifying Loops in Decompilation , SAS 2007 (The 14th International Static Analysis Symposium).MaskRay

Saturday, July 11, 2026

X just gave us an interface that AI agents can use. I pointed it at my own posts.I have been on X for a long time. Like most people who post regularly, I have a gut feeling for what might interest people. I post in the morning. Longer posts seem to do better. But gut feelings are not measurements. And until recently, digging into your own posting data meant either clicking around … Continue reading X just gave us an interface that AI agents can use. I pointed it at my own posts.Daniel Lemire's blog