JPS62284403A - Preparing method for cross reference data - Google Patents

Abstract

PURPOSE:To rapidly prepare cross reference data with low cost by successively assigning step numbers to instruction codes for a sequence program to specify the using positions of addresses and finding out all the number of printing lines printed on one page. CONSTITUTION:The step numbers are successively assigned to respective instruction codes for the sequence programs SQP to specify the using positions of the addresses and addresses (X0, 2, X1, 2...) to be used for the SQP are found out and arranged in the descending order. Then, the numbers Ni (i=1, 21...) of times of using respectively addresses and all addresses ANi to be printed out on one page are successively found out to form a search address table SAT and a cross set pointer table CSP for storing the printing start lines PRi of respective addresses and the number Mi of times used up to the current point of time is simultaneously formed. Then, addresses or symbols are stored in respective PRi position of a print buffer PBM, the instruction codes of respective addresses printed out in one page are found out by scanning the SQP and the step numbers are successively stored in the PBM and printed out by referring the CSP.

Description

[Detailed Description of the Invention] 3. Detailed Description of the Invention (Field of Industrial Application) The present invention relates to a method for creating cross-reference data,
In particular, the present invention relates to a method of creating cross-reference data indicating where in a sequence program an address for storing a logical value specifying on/off status of a relay contact or a relay coil on a ladder diagram is used.

<Prior Art> In a numerical control system, each mechanical element of a machine tool is controlled based on an NC device 1fi or a run command. Controlling the transmission and reception of signals between the NC device and the machine tool is executed by a programmable machine controller (PMC device) provided on the NC device based on a sequence program.

This sequence program is a logical program of the functions of the high-power circuit that controls data exchange between the NC device side and the machine tool using instruction codes and operands.
The ladder diagram, which is part of the high-voltage circuit shown in the figure, is programmed with the 21 Monik code as shown in FIG. In the ladder diagram, 0 indicates the relay coil, the yoke indicates the make relay contact, and the halberd indicates the break relay contact. Also, RD, OR, AND in the sequence program.

WRT, AND-NOT, 0R-NOT... are each instruction codes, RD is a read instruction (read instruction), AND is an AND operation instruction, WRT is a write instruction (write instruction), OR is an OR operation instruction, AND -NOT is a logical product operation instruction with a negative value, OR-
NOT is an OR operation instruction with a negative value.

Also, the alphanumeric characters MF, M28. marked above the relay contacts and relay coil. ... AUT, MO3, ... are symbols (relay names), and the logical values ("1" or "O") that specify their on/off are the workpieces marked under each relay contact and relay coil. stored at an address in memory. Note that the address is represented by a number with a decimal point, and the specified location in the work memory (number above the decimal point),
Indicates a predetermined bit (number below the decimal point).

When programming the sequence program, use the symbol (relay name) 9! Although the symbol is created using an instruction code as an operand, the symbol is finally converted into an address using a symbol-address correspondence table (see FIG. 7).

The logical operations M2R, M14, M12, and Mll are executed by the instruction group of the PRA part of the sequence program shown in Figure 6, and the operation result ("1" or "
On) is the operand MQ accompanying the write command WELT.
3 at a predetermined location in the work memory corresponding to 1-(
AUT-MO3/5PCCW is executed by the instruction group in the PRB part, and the result of the operation is stored at the specified address in the work memory specified by operand 5PCW accompanying the write instruction WRT. It is stored in a predetermined bit (5th bit at address 20).

<Problem to be solved by the invention> Now, when a sequence program is created, a ladder diagram is printed out using the sequence program, depacked using the ladder diagram, and if there is an extracurricular error, it is corrected. Finally, create a complete sequence program.

Additionally, if a problem occurs during operation, the ladder diagram is used to investigate the problem and perform maintenance work.

By the way, the same symbol (address) is used not only in one place but in many places.

However, as shown in Figure 5, the output ladder diagram includes relay contact and relay coil symbols, symbols, and memory locations [
(address) only.

Therefore, if you delete all symbols (addresses) during debugging, or if you want to correct them all with another symbol (address), you cannot easily search for the symbols (addresses), making depacking troublesome, and Trouble investigation and maintenance work are also troublesome and require a considerable amount of time.

In particular, in a ladder diagram that spans dozens of pages, the above-mentioned drawbacks become more and more noticeable because it is necessary to search for a predetermined symbol (address) across all the pages.

Therefore, a function is required to create and output cross-reference data indicating where each symbol (address) is used in the sequence program.

This cross-reference data can be created in a relatively short time by increasing the capacity of the work RAM, but this is not preferable because a large-capacity work RAM is required just to create the cross-reference data, which increases costs.

Furthermore, if the capacity of the work RAM is made small, it will take a considerable amount of processing time to create cross-reference data, which poses a practical problem.

From the above, an object of the present invention is to create a cross reference data that can quickly generate cross reference data indicating where in a sequence program a symbol (address) which is an operand of each instruction is used using a small work RAM. The objective is to provide a method for creating reference data.

Means for Solving the Problems> FIG. 1 is a schematic explanatory diagram of the cross-reference data creation method of the present invention.

SQP is a sequence program, SAT is all address names printed on one page A N i
(i = 1, 2, ...) and the number of times the address is used in the sequence program Ni (
i=1.2. ), PBM is a print buffer memory that stores one page's worth of cross-reference data, and CS P l! This is a cross set pointer table that indicates the position where cross reference data is set in the print buffer. In addition, the cross-set pointer table C3P shows the printing start line PRi (i=1°2, . . . ) and the number of times of use to date Mi (i=1.2°) corresponding to each address printed on one page. ...) is remembered.

Function> It is assumed that a step number is sequentially attached to each instruction code of the sequence program SQP from the beginning, and the step number indicates the address usage position.

Find the addresses (Xo, 2.Xi, 2.-1) used in the sequence program SQP and arrange the addresses in descending order.

Next, find the number of times the sequential address is used in the sequence program, and use the number of lines that can be printed on one page, the number of step numbers that can be printed on one line, and the number of times the address is used. Create a search address table SAT to find all address names printed on the page,
At the same time, the print start line PRi of each address is determined and a cross set pointer table C3P is created.

Thereafter, the corresponding address name and symbol are stored in each print start line position of the print buffer PBM, and the sequence program is scanned to obtain an instruction code using each address to be printed on the first page as an operand, and the step is executed.・Cross set pointer table C3 for the knob number
P is referenced and sequentially stored in the step number storage location in the print buffer PBM, and after the sequence program scan is completed, the contents of the print buffer are printed, and the same process is performed for the next page thereafter.

<Example> Figure 2 is a block diagram of a sequence program creation device.
FIG. 3 is a flowchart of the process of the present invention, and FIG. 4 is an example of printout of cross reference data.

In FIG. 2, numeral 11 is a main body section having a microcomputer configuration;
Processor 11a, ROMI 1b, RAM 11
c, has working memory lid.

12 is a printer, 13 is a display device, 14 is a keyboard, 15 is a floppy disk device, 15m, 15
b is a floppy disk.

A loading program is stored in the ROM 11b of the main body 11. Prior to creating a sequence program, a system program for creating a sequence program is read from a predetermined floppy disk under the control of the loading program and stored in the RAM 11c.

As a result, the processor lla thereafter executes processing based on the control of the system program, displays processing results and various instructions on the display device 13, and also displays data, commands, etc. input from the keyboard 14. Executes predetermined processing, creates a sequence program, and outputs it to a medium such as a 4P disk.

Further, the processor lla creates a ladder diagram and cross reference data using the created sequence program, and prints them out from the printer 12.

The cross-reference data creation process will be explained below with reference to FIGS. 1 to 4.

It is assumed that the operands (addresses) of each instruction code that make up the sequence program SQP (see Figure 1) are expressed by a decimal point digit with one alphabet (for example, X, R), and the alphabet X is expressed on the machine side. R indicates a signal output from the internal work relay area, and R indicates a signal to be stored in the internal work relay area. In addition, it is assumed that the alphabet to be used is registered in the head character table, and that the sequence program SQ
Assign a step number to each instruction code of P sequentially from the beginning,
The step number indicates the location where the address is used.

(1) Read one alphabet from the head character table. To read the alphabet X.

(2) Next, all addresses having the head character are searched from the sequence program SQP (first examination [).

(3) When the search is completed, the addresses are sorted in descending numerical order and the number of addresses CNT is determined.

(4) If the maximum number of addresses that can be printed on one page is n, then
Check whether CNT≧n.

(5) If CNT < n, check whether another alphabet (for example, R) exists in the head character table, and if so, repeat the process from step (1).

(6) If CNT≧n in step (4), or if another alphabet does not exist in step (5), calculate N1 the number of times the address is used in the sequence program SQP in the order of arrangement in step (3). At the same time, by using the number R of lines that can be printed on one page, the number N of step numbers that can be printed on one line, and the number of times Ni of the address is used, all address names to be printed on one page are found and the search address is calculated. Create table 5AT (see Figure 1), and at the same time find the print start line PRi of each address, cross set pointer table csp (Figure 1)
Create.

In addition, for one address, one line is required to print the address name and symbol, etc., and one line is required to provide a blank line, so the total, the following formula % formula % ] is the cross reference data of one address required for printing. However, in the above formula, []1N□ is an integer rounded up.

Therefore, the first print start line printed on page 1 is PR
If i, then the printing start line PR(i+1) at the (i+1)th address is expressed by the following formula. Further, if the following formula R≦ΣR1 1n/ is satisfied for the m-th address, addresses up to the (m-1)th address can be printed on one page.

(7) After printing, set [CNT-(m-1)→CNT and correspond to each print start line position PRi (i=1.2.-- (m-1)) of the print buffer PBM. The address name and symbol are memorized, and then the sequence program SQP is scanned.

(8) Every time an address is identified by the sequence program, it is determined whether the address is an address in the search address table SAT.

(9) If the address is in the search address table SAT, update the number of uses Mi of the current name of the address stored in the cross-set pointer table C3P using the following formula % formula %, and add the number of uses Mi and one line. The print position is determined using the number of printable steps N and the print start line PRi of the address, and the step number of the instruction code whose operand is the address is stored in the storage position of the print buffer PBM corresponding to the print position.

That is, the (P Ri + [M i / N],
, □), the step number is stored in the [M i / N] F1-th position. However, []8 is the remainder in the division.

(After the field, check whether the scanning of the sequence program has finished. If it has not finished, repeat the process from step (8) onwards.

(11) If the scanning of the sequence program is completed, print the contents of the print buffer PBM (one page worth of cross reference data) (see FIG. 4).

(12) After that, check whether printing of all cross reference data has been completed, and if not, clear the contents of search address table SAT to cross set pointer table C3P and print buffer PBM, and proceed to step (4). The following process is repeated to print out the cross reference data.

<Effects of the Invention> According to the present invention, cross-reference data indicating where in a sequence program an address (symbol) that is an operand of each instruction is used can be generated at high speed using a small-capacity work RAM. , can be printed out.

[Brief explanation of the drawing]

Fig. 1 is a schematic explanatory diagram of the cross-reference data creation method of the present invention, Fig. 2 is a block diagram of the sequence program creation device, Fig. 3 is a flowchart of the processing of the invention, and Fig. 4 is a diagram according to the invention. Examples of Cross Reference Data Output FIGS. 5 to 7 are sequence program explanatory diagrams. SQP...Sequence program, SAT...Search address table, PBM...Print buffer memory 1 csp6. Cross set pointer table patent applicant
Agent for FANUC Co., Ltd.
Patent Attorney Chiki Saito Figure 2 Figure 7

Claims (1)

[Claims] In a sequence program created using an instruction code whose operand is an address that stores a logical value that specifies ON/OFF of a relay contact or relay coil on a ladder diagram, where in the sequence program is the address specified? In the cross-reference data creation method that creates cross-reference data indicating whether the address is used, a step number is sequentially assigned to each instruction code of the sequence program from the beginning, and the position where the address is used is specified by the step number. In order, find the number of times the address is used as an operand, and also calculate the number of lines that can be printed on one page and 1
Using the number of step numbers that can be printed in a line and the number of times the address is used, find all the address names to be printed on one page and their print start line, and write the address name to each print start line position in the print buffer. At the same time, scan the sequence program to obtain an instruction code that uses each address printed on the first page as an operand, sequentially store the step number in the step number storage position in the print buffer of the address, and read the sequence program. A cross-reference data creation method characterized by printing the contents of a print buffer after scanning is completed, and performing similar processing for the next page.