JPS62257532A - System for implementing optimization of subroutine - Google Patents

Abstract

PURPOSE:To implement most efficient optimized subroutines from one master subroutine, by providing a subroutine information storing means, master subroutine, and subroutine implementing means and specifying the constitution. CONSTITUTION:The system of this invention is provided with a subroutine information storing means 2 which stores names of subroutines and conditions for implementing the subroutines in its information storing area in a fixed form, master subroutine 5 which is implemented in such a way that whether or not each processing section is to be implemented can be discriminated in accordance with given conditions, and subroutine implementing means 3 which discriminates whether or not the processing sections in the master subroutine 5 divided by condition are to be implemented and implements the optimized subroutine 6 composed only of the processing sections which are at least required for executing aimed processes under given conditions from the master subroutine 5. Therefore, plural optimized subroutines can be implemented from one master subroutine when simple conditions are given and, as a result, management of subroutines becomes easier.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a method for converting common processing into subroutines, and in particular to optimization of subroutines and optimization of one subroutine (W a ). The present invention relates to a subroutine generation method that realizes the generation of subroutines.

[Conventional technology]

Conventionally, the methods for converting common processing into subroutines include creating one subroutine for each possible condition, and creating one subroutine that includes processing under all possible conditions within the common processing. There is a method.

[Problem that the invention seeks to solve]

Among the conventional methods described above, one method creates one subroutine for each given condition.

As the conditions given within a common process increase, it is necessary to create a subroutine that satisfies the conditions, so even though most of the processes within each subroutine are the same, slight differences in processing may result in new There are drawbacks such as the need to create subroutines and the need to modify all affected subroutines each time a common process is changed.

In addition, in the method of creating a subroutine that satisfies all possible conditions within a common process, depending on the given conditions, there may be completely unnecessary processes, which increases the scale of the subroutine. The disadvantage was that the processing speed decreased.

[Means for solving problems]

The subroutine optimization generation system of the present invention is as follows.

A subroutine information storage means for storing a subroutine name to be generated and conditions for generating the subroutine in a predetermined format in a subroutine information storage area, and processing under all conceivable conditions within the common processing. , a parent subroutine that is created so that the process can be divided into several processing parts according to conditions, and it can be determined whether or not to generate each processing part according to the given conditions;
Based on the subroutine name stored in the subroutine information storage area, find the corresponding parent subroutine, and generate processing parts divided for each condition in the parent subroutine based on the conditions stored in the subroutine information storage area. Determine whether or not.

The subroutine generating means generates from a base subroutine an optimized subroutine consisting of only the minimum necessary processing parts to perform a target process under given conditions.

〔Example〕

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

FIG. 1 is a block diagram of an embodiment of the subroutine optimization generation system of the present invention. This embodiment includes a termination determination 1 for determining whether to continue or terminate the subroutine information storage means 2 based on whether all information of the subroutine to be generated has been stored in the subroutine information storage area 4, and a name of the subroutine to be generated. and the conditions for generating the subroutine in the subroutine information storage area 4, and the subroutine name stored in the subroutine information storage area 4 to find the corresponding parent subroutine 5 and select the parent subroutine. Compare the conditions preset in 5 and the conditions stored in the subroutine information storage area 4, extract only the processing part that matches the 1 condition from the base subroutine 5, and execute the process that meets the purpose under the given conditions. and a subroutine generation means 3 for generating an optimization subroutine 6 consisting of only the minimum necessary processing parts to carry out the processing to be performed.

Note that "→" in Figure 9 indicates the flow of control, and "j" indicates the flow of data.

2 and 3 show subroutine information storage means 2, respectively.
．． 3 is a flowchart showing the configuration of subroutine generation means 3. FIG.

The subroutine information storage means 2 will be explained with reference to FIG.

This subroutine information storage means 2 performs a subroutine selection 7 for obtaining a corresponding parent subroutine name and stores the parent subroutine name selected by the subroutine selection 7 in a subroutine name storage area 10 in a subroutine information storage area 4 through targeted processing. A subroutine name storage 8 to be stored, and a subroutine generation condition storage area in the subroutine information storage area 4 that stores information such as the purpose of use of the subroutine and the usage environment, which are the conditions for generating a subroutine.]
1 and a subroutine generation condition memory 9 stored in the subroutine generation condition memory 9.

The subroutine selection 7 selects "A" as the parent subroutine name for creating a subroutine that satisfies the processing requirements, and the subroutine name storage 8 stores this parent subroutine name "A" in the subroutine name storage area 10. The subroutine generation condition storage 9 stores ``condition 1'' and ``condition 3'' in the subroutine generation condition storage area 11 as conditions for generating a subroutine for performing a target process from the parent subroutine ``A''. In this manner, a subroutine for performing the desired processing can be generated by extracting the processing portion matching "condition 1" and "condition 3" from the parent subroutine name "A".

Further, by executing this subroutine information storage means 2 many times, addition of a subroutine name and one condition can be easily performed.

The subroutine generating means 3 will be explained with reference to FIG.

This subroutine generation means 3 generates subroutine generation information for importing a parent subroutine name stored in a subroutine name storage area 10 in a subroutine information storage area 4 and generation conditions stored in a subroutine generation condition storage area 11. From the parent subroutine 5 corresponding to the parent subroutine name imported by import 12 and subroutine generation information import 12, the generation process of the optimized subroutine is continued depending on whether all processing parts matching the generation conditions have been generated. tfl
a termination judgment 13 for determining the subroutine generation information, a parent subroutine import 14 for importing one processing part divided for each condition from the parent subroutine 5 corresponding to the parent subroutine name imported by the subroutine generation information import 12; The conditions set in advance for the processed processing part are compared with the conditions imported from the subroutine generation condition storage area 11 by the subroutine generation information import 12, and depending on whether or not the 9 conditions match, the conditions that are currently imported are compared. A generation condition determination 15 determines whether the processing portion is generated as part of the optimization subroutine 6 or not.

A subroutine 6 optimizes the processing part in the parent subroutine 5 that is determined to match the generation condition according to the generation condition determination 15.
The optimization subroutine generation 16 is generated as part of the optimization subroutine generation 16.

The subroutine generation information import 12 imports "A" as the parent subroutine name from the subroutine name storage area 10.
``Condition 1'' and ``Condition 3'' are imported from the subroutine generation condition storage area 11 as conditions for generating an optimized subroutine. The parent subroutine import 14 obtains the parent subroutine A corresponding to the parent subroutine name "A" imported by the subroutine generation information import 12, and extracts the "condition 1 processing part" as one processing part separated for each condition. ”.

The "condition 1 processing part" is a processing part that is generated only when "condition 1" is satisfied. The generation condition determination 15 compares "condition 1" and "condition 3" imported by the subroutine generation information import 12 with the conditions of the "condition 1 processing part". "Condition 1 processing part" is a processing part that is generated when "Condition 1" is satisfied, so generation condition judgment 1
5, the condition is determined to be a "match", and is generated as part of the optimization subroutine by optimization subroutine generation 16.

In the end determination 13, since determination of generation conditions for all processing parts in the parent subroutine A has not been completed, it is determined to "continue". The parent subroutine import 14 imports the "condition 2 processing part" from the parent subroutine A as the next processing part. The "condition 2 processing part" is a processing part that is generated only when "condition 2" is satisfied. The generation condition determination 15 compares "condition 1" and "condition 3" imported by the subroutine generation information import 12 with the conditions of the "condition 2 processing part". Since the "condition 2 processing part" is a processing part that is generated only when "condition 2" is satisfied, the condition is determined to be "unmatched" by the generation condition judgment 15, and it is not generated as part of the optimization subroutine. Not done. The "condition 3 processing part" in the parent subroutine A is determined to "match" by the generation condition judgment 15 in the same way as the "condition 1 processing part", and the optimization subroutine generation 16
is generated as part of optimization subroutine A.

Importing the parent subroutine for the "condition n processing part" in the parent subroutine A14. From generation condition judgment 15, “
If it is determined that there is a match, optimization subroutine generation 1 is performed.
6 is applied, the end determination 13 determines "end", and the subroutine generating means 3 ends. As a result,
An optimization subroutine A consisting only of the "condition 1 processing part" and the "condition 3 processing part" in the parent subroutine A is generated.

〔Effect of the invention〕

As explained above, the present invention can generate multiple optimized subroutines from one parent subroutine by giving simple conditions, so there is no need to create a subroutine for each condition, and the subroutine This method has the effect of significantly shortening the time required to create a subroutine, and also makes it easier to manage subroutines because there is no need to have multiple subroutines that mostly perform the same processing. In addition, even if it becomes necessary to modify a subroutine due to a change in processing, you only need to modify the parent subroutine and the modification results will be reflected in all subroutines generated from that parent subroutine. It takes about the same amount of time to modify a single subroutine created to satisfy all conditions, but it is possible to generate the most efficient and optimized subroutine from its mother subroutine. effective.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of the subroutine optimization generation system of the present invention, FIG. 2 is a flowchart showing the structure of the subroutine information storage means 2 in FIG. 1, and FIG. 3 is a flowchart showing the configuration of subroutine generation means 3 of FIG. 1... End determination, 2... Subroutine information storage means. 3... Subroutine generation means, 4... Subroutine information storage area, 5... Base subroutine, 6... Optimization subroutine. Figure 1 Figure 2

Claims (1)

[Claims] 1. Subroutine information storage means that stores the subroutine name to be generated and the conditions for generating the subroutine in a predetermined format in a subroutine information storage area, and A parent subroutine that includes processing, is created in such a way that the processing is divided into several processing parts according to conditions, and can determine whether or not to generate each processing part according to given conditions, and a parent subroutine that is stored in the subroutine information storage area. A corresponding parent subroutine is found based on the subroutine name, and based on the conditions stored in the subroutine information storage area, it is determined whether or not to generate processing parts divided for each condition in the parent subroutine. , a subroutine generation means for generating an optimized subroutine consisting of only the minimum necessary processing parts to perform a target process under given conditions from a parent subroutine.