JPS61224032A - Graphic data developing and controlling system for printer - Google Patents

Abstract

PURPOSE:To reduce the capacity of a buffer by receiving graph print area definition at the receiving section of a printer. then storing the graph code in the buffer and developing to a dot pattern, and thereby repeating a series of operation when next area definition continues. CONSTITUTION:Graph data from a host are received by the interface controlling section 1-1 of a printer 1 by control of an input controlling section 1-5, and the data are stored in a graph code buffer 1-6. Every time graph print definition is received, data in the buffer 1-6 is developed to a state of dot pattern by a graph controlling section 1-3, and the developed data pattern is stored in the specified area of a page buffer 1-7. Further, image data received by an image data controlling section 1-4 are stored in the buffer 1-7. When next area definition continues, a series of operation is executed repeatedly, and capacity of the buffer 1-7 is reduced.

Description

[Detailed description of the invention] 〔overview〕 In developing graph data in printers.

Using a graph code buffer with a relatively small capacity, graph data of an arbitrary size within a page is divided into multiple defined areas, and is received continuously in multiple batches and sequentially expanded into a dot pattern to create a large capacity. control to print with the same performance as a printer equipped with a graph code buffer.

[Industrial application field]

The present invention relates to a method for controlling the development of graph data in a printer, and is particularly useful for dot-type page printers such as laser beam printers.

[Problems to be solved by conventional technology and invention] Conventionally,
When printing a graph with a page printer equipped with a page buffer, such as a laser beam printer, after one page has been printed, it prints the graph data in code format that has been stored in the graph code buffer in advance. Graphs were printed page by page by developing them in a pattern and sequentially storing them in a page buffer.

Therefore, it is necessary to store the graph data notified from the host in advance in the graph code buffer page by page (before printing of the previous page is finished). The capacity of the graph code buffer is limited to a relatively small size in small printers, and when printing complex graphs, there is a problem that it is not possible to cover the entire area of one page. Ta.

Furthermore, when developing software to print the graph, there is a problem in that the capacity of the graph code buffer built into the printer to be printed must be taken into account.

Furthermore, there is a problem in that a graph printed using a printer with a large graph code buffer capacity cannot be printed using a printer with a small capacity.

A detailed explanation will be given below using FIGS. 4 and 5.

FIG. 4 shows an example in which graph data is expanded into a dot pattern and stored in a page buffer.

FIG. 5 shows a flowchart for explaining the operation of the configuration shown in FIG.

The graph printing area definition in FIG. 4 is for representing the position at which graph printing is to be started, transferred from the host to the printer. By specifying a predetermined area (for example, 32 KB) starting from the position (for example, a line) designated by the graph printing area definition, the area in which the graph is to be developed is determined as shown in FIG. The operation will be explained in detail below using FIG.

[Phase] in FIG. 5 is a state in which a graph printing area is defined, and as shown in FIG.

In the figure, 0 indicates a state in which graph data (graph code) is transferred. This means that graph data to be printed is transferred from the host.

In the figure, @ indicates a state in which a line feed is performed.

In the figure, [phase] indicates whether the physical page is smaller than the received line feed amount, or
Alternatively, it indicates a state for determining whether or not they are equal.

This detects cases where more graph data, character data, etc. than can be accommodated in one page are transferred from the host, or cases where an ejection command is transferred. Is this smaller than or equal to the size that should actually be printed, such as Peichi, Sonoshi, 866<unstruck^A^bond 4≠6h Nagtanfuday, etc. It means to discriminate. If YES, execute the steps below @ in the figure. In the case of No, the steps below @ in the diagram are repeatedly executed.

In the figure, [phase] indicates a state in which the graph data is expanded and stored in the form of a dot pattern in the page buffer. This means that the graph data transferred from the host is stored in the graph code buffer in advance as shown in Figure 4. This means that the stored data is expanded into a dot pattern and stored in the page buffer. .

In the figure, [phase] means a state in which character patterns etc. are developed in the page buffer. The dot pattern for one page developed in the page buffer is as follows.

It is printed page by page sequentially using a laser beam printer or the like.

As explained above, the conventional graph data expansion control method shown in FIGS. 4 and 5 stores the graph data transferred from the host in a graph code buffer page by page, and then converts the graph data into a dot pattern all at once. Because it was expanded and stored in the page buffer, as mentioned above, it was not possible to print complex graphs that exceeded the capacity of the graph code buffer, and the graph code of the printer used for printing during software development was It was necessary to be aware of the capacity of the buffer, and there was a problem that a graph printed with a large-capacity graph code buffer would not be printed if the graph code buffer had a small capacity. .

[Means for solving problems]

In order to solve the above-mentioned problems, the present invention sequentially stores graph data representing nine figures etc. in a graph code buffer for each predetermined defined area, and develops the stored graph data into a dot pattern. .

By controlling the data to be sequentially stored in the page buffer and printed page by page, the capacity of the graph code buffer can be made to appear infinite, and differences in the capacity of the graph code buffer due to different printer devices can be absorbed. Also, the capacity of the graph code buffer is reduced.

Therefore, the present invention provides a printer that develops and prints graph data into a dot pattern page by page.

A graph printing area definition that specifies an area to print graph data, a receiving unit that receives graph data to be printed in the area specified by the graph printing area definition, and a comparison that stores the graph data received by the receiving unit. a graph code buffer with a small capacity, and a graph that sequentially develops the graph data in the graph code buffer to be printed in the area designated by the received graph print area definition into a dot pattern. Equipped with a control unit and a page buffer that stores dot patterns to be printed on a page-by-page basis.

When developing the next page of graph data in the page buffer, the graph control section stores the graph data after the reception section receives the graph print area definition in the graph code buffer and then develops it into a dot pattern. At the same time, it is checked whether or not nine-order graph print area definitions have been received, and if first-order graph print area definitions are received consecutively, the above series of operations is controlled to be repeatedly executed.

〔Example〕

Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 1 is a configuration diagram of one embodiment of the present invention, FIG. 2 is an example of a graph developed in a page buffer used in the configuration of one embodiment of the present invention illustrated in FIG. 1, and FIG. A flowchart illustrating the operation of the configuration of the first embodiment is shown.

In the figure, 1 is a printer device, 1-1 is an interface control section, 1-2 is a character control section, 1-3 is a graph control section, and 1-4 is an image control section.

1-5 is an input control unit, 1-6 is a graph code buffer,
1-7 represents a page buffer, 1-8 a printing mechanism, and 2 a display.

In FIG. 1, the printer device 1 in FIG. 1 is the present invention 7113.
4-、F4- ITs chant seven j + 9
FIs + + OJ-r”- is configured.

An interface control section 1-1 in the figure is for receiving graph data (graph code) etc. transferred from the host and displaying various information on the display 2.

The character control section 1-2 in the figure is for controlling the development of received character data into a dot pattern and storing it in the page buffer 1-7.

In the figure, the graph control section 1-3 is the graph code buffer 1-6.
The graph data inside is developed in the form of a dot pattern, and the developed dot pattern is printed in a predetermined area in the page buffer 1-7 (the area specified by the graph print area definition).
This is to control the storage in the . This dot pattern development operation is performed every time a graph print area definition is received. The image control unit 1-4 in the figure is for controlling the storage of received image data in the page buffer 1-7. .

In the figure, an input control section 1-5 is used to control the reception of graph data etc. transferred from the host.

As mentioned above, the graph code buffer 1-6 in the figure is used to temporarily store graph data for each graph print area definition transferred from the host. As will be described later, this storage is performed repeatedly for each graph print area definition fl) to n), and by repeating expansion in this manner.

The capacity of the graph code buffer 1-6 appears to be infinite from the host.

In the figure, a page buffer 1-7 is used to store a dot pattern to be printed on a page-by-page basis using a laser beam printer or the like.

The printing mechanism 1-8 in the figure is for reading and printing the dot pattern stored in the page buffer 1-7.

Next, the concept of the operation of the configuration shown in FIG. 1 will be explained using FIG. 2, and then the operation will be explained in detail using the flowchart shown in FIG.

FIG. 2 shows an example of a graph stored in page buffer 1-7 in FIG. Graph printing area definitions (1) to 3) in the figure indicate, for example, the start address of each area surrounded by a dotted line, and the start address and a predetermined area, for example, 32 in the figure.
The KB area specifies the area where the graph data transferred from the host is to be developed into a dot pattern and stored in the page buffer 1-7.

The operation will be explained in detail below using FIG.

■ in Figure 3 indicates the state in which the graph printing area is defined.
This is from the host to the graph print area definition (1) in Figure 2.
3) and 32 KB in the figure are notified to the graph control unit 1-3 in FIG.

In the figure, ■ indicates a state in which graph data is transferred from the host to the graph control section 1-3 in FIG.

In the figure, ■ indicates a state in which it is detected whether or not the area definition has been transferred to the graph control unit 1-3. If the answer is YES, execute ■ in the figure. In the case of NO, execute the process (■) in the figure.

■ in the figure is ■ in the figure, and the graph print area definition is graph control part 1
-3 in Figure 1, so the graph data transferred following the graph print area definition is stored in the graph code buffer 1-6 in Figure 1.

As a result, the respective areas surrounded by dotted lines in the figure specified by the graph print area definitions (1) to '(3) in Figure 2 are assigned to the graph code buffers 1-6 in Figure 1.
Each graph is sequentially developed in a dot pattern based on the graph data stored therein.

The sequentially expanded dot patterns correspond to the respective graph print area definitions (1) in page buffers 1-7 in FIG.
3) are sequentially stored in the positions specified by 3) as shown in FIG.

■ in the figure indicates a state in which a page break is performed. This means that printing for one page is finished or the ejection command is executed and the next page is printed.

3 in the figure shows a state in which the dot pattern stored in the page buffer 1-7 in FIG. 1 is printed.

Based on the print area definition (11 to n) and the graph data to be printed in each graph print area definition (1) to n), the graph data in the graph code buffer 1-6 is sequentially printed in the form of a dot pattern. Expand.

The developed dot pattern is sequentially transferred to page buffers 1-7.
By controlling the graph code buffer 1-6 to be stored in a predetermined area and printed page by page, the capacity of the graph code buffer 1-6 appears to be infinitely large when viewed from the host side.

〔Effect of the invention〕

As explained above, the present invention makes it possible to make the capacity of the graph code buffer appear to be infinite, and also prevents the occurrence of portions that cannot be printed due to differences in the capacity of the graph code buffer due to different printer devices. , and the capacity of the graph code buffer can be reduced.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram of one embodiment of the present invention, FIG. 2 is an example of a graph developed in a page buffer used in the configuration of one embodiment of the present invention illustrated in FIG. 1, and FIG. A flowchart explaining the operation of the configuration of the first embodiment, FIG. 4 is an example of a graph developed in a page buffer used in a graph data development control method in a conventional printer, and FIG. 5 is a graph data development control method in a conventional printer. A flowchart explaining the operation is shown. In the figure, 1 is a printer device, 1-1 is an interface control section, 2-2 is a character control section, 1-3 is a graph control section, and 1-4 is an image control section. 1-5 is an input control unit, 1-6 is a graph code buffer,
1-7 represents a page buffer, 1-8 a printing mechanism, and 2 a display. Patent Applicant: Usatsuk Electronics Industry Co., Ltd. Representative Patent Attorney: Fumihiro Hase (2 others) 13 Eura 54 Eja 51X]

Claims (1)

[Claims] In a printer that develops and prints graph data into a dot pattern on a page-by-page basis, a graph print area definition that specifies an area where graph data is printed and printing in the area specified by the graph print area definition are provided. a receiving unit that receives the graph data to be received, a relatively small-capacity graph code buffer that stores the graph data received by the receiving unit, and a graph printing area definition specified by the graph printing area definition for each received graph printing area definition. a graph control unit that sequentially develops the graph data in the graph code buffer to be printed into a dot pattern in the area to be printed, and a page buffer that stores the dot pattern to be printed on a page by page basis; , when developing the next page's worth of graph data in the page buffer, the graph data after the receiving section receives the graph print area definition is stored in the graph code buffer and then expanded into a dot pattern, and the next page is A graph data development control method in a printer, characterized in that it checks whether or not a graph print area definition has been received, and if the next graph print area definition is received consecutively, controls the above series of operations to be executed repeatedly. .