JP2002333903A - Editing operation and data storing method in ladder programming editor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an editing operation and a data storing method for a ladder programming editor capable of holding stored data by recording block units, and performing data access by storage block units. SOLUTION: In this method for storing the editing operation and edited data at the time of preparing a ladder program in a storage area 21 or 31 of a memory 2 or a hard disk 3 or the like on a ladder programming editor 1 for preparing a ladder program for a programming controller, the editing operation and the edited data are stored by block (called storage block) units (1)...(n) in a fixed size.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a ladder programming editor for creating a ladder program for a programmable controller, and to a method for storing editing operations and editing data in creating a ladder program in a storage area such as a memory or a hard disk.

[0002]

2. Description of the Related Art FIG. 9 is a conceptual diagram of an editing operation at the time of creating a ladder program and a method of storing edited data in the prior art. In FIG. 9, reference numeral 1 denotes a ladder programming editor, which includes an operation input unit 11 and a storage data generation unit 12.
Holding. Reference numeral 2 denotes a memory which holds a storage data storage area 21. A hard disk 3 holds a storage data storage area 31. In the prior art shown in FIG. 9, an operation performed by the ladder program creator via an input device such as a mouse or a keyboard is received by the operation input unit 11 of the ladder programming editor 1 and stored based on the editing operation and the editing data. Data to be stored is generated by the data generation unit 12. The stored data is temporarily stored in the hard disk 3 via the memory 2 in addition to the editing operation and the editing data already stored.

[0003]

However, in the prior art, since all the stored data relating to the editing operation and the edited data are stored as one block on the hard disk, when the stored data is taken out, only a part of the data is taken out. Even if it is necessary, all data is accessed and unnecessary time is wasted. In particular, there is a problem that this phenomenon becomes remarkable as the storage data size increases. Furthermore, the data size that can be stored in the memory depends on the computer used, so that there is a problem in that the user cannot set an optimal environment for the user. In view of the above, according to the present invention, in the editing operation and the storage of the edited data, the storage data is held in a storage block unit, and the data can be accessed in the storage block unit so that the storage block size and the storage in the memory can be performed. A ladder program creator can also set the number of storage blocks, and an object of the present invention is to provide an editing operation and data storage method in a ladder programming editor that enables an optimum environment to be set for a user.

[0004]

According to a first aspect of the present invention, there is provided a ladder programming editor for creating a ladder program for a programmable controller, comprising: In a method of storing an editing operation and data in a ladder programming editor that stores data in a storage area such as a memory or a hard disk, the editing operation and the editing data are stored in blocks of a certain size (hereinafter, referred to as storage blocks). . According to a second aspect of the present invention, there is provided an editing operation and data storing method in the ladder programming editor according to the first aspect, wherein a predetermined number (hereinafter, referred to as a “number”) is set.
It is characterized in that a storage block of the maximum number of blocks can be stored in a memory (primary storage device).
According to a third aspect of the present invention, in the method for storing an editing operation and data in the ladder programming editor according to the second aspect, the editing operation and the editing data are newly stored in the memory. When the number of storage blocks exceeds the maximum number of blocks, the storage blocks that are stored in the memory are moved to the hard disk (secondary storage device) in storage block units in order from the storage block that is stored first, and a new editing operation is performed. And editing data can be stored on a memory. According to a fourth aspect of the present invention, in the editing operation and data storage method in the ladder programming editor according to the first or second aspect, a user of the ladder programming editor arbitrarily sets the size of the storage block and the maximum number of blocks. It is characterized by being possible.

[0005]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a conceptual diagram of an editing operation and a data storage method in a ladder programming editor according to an embodiment of the present invention. FIG. 2 is a conceptual diagram in the memory shown in FIG. FIG. 3 is a conceptual diagram of a current storage block in the memory shown in FIG. FIG. 4 is a conceptual diagram when new storage data is added to the state of the storage block shown in FIG. FIG. 5 is a conceptual diagram when data having a size larger than the current free area size is added to the state of the storage block shown in FIG. FIG. 6 is a conceptual diagram showing a state where data exists in all the storage blocks shown in FIG. FIG. 7 is a conceptual diagram of the storage blocks existing in the memory and the hard disk when new storage data is added to the state of the storage blocks shown in FIG. FIG. 8 is a conceptual diagram of the memory and the storage blocks existing in the hard disk when reading the storage data on the hard disk shown in FIG. In FIG. 1, an operation performed by an input device such as a mouse or a keyboard by a ladder program creator is received by an operation input unit 11 of a ladder programming editor 1, and based on an editing operation and editing data, a storage data generating unit 12 is executed. The data to be stored is generated. This storage data is held in the memory 2 with a storage block size set in advance. Memory 2
If the number of storage blocks exceeds the preset maximum number of storage blocks, the storage block (1) stored first among the storage blocks existing in the memory is moved to the hard disk 3, and new editing operation and editing are performed. Data can be stored on the memory. Here, the ladder program creator sets the storage block size and the maximum number of storage blocks in the memory to optimal values according to the system.

Next, details of the editing operation and the method of storing the edited data will be described with reference to the drawings. In FIG. 2, a storage block storage area 21 exists in the memory 2,
In the storage block storage area, storage blocks of a preset size exist for the preset maximum number of storage blocks. The storage data is in a state where the storage data is stored from the storage block (0) to the storage block (4) in order. Here, the stored head storage block number is the number of the storage block in which the storage data is stored first among the storage blocks in which the storage data is already stored. The stored final storage block number is the number of the storage block in which the storage data is stored last among the storage blocks in which the storage data is already stored.
The current storage block number is the storage block number currently storing the storage data. The maximum storage block number is the number of the maximum storage block including the storage block moved to the hard disk. In the case of FIG. 2, the stored top storage block number is (0), the stored last storage block number is (4), the current storage block number is (4), and the maximum storage block number is (4).

FIG. 3 shows the storage block of the current storage block number in FIG. 2, that is, the storage block (4). In the storage block (4), the registered data number NO
This is a state in which storage data from No. 20 to registration data number NO28 is stored. Here, the registered data number is a unique number assigned to the stored data, and is assigned from 0 in the order of registration. The registration data head number is the number of the head registration data stored in the storage block. The registration data final number is the number of the last registration data stored in the storage block. The current registration data number is a registration data number indicating the current pointer position on the memory. In the case of FIG. 3, the registration data start number is NO20, the registration data end number is NO28, and the current registration data number is NO29. A case where new storage data is added to the state of FIG. 3 will be described with reference to FIG. In FIG. 3, since the current storage block number is (4), data is stored in the storage block (4). The registration data number of this data is the next number of the registration data last number, that is, NO29, and is stored at the position of the current registration data number in the storage block (4). With the addition of the storage data described above, the last registered data number is changed to NO29, and the current registered data number is changed to NO30.

Next, an example in which data having a size larger than the free area of the storage block number (4) is added to the state of FIG. 4 will be described with reference to FIG. In FIG. 4, since the current storage block number is (4), data is to be stored in the storage block (4). However, since the size of the new storage data is larger than the free area size of the storage block (4). , Data is stored at the head of the next unused storage block, that is, the storage block (5). At this time, the free area of the storage block (4) is not used. The registration data number of this data is the number following the registration data final number, that is, NO30. With the addition of the storage data described above, the current storage block number is (5) and the registration data start number is N
O30, the last registered data number is changed to NO30, and the current registered data number is changed to NO31. Thereafter, these processes are repeated, and new data is stored in units of storage blocks. In FIG. 6, a storage block storage area 21 exists in the memory 2, and storage blocks of a predetermined size exist in the storage block storage area for a predetermined maximum number of storage blocks. The stored data is
In this state, all the storage blocks from the storage block (0) to the storage block (9) are fully stored. In the case of FIG. 6, the stored top storage block number is (0), the stored last storage block number is (9), the current storage block number is (9), and the maximum storage block number is (9). An example in which new storage data is added to the state of FIG. 6 will be described with reference to FIG. In FIG. 6, since the current storage block number is (9), data is to be stored in the storage block (9). However, since there is no free space in the storage block (9), the next unused storage block is used. , New storage data is stored at the beginning, but the storage blocks of the maximum number of storage blocks have already been used. Therefore,
The storage block first stored in the memory, that is, the storage block (0) is moved to the storage block storage area 31 of the hard disk 3, and is moved to the position on the memory where the storage block (0) existed. A new storage block (10) is created and the storage block (1) is created.
The new storage data is stored at the beginning of 0). With the addition of the above storage data, the stored first storage block number is changed to (1), the stored last storage block number is changed to (10), the current storage block number is changed to (10), and the maximum storage block number is changed to (10). Is done. The number of storage blocks stored on the hard disk (hereinafter referred to as hard disk storage block number) is (1), and the number indicating the pointer position on the current hard disk (hereinafter referred to as current hard disk position number) is (1). 1).

Next, a case where the stored data is read will be described. Data requested to be read (for example,
An example in which the storage block (0) is stored in the hard disk will be described with reference to FIG. The data read request attempts to expand the target storage block on the memory, but since the storage blocks of the maximum number of storage blocks have already been used, the storage block stored last on the memory, that is, Memory block (1
0) is moved to the position of the current hard disk position number in the storage block storage area 31 of the hard disk 3, and then the storage block finally stored on the hard disk is expanded to the position where the storage block (10) exists on the memory. I do. As described above, only the necessary storage blocks can be expanded from the hard disk to the memory and the target data can be accessed.

[0010]

As described above, according to the present invention,
As a method of storing the editing operation and the editing data on the memory and the hard disk, it is assumed that the data is stored in units of storage blocks each having a predetermined size.
The stored data can access only necessary storage blocks in units of storage blocks, so that unnecessary time is not spent on data access. In addition, the ladder programming editor user can freely set the size of the storage block and the maximum number of blocks held in the memory, so that the ladder programming editor user can create a program in the optimal environment according to the system used. There is an effect that can be performed.

[Brief description of the drawings]

FIG. 1 is a conceptual diagram of an editing operation and a data storage method in a ladder programming editor according to an embodiment of the present invention.

FIG. 2 is a conceptual diagram in a memory shown in FIG. 1;

FIG. 3 is a conceptual diagram of a current storage block in the memory shown in FIG. 2;

FIG. 4 is a conceptual diagram of a storage block when new storage data is added to the state of the storage block shown in FIG. 3;

5 is a conceptual diagram of a storage block when data having a size larger than the current storage block free space is added to the state of the storage block shown in FIG. 4;

6 is a conceptual diagram in a memory when data exists in all storage blocks shown in FIG. 2;

FIG. 7 is a conceptual diagram of a memory and a storage block on a hard disk when new storage data is added to the state of the storage block shown in FIG. 6;

8 is a conceptual diagram of a memory and a storage block on a hard disk when data stored on a hard disk is read in the state of the storage block shown in FIG. 7;

FIG. 9 is a conceptual diagram of an editing operation and a data storage method in a conventional ladder programming editor.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Ladder programming editor 2 Memory 3 Hard disk 11 Operation input unit 12 Storage data generation unit 21 Storage block storage area 31 Storage block storage area

Claims (4)

[Claims] 1. A ladder programming editor for creating a ladder program for a programmable controller, the editing operation for creating the ladder program and the editing operation and storage of data in a ladder programming editor for storing edited data in a storage area such as a memory or a hard disk. A method of storing an editing operation and data in a ladder programming editor, wherein the editing operation and the editing data are stored in blocks of a fixed size (hereinafter, referred to as storage blocks). 2. The method according to claim 1, wherein a predetermined number (hereinafter, referred to as a maximum number of blocks) of storage blocks are stored in a memory (primary storage device). An editing operation in a ladder programming editor and a method of storing data, wherein the data can be held. 3. The editing operation and data storage method in the ladder programming editor according to claim 2, wherein the number of storage blocks held on the memory is maximized by newly storing the editing operation and the edited data. When the number of blocks exceeds the number of blocks, the storage blocks that are stored in the memory are moved to the hard disk (secondary storage device) in units of storage blocks in order from the storage block stored first, and new editing operations and edited data are stored in the memory. A ladder programming editor and a method of storing data. 4. The editing operation and data storage method in the ladder programming editor according to claim 1 or 2, wherein a user of the ladder programming editor can arbitrarily set the size and the maximum number of storage blocks. Editing operation and data storage method in a ladder programming editor.