JPS63311439A - Call-return system - Google Patents

Abstract

PURPOSE:To decrease the number of dynamic steps and to shorten the processing time in a call-return system by performing the direct return to a specific calling module from an optional called module. CONSTITUTION:An inlet variable table 4 which stores the name of a module of the remote side to be called is previously defined into an M module 1 and this module 1 is processed based on a logic. If 'YenW#ABAL (ETBL, NUM)' is detected during the processing, the execution sequence of a program moves to a module having the same number as the NUM. Hereafter the processing is carried out continuously based on a logic until 'YenW#AEND (X)' is detected. When said 'YenW#AEND (X)' is detected, the program execution sequence returns to a module having the same name as that equal to the contents of X. Thus the direct return is possible to a specific calling module from an optional called module.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a call return method, and particularly to a call return method in which an arbitrary called module returns directly to a specific caller module.

[Conventional technology]

The conventional call return method has a hierarchical module structure as shown in Figure 2, and in the case of the processing flow as shown in Figure 3, when a CALL instruction is found during the processing of the M module which is the main routine, 1 The program execution sequence is moved to module A, which is lower in the hierarchy. After moving, A
If you find the CALL instruction again while processing the module,
The program execution sequence is moved again to the D module one level lower. Thereafter, the program execution sequence moves to the F module or G module in the same way as described above, and when the program execution of the F module or G module is completed, it returns to the D module, which is the calling module, and the A module is transferred from the D module. After that, it returns to M module. Each caller module returned at this time needs to construct processing subsequent to each CALL instruction.

[Problem that the invention seeks to solve]

The above-mentioned conventional call return method employs a method in which a seal destination module always returns to a calling module, and each module must necessarily construct a process after the return. Therefore, the number of dynamic steps also increases, which increases the processing time.

Another disadvantage is that in cases where the nesting of calls becomes complex, a considerable amount of man-hours are required to create the program.

An object of the present invention is to provide a call return method that returns directly from any called module to a specific calling module.

[Means for solving problems]

In the call return method of modules in a hierarchical module structure, the call return method of the present invention includes an entry variable table that stores the module name of the module to be called, and a call return method when calling a module specified in the entry variable table. It is constructed with a module call means for saving the address of a macro instruction including a function in a work area and calling a module, and a module return means for restoring the address saved by the module call means.

〔Example〕

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

FIG. 1 is an explanatory diagram for explaining the processing procedure of an embodiment of the present invention.

An entry variable table 4 storing the module name of the destination module to be called is defined in advance in the M module 1 shown in FIG. 1, and the processing of the M module 1 is performed according to logic. During processing “\W#ABAL (ETBL, NU
M)" (where \W#A B A L is the macro name, ETBL is the name of the entry variable table, and NUM
is the individual part number of the entrance variable table 4), the program execution sequence moves to the module with the same module name as the number NUM. After moving, ￥W
#AEND (X)" (where \W#AEND is a macro name, and X means the module name of the return destination module) is processed according to the logic of that module. "\W#AEND When (X)'' is detected, the program execution sequence returns to the module with the same module name as the content of X.

Next, the operation of this embodiment will be explained.The processing of the M module l, which is the main routine, is carried out as usual according to the logic.
When "\W#ABAL (ETBL, NUM)" is detected during processing, the entry variable table 4 defined in M module 1 is referenced based on the contents of NUM (in this case, S
module). In the entry variable table 4, the module name of each module to be called is stored. The address of each stored module name is
When linking, the program is automatically stored in an address-only table (not shown), and the program execution sequence is moved by using the address of the corresponding module name. In this embodiment, the process moves to S module 2. At this time, save the compiler work area address in the work area in "\W#ABAL (ETBL, NUM).

When calling the T module 3 from the S module 2, a normal call instruction is used and the program execution sequence is moved.

If “¥W#AEND (X)” is detected during processing,
By restoring the compiler work area address saved in the work area in the module with the same module name as the contents of X, it is possible to directly return to the module with the same module name as the contents of X.

〔Effect of the invention〕

As explained above, the call return method of the present invention is
By making it possible to return directly from any called module to a specific calling module,
Unlike the conventional method, there is no need to construct post-processing in each module at the time of return, and this has the effect of reducing dynamic steps and processing time.

[Brief explanation of the drawing]

FIG. 1 is an explanatory diagram illustrating the processing procedure of an embodiment of the present invention;
FIG. 2 is a block diagram of a hierarchical module, and FIG. 3 is an explanatory diagram of a conventional call-return method processing flow. 1...M module, 2...S module, 3...
・T module, 4... Entrance variable table. 1~-1? ′ 庬2 fig.

Claims (1)

[Claims] In the call-return method of modules in a hierarchical module structure, there is an entry variable table that stores the module name of the module to be called, and an address of a macro instruction containing the call function when calling the module specified in the entry variable table. a module call means for evacuating the module to a work area and calling the module;
A call return method characterized by comprising module return means for restoring the address saved by the module call means.