JPS5856154A - Automatic interprogram linkage system - Google Patents

Abstract

PURPOSE:To automatically release temporary linkage between different programs from being set, by controlling addresses where branches to other programs are caused and branch destination addresses in a table. CONSTITUTION:On the basis of an instruction read to an instruction register 1, the setting request display of a request control table RT is read out to read and hold an access source address A1, an access destination address B1, and a return instruction address B2 necessary for the linkage setting of programs A and B out of a linkage control table LT to registers 4, 5, and 6. An arithmetic circuit 7 calculates an address A1+1 and adds it to the jump instruction JUMP of a jump instruction output part 9, and a branch instruction, or data to be written in the address B2 of a memory MM is transferred to a write register 13 to be written in the address B3 of the memory MM entered into an address register 3.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to an automatic linkage method between programs, and in particular, in order to link two different programs only when necessary, the address of a point to branch to another program and the branch destination address are stored in a table. This invention relates to a method for automatic linkage between programs, which manages the programs and automatically updates tables even when the versions of the programs are different, thereby achieving linkage between programs.

Conventionally, when temporarily setting linkage between two starting programs A and B, it is generally done as follows. (1) In a certain program A. The memory address of the instruction to be branched to another program B is checked using the address list. (This shows the address list and the memory layout of each program determined when editing the 7 stems.) (2) Change the instruction examined in item (1) above to a branch instruction to another Grogzum B. do.

(J Because program B returns to the calling program program A after performing the specified processing.

The return instruction is returned so as to return to the next instruction of the calling branch instruction (ie, the nine-branch instruction rewritten in item (2) above).

(4) The ly cage set by the steps in (1) to (3) above re-changes the branch instruction to another program B that was changed in the +21 section in program λ to the instruction before the change. Koto K was released from work.

Specific examples of each spinning procedure will be explained based on FIGS. 1 to 5.

Here, Figure 1 is a memory layout diagram of programs 2A and H.
2 shows an address list, and FIG. 5 shows the linkage O setting fist release state.

Now, a case will be explained in which temporary linkage between program A and program B is established. Here, the step at address 11 (relative address within program program B) of program A branches to the step at address b1 (relative address within program B), and after the completion of the fixed period of employment by program B, 1wI program program is executed. B Ob, address (
From the step of the relative address in program B), the next instruction of the program person's 1sit location (town + 1 address; here, it is assumed that the number of 11 locations on the memory occupied by the instruction at address 1 is address 1)K returns. If so, the following steps are taken.

First, how many addresses (absolute addresses on memory) K in memory M are address a1 of program 2 M?

Also, it is checked at which locations in memory M the addresses b1 and b1 of program B are located. This is created when editing the system. It is calculated from the address list shown in FIG. The address list is for each program A, B...
・Ahead of 1l15i! Memory layout information such as address i, final address, size, etc. is created as a table and printed out by a printer.

The above calculation is performed by looking at this. That is, Grog2muA
is #I from ohb@ground on memory M.

The relative address in the program 2 is address Ah+11 on the memory M. The beginning of the nine program B is Bk 喬地よし, so the above b! The writing address and bt address are Bkb1 address and b1 address on memory M, respectively.
Bk + bm honor land. In this way, the memory address of the branch instruction is obtained.

(2nd Progtum people's asI command of the earth)
I) Rewrite it to a branch instruction to tl. That is, the instruction at address Ah+11 (address 1 of program person) on memory M is rewritten to the branch instruction ``JUMP B, address'' to address Bb 10b* (address b1 of program B).

In Ridoma9 program B, the instruction to return to the caller after a certain process is completed is rewritten to branch to the next instruction at address 11 of program A. Namely.

Address Bh +b on memory M (Program B Obm
+Ah +at +1 +1 heavy oil fee return command.

(4)' The linkage set in items (2)' and (3)' above.

Program address branch instruction, above (2)
It is released by rewriting the instruction that was rewritten in section ' with the instruction before the rewriting. Therefore, Ah on memory M
11. The address (address 11 of program 25^) is rewritten to the instruction before being rewritten to the branch instruction (the original instruction at address at).

In the past, temporary linkages were set and released manually (artificially) by the above-mentioned methods (1 to 4). However, during system development, the As shown in Figure 2, system editing is performed several times based on relocation caused by program changes. Check the address list according to the number of identifications assigned to the address.

A series of steps must be performed manually. For this reason, there was a possibility that failures in setting linkage would occur frequently due to mistakes in address research.

Therefore, an object of the present invention is to provide an automatic linkage method between programs that automatically sets and releases temporary linkages between different programs without having to manually investigate and rewrite the address list. With the goal. For this reason, in the program-to-program automatic linkage method of the present invention, when a program with a number of Il numbers is linked and released, an instruction writing means for writing an instruction into the program, and a call destination at the address of the linkage destination program are provided. an address holding means in which a call source address and a return instruction address in which an instruction to return to the original program is written at an address of a program that performs linkage with the address;
Instruction creation means.

Setting instruction means and release instruction means are provided for instructing setting or release of linkage, and when a linkage setting instruction is given, the address holding means is read and an instruction necessary for linkage is created by the instruction creation means, and the instruction creation means is provided. That command! 1tl instruction entry means automatically writes the instruction into the program, and when a linkage release instruction is issued, automatically changes the instruction written in the calling source address of the program. .

Prior to detailed description of one embodiment of the present invention, its operating principle will be explained.

(2) Prerequisite functions of the system The system of the present invention requires two functions described in the following a and b.

1. A monitor function that transfers control from a program startup request (request from a tie-up or another program) to the requested program.
When it is known that programs Y, .

b. When editing the system, it is necessary to have an editing function that calculates the absolute address in memory for the symbol label defined on the program source and writes the absolute address to the area that refers to the symbol label.

Summer, Linkage Management Table The linkage management table is a table that manages address information necessary to set or release linkages.

This linkage management table.

It is shown as LT in FIG.

The necessary address information can be found on the source of the relevant program.
For the calling step, the called step, and the return instruction step, a symbolic label (Lab@I
C, D, B, etc.) and summarize them from source table 8TK of the linkage management table, and use the corresponding fields when creating linkage management tables I and T using the edit function HD during system editing. Converting the corresponding symbol label to an absolute address will result in K 1 This linkage management table LT K caller 1 address (here A
,=AhJukarasu I), callee Btli land (B1-Bh+
bt) - Return instruction B, address (B, -Bh+bm) will be written.

FIG. 5 shows an outline of these processes during system editing.

1114 Linkage setting release program When a linkage setting request between program A and program B and a request to release the set linkage are made,
A linkage setting release program is provided to set and release linkages between programs according to each piece of information in the linkage management table LT. As shown in FIG.

This linkage setting release program is activated periodically at fixed time intervals by the operating control unit OC having a monitoring function. The operation 70- of this linkage setting release program is shown in FIG. The flow of data and processing at the time of linkage setting is shown in FIG. The numbers in FIG. 7 correspond to the numbers of each processing step in FIG.

Next, this linkage setting release program will be explained with reference to % in FIGS. 6 and 7.

(a) First, when the linkage setting release program is activated, it reads the request management table RT. The setting request display in the request management table RTK can be performed by an operator's operation or by another program. Then, a setting request is displayed, and if there is a request, the following control is performed.

(2) The linkage setting release program extracts the call destination address B1 from the linkage layer table LT and creates a branch instruction JUMP Bs to the call destination log 2B.

■ Next, extract the call destination address A1 from the linkage management table LT, calculate the return destination address A1+1 to program A, and issue a branch instruction JUMPA to the calling program person.
□Create +1.

■ Furthermore, linkage management table LT return command I
Extract I, B, and create the branch instruction JUMP in step ① above.
Write A1+1.

■ Extract the call destination address AI from the nine linkage management table LT, and write the branch instruction JUNPB created in the above ■.
Write.

■Then, the setting request display in the request management table RTK is dropped to indicate that there is no request. Check the linkage release request display to see if there is a linkage release request display. If there is a release request, the call destination address AIK (JUMPB) is deleted and the original instruction is restored. Then request management table RT
The release request display is set to no request. If there is no release request when looking at the release request display at the beginning of this section, the operation of this linkage setting release program ends in step 11.

The concept of processing at the time of linkage setting and the concept of release processing in the linkage setting and release program explained in (a) and (b) above will be briefly explained with reference to FIGS. 8 and 9.

In FIG. 8, the programmer is performing normal processing based on normal activation from the operating control unit oc. At this time, the programmer is performing normal processing at the request of the user.

Alternatively, the various request display setting section E operates in response to a request from another program and writes the setting request display in the request management table RTK as requested. Then, the linkage setting release program, which is activated periodically by the operating control unit OCK, operates, and the setting request display is first seen. At this time, if no request is entered here, the operation of this linkage setting release log 2m will end without doing anything, but in this case, Kii request is displayed, so check this. The linkage setting release program 2 refers to the linkage management table LT, rewrites the command as explained in (a) above, and then erases the indication of the presence of a request in the setting request display.

This is K#) As shown in Figure 9, the caller address of the program person has a branch instruction JUMP for program BK.
B is written, and the return instruction address BIK of program B becomes K when the branch instruction JUMPAI+1 to return to the programming language is written. and operating control unit O
When a program is run by normal startup from C, a branch is made to program BK, and program B
If the control processing operation based on K is also performed, then it becomes K. The operation based on this gramogram BK is continued until the release request display in the request management table RT indicates that there is a request.

Then, “Requested” is entered in the release request display and K is released after nine.

When the operating control unit OC starts the linkage setting release program through periodic activation, the linkage setting release program first looks at the request management table, reads that "request exists" is entered in the release request display, and then releases the previous Nil.
! (As explained above, the command is rewritten, the linkage state between Glogs A and B is released, and the presence of a request written in the release request display is erased. In this way, the operating control unit OC releases the program If you start a person normally.

If program A is processed without branching to program BK, it becomes K.

Next, the program-to-program automatic linkage system of the present invention, which performs the operations described above in 9 above, will be explained based on FIG. 10.

In the figure, 1 is an instruction register, 2 is a decoder, 5 is an address register, 4 to 6 are registers, 7 is a first arithmetic circuit, and 8
9 is a jump instruction output unit that outputs the jump instruction code JUMP necessary for creating a branch instruction, 10+1 addition circuit, 11.12 is a register,
Reference numeral 15 designates a write register I-) into which commands to be written between programs and BK stored in the memory MM are written, and reference numeral 14 designates a data holding register.

*In figure 1a, linkage setting release Groguzum LSR
P is activated by the operating control unit oc. When the linkage setting release program is executed, each instruction constituting the Jin program is sequentially read from the instruction register IK, which is decoded by the decoder 2, and after reading the request management table RT, controls the gates of each register, etc. Then, data processing is performed sequentially.

First, the instruction read out to the instruction register 1 is decoded by the decoder 2, and based on the instruction, the setting request display of the request management table RT is read out. The call source address, call destination address B, and return instruction address B1, which are necessary for establishing linkage between program B and program B, are stored in register 4.
, 5.6 and held. First, the address of 9 people 1, which is entered in register 4, is set in address register 5.

Access memory MM. Prior to accessing this memory MM, B is output from the register 5 to the second arithmetic circuit 8, and the jump instruction output unit 9 also outputs the jump instruction JUM.
Output P in the second calculation cycle jlBK, combine this B1 and JUMP, create a branch instruction "jJUMPB, XXX" which is data to be written to address A1 of memory MM, and write this branch instruction via register 12. and set it in the write register 13. And the person entered in the address book register 3! Address Kt(Df+branch instruction rJUMPBxxxX
J *Enter f; b.

During this time, the first arithmetic circuit 7 outputs A1 transmitted from the register 4 and +IK output from the +1 adder circuit.
+1 operation is performed, and the jump instruction JUMP output from the jump instruction output unit 9 is combined with this,
A branch instruction [JUMPA, XXX+IJ, which is the data to be written to B1 mK of memory MM, is created and register 11
is maintained. And this time, this branch instruction “J UMP
A4X

In this way, the linkage between grog')bA and B is established.

Also, when releasing this linkage, first K A
Read when accessing address t. The original command is retained even if it is written to the corresponding address. Data holding register 1
4, this original instruction is written into the write register 13. On the other hand, the address A outputted from the register 4 is set in the address register 5, and the original instruction is thus written again at address A1 of the memory IJMM. And from this K, the linkage between Progera^A and B will be released. In this case, 11! The means for holding the instructions written in the A1 address of the memo IJMM is not limited to the data holding register.2 For example, the means for holding the instructions written in the A1 address of the memo IJMM may be placed in advance at an appropriate location in the program B, and may be stored at an appropriate address in the memory MM. It can also be secured. Furthermore, this can also be held in a table such as a linkage management table.

As explained above, according to the present invention, by providing a linkage management table, even if the version of the program is different, the registered address is written when editing the system, so the equivalent table and block 2 system can be changed. do not have to.

In addition, by providing a linkage setting release program 2m,
Since this linkage setting release program sets/releases the linkage between programs registered in the table only when a linkage setting release is requested, the original processing 11 of each program is not affected after release.

By adding such programs to the system, temporary linkage between programs can be easily performed.

Furthermore, another embodiment of the present invention will be described based on FIG. 11.

The one shown in Figure 11 is a two-body Progera A (Prog 5 A
A' ) ノ required part KNor instruction (No 0per
ation command), give it a label, and issue it as a global. In addition, the linkage setting/cancellation program (8ET to RETURN) of the support program (Program, J, Bl >) to be linked is determined by N in one main program in the linkage management table LT'.
OP instruction address AhA,... and support program or nub-chin entry address 81#S■
When linking the support program, the NOP command of the main program (to the program) is used as a jump command (JUMP8..) to the support program, as shown in the lower part of FIG.

JUMP8. )K Rewrite. Then, the return instruction (JUMP*) of the support program (program B') is sent to the main program (J UMP AHHI3゜J).
UMP411) Rewrite K. Then, when the use of the support program ends and the linkage is released.

Change the main program's jump command back to a NOP command.

If this is done, the normal processing of the main body will not be affected except by the NOP command, so no problem will actually occur.

Furthermore, even if the main program is V*rmlon Up, there is no need to change the support program (jump command cape of the support program).

In the present invention, the setting request display does not need to be set to %, and it is sufficient that the linkage setting release program 2 is activated only when requested. Although it is started in step 4, the effect remains the same even if it is started from another program. The same applies to the linkage release request display.

If a branch instruction for linkage is written to the caller address, the original instruction will be destroyed. For this reason, in the above explanation, the same instruction as the destroyed instruction is placed in the called program and the substitute processing is performed, but the instruction to be destroyed is set as a NOP instruction (no processing instruction).
There is no need to perform a substitute process. Furthermore, since it was necessary to restore the destruction command when the linkage was released, we decided to store the destruction command in the table, but the destruction command was
If it is an OP instruction, the restoration process is unique and can be easily performed. Other measures for the 4 destruction commands may be considered, but the effects of the present invention will not change.

Also, all linkages are made up of branch instructions.

Depending on the computer, an instruction that prepares a return address and branches (for example, BAL instruction: Branch and Lin)
k, and the instructions BAL:B,,R, branch to the specified address B1 and register RsK&l! (indicating a return to the address entered) can be used.

The effects of the present invention remain unchanged. Various other commands are possible, but the effect will remain the same as long as the command can transfer control to another address.

Branch information to the linkage management table is written using the symbol 2-pel i during system editing, but the effect remains the same even if writing is performed by another program.

This embodiment shows the case where there is one initial linkage, but the same applies to the case where the linkage of the count is set and released.

[Brief explanation of the drawing]

Is Figure 1 a prog? Figure 2 is a memory allocation diagram of the five people and B, Figure 2 is a memory device list, Figure 5 is an explanatory diagram of temporary program linkage, Figure 4 is a diagram of memory relocation due to program change, and Figure 5 is a diagram of the book. FIG. 6 is an explanatory diagram of address information setting in the linkage management table used in the present invention. FIG. 6 is an outline of the linkage setting release program used in the present invention. FIG. FIG. 9 is an explanatory diagram of processing states at the time of linkage setting and release in the present invention, FIG. 10 is a configuration diagram of a simple embodiment of the present invention, and FIG. 11 is a detailed explanatory diagram of the present invention. is an instruction register, 2 is a decoder, 3 is an address register, 4 to 6 are registers, 7 is a first arithmetic circuit, 8
is the second arithmetic circuit, 9 is the jafugu instruction output unit, 10 is +1
The adder circuit, 11 and 12 are registers, 13 is a write register, and 14 is a data holding register, respectively. Applicant: Fujitsu Kinsha, Patent Attorney, Akira Yamatani, Eisai 4KonfSFig.7T

Claims (1)

[Claims] (1) When linking or releasing multiple different programs, an instruction entry means for writing instructions into the program, a call destination address in the address of the program to be linked, a call source address in the address of the program to be linked, and the original address. address holding means in which the return instruction addresses of instructions for returning to the program are written, instruction creation means, setting instruction means and release instruction means for instructing the setting or release of the linkage. When a setting instruction is given, the address holding means is read, an instruction necessary for linkage is created by the instruction creation means, the created instruction is automatically written into the program by the instruction entry means, and the linkage is released. An automatic linkage method between programs, characterized in that an instruction written in a call source address of the program is automatically changed when an instruction is received.