JPH06214803A - Virtual space block arranging system - Google Patents

Abstract

PURPOSE:To arrange blocks in accordance with procedure/function/table for which high frequency in use are forecasted on a specific page on virtual space comperhensively and to suppress the number of times of execution of paging processing when a program provided with such procedure/function/table is executed. CONSTITUTION:A compiler 1 adds the identification information of the blocks with high frequency in use in accordance with the procedure/function/table in a source unit that is the target of high frequency use designation 4 and that of ordinary blocks in accordance with the procedure/function/table that is not the target of the high frequency use designation 4 on an object module 5. A linker 2 accumulates the blocks with high frequency use and the ordinary blocks individually based on such identification information, and arranges all the high frequency use blocks on the virtual space based on such accumulation.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a compile process for generating an object module and a link process for connecting and editing a plurality of object modules to generate an executable load module in a computer system, and more particularly to virtual storage by demand paging. The present invention relates to a virtual space block allocation method involved in compilation processing and link processing in a computer system having functions.

[0002]

2. Description of the Related Art In a computer system having a virtual memory function by demand paging, a machine language image showing a procedure / function / table in a source unit related to a program (procedure or function An initial value block (hereinafter simply referred to as a block) having a machine language instruction string shown or a machine language data string showing a table (including a region having no initial value) is arranged in the virtual space.

In order to realize demand paging,
As described above, the block group arranged in the virtual space is divided into pages having a specific size from the beginning of the virtual space, and the machine language image of the block arranged (allocated) to each page is the page image of the page. (Page contents) are stored in the file (each page image is stored in the file in a form that can be referenced in page units).

In addition to this, a table (page table) for associating each page with the page image on the file is generated, and the program is ready for execution.

Arrangement of blocks in the virtual space, generation of page images (arrangement of each block on a page and storage of a page image in a file), and generation of a page table as described above are performed by a loader at the time of execution. In addition to the above, it is also performed by the linker during the link process of inputting the object module and generating the load module. The present invention relates to the arrangement of blocks in a virtual space by such a linker.

In the conventional technique (conventional virtual space block arranging method), when arranging blocks corresponding to procedures / functions / tables in the virtual space, the arrangement order is not particularly considered. (In general, the block corresponding to the procedure / function / table is arranged in the order of inputting the procedure / function / table).

[0007]

In a computer system having a virtual memory function by demand paging, when a program needs to execute a certain page (the "time when a certain page is needed" means that The page does not exist in real memory when the machine language instruction that refers to the address included in the page is executed (including the time when the machine language instruction on that page is executed) The page image of the page is read from the file into the real memory (paging processing is performed), and the page is referenced after the reading (note that the page that requires execution of the machine language instruction is the actual page). Paused until loaded in memory).

In such a paging process, when there is no area in the real memory in which the page image can be read, the area of the page that has already been read in the real memory is released. The vacant area is used as an area for paging processing. In such a case, there are many algorithms for selecting a read page in the real memory to be released, but in general, an algorithm of "selecting a page with the least recent reference frequency" (LRU (Least Recently Used)) is used.
Algorithm) is adopted.

As described above, in paging processing, I / O (Input / Output) for files is performed.
t) Processing occurs. Generally, I / O for files
Execution of a process takes a very large amount of time as compared with execution of an instruction. Therefore, the more paging processing, the longer the time required to execute the program. That is, the execution performance of the program is reduced.

By the way, the more references to a page, the more likely it is that the page will reside in real memory. Therefore, pages containing blocks corresponding to frequently used procedures / functions / tables will be stored in real memory. The chances of being resident will increase.

Therefore, when there are a plurality of blocks corresponding to frequently used procedures / functions / tables and they are arranged on different pages, the number of pages that are likely to be resident in the real memory increases. . As the number of pages that are likely to reside in real memory increases, such pages consume real memory space, resulting in pages containing blocks corresponding to relatively infrequently used procedures / functions / tables. The paging process for will frequently occur.

In the above-described conventional virtual space image arrangement method, since the arrangement order is not particularly considered when arranging each block (block corresponding to a procedure / function / table) in the virtual space, the frequency of use There is a possibility that a large number of pages including blocks corresponding to procedures / functions / tables with a high number of pages exist, in which case the paging process may occur frequently due to the reasons described above, and the program execution performance may be reduced. There is a problem that it may cause a decrease.

As a technique for improving the efficiency of paging processing in a computer system having a virtual memory function (a concept of collectively loading a plurality of related pages by one paging processing, etc.), see Japanese Patent Laid-Open No. 2-199.
44 (page-in method of virtual memory management) "and" JP-A-1-150936 (program execution method) ". However, even in those methods, the above-mentioned problems have not been taken into consideration.

In view of the above points, an object of the present invention is to make it possible to collectively arrange blocks corresponding to procedures / functions / tables that are expected to be frequently used in a specific page in the virtual space, It is an object of the present invention to provide a virtual space block arrangement method capable of suppressing the number of paging processes when a program having such procedures / functions / tables is executed.

[0015]

According to the virtual space block arranging method of the present invention, a block having a machine language image showing a procedure / function / table in a source unit is output to an object module and is frequently output. Identification of high-frequency blocks that are blocks corresponding to procedures / functions / tables for which usage is specified and normal blocks that are blocks corresponding to procedures / functions / tables that are not specified for high-frequency usage A compiler that adds information to an object module, and a compiler that inputs the object module generated by the compiler into the object module by the compiler based on the identification information added to the object module by the compiler when generating the load module. Output high And a linker which all high-used blocks sequentially placed in the virtual space based on the respective degrees using blocks and normally blocks separately accumulate the accumulated.

[0016]

The present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of an embodiment of a virtual space block arrangement system of the present invention. According to the virtual space block arrangement method of this embodiment, the source unit 3 and the high-frequency use designation 4 are input and the object module 5 is input.
And a linker 2 that inputs a plurality of object modules 5 and outputs a load module 6
, A source unit 3, a high-frequency use designation 4, an object module 5, and a load module 6.

The linker 2 includes an object module input means 21, a link means 22, and a virtual space arranging means 23.
And a load module generation means 24.

The high-frequency use designation 4 is information in which the names of the procedures / functions / tables that the user or the like has determined to be particularly frequently used among the procedures / functions / tables included in the source unit 3 are designated. is there.

FIG. 2 is a flow chart showing the processing of the virtual space arranging means 23. This processing is performed by the placement target block remaining determination step 201, the placement target block high frequency use block determination step 202, the normal block chain connection step 203, the high frequency use block chain connection step 204, and the high frequency use block placement step 20.
5 and a normal block placement step 206.

Next, the operation of the virtual space block arranging system of the present embodiment thus constructed will be described.

The compiler 1 inputs the source unit 3 and the high-frequency use designation 4 corresponding to the source unit 3,
Output the object module 5. That is, a block having a machine language image showing each procedure / function / table in the source unit 3 together with other various information (additional information such as the name of each procedure / function / table) (as described above). The block corresponding to the initial value block) is output to the object module 5.

At this time, the compiler 1 selects blocks corresponding to procedures / functions / tables whose names are specified by the high-frequency usage specification 4 and procedures / functions / tables whose names are not specified by the high-frequency usage specification 4. It is output in the object module 5 separately from the block corresponding to the table.
That is, a block (high-frequency use block) corresponding to a procedure / function / table that is the target of the high-frequency use specification 4 and a block (high-frequency use block) corresponding to a procedure / function / table that is not the target of the high-frequency use specification 4 ( (Normal block)
And the identification information (for example, the information of “high frequency use” given to the high frequency use block as one of the attribute information of the high frequency use block) is added to the object module 5.

The linker 2 inputs a plurality of object modules 5, generates a load module 6 in an executable format, and outputs the load module 6.

The object module input means 21 in the linker 2 inputs the object module 5 and expands the information necessary for the processing of the linker 2 in the work area. Also,
The linking means 22 resolves / processes definition / reference information among a plurality of object modules 5. The processing by the object module input means 21 and the link means 22 is the same as the processing in the prior art.

The virtual space arranging means 23 arranges each block in the object module 5 in the virtual space and, as a result, generates a page image and a page table (each block after the arrangement of each block in the virtual space). Are placed on the page, the page image is stored in the file based on the placement, and the page table is generated in the same manner as in the prior art).

The detailed processing of the virtual space arranging means 23 will be described below with reference to FIG. Here, "high-frequency block chain" means a chain that connects only high-frequency blocks, "normal block chain"
Is a chain that connects other blocks (normal blocks). These chains are used to arrange all of the frequently used blocks consecutively in the virtual space as described later, but it is possible to store the frequently used blocks and the ordinary blocks separately by some method. The method is not limited to the “method using the chain”, and the present invention can be realized by the “method using the table” or the like (according to the “method using the chain”, the above-described storage processing, etc.) Is preferable compared to other methods because it requires less area).

It is judged whether or not there are any blocks left to be placed in the virtual space (whether or not all the blocks to be placed have been processed) (step 20).
1).

When it is determined in step 201 that "the block to be arranged remains", one of the remaining blocks to be arranged is extracted and added by the compiler 1 as described above. It is determined whether the block is a frequently used block based on the identification information (step 202).

If it is determined in step 202 that the block is a frequently used block, the block is linked to the frequently used block chain (step 2
04), and returns to the determination in step 201.

When it is determined in step 202 that the block is not a frequently used block, the block is connected to the normal block chain (step 20).
3) Return to the determination of step 201.

When it is determined in step 201 that "there are no blocks to be placed", all blocks (high-frequency blocks) connected to the high-frequency block chain are continuously arranged in the virtual space. Arrangement is performed continuously from an arbitrary page boundary (generally, the head of the virtual space) (step 205). In addition, at the time when it is determined that "the block to be arranged does not remain", accumulation of all the blocks to be arranged (connection to the frequently used block chain or the normal block chain) is completed,
All the frequently used blocks scattered in the object module 5 are collected and connected to the frequently used block chain.

When the processing of step 205 is completed, the blocks (normal blocks) connected to the normal block chain are arranged in the virtual space (arrangement in the area excluding the arrangement area in step 205) (step 20).
6), the series of processing shown in FIG.

By the processing by the virtual space arranging means 23 as described above, the frequently used blocks are collected and arranged in a continuous area in the virtual space (generally, a continuous area from the beginning in the virtual space). To be done. This makes it possible to reduce the number of pages including the frequently used block as much as possible.

Finally, the load module generating means 24
Generates the load module 6 reflecting the block arrangement in the virtual space by the virtual space arranging means 23, and outputs the load module 6. This completes the processing of the linker 2.

In the prior art, even if the concept of linking blocks into a chain is introduced, the above-mentioned frequently used block chain and the ordinary block chain are not distinguished from each other. Was only. Then, the placement position of each block connected to the chain in the virtual space was generally determined by the input order of each block (no significant operation was performed on the placement position in the virtual space). . On the other hand, in the virtual space block arranging method of the present exemplary embodiment, since the virtual space arranging means 23 has the above-described functions, many blocks corresponding to frequently used procedures / functions / tables are provided. It becomes possible to avoid the situation that the pages are scattered and exist.

[0037]

As described above, according to the present invention, blocks corresponding to procedures / functions / tables that are expected to be frequently used are collectively (continuously) arranged on a specific page in the virtual space. By doing such a procedure /
It is possible to reduce the number of times of paging processing at the time of executing a program having a function / table, and reduce the time required to execute the program (improve the execution performance of the program). effective.

[Brief description of drawings]

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

FIG. 2 is a flow chart showing processing of a virtual space arranging means in FIG.

[Explanation of Codes] 1 Compiler 2 Linker 3 Source Unit 4 High Frequency Usage Specification 5 Object Module 6 Load Module 21 Object Module Input Means 22 Link Means 23 Virtual Space Arrangement Means 24 Load Module Generation Means

Claims (2)

[Claims] 1. A procedure / function / table for which a block having a machine language image indicating a procedure / function / table in a source unit is output to an object module and which is designated for high-frequency use at the time of output. A compiler that adds identification information between a high-frequency use block corresponding to a block and a normal block that corresponds to a procedure / function / table not subject to high-frequency use specification to an object module, and Each of the frequently used block and the normal block output in the object module by the compiler based on the identification information added to the object module by the compiler when the generated object module is input to generate the load module Separate Accumulating and virtual space block disposed scheme characterized by having a linker of all high-used blocks sequentially placed in the virtual space based on the accumulated. 2. A process for separately accumulating each of a high frequency use block and a normal block using a high frequency use block chain connecting high frequency use blocks and a normal block chain connecting normal blocks. The virtual space block arrangement method according to claim 1, further comprising a linker.