JPS61123904A - Logic arithmetic device - Google Patents

Abstract

PURPOSE:To obtain a common logic arithmetic expression for iteration and an ease-to-modify logic arithmetic system by incorporating the name of a sub- program and a parameter into a main program so as to providing a function capable of referring repeatedly to the sub-program. CONSTITUTION:First, the top address of a logic arithmetic table 1 is stored in a pointer P. An a code by arithmetic type 12 is read at an address of P+1 and branched in a route corresponding to said code. In case of basic logic arithmetic the arithmetic such as an OR and an AND is executed, and the output parameter 11 is read at an address P to store the result at an output destination address. At an address of P+2 thirteen parameters are read to obtain the length of a basic logic arithmetic factor 2, and the pointer P is advanced to the top of the next factor 2. When the code type is a jump to the sub-program, the value of the pointer P on the table 1 is preserved in another pointer PS, and top address of the sub-program is read from the address P to store it in the pointer P. Where the code type is a return to the main program, the value of the pointer PS is stored in the pointer P, after which the pointer is advanced from the address P+2 in the same manner.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to a sequencer using a digital computer, and more particularly to a logic operation device suitable for a sequencer including a large number of logics similar to one.

[Background of the invention]

In conventional seek/sequence using a digital computer, the means to realize a sequencer with multiple equivalent logics is (1) define a common logical operation formula, create one program, and use a high-level computer to execute this program. A method of adding and editing unique parameters to a common logical operation expression program to generate individual logic; (2) A method of incorporating a common logical operation expression into an execution program so that it is interpreted and operated as one operation element. and so on. However, if you change the common logical expression after the seek/su is completed, (1
) method, it is necessary to change the individual logics that use the common logical operation expressions, or to generate the individual logics again using a host computer after changing the common logical operation expression program. Therefore, there is a drawback that it requires a lot of effort.
The method (2) generally has the disadvantage that it requires specialized skills because it is necessary to change the execution program written after a statement different from the statement that defines the connection relationship of logical operation elements.

Note that related devices of this type include, for example,
There is Japanese Patent Application Laid-Open No. 58-56124.

[Purpose of the invention]

An object of the present invention is to provide a common logical operation formula that is used repeatedly and a logical operation method that can be easily changed.

[Summary of the invention]

A feature of the present invention is that a common logical operation formula that is repeatedly used is realized by having only one formula that defines the connection relationship of basic logical operation elements using the same expressions as in general logic.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to FIGS. 1 to 7.

In FIG. 1, a logical operation expression table 1 is made up of basic logical operation elements 2 arranged in the order in which they should be operated, and a termination element 3 for terminating all operations is placed at the end. The basic logical operation element 2 includes an output parameter 11 indicating the cutting edge address of the operation result, and an operation type code 12 defined corresponding to each type of operation, such as logical sum and logical product, for example.
It consists of a number of parameters 13, and several parameters 14, such as input source addresses and constants of input data used in calculations, whose order and meaning are determined by the type of calculation. The number of parameters 14 is equal to the number of parameters 13. Each of the output parameters 11 and 14 is attached with a reference distinction flag 20 indicating whether it is a direct reference or an indirect reference. When the value of the reference distinction flag 20 is 0, direct reference is allowed, output parameter 11,
Alternatively, it indicates that the parameter 14 itself is an address or a constant. When the value of the reference distinction flag 20 is 1, it is an indirect reference and only appears in the subprogram, and the output parameter 111. Alternatively, parameter 14 is the order number of parameter 14 of the basic logical operation element in the main program that referred to the subprogram, and the address or constant is the output parameter 11 of the subprogram or the main program parameter pointed to by parameter 14. 11.

The operation of a program that performs calculations while sequentially interpreting the logical operation expression table 1 will be explained with reference to FIG. First, the start address of logical operation expression table 1 is stored in pointer P.

Read the operation type code 12 at address (P+1) and branch to the route corresponding to the operation type. In the case of basic logical operations, for example, perform operations such as logical sum and logical product, read output parameter 11 from address (P), store the operation result in the cutting edge address, and calculate the number of parameters 13 from address (P+2). The length of basic logic operation element 2 is determined by reading, and the pointer P is advanced to the beginning of the next basic logic operation element. Operation type is jump to subprogram (CALL
), in FIG. 3, the value of pointer P pointing to the address of logical operation table 1 is saved to another pointer P11,
The start address of the subprogram is read from address P and stored in pointer P. If the operation type is return to the main program (RETURN), in FIG. 4, after the previously saved value of pointer P8 is stored in pointer P again,
In Figure 2, the address (P+2) and the number of parameters are 13.
t-read to determine the length of basic logic operation element 2, and advance pointer P to the beginning of the next basic logic operation element. In this way, after executing the basic logic operation element, jumping to the subprogram, and returning to the main program, the value of pointer P points to the start address of the basic logic operation element to be operated next, and the process is repeated again. By repeating the process of branching to the route corresponding to the operation type, the logical operation expression table 1 is sequentially interpreted and the operation is performed. If the calculation stock is ended (END), the calculation program ends its operation. In addition, in the execution of the basic logical operation, the output parameter 11, ma9, when referring to the parameter 14t,
In FIGS. 1 and 5, the value of the reference distinction flag 20 is 01. That is, in the case of a direct reference, the parameter of the basic logical operation element pointed to by the value of the pointer P is referenced, and the value of the reference distinction flag 20 is 1, that is, in the case of an indirect reference, the value of the pointer P is set to address (PS1+2). Refers to the address parameter plus the value of the parameter of the basic logical operation element pointed to by the value.

As a specific example of a logical operation expression, if we consider the main program 4 that uses the subprogram 5 in FIG. become.

In addition to this embodiment, a storage pointer PstPg.

. By providing a plurality of programs such as PRI + Psi, it is possible to refer to another subprogram multiple times within a subprogram.

〔Effect of the invention〕

According to the present invention, in a sequencer that includes a large number of similar logics, it is possible to create a common logic that can be used repeatedly in the same way as general logic, and one The common logic can be easily changed even after the sequencer is completed.

[Brief explanation of the drawing]

Figure 1 is a configuration diagram of the logical formula table of the present invention, Figure 2 is a conceptual diagram of the flow of a program that sequentially interprets and calculates the logical formula table, and Figure 3 shows the jump to the subprogram in Figure 2. Detailed flowchart, Figure 4 is a detailed flowchart of the part in Figure 2 that returns to the main program, Figure 5 is a detailed flowchart of the part in Figure 2 that refers to parameters in basic logical operations, and Figure 6 is a detailed flowchart of the sequencer. FIG. 7 is a concrete example of the contents of the logical formula table corresponding to FIG. 6. DESCRIPTION OF SYMBOLS 1...Logic operation formula table, 2...Basic logic operation element, 3...End element, 4...Sequencer logic block diagram, 5...Sub program logic block diagram, 6...
・・Main program logic operation formula table, 7...Sub program logic operation formula table, 20...Parameter reference distinction function Vp Figure 1 // Figure 2

Claims (1)

[Scope of Claims] 1. In a sequencer using a digital computer that performs operations while sequentially interpreting a table in which logical operation expressions formed by combining a plurality of basic logical operation elements are combined, a connection relationship is established by combining a plurality of the basic logical operation elements. In addition to the main program that defines the above, it has a sub-program that combines a plurality of the above-mentioned basic logic operation elements and defines the connection relationship in the same manner as the main program, and incorporates the name and parameters of the sub-program in the main program. A logic arithmetic device characterized in that it is further provided with a function of repeatedly referencing the subprogram.