JPH0596823A - Printer device - Google Patents

Abstract

PURPOSE:To perform the selection of emulation accurately by comparatively little data by a method wherein when data in a table agrees with printing data which is sent from a host unit, the selection of emulation is performed by adding points to each emulation, considering the weights which are specified for respective data in the table. CONSTITUTION:A table to perform the comparison for data for each emulation is prepared in a nonvolatile memory 35 in a printer device 22. When printing data which is sent from a host unit such as work station, etc., agrees with data in the table on a control panel 41, points are added for each emulation considering the weights which are specified for respective data in the table, and for example, when a difference between the largest one and the one with a next value becomes a specified numerical value or larger, an emulation which corresponds with the largest one is selected. As the result, the selection of an emulation can be accurately performed using comparatively little data.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a printer device for printing data sent from a print information source such as a host computer, and more specifically, executes printing processing by emulation suitable for the sent data. The present invention relates to a printer device.

[0002]

2. Description of the Related Art FIG. 7 shows a general connection relationship between a host computer as an example of a print information source and a printer. The host computer 11 and the printer device 12 are connected by a communication cable 13, and image data and various control codes are transmitted through the communication cable 13. A controller 14 and a printing unit 15 as a printing mechanism are arranged in the printer device 12. The controller 14 is configured to perform an image development process for printing and to control printing of the printing unit 15.

In such a printing system, if the host computer 11 and the printer device 12 are manufactured by the same maker in the same era and both are sold as a set, they are supplied from the host computer 11. There is no particular problem when the printer device 12 prints the image data.

However, in reality, the host computer 1
In many cases, the manufacturers of 1 and the printer device 12 are not the same, or even those related to the manufacture of the same manufacturer have different dates of manufacture. Even in such a case, it is necessary for the controller 14 of the printer device to correctly decode the control code sent from the host computer 11 side and perform the printing operation.

Therefore, conventionally, there has been a printer apparatus in which a plurality of emulations and a changeover switch for these are arranged in a controller. In such a printer device, an appropriate emulation is selected by switching the switch depending on the type of the host computer of the connection destination. Here, the emulation means simulating control codes (machine language instructions) used by different devices by using a microprogram. By such emulation by the controller 14 in FIG. 7, it is possible to decode the control codes of different models and perform the printing operation by the printing unit 15.

However, in the printer device which switches the emulation by the switch as described above, it is necessary to operate the switch each time the host computer is changed, which is not only troublesome but also causes the printer device to malfunction if the switch operation is mistaken. There was a problem that printing could not be performed at all.

In order to solve such a problem, a printer device has been proposed in which the switching of emulation is automated. Among them, in the printing device disclosed in Japanese Patent Laid-Open No. 1-314177, a plurality of emulations are arranged inside the device, and a control command code received from the outside is collated with these plural types of emulations. There is. Then, the most suitable emulation is automatically selected and the control command is converted.

Also in the computer terminal device described in Japanese Patent Laid-Open No. 2-156325, a plurality of emulations are arranged in the device. With respect to these emulations, the number of non-correspondences in the escape sequence table and the character set is counted, and the emulation judged to be the most appropriate because of the small number of these is automatically selected.

[0009]

However, in the two conventional devices in which the compatibility with each emulation is compared and the optimum emulation is selected in this way, the amount of data for comparison is both set. There was a problem that the accuracy in selecting the optimum emulation would not be improved unless it was increased. Therefore, there is a problem that it is unsuitable for emulation that is described only by printable characters other than emulation of a code system that can be immediately determined as a control code such as an escape sequence.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a printer device capable of accurately selecting emulation by using a relatively small amount of data.

[0011]

According to a first aspect of the present invention, a table showing a data string of a plurality of bytes and the weights set therein for each emulation and a table showing the data sent from the host device are described above. Search means, adder means for adding the weights for each emulation each time the above-mentioned multi-byte data string is matched as the search result, and selecting means for selecting the emulation having the largest addition value for data processing. And the printer device.

That is, according to the first aspect of the present invention, the data sent from the host device is searched in a table representing each emulation, and each time the data string of a plurality of bytes in the table matches the data string, the data is sent to each emulation. The weights of are added. Here, for example, the weight is set heavy for a data string that exists only in a specific emulation, and lightly set for the data string that exists in several emulations. It is likely that this is the most suitable emulation for processing the data sent from.

According to another aspect of the present invention, a table representing a plurality of byte data strings and the weights set therein for each emulation, and a search means for searching the table for data sent from the host device. , Addition means for adding the weights for each emulation each time a data string of a plurality of bytes matches as a result of this search, and the difference between the maximum value and the next largest value in the sum of weights for each emulation obtained by this addition means. When the value exceeds a predetermined value, the printer device is provided with a selecting means for selecting the emulation corresponding to the maximum value for data processing.

That is, according to the second aspect of the present invention, the data sent from the host device is searched in a table representing each emulation, and a data string of a plurality of bytes in the table is matched with the emulation data every time the data string matches. The weights of are added. Then, when the difference between the maximum addition value and the next addition value is separated by a certain amount or more, the emulation with the maximum addition value is selected, and the optimum emulation for data processing is selected. It is increasing the possibility that

According to the third aspect of the present invention, a table representing a plurality of byte data strings and the weights set therein for each emulation, and a searching means for searching the table for data sent from the host device. , Addition means for adding the weights for each emulation each time a data string of a plurality of bytes matches as a result of this search, and the difference between the maximum value and the next largest value in the sum of weights for each emulation obtained by this addition means. However, the printer device is provided with a selection means for selecting the emulation corresponding to the maximum value for processing the data when the ratio becomes a predetermined ratio or more with respect to the total number of the above-mentioned data which has been compared.

That is, according to the third aspect of the present invention, the data sent from the host device is searched in a table representing each emulation, and each time the data string of a plurality of bytes in the table is matched with the emulation data, the data is sent to each emulation. The weights of are added. Then, when the difference between the maximum addition value and the next largest addition value becomes a certain ratio or more with respect to the total number of pieces of data sent from the host device for which comparison processing has been performed, By selecting the emulation with the maximum added value, the possibility that the optimum emulation is selected in consideration of the number of data processes is increased.

[0017]

EXAMPLES The present invention will be described in detail below with reference to examples.

FIG. 2 shows an outline of a printing system using a printer device according to an embodiment of the present invention. The communication cable 21 forming the ring-shaped network includes a plurality of printer devices 22 ₁ , 22 ₂ , ...
22 _N and a plurality of workstations 23 ₁ , 23
₂ , ... 23 _M is connected. With this printing system, these workstations 23 ₁ , 23 ₂ , ...
The document edited by 23 _M is sent to any _one of the printer devices 22 ₁ , 22 ₂ , ..., 22 _N ,
It is designed to be printed out here.

FIG. 1 shows an outline of a printer device according to an embodiment of the present invention. The printer device 22 includes a CPU 31 which is the center of various controls. The CPU 31 has a ROM 33 and a RAM 3 via a bus 32 such as a data bus.
4, a non-volatile memory (NVM) 35, a network interface (I / F) unit 36, a panel control unit 37, and an engine control unit 38.

ROM (Read Only Memory)
The printer device 22 includes a control program 33
A processing program for the native printer control language of is written. A RAM (Random Access Memory) 34 has a role as a working memory for storing data temporarily required for the CPU 31 to execute various controls, and also for expanding image data. It also has a role as a page memory. Here, the image data is printed by the engine control unit 37 for printing.
Is the data sent to. The non-volatile memory 35 used in the present embodiment is a rewritable non-volatile memory, and stores a plurality of emulation programs and emulation tables used when selecting these. Since this is a non-volatile memory,
The contents are saved even when the power is turned off. As a rewritable non-volatile memory, a flash electric erase ROM (Flash E ² PROM), an electric erase ROM (E ² PROM), or a hard disk storage device is typical. In this embodiment, a flash electric erase ROM is used as a non-volatile memory. A RAM backed up by a battery can also be used as a non-volatile memory.

The network interface section 36 is prepared to serve as an interface for communication with the network. Network interface unit 3
6 is a workstation 23 ₁ , 23 ₂ , ... 23 _M
The data transmitted from the CPU 31 is taken in through the communication cable 21 so that the CPU 31 can process the data. The panel control unit 37 is connected to a control panel 41, and controls input / output of data with respect to various keys and a liquid crystal display.

FIG. 3 shows the arrangement of these keys and the like on the control panel. A liquid crystal display 43 is arranged above the control panel 41, and eight keys 44 _{1 to} 44 ₈ are arranged below the liquid crystal display 43. Of these, the liquid crystal display 43 displays the status of the printer device 22, and the keys 44 ₁ ...
The contents of the function corresponding to 44 ₈ are displayed. Here, ONLINE (online)
Key 44 ₁ is adapted to perform one of the switching to the offline state to the printer device 22 in the online state.

[0023] FONT (ORIENTATION) key 44 _2, in the information sent from the work station 23, used for when there is no information about the font used, enters a mode for setting the type of font to be used Is the key to do. This FONT (ORIEN
TATION key 44 ₂ to CONTINUE (SIF
If you press at the same time as T) key 44 _5, it enters a mode for setting the direction of the printing paper and image. MODE
The (EMULATION) key 44 ₃ is used to enter a mode for setting various printer operation modes. When pressed simultaneously with the CONTINUE (SIFT) key 44 ₅ , the emulation (EMULATI)
It is adapted to enter a mode for setting the (ON) state.

△ (TEST) key 44_FourIs the setting mode
Used to select an item when entering the code. C
ONNTUE (SIFT) key 44_FivePressed at the same time
In case you're going into a mode to run various tests
Growling. CONTINUE (SIFT) key 4
Four_FiveIs a non-fatal error when an error occurs.
Used to ignore the error and perform the desired action
It Also, another key 44 ₂~ 44_Four, 44₆~ 44₈When
Press at the same time to perform another function of these keys.
Let go. That is, the shift key on a normal keyboard
The same action as ENTER (COPY) key 4
Four₆Sets the item selected in each setting mode.
Used when CONTINUE (SIFT) key
44_FiveIf pressed at the same time, one image data
Setting for how many printouts
Enter the first mode. FORM FEED (FEEDE
R) key 44₇Has information that triggers the print operation.
A part of the RAM 34 described above without receiving from the device
If the image data remains on the page memory,
It is used to print out this. CONTI
NUE (SIFT) key 44_FiveWhen pressed at the same time
Is a mode for setting the tray for feeding print paper.
to go into. ▽ (RESET) key 44₈Is each setting mode
Used when changing items in. CONTIN
UE (SIFT) key 44_FiveIf pressed at the same time,
Enters a mode for performing various reset functions.

FIG. 4 shows the display contents of the liquid crystal display for selecting the two emulation modes. As mentioned above, MODE (EMULATI
When the (ON) key 44 ₃ and the CONTINUE (SIFT) key 44 ₅ are pressed simultaneously, the mode for setting the emulation state is entered. At this time, the liquid crystal display 43 is automatically emulated (AUTO).
Mode and Adobe Post Script
A display is displayed to select one of the language modes. The operator can set either desired mode by pressing the Δ (TEST) key 44 ₄ or ▽ (RESET) key 44 ₈ . When the operator selects the auto mode, the printer device 22 appropriately utilizes a plurality of emulation programs stored in the non-volatile memory 35 to perform optimum data processing according to the print data. On the other hand, when the PostScript language mode is selected, only the PostScript language which is the native language of the printer device 22 is executed.

Returning to FIG. 1, the description will be continued. An engine unit 46 is connected to the engine control unit 38. The engine unit 46 is a printing unit of the printer device 22, and in the present embodiment, it is composed of basic components as a laser printer. The engine unit 46 receives the print signal read from the page memory, modulates the laser beam, and exposes and scans the photosensitive drum (not shown) to form an electrostatic latent image. Then, this electrostatic latent image is developed by a developing device (not shown) to create a toner image, which is transferred onto a printing sheet, fixed, and discharged as a printed sheet onto a tray (not shown).

The following Tables 1 and 2 show a part of the emulation table stored in the nonvolatile memory shown in FIG.

[0028]

[Table 1]

[0029]

[Table 2]

The printer apparatus of this embodiment stores two emulation programs, and can cope with three printer control languages in addition to the native printer control language. The comparison tables shown in Table 1 and Table 2 correspond to two emulation programs. In these comparison tables,
The “data length” means the length of data delimited for reference in the serial data sent from the workstation 23 as a host computer. Further, "data" refers to data that constitutes a control code. The “point” means the weight when the data sent from the workstation 23 matches the data in the comparison table. This weight is set from 0 to 10 in the positive direction, and is also set in the negative direction as shown in Table 2.

Here, the weight "0" means that the coincidence of data does not give a score or a goal in judging the emulation, and the weight "10" means only one comparison table for emulation. Only when the data match. For the weights from "1" to "9",
It is set in consideration of various situations such as how many emulation comparison tables match the data and the general appearance frequency of the data. On the other hand, the case where the weight is negative refers to the case where such data is not expected to appear in the corresponding printer control language and corresponds to a negative appearance probability.

In the emulation selection work for selecting the optimum emulation by the printer device of this embodiment, the data sent from the workstation 23 (FIG. 2) is stored in the comparison buffer B (not shown),
This is compared with the comparison table shown in Table 1 and the like. Then, for those that match, those points are added for each comparison table. Then, when the difference between the emulation with the highest added value and the emulation with the next highest score opens beyond a predetermined value, the emulation with the highest added value is set.
Here, the data is stored in the comparison buffer B while being shifted by 1 byte, and the data is compared from the comparison table of each emulation and the head address of the comparison buffer B. The length of the data stored in the comparison buffer B is
It is the same as the maximum value of the data length of the comparison table to be processed.

FIG. 5 and FIG. 6 show the flow of emulation setting work by the printer device of this embodiment. First, the CPU 31 (FIG. 1) writes the first adaptability register P (which stores the adaptability of the first emulation corresponding to the first emulation comparison table (hereinafter referred to as the first comparison table) shown in Table 1). 1)
And the contents of the second fitness register P (2) in which the fitness of the second emulation corresponding to the second emulation comparison table (hereinafter referred to as the second comparison table) shown in Table 2 is written. Both are cleared to "0" (step S101). Then, the address pointer Pb for the input data buffer storing the data sent from the workstation 23 is set at the head of the input data buffer (step S102). This is because the comparison work is started in order from the beginning of the data received for printing.

Next, the CPU 31 sets the address pointer Pt for the comparison table at the head of the first comparison table (step S103). Then, the contents of the table buffer T (not shown) that stores the data read from the first comparison table and the contents of the comparison buffer B that stores the comparison target data read from the input data are cleared (step S104). .. Here, the lengths of the comparison buffer B and the table buffer T are set to the same length as the maximum value of the data length in the first comparison table.

When the two buffers T and B for comparison are initialized in this way, 1 is input from the input data buffer.
The buffer data is read and stored in the comparison buffer B (step S105). Next, 1-byte data representing the data length (number of bytes) of the data to be compared is read from the first comparison table,
The data is stored in the 1-byte data length buffer L (not shown) (step S106). Then, the address pointer Pt for the comparison table is incremented by "1" (step S107), and 1 is added from the first comparison table.
The byte data is read and stored in the table buffer T (step S108).

At this point, it is determined whether the contents of the table buffer T and the comparison buffer B match (step S109). When they match (Y), it is necessary to check whether the following data match.
Therefore, the data as long as the data length (L bytes) indicated by the data length buffer is read from the input data buffer and stored in the comparison buffer B (step S11).
0). For example, since the first data in Table 1 has 2 bytes, L is “2”, another 1 byte of data is read from the input data buffer, and a total of 2 bytes of data is stored in the comparison buffer B. Will be. Similarly, as much data as the data length indicated by the data length buffer (L bytes) is read from the first comparison table and stored in the table buffer T (step S111). As a result, the first data is stored in the table buffer T.
The data of the length to be compared is stored from the comparison table of.

In this state, it is again determined whether or not the contents of the table buffer T and the comparison buffer B match (step S112). If they match (Y), the comparison table address pointer Pt is incremented by the numerical value "L" (step S113). Then, the points are read from the first comparison table and added to the first fitness register P (1) (step S114). In this case, since a data match was found in the first comparison table, the process proceeds to step S115 in FIG. 6 to perform the same comparison work for the second comparison table.

On the other hand, if the determination results do not match (step S112; N), the comparison table address pointer Pt is incremented by the numerical value "L" + "1" (step S116). Then, it is judged whether or not the address pointer Pt for the comparison table is larger than the final address of the first comparison table (step S1).
17), if it is larger, it means that the comparison work in the first comparison table has been completed, so step S1 in FIG.
I will proceed to 15. When the address pointer Pt for the comparison table is not larger than the final address of the first comparison table (step S117; N), the process returns to step S104 and the comparison work is performed on the next data in the first comparison table. It will be. Similarly, in step S112, whether data match is found or not
The same operation is repeated until a match is obtained for all the data in the comparison table in. Note that step S1
If no match is found for the first one byte at 09 (N), it is the same as no match for the total length of the data, so the procedure from step S110 to step S112 is omitted. Step S116
Will proceed to.

In step S115, the address pointer Pt for the comparison table is placed at the head of the second comparison table. Then, the contents of the table buffer T that stores the data read from the second comparison table and the contents of the comparison buffer B that stores the data to be compared read from the input data are cleared (step S118). Here, the lengths of the comparison buffer B and the table buffer T are the second
It is set to the same length as the maximum value of the data length in the comparison table.

When the two buffers T and B for comparison are initialized in this way, 1 is input from the input data buffer.
The buffer data is read and stored in the comparison buffer B (step S119). Next, 1-byte data representing the data length (number of bytes) of the data to be compared is read from the second comparison table,
The data is stored in the 1-byte data length buffer L (not shown) (step S120). Then, the address pointer Pt for the comparison table is incremented by "1" (step S121), and 1 is added from the second comparison table.
The byte data is read and stored in the table buffer T (step S122).

At this point, it is determined whether the contents of the table buffer T and the comparison buffer B match (step S123). When they match (Y), it is necessary to check whether the following data match.
Then, the data as much as the data length (L bytes) indicated by the data length buffer is read from the input data buffer and stored in the comparison buffer B (step S12).
4). Similarly, as much data as the length (L bytes) of the data indicated by the data length buffer is read from the second comparison table and stored in the table buffer T (step S125). As a result, the data of the length to be compared is stored in the table buffer T from the second comparison table.

In this state, it is again determined whether the contents of the table buffer T and the comparison buffer B match (step S126). If they match (Y), the comparison table address pointer Pt is incremented by the numerical value "L" (step S127). Then, the points are read from the second comparison table and added to the second fitness register P (2) (step S128). In this case, since the data match was found in the second comparison table, the process proceeds to step S129 in order to perform the similar comparison work on the second comparison table.

On the other hand, if the determination results do not match (step S126; N), the comparison table address pointer Pt is incremented by the numerical value "L" + "1" (step S130). Then, it is determined whether or not the address pointer Pt for the comparison table is larger than the final address of the second comparison table (step S1).
31), if it is larger, it means that the comparison work in the second comparison table has been completed, so that the process proceeds to step S129. Address pointer P for comparison table
When t is not larger than the final address of the second comparison table (step S131; N), step S11
Returning to step 8, the comparison work is performed on the next data in the second comparison table. In the same manner, the same operation is repeated until the data match is found in step S126 or all the data in the second comparison table are matched. Note that if no match is found for the first byte in step S123 (N), it is the same as no match for the total length of the data, so the procedure from step S124 to step S126 is performed. It is omitted and the process proceeds to step S129.

In step S129, the magnitude relation between the value of the second fitness register P (2) and the value of the first fitness register P (1) is checked. As a result, if the value of the second fitness register P (2) is larger (Y),
Furthermore, the added value of the value of the second fitness register P (2) is “30” as compared with the value of the first fitness register P (1).
It is determined whether or not it is larger (step S13).
2). If it is larger than "30", the second emulation is determined to be the optimum one, and the second emulation program is set for data processing (step S133). When the added value is equal to or less than "30" (step S132; N), the address pointer Pb for the input data buffer is added so as to be at the next position (step S134). And step S
Returning to 103, it is checked from the first comparison table whether or not the data match.

On the other hand, in step S129, the value of the first fitness register P (1) is the second fitness register P (1).
If it is larger than the value of (2) or both are equal (N), the value of the first fitness register P (1) is the value of the second fitness register P (2). It is determined whether the added value is larger than "30" (step S135). If it is larger than "30", the first emulation is determined to be the optimum one, and the first emulation program is set for data processing (step S136). If the added value is equal to or less than "30" (N), the address pointer Pb for the input data buffer is added so as to be at the next position (step S134). Then, the process returns to step S103, and it is sequentially checked from the first comparison table whether or not the data match.

In the embodiment described above, a value having a difference between the maximum addition value and the next largest addition value (“3” in the embodiment).
We decided to select the emulation corresponding to the maximum addition value when it became larger than 0 "), but this difference is the total number of data compared up to that time among the data sent from the host device side. On the other hand, the emulation corresponding to the maximum value may be selected when the ratio exceeds a predetermined ratio, or the maximum addition value as a result of processing a certain amount of data sent from the host device side. The emulation that has acquired may be simply selected.

Further, in the embodiment, a comparison table is provided for the two emulation programs to perform the comparison work. However, in the case of a printer device which stores three or more emulation programs, only these numbers are used. It suffices to obtain the sum of points for each emulation using the comparison table and finally select the emulation program having the maximum value.

[0048]

As described above, claims 1 to 3 are as follows.
According to the described invention, since the data for comparison is weighted, it is possible to quickly select the most probable printer control language without processing all of the data sent from the host device. There is. Also, since I decided to simply compare data with data, even for emulation that does not have an escape sequence,
There is also an effect that a comparative judgment can be made.

[Brief description of drawings]

FIG. 1 is a block diagram showing an outline of a circuit configuration of a printer device according to an embodiment of the present invention.

FIG. 2 is a system configuration diagram showing an outline of a print system using the printer device of the embodiment.

FIG. 3 is a plan view showing an arrangement of keys and the like of a control panel in this embodiment.

FIG. 4 is a plan view showing the display contents of a liquid crystal display for selecting two emulation modes.

FIG. 5 is a flowchart mainly showing an operation by a first comparison table among emulation setting operations by the printer apparatus of the present embodiment.

FIG. 6 is a flowchart mainly showing a state of a work by a second comparison table and a final selection work among emulation setting works by the printer apparatus of the present embodiment.

FIG. 7 is a block diagram showing a general connection relationship between a host computer and a printer device.

[Explanation of symbols]

22 ... Printer device, 23 ... Workstation (host device), 31 ... CPU, 33 ... ROM, 34 ... RA
M, 35 ... Non-volatile memory, 46 ... Engine part

Claims (3)

[Claims] 1. A table in which a data string of a plurality of bytes and weights set therein are represented by emulation, a search means for searching the data sent from the host device in the table, and the plurality of data as a result of the search. A printer apparatus comprising: an addition unit that adds weights for each emulation each time a data string of bytes matches, and a selection unit that selects an emulation having the largest addition value for processing the data. 2. A table in which a data string of a plurality of bytes and weights set therein are represented by emulation, a search means for searching the table for data sent from a host device, and the plurality of data are obtained as a result of the search. Addition means for adding the weights for each emulation each time a byte data string matches, and a difference between the maximum value and the next largest value in the sum of emulation weights obtained by this addition means is greater than or equal to a predetermined value. And a selection unit that selects an emulation corresponding to the maximum value for processing the data when the maximum value is reached. 3. A table in which a data string of a plurality of bytes and weights set therein are represented by emulation, a search means for searching the table for data sent from a host device, and a plurality of the plurality of data as a result of the search. Addition means for adding the weights for each emulation each time the data string of bytes matches, and the difference between the maximum value and the next largest value in the sum of emulation weights obtained by this addition means is compared until then. A printer device, comprising: selecting means for selecting an emulation corresponding to the maximum value for processing the data when the ratio becomes a predetermined ratio or more with respect to the total number of the executed data.