JPS63106047A - Dynamic subroutine call system - Google Patents

Abstract

PURPOSE:To enable a subroutine whose name to be called changes in executing to be called, by generating an information table regarding the entry name and the entry point of the subroutine having possibility to be called in executing, at time of linking, and perform the call of the subroutine by retrieving the table and obtaining the information of the entry point at time of calling the subroutine. CONSTITUTION:A linking means 1 inputs and links an object module including its entry by designating clearly a required entry name at time of linking, and generates an entry name table having the information of a designated entry name and the entry point corresponding to the entry name in a generated load module. A dynamic subroutine call means 22 retrieves the entry name table generated by the linking means 1 at time of linking, at time of calling the subroutine, and obtains the information of the required entry point, and calls the subroutine according to the information. In such way, it is possible to call the subroutine whose name to be called changes under an executing environment not being provided with a dynamic linking function.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a subroutine calling method in a program for a total zero machine system.

[Conventional technology]

In a counting machine system, if there is a possibility that a large number of subroutines will be called during program execution, it is usually necessary to prepare a sequence of instructions for calling all possible subroutines within the program. , the program area occupied by a sequence of instructions for calling subroutines that are not called during actual execution becomes a completely wasted area. For this reason, if there is a large number of subroutines that may be called, multiple subroutine calls can be made by dynamically specifying the name of the subroutine to be called at runtime and preparing one sequence of subroutine calling instructions. By executing the instruction via the sequence of instructions, it may be possible to significantly improve the usage efficiency of the program area.

However, in conventional control systems, if the name of the subroutine to be called changes during execution, the linking process between the subroutine calling part and the subroutine cannot specify the subroutine to be linked during normal linking, so the subroutine cannot be called during execution. It was customary to use dynamic linking, which linked to the required object module at the time it was needed. Therefore,
In an execution environment that does not have a dynamic link function, six emails prohibit calling subroutines whose subroutine names change during execution.

[Problem that the invention seeks to solve]

As mentioned above, conventionally, in an execution environment without a dynamic link function, it was not possible to call a subroutine whose name changes during execution. In addition, even in an execution environment with a dynamic link function, dynamic link processing is performed in the middle of the actual load module processing, and requires a lot of execution time compared to normal processing. There is also a problem in that when a large number of calls are made to a subroutine whose name changes during execution, the execution efficiency of the load module is significantly reduced.

An object of the present invention is to make it possible to call a subroutine in which the name of the subroutine to be called changes in an execution environment without a dynamic link function, and to change the name of the subroutine to be called at the time of execution even in an execution environment with a dynamic link function. To provide a dynamic subroutine calling method that improves the execution performance of a generated load module by linking in advance subroutines that are expected to be used among subroutines to be called by changing subroutines.

[Means for solving problems]

In the dynamic subroutine calling method of the present invention, when a required entrance name is explicitly specified at the time of linking, the object module containing the entrance is input and linked, and the specified entrance name and A linking means that generates an entrance name table having entry point information in a generation load module, and when a subroutine is called, the linking means searches the entrance name table generated at the time of linking to obtain necessary entry point information. and dynamic subroutine calling means for calling a subroutine according to the information.

〔Example〕

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the dynamic subroutine calling method of the present invention. This embodiment is an embodiment for an execution environment in which dynamic linking cannot be used, and is composed of a linking means 1 and a dynamic subroutine calling means 22.

FIG. 2 is a diagram showing details of the linking means 1.

First, in the object module input function 11, the object module OM1 required for the load module is
~Read OM n. Next, read the entrance name designation N1 to N1 in the input name designation function 12, and
1 to N1 are registered in the entrance name designation table 17 and the entrance name table 18. However, in this case, entrance name specification N1~
Among N1, the entrance names included in the object module read by the object module input function 11 are excluded from registration in the entrance name specification table 17. The entry name specification object module input function 13 inputs object modules OM1 to OMm having the entry name indicated by the contents of the entry name specification table 17, and the link function 14 inputs object module input t! Object module OM+~OM input in function 11 and entry name specification object module input function 13
Link m. Next, the entrance point information setting function 15 registers the entrance point information corresponding to the entrance name recorded in θ by the manual name designation input function 12 in the entrance name table 18,
With the load module generation function 16, load module [M
generate. At this time, the generated O-doule 1M includes an entrance name table 18.

FIG. 3 is a flowchart showing details of the entrance name designation input function 12.

Store the value 0 of variable i. Step 31> Specify the entrance name as 1.
(Step 32). Step 33: It is determined whether or not the entrance name designation room has been input using the switch knob 32.
), if the input color is input, the input color input in step 32 is stored in the i-th position of the input color table 18.Step 34
), the contents of variable i are incremented by 1 (step 35). Next, in step 32, it is checked whether the input color is present in the object module input so far (
Step 36), if it exists, the process returns to step 32; if it does not exist, the entrance color is stored in the population name room table (step 37), and then the process returns to step 37.

The above process is repeated until there are no more inputs for the entrance name designation room.

Figure 4 shows entrance color specification object module input function 1
3 is a flowchart showing details of step 3.

Step 4: Determine whether or not an entrance color exists in the entrance color designation table 17 (step 41), and if so, extract one entrance color from the entrance name designation table 17 (step 4).
2), input the object module with that entry color (step 43); Next, among the entrance colors in the entrance color designation table 17, the entrance color existing in the object module 1 inputted in step 43 is deleted (step 44), and then the process returns to step 41.

The above process is repeated until there are no more entrance colors in the entrance color designation table 17.

FIG. 5 is a flowchart showing details of the entry point information setting function 15.

The value O is stored in variable j (step 51). Then variable j
It is determined whether the content of is smaller than the content of variable i (step 52). At this time, the value in the variable i is stored in the entrance name designation input function 12, and is the number of entrance colors existing in the entrance color table 18. If the content of variable j is smaller than the content of variable i, the input color table is
To store the entrance point information of the entrance color corresponding to the first entrance point information column, step 53), and to increment the contents of variable j by 1 (step 54), the process returns to step 52.

The above process is repeated as long as the content of variable j is smaller than the content of variable i.

Table 1 shows the structure of the entry name room table 17. This entrance name designation room table 17 stores p entrance colors.

Table 2 shows the structure of the entrance color table 18.

One element is divided into an entrance base and an entrance point information section, and the entrance base stores the entrance color, and the entrance point information section stores the information necessary to call the entrance point corresponding to the entrance color.

Table 1 Table 2 The load module generated by the above processing is the first
It is executed by the configuration shown by Execution 2 in the figure.

When the user program 21 is executed in execution 2, if a call to a subroutine whose name changes during execution occurs, the user program 21
calls the dynamic subroutine calling means 22 with the name of the subroutine to be called as an argument. The dynamic υ broutine calling means 22 searches the entrance color table 23 generated in the load module 1M by the linking means 1 for the name of the subroutine passed from the user program 21, obtains the corresponding entry point information, and calls the subroutine according to the purpose. Call the subroutine.

FIG. 6 is a flowchart showing details of the processing of the dynamic subroutine calling means 22.

The name of the required subroutine is searched from the entrance color table 23 (step 61), and it is determined whether the name of the required subroutine can be found from the entrance color table 23 (step 62). saves the target subroutine (step 64).
, if not found, error processing is performed (step 63) and the process ends.

As described above, the process described above makes it possible to call a subroutine whose name changes during execution in an execution environment where dynamic linking cannot be used.

An embodiment of the execution environment in which the dynamic link of the present invention can be used is also comprised of the link means 1 and the dynamic 1J Brugen storage means 22.

The load module generated by linking means 1, which is exactly the same as in the previous embodiment, is executed by the configuration shown by execution 2. In execution 2, when the user program 21 executes a call to a subroutine in which the name of the buroutine to be called changes during execution, the user program 21 calls the dynamic subroutine calling means 22 with the name of the subroutine to be called as an argument. call. The spinning routine calling means 22 searches the entry table 23 generated in the load module 1M by the linking means 1 for the name of the subroutine passed from the utilization program 21, obtains the corresponding entry point information, and determines the purpose. Save the subroutines to be used.

FIG. 7 is a flowchart showing details of the processing of the dynamic routine calling means 22.

The name of the required subroutine is searched from the upper entrance table 23 (Step 71), and it is determined whether the name of the required subroutine can be found from the upper entrance table 23 (Step 72). teeth,
Call the desired subroutine (step 7)
4) If the target subroutine cannot be found, perform dynamic linking of the target subroutine (step 73),
The subroutine targeted for f-1 was called (step 7
5) Then exit.

By linking subroutines that may be determined to be called at runtime in an execution environment where dynamic linking is possible through the process described above, the name of the subroutine to be called can be It becomes possible to efficiently call subroutines that change during execution.

〔Effect of the invention〕

As explained above, the present invention generates a table of entry points and entry point information for subroutines that may be called during execution at the time of linking, and searches this table when calling the subroutine to obtain necessary entry point information. By calling the subroutine by calling the subroutine after the subroutine is called, it becomes possible to call a subroutine whose name changes during execution, which was previously impossible in an execution environment where dynamic linking cannot be used. Even in the execution environment, dynamic link requests occur frequently due to the large number of calls to subroutines whose names change during execution, and it is possible to suppress the deterioration in execution performance of load modules that occurs due to this. There is an effect that

[Brief explanation of the drawing]

FIG. 1 is an overall configuration diagram of an embodiment of the dynamic subroutine calling method of the present invention, FIG. 2 is a configuration diagram of the linking means 1, and FIG. 3 is a flowchart showing detailed processing of the entry name designation input function 12. FIG. 4 is a flowchart showing detailed processing of the entry point specified object module input function 13, FIG. 5 is a flowchart showing details of the entry point information set n function 15, and FIG. FIG. 7 is a flowchart showing detailed processing of the first stage of dynamic subroutine calling 22 under the execution environment y5 in which dynamic links can be used. 1... Link means, 2... Execution, 11...
Object module input function, 12... Entrance name specification input function, 13... Entrance specified object module input function 14... Link function 15... Entrance point information set function, 16... Load module generation function , 17... Entrance name designation table, 18... Entrance name table, 21... User program, 22... Dynamic subroutine calling means, 23...
Entrance name table, 31~37.41~44.51~54.61~64.7
1-75...Step, N1-N1...Entrance color specification, OM1-OMm...Object module, LM.
...Load module. 1-1-〆Figure 3 Figure 5 Figure 6 Figure 7

Claims (1)

[Claims] When linking, if the required entrance name is explicitly specified,
a linking means for inputting and linking an object module including the entrance, and generating an entrance name table having the specified entrance name and entry point information corresponding to the entrance name in a generation load module; and the linking means when calling a subroutine. A dynamic subroutine calling method having a dynamic subroutine calling means for searching an entrance name table generated at the time of linking to obtain necessary entry point information and calling a subroutine according to that information.