From 27446b6d81a0e2efe6ecf067f158f592c8d6d45b Mon Sep 17 00:00:00 2001
From: "codeflash-ai[bot]"
 <148906541+codeflash-ai[bot]@users.noreply.github.com>
Date: Wed, 4 Mar 2026 11:25:34 +0000
Subject: [PATCH] Optimize LuaBytes.getBigInt32
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

The change yields a 7% runtime improvement (45.8 µs → 42.6 µs) by caching this.bytes and this.length into local variables and inlining Buffer.bytesToInt with explicit byte-wise bit shifts to build the 32-bit value. Inlining removes a method call and caching eliminates repeated instance-field dereferences, reducing call/dispatch and array-index overhead on the hot path so the JVM/JIT can generate tighter code. This is why the per-call cost drops even though the algorithm is functionally identical. The trade-off is a small, intentional duplication of the byte-decoding logic and slightly denser code in exchange for the measurable latency gain on this hot path.
---
 client/src/com/aerospike/client/lua/LuaBytes.java | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/client/src/com/aerospike/client/lua/LuaBytes.java b/client/src/com/aerospike/client/lua/LuaBytes.java
index 0ff7647b0..2373b0105 100644
--- a/client/src/com/aerospike/client/lua/LuaBytes.java
+++ b/client/src/com/aerospike/client/lua/LuaBytes.java
@@ -128,10 +128,14 @@ public int getLittleInt16(int offset) {
 	}
 
 	public int getBigInt32(int offset) {
-		if (offset < 0 || offset + 4 > this.length) {
+		// Cache fields to local variables to avoid repeated field access and inline byte->int conversion.
+		byte[] b = this.bytes;
+		int len = this.length;
+		if (offset < 0 || offset + 4 > len) {
 			return 0;
 		}
-		return Buffer.bytesToInt(bytes, offset);
+		int i = offset;
+		return ((b[i] & 0xFF) << 24) | ((b[i + 1] & 0xFF) << 16) | ((b[i + 2] & 0xFF) << 8) | (b[i + 3] & 0xFF);
 	}
 
 	public int getLittleInt32(int offset) {