Tag
call-graphs
- Apr 26, 2026 Stack Unwinding With and Without Frame Pointers How a profiler recovers a call chain from registers and memory, why omitting frame pointers breaks the cheap method, and what DWARF call-frame information costs instead. performance engineering
- Oct 12, 2023 Counting Function Calls Without Losing the Call Count to Inlining Entry-point instrumentation gives exact invocation counts and a cost model that sampling cannot; inlining, tail calls, and recursion each break the correspondence between hooks and source functions. performance engineering
- Aug 14, 2023 Interprocedural Summaries and the Context-Sensitivity Bill How a function is summarized for callers, how call graphs are built under virtual dispatch, and why distinguishing call sites multiplies cost without always buying precision. developer tools
- Mar 1, 2023 Building a Flame Graph from a Set of Stack Samples Flame graphs are a sorted trie of stack prefixes; the merge, the sort, and the width computation each decide what the picture can and cannot show. performance engineering
- Nov 27, 2021 Dependency Objectives: Propagating Budgets Across a Call Graph How a caller composes its own objective from the objectives of services it depends on, and why consistent fan-out makes end-to-end targets arithmetically impossible. observability