SUPPORT THE WORK

GetWiki

bytecode

ARTICLE SUBJECTS
aesthetics  →
being  →
complexity  →
database  →
enterprise  →
ethics  →
fiction  →
history  →
internet  →
knowledge  →
language  →
licensing  →
linux  →
logic  →
method  →
news  →
perception  →
philosophy  →
policy  →
purpose  →
religion  →
science  →
sociology  →
software  →
truth  →
unix  →
wiki  →
ARTICLE TYPES
essay  →
feed  →
help  →
system  →
wiki  →
ARTICLE ORIGINS
critical  →
discussion  →
forked  →
imported  →
original  →
bytecode
[ temporary import ]
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{Short description|Form of instruction set designed to be run by a software interpreter}}{{redirect2|Portable code|P-code|other uses|software portability|and|P-Code (disambiguation)}}{{More citations needed|date=January 2009}}{{Use dmy dates|date=May 2019|cs1-dates=y}}{{Program execution}}Bytecode (also called portable code or p-code{{Citation needed|date=May 2021|reason=use of P-code as a generic term}}) is a form of instruction set designed for efficient execution by a software interpreter. Unlike human-readable source code, bytecodes are compact numeric codes, constants, and references (normally numeric addresses) that encode the result of compiler parsing and performing semantic analysis of things like type, scope, and nesting depths of program objects.The name bytecode stems from instruction sets that have one-byte opcodes followed by optional parameters. Intermediate representations such as bytecode may be output by programming language implementations to ease interpretation, or it may be used to reduce hardware and operating system dependence by allowing the same code to run cross-platform, on different devices. Bytecode may often be either directly executed on a virtual machine (a p-code machine, i.e., interpreter), or it may be further compiled into machine code for better performance.Since bytecode instructions are processed by software, they may be arbitrarily complex, but are nonetheless often akin to traditional hardware instructions: virtual stack machines are the most common, but virtual register machines have been built also. Different parts may often be stored in separate files, similar to object modules, but dynamically loaded during execution.

Execution

A bytecode program may be executed by parsing and directly executing the instructions, one at a time. This kind of bytecode interpreter is very portable. Some systems, called dynamic translators, or just-in-time (JIT) compilers, translate bytecode into machine code as necessary at runtime. This makes the virtual machine hardware-specific but does not lose the portability of the bytecode. For example, Java and Smalltalk code is typically stored in bytecode format, which is typically then JIT compiled to translate the bytecode to machine code before execution. This introduces a delay before a program is run, when the bytecode is compiled to native machine code, but improves execution speed considerably compared to interpreting source code directly, normally by around an order of magnitude (10x).Because of its performance advantage, today many language implementations execute a program in two phases, first compiling the source code into bytecode, and then passing the bytecode to the virtual machine. There are bytecode based virtual machines of this sort for Java, Raku, Python, PHP,{{efn|PHP has just-in-time compilation in PHP 8,WEB, O’Phinney, Matthew Weier, Exploring the New PHP JIT Compiler,weblink 2021-02-19, Zend by Perforce, en, WEB, PHP 8: The JIT - stitcher.io,weblink 2021-02-19, stitcher.io, en, and before while not on in the default version, had options like HHVM. For older versions of PHP: Although PHP opcodes are generated each time the program is launched, and are always interpreted and not just-in-time compiled.}} Tcl, mawk and Forth (however, Forth is seldom compiled via bytecodes in this way, and its virtual machine is more generic instead). The implementation of Perl and Ruby 1.8 instead work by walking an abstract syntax tree representation derived from the source code.More recently, the authors of V8 and Dart have challenged the notion that intermediate bytecode is needed for fast and efficient VM implementation. Both of these language implementations currently do direct JIT compiling from source code to machine code with no bytecode intermediary.

Examples



(disassemble '(lambda (x) (print x)))
disassembly for (LAMBDA (X))
2436F6DF: 850500000F22 TEST EAX, [#x220F0000] ; no-arg-parsing entry point
E5: 8BD6 MOV EDX, ESI
E7: 8B05A8F63624 MOV EAX, [#x2436F6A8] ; #
ED: B904000000 MOV ECX, 4
F2: FF7504 PUSH DWORD PTR [EBP+4]
F5: FF6005 JMP DWORD PTR [EAX+5]
F8: CC0A BREAK 10 ; error trap
FA: 02 BYTE #X02
FB: 18 BYTE #X18 ; INVALID-ARG-COUNT-ERROR
FC: 4F BYTE #X4F ; ECX


Compiled code can be analysed and investigated using a built-in tool for debugging the low-level bytecode. The tool can be initialized from the shell, for example:
import dis # "dis" - Disassembler of Python byte code into mnemonics. dis.dis('print("Hello, World!")')
1 0 LOAD_NAME 0 (print)
2 LOAD_CONST 0 ('Hello, World!')
4 CALL_FUNCTION 1
6 RETURN_VALUE

See also

{{wiktionary|bytecode}}

Notes

{{notelist}}

References



- content above as imported from Wikipedia
- "bytecode" does not exist on GetWiki (yet)
- time: 5:03am EDT - Sat, May 18 2024
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 23 MAY 2022
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
CONNECT