JP2001325146A - Method for storing information table and storage structure - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an information table storing method and storage structure capable of storing positional information in one byte, optionally setting up the arrangement and size of an information table and shortening processing time. SOLUTION: Plural information tables T are arranged on storing positions MP of a memory M successively from the head in every other positions in the order of usage without generating space and positional information P consisting of a relative address to the storage position MP of an information table T to be used next is also stored in each information table T stored in each storage position MP.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and a structure for storing an information table, and more particularly to a method and a structure for storing an information table suitable for controlling the operation of a printing apparatus or the like.

[0002]

2. Description of the Related Art It is generally known that input / output devices such as a display device, a printing device, a keyboard, and a mouse are connected to a computer or the like, and the operation of the input / output devices is controlled by the computer. In the output device, a plurality of information tables are formed by analyzing data output from a computer or the like as a higher-level device based on a program and stored in the memory, and these information tables are retrieved from the memory in the order of use. To execute the operation described in the information table.

[0003] For example, as shown in FIG. 3, the number of information tables T is determined in the order of use as shown in FIG.
1, T2, T3, and T4, the information tables T1, T2, T3, and T4 are stored in the storage locations MP of the memory M.
In FIG. 3, the information tables T1, T2, T3, and T4 are arranged (stored) in the order of use from the top, which is the uppermost side in FIG.
Is done. Then, when using the information table T,
As shown by arrows in FIG. 3, the information tables T1, T2,
Are used in the order of T3, T4, T1,.

In such a conventional storage structure in which the information tables T are stored in the memory M in the order of use, the information table T1 is used after the information table T4, but when the information table T is used, the next information table T is used. (To call the next information table T), the information table T1
Must be determined, and the processing time becomes longer. Further, the storage position MP of the memory M for storing each information table T, specifically, the address of the memory M is fixed, so that the degree of freedom in creating a program is reduced, and the usability of the memory M is not good.

In order to deal with such a problem, as shown in FIG. 4, information tables T1, T2, T3, and T4 arranged in the order of use in the storage location MP of the memory M respectively include information to be used next. The position information P of the table T, specifically, the position information P2 representing the storage position MP2 of the information table T2 to be used next to the information table T1, and the storage position MP3 of the information table T3 to be used next to the information table T2 , The position information P4 indicating the storage position MP4 of the information table T4 to be used next to the information table T3, and the position information indicating the storage position MP1 of the information table T1 to be used next to the information table T4. A configuration in which P1 is added can be easily considered. As the position information MP at this time, an absolute address or a relative address of the storage position MP of the memory M that stores the information table T can be used.

The absolute address of the storage position MP of the memory M that stores the information table T is the head address of the storage area of the memory M that stores the information table T. The relative address of the storage position MP of the memory M that stores the information table T is the head address of the storage area of the memory M that stores the information table T, and the storage address of the memory M that stores the information table T to be used next. This is the difference between the start address of the area and both addresses.

The capacity of each storage area of the memory M for storing each information table T to which the position information P is added is, for example, 16 bytes.

By using the storage structure of the information table T to which the position information P is added, it is determined whether or not to return to the information table T1 arranged at the head of the memory M every time the information table T is moved. Since it is not necessary to execute the determination, the processing time can be shortened accordingly.

[0009]

However, in the above-described conventional information table storage structure in which the position information P is simply added to the information table T, it is necessary to return to the information table 1 every time the information table T is moved. Since it is not necessary to execute the determination as to whether or not the memory M can store the information table T, the processing time can be shortened accordingly.
Is fixed, the information table T
The arrangement and size of the memory M cannot be freely set, the degree of freedom in creating a program is reduced, and the problem that the memory M is not easy to use cannot be dealt with at all.

When the size of the entire table composed of a plurality of information tables T increases, the position information T
Will not fit in one byte. For example, the relative address from the information table T4 constituting the position information P4 to the information table T1 becomes the largest, and if this value exceeds 256, it will not fit in one byte.

Further, as the number of information tables T increases, the moving distance when moving from the information table T4 to the information table T1 increases, and when a plurality of information tables T are used repeatedly in a loop, the overall There is also a problem that the processing time becomes long.

Therefore, a storage method of an information table which can store position information in one byte, can freely set the arrangement and size of the information table, and can shorten the processing time And a memory structure is required.

The present invention has been made in view of these points, and can store position information in one byte, and can freely set the layout and size of an information table. It is an object of the present invention to provide an information table storage method and storage structure that can reduce the time.

[0014]

In order to achieve the above-described object, a feature of the information table storage method according to the present invention is that a plurality of information tables are arranged at every other position from the head of the storage position of the memory, and a gap is formed in the use order. And the position information formed by the relative address to the storage position of the information table to be used next is added to each information table. By adopting such a configuration, the information tables in which the use order of the plurality of information tables is adjacent to each other can be arranged so that the storage position of the memory is closest to the other. Can be stored in one byte, the arrangement and size of the information table can be freely set, and the processing time can be shortened.

Further, the feature of the storage structure of the information table according to the present invention is that a plurality of information tables are stored in the storage position of the memory at every other position from the head side and are arranged in the order of use without any gaps. The information tables stored in the storage locations are each stored with location information including a relative address to the storage location of the information table to be used next. By adopting such a configuration, the information tables in which the use order of the plurality of information tables is adjacent to each other can be arranged so that the storage position of the memory is closest to the other. Can be stored in one byte, the arrangement and size of the information table can be freely set, and the processing time can be shortened.

[0016]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below with reference to embodiments shown in the drawings.

FIG. 1 is an explanatory diagram showing the structure of an embodiment of a memory to which a storage structure of an information table is applied using a method of storing an information table according to the present invention.

In the present embodiment, the storage structure of the information table T using the information table storage method according to the present invention is described in the following manner.
T3, T4, T5, and T6.

As shown in FIG. 1, in the memory M to which the information table storage structure of the present embodiment is applied, six information tables T1, T2, T3, T4, T5, and T6 are shown at the top in FIG. Information tables T1, T2, T3, T4, T5, T
6 are arranged (stored) without gaps in the order of 6.

More specifically, in order to store a plurality of information tables T so as to be arranged without a gap from the top of the memory M, the memory M has the same number as the number of information tables T. Since the number of T is six, six storage locations MP of the information table T are set. The capacity of the storage area at each of these storage locations MP is:
For example, they are all formed in the same 16 bytes.

Then, as shown in FIG.
One of the storage locations MP is MP1, MP2, MP3, MP4, MP5, M in order from the top shown in FIG.
In the case of P6, the information table T1 having the first use order is arranged at the storage position MP1 located at the top of the storage position MP of the memory M shown in FIG.

Next, the information table T2 having the second use order is a storage location M where the information table T1 is located.
The storage location MP2 adjacent to the downstream side of P1 in FIG. 1 and located from the top in FIG.
It is located at the storage location MP3 located at the second position.

Next, the information table T3 having the third use order is a storage location M where the information table T2 is arranged.
The storage location MP4, which is located on the downstream side of P3 in FIG. 1 and located fourth from the top in FIG.
It is located at the storage location MP5 located at the second position.

Next, the information table T4 having the fourth use order is a storage location M where the information table T3 is arranged.
Since only one storage location MP4 is located downstream of P5, it is located at storage location MP6 since it is the lowest location in FIG. 1 adjacent to the location downstream of storage location MP5 where information table T3 is located. Is done.

Next, the information table T5 having the fifth use order is a storage location M where the information table T4 is arranged.
Since there is no empty storage location MP on the downstream side of P6, the process returns to the upstream side to exceed the used storage location MP5, and FIG.
Vacant storage location M located fourth from above
It is located at P4.

Next, the information table T6 whose use order is the sixth is the storage location M where the information table T5 is located.
It is located at the storage location MP2, which is adjacent to the upstream side of P4 and is located second from the top in FIG. 1, beyond the storage location MP3 located at the third location from the top in FIG.

That is, in the present embodiment, a plurality of information tables T are arranged from the beginning of the storage position MP of the memory M at every other position and are arranged without gaps in the order of use. The first information table T is arranged, and thereafter, the information tables T are arranged in the order of use at every other storage location MP toward the storage location MP located at the end of the memory M, and the storage location MP located at the end is located. After use, the information tables T are arranged at every other storage location MP in the order of use from the end to the beginning of the memory M, so that the information tables T are arranged at all the storage locations MP. .

The first information table T in the use order
May be stored in the storage location MP of the second memory from the top of the storage location MP of the memory M.

The number of information tables T, the number of storage locations MP of the memory M in which the information tables T are arranged, and the like are optional except for zero according to the specifications of the apparatus using the information tables T and the design concept. In particular, the present invention is not limited to the number of information tables T and the number of storage locations MP of the memory M where the information tables T are arranged in the present embodiment. Furthermore, the capacity of the storage area for storing the information table T may be set as required according to the specifications of the apparatus using the information table T, design concept, and the like.

As described above, by arranging a plurality of information tables T every other one from the head of the storage position MP of the memory M and arranging them without any gap in the order of use, the plurality of information tables T
Of the information tables T whose use order is adjacent to each other,
The memory M can be arranged so that the storage position MP of the memory M is closest.

That is, to arrange a plurality of information tables T one after another from the head of the storage position MP of the memory MP and to arrange them without a gap in the order of use, the order of use among the plurality of information tables T is adjacent to each other. This is to arrange the information table T so that the storage position MP of the memory M is closest to each other, thereby shortening the moving distance between the storage positions MP when using the information table T and shortening the processing time. To increase the processing speed.

Each of the information tables T of the present embodiment has a storage location MP of the information table T to be used next.
And the position information P formed by the relative address with respect to the above.

That is, as shown in FIG. 1, each of the information tables T1, T2, T3, T4, T5, T6 includes:
The position information P of the information table to be used next, more specifically, the information table T2 to be used next to the information table T1
Is stored as position information P2 (P2 = MP3-MP1 = 32 (P
2 = 20H: H indicates a hexadecimal number, the same shall apply hereinafter)), position information P3 (P3 = MP5-MP3 = 32 (P3 = 20
H)), position information P4 (P4 = MP6−MP5 = 16 (P4) formed by the relative address of the information table T3 and the storage position MP6 of the information table T4 to be used next.
4 = 10H)), and position information P5 (P5 = MP4−MP6 =
-32 (P5 = E0H)), and position information P6 (P6 = MP2) formed by the relative address of the information table T5 to the storage position MP2 of the information table T6 to be used next.
−MP4 = −32 (P6 = E0H)), information table T
6, the storage location M of the information table T1 to be used next
Position information P1 (P
1 = MP1-MP2 = −16 (P1 = F0H) is added.

That is, the relative address of the storage position MP of the memory M for storing the information table T
Is the difference between the start address of the storage area of the memory M storing the information table and the start address of the storage area of the memory M storing the information table T to be used next.

Here, the calculation of the position information P of the information table T will be described.

The calculation operation of the position information P of the information table T is performed by calculating the address of the storage position P of the information table T stored in the memory M and the storage position M of the information table T to be used next.
It starts by calculating the difference value with the address of P. A hexadecimal number is used to calculate the difference value of the address of the storage position P in the memory M.

Next, the bit length of the difference value represented by a hexadecimal number is extended without changing the code.

Since the difference value is represented by 8 bits, the most significant bit 7 becomes a sign bit. Next, a 16-bit operation is performed to calculate the address of the information table T to be used. If necessary, the upper 8 bits are filled with sign bits in order to express the difference value with 16 bits. Thus, the difference value represented by the 8 bits can be converted into a difference value represented by 16 bits. Further, when it is necessary to perform an operation with 32 bits, the upper 24 bits are converted in the same manner as when converting to 16 bits.
By filling bits with sign bits, sign extension can be performed so that the operation can be performed with 32 bits.

Next, by adding the sign-extended difference value to the address of the storage position MP of the information table T stored in the memory M, the relative address of the storage position MP of the information table T to be used next is obtained.

The calculated relative address is added to the information table T as position information P, and the return value is used as the address of the information table T to be used next.

When the information tables T stored in the memory M are used, the order of use of the information tables T indicated by arrows in FIG. That is, the information tables T1, T2, T
., T4, T5, T6, T1,...

The storage location MP for storing the information table T may be provided in an empty area of a shared memory capable of storing other data or programs. in this case,
The absolute address of each storage location is set according to the state of use of the memory, but the relative address does not change.

Next, the operation of the present embodiment having the above-described configuration will be described.

According to the information table storage structure using the information table storage method of the present embodiment, the information table T whose use order is mutually adjacent among the plurality of information tables T is stored in the memory M storage location. Since the MPs can be arranged so as to be closest to each other, the position information P can be stored in one byte, and the arrangement and size of the information table T can be freely set, and the processing time can be reduced. Can be shortened.

In the present embodiment, the plurality of information tables T are arranged from the head of the storage position MP of the memory M at every other position and are arranged without any gap in the order of use. A configuration may be adopted in which every two or three, for example, from the top of the storage location MP of M are arranged in the order in which they are used without any gap. The moving distance becomes longer, and the effect of shortening the processing time and increasing the processing speed is slightly reduced.

Here, an apparatus to which the information table storage structure using the information table storage method according to the present invention is applied will be described by exemplifying a printing apparatus used as an output device such as a computer.

FIG. 2 is a block diagram showing a configuration of a main part of a printing apparatus to which an information table storage structure using the information table storage method according to the present invention is applied.

As shown in FIG. 2, the printing apparatus 1 according to the present embodiment includes at least a CPU 2 as a treatment device, and a memory M formed of a ROM, a RAM, or the like having an appropriate capacity for storing an information table T. have.

Then, the CPU 2 of the printing apparatus 1 receives the print information output from the host device 3 such as a computer indicated by a broken line in FIG. 2, and converts the received print information into a program stored in a memory (not shown). By performing various processes such as a main process of analyzing based on the print data to be converted into print data to be used for actual printing, and a mechanical process of driving a mechanism based on the print data formed by the main process, characters and the like on a sheet can be obtained. Printing of images such as figures.

The CPU 2 includes an accumulator, an arithmetic and logic unit, a decoder, an instruction register, a general-purpose register,
It is composed of a control circuit, a program counter, and the like. In the main processing routine, information of operation commands necessary for operation of the mechanism 4, for example, various mechanisms such as a paper feed mechanism, a paper discharge mechanism, and a print control mechanism, is described. A plurality of information tables T are formed and stored in the memory M, and a plurality of information tables T stored in the memory M in a mechanical processing routine.
Are called from the memory M in the order of use, and the operation described in the information table T is executed by the mechanism 4.

The information table T includes motor phase initialization, motor homing, motor movement command (feed position), cam position change command (feed position), feed command, printing between designated positions (use buffer). , Paper feed command (specify length), motor drive command to specified position, print command for specified number of lines,
Various parameters such as a paper ejection command are described. Then, a plurality of parameters having different values of these parameters are formed and stored in the memory M as a plurality of information tables T.

The other memory (not shown) of the printing apparatus 1 receives at least print information output from the host apparatus 4, analyzes the received print information, and converts it into print data used for actual printing. A program for executing processes such as a main process and a mechanical process for driving a mechanism based on print data formed by the main process is stored.

Further, the CPU 2 specifies (instructs) information for designating an operation for a mechanism in the main processing routine, for example, an initialization operation, a paper feeding operation, a paper discharging operation, a printing operation, etc., based on a program stored in advance. A plurality of the described information tables T are formed as described above and stored in the memory M, and the plurality of information tables T stored in the memory M are called from the memory M in the order of use and described in the information table T in a mechanical processing routine. The above operation is executed by each unit of the printing apparatus 1.

According to the printing apparatus 1 of the present embodiment having such a configuration, the information table T in which the use order of the plurality of information tables T is adjacent to each other is stored at the storage location MP of the memory M which is closest to the other. Therefore, the position information P can be stored in one byte, the arrangement and size of the information table T can be freely set, and the processing time can be reduced. it can. Therefore, it is possible to easily increase the printing speed.

The storage structure of the information table using the storage method of the information table of the present invention is not limited to the printing apparatus 1, and various input / output devices connected to the computer, such as a scanner, a hard disk device, a modem, It can be used for LAN adapters, plotters and the like.

The present invention is not limited to the above-described embodiment, but can be variously modified as needed.

[0057]

As described above, according to the information table storage method according to the present invention, the information table whose use order is mutually adjacent among a plurality of information tables has the closest memory storage position. The position information can be stored in one byte, and the arrangement and size of the information table can be freely set, and the processing time can be ensured. An extremely excellent effect such as being able to be shortened.

According to the information table storage structure of the present invention, the information tables of a plurality of information tables, whose use order is adjacent to each other, are arranged such that the storage position of the memory is closest. Can be easily and reliably performed, the position information can be easily stored in one byte, and the arrangement and size of the information table can be freely set, and the processing time can be reliably reduced. It produces extremely excellent effects such as being able to do.

[Brief description of the drawings]

FIG. 1 is an explanatory diagram showing a structure of an embodiment of a memory to which a storage structure of an information table is applied by using an information table storage method according to the present invention;

FIG. 2 is a block diagram illustrating a configuration of a main part of a printing apparatus to which an information table storage structure using an information table storage method according to the present invention is applied;

FIG. 3 is an explanatory diagram showing a storage structure for storing a conventional information table in a memory in the order of use;

FIG. 4 is an explanatory diagram showing a storage structure in which position information is simply added to a conventional information table and stored in a memory.

[Explanation of symbols]

Reference Signs List 1 printing device 2 CPU 3 host device 4 mechanism M memory T, T1, T2, T3, T4, T5, T6 information table MP, MP1, MP2, MP3, MP4, MP5, MP
6 Storage location P, P1, P2, P3, P4, P5, P6 Location information

Claims (2)

[Claims] 1. A method of storing an information table in which a plurality of information tables in which information of operation instructions is described is stored in a memory in association with each other, wherein the plurality of information tables are placed every other one from the head of a storage position of the memory. And place them without gaps in the order of use,
A method of storing information tables, wherein position information formed by a relative address to a storage position of an information table to be used next is added to each of the information tables. 2. A storage structure of an information table in which a plurality of information tables in which information of operation commands is described are stored in a memory in association with each other, wherein the plurality of information tables are stored in a storage position of the memory from a head side. The information tables stored in each of the storage locations are combined with location information including a relative address to a storage location of an information table to be used next. A storage structure of an information table, which is stored.