JPH06282444A - Compilation method - Google Patents

Abstract

PURPOSE:To generate an object program consisting of machine languages suitable to the type of a computer by making a compiler itself measures the machine language performance of the computer of the type and selecting the machine languages suitable to the computer on the basis of the measurement result. CONSTITUTION:An environment setting process 102 consists of an installation process 103 for installation in a compiler body 105 and a performance measurement process 104 which measures the processing speeds of the machine languages of two VM and LD-ST instructions and judges which is faster. Then the compiler measures the performance of machine languages on the computer which actually performs compilation by itself before translation by the compiler 101 starts and refers to the result at the time of object program generation to select the machine languages having the best performance. Consequently, even if a computer of the same architecture differs in the performance of machine languages with the type and has no means for deciding the types, the best machine languages for the computer of the type can be employed for the object program.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a compiling method for compiling a high level language in a personal computer, a workstation and a general purpose computer.

[0002]

2. Description of the Related Art When creating a high-level language compiler such as COBOL or FORTRAN, if there are multiple machine languages or a sequence of machine languages to obtain the same result on the target computer,
It is common practice to examine the machine language performance of the computer and select the machine language or sequence of machine words that will result in the fastest execution of the target program.

For example, when an instruction to transfer 4-byte data between memories is realized in a machine language in a target program, a target computer has the following two methods.

1. A machine language (this is called an MV instruction) that is directly transferred between memories is used. 2. After the machine language for storing the data in the memory in the register (this is the LD instruction) is executed, the machine language for storing the data in the memory from the register (this is the ST instruction) is executed.

When creating a compiler, it is a general method to check the above performance from the hardware design specifications and adopt the faster one for the target program.

In a general-purpose computer, a computer having the same architecture has realized a small size to an ultra-large size. If a compiler common to all computers can be created, the development efficiency of the compiler can be improved.

However, even if computers having the same architecture and the same machine language specifications have different uses,
If the goal of CPU design is different, in the above example, even if the MV instruction is faster on one type of computer, the combination of LD and ST instructions is faster on another type of computer. The machine language to be adopted in the program may vary depending on the model.

As a measure in this case, conventionally, there is a method of knowing a model of a computer which operates by some method at the time of compiling and adopting a machine language having a better performance in generating an object program according to the type.

[0009]

However, if there is no way to know the model of the computer, or if the computer manufacturer does not disclose it, the above measures cannot be implemented by the compiler. One must be fixedly adopted. Therefore, even if the target program is designed in consideration of the performance of a specific type of machine language when creating the compiler,
Other types have had the problem that they do not always give optimum results.

Further, even when a new type of computer is developed, if the performance of the machine language changes, the optimum result will not be obtained.

An object of the present invention is to provide a compiling method capable of creating a target program composed of a machine language most suitable for a computer of that type without knowing the performance of the machine language in advance.

[0012]

SUMMARY OF THE INVENTION In order to achieve the above object, the present invention measures the machine language performance of a computer of the format at the time of embedding the compiler or at the start of translation, and Based on the above, the optimum machine language for the computer of the format is selected.

[0013]

According to the above means, the performance of the machine language of the computer that actually compiles is measured by the compiler itself before the translation of the compiler is started, and the result is referenced when the target program is generated, and the best performance is obtained. Select a machine language.

As a result, even in a computer having the same architecture, even if the performance of the machine language differs depending on the model and there is no means for discriminating the format, the machine language most suitable for the computer of the model can be adopted as the target program.

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in detail below with reference to illustrated embodiments.

In order to simplify the explanation, the following conditions are set here.

1. A high-level language instruction to be optimized is transferred between 4-byte memories. 2. Above 1. To realize, there are the following two machine languages.

(1) Direct transfer between memories is performed by an MV instruction (hereinafter referred to as MV instruction processing). (2) Once stored in the register by the LD instruction and stored in the memory by the ST instruction (hereinafter, LD-ST
Command processing).

FIG. 1 is a diagram showing a configuration of an embodiment of a compiler for implementing the present invention. The compiler 101 provided to the user has a compiler main body 105 and a compiler main body 105 for incorporating the compiler main body 105 into a computer system. An environment setting process 102 for setting an environment.

The environment setting process 102 further measures an embedding process 103 for incorporating the compiler main body 105 and a machine language processing speed of the above two MV instructions and LD-ST instructions, and determines which is faster. It comprises a measurement process 104.

Next, the flow of processing when the compiler 101 is incorporated will be described with reference to the flowchart of FIG.

The user first sets the environment for incorporating the compiler 101 into his computer system (step 202).

Then, the performance measuring process 104 at the time of incorporation
To measure the performance of MV instruction processing (step 203)
And the performance of LD-ST instruction processing is measured (step 20
4) Then, which is faster is stored in the storage disk 207 (step 205).

In the performance measurement of the performance measurement processing 104, a general-purpose computer uses a function capable of measuring the CPU time by the hardware and operating system, and the transfer instruction of the high-level language to be compiled is processed by the MV instruction. The machine language and the LD-ST instruction processed machine language are separately looped a predetermined number of times to measure each time.

As described above, the incorporation of the compiler 101 is completed. The operation when the user starts the compiler 101 and translates the source program into the target program is shown in the flowchart of FIG.

First, when the generation of the machine language is started (step 301), the performance measurement result of the machine language is input from the disk 207 in which the result of the performance measurement processing is stored (step 302).

Next, it is checked whether the instruction to be compiled is a transfer instruction (step 303). If it is not a transfer instruction, another generation process is performed (step 308). If it is a transfer instruction, it is determined to be an MV instruction. It is judged which performance of the LD-ST instruction is better (step 304), and LD-ST
If the performance of the instruction is judged to be good, the LD-ST instruction is generated as the machine language of the target program (step 3
On the contrary, if it is determined that the performance of the MV instruction is good, the MV instruction is generated as the machine language of the target program (step 306).

When all the instructions have been compiled, the process ends (step 307).

It is not always necessary to measure the performance of the machine language at the time of incorporating the compiler, but the performance may be measured at the time of starting the compiler so that the result can be referred to when the machine language is generated.

That is, in the case of transfer between memories, the performance measurement result is input from the storage disk 207, and in step 304 the MV instruction and L are used as the machine language of the target program.
By incorporating in the compiler a performance measurement process that determines which combination of D and ST instructions is adopted,
Even if you do not know the model of the computer used by the user,
The optimum machine language for the model can be adopted in the target program.

Although the transfer instruction between memories has been described in this embodiment, the present invention is not limited to this. For example, comparison with addition / subtraction / multiplication / division of binary numbers, that is, calculation between register memories, There are two types of operations between registers after the contents of the memory are once transferred to the registers. Another example is shift of register contents, such as algebraic shift and logical shift. Further, there are operations such as operations for packed data, so-called operations for so-called packed data and operations after once converted into binary numbers.

[0032]

As described above, according to the present invention, the compiler itself measures the machine language performance of the computer of the relevant model at the time of incorporating the compiler or at the start of translation, and the computer of the relevant model is determined based on the measurement result. Since the optimum machine language is selected, if the performance of the machine language changes depending on the model of the computer, even if there is no means to know the model, it is possible to create a target program composed of the optimum machine language for the computer of that model. The effect is obtained.

[Brief description of drawings]

FIG. 1 is a configuration diagram showing an embodiment of a compiler to which the present invention is applied.

FIG. 2 is a flowchart showing processing when a compiler is installed.

FIG. 3 is a flowchart showing a target program generation process of a compiler.

[Explanation of symbols]

101 ... Compiler, 102 ... Environment setting processing, 103 ...
Compiler built-in processing, 104 ... Performance measurement processing.

Claims (1)

[Claims] 1. A compiling method for translating a source program into a machine language by a compiler that operates in common on computers of the same architecture that differ in machine language performance depending on the model, wherein the compiler is installed or started to be translated. A compiling method, characterized in that the compiler itself measures the machine language performance of a computer of the relevant type and selects the optimum machine language for the computer of the relevant type based on the measurement result.