Implementation of Loop Peeling in CTOC

Kim Ki Tae; 김제민; Weon Hee Yoo

The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis, and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form in order to efficiently process the loops, and exhibits the procedures for generating the loop tree.

Citation status

KCI Citation Counts (1)
열림/닫힘 버튼
REFERENCES (14)
열림/닫힘 버튼
* 2021년 이후 발행 논문의 참고문헌은 현재 구축 중입니다.

[book] Tim Linholm / 1997 / The Java Virtual Machine Specification, The Java Series / Addison Wesley, Reading

[book] James Gosling / 1997 / The Java Language Specification, The Java Series / Addison Wesely

[journal] 김기태 / 2006 / A Study on Control Flow Analysis Using Java Bytecodes in CTOC / 한국콘텐츠학회 논문지 / 한국콘텐츠학회 6(1) : 160~169

[journal] 김기태 / 2006 / Static Single Assignment Form for Java Bytecodes in CTOC / 정보처리학회논문지D / 한국정보처리학회 13(7) : 939~946

[journal] 김기태 / 2007 / Processing of Code Optimization in CTOC / 멀티미디어학회논문지 / 한국멀티미디어학회 10(5) : 687~697

[journal] 김기태 / 2006 / Value Numbering for Java Bytecodes Optimization in CTOC / 한국컴퓨터정보학회논문지 / 한국컴퓨터정보학회 11(6) : 19~26

[book] Alfred V. Aho / 1986 / Compilers Principles, Techniques and Tools / Addison Wesley

[book] Andrew W. appel / 1998 / Modern Compiler Implementation in Java / CAMBRIDGE UNIVERSITY PRESS : 437~477

[book] Muchnick, S / 1997 / Advanced Compiler Design and Implementation / Morgan Kaufmann Publishers

[journal] Tarjan, R. E / 1974 / Testing flow graph reducibility / J. Comput. Syst. Sci 9 : 355~365

[journal] Havlak, P / 1997 / Nesting of reducible and irreducible loops / ACM Trans. Program. Lang. Syst 19(4) : 557~567

[journal] Sreedhar, V. C / 1996 / Identifying loops using DJ graphs / ACM Trans. Program. Lang. Syst 18(6) : 649~658

[report] Steensgaard, B / 1993 / Sequentializing program dependence graphs for irreducible programs / Microsoft Research, Redmond, Wash

[web] / / http://www.graphviz.org/

KJC Korea
Journal Central

Statistics

Tools

Sharing

Issue List

Citation status