JPH05100720A - Managing device for program - Google Patents

Abstract

(57) [Abstract] [Purpose] To provide a program management device capable of shortening the time required to execute a program as much as possible. [Structure] The program in the source language of the source area 22 is compiled into an executable language by the compiler 18. At this time, when it is detected that the instructions read from the source area 22 are the store instructions “STR”, “STR NOT”, and the operation instructions “AND STR” “OR STR”, these instructions are stored in the accumulator 25 and the stack area 24. It is compiled as a transfer instruction between and.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a program management device such as a compiler which is provided in a programmable controller and converts a program written in a source language such as an assembler language into an execution format language such as a machine language.

[0002]

2. Description of the Related Art A programmable controller is used, for example, in a production line of a factory to sequence-control a large number of operating devices. The programmable controller includes a CPU (central processing unit) and a memory, and sequence control is performed by a so-called stored program method. A program input device called a programmer is connected to the programmable controller, and as an example, a program is input in a ladder diagram or an assembler language.

As an example, a program input in the assembler language is stored in the source area in the memory of the programmable controller in the form of the source language as the assembler language, and this program is compiled by a compiler provided in the programmable controller. , A machine language or the like, and is stored in the execution format area in the memory separately from the source area.

FIG. 3 to FIG. 5 are views for explaining the technique underlying the present invention. FIG. 3 shows the program example shown in Table 1 below in the form of a ladder diagram.

[0005]

[Table 1]

As an example in the above program, the store instruction "STR" stores the contents of the accumulator 1 in the uppermost position 3 of the stack area 2 as shown in FIG. Translated into the executable language to perform the operation. That is,
In FIG. 4A, the stack area 2 is pushed (PUSH).
4 (2), the contents of the accumulator 1 are stored in the uppermost position 3 of the stack area 2.

On the other hand, the instruction "OR" in the program
"STR" and "AND STR" perform the operation shown in FIG. That is, as shown in FIG. 5A, a logical operation such as a logical product operation or an logical sum operation is performed on the storage contents of the uppermost position 3 of the stack area 2 and the contents of the accumulator 1, and the operation result is again stored in the accumulator. Store in 1. Next, the stack area 2 is popped (POP) as shown in FIG.

[0008]

According to the instruction "STR" at the address "00" in the above program, the storage content of the accumulator 1 at the head of the program in which this instruction is executed is completely unrelated to the processing content in this program. , Data that does not need to be stored in the stack area 2. However, this instruction "STR" is compiled to perform the operation described with reference to FIG.
The instruction "STR" of "0" causes a wasteful operation and has a problem that the execution time of the program becomes long.

Further, although all the instructions for operating the stack area 2 are compiled so as to perform an operation of pushing (PUSH) or popping (POP) the stack area 2, generally, a microprocessor constituting a CPU of a programmable controller. As for the operation time of, the stack operation instruction has a longer operation time than the data transfer instruction, and in this respect also, there is a problem that the program execution time becomes longer.

An object of the present invention is to solve the above-mentioned technical problems and to provide a program management apparatus capable of shortening the time required to execute the program as much as possible.

[0011]

According to the present invention, there is provided a first storage means for storing a program in a source language, a second storage means for storing the program in an execution format language, and a program from the source language to the execution format language. A stack pointer used only for conversion and a language conversion means for converting a source language program into an execution format language, and instructions read from the first storage means in the order of addresses are specific instructions for operating the stack area. An instruction discriminating means for discriminating whether or not there is, and a specific instruction for converting the instruction discriminated as the specific instruction by the instruction discriminating means into an execution format instruction corresponding to a transfer process between the accumulator and the stack area designated by the stack pointer. Immediately after the conversion means and the specific instruction conversion means operate, a stack pointer operator for increasing or decreasing the value of the stack pointer A management device program characterized by comprising a such a language conversion means comprising and.

The present invention also includes a first storage means for storing the program in the source language, a second storage means for storing the program in the execution format language, and a language conversion for converting the source language program into the execution format language. Means for determining whether the instruction read in the address order from the first storage means is a specific instruction for operating the stack area, and whether the read instruction is the head of the program The command position discriminating means for discriminating between the instruction position discriminating means, the instruction discriminating means and the instruction position discriminating means store the data for designating the specific instruction which is determined to be the instruction which is located at the head of the program and stores the data in the stack area, in the accumulator. And a language conversion means including specific instruction conversion means for converting into an executable format instruction corresponding to the processing It is the lamb of the management apparatus.

[0013]

According to the present invention, the program is stored in the first storage means in the source language, the program is converted into the execution format language by the language conversion means, and is stored in the second storage means. Here, the program stored in the first storage means is read in the order of addresses, and the instruction determination means determines whether or not it is a specific instruction for operating the stack area. The instruction determined by the instruction determining means as the specific instruction is converted by the specific instruction converting means into an executable instruction corresponding to the transfer process between the accumulator and the stack area designated by the stack pointer. When the specific instruction converting means operates as described above, immediately after that, the stack pointer operating means increases or decreases the value of the stack pointer.

That is, when the specific instruction is converted into an executable format instruction, push (PU) in assembler language is executed.
It has not been converted into an execution format instruction corresponding to a so-called stack operation instruction such as an SH) instruction or a pop (POP) instruction, but is converted into the transfer instruction and the stack pointer increase / decrease instruction. The transfer instruction has a shorter operation time than the stack operation instruction, which reduces the execution time of the program in the executable language.

In the language conversion means, the instruction read from the first storage means is discriminated by the instruction discriminating means as the specific instruction, and by the instruction position discriminating means as the instruction at the head of the program. Then, the specific instruction converting means converts the specific instruction into an execution format instruction corresponding to the process of storing the designated data in the accumulator. In other words, if the instruction to store data in the stack area is at the beginning of the program, the meaningful data to be stored does not exist in the accumulator, and the execution instruction corresponding to the instruction in which the particular instruction stores data in the stack area. It is possible to prevent a situation in which unnecessary operations are performed after being converted into an instruction, and this can also reduce the operation time of the program in the execution format language.

[0016]

1 is a block diagram showing the configuration of a programmable controller 11 according to an embodiment of the present invention. The programmable controller 11 includes a control unit (CPU, central processing unit) 12 including a microprocessor, and the control unit 12 is provided with a stack pointer 13. The control unit 12 has an input port 15 having a plurality of input terminals 14 to which external input means such as various switches and buttons are connected, and an external controlled device such as a solenoid valve and a lamp. And the like are connected to an output port 17 having a plurality of output terminals 16 respectively connected to the above.

The control unit 12 controls a compiler 18 provided in the programmable controller 11, and is connected to a memory 19 realized by a RAM (random access memory) or the like, and serially communicates with a programmer 20 as a program input device. An interface circuit 21 for performing the above is connected.

In the memory 19, for example, a source area 22 for storing a program input in a format such as a source language such as an assembler language from the programmer 20, and an execution format such as a machine language for the program in the source area 22 by the compiler 18. An execution format area 23 converted into a language and stored, and an attack area 24 are set.

The present embodiment is characterized by a conversion function when the compiler 18 compiles a source language program stored in the source area 22 into an executable format language program.

FIG. 2 is a flow chart for explaining the operation of this embodiment, and the operation of compiling a program in the source language into a program in the execution format language will be described. In step a1, the value of the stack pointer 13 is initialized before starting the compilation. In step a2, the program previously input in the source language format from the programmer 20 and stored in the source area 22 is read out for each address. In the following description, it is assumed that the source area 22 stores the program examples shown in Table 1 above. In step a3, it is determined whether the read instruction is a store instruction "STR" or a store instruction "STR NOT". The instruction “STR 1” is read from the address “00” of the source region 22, the determination in step a3 becomes affirmative, and the process proceeds to step a4.

At step a4, it is judged whether or not this instruction is the head of the ladder diagram shown in FIG. 3, which is equivalent to the program of Table 1. That is, the above-described store instruction is not only at the beginning of the entire program stored in the source area 22, but also when the program in the source area 22 is a ladder diagram as shown in FIG. The determination in step a4 is affirmative. Store instruction "S
The "TR" or store instruction "STR NOT" is basically the same as described with reference to FIG.
The content of the operation of pushing (PUSH) the contents of the accumulator 25 to the stack area 24. However, in the case of being located at the beginning of the ladder diagram in this way, the contents of the accumulator 25 stored in the stack area 24 are It makes no sense, and therefore the push operation is a useless operation.

In this embodiment, in such a case, step a
5, the store instruction "STR" and the store instruction "S"
"TR NOT" is compiled into an executable instruction corresponding to the "instruction for storing the specified data in the accumulator 25". After that, the process returns to step a2 to read the instruction again.

If the determination at step a4 is affirmative,
Since the store instruction arranged at a position other than the beginning in the program needs to store the contents of the accumulator 25 in the stack area 24, in the present embodiment, the store instruction is changed to "stack pointer 1" in step a6.
3 is an instruction to store the contents of the accumulator 25 at the position on the memory 19 ".

That is, the instruction in such an execution format language is a transfer instruction, and is not an instruction corresponding to a push (PUSH) instruction or a pop (POP) instruction for the stack area 24. That is, in terms of the operation speed of the microprocessor, the transfer instruction is faster than the stack operation instruction, which improves the operation speed of the program in the execution format language. After this, the process is step a.
7, the compiler 18 moves the stack pointer 13
Is incremented by 1, and the process proceeds to step a5, and the data designated as described above is stored in the accumulator 25.
Compile the instructions to transfer to. After that, the process returns to step a1.

If the judgment in step a3 is negative,
The process proceeds to step a8, and the read instruction is the operation instruction “AND STR” or the operation instruction “OR ST
It is determined whether or not it is either "R". If this judgment is negative, the process proceeds to step a9, each read instruction is compiled into the execution format language corresponding to the instruction, and the process returns to step a2. If the determination at step a8 is affirmative, then at step a10, the arithmetic instruction is "AND (logical product) or OR with respect to the address contents in the memory 19 currently indicated by the stack pointer 13 and the contents of the accumulator 25. Compile into an execution format language corresponding to an instruction that performs a logical operation such as (logical sum). After that, the process proceeds to step a11, the value of the stack pointer 13 is decremented by 1, and the process returns to step a2.

That is, in this case, in the conventional example, the pop (POP) of the stack area is performed as described with reference to FIG.
Although it is an instruction to perform processing, in the present embodiment, the contents of the data transfer processing as described above are compiled.

As described above, in this embodiment, the store instructions "STR", "STRNOT" and the operation instruction "AND" are used.
This is realized as a transfer process between the stack area 24 designated by the stack pointer 13 and the accumulator 25 when compiling instructions such as “STR” and “OR STR”. As a result, the calculation speed of the program is significantly improved.

[0028]

As described above, according to the present invention, the program is stored in the first storage means in the source language, the program is converted into the execution format language by the language conversion means, and stored in the second storage means. It Here, the programs stored in the first storage means are read in the order of addresses,
The instruction determining means determines whether the instruction is a specific instruction for operating the stack area. The instruction determined by the instruction determining means as the specific instruction is converted by the specific instruction converting means into an executable instruction corresponding to the transfer process between the accumulator and the stack area designated by the stack pointer. When the specific instruction converting means operates as described above, immediately after that, the stack pointer operating means increases or decreases the value of the stack pointer.

That is, when the specific instruction is converted into an executable format instruction, push (PU) in assembler language is executed.
It has not been converted into an execution format instruction corresponding to a so-called stack operation instruction such as an SH) instruction or a pop (POP) instruction, but is converted into the transfer instruction and the stack pointer increase / decrease instruction. The transfer instruction has a shorter operation time than the stack operation instruction, which reduces the execution time of the program in the executable language.

In the language conversion means, the instruction read from the first storage means is discriminated by the instruction discriminating means as the specific instruction, and by the instruction position discriminating means as the instruction at the head of the program. Then, the specific instruction converting means converts the specific instruction into an execution format instruction corresponding to the process of storing the designated data in the accumulator. In other words, if the instruction to store data in the stack area is at the beginning of the program, the meaningful data to be stored does not exist in the accumulator, and the execution instruction corresponding to the instruction in which the particular instruction stores data in the stack area. It is possible to prevent a situation in which unnecessary operations are performed after being converted into an instruction, and this can also reduce the operation time of the program in the execution format language.

[Brief description of drawings]

FIG. 1 is a block diagram of a programmable controller 11 according to an embodiment of the present invention.

FIG. 2 is a flowchart illustrating the operation of this embodiment.

FIG. 3 is a ladder diagram showing a technique underlying the present invention.

FIG. 4 is a diagram illustrating processing contents of a push (PUSH) instruction of a stack.

FIG. 5 is a diagram showing the processing contents of an arithmetic instruction “ANT STR”.

[Explanation of symbols]

 11 programmable controller 12 control unit 13 stack pointer 14 input terminal 15 input port 16 output terminal 17 output port 18 compiler 19 memory 20 programmer 21 interface circuit 22 source area 23 execution format area 24 stack area 25 accumulator

Claims (2)

[Claims] 1. A first for storing a program in a source language
Storage means, second storage means for storing the program in an executable language, stack pointers used only when converting the program from the source language to the executable language, and converting the source language program into the executable language An instruction discriminating means for discriminating whether or not the instruction read out in the address order from the first storing means is a specific instruction for operating the stack area; and an instruction discriminated by the instruction discriminating means as the specific instruction. To a specific instruction conversion unit for converting an execution format instruction corresponding to a transfer process between the accumulator and the stack area designated by the stack pointer, and immediately after the specific instruction conversion unit operates, the value of the stack pointer is increased or decreased. A program including a language conversion means including a stack pointer operating means. Management apparatus. 2. A first method for storing a program in a source language
Storage means, second storage means for storing the program in an execution format language, and language conversion means for converting a source language program into an execution format language, the instructions being read in the address order from the first storage means. An instruction discriminating means for discriminating whether or not it is a specific instruction for operating the stack area, an instruction position discriminating means for discriminating whether or not the read instruction is the head of the program, an instruction discriminating means and an instruction position discriminating means Includes a specific instruction conversion unit that converts a specific instruction located at the head of the program and determined to be an instruction to store data in the stack area into an execution format instruction corresponding to the process of storing the designated data in the accumulator. A program management device including such language conversion means.