Tagged articles
stack frame
15 articles · Page 1 of 1
This article traces a Java method call through five stages: compilation to bytecode, class loading with vtable resolution, interpretation via stack frames, JIT compilation with optimizations like inlining and escape analysis, and final execution as machine code on CPU pipelines.
CPU pipelineClass LoadingHotSpot
0 likes · 30 min read

This article explains step by step how Python creates a function object, builds a call stack, handles parameters, executes the body, performs garbage collection, and manages recursion, illustrating each stage with clear code examples and diagrams.
Function CallPythongarbage collection
0 likes · 8 min read

The article dissects Python’s exception mechanism, showing how the interpreter and virtual machine raise, record, and propagate errors via thread‑state objects, traceback chains, and C‑level APIs, while also illustrating generator return values, Java checked exceptions, and the final printing of tracebacks.
C APIException Handlingruntime
0 likes · 16 min read

The article dissects Python's virtual machine execution flow, showing that bytecode runs inside dynamically created stack‑frame objects rather than the static PyCodeObject, and explains the internal structures, memory optimizations, and debugging interfaces that make this possible.
c-structuresdebuggingstack frame
0 likes · 19 min read

Understanding how call stacks and stack frames work is essential for developers, and this article explains their dynamic, ordered, and local nature, details stack frame structure, walks through a Go code example illustrating function calls and returns, and shows how to leverage runtime utilities for debugging.
Go Languagecall stackdebugging
0 likes · 7 min read

This article introduces Java’s bytecode fundamentals, explaining how the JVM translates compiled class files into platform‑independent instructions, the role of dynamic linking, stack frames, operand stacks, and common bytecode mnemonics, while providing code examples and visual diagrams to deepen understanding.
JVMJavadynamic linking
0 likes · 17 min read

This article explains how Java’s JVM uses stack frames, local variable tables, operand stacks, dynamic linking, and method return addresses to manage method calls, detailing the distinction between static and dynamic dispatch, the role of non‑virtual methods, and how the invokevirtual instruction resolves the correct implementation at runtime.
Dynamic DispatchJVMJava
0 likes · 15 min read

This article thoroughly explains low‑level function call implementation, covering Intel and AT&T assembly syntax, the evolution of CPU registers from 16‑bit to 64‑bit x86, caller‑ and callee‑saved conventions, stack‑based to register‑based parameter passing, stack frame setup, and assembly representations of control structures.
CPU architectureCPU registersLow-Level Programming
0 likes · 23 min read

This article explains how function calls are implemented using a stack‑based memory model, describing stack frames, the role of base and stack pointer registers, and the assembly instructions that create and dismantle these frames during program execution.
Function CallsRegistersassembly
0 likes · 7 min read

This article explains the JVM's stack‑frame structure, local variable tables, operand stacks, dynamic linking, and method return addresses, then demonstrates method call execution with sample Java code and bytecode, and analyzes how the JVM resolves overloaded and overridden methods through static and dynamic dispatch.
JVMJavamethod invocation
0 likes · 21 min read

This article explains a Java interview puzzle by analyzing how the JVM stack frame handles variable assignments and increment operators, step‑by‑step showing the effects of i = i++, i = ++i, and a complex expression i + ++i * i++ on variable values.
JVMJavaincrement operators
0 likes · 4 min read

This article explains how Java's post‑ and pre‑increment operators affect variable values by tracing each statement through the JVM's stack frame, local variable table, and operand stack, and demonstrates the resulting values of i, j, and k with detailed diagrams and code examples.
JVMJavaincrement operators
0 likes · 4 min read

This article explains the concept of tail call optimization in Objective‑C, illustrates correct and incorrect tail‑call examples, describes how the compiler reuses stack frames to achieve O(1) space complexity, and demonstrates the optimization with visual demos and practical code.
Objective-C++Tail Call OptimizationiOS
0 likes · 6 min read

This article explains the inner mechanics of Python generators, covering how the interpreter executes functions, the role of stack frames and bytecode, the generator flag, and how send, yield, and StopIteration interact, illustrated with detailed code examples and disassembly.
PythonStopIterationbytecode
0 likes · 8 min read


ITPUBOct 31, 2016 · Information Security
This article explains Linux process address space layout and stack‑frame structure, demonstrates a classic buffer‑overflow attack with full source code and compilation steps, analyzes how the exploit gains root privileges, and discusses why modern compilers and shells affect the attack's success.
buffer overflowexploitsecurity
0 likes · 15 min read
