JPH0381827A - Reentrant program system - Google Patents

Abstract

PURPOSE:To sharply shorten the time consumed for design, coding and evaluation, to reduce the generation of misses based upon human factors and to improve the maintenance and transfer efficiency by providing a reentrant program system with a deciding means, a transfer means, and so on. CONSTITUTION:Control is transferred from an instruction part 42 or 62 in a calling program side task 4 or 6, the deciding means 1 decides whether the contents of a data part 51 in a called program 5 are transferred to the task 4 or 6 or not. When the contents are not transferred as the decided result of the means 1, the transfer means2 transfers the contents of the data part 51 of the program 5 to a part of the data part 41 or 61 of the task 4 or 6. When the means 1 decides that the contents of the data part 51 of the program 5 are transferred to the task 4 or 6 or the means 2 transfers the contents, control is transferred to an execution part 3, which transfers the control to the instruction part 52 of the program 5 to execute the program 5. Consequently, the time required for design, etc., and the generation of misses due to human factors are reduced and the maintenance and transfer efficiency of the program can be improved.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention is a combiator multi-programming system for performing predetermined functions for calling multiple task boxes or jobs. It concerns the Tzentra/Dobrogram method, which is designed as such and uses the Knitland program.

[Conventional technology]

In the traditional reentrant programming method, a list/trand program is interrupted during execution by a call from one task, and the designer or programmer does not know that the interrupted program will be called from another task. When is it conscious?

It was designed or coded so that it could handle calls from each task no matter where an interrupt occurred. Some systems had compilers that, when instructed to output reentrant objects, output the desired objects.

[Problem to be solved by the invention]

Conventionally, the program designer or programmer designed a Tzentra/Do program to execute a predetermined function in response to an O call from each task at any point in a series of instructions or at any time. , compared to non-study/trand programs because they were designed or coded with knowledge.

It takes a lot of time to design, design, design mistakes based on human factors, and it takes a lot of time to verify (debug) and evaluate reentrant programs. There were drawbacks. Also, when outputting rie/tranto objects with Con/4 Ira.

There are limitations on the Con/4 Illustrator statements that can be used, and the Con/4 Illustrator creator must be aware of object generation in a reentrant program, so there are the same drawbacks as above.

The present invention improves on these conventional drawbacks, and aims to significantly reduce the time spent on design, coding, and evaluation, and reduce the occurrence of errors due to human factors. Furthermore, it is an object of the present invention to provide an entrant/do-program system that makes it possible to improve program maintainability and portability to other combination computers.

[Means to solve the problem]

The login/doprogram method of the present invention includes a determining means for determining whether or not the data part of the called program is transferred to a task on the calling program side when control is passed from the calling program to the called program, and a cough determination method. a transcription means for transferring the data portion of the called program to a task on the calling program side when a determination result from the means is that it has not been copied;

and execution means for passing control to the called program when it is determined by the determination means that the program has already been copied or when the transcription has been performed by the transcription means.

[Effect]

When control is passed from the calling program to the called program, the first determining means determines whether or not the r-part of the called program has been copied to the task of the calling program, and if it has not been copied, the copy is not transferred. The means transfers the data portion of the called program to the task on the calling program side. When it is determined by the determination means that the program has already been transcribed or when the transcription means has transcribed it, the execution means passes control to the called program;
Start execution.

〔Example〕

Hereinafter, one embodiment of the present invention will be described based on the drawings.

FIG. 1 is a block diagram of one embodiment of the present invention.
In the figure, in a multi-programming environment, 1, for example, a program 5 provided by an operating system, that is, a called program, a task 4 on the calling program side,
6 is shown as an example in which calls are shared. Task 4.6% program 5 has data sections 41 and 6, respectively.
1.51, and instruction sections 42, 62.52.

When control is passed from the instruction section 42 or 62 of the task 4t or 6 on the calling program side, the determining means 1 determines whether the contents of the data section 51 of the called program 5 have been transferred to the task 4 or 6. It looks like this. The transcription means 2 transfers the contents of the data section 51 of the called program 5 to a part of the data section 41 or 61 of the task 4 case or the task 6 when the result of judgment by the judgment means 1 is that the contents have not been transcribed. It has become. Furthermore, when the determining means 1 determines that the contents of the data section 51 of the called program 5 have been transferred to the task 4 or 6, or when the transcription means 2 transfers the contents, the execution means 3 is given control and Control is transferred to the instruction section 52 of the program 5, and the called program 5
It is designed to run.

Next, a more detailed processing operation of the reentrant program system configured as described above will be explained.

For example, consider a case where task 4 uses called program 5. In this case, when control is passed from the command section 42 of task 4 to the determining means 1, the determining means 1 checks whether the contents of the data section 51 of the called program 5 have been copied to the task 4, and checks whether the contents of the data section 51 of the called program 5 have already been copied. If so, the transfer destination address is stored in the register and control is passed to the execution means 3.

On the other hand, when the result of the determination means 1 is that the transfer has not been performed, control is passed to the transfer means 2.

It should be noted that various methods can be considered for the determination by the determination means 1 depending on the architecture of Combi Island-Yu.

For example, if the content of the address passed from the called program 5 as a 14-parameter value is 10'', it is not transferred.

If it is ``1'', it may be treated as transcribed and handled, or it may be a predefined number description in the case of a combination descriptor that specifies the memory space that a task can access using a segment descriptor. It is also possible to determine whether the child is valid or not.

The transfer means 2 transfers all the contents of the data section 51 of the called program 5 to a part of the data section 41 of the task 4, stores it in the register at the transfer destination address 411t-combi a--/, and sends control to the execution means 3. hand over. If necessary, the execution means 3Fi stores parameters predetermined between the task 4 and the called/outgoing program 5 in a predetermined location of the transfer destination address,
Control is transferred to the instruction section of the called program 5 with the transfer destination address 411 stored in the register.

In this way, in this embodiment, when control is transferred from task 4 or task 6 to called program 2,
It is determined whether or not the data part 51 of the task 4t or 6 has been transferred to the task 4t or 6, and only when it has not been transferred, it is transferred and then executed.
．． Only the transfer means 2 and the execution means 3 can be created as a reentrant program, and the other means can be created as non-entrant programs.

This allows for the design of reentrant programs.

The time spent on coding and evaluation can be significantly reduced, and the occurrence of errors due to human factors such as design errors and coding errors can be reduced. Furthermore, it is possible to create an iterative program using a high-level language (combiator), thereby making it possible to improve program maintainability and portability to other combinators. Furthermore, the above three means 1, 2.
3 can be used in common with all of the various glue knit runt programs.

〔Effect of the invention〕

As explained above, the present invention provides: 1 determination means, transfer means,
Since only the execution means need be considered and created as a reentrant program, the time spent on designing, coding, and evaluating reentrant programs can be greatly reduced, and errors due to human factors can be reduced. This can reduce the number of occurrences, and further improve the maintainability of programs and portability to other combiators.

[Brief explanation of drawings]

Figure g1 is a book diagram of one embodiment of the present invention. In the figure, 1...determination means %2...transfer means, 3...execution means. 4.6...Task%5...Called Glogzum%41
゜51.61...data section, 42,52.62...
Instruction part, 411, 611--Transfer destination address.

Claims (1)

[Claims] When control is passed from the calling program to the called program, there is provided a determination means for determining whether the data portion of the called program has been transferred to a task on the calling program side, and a determination result from the determination means that the data portion of the called program has not been transferred. a transcription means that transfers the data part of the called program to a task on the calling program side at a certain time; and a transcription means that transfers control to the called program when it is determined by the determination means that the data part has already been transcribed or when the data part has been transcribed by the transcription means. A reentrant program method characterized by having an execution means for passing.