JPS62194542A - Program control system - Google Patents

Abstract

PURPOSE:To automatically produce the latest target program by storing a basic processing program with no change and controlling the contents of the change independently and in response to the time information to minimize the memory area allocated to a user. CONSTITUTION:At the time of a specific function name is designated and called out of a terminal equipment 2 for a source program C, a central processing system 3 receives said function name and starts a program editing part 5 via an operating system OS4. The part 5 obtains both program and function names from the OS4 and retrieves a library file 8 to call out the program C. Then the part 5 stores the program C in a work area 7 and starts a nucleus control part 6 to request the change contents of a history control table corresponding to the function name of the program C to the part 6. The part 6 reads the change contents of the history control table to the corresponding function name of the program C out of a history control table in the order of older histories and supplies them successively to the part 5.

Description

[Detailed Description of the Invention] [Industrial Field of Application] This invention relates to a program management system, and in particular, when a specific source program is commonly used, the user etc. does not have to manage the history of the source program. Done,
It relates to a program management method that can efficiently generate the latest source programs.

[Prior Art] A conventional source program management method involves copying a commonly used source program to a storage area unique to the user, and then changing (modifying,
(including updates, etc.) and is in use.

[Problems to be Solved] In such a program management system, a large capacity storage area must be provided for the source program, including a work area for the source program.

Furthermore, the user of the source program must independently manage the history of the changed portions of the source program, making program management complicated, prone to change errors, and inefficient.

[Purpose of the Invention] The present invention solves the problems of the prior art, minimizes the storage area allocated to the user, and automatically generates a state-of-the-art program that automatically marks +'l. The purpose is to provide a program management method that can

[Means for Solving the Problems] The means in the program management system of the present invention for achieving the first objective are as follows: a first storage unit storing a basic processing program; a second storage unit that stores a processing program to be used; and a second storage unit that stores a processing program to be used when there is a change in the processing program that is called to the second storage unit; a program history management means for managing the time information and generating corresponding change contents in accordance with the passage of time from the oldest time information; and a change to the basic processing program according to the change contents from the program history management means. The system also includes program restoration means for sequentially executing processes and restoring the latest processing program.

[Operation: By storing the basic processing program without changing it in this way, and managing the changes independently according to time information, it is possible to change the processing program from time to time in response to various changes. It is possible to automatically restore according to the history and generate the latest processing program.

As a result, there is no need to take up a large storage area for the processing program to be used, and the user does not need to independently manage the history of the program.

Therefore, the latest program can be efficiently restored and generated, and program creation and management become simple.

[Example 1] Hereinafter, an example of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram of an information processing system to which the program management method of the present invention is applied, FIG. 2 is an explanatory diagram of a specific example of a management table for managing the program history, and FIG. 3 is a diagram of the source program. FIG. 4, an explanatory diagram showing the relationship between the library and the history management table, is an overall explanatory diagram of the program restoration procedure.

In FIG. 1, ``■'' is an information processing system consisting of a terminal device 2 and a central processing system 3, and the terminal device 2 exchanges data with the central processing system 3 through a human/manual interface or the like.

Here, the central processing system 3 is in charge of a computer and an external storage device, and 4 is an operating system section (hereinafter referred to as O8) in this computer, and the central processing system 3 is in charge of controlling the operating system section 4. A program editing section 5 and a core management section 6 are realized by a program, and a work area 7 for storing a specific processing program is secured on the memory corresponding to the user of the terminal device 2.

The central processing system 3 has a source program library file 8 in which various source programs are stored in an external storage device, and a history management table storage file 9.

The core management unit 6 also controls the source programs called into the work area 7 among the source programs stored in the library files 8 and 11, when the source programs are changed due to function expansion or troubleshooting. The changed portion is edited and stored in the history management table storage file 9 in the form of the history management table 10 shown in FIG. 2 as the 11th table called the core.

Note that the program editing section 5 is one specific example of the program restoration means in the present invention, and the core management section 6 is one specific example of the program history management means in the present invention.

FIG. 2 shows a history management table 10 stored in the history management table storage file 9. The history management table 10 has the name of the change program to be changed in the first column 11.

For example, MA display program, MB sort program, M
C printing program etc. is stored, and in the second column 12,
If a function is expanded, the corresponding function name 9 For example, in the MA data display program, A format data selection display processing, in the MB sort program, T range specification sort processing, and in the MC print program, C format selection processing Names corresponding to functions such as Also,
In the case of troubleshooting, etc., a name serving as a corresponding index is stored.

No. 3 1] Column 13 of 1 is a column for storing the "E+ 118 or 1" where the program has been changed, and corresponds to a specific example of "time information at the time corresponding to the change" in this invention. . The fourth column 14 is a branch index column, and is used when branching to a plurality of programs within the same function name.

The fifth column 15 is an area for storing the changed content of the source program called into the work area, and is a column 15 for storing the changed position (for example, address, etc.) of the source program.
a and a corresponding column 15b for storing changed data.
1 (1=1 to n: n is an arbitrary integer) n columns are arranged in sequence.

Then, in the last column 16 of the history management table 10, there is a flag indicating whether the next nucleus (similar history management table 10) exists or not, and if it exists, the location of that nucleus (
For example, the data at the starting address) is stored. Note that if the following core exists, it means that it is not the latest update (and that there are even newer changes).

Next, the operation will be explained according to FIG.

First, individual module programs necessary for a certain application program are stored in the source program library 8 as source programs A and B, respectively.

Assuming that the source program C is stored as a specific function name 1, for example, N from the terminal device 2,
, when a call is made by specifying , the central processing system 3 receives it and starts the program editing section 5 via the 084.

Here, the program editing section 5 obtains the source program name and function name from the O84, searches the library file 8, calls the source program C to be used as l-1, and temporarily stores this in the work area 7. At the same time, the core management unit 6 is activated to request the core management device 6 to change the content (history) of the history management table 10 corresponding to the function name of the source program C.

In response to a request from the program editing section 5, the core management section 6 extracts the source program C from the history management table storage file 9 using the source program name and function name (for example, Nt) as keys, as shown in FIG. The changed contents of the history management table 10 for the function name corresponding to the function name are read out from the oldest history and sequentially provided to the program editing device 5 (.

That is, as shown in FIG. 3, the nuclear management department 6 first
Refer to the first column of the history management table 10, search the table group for the program name C, and further search for the oldest one corresponding to the function name (N/) from among these program groups to determine the history. Select the management table 10a (for example, core 1).

Then, the change contents of No. 5 [1 (contents of column 15 of the history management table) of this history management table loa are sent to the program editing section 5.

The program editing section 5 sequentially receives changes provided from the nuclear management device 6 and changes the contents of the source program C called into the work area 7 in accordance with the changes. Then, at point l+,'j when this change is completed, a request is made to the core management unit 6 for the next change in the history management table 10.

The nuclear management unit 6 uses the previously called history management table 10a.
Refer to the last column 16 of the following history management table 1
Find out if there is a 0 and if so, get its address,
Get the next 10 groups of history management tables from this address,
The history management table 10b (for example, core 2) is searched based on the function name. Then, in the same manner as described above, the changed contents of the history management table 10b (the contents of column 15 of the history management table 10b) are sequentially sent to the program editing section 5.

As before, the program editing section 5 receives the changed contents of the history management table lOb, is called to the work area 7 according to the changed contents, and further changes the contents of the previously changed source program C. I'll go. When this change is completed, a request is made to the nuclear management department ζ6 regarding the next change.

In this way, the program editing device 5 sends a request for changes to the core management device 6, and the core management unit 6 refers to the last column 16 of the history management table 10 that has been called up to make the next history. The changed content of the history management table 10 is sequentially sent to the program editing section 5 until the management table 10 is reached.The program editing section 5 then sends the selected source program C sequentially until it becomes the latest state. Let's keep layering.

Here, when the nuclear management unit 6 refers to the column 16 of the history management table 10 and determines that there is no history management table 10 following the history management table 10, the nuclear management device 6
generates an answer signal to that effect to the program editing device 5.

The program editing device 5 outputs such an answer to the nuclear management device 6.
Upon receiving the answer that there is no history management table 10, the program editing device 5 sends a signal to the O84 indicating that the restoration process has been completed.

03 received this restoration completion signal from the program editing section 5
4 generates a signal from the central processing system 3 to the terminal device 2 indicating that the calling process for a specific program (source program C) has been completed.

As a result, the operator who operates the terminal device 2 can
Programs required for the operator's system can be created by compiling against the latest source program set in the work area 7, by calling other source programs in the same way, and by combining these modularized source programs. Edit it and use it for the necessary parts of your own processing system.

The history management table 10c (for example, core 3) shown in FIG. 3 is a history management table for the same source program but with different function names.

FIG. 4 shows the restoration processing path of the program editing section 5, including the core with different function names (history management table 10), in correspondence with the source program library file 8. The route you see shows the connections in history.

Here, the part where the function history 1 branches between the route 1 and the route 2 is based on the branch index shown in the fourth column 14 of the history management table 10.

Note that for the same basic source program of Library 8, it is not a major flow change, but for example, a customer, etc.
Each operator may individually modify or change specific contents to create a program.

In such a case, by assigning the branch index field to this and storing the customer code and operator identification code in this branch index field 14, it is possible to edit and restore the code to correspond to each code. .

As a result, we are able to provide detailed support for customers and operators.

[Below-1] In the embodiment, an example is described in which restoration processing is performed sequentially from oldest to oldest, but this restoration processing is not necessarily applied to all past history.
Good too.

That is, there is also an unnecessary history that may not be changed with respect to the current operation of the restoration editing process. Restoring and editing such history would be a waste of time and reduce the restoration processing speed. Therefore, in order to deal with this,
A flag area is provided in the history management table, and flags are set there for items that are not included in the history during restoration or items that may be skipped. By referring to this flag at the time of restoration, it is possible to exclude items from the history restoration targets.

Therefore, in this specification, the meaning of restoring time information in chronological order includes the case where unnecessary history is skipped and restored in chronological order with some exceptions. .

Furthermore, although the embodiments have mainly been described with reference to modularized source programs, source programs that are not modularized may also be used.

Of course, the present invention can be applied to various processing programs such as abstraction programs and object programs.

[Effects of the invention As can be understood from the above explanation, this invention has the following effects:
Changes to the first storage unit that stores the basic processing program, the second storage unit that stores the processing program to be used, and the processing program to be used that is called to the second storage unit A program history management means for managing the change contents corresponding to the time information at the time corresponding to the change when there is a change, and generating the change contents corresponding to the time information according to the lapse of time from the oldest one, and this program history management sequentially executing change processing on the basic processing program according to the change content from the means;
Since the present invention is equipped with a program restoration means for restoring the latest processing program, it is possible to automatically restore the current processing program corresponding to various changes according to its history and generate the latest processing program.

As a result, there is no need to take up a large storage area for the processing program to be used, and there is no need for the user to independently manage the history of the program.

Therefore, it is efficient (the latest program can be restored and generated, and program creation and management become simple).

[Brief explanation of drawings]

FIG. 1 is a block diagram of an information processing system to which the program management method of the present invention is applied, FIG. 2 is an explanatory diagram of a specific example of a management table for managing the program history, and FIG. 3 is a diagram of the source program. FIG. 4, an explanatory diagram showing the relationship between the library and the history management table, is an overall explanatory diagram of the program restoration procedure. 1... Information processing system, 2... Terminal device, 3...
・Central processing system, 4... Operating system department, 5... Program editing department, 6... Nuclear management department, 7
...Work area, 8...Library file, 9...
- History management table storage file, 10... History management table.

Claims (2)

[Claims] (1) A first storage unit that stores a basic processing program, a second storage unit that stores a processing program to be used, and a process to be used that is called to the second storage unit. A program history management means that, when a change is made to a program, manages the change contents in accordance with the time information at the time corresponding to the change, and generates the change contents corresponding to the time information from the oldest to the oldest; A program management method comprising: program restoration means for sequentially executing change processing on the basic processing program according to the change contents from the program history management means and restoring the latest processing program. (2) The first storage means stores a plurality of basic modularized processing programs each having unique information, and the program history management means:
When there is a change in the processing program to be used, the contents of the change are stored in table form for each unique information about the processing program and in accordance with the time information at the time corresponding to the change, and the selected unique information is stored. The program restore means refers to a table regarding the processing program corresponding to the information and generates the changed contents of the table according to the passage of time from the oldest time information, and the program restoration means corresponds to the selected unique information. According to claim 1, the processing program is configured to sequentially execute change processing according to the change contents from the program history management means for the processing program to be selected, and restore the latest program for the selected processing program. program management method.