JPS5846439A - Program editing method of computer - Google Patents

Abstract

PURPOSE:To improve the editing efficiency of a program by interpreting nonoperation instruction given a specific number as a breakpoint of the program, and limiting the movement range of the program by an editing command. CONSTITUTION:In the 1st step, an instruction (a) is interpreted to calculate the number (n) of words of a program to be moved. In the 2nd step, memory contents are read out successively to know the address (x) of a nonoperation instruction given a number appearing first. In the 3rd step, the program is shifted back, word by word, from said address (x) until a next program appears, thereby calculating the number N of space words. In the 4th step, when the result N-n is zero or a positive integer, (n) words of the program are moved only in sections NOP1-NOP2. Thus, the movement of the program is completed. When the result N-n is negative, on the other hand, spaces are deficient, so the movement of the program is not performed, giving an alarm.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a program editing method for a computer, and only when the computer executes a program editing function, edits can be made by interpreting a no-operation instruction with a specific number as a program break. The purpose is to limit the range of movement of the program by commands, limit the parts of the program that can be changed, and improve the editing efficiency of the program.

With the advent of microprocessors, computers have begun to be actively applied to the field of digital control, and the number of operators who handle them has also expanded. Along with this, demands on control systems are shifting from the conventional emphasis on functionality to emphasis on ease of operation and maintainability. Furthermore, computers need to be handled not by specialized operators but by general control equipment operators, and there is a growing demand for functions that allow programs to be created and changed easily and efficiently. This example will be described next.

FIG. 1 shows the control sequence by the computer system.

This sequence shows that four inputs A, B, C, and D are operated and output E is output. Such a sequence often needs to be changed due to changes in the control conditions of the controlled object.

Suppose that it becomes necessary to change the sequence shown in FIG. 10 to the sequence shown in FIG.

This sequence is obtained by adding input condition F to the sequence shown in FIG. This change requires an additional program. A memory map corresponding to the sequence shown in FIG. 1 is shown at 7.31 yen. It is assumed that the sequence in FIG. 1 is included in program A shown in section 3.
Let B and C be programs corresponding to other sequences. Assuming that additional instruction a is added to program A and the program is changed to program A', programs B and C are also moved, resulting in the memory map shown in FIG. This means that the program changes have been completed, but a big problem still remains. It is easy to change a program stored in a storage device, but when we change the drawings (sequences) that we directly handle that correspond to the program, in addition to the part we want to change, according to Figure 4, the program Since the address changes, parts of programs B and C also have to be changed.

SUMMARY OF THE INVENTION An object of the present invention is to provide an efficient program editing method that eliminates the drawback of the conventional method in that a partial change in a program causes many drawing changes.

The gist of the present invention is to attach a specific program number to a no-operation instruction held by a computer, and when the computer executes a program other than editing, the number attached to the no-operation instruction is not distinguished. and the calculator changes, inserts,
When executing a deletion edit command, the no-operation instructions with specific numbers are interpreted as program breaks, and the attempt is made to minimize program movement due to program changes, insertions, and deletions. .

The present invention will be explained in detail below with reference to the drawings.

As shown in FIG. 5, an instruction is generally composed of an operation code indicating the command of the instruction and an operand indicating the object to be controlled. Figure 6 shows a specific example of the command, LO
■10O, the opcode is 1, indicating an instruction to import the contents of input/output address 0. AND 1101, the operation code is 2, indicates that the contents of input/output address 0 and the contents of input/output address 1 are to be ANDed. OUT Il
o] 0 means that the calculation result is output to input/output address 10. Further, NOP has an operation code of 0, indicating no operation. N0PI is the instruction format of the present invention, and the operation code is 0.
It is the same as the NOP instruction except that it indicates no operation. However, since the opcode includes the number 1, which corresponds to the program number, the computer can distinguish between N0'P and N0PI. Next, an example of a program using 1NOPI to 3 is shown in FIG. Program A is placed next to N0PI, and N0P2 is placed taking up space. It is assumed that programs B and C are arranged in the same manner below. If instruction a is inserted into program A in this state, the memory map will be changed as shown in FIG. That is, instruction a is inserted into program A, and the program is moved, but the space provided in advance is only reduced by the amount corresponding to instruction a, and program B,
C does not move. This shows that program A is N0PI and N0
This is because it is within the P2 section. Next, the means for realizing this function will be explained with reference to FIG.

First, it is assumed that the computer receives an instruction to insert instruction a, as shown in FIG. The computer starts inserting the program from this point. As a first step, instruction a is interpreted to calculate the number of words n to be moved in the program. As a second step, the memory contents are read out sequentially and the no-operation instruction with the first number (N0 in the example in Figure 7) is read out.
Know the address X of P2). As the third step, this address
Go back one word at a time and repeat until the program runs out again to calculate the number of words in the space, N. As the fourth step, from the number of words in the space N to the number of words to move in the program n
If the result of subtracting N - n is zero or a positive number, it indicates that the program can be moved, so N0PI
Only in the section from ~N0P2, one program word is moved, and the program movement ends. Furthermore, if the result of N-n is negative, it indicates that there is insufficient space, so a warning is issued without executing the program transfer. By processing in this way, only when changing, inserting, or deleting a program, the NOP with a program number attached is interpreted as a program delimiter, and the movement of the program due to program changing, inserting, or deleting is performed in the changing section. It is possible to limit drawing changes due to program changes to a minimum.

As described above, the computer to which the present invention is applied has the advantage that program changes can be easily made, and drawing changes can be limited to the parts corresponding to the program change section, allowing the computer to be used freely.

[Brief explanation of drawings]

Figure 1 is a diagram showing an example of a control sequence, Figure 2 is a modified inversion of the sequence shown in Figure 1, Figure 3 is a memory map diagram before modification, Figure 4 is a memory map diagram after modification, and Figure 5 is an instruction A format diagram, FIG. 6 shows a program device, FIG. 7 shows a memory map to which the present invention is applied, FIG. 8 shows a memory map after program change to which the present invention is applied, and FIG. 9 shows a processing flow diagram of the present invention. . 'I-t Figure 3 Figure 4 Figure broom 5 Figure missing call r
-”Figure 17 Figure 8 2 M

Claims (1)

[Claims] 1. In the program editing method for a computer having the function of sequentially executing a plurality of stored programs and the function of editing (change, insert, delete) the program σ, a program number is assigned to a no-operation instruction. At the same time, an area necessary for the editing is provided for each program, and in response to a program execution command, the no-operation instructions of each program are stored in the starting address of the programs of the number of machines. Execute the program that follows after execution,
For program editing commands, the address where the no-operation instruction with the program number to be edited is stored, and the address where the next no-operation instruction with the program number attached is stored. Search for the previous address and enable data changes only between those two addresses,
A computer program editing method, characterized in that the program to be edited is edited.