The PowerPC 604 RISC Microprocessor - eisber.net

Recommendations

Info

I Index of InstructionsAil load 39aastore 41aconst_null 29aload 32aload_ 32anewarray 37anewarray_quick 75areturn 64arraylength 38astore 35astore_ 35athrow 70baload 39bastore 42bipush 27breakpoint 64caload 40castore 42checkcast 71checkcast_quick 81d21 55(12i54(121 54dadd 45daload 39dastore 41dcmpg 61dcmpl 60dconst_ 30ddiv 48(load 32dload_ 32dmul 47&leg 49(rem 49(return 64(store 34dstore_ 34dsub 46dup 43dup_x 1 43dup_x2 44dtip2 43citip2_x 144dup2_x2 44(2d 54Ili 53121 54(add 45(alum' 39(astore 41fcmpg 60fcmpl 60lconst_ 30fdiv 47(load 31fload_ 31fmtil 46Ineg 49(rem 48(return 64(store 34Istore_ 34(sub 46getlield 67gel(ietd_quick 76get(icld2_quick 77getslatic 68getstatic_quick 77getstat1c2_quick 78goto 61goto_w 6212d 52i21 52121 52iadd 44iaload 38iand 51iastore 40iconst_ 29iconst_ml 29idiv 47if_acmpeq 61if_acmpne 61if_acmpeq 58if_icmpge 59ificmpgt 59i(_icmple 59if_icmplt 58if_icmpne 58ifeq 56lige 58ifgt 57tie 57iflt 56ifne 57ifnonnull 57ifnult 56iinc 35load 30iload_ 30hind 46ineg 49instanceof 71instanceof_quick 81instruction name 271nt2byte 55Int2char 55int2short 55invokeinterface 70invokeinterface_quick 80invokenonvirtual 69invokenonvirtual_quick 79invokestatIc 69invokestatic_quick 79invokevirtual 68invokevirtual_quick 78Invokevirtualobject_quick 78for 51hem 48ireturn 63Ishl 50ishr 50istore 33istore_ 33Isub 45luster 50ixor 52jsr 62jsr_w 62I2d 53121 53121 53ladd 45laload 38land 51lastore 40Icrnp 60Iconst_ 29Idcl 28Idcl_quick 74Idc2 28Idc2_quick 74Idc2w 29Idc2w_quick 74ldiv 47'load 31lload_ 31Imul 46',leg 49lookupswitch 66lor 51hem 48!return 63Ishl 50Ishr 50!store 33Istore_ 33!sub 45lusty 51Ixor 52monitorenter 72monitorexit 72multianewarray 37multianewarray_quick 75new 71new_quick 80newarray 36nop 42pop 43pop2 43putfield 66putfield_quick 76putfield2_quick 76putstatic 67putstatic_quick 77putstatic2_quick 77ret 63ret_w 63return 64saload 40sastore 42sipush 28swap 44tableswitch 65wide 35August 22, 1995 lava ViflUAI MA(Illne SpecillcAllun 83 84 Java Vitt.% Machine Specilicaiion August 52, 1995
Efficient JavaVM Just-in-Time CompilationAndreas Krallhttp://www.complang.tuwien.ac.at/andi/AbstractConventional compilers are designed for producinghighly optimized code without paying much attention tocompile time. The design goals of Java just-in-time compilersare different: produce fast code at the smallest possiblecompile time. In this article we present a very fast algorithmfor translating JavaVM byte code to high quality machinecode for RISC processors. This algorithm handles combinesinstructions, does copy elimination and coalescing and doesregister allocation. It comprises three passes: basic blockdetermination, stack analysis and register preallocation, finalregister allocation and machine code generation. Thisalgorithm replaces an older one in the CACAO JavaVM implementationreducing the compile time by a factor of sevenand producing slightly faster machine code. The speedupcomes mainly from following simplifications: fixed assignmentof registers at basic block boundaries, simple registerallocator, better exception handling, better memory managementand fine tuning the implementation. The CACAOsystem is currently faster than every JavaVM implementationfor the Alpha processor and generates machine codefor all used methods of the javac compiler and its librariesin 60 milliseconds on an Alpha workstation.1 IntroductionJava's [2] success as a programming language resultsfrom its role as an Internet programming language. Thebasis for this success is the machine-independent distributionformat of programs with the Java virtual machine [12].The standard interpretive implementation of the Java virtualmachine makes execution of programs slow. This does not'Copyright 1998 IEEE. Published in the Proceedings of PACT'98, 12-18 October 1998 in Paris, France. Personal use of this material is permitted.However, permission to reprint/republish this material for advertisingor promotional purposes or for creating new collective works for resale orredistribution to servers or lists, or to reuse any copyrighted component ofthis work in other works, must be obtained from the IEEE. Contact: Manager.Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane/ P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl.732-562-3966.matter if small applications are executed in a browser, butbecomes intolerable if big applications are executed. Thereare two solutions to solve this problem:• specialized JavaVM processors,• compilation of byte code to the native code of a standardprocessor.SUN took both paths and is developing both Java processorsand native code compilers. In our CACAO systemwe chose to go for native code compilation since it is moreportable and gives more opportunities for improving the executionspeed. Compiling to native code can be done in twodifferent ways: compilation of the complete program in advanceor compilation on demand of only the methods whichare executed (just in time compiler, JIT). The CACAO system[10] uses a JIT compiler and is freely available via theworld wide web.1.1 Previous WorkThe idea of machine independent program representationsis quite old and goes back to the year 1960 [14]. Anintermediate language UNCOL (UNiversal Computer OrientedLanguage) was proposed for use in compilers to reducethe development effort of compiling many differentlanguages to many different architectures. The design ofthe JavaVM has been strongly influenced by P code, the abstractmachine used by many Pascal implementations [13].P code is well known from its use in the UCSD Pascal system.There have even been efforts to develop microprocessorswhich execute P code directly.The Amsterdam compiler kit [16] [15] uses a stack orientedintermediate language. This language has been designedfor fast compilers which emit efficient code. Theintermediate representation of the Gardens Point compilerproject is also based on a stack machine called Dcode [8].Dcode was influenced by Pascal P code. Both Dcode interpretersand code generators for different architectures exist.The problems of compiling a stack oriented abstract machinecode to native code are well known from the programminglanguage Forth. In his thesis [5] and in [7] Ertl describesRAFTS, a Forth system that generates native code
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 31 and 32:
Page 33 and 34:
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 and 52: if) 1993, 1994, 1995 Sim Microsyste
Page 53 and 54: 0-PrefaceThis document describes ve
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: checkcast_quickMake sure object is
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 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

Create successful ePaper yourself

Delete template?

Save as template?