JPH03273341A - Allocation system for literal optimization - Google Patents

Abstract

PURPOSE:To improve the optimizing efficiency in literal allocation by preparing a literal table equipped with literal tables by allocation boundaries, holding the prepared table and performing the allocation while managing the literal allocation boundary by the allocation boundaries. CONSTITUTION:A literal generation process part 7 generates the literal in a code generation process to a source program 1, and generates before-allocation literal information 13 related to the literal. A literal managing means 9 inputs the information 13, and chains under-allocating literal information 19 with literal contents 15 in the information 15 as the own literal contents to the literal tables 17 by allocation boundaries shown by allocation boundary information 14 of the information 13. A literal allocating means 10 processes the optimized allocation of the literal by using the literal table 16. Thus, the optimized allocation of the literal can be processed over the plural literals and the optimizing efficiency is improved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to literal processing by a compiler for a programming language that can describe literals, and particularly to a literal optimization allocation method for optimizing literal allocation.

[Conventional technology]

Conventionally, in this type of literal optimization allocation method, the allocation addresses of literals are determined in the order in which the literals appear, and literals with the same allocation boundary are not always allocated consecutively.

[Problem to be solved by the invention]

In the conventional literal allocation method described above, literal allocation addresses are determined in the order in which the literals appear, and literals with equal allocation boundaries are not necessarily allocated consecutively, so optimization may be required depending on the order of literal appearance. This has the disadvantage that allocation may not be possible in some cases (optimization efficiency in literal allocation deteriorates).

In view of the above-mentioned points, an object of the present invention is to provide a literal optimization allocation method that manages literal allocation areas for each allocation boundary, allocates literals, and improves optimization efficiency in literal allocation. It's about doing.

``Means for Solving C12M'' The literal optimization allocation method of the present invention is used in a compiler for an electronic meter system that needs to allocate literals in consideration of allocation boundaries. The present invention includes a literal management means for creating and holding a table, and a literal allocation means for managing a literal allocation area on the allocation boundary side and performing optimization allocation processing for literals using the literal table created by the literal management means.

[Effect]

In the literal optimization allocation method of the present invention, the literal management means creates and maintains a literal table consisting of several allocation boundary side literal tables, and the literal allocation means uses the literal table created by the literal management means to It manages the literal allocation area and performs literal optimization allocation processing.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a block diagram illustrating the structure of a compilation nostem that includes an embodiment of the literal optimization printing t:fke method of the present invention. This compilation system includes a source program 1, a compiler 2, a target program 12, pre-allocation literal information 13, a literal table 16, and post-allocation literal information 20.

The compiler 2 includes a lexical analysis processing section 3, a syntax analysis processing section 4, a semantic analysis processing section 5, a code generation processing section 6, and a target program output processing section 1.

The code generation processing section 6 includes a literal generation processing section 7 and a literal allocation processing section 8.

The literal allocation processing unit 8 includes a literal management unit 9 that manually registers the pre-allocation literal information 13 related to the literal generated by the literal generation processing unit 7 in the literal table 16 regarding the pre-allocation literal information 13; It is configured to include a literal allocation means IO that uses the table 16 to determine the optimum allocation address (relative address within the allocation area) of a literal.

The pre-allocation literal information 13 includes allocation boundary information 14 indicating the literal allocation boundary (here, ■byte boundary, 2-byte boundary, 3-byte boundary, or 4-byte boundary).
and literal content 15 indicating the length of the literal and the image of the literal.

The literal table 16 is composed of a plurality of allocation boundary side literal tables I7 (consisting of an allocation boundary side literal table pointer 18 and several pieces of chained literal information 19 during allocation) that exist for each allocation boundary.

The post-allocation literal information 20 is the allocation boundary information 21
, an allocation area relative address 22 which is a literal allocation address, and literal contents 23.

Note that literal management means 9 in FIG. The literal allocation means 10 and the literal table 16 constitute an embodiment of the literal optimization allocation method of the present invention.

FIG. 2 is a diagram showing the structure of the literal table 16 in detail. Each allocation boundary side literal table 17 in the literal table 16 has a boundary side literal table pointer 18 and a next pointer 51 (a pointer for forming a chain of literal information 19 being allocated) within one allocation area. The allocation information 19 has a relative address 52 and a literal content 53, and is configured to include the key of the literal information 19 being allocated.

FIG. 3 is a diagram showing the order in which the literal allocation means 10 searches the allocation boundary side literal table 17 related to different allocation boundaries.

FIG. 4 is a flowchart showing the processing (optimization allocation processing) of the literal allocation means 10. This process includes a step 81 for selecting a literal table by allocation boundary, a step 82 for acquiring information on literals being allocated at the beginning, a step 83 for determining the end of literal tables for each allocation boundary, a step 84 for generating a literal table for comparison, and a step for setting the beginning of a literal comparison position. 85, literal match determination step 86, literal comparison position update step 87, comparison literal end determination step 88, comparison target literal allocation address determination step 89, currently allocated literal information deletion step 90, and next search allocation boundary It consists of another literal table acquisition step 91, next search allocation boundary-specific literal table existence determination step 92, and comparison target literal allocation address determination step 93.

Next, the operation of the compile system including the literal optimization allocation method of this embodiment configured as described above will be explained.

The compiler 2 inputs the source program 1, and the lexical analysis processing unit 3. The syntactic analysis processing section 4 and the semantic analysis processing section 5 check whether the source program 1 is syntactically and semantically correct, and then the code generation processing section 6 is activated.

The code generation processing unit 6 starts the literal generation processing unit 7.

The literal generation processing unit 7 generates a literal (a literal that becomes a comparison target literal) in the code generation process for the source program 1, and generates pre-allocation literal information 13 regarding the literal.

Next, the compiler 2 activates the literal allocation processing section 8.

The literal management means 9 in the literal allocation processing section 8 is
The pre-allocation literal information 13 generated by the literal generation processing unit 7 is input, and the pre-allocation literal information 13 is input to the allocation boundary literal table 17 corresponding to the allocation boundary indicated by the allocation boundary information 14 in the pre-allocation literal information 13. Literal allocation means 1 in the noteral allocation processing unit 8 that chains the literal information 19 being allocated with the literal content 15 in the literal content 53 as the literal content 53.
0 uses the literal table 16 to perform the literal optimization allocation process as shown below (see Figure 4).
.

Allocation boundary information 111 in pre-allocation literal information 13
Step 81) selects the allocation boundary literal table 17 related to the allocation boundary that coincides with the allocation boundary indicated by 4.
(step 82), and determines whether or not the allocation boundary literal table 17 is completed (the allocation boundary literal information 19 to be obtained after the search for one allocation boundary literal table 17 is completed).
Determine (whether or not there is any remaining) (step.

Bu83).

If the literal table 17 by allocation boundary is not completed in this judgment, the literal table 1 by allocation boundary 1 that exceeds the length of the literal to be compared (comparison length)
7 (images of literals in the literal content 53 in each piece of allocated literal information 19) are combined from those in the first allocated literal information 19 to generate a comparison literal (step 84).

The start position (literal comparison position 1) of the character string for the comparison length in the comparison literal to be compared with the comparison target literal is set as the start of the comparison literal (step 85), and the comparison starts from the literal comparison position in the comparison literal. It is determined whether the long character string and the comparison target literal match (step 86).

If the two do not match in this judgment, the literal comparison position is assigned and only the boundary bone is updated (Step 87), and the comparison literal is determined whether the comparison literal ends (the end of the comparison length character string starting from the literal comparison position is compared). (step 88).

If the comparison literal is finished in this determination, control is returned to the determination in step 83.

If it is determined in step 88 that the comparison literal has not been completed, control is returned to step 86.

If the two match in the determination in step 86, the relative address within the allocation area of the literal comparison position is determined as the allocation address of the comparison target literal (step 89), and the relative address related to the comparison target literal registered by the literal management means 9 is determined. The literal information 19 being allocated is deleted (steer knob 90), and the process ends.

If it is determined in step 83 that the allocation boundary side literal table 17 is completed, the allocation boundary side literal table 17 to be searched next is determined according to the search order of the allocation boundary side literal table 17 shown in FIG. 3 (step 91 ), it is determined whether the allocation boundary side literal table 17 to be searched next exists (step 92).
.

If it is determined that there is an allocation boundary literal table 17 to be searched next, control is returned to step 82.

If the allocation boundary side literal table 17 to be searched next does not exist in step 92, the allocation address of the comparison target literal is determined to be the next address of the relative address in the allocation area of the literal after ljk. The relative address within the allocated area 52 in the allocated literal information 19 regarding the comparison target literal is as follows:
setting the allocated address) (step 93),
Finish the process.

The literal allocation processing unit 8 includes the literal allocation means 1
0, the pre-allocation literal information 13 to the post-allocation literal information 20 (the allocation boundary information 21 corresponds to the allocation boundary information 14, and the relative address 22 within the allocation area is determined by the literal allocation means 10. (corresponds to the allocated address, and the literal content 23 corresponds to the literal content 15).

Finally, the compiler 2
, and the target program output processing section 11 outputs the target program 12.

〔Effect of the invention〕

As explained above, the present invention creates and maintains a literal table having an allocation boundary side literal table,
By managing the literal allocation area on the allocation boundary side and allocating literals, you can perform optimized allocation of literals that span multiple literals.
This has the effect of improving optimization efficiency in literal allocation.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of a compilation system including an embodiment of the present invention, FIG. 2 is a diagram showing the detailed configuration of the literal table in FIG. 1, and FIG. 3 is a block diagram showing the configuration of the literal table in FIG. 1. FIG. 4 is a flowchart showing the processing (optimized allocation processing) of the literal allocation means in FIG. 1. In the figure, 1... Source program, 2... Compiler, 3 ・ 4 ・ ・ 6 ・ ・ 7 ・ ・ 8 ・ 9 ・ ・ 10 ・ 1 2 13 ・ 14 ・ l 5 ・ ] 6 ・ l 7 ・ 18・ 19 ・ 20 ・ 2 l ・ 22 ・ ・Lexical analysis processing unit, ・Syntax analysis processing unit, Semantic analysis processing unit, ・Code generation processing unit, Literal generation processing unit, Literal allocation processing unit, ・Literal management means, Literal allocation Means: - Objective program output processing unit; - Objective program, pre-allocation literal information, allocation boundary information, literal contents, literal table, allocation boundary side literal table, literal table pointer, literal information during allocation, post-allocation literal information, Allocation boundary information, relative address within the allocated area, 23...literal content, 51...next pointer, 52...relative address within the allocated area, 53...literal content.

Claims (1)

[Claims] In a compiler for a computer system that requires allocation of literals in consideration of allocation boundaries, a literal management means for creating and maintaining a literal table consisting of several allocation boundary-specific literal tables; 1. A method for optimizing literal allocation, comprising: literal allocation means for managing literal allocation areas for each allocation boundary using a literal table created by the means, and performing optimization allocation processing for literals.