JPH0675757A - Virtual space resident program link method - Google Patents

Abstract

(57) [Abstract] [Purpose] When linking a program that resides in virtual memory, the purpose is to link with a small number of dynamic steps that are the same for each program in a standard method. [Structure] An address list of programs resident in virtual memory and a program name list having the same format as the address list. The program name list is included in the compile-time program and used as the address definition of the linked program.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a program linking method, and in particular, there are many programs resident in a virtual space on a computer system, each of which has a structure of linking with each other.
Or, because the program attributes are different, it is not possible to bind as one execution form, but to improve performance, the number of dynamic steps of linking is reduced, and it relates to the linking method of a virtual space resident program that links all programs at the same step. .

[0002]

2. Description of the Related Art As a method for linking a plurality of programs, a method of loading a target program from an external storage device and linking it as necessary, and a method of loading a target program in a virtual space in advance It is roughly divided into the methods to refer to.

To improve the performance of the former, reducing the number of I / Os is an important technique.

For example, in the batch loading processing method disclosed in Japanese Patent Laid-Open No. 2-60011, there is disclosed a technique for reducing the number of I / Os for module loading to one. That is, in this method, the position and size of the module text group to be loaded and the relocation data group related to the module in the direct access device are held in the directory, and after reading the directory, a CCW chain is created according to the directory information, I / times
This is a method of loading modules with O.

On the other hand, the latter is a technique often adopted to eliminate the I / O overhead. For example, there is a method in which a reusable program is made to reside in a virtual space, its address is set in a predetermined area, and the program is linked. The concrete method is to decide the table to set the address in advance, define the linked program in the program when compiling the link side program, determine the address, and use the name of the linked program at linking. It is for reference. This makes it possible to link with a small number of dynamic steps without input from an external device.

[0006] Further, for the purpose of linking at high speed,
As a module link system, JP-A-61-160135
There is a technique described in Japanese Patent Publication. In this system, the module management table manages the load status of modules. When a program requests to link a module,
The loader refers to the module management table, and returns the address of the loaded module when the module is already loaded, and the post-loading address when the module is not loaded. However, this method is used when the module is not always loaded in advance. In the case of limiting to a pre-loaded program, the above-mentioned method is generally used in which the address of the loaded program is set in a table, and a linked program is defined and linked as needed in the program.

[0007]

As described in the prior art, the method of referring to and linking the address of the resident program is effective in reducing the dynamic steps, but has the following problems. That is, when there are many resident programs and many programs are linked with each other, it is necessary for the link side to define all linked programs and determine the addresses. When the relation between linked and linked is complicated, the procedure in the program becomes complicated and productivity and maintainability deteriorate. Therefore, a standard and simple method that can perform standard definition in a program and call with few dynamic steps is effective from the viewpoint of program productivity, maintainability, and performance. An object of the present invention is to provide a fixed and simple link method for a virtual space resident program in order to improve the above points.

[0008]

In order to solve the above-mentioned problems, in the present invention, when there are a plurality of programs resident in the virtual space, the setting areas of the respective addresses are collected and made into a list format. This list is called an address list. Next, define a list that has exactly the same format as the address list. In this list, the names of the corresponding resident programs are defined at positions corresponding to the address areas of the programs in the address list. This list is called a program name list.

A compile-time program name list is loaded in each program. As a result, the address of the linked program is fixed. When linking with a program, specify the name of the corresponding program in the link command. This enables linking in a dynamic step that refers to the address list. Also, the link step of any program is the same.

In other words, it is not necessary to individually define the address of the link program in each program, and it becomes possible to make a standard and simple description.

[0011]

[Operation] Use the provided macro. When the program that has imported the program name list specifies the name of the linked program and uses this macro, the compiler
Generate an instruction based on the address list. The contents of the instruction are as follows.

The base of the address list is set, the relative address in the program name list of the name definition area of the linked program is added to it, and a branch is made.

Since the relative address in the program name list of the name definition area of the linked program and the relative address of the address setting area of the corresponding linked program in the address list are the same, the result added to the base of the address list Is the address of the address setting area of the specified linked program in the address list. Therefore,
If you branch based on that value, you can link to the target program.

From the above, the effects are as follows.

Since it is sufficient to describe the definition of the program name list and the link macro designating the name of the linked program in the program, it is possible to standardize and simplify the link designation. Also, the steps required for linking are several steps, and further, regardless of the linked program,
Since it is constant, it is effective in improving performance independent of the program.

[0016]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be specifically described with reference to the drawings.

FIG. 1 shows the system configuration. An address list and a virtual space resident program exist in the storage device.

FIG. 2 shows the relationship between the address list 5 for setting the program addresses and the program name list 1 having the same format and the same size as the address list 5.
Both have the same format, but the setting information is different. That is, the address of the program resident in the virtual space is set in the program address setting area 6 in the address list 5. On the other hand, in the program name area 7 at the same position in the program name list 1, the name of the target program set in the program address setting area 6 is defined. Therefore, the order of programs for setting addresses in the address list 5 and the order of programs for defining the program name list 1 are the same. The relative address of each area is the same. In this example, the program B has an address and a name set second in both lists.

FIG. 3 shows the reference relationship between both lists during compilation and actual link processing. The program 8 for linking the program B is composed of a data definition section 81 and a program execution section 82, and the data definition section 81 fetches the program name list 1. In the program execution unit 82, the program B is linked by the link macro instruction @ LINK83. Link macro instruction statement @ LINK83 with name B specified
4, the instructions shown in the in-program processing flow at the time of compiling and linking of the virtual space resident program B are generated as shown in FIG. In this example, since the name of the program B is defined second in the program name list 1 as shown in FIG. 3, it is determined that the address of B is in the second area in the address list 5. An instruction is generated at.

When program 8 is executed and program B is linked, the relative address of the second area of program name list 1 is added to the address of address list 5 (= the relative address of the area storing the address of program B of the address list). ) Is added, the address of the program B is obtained, and the program B can be linked.

The dynamic steps of linking are several steps as shown in FIG. 4, and since all programs only change the position in the program name list 1, the number of linking steps generated during compilation is the same.

[0022]

【The invention's effect】

(1) Simplification When linking multiple programs, it was necessary to define the address of each program. On the contrary, in this method, if the program name list is defined, individual definition becomes unnecessary, and it is only necessary to specify the linked program name in the link macro.

(2) Improvement of performance Although the performance is improved in that there is no input from the external storage device, it is possible to link any program in several steps and in the same step.

[Brief description of drawings]

FIG. 1 is a system configuration diagram.

FIG. 2 is a diagram showing an address list and a program name list.

FIG. 3 is a diagram showing an example of compiling and program linking.

FIG. 4 is a flowchart showing a flow of processing of program link.

[Explanation of symbols]

1 ... Program name list, 2 ... Program A name, 3 ... Program B name, 4 ... Program C name, 5 ... Address list, 6 ... Program address setting area, 7 ... Program name area, 8 ... Program B 81 ... a data definition part of the program 8, 82 ... a program execution part of the program 8, 83 ... an @LINK macro instruction for linking the program B.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Toshikazu Igarashi 6-81 Onoue-cho, Naka-ku, Yokohama-shi, Kanagawa, Hitachi Software Engineering Co., Ltd. (72) Inventor Takahiro Shiotani 5030 Totsuka-cho, Totsuka-ku, Yokohama-shi, Kanagawa Bunch Co., Ltd.Hitachi Ltd. Software Development Division

Claims (1)

[Claims] 1. An address of a program to be linked is fixed at the time of compilation by a set of an address list consisting of a list of attributes and addresses of a program resident in a virtual space and a program name list having the same format as the address list. , Linking method of resident program in virtual space characterized by linking with a small number of dynamic steps and the same dynamic step for each program.