Java virtual machine - Wikipedia

https://en.wikipedia.org/wiki/Java_virtual_machine • 237 KB fetched
Open original page

Java virtual machine - Wikipedia

*

Home

*

Random

*

Nearby

*

Create account

*

Log in

*

Settings

Donate Now
If Wikipedia is useful to you, please give today.

*

About Wikipedia

*

Disclaimers

Search

User menu

*

Create account

*

Log in

Java virtual machine

*
Article

*
Talk

*

Language

*

Watch

*

Edit

"JVM" redirects here. For other uses, see JVM (disambiguation) .

{{cite web |title=JEP 479: Remove the Windows 32-bit x86 Port |url=https://openjdk.org/jeps/479 |website=OpenJDK}}</ref> and JDK 25 (Linux).<ref>{{cite web |title=JEP 503: Remove the 32-bit x86 Port |url=https://openjdk.org/jeps/503 |website=OpenJDK}}</ref>}}"},"introduced":{"wt":"{{Start date and age|1994}}"},"version":{"wt":"{{wikidata|property|preferred|references|edit|Q251|P348|P548=Q2804309}}"},"design":{"wt":""},"type":{"wt":"[[Stack machine|Stack]] and [[Load–store architecture|register–register]]"},"encoding":{"wt":"Variable"},"branching":{"wt":"Compare and branch"},"endianness":{"wt":"[[Endianness#Big-endian|Big]]"},"page size":{"wt":""},"extensions":{"wt":""},"open":{"wt":"Yes"},"registers":{"wt":""},"gpr":{"wt":"Per-method operand stack (up to 65535 operands) plus per-method local variables (up to 65535)"},"fpr":{"wt":""}},"i":0}}]}"> A Java virtual machine ( JVM ) is a virtual machine that enables a computer to run Java programs as well as programs written in other languages, referred to as JVM languages , that are also compiled to Java bytecode . The JVM is detailed by a specification that formally describes what is required in a JVM implementation. Having a specification ensures interoperability of Java programs across different implementations so that program authors using the Java Development Kit (JDK) need not worry about idiosyncrasies of the underlying hardware platform.
Java virtual machine Designer Sun Microsystems
Bits 32-bit , 64-bit [ a ]
Introduced 1994 ; 32   years ago   ( 1994 )
Version Java SE 26 [ 3 ]  
Type Stack and register–register
Encoding Variable
Branching Compare and branch
Endianness Big
Open Yes
Registers
General-purpose Per-method operand stack (up to 65535 operands) plus per-method local variables (up to 65535)

Overview of a Java virtual machine (JVM) architecture based on The Java Virtual Machine Specification Java SE 7 Edition

The JVM reference implementation is developed by the OpenJDK project as open source code and includes a JIT compiler called HotSpot . The commercially supported Java releases available from Oracle are based on the OpenJDK runtime. Eclipse OpenJ9 is another open source JVM for OpenJDK.

Contents

* 1 JVM specification
* 1.1 Garbage collectors

* 2 Virtual machine architecture
* 2.1 JVM languages

* 2.2 Class loader

* 2.3 Bytecode instructions

* 2.4 Bytecode verifier
* 2.4.1 Secure execution of remote code

* 2.5 Bytecode interpreter and Just-in-Time compiler

* 2.6 Java Native Interface

* 3 JVM in the web browser
* 3.1 JavaScript JVMs and interpreters

* 3.2 Transpilation to JavaScript

* 4 See also

* 5 Notes

* 6 References

* 7 External links

JVM specification

edit

The Java virtual machine is an abstract (virtual) computer defined by a specification. It is a part of the Java Runtime Environment . The garbage collection algorithm used and any internal optimization of the Java virtual machine instructions (their translation into machine code ) are not specified. The main reason for this omission is to not unnecessarily constrain implementers. Any Java application can be run only inside some concrete implementation of the abstract specification of the Java virtual machine. [ 4 ]

Starting with Java Platform, Standard Edition (J2SE) 5.0, changes to the JVM specification have been developed under the Java Community Process as JSR 924. [ 5 ] As of 2006 [ update ] , changes to the specification to support changes proposed to the class file format (JSR 202) [ 6 ] are being done as a maintenance release of JSR 924. The specification for the JVM was published as the blue book , [ 7 ] whose preface states:

We intend that this specification should sufficiently document the Java Virtual Machine to make possible compatible clean-room implementations. Oracle provides tests that verify the proper operation of implementations of the Java Virtual Machine.

The most commonly used Java virtual machine is Oracle's HotSpot .

Oracle owns the Java trademark and may allow its use to certify implementation suites as fully compatible with Oracle's specification.

Garbage collectors

edit

See also: Garbage collection (computer science) §   Java

Garbage collectors available in Java OpenJDKs virtual machine (JVM) include:

* Serial

* Parallel

* CMS (Concurrent Mark Sweep)

* G1 (Garbage-First)

* ZGC (Z Garbage Collector)

* Epsilon

* Shenandoah

* GenZGC (Generational ZGC)

* GenShen (Generational Shenandoah)

* IBM Metronome (only in IBM OpenJDK)

* SAP (only in SAP OpenJDK)

* Azul C4 (Continuously Concurrent Compacting Collector) [ 8 ] (only in Azul Systems OpenJDK)

Java versions and their Garbage Collectors

Version Default GC Available GCs

6u14 Serial /
Parallel ( MP ) Serial, Parallel, CMS , G1 (E)

7u4–8 Serial, Parallel, CMS, G1

9–10 G1

11 Serial, Parallel, CMS, G1, Epsilon (E) , ZGC (E)

12–13 Serial, Parallel, CMS, G1, Epsilon (E) , ZGC (E) , Shenandoah (E)

14 Serial, Parallel, G1, Epsilon (E) , ZGC (E) , Shenandoah (E)

15–20 Serial, Parallel, G1, Epsilon (E) , ZGC, Shenandoah

21–22 Serial, Parallel, G1, Epsilon (E) , ZGC, Shenandoah, GenZGC (E)

23 Serial, Parallel, G1, Epsilon (E) , ZGC, Shenandoah, GenZGC (default ZGC)

24 Serial, Parallel, G1, Epsilon (E) , Shenandoah, GenZGC, GenShen (E)

25 Serial, Parallel, G1, Epsilon (E) , Shenandoah, GenZGC, GenShen

(E) = experimental

Java's design philosophy revolves around the assumption of a garbage collector. Unlike languages such as C++ and Rust , deterministic memory management through a delete keyword (as in C++) is not possible. Even introducing such a feature is not possible, due to a lack of ownership, aside from using sun.misc.Unsafe or through java.lang.foreign to allocate/deallocate memory outside the Java heap. [ 9 ] [ 10 ] Due to Java primarily using heap-based allocation, objects are stored as references, and deletion would result in dangling pointers .

Foo a = new Foo ();
Foo b = a ;

delete a ;
System . out . println ( b );

Virtual machine architecture

edit

The JVM operates on specific types of data as specified in Java Virtual Machine specifications. The data types can be divided [ 11 ] into primitive types ( integer and floating-point values) and reference types. long and double types, which are 64-bits , are supported natively, but consume two units of storage in a frame's local variables or operand stack, since each unit is 32 bits. boolean , byte , short , and char types are all sign-extended (except char which is zero-extended ) and operated on as 32-bit integers, the same as int types. The smaller types only have a few type-specific instructions for loading, storing, and type conversion. boolean is operated on as 8-bit byte values, with 0 representing false and 1 representing true . (Although boolean has been treated as a type since The Java Virtual Machine Specification, Second Edition clarified this issue, in compiled and executed code there is little difference between a boolean and a byte except for name mangling in method signatures and the type of Boolean arrays. boolean s in method signatures are mangled as Z while byte s are mangled as B . Boolean arrays carry the type boolean[] but use 8 bits per element, and the JVM has no built-in capability to pack booleans into a bit array , so except for the type they perform and behave the same as byte arrays. In all other uses, the boolean type is effectively unknown to the JVM as all instructions to operate on Booleans are also used to operate on byte s.)

The JVM has a garbage-collected heap for storing objects and arrays. Code, constants, and other class data are stored in the "method area". The method area is logically part of the heap, but implementations may treat the method area separately from the heap, and for example might not garbage collect it. Each JVM thread also has its own call stack (called a "Java Virtual Machine stack" for clarity), which stores frames . A new frame is created each time a method is called, and the frame is destroyed when that method exits.

Each frame provides an "operand stack" and an array of "local variables". The operand stack is used for operands to run computations and for receiving the return value of a called method, while local variables serve the same purpose as registers and are also used to pass method arguments. Thus, the JVM is both a stack machine and a register machine . In practice, HotSpot eliminates every stack besides the native thread/call stack even when running in Interpreted mode, as its Templating Interpreter technically functions as a compiler.

The JVM uses references and stack/array indexes to address data; it does not use byte addressing like most physical machines do, so it does not neatly fit the usual categorization of 32-bit or 64-bit machines. In one sense, it could be classified as a 32-bit machine, since this is the size of the largest value it natively stores: a 32-bit integer or floating-point value or a 32-bit reference. Because a reference is 32 bits, each program is limited to at most 2 32 unique references and therefore at most 2 32 objects. However, each object can be more than one byte large, and potentially very large; the largest possible object is an array of long of length 2 31 - 1 which would consume 16 GiB of memory, and there could potentially be 2 32 of these if there were enough memory available. This results in upper bounds that are more comparable to a typical 64-bit byte-addressable machine. A JVM implementation can be designed to run on a processor that natively uses any bit width as long as it correctly implements the integer (8-, 16-, 32-, and 64-bit) and floating-point (32- and 64-bit) math that the JVM requires. Depending on the method used to implement references (native pointers, compressed pointers, or an indirection table), this can limit the number of objects to less than the theoretical maximum. An implementation of the JVM on a 64-bit platform has access to a much larger address space than one on a 32-bit platform, which allows for a much larger heap size and an increased maximum number of threads, which is needed for certain kinds of large applications; however, there can be a performance hit from using a 64-bit implementation compared to a 32-bit implementation.

JVM languages

edit

Main article: List of JVM languages

A JVM language is any language with functions that can be expressed in a valid class file, which can be hosted by a JVM. A class file contains JVM instructions ( JVM bytecode ), a symbol table, and other ancillary information. The class file format is the hardware- and operating system-independent binary format used to represent compiled classes and interfaces. [ 12 ]

There are several JVM languages, both older established languages ported to JVM, and much newer from-scratch languages. JRuby and Jython may be the best known ports of older languages, i.e., Ruby and Python respectively. Of the new from-scratch languages created to compile to Java bytecode, Clojure , Groovy , Scala and Kotlin may be the most popular. A notable feature of the JVM languages is their language interoperability , they are compatible with each other, so that, for example, Scala libraries can be used with Java programs and vice versa. [ 13 ]

Java 7 JVM implements JSR 292: Supporting Dynamically Typed Languages [ 14 ] on the Java Platform, a new feature which supports dynamically typed languages in the JVM. This feature is developed within the Da Vinci Machine project whose mission is to extend the JVM so that it supports languages other than Java. [ 15 ] [ 16 ]

Class loader

edit

Main article: Java class file

One of the organizational units of JVM byte code is a class . A class loader implementation must be able to recognize and load anything that conforms to the Java class file format . Any implementation is free to recognize other binary forms besides class files, but it must recognize class files.

The class loader performs three basic activities in this strict order:

* Loading: finds and imports the binary data for a type

* Linking: performs verification, preparation, and (optionally) resolution

* Verification: ensures the correctness of the imported type

* Preparation: allocates memory for class variables and initializing the memory to default values

* Resolution: transforms symbolic references from the type into direct references.

* Initialization: invokes Java code that initializes class variables to their proper starting values.

In general, there are three types of class loader: bootstrap class loader, extension class loader and System / Application class loader.

Every Java virtual machine implementation must have a bootstrap class loader that is capable of loading trusted classes, as well as an extension class loader or application class loader. The Java virtual machine specification does not specify how a class loader should locate classes.

Bytecode instructions

edit

Main article: Java bytecode

The JVM has instructions for the following groups of tasks:

* Load and store

* Arithmetic

* Type conversion

* Object creation and manipulation

* Operand stack management (push / pop)

* Control transfer (branching)

* Method invocation and return

* Throwing exceptions

* Monitor-based concurrency

The aim is binary compatibility. Each particular host operating system needs its own implementation of the JVM and runtime. These JVMs interpret the bytecode semantically the same way, but the actual implementation may be different. More complex than just emulating bytecode is compatibly and efficiently implementing the Java core API that must be mapped to each host operating system.

These instructions operate on a set of common abstracted data types rather the native data types of any specific instruction set architecture .

Bytecode verifier

edit

A basic philosophy of Java is that it is inherently safe from the standpoint that no user program can crash the host machine or otherwise interfere inappropriately with other operations on the host machine, and that it is possible to protect certain methods and data structures belonging to trusted code from access or corruption by untrusted code executing within the same JVM. Furthermore, common programmer errors that often led to data corruption or unpredictable behavior such as accessing off the end of an array or using an uninitialized pointer are not allowed to occur. Several features of Java combine to provide this safety, including the class model, the garbage-collected heap , and the verifier.

The JVM verifies all bytecode before it is executed. This verification consists primarily of three types of checks:

* Branches are always to valid locations

* Data is always initialized and references are always type-safe

* Access to private or package private data and methods is rigidly controlled

The first two of these checks take place primarily during the verification step that occurs when a class is loaded and made eligible for use. The third is primarily performed dynamically, when data items or methods of a class are first accessed by another class.

The verifier permits only some bytecode sequences in valid programs, e.g. a jump (branch) instruction can only target an instruction within the same method . Furthermore, the verifier ensures that any given instruction operates on a fixed stack location, [ 17 ] allowing the JIT compiler to transform stack accesses into fixed register accesses. Because of this, that the JVM is a stack architecture does not imply a speed penalty for emulation on register-based architectures when using a JIT compiler. In the face of the code-verified JVM architecture, it makes no difference to a JIT compiler whether it gets named imaginary registers or imaginary stack positions that must be allocated to the target architecture's registers. In fact, code verification makes the JVM different from a classic stack architecture, of which efficient emulation with a JIT compiler is more complicated and typically carried out by a slower interpreter. Additionally, the Interpreter used by the default JVM is a special type known as a Template Interpreter, which translates bytecode directly to native, register based machine language rather than emulate a stack like a typical interpreter. [ 18 ] In many aspects the HotSpot Interpreter can be considered a JIT compiler rather than a true interpreter, meaning the stack architecture that the bytecode targets is not actually used in the implementation, but merely a specification for the intermediate representation that can well be implemented in a register based architecture. Another instance of a stack architecture being merely a specification and implemented in a register based virtual machine is the Common Language Runtime . [ 19 ]

The original specification for the bytecode verifier used natural language that was incomplete or incorrect in some respects. A number of attempts have been made to specify the JVM as a formal system. By doing this, the security of current JVM implementations can more thoroughly be analyzed, and potential security exploits prevented. It will also be possible to optimize the JVM by skipping unnecessary safety checks, if the application being run is proven to be safe. [ 20 ]

Secure execution of remote code

edit

A virtual machine architecture allows very fine-grained control over the actions that code within the machine is permitted to take. It assumes the code is "semantically" correct, that is, it successfully passed the (formal) bytecode verifier process, materialized by a tool, possibly off-board the virtual machine

Links found on this page

1. Home [direct]
2. Random [direct]
3. Nearby [direct]
4. Create account [direct]
5. Log in [direct]
6. Settings [direct]
7. Donate Now If Wikipedia is useful to you, please give today. [direct]
8. About Wikipedia [direct]
9. Disclaimers [direct]
10. Article [direct]
11. Talk [direct]
12. Edit [direct]
13. JVM (disambiguation) [direct]
14. virtual machine [direct]
15. Java [direct]
16. JVM languages [direct]
17. Java bytecode [direct]
18. specification [direct]
19. Java Development Kit [direct]
20. Sun Microsystems [direct]
21. 32-bit [direct]
22. 64-bit [direct]
23. Stack [direct]
24. register–register [direct]
25. Encoding [direct]
26. Branching [direct]
27. Endianness [direct]
28. Registers [direct]
29. General-purpose [direct]
30. reference implementation [direct]
31. OpenJDK [direct]
32. open source [direct]
33. JIT compiler [direct]
34. HotSpot [direct]
35. Oracle [direct]
36. OpenJ9 [direct]
37. edit [direct]
38. Java Runtime Environment [direct]
39. garbage collection [direct]
40. machine code [direct]
41. Java Platform, Standard Edition [direct]
42. Java Community Process [direct]
43. class file format [direct]
44. edit [direct]
45. CMS [direct]
46. G1 [direct]
47. IBM [direct]
48. SAP [direct]
49. Azul Systems [direct]
50. MP [direct]
51. C++ [direct]
52. Rust [direct]
53. sun.misc.Unsafe [direct]
54. java.lang.foreign [direct]
55. dangling pointers [direct]
56. edit [direct]
57. integer [direct]
58. floating-point [direct]
59. reference [direct]
60. sign-extended [direct]
61. zero-extended [direct]
62. name mangling [direct]
63. method signatures [direct]
64. bit array [direct]
65. call stack [direct]
66. register machine [direct]
67. byte addressing [direct]
68. 32-bit [direct]
69. 64-bit [direct]
70. edit [direct]
71. JVM bytecode [direct]
72. ported [direct]
73. JRuby [direct]
74. Jython [direct]
75. Ruby [direct]
76. Python [direct]
77. Clojure [direct]
78. Groovy [direct]
79. Scala [direct]
80. Kotlin [direct]