Runeson, J. Code compression through procedural abstraction before register allocation. Master's thesis, Computer Science Department, Uppsala University, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a frontend to extract DI regions from object code, and build control flow graphs for them. The current architecture, without the automatic flow analysis, is shown in Fig. 1. The flow analysis will work on an intermediate format for an optimizing C compiler, that is currently under development [31]. This format is close to a control flow graph, and will accurately describe the control structure of the generated binary code. The ######### ####### ########### ######### ####### ####### ########## ############## ########### ########## ############### ############ ################## ....

J. Runeson. Code compression through procedural abstraction before register allocation. Master's thesis, Department of Information Technology, Uppsala University, Mar. 2000.

....in an accessible format. We only support C code in our prototype tool. At present, each program must be contained in a single source file, since we need access to the whole program. In the future, we plan to integrate our tools with a whole program compiler developed by the ASTEC WPO Project [45], which will remove the single file limitation. The simulator is a cycle accurate model of the V850E [39] created in our research group using a homegrown generic framework for modeling pipelined processors. At present, we have a prototype implementation of the low level analysis: instruction ....

....there will be parts of a program that are not available as source code. Thus, we need to find ways to handle incomplete programs, standard libraries, and operating system interfaces in WCET analysis. Work on this will be performed in cooperation with the whole program compilation group in Uppsala [45]. ....

J. Runeson. Code compression through procedural abstraction before register allocation. Master's thesis, Department of Information Technology, Uppsala University, March 2000.

....is rarely used in desktop compilers since they tend to concentrate on maximizing speed. Cross calling could be used to make code t in the instruction cache and thereby make it run faster but that is outside the scope of this paper. For more information about cross calling and cross jumping, see [6, 12]. 7 3 Stack Layout Optimization: Basic Concepts We try to keep the discussion as general as possible as stack layout optimization is applicable to any architecture with an indirect load instruction. 3.1 De nitions 1. The number of bytes that the indirect load instruction can access (2 N ....

....code size on the highest level of optimization without cross call and then we lose code size on the same code with cross call, we call this the Cross call problem. Cross call works by nding identical sequences in the code, if the sequences are not identical the code is not factored out (Runeson [12] mentions a cross call algorithm which does not require the sequences to be identical, only semantically equivalent) We believe that the cross call problem can be solved by a cross caller with a more liberal view of equality. The only di erences between the code generated by the current ....

Johan Runeson. Code compression through procedural abstraction before register allocation. Master's thesis, University of Uppsala, March 2000.

No context found.

Runeson, J. Code compression through procedural abstraction before register allocation. Master's thesis, Computer Science Department, Uppsala University, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC