JPH06274328A - Execution method for program consisting of plural processing modules - Google Patents

Abstract

PURPOSE:To provide the execution method for a program, by which customizing in a wide range is possible and the deterioration of quality by customizing is less. CONSTITUTION:The method is to control the execution order of the respective modules in the program consisting of plural processing modules 4 generating a previously decided return code when the processing terminates. The processing module which is to be executed next is decided in accordance with the processing module which is executed immediately before and the return code which the processing module generates, and it is previously stored in an execution order storage means 1. For executing the processing module 4, the content of the execution order storage means 1, which corresponds to the processing module 4, is stored in an execution state storage means 2, the processing module 4 is executed, and the processing module 4 which is to be executed next is decided by the return code obtained when the processing of the processing module 4 terminates and the content of the execution state storage means 2.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of executing a program suitable for use in package software that is modified (customized) for various similar purposes.

[0002]

2. Description of the Related Art In developing a program for performing similar information processing, it is wasteful to newly program each process, so that a basic part common to each process and an expansion part peculiar to each process are common. In many cases, a so-called packaged software, which is divided as much as possible, is used to customize the extended portion. The customization work of such packaged software has to be performed over the entire packaged software and under a number of restrictions, so that the operation itself is complicated and error-prone. In addition, since the customization work is complicated, it is difficult to estimate the amount of work and the amount of work for creating a new program in advance.

[0003] Japanese Patent Laid-Open No. 1-103740 discloses a conventional package software customization work.
It is disclosed that the customization work is automatically performed by displaying a customizable part in the gazette and responding to the system interactively.

[0004]

However, according to the contents disclosed in Japanese Patent Application Laid-Open No. 1-103740, it is impossible to customize the basic part, and it is assumed that the basic part is customized by the conventional method. Even if you do, the resulting program will be more redundant than the newly created program.
Further, in the conventional customization method, if an excellent logic or module developed during a certain customization work is to be used for another customization work, the development part can be divided into a basic part and an extension part. Since it is necessary, it was difficult to reuse the development part in this way in the actual customization work.

The present invention has been made to solve the above problems, and an object thereof is to provide a program execution method capable of customizing a wide range and having less quality deterioration due to customizing. . Another object of the present invention is to provide a program execution method in which excellent logic and modules developed by customizing or the like are incorporated and functions can be easily improved.

[0006]

The present invention is a method for controlling the execution order of each module in a program including a plurality of processing modules that generate a predetermined return code at the end of processing, and is executed immediately before. Processing module and a processing module to be executed next corresponding to the return code generated by the processing module are stored in the execution order storage means in advance, and when the processing module is executed, the execution corresponding to the processing module is executed. The post-processing module is executed by storing the contents of the order storage means in the execution status storage means, and then the processing module to be executed next with the return code obtained at the end of the processing of the processing module and the contents of the execution status storage means. It is characterized by determining.

[0007]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described in detail below with reference to the drawings. FIG. 1 shows an execution order storage means 1, an execution status storage means 2, and an execution control means 3 which are necessary for executing a program execution method (hereinafter, abbreviated as the present invention method) including a plurality of processing modules 4 according to the present invention. 3 is a block diagram showing the relationship between a plurality of processing modules 4.

The execution order storage means 1 specifies the processing module 4 to be executed next from the processing module 4 executed immediately before and the return code notified from the processing module 4 at the end of processing. A table or the like that defines When the processing module 4 is executed, the execution status recording means 2 temporarily stores a portion of the contents of the execution order storage means 1 corresponding to the processing module 4 ′. The execution control means 3 searches the execution order storage means 1 from the contents stored in the execution status storage means 2 and the return code notified from the processing module 4 that has finished processing, and determines the processing module 4 to be executed next. The processing module 4 is executed.

Next, the execution order storage means 1 will be described in detail with reference to FIGS. 2 and 3. First, FIG. 2 is an example of an execution control flow of each processing module presupposed in the following description, and this embodiment will explain how to combine processing modules as shown in the flow in the present invention. It is a thing.

In FIG. 2, the processing module A is first executed, and after the processing is completed, the processing module A notifies one of 0, 1, 2, or 3 as a return code. When the return code = 0 is notified from the processing module A, the processing module B is executed next. Processing module B
Notifies either 0 or 3 as a return code after the processing is completed. When the return code = 1 is notified from the processing module A, or when the return code = 0 is notified from the processing module B, the processing module C is executed next. The processing module C sets 0 after the processing is completed.
Or 3 is notified as a return code, and when the return code from the processing module C is 0, the processing module D is executed. After the processing is completed, the processing module D notifies either 0 or 3 as a return code, and when the return code from the processing module D is 0, the processing module A is executed again. Further, after the processing module A, the processing module B, the processing module C, or the processing module D ends the processing, when the return code = 3 is notified, the processing module G is executed, and after the processing module G ends, the processing module A Return to execution. Furthermore, when the return code = 2 is notified from the processing module A, the processing module E is executed, when the return code from the processing module E is 0, the processing module F is executed, and when the return code is 3. Returns to the execution of processing module A. After completion of the processing, the processing module F notifies the return code of either 0 or 3, but in any case, the processing module A returns to the execution.

FIG. 3 is an example in which the execution control flow of the processing module described above is defined as a table in the execution order storage means 1. The execution order storage unit 1 defines a processing module to be executed next for each execution processing module and for each return code which is defined for each execution processing module and is notified after the processing is completed.

For example, in the first line 13 in the figure, the processing module A is executed, and after the processing module finishes processing,
When 0 is notified as the return code, the processing module C is next selected, when the return code = 1, the processing module B is selected, and when the return code = 2, the processing module E is selected.
When the return code = 3, it indicates that the processing module G is executed. Further, in the figure, the portion marked "-" in the next execution processing module indicates that it is undefined because the return code corresponding to the portion is not notified from the execution processing module.

Next, a method of controlling execution of the processing module in the data processing apparatus of FIG. 1 will be described with reference to the flowchart of FIG. When the processing is started, the execution control means 3 first stores the contents of the first line of the execution order storage means 1 in the execution status storage means 2 (step S1). Next, the execution processing module stored in the execution status storage unit 2 is read and the corresponding processing module is executed (step S2), and the processing module ends the processing,
Wait for return code notification (step S
3). When the processing of the processing module is completed and the return code is notified, the processing module to be executed next corresponding to the notified return code is obtained from the next execution processing module column in the execution status storage unit 2 (step S
4). Next, the contents of the execution order storage means 1 corresponding to the processing module to be executed next obtained in step S4 are searched, the contents of the execution status storage means 2 are rewritten with the contents (step S5), and the process returns to step S1. . Hereinafter, steps S1 to S5 are repeated, and the processing modules are executed in the order defined in the execution order storage unit 1.

The method of the present invention controls the execution order of a plurality of processing modules by the above-mentioned method. In this method, the program can be customized by changing the execution order of each processing module each time.

A method for customizing a program according to the present invention will be described below with reference to the examples shown in FIGS. In the method of the present invention, the function of the program is decomposed in processing module units, and the customization of the program relating to the change of the function or the processing order changes the execution order of the processing modules or adds, deletes or replaces the processing modules. It is done by That is, for example, if a certain function is added, a processing module that executes the function is added, and if a certain function is changed, the processing module that executes the function is replaced by another processing module. Be done.

Hereinafter, the execution order of the processing modules is changed,
How to add, delete, and replace processing modules is explained. First, the case of changing the execution order of the processing modules will be described with reference to FIG. Here, a case where the execution order of the processing module E and the processing module F in FIG. 2 is reversed will be described as an example.

The execution order of the processing modules can be changed by appropriately changing the contents of the next execution processing module of the execution order storage means 1. 2 and 3, the processing module E is executed when the return code from the processing module A is 2, and the processing module F is executed.
Is executed when the return code of the processing module E is 0. After execution of the processing module F, the process returns to the execution of the processing module A. Since this order is reversed, the processing module F is executed when the return code from the processing module A is 2, and then the processing module F is executed.
When the return code from 0 is 0, the processing module E may be executed, and then the processing module A may be executed again.

Therefore, first, the portion having a return code of 2 in the next-execution processing module name column relating to the processing module A is changed from the processing module E to the processing module F. Then, the part in which the return code is 0 in the next execution processing module name column regarding the processing module F is changed from the processing module A to the processing module E.

Further, the portion of the next execution processing module name column relating to the processing module E where the return code is 0 is changed from the processing module F to the processing module A. By the above change, the execution order of the processing modules is changed in the order of processing module A → processing module F → processing module E → processing module A. FIG. 5 shows the contents of the execution order storage means 1 after the execution order is changed.

Next, the case of adding a processing module to be executed will be described with reference to FIG. Here, in FIG.
An example will be described in which the execution of the processing module H is added when the return code from the processing module is 1 after the processing module F in 1. Execution order storage unit 1 after adding a processing module to be executed in FIG.
Indicates the contents of.

First, information regarding the processing module H is added to the execution order storage means 1. Here, the return code from the processing module H is set to only 0, and the processing is returned to the processing module A after the processing of the processing module is completed. Next, in order to execute the processing module H, the portion where the return code is 0 in the next execution processing module name column regarding the processing module F is changed from the processing module A to the processing module H. Due to the addition of the above information and modification of the contents, the processing module H is executed after the processing module F is executed.
Is added.

Next, the case of deleting the processing module to be executed will be described with reference to FIG. Here, in FIG.
The case where the processing module D therein is not executed will be described as an example. 2 and 3, the processing module D is executed only when the processing module C notifies the return code = 0. Therefore, the next execution processing module when the return code from the processing module C is 0 may be changed from the processing module D to the processing module A. FIG. 7 shows the contents of the execution order storage means 1 after deleting the processing modules to be executed. In the example of FIG. 7, the information regarding the processing module D is left in the execution order storage means 1, but since this information is not referred to, it may be deleted from the execution order storage means 1.

Finally, the case of exchanging the processing modules to be executed will be described with reference to FIG. Here, a case where the processing module D in FIG. 2 is changed to the processing module I will be described as an example. FIG. 8 shows the contents of the execution order storage means 1 after the processing modules to be executed have been replaced. First, information about the processing module I is added to the execution order storage unit 1. Here, the return code from the processing module I is 0 or 3, and when the return code = 0, the processing module A is returned and the return code =
When it is 3, the processing module G is executed.

Since the processing module D is being executed when the return code = 0 is notified from the processing module C, the next execution processing module column corresponding to the processing module C is changed from the processing module D to the processing module I. In FIG. 8 also, the information regarding the processing module D is left in the execution order storage means 1, but it may be deleted in the same way as when the processing module to be executed is deleted.

The execution order storage means 1 in the present embodiment assumes a case where a processing module to be executed next is always fixed after executing a processing module. However, for example, immediately before a processing module. When the processing module to be executed next varies depending on the executed processing module, a unique number is given to each line of the execution order storage means, and the next execution processing module is assigned the number. It should be specified.

FIG. 9 shows an example of the configuration of the execution order storage means in this case, and FIG. 1 shows an execution control flow of the processing module at that time.
It shows in 0. The examples of FIGS. 9 and 10 are examples in which the processing module to be executed next differs depending on the timing at which the processing module a is executed.

[0027]

As described above, according to the present invention, a wide range of customizing is possible, quality deterioration due to customizing is small, and it is easy to improve the function by incorporating excellent logic and modules. You can do it.

[Brief description of drawings]

FIG. 1 is a block diagram showing an overall configuration of a data processing apparatus that controls execution of a plurality of processing modules by using a program execution method including a plurality of processing modules according to the present invention.

FIG. 2 is a diagram showing an example of an execution control flow of a processing module in the data processing device of FIG.

3 is a diagram showing an example of a configuration of an execution order storage unit in the data processing device of FIG.

FIG. 4 is a flowchart for explaining the operation of the data processing device of FIG.

FIG. 5 is a diagram showing the contents of an execution order storage unit after changing the execution order of processing modules.

FIG. 6 is a diagram showing the contents of an execution order storage unit after adding a processing module.

FIG. 7 is a diagram showing the contents of an execution order storage unit after a processing module is deleted.

FIG. 8 is a diagram showing the contents of an execution order storage unit after a processing module is changed.

9 is a diagram showing the configuration of a modification of the execution order storage means in the data processing device of FIG.

10 is a diagram showing an execution control flow of a processing module for explaining the contents of the execution order storage means in FIG.

[Explanation of Codes] 1 Execution order storage means 2 Execution status storage means 3 Execution control means 4 Processing module

Claims (1)

[Claims] 1. A method of controlling the execution order of each module in a program including a plurality of processing modules that generates a predetermined return code at the end of processing, wherein the processing module executed immediately before and the processing module are executed. A processing module to be executed next is determined corresponding to the generated return code and stored in advance in the execution order storage means, and when the processing module is executed, the contents of the execution order storage means corresponding to the processing module are executed. Execute the post-processing module stored in the storage means,
Next, a method of executing a program consisting of a plurality of processing modules, characterized in that the processing module to be executed next is determined based on the return code obtained at the end of the processing of the processing module and the contents of the execution status storage means.