JPS63181032A - Module reading and processing system - Google Patents

Abstract

PURPOSE:To perform the pre-reading of required directory information and to perform a processing at high speed, by providing a dynamic link table in a program, and performing the pre-reading of only directory information in all of the direct line modules registered in the table comprehensively. CONSTITUTION:When the read request of the module A is issued from the program alpha 1, a program managing supervisor 2 reads out corresponding directory information (a) in the directory part 3-1 of a load module library 3. And the supervisor reads out the load module A corresponding to the information (a) out of a text part 3-2, and loads the program A4 as shown in right upper end in figure. Next, the program managing supervisor 2 reads out the direct line program names B-D registered in advance in the dynamic link table 4-1 provided in a loaded program A4, and performs the pre-reading of the directory information (b-d) corresponding to the program names B-D from the directory part 3-1 comprehensively. In such a way, it is possible to suppress an area where the directory information is stored at a minimum size, and to perform the processing at high speed.

Description

[Detailed Description of the Invention] [Summary] The present invention provides a module loading processing method in which directory information of a module is read and a corresponding program is loaded and processed. In order to solve the unnecessary preloading of directory information that occurs in the program, a dynamic link table is created in the program and only the directory information of all directly related modules registered in this table is preloaded at once. Only necessary directory information is read in advance to speed up processing.

[Industrial application field]

The present invention relates to a module loading processing method in which a dynamic link table is provided in a program, and only the directory information of modules registered in the table is read in advance, and the corresponding module is loaded. It is.

[Conventional technology]

Conventionally, the methods for loading load modules have been to read the directory information each time and load the corresponding load module, and to read the directory information all at once and load the corresponding directory information. Some load modules. A brief explanation will be given below using FIG. 4.

FIG. 4(A) shows that Process Day to Process N is called to execute Process A, and Process P to Process Z are called to execute Process 0. are related processes, such as pre-processing and post-processing.

Figure 4 (B) shows the case where directory information is not preloaded. In this case, it is necessary to read the directory information each time and load the corresponding load module. In the figure, +al or nl is the directory. Reading of information, A to N represent reading of text (program). In this case, as shown in the figure, reading the directory information [al or nl, that is, a total of 1
It must be read four times.

FIG. 4(c) shows a case where directory information of all modules is read in advance. In this case, for example, in process A, even unnecessary items are read in advance.

[Problem that the invention seeks to solve]

As shown in Figure 4 (B) above, if the directory information was read each time and the corresponding load module was loaded, directory information processing would be required a total of 14 times, making it difficult to perform high-speed processing. There was a problem.

In addition, as shown in FIG. 4(c) for the purpose of high-speed processing, there is a method of pre-reading the member directory information i1 to 21 all at once and making it resident in the virtual memory. In this case, since directory information of unnecessary members for purposes other than processing is also read, the storage area becomes large, and unnecessary items also need to be searched, making it difficult to perform high-speed processing. Ta.

Furthermore, it is conceivable to select which members' directory information is required at the design stage so that only the deflationary information of members necessary for processing is preloaded in advance, but it is possible to select which members' directory information is required at the design stage. There was a problem in that corrections were required each time there was a change in the information, which required extremely complicated handling.

Means for Solving Problem c] In order to solve the above-mentioned problem, the present invention provides a dynamic link table 4-- which is provided in a program to store names of direct programs to be called during execution of the program. 1 and a program management supervisor 2 that pre-reads the directory information of modules corresponding to the direct program name read from the dynamic link table 4-1 all at once. Based on this, the appropriate program is loaded as necessary.

FIG. 1 shows a basic configuration diagram of the present invention. Program α in the diagram
1 is a program that is actually running, and module A (
This is to issue a request to read program A).

The program management supervisor 2 reads directory information and reads load modules corresponding to this directory information.

The load module library 3 has a directory section 3-
1 and a text section 3-2, each of which stores directory information and a load module.

Program A4 is called from program α1. A dynamic link table 4-1 is provided in this program A4.

The dynamic link table 4-1 stores names of direct programs read by the program A4, such as B, C1, and D.

[Effect] Next, the operation will be explained.

In FIG. 1, when a request to read module A is issued from program αl, program management supervisor 2 issues directory information 915te corresponding to 8 in directory section 3-1 of load module library 3.
1 is read out, the corresponding load module A is read out from the text section 3-2, and the program A4 is loaded as shown in the upper right corner of the figure. Next, the program management supervisor 2 executes this loaded program A4.
Directly related program names B, C, and D registered in advance in the dynamic link table 4-1 provided inside are read out, and the corresponding directory information (bl, (C1, and fdl) is stored in the directory section 3-1. Preloading is performed all at once from 1. When a request to read a load module corresponding to the previously read directory information is issued, the corresponding load module is read and loaded.

As mentioned above, dynamic link table 4-
1 and pre-read only the directory information registered therein, there is no need for the processing program to read the directory information, and the area for storing the directory information is minimized.
It becomes possible to perform processing at high speed.

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be explained in detail using FIGS. 2 and 3.

In FIG. 2, 0 indicates a state in which a program read request is issued. This is the program α1 in Figure 1.
means to issue a read request for program A to program management supervisor 2 (first
(■ in the figure).

In the figure, @ indicates a state in which it is determined whether there is pre-read directory information. In the case of YES, the steps below [phase] in the diagram are executed. In the case of NO, the following steps in the figure are executed.

O in the figure indicates a state in which directory information is read. This includes, for example, directory information (
This means reading out al (■ in Fig. 1).

■ in the figure indicates a state in which the program is read. This means that the load module A corresponding to the directory information fat is read out from the text section 3-2 and loaded (■ in FIG. 1).

■ in the figure indicates a state in which the directory information of the program read from the dynamic link table 4-1 is pre-loaded all at once. This is registered in advance in the dynamic link table 4-1 in the program A4. Program name B, C,
and directory information corresponding to D (bl, tel,
This means that only dl is read in advance from the directory section 3-1 (■ and ■ in Figure 1).
).

When the above procedure is applied to the process A shown in FIG. 4(A), an example of the directory information pre-read at this time is shown in FIG. 3. To be more specific, first, directory information (a) (first time) and the corresponding program A are loaded, and directory information 1 (b) registered in the dynamic link table 4-1 of program A is loaded.
l, (C1, and fdl) are preloaded all at once (second time).Secondly, when program B is loaded, the directory information registered in the dynamic link table 4-1 of program B is (el, ([1, , and directory information (1), (b), (nl) are pre-read all at once. (Fourth and fifth times) In this way, the directory information is read by pre-reading a total of five times.

〔Effect of the invention〕

As explained above, according to the present invention, a dynamic link table is provided in the current processing program, and only the directory information of modules registered in the table is preloaded in advance. By preloading only the directory information of direct programs necessary for the current process, the storage area can be minimized and processing can be performed at high speed.

゛ In addition, since a dynamic link table is provided and only the directory information registered in advance that is directly necessary for the current process is read at once, there is no need to pre-read directory information in the processing program. Furthermore, the 110 times required to obtain directory information can be reduced to the necessary minimum.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the principle configuration of the present invention, FIG. 2 is a flowchart explaining the operation of the present invention, FIG. 3 is a diagram explaining pre-reading of directory information according to the present invention, and FIG. 4 is a diagram explaining the concept of the conventional system. In the figure, 1.4 represents a program, 2 a program management supervisor, 3 a load module library, 3-1 a directory section, 3-2 a text section, and 4-1 a dynamic link table.

Claims (1)

[Claims] In a module loading processing method configured to pre-read module directory information and load the corresponding program for processing, there is provided a method for storing the name of a direct program to be called during execution of the program. Program management that preloads the dynamic link table (4-1) provided in the program and the directory information of the module corresponding to the direct program name read from this dynamic link table (4-1). A module loading processing method comprising a supervisor (2) and configured to load a corresponding program and execute processing as necessary based on directory information of a directly-related module that has been previously loaded.