JPH04323730A - Optimizaltion processing system - Google Patents

Abstract

PURPOSE:To efficiently perform the inline expansion in the compiling work and to generate an optimized object code. CONSTITUTION:A syntax analysis means 10, a subprogram definition point position information holding means 1 where position information of an intermediate language is held, an intermediate language output means 12 which stores position information of the intermediate language in the subprogram definition point position information holding means 11, a subprogram definition point collating means 14, an intermediate language input means 13 which transfers the intermediate language to the subprogram definition point collating means 14, an argument correspondence means 15, an optimization processing means 16, and a code generating means 17 which generates an object program from the object code are provided. Thus, the complier processing speed is increased to contribute to the improvement of the program development efficiency, and the size of the object program is reduced to increase the program execution speed.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an optimization processing method for a compiler, and more particularly to an optimization processing method that improves the method of inline expansion of subprograms.

0002

2. Description of the Related Art Recently, along with advances in optimization technology, inlining technology has been developed in which subprograms such as functions or procedures are expanded as subprogram entities in target code without calling them each time.

Hereinafter, a conventional optimization processing method of this type of compiler will be explained with reference to FIG. The syntax analysis means 3 analyzes the source program 1 to generate an intermediate language 4, and then the code generation means 6 generates an intermediate language 4 based on the intermediate language 4.
First purpose code 5 is generated. Thereafter, the inline expansion means 7 reads the first object code 5 and generates the object program 8 by replacing the instruction that calls the subprogram with a set of instructions corresponding to the processing of the subprogram.

0004

[Problems to be Solved by the Invention] However, in the conventional optimization processing method described above, since the first object code 5 is interposed between the intermediate language 4 obtained by syntax analysis and the object program 8, The overhead is large due to the input/output processing of the intermediate language 4 by the means 3 and the code generation means 6, and the input/output processing of the first object code 5 by the code generation means 6 and the inline expansion means 7, which reduces the processing speed of the compiler. The problem was to reduce the Furthermore, since the object code after inline expansion is not optimized, there is also the problem that redundant object code is generated.

The present invention has been made in view of such conventional problems, and it is possible to directly expand function calls inline based on an intermediate language without generating intermediate object code, and to The purpose of this invention is to provide an optimization processing method that can perform optimization processing.

[0006]

[Means for Solving the Problems] In order to achieve the above object, in the present invention, a compiler that generates an object program from a source program analyzes the syntax of the source program to create an intermediate language that does not depend on the writing language or the machine type. A syntax analysis means for translating into a language, a subprogram definition point position information holding means for holding position information of an intermediate language corresponding to a definition point of a subprogram, and outputting the intermediate language generated by the syntax analysis means to an intermediate file. and if the output intermediate language corresponds to the definition point of the subprogram, then
intermediate language output means for storing the position information of the intermediate language in the subprogram definition point position information holding means; and if the intermediate language read from the intermediate file is an intermediate language corresponding to the call of the subprogram, The intermediate language input means to output and the intermediate language received from this intermediate language input means are compared with the information held by the subprogram definition point position information holding means, and the position information and intermediate language of the definition point of the subprogram to be called are determined. The intermediate language corresponding to the subprogram definition point obtained based on the position information received from this subprogram definition point matching means is read, and the formal argument shown therein is read. , and argument mapping means for outputting an intermediate language that is mapped with the actual argument indicated in the intermediate language received from the subprogram definition point matching means, and which saves the size of the target program, and an optimization processing means that transforms the intermediate language to increase execution speed;
and code generation means for generating a target program from the target code based on the intermediate language transformed by the optimization processing means.

[0007]

[Operation] Since the present invention is configured as described above, it is possible to directly expand function calls inline based on the intermediate language and perform optimization processing without first generating intermediate target code. Can be done.

[0008]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Examples of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention. In the figure, 1 is a source program, 2 is a compiler incorporating the optimization processing method of the present invention, and 10 is a compiler incorporating the optimization processing method of the present invention.
11 is a syntactic analysis means that analyzes the syntax of the source program 1 and translates it into an intermediate language independent of the description language and machine type; 11 is subprogram definition point position information that holds position information of the intermediate language corresponding to the definition points of the subprogram; The holding means 12 is an intermediate language output means for outputting the intermediate language generated by the syntax analysis means 10 to the intermediate file 18, and when outputting the intermediate language corresponding to the definition point of the subprogram, the position of the intermediate language is The information is stored in the subprogram definition point position information holding means 11. 13 is an intermediate language input means for passing the read intermediate language to the subprogram definition point matching means 14 when the intermediate language read from the intermediate file 18 is an intermediate language corresponding to a subprogram call; 14 is subprogram definition point position information When the intermediate language received from the intermediate language input means 13 is the intermediate language corresponding to the definition point of the subprogram, the position information of the definition point of the subprogram to be called and the intermediate language are compared with the information held by the holding means 11. The subprogram definition point matching means 15 passes the subprogram definition point matching means 15 to the argument matching means 15, and the subprogram definition point matching means 15 passes the provisional information indicated in the intermediate language corresponding to the definition point of the subprogram obtained based on the position information received from the subprogram definition point matching means 14. Argument association means 1 for associating arguments with actual arguments indicated in the intermediate language received from the subprogram definition point collation means 14 and outputting the intermediate language to the optimization processing means 16;
6 is an optimization processing means that transforms the intermediate language so as to save the size of the target program 19 and increase the execution speed. 17 converts the object program 19 from the object code based on the intermediate language transformed by the optimization processing means 16.
This is a code generation means that generates.

Next, the operation of the above embodiment will be explained in detail. A syntax analysis means 10 analyzes the syntax of the source program 1, translates it into an intermediate language independent of the writing language and model, and passes it to the intermediate language output means 12. Intermediate language output means 1
2 outputs the intermediate language received from the parsing means 10 to an intermediate file 18. However, when outputting an intermediate language corresponding to the definition point of the subprogram defined in the source program 1, the position information of this intermediate language in the intermediate file 18 is calculated and used as an offset to the subprogram definition point position. The information is stored in the information holding means 11. The subprogram definition point position information holding means 11 holds the position information received from the intermediate language output means 12 together with the subprogram name. If the intermediate language read from the intermediate file 18 is not the intermediate language corresponding to the subprogram call, the intermediate language input means 13 passes the read intermediate language as is to the optimization processing means 16, and outputs the intermediate language corresponding to the subprogram call. If it is a language, the read intermediate language is passed to the subprogram definition point matching means 14. Next, the sub-program definition point matching means 14 matches the sub-program name and position information held by the sub-program definition point position information holding means 11, and the intermediate language received from the intermediate language input means 13 is the source program 1. In the case of the intermediate language corresponding to the definition point of the subprogram defined in the subprogram, the intermediate language and the position information of the definition point of the subprogram to be called are passed to the argument mapping means 15, and the intermediate language corresponding to the subprogram call is passed to the argument mapping means 15. If not, the intermediate language is passed to the optimization processing means 16. The argument matching means 15 searches the intermediate file 18 based on the position information received from the subprogram definition point matching means 14, reads the intermediate language corresponding to the definition point of the subprogram, and stores the formal argument shown therein. and subprogram definition point verification means 14
The intermediate language is outputted to the optimization processing means 16 while converting the formal arguments corresponding to the entity of the subprogram into actual arguments. Next, the optimization processing means 16
9, the code generation means 17 executes an optimization process to transform the intermediate language so as to save the size of the code and increase the execution speed, and the code generation means 17 generates the target code from the target code based on the intermediate language transformed by the optimization processing means 16. A target program 19 is generated.

Next, the operation of the above embodiment will be specifically explained with reference to program examples shown in FIGS. 2 to 7. FIG. 2 is a list showing part of a source program written in the FORTRAN language. Subprograms FUNC and CALC are defined as subroutines, and have a nested structure in which subprogram FUNC calls subprogram CALC.

FIG. 3 shows part of the intermediate language obtained by parsing the subprograms FUNC and CALC in the source program shown in FIG. 2 by the parsing means 10. Here, (1) is the intermediate language corresponding to the definition point of the subprogram FUNC, (2) is the intermediate language that is a candidate for the common subexpression that appears before and after the call of the subprogram, and (3) is the intermediate language of the subprogram CALC. The intermediate language corresponding to the call, (4) is the intermediate language that is a candidate for the common subexpression like (2), and (5) is the subprogram FUN.
The intermediate language that indicates the end of the definition of C, (6) is the intermediate language that corresponds to the definition point of the subprogram CALC, and (7) is (
2) Similarly, the intermediate language that is a candidate for the common subexpression, (8
) is an intermediate language that indicates the end of the definition of subprogram CALC.

FIG. 4 shows these intermediate languages (1) to (8
) is a list showing an example of an intermediate file 18 outputted by the intermediate language output means 12. P is the offset position from the beginning of the intermediate language (1) file that corresponds to the definition point of subprogram FUNC, and Q is the offset position from the beginning of the intermediate language (6) file that corresponds to the definition point of subprogram CALC.
) indicates the offset position from the beginning of the file.

The intermediate language input means 13 sequentially outputs the intermediate language read from the intermediate file 18 created as described above to the optimization processing means 16. When the intermediate language (3) corresponding to the subprogram call is read, the intermediate language (3) is passed to the subprogram definition point checking means 14 in order to call the subprogram.

The sub-program definition point matching means 14 matches this intermediate language (3) with the position information stored in the sub-program definition point position information holding means 11. For example, as shown in FIG.
3, an argument name 24, an offset within the intermediate file 25, etc. Check the table with the intermediate language (3) that calls the subprogram CALC, and execute the subprogram CALC.
The position Q is obtained from the offset 25 in the intermediate file of the intermediate language (6) that defines the LC, and is passed to the argument matching means 15 together with the intermediate language (3).

The argument mapping means 15 is an intermediate file 18
intermediate language (6) at offset Q from the beginning of
The intermediate file 18 is read in, matches the actual arguments shown in the intermediate language (3) with the formal arguments shown in the intermediate language (6), and continues until the intermediate language (8) that completes the definition of the subprogram CALC appears. The intermediate language is sequentially read and the formal arguments are converted into actual arguments and passed to the optimization processing means 16. After passing the intermediate language (8) to the optimization processing means 16, control is returned to the intermediate language input means 13,
The intermediate language that follows intermediate language (3) is intermediate file 18
The intermediate language is read from and processed in the same manner as shown in FIG. 6 to obtain the inline-expanded intermediate language shown in FIG. Intermediate languages (9), (10), and (11) in the figure are inline expansions of intermediate languages (2), (7), and (4), respectively.

The optimization processing means 16 is an intermediate language (2),
The common subexpressions of (4) and (7) are recognized, unnecessary intermediate language is deleted, and an optimized intermediate language as shown in FIG. 7 is generated.

The code generation means 17 generates a target code based on the optimized intermediate language after inline expansion, and outputs it to the target program 19.

Therefore, with the configuration of the embodiment as described above, it is possible to efficiently perform inline expansion of functions and optimization processing at the time of compilation.

[0019]

[Effects of the Invention] As explained above, according to the present invention,
This has the effect of improving the processing speed of the compiler and contributing to increasing the efficiency of program development, and at the same time reducing the size of the target program and improving the execution speed of the program.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention.

[Figure 2] List showing part of the source program

[Figure 3]
List showing some of the intermediate languages

[Figure 4] List showing some intermediate languages

[Fig. 5] Explanatory diagram showing the storage state of subprogram definition point position information

[Figure 6] List showing part of the intermediate language expanded inline

[Figure 7] List showing part of the intermediate language that has undergone optimization processing

[Figure 8] Configuration diagram of a conventional compiler

[Explanation of symbols]

1 Source program 2 Compiler 10 Syntax analysis means 11 Subprogram definition point position information holding means 12
Intermediate language output means 13 Intermediate language input means 14 Subprogram definition point comparison means 15
Argument association means 16 Optimization processing means 17 Code generation means 18 Intermediate file 19 Target program

Claims (1)

[Claims] Claim 1: A compiler that generates a target program from a source program, comprising: a syntax analysis means for analyzing the syntax of the source program and translating it into an intermediate language that is independent of the description language and machine type, and an intermediate language corresponding to the definition points of the subprogram. outputting the intermediate language generated by the subprogram definition point position information holding means for holding language position information and the syntax analysis means to an intermediate file, and when the output intermediate language corresponds to the definition point of the subprogram; , an intermediate language output means for storing the position information of the intermediate language in the subprogram definition point position information holding means; and, if the intermediate language read from the intermediate file is an intermediate language corresponding to the call of the subprogram, the read intermediate language; An intermediate language input means that outputs the intermediate language, and the intermediate language received from the intermediate language input means is checked against the information held by the subprogram definition point position information holding means, and the intermediate language and the position information of the definition point of the subprogram to be called are compared with the information held by the subprogram definition point position information holding means. A subprogram definition point matching means that outputs the language reads the intermediate language corresponding to the definition point of the subprogram obtained based on the position information received from this subprogram definition point matching means, and reads the temporary language shown therein. Argument mapping means for outputting an intermediate language that is mapped with arguments and actual arguments indicated in the intermediate language received from the subprogram definition point matching means; , comprising an optimization processing means for transforming an intermediate language so as to increase execution speed, and a code generation means for generating a target program from a target code based on the intermediate language transformed by the optimization processing means. Optimization processing method.