0 views collected around this technical thread.
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.
This article explains the internal workings of Java reflection, from obtaining Method objects via getMethod and getDeclaredMethod to the invoke process, and details why reflection incurs significant performance overhead due to argument boxing, visibility checks, parameter validation, lack of inlining, and JIT optimization limits.
The article explains how Java bytecode implements method invocation by extracting a calculation into a static method, detailing the use of the invokestatic instruction, operand stack handling, constant pool references, and subsequent bytecode operations such as i2d, Math.pow, dadd, Math.sqrt, and type conversions.