ladybird/Tests/LibJS/Bytecode/expected/string-from-char-code-builtin.txt

$7ba8b0ff string-from-char-code-builtin.js:3:1
  Registers: 9
  Blocks:    1
  Constants:
    [0] = Int32(65)
    [1] = Int32(66)

block0:
  [   0] GetGlobal dst:reg6, `String`
  [  10] GetById dst:reg7, base:reg6, `fromCharCode` (String.fromCharCode)
  [  28] CallBuiltinStringFromCharCode dst:reg5, callee:reg7, this_value:reg6, argument:Int32(65), String.fromCharCode
  [  40] GetGlobal dst:reg6, `String`
  [  50] GetById dst:reg8, base:reg6, `fromCharCode` (String.fromCharCode)
  [  68] Call dst:reg7, callee:reg8, this_value:reg6, String.fromCharCode, arguments:[Int32(65), Int32(66)]
  [  90] End value:reg7
LibJS: Store bytecode cache indexes instead of pointers Store compact cache indexes in bytecode instructions instead of raw pointers to the executable cache vectors. This keeps the instruction stream independent from heap addresses and removes pointer fixups when materializing cached bytecode. Resolve the mutable cache pointers at execution time from the current Executable. Bytecode test expectations are updated for the smaller cache operands and resulting instruction offsets. 2026-05-18 08:26:41 -03:00			`$7ba8b0ff string-from-char-code-builtin.js:3:1`
LibJS: Add a String.fromCharCode builtin opcode Specialize only the fixed unary case in the bytecode generator and let all other argument counts keep using the generic Call instruction. This keeps the builtin bytecode simple while still covering the common fast path. The asm interpreter handles int32 inputs directly, applies the ToUint16 mask in-place, and reuses the VM's cached ASCII single-character strings when the result is 7-bit representable. Non-ASCII single code unit results stay on the dedicated builtin path via a small helper, and the dedicated slow path still handles the generic cases. 2026-04-12 11:12:40 -03:00			`Registers: 9`
			`Blocks: 1`
			`Constants:`
			`[0] = Int32(65)`
			`[1] = Int32(66)`

			`block0:`
LibJS: Drop dead entry GetLexicalEnvironment loads Teach the Rust bytecode generator to treat the synthetic entry GetLexicalEnvironment as a removable prologue load. We still model reg4 as the saved entry lexical environment during codegen, but assemble() now deletes that load when no emitted instruction refers to the saved environment register. This keeps the semantics of unwinding and environment restoration intact while letting empty functions and other simple bodies start at their first real instruction. 2026-04-13 08:16:17 -03:00			[ 0] GetGlobal dst:reg6, `String`
LibJS: Store bytecode cache indexes instead of pointers Store compact cache indexes in bytecode instructions instead of raw pointers to the executable cache vectors. This keeps the instruction stream independent from heap addresses and removes pointer fixups when materializing cached bytecode. Resolve the mutable cache pointers at execution time from the current Executable. Bytecode test expectations are updated for the smaller cache operands and resulting instruction offsets. 2026-05-18 08:26:41 -03:00			[ 10] GetById dst:reg7, base:reg6, `fromCharCode` (String.fromCharCode)
			`[ 28] CallBuiltinStringFromCharCode dst:reg5, callee:reg7, this_value:reg6, argument:Int32(65), String.fromCharCode`
			[ 40] GetGlobal dst:reg6, `String`
			[ 50] GetById dst:reg8, base:reg6, `fromCharCode` (String.fromCharCode)
			`[ 68] Call dst:reg7, callee:reg8, this_value:reg6, String.fromCharCode, arguments:[Int32(65), Int32(66)]`
			`[ 90] End value:reg7`