小型JIT編譯器之最佳化技術評估指導教授:單智君老師指導學長:喬偉豪學長組員:鍾懿軒，蔣季融，李國丞小型JIT編譯器之最佳化技術評估指導教授:單智君老師1Outline觀察-----------------------------------鍾懿軒動機-----------------------------------鍾懿軒目標-----------------------------------鍾懿軒初步設計-----------------------------李國丞修改過的設計------------------------蔣季融未來進度-----------------------------蔣季融Outline觀察---------------------2觀察Java是用stack運算。因為底層機器是register-based非stack-based，用interpreter執(zhí)行，performance不佳。加入JIT將bytecode轉換為register-based的指令，可以增進performance。若於JIT中加入一些機制，增進其效能，則可進一步增進javaperformance。觀察Java是用stack運算。3動機加入的機制若能產(chǎn)生IR，使JITcompiler後端處理更方便。就有可能增進JIT的速度。folding機制:讀入bytecode產(chǎn)生register-based的IR，簡便後段處理。因此決定於JIT中加入folding機制。動機加入的機制若能產(chǎn)生IR，使JITcompiler後端處4目標將folding機制加入JIT中，以最少的overhead，fold最多的pattern，達到增加performance的目的。目標將folding機制加入JIT中，以最少的overhea5初步設計架構圖Bytecode分類Pattern統(tǒng)計遇到的問題初步設計架構圖6舊架構圖舊架構圖7舊folding架構圖舊folding架構圖8Bytecode分類1.定義:參考kim’spaper(AdvancedPOCModel-BasedJavaInstructionFoldingMechanism)P:非operation含有push。Op:operation含有push不含pop。Oc:operation含有pop不含push。C:非operation含有pop。On:不含pushpop,無法分類者。Bytecode分類1.定義:9Bytecode分類(續(xù))參考學長的paper(stackoperationsfoldinginjavaprocessors)P:transferingdatafromConstantRegisterorLocalVariabletotheoperandstack。O:getsdatafromtheoperandstackandthenperformsdifferenttasksOe:ALUtypeoperatorthatwritestheresultbacktotheoperandstack。Ob:Branchtypeoperator。Oc:Complextypeoperatorincludingarrayaccess,constantpoolaccess。Ot:unableorhardtojointhefoldingoperation。C:consumesdatafromtheoperandstack,andstoresdatabackintothelocalvariable。Bytecode分類(續(xù))參考學長的paper(stack10Bytecode分類(續(xù))2.統(tǒng)計bytecodepush/pop數(shù):檢視kvmsourcecode(bytecodes.c):查看每道bytecode的執(zhí)行碼中有多少push,pop的動作。檢視jvmspec(chapter6)每道bytecode都已規(guī)定好stack情況，可直接紀錄。Bytecode分類(續(xù))11AnalyzepatternspossibilityinJavaclassfileGetinformationfromJavaclassfileDoitourself(inC++)BCELlibraryforJava

(/bcel)

Analyzepatternspossibilityi12Possibilityofpatterns(1)KIM所統(tǒng)計出的Patterns及出現(xiàn)百分比(2)自行統(tǒng)計”EmbeddedCaffeineMark”的結果

Possibilityofpatterns(1)KIM所13ProblemsClassificationcansavetimeofstringmatchingUsing“Hashing”isbetterthanstringmatching!Benefitofclassificationnolongerexistswhenusing“Hashing”!使用stringmatchingsequentialsearch:Toomuchfindingoverhead。ProblemsClassificationcansav14修改過的設計新架構圖Folding方法修改過的設計新架構圖15Structureof“JVMwithJIT”JavacodesourceJAVAcompilerJavabytecodeClassloaderBytecodeverifierHardwareOperatingSystemJavaclasslibrariesHotspotInterpretNativecodeJVMInterpreterJITYNStructureof“JVMwithJIT”Jav16Interactionbetween

Interpreter&JITTimeOnemethodHotspotDetectInterpretTimeComplicatedcodeJITEndofmethod(Startofmethod)CodeblockCodeblockInteractionbetween

Interpret17StrutureofourJITJITIRgeneratorFoldingCodegeneratorIR1IR2NativecodeMethodStrutureofourJITIRgenerato18方法(4-1)-OverviewO-oriented.

SearchbytecodesforO-typebytecodethenfindfoldingpatternforthisO-typebytecode.Datastructure:array.Table:Usedforstoringinformationofbytecodes.方法(4-1)-OverviewO-oriented.

Se19方法(4-2)-DataStructureTable:usebytecodeIDnumberasindex.Buffer:length=4;Bytecodeinformation:TypeP_num:PushnumberPostive,stackgrowC_num:PopnumberNegative,stackfall方法(4-2)-DataStructureTable:u20方法(4-3)-Algorithm經(jīng)由bytecode定義可得:P-type:C_num=0,P_num=1.C-type:P_num=0,C_num=1.O-type:不一定，視其功能而定。以O-type的attribute為尋找pattern的依據(jù)。P_num:向後尋找P_num個bytecodesC_num:向前尋找C_num個bytecodes方法(4-3)-Algorithm經(jīng)由bytecode定義可21方法(4-4)Match:向前找C_num個bytecodes的P_num剛好和O-type的C_num相抵銷。向後找P_num個bytecodes的C_num剛好和O-type的P_num相抵銷。整個pattern的attribute和要為零。無法match放棄此O-typebytecode，繼續(xù)找下一個。針對continuouspattern設計。方法(4-4)Match:22未來進度TracingcodeModifyingcodeSimulationPerformance未來進度Tracingcode23TracingcodeEnvironmentconfigurationTracecodeConcentrateon“HowtoaddFoldingintoJIT?”TracingcodeEnvironmentconfig24ModifyingcodeAddingFoldingtoJITModulizingFoldingandaddingitintoJITbetween“IRgenerator”and“Codegenerator”IRGeneratorCodeGeneratorBytecodeNativecodeFoldingModifyingcodeAddingFoldingt25SimulationRunbenchmarkonARMsimulatoronLinuxworkstationBenchmark:”EmbeddedCaffeineMark”SimulationRunbenchmarkonARM26PerformanceFindout“PerformanceSpeedup”afterusingfoldingSpeedup=

(time_with_folding)/