The PowerPC 604 RISC Microprocessor - eisber.net

Recommendations

Info

AlContentsAppendix A: An Optimization 73A.1 Constant Pool Resolution 73A.2 Pushing Constants onto the Stack (_quick variants)... 74A.3 Managing Arrays (_quick variants) 75A.4 Manipulating Object Fields (_quick variants) ...... 76A.5 Method Invocation (__quick variants) ...... 78A.6 Miscellaneous Object Operations (_quick variants) 110Index of Instructions 83Preface 5Chapter 1: Java Virtual Machine Architecture 71.1 Supported Data Types 71.2 Registers 71.3 Local Variables 814 The Operand Stack 81.5 Execution Environment 81.6 Garbage Collected Heap 91 7 Method Area 101.8 The Java Instruction Set 101.9 Limitations 10Chapter 2: Class File Format 112 Format 112.2 Signatures 132.3 Constant I'ool 152.4 Fields 192 5 Methods 192.6 Attributes 20Chapter 3: The Virtual Machine Instruction Set 273.1 Format for the Instructions 273 2 Pushing Constants onto the Stack 273.3 Loading Local Variables Onto the Stack 303.4 Storing Stack Values into Local Variables 333 5 Wider index for Loading, Storing and Incrementing 353.6 Managing Arrays 363.7 Stack Instructions 423.8 Arithmetic Instructions 443.9 Logical Instructions 503 10 Conversion Operations 523.11 Control Transfer Instructions 563.12 Function Return 633.13 Table Jumping 653.14 Manipulating Object Fields 663.15 Method Invocation 683.16 Exception Handling 703.17 Miscellaneous Object Operations 713.18 Monitors 72August 22, 1995 lava Vittual Machine Specification 3 4 lava %/WW1' Machine Specification Angus' 22. 1995
0-PrefaceThis document describes version 1.0 of the Java Virtual Machine and its instniction set. We have written thisdocument to act as a specification for both compiler writers, who wish to target the machine, and as aspecification for others who may wish to implement a compliant Java Virtual Machine.The Java Virtual Machine is an imaginary machine that is implemented by emulating it in software on a realmachine. Code for the Java Virtual Machine is stored in c lass files, each of which contains the code for atmost one publ is class.Simple and efficient emulations of the Java Virtual Machine are possible because the machine's format iscompact and efficient bytecodes. Implementations whose native code speed approximates that of compiled Care also possible, by translating the bytecodes to machine code, although Sun has not released suchimplementations at this time.ihe rest of this document is structured as follows:• Chapter 1 describes the architecture of the Java Virtual Machine.• Chapter 2 describes the .c lass file format.• Chapter 3 describes the bytecodes.• Appendix A contains some instructions generated internally by Sun's implementation of the JavaVirtual Machine. While not strictly part of the specification we describe these here so that thisspecification can serve as a reference for our implementation. As more implementations of the JavaVirtual Machine become available, we may remove Appendix A from future releases.Sun will license the Java Virtual Machine trademark and logo for use with compliant implementations of thisspecification. If you are considering constructing your own implementation of the Java Virtual Machine pleasecontact us, at the email address below, so that we can work together to insure 100% compatiblity of yourimplementationSend comments on this specification or questions about implementing the Java Virtual Machine to ourelectronic mail address: Java@java.sun.com .August n. 1995 lava Vlllual Machine Spet 1110111On 5 6 lava VtittiAl NiMittrIC SpfCifl(MiOil August 22. 149'
Page 1 and 2: The PowerPC 604 RISC Microprocessor
Page 3 and 4: Rename valid I Reg num Result Resul
Page 5 and 6: updated by speculatively executed m
Page 7 and 8: PowerPC 604Reservation stationRA (0
Page 9 and 10: Data addressInstruction address•M
Page 11 and 12: Threaded Codethreaded = aufgefadelt
Page 13 and 14: token threaded codeindirect token t
Page 15 and 16: Kosten auf dem MIPS 83000indirect t
Page 17 and 18: CTIL'Start / Restart' 14ZIP Funktio
Page 19 and 20: SystemparameierStackbefehleKarmen a
Page 21 and 22: KontrollstrukturenBEGIN ... END Sch
Page 23 and 24: Stack Framelocal stacklocalsparamet
Page 25 and 26: 122 The P-code Machine [Ch.Thus the
Page 27 and 28: 68Pascal Implementation: Compiler a
Page 29 and 30: 72 Pascal Implementation: Compiler
Page 35 and 36: Tables of Lexical Analysis123456frw
Page 37 and 38: JVIII ■ 111t14 /1.11111ySIS ai Y
Page 39 and 40: 4Pascal implementation: Compiler an
Page 41 and 42: 8 Pascal Implementation: Compiler a
Page 43 and 44: 12 Pascal implementation: Compiler
Page 45 and 46: 16Pascal Implementation: Compiler a
Page 47 and 48: 30 Pascal inipletnentatIon: Compile
Page 49 and 50: 34 Pascal implementation: Complier
Page 51: if) 1993, 1994, 1995 Sim Microsyste
Page 55 and 56: method calls into actual method cal
Page 57 and 58: auper_el arsThis field is an index
Page 59 and 60: ATtagbytesCONSTANT_Integer_infoul t
Page 61 and 62: 2.6.1 SourceFileThe "SourceFile" at
Page 63 and 64: local ..verieble_table_lengthThis f
Page 65 and 66: 1dc2wPush long or double from const
Page 67 and 68: I 3.4Storing Stack Values into Loca
Page 69 and 70: anewarrayAllocate new array of refe
Page 71 and 72: PastoreStore into single float arra
Page 73 and 74: laddLong integer addfSubSingle floa
Page 75 and 76: dreminegInegInegdnegDouble float re
Page 77 and 78: IliLong integer to integerSyntax:L
Page 79 and 80: ifleBranch if less than or equal to
Page 81 and 82: dcmpgDouble float compare (1 on NaN
Page 83 and 84: 3.13 Table JumpingtableswitchAccess
Page 85 and 86: the matched method is found. The me
Page 87 and 88: Appendix A: An OptimizationA.2 Push
Page 89 and 90: cpgetfield2_quickFetch held from ob
Page 91 and 92: checkcast_quickMake sure object is
Page 93 and 94: Efficient JavaVM Just-in-Time Compi
Page 95 and 96: The second pass of the compiler tra
Page 97 and 98: chain length 1 2 3 4 5 6 7 8 9 >9oc
Page 99 and 100: sieve JavaLex javac espresso i Toba
Page 101 and 102: Technical Overview of the Common La
Page 103 and 104:
In contrast to the JVM where all st
Page 105 and 106:
The ldind t instruction expects an
Page 107 and 108:
It should be obvious that having va
Page 109 and 110:
9 Interaction between value and ref
Page 111 and 112:
2. CLI Partition II: Metadata. http
Page 113 and 114:
Anforderungen an den Zwischencode
Page 115 and 116:
DieRoboterprogrammiersprache• kei
Page 117 and 118:
Implementierung des Interpreters•
Page 119 and 120:
Printed by andi from a0.complang.tu
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
power but retain the disciplined vi
Page 131 and 132:
I- be reached from the present curs
Page 133 and 134:
the editor will be invoked asking t
Page 135 and 136:
immediately that 'I' has type integ
Page 137 and 138:
--y-PASC7,1,.The useof a formal lan
Page 139 and 140:
Implementation Techniques for Prolo
Page 141 and 142:
x(X) a(A)a(C) b(C), c(C)b(s(0))c(s(
Page 143 and 144:
Unification in general consists of
Page 145 and 146:
for the classification of temporary
Page 147 and 148:
copy stack1trailenvironment stack1t
Page 149:
process reduction attempt are elimi
show all

The PowerPC 604 RISC Microprocessor - eisber.net

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?