JP2001228991A - Image processor and its control method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To attain the effective use of a memory and also to shorten the printing time even when the different languages/tasks are used between the current and next print jobs for processing these jobs. SOLUTION: When a memory full state occurs while an interpreter task 401B is executing its translation processing, an answer control part 506 of a memory management part 307 prolongs its transmission of a command <OK> until notification of end job of the precedent job is detected as long as the precedent job of a language different from the current job exists. Thus, the task 401B stands by translation of the PDL data when a memory full state occurs, releases the memory area occupied by the language/task that process the precedent job and then carries on the translation processing after an idle area is enlarged. As a result, the normal printing is carried out as long as the same print data are available and even when another language/task that process the precedent job of a different language is occupying or not occupying a global memory area 603.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to an image processing apparatus for interpreting print data in a plurality of page description languages received from a host apparatus and performing printing, and a control method therefor.

[0002]

2. Description of the Related Art Conventionally, when printing is performed by a page printer, print data of a page description language transmitted from a host computer is interpreted by an interpreter of a printing apparatus in an intermediate language (hereinafter, "display list (DL data)").
Translate). The DL data is converted into pixel data by a rasterizing unit of the printing apparatus. At this time, the rasterizing unit converts the DL data into pixel data (hereinafter, referred to as “band data”) for each predetermined band in order to speed up the printing process. This band data is stored in a band memory area allocated to the memory. The printer engine sequentially performs printing each time band data is stored in the band memory area.

A printer controller of this page printer usually has a plurality of interpreters and rasterizers (hereinafter referred to as languages / tasks) in order to support a plurality of page description languages without complicating printing control. I have.

[0004]

In a printer controller of a page printer provided with a plurality of languages / tasks, when a print job is received, a language / task corresponding to the page description language is called. The language / task requests the memory management unit to allocate a necessary memory area such as a DL storage memory area, a work band, and a font cache area in the global memory area on the main memory. The language / task executes processing using the allocated memory area, and therefore occupies most of the allocated memory area until the print job is completed.

When the printer controller receives the next print job while the language / task currently processing the current print job occupies a part of the global memory area, the page of this print job is displayed. If the description language is the same as the current print job, it is unlikely that memory full will occur immediately because only the area for storing the DL data of the current job is needed, but if the language of the current job is different, Since it is necessary to first secure a work area such as a font cache area for a new language in a free area of the global memory area, the memory is likely to be full.

The language / task executes a predetermined memory shortage process such as so-called divided printing when a free space in the memory is exhausted while the page description language is translated into DL data and stored in the memory. It has become. As described above, when a plurality of languages / tasks use the global memory area together, for example, the above-mentioned other languages / tasks for processing the next print job store work data or DL in the free area.
The global memory area may become full while data is being stored. In this case, other languages / tasks
Regardless of whether the previous language / task occupies the global memory area or whether it is occupied by itself, the processing corresponding to the memory shortage is executed. For this reason, if the previous language / task does not occupy the global memory area, other languages / tasks are determined to be unprintable even though the data can be printed normally. There is a disadvantage that the processing result of the same print data is different between when the processing is switched to another language / task and when it is not. In a printer, it is important in design that the same print data result in the same processing. Therefore, occurrence of such a phenomenon is not preferable in printer design.

Japanese Patent Application Laid-Open No. Hei 4-257478 discloses that in a printer having a plurality of programs (emulators) for controlling the operation of a printer, when a new program is designated by a program command from a higher-level device, the A program method is disclosed in which, after releasing a memory area used by a running program, the specified program is operated and the released memory area is used by the specified program. ing. This program method eliminates a memory shortage at the time of program switching. However, in this program system, the emulator that performs the current job cannot start receiving data from the host computer and interpreting the data until the processing of the previous job is completed. As a result, although the memory shortage is solved, there is an inconvenience that printing takes a long time.

According to the present invention, even when a plurality of languages / tasks interpreting different page description languages share one memory area, the memory area can be effectively used and processing can be performed in a short time. It is an object of the present invention to provide an image processing apparatus and a control method thereof.

[0009]

According to the present invention, in order to solve the above-mentioned problems, pixel data is generated by interpreting different page description languages for developing drawing work areas in the same memory area. In the image processing apparatus provided with a plurality of interpreting means, one interpreting means may include a part of the drawing work area even when another interpreting means occupies a part of the memory area as the drawing work area. The interpretation of the page description language is started using a free area, and if the free area becomes insufficient during the interpretation, the interpretation is waited until the other interpreting means releases the drawing work area.

Thus, when a shortage of memory occurs during interpretation by one interpreting means, the other interpreting means releases the drawing work area and the interpretation of the page description language by the one interpreting means until the free area is enlarged. Since the postponement is postponed, printing can be performed normally even if one interpreter starts interpretation at the timing when another interpreter occupies a part of the memory area. Therefore, it is possible to prevent the same print data from having different processing results depending on the timing of an instruction from the host device.

Here, the term "drawing work area" means that when interpreting means interprets a page description language to generate pixel data, printing of job information, page information, drawing information, etc. is completed (for example, paper discharge). Completion, job completion), and stores intermediate or temporary data that is deleted afterwards.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An image processing apparatus according to a first aspect of the present invention develops a plurality of drawing work areas in the same memory area, and interprets different page description languages to generate pixel data. And an interpreting means, wherein one interpreting means is provided in the memory area even when another interpreting means occupies a part of the memory area as the drawing work area. The interpretation of the page description language is started using a free area, and if the free area becomes insufficient during the interpretation, the interpretation is waited until the other interpreting means releases the drawing work area.

With this configuration, if a memory shortage occurs during the interpretation by one of the interpreting means, the interpreting means interprets the page description language until the other interpreting means releases the drawing work area and expands the free area. Therefore, even if one interpreter starts interpretation at the timing when another interpreter occupies a part of the memory area, the printing is normally performed, and the same print data is transmitted at the timing of the instruction from the host device. To prevent different printing results.

According to a second aspect of the present invention, in the image processing apparatus according to the first aspect, the interpreting means translates the page description language into an intermediate language, and converts the intermediate language into pixel data. Pixel conversion means, wherein the translation means accumulates the intermediate language in the drawing work area, deletes the intermediate language after the intermediate language is no longer needed, and releases the drawing work area. did.

With this configuration, even if the memory area becomes full due to the intermediate language, the interpreting means of the one interpreting means can execute another interpreting means after the printing by the printing means is completed and the intermediate language becomes unnecessary. After the intermediate language is deleted and the drawing work area is released and the free area is expanded, the translation is restarted. Therefore, one interpretation is performed at the timing when the intermediate language of the other interpreter occupies a part of the memory area. Even if the means starts interpretation, it can be processed normally.

According to a third aspect of the present invention, in the image processing apparatus according to the first or second aspect, the image processing apparatus further comprises a memory management unit for managing storage of data in a memory area,
The memory management unit is configured such that when one interpreting unit requests storage of data in the drawing work area, if there is not enough free space to store the data, another interpreting unit sets the memory area as the drawing work area. It is determined whether a part of the drawing work area is occupied, and if the other interpreting means occupies the memory area, the one interpreting means until the other interpreting means releases the drawing work area. We decided to wait for data to be stored.

With this configuration, the internal processing of the memory management unit determines whether another interpreting unit occupies a part of the memory area, and causes one interpreting unit to wait until the drawing work area is released. Therefore, one interpreting means does not need to check whether another interpreting means occupies a part of the memory area or store the information.

According to a fourth aspect of the present invention, in the image processing apparatus according to the first or second aspect, the interpreting means, when there is not enough free space in the drawing work area when storing data, performs another interpretation. Means as to whether or not a part of the memory area is occupied as the drawing work area; if the other interpreting means occupies a part of the memory area, the other The storage of the data is to be waited until the release of the area is notified.

With this configuration, it is not necessary to provide a means for checking whether or not a part of the memory area is occupied and for storing the information, in addition to the one interpretation means.

According to a fifth aspect of the present invention, in the image processing apparatus according to the first or second aspect, one of the interpreting means is provided when there is not enough free space in the drawing work area when storing data. The interpreting means determines whether or not a part of the memory area is occupied as the drawing work area, and releases the drawing work area if the other interpreting means occupies a part of the memory area. The storage of the data is waited until a possible change in the status of the other interpreting means is detected.

With this configuration, it is not necessary to provide a means for checking whether or not a part of the memory area is occupied and for storing the information in addition to the one interpretation means.

According to a sixth aspect of the present invention, there is provided a printing apparatus equipped with the image processing apparatus according to any one of the first to fifth aspects.

A method for controlling an image processing apparatus according to a seventh aspect of the present invention is a method for controlling a plurality of image processing devices, each of which develops a drawing work area in the same memory area and interprets different page description languages to generate pixel data. A method for controlling an image processing apparatus, comprising: an interpreting means, wherein one interpreting means is used even when another interpreting means occupies a part of the memory area as the drawing work area. The interpretation of the page description language is started using the free area of the area, and if the free area is insufficient during the interpretation, the interpretation is made to wait until the other interpreting means releases the drawing work area. .

According to this method, when a memory shortage occurs during the interpretation by one interpreting means, the other interpreting means releases the drawing work area and expands the free area until the free space is enlarged. Therefore, even if one interpreter starts interpretation at the timing when another interpreter occupies a part of the memory area, the printing is normally performed, and the same print data is transmitted at the timing of the instruction from the host device. To prevent different printing results.

According to an eighth aspect of the present invention, in the control method of the image processing apparatus according to the seventh aspect, when one of the interpreting means requests storage of the data in the drawing work area, it is sufficient to store the data. If there is no free space, it is determined whether another interpreting means occupies a part of the memory area as the drawing work area, and if the other interpreting means occupies a part of the memory area. The one interpreting means waits for storing the data until the other interpreting means releases the drawing work area.

According to this method, one interpreting means does not need to check whether or not another interpreting means occupies a part of the memory area or to accumulate the information.

According to a ninth aspect of the present invention, in the control method of the image processing apparatus according to the seventh aspect, when there is not enough free space in the drawing work area when storing data,
Inquiring to one interpreting means whether or not another interpreting means occupies a part of the memory area as the drawing work area; if the other interpreting means occupies the memory area, the other The storage of the data is waited until the interpreting means notifies that the drawing work area has been released.

According to this method, there is no need to provide a means for checking whether or not a part of the memory area is occupied or for storing the information, in addition to one interpretation means.

According to a tenth aspect of the present invention, in the control method of the image processing apparatus according to the seventh aspect, if there is not enough free space in the drawing work area when storing data, one interpretation means is added to the other. Of the memory area as the drawing work area, and releases the drawing work area when the other interpreting means occupies a part of the memory area. The storage of the data is waited until a status change of the other interpreting means is detected.

According to this method, there is no need to provide a means for checking whether or not a part of the memory area is occupied or for storing the information in addition to one interpreting means.

According to an eleventh aspect of the present invention, there is provided an image processing system comprising: a plurality of interpreting means for developing drawing work areas in the same memory area and interpreting different page description languages to generate pixel data. A program controlled by the apparatus, wherein one interpreting means uses a free area of the memory area even when another interpreting means occupies a part of the memory area as the drawing work area. A computer-readable storage medium storing a program for starting the interpretation of the page description language, and waiting for the interpretation until the other interpretation means releases the drawing work area if the free space is insufficient during the interpretation. It is.

In a twelfth aspect of the present invention based on the eleventh aspect, the program is such that when one of the interpretation means requests storage of the data in the drawing work area, there is not enough free space to store the data. If the other interpretation means occupies a part of the memory area as the drawing work area, it is determined whether the other interpretation means occupies a part of the memory area. The one interpreting means waits for storing the data until the means releases the drawing work area.

According to a thirteenth aspect of the present invention, a program comprises:
If there is not enough free space in the drawing work area when storing data, one interpreting means is inquired to another interpreting means as to whether or not a part of the memory area is occupied as the drawing work area. When another interpreting means occupies the memory area, the storing of the data is waited until the other interpreting means notifies that the drawing work area has been released.

According to a fourteenth aspect of the present invention, in the eleventh aspect, the program is arranged such that if there is not enough free space in the drawing work area when storing data, the program is sent to one interpreting means and to another interpreting means. It is determined whether or not a part of the memory area is occupied as the drawing work area, and the drawing work area can be released when the other interpreting means occupies a part of the memory area. The storage of the data is waited until a status change of another interpreting means is detected.

Hereinafter, embodiments 1 and 2 of the present invention will be described in detail with reference to the drawings.

(Embodiment 1) FIG. 1 is a schematic diagram showing a network in which a laser beam printer as a printing apparatus according to Embodiment 1 of the present invention operates. The laser beam printer 1 is connected to a plurality of host devices via a plurality of different transmission paths. That is, the laser beam printer 1 is connected to a personal computer (hereinafter, referred to as PC) 3 via the parallel cable 2. Further, it is connected to a separation type copier (scanner) 5 via a serial cable 4 such as IEEE1394.
PCs 7 and 8 are connected via a computer network 6 such as a LAN and the Internet. Also, I
The mobile PC 10 is connected via a wireless communication path such as an infrared communication path (hereinafter referred to as IrDA) 9 conforming to rDA. Further, a FAX 12 is connected via an analog / digital public telephone network (PSTN / ISDN) 11.

FIG. 2 is an internal structural view of the laser beam printer according to the first embodiment. The laser beam printer 1 has a paper feed cassette 101 installed at the bottom.
The uppermost recording sheet is taken out of the recording sheet bundle 102 in the sheet cassette 101 by the pickup roller 103. The recording paper taken out of the paper feed cassette 101 is transferred to a registration roller 104. Registration roller 104
, A transfer unit 105 is provided.

The transfer unit 105 has a transfer film 106 on which images of four colors are superimposed and a cleaning device 107 for waste toner, which are covered with a cover 108. A transfer film transport roller 109 is disposed at a portion where the transfer film 106 contacts the recording paper. A transfer roller 110 is provided opposite to the transfer film transport roller 109.

A waste toner box 111 is stored inside the three transfer film transport rollers 109. The waste toner box 111 is connected to the cleaning device 107 via a pipe (not shown). The waste toner removed from the transfer film 106 by the cleaning device 107 passes through this pipe and is stored in the waste toner box 111.

The process unit 113 is the transfer unit 1
It is installed adjacent to 05. Process unit 11
Reference numeral 3 includes a process cartridge 114 of four colors. LSU1 composed of laser drive device, polygon mirror, etc.
15, the photoconductor 11 provided for each cartridge
6, an electrostatic latent image is formed. The electrostatic latent image formed on the photoconductor 116 is overlaid on the same position on the transfer film 106 to form an image. The image formed on the transfer film 106 is transferred to the transfer film transport roller 109 and the transfer roller 1.
10 and is transferred to a recording paper.

A fixing unit 117 is provided at the destination of the recording paper on which the image has been transferred. Fixing unit 11
Reference numeral 7 includes a fixing roller 118 and a pressure roller 119, and a cleaning roller 120 for applying oil for improving the releasability of the toner remaining on the fixing roller 118. A discharge roller 121 is provided at an exit of the fixing unit 117. Discharge sensor 1 near discharge roller 121
22 are provided. The discharge sensor 122 detects whether the discharge of the recording paper has been completed.

FIG. 3 is a block diagram showing a printer controller of the laser beam printer according to the first embodiment.

In the printer controller 200, R
The OM 201 stores font data, control program codes, initialization parameters, and the like. RAM 20
Reference numeral 2 denotes a transmission / reception buffer area for storing transmission / reception data, and a DL for storing DL data obtained by interpreting language data.
It has a storage memory area, a band memory area for storing band data obtained by rasterizing DL data for each band, an environment variable database (DB), and the like.

Further, the printer controller 200
AN interface 203, parallel interface 2
04, IEEE 1394 interface 205 and I
Various external I / O interfaces of the rDA interface 206 are provided. Further, the printer controller 2
00 is an option interface 20 for internally connecting an option board such as the FAX unit 207.
8 is provided.

The printer controller 200 has a printer engine interface 210 for connecting a printer engine 209 such as a paper feed mechanism, a transport mechanism, a photosensitive / developing mechanism, and a paper discharge mechanism shown in FIG. The printer controller 200 includes a display,
An operation panel 211 having buttons and keys is connected.

Further, each of the above components is connected to the system bus 2.
12 and the printer controller 200
Has a CPU 220 for controlling these components.

FIG. 4 is a block diagram showing the main software configuration of the laser beam printer according to the first embodiment. The laser beam printer according to the first embodiment can interpret and print two page description languages.

The laser beam printer 1 performs bidirectional communication with a host device. That is, PDL data and job control / status management language data generated by the printer driver of the host device are transmitted from the host device to the laser beam printer 1 as print data,
Job control / renewal of a setting value (system parameter) of the laser beam printer 1, an inquiry request of a current setting value, a status request of the laser beam printer 1, etc.
Status management language data is sent. These data are called forward data.

On the other hand, from the laser beam printer 1 to the host device, the status of the laser beam printer 1 (jam occurrence, remaining toner amount, etc.), current set values and device profiles (model name, number of cassette stages, optional equipment, etc.) The job control / status management language data is transmitted as a response to the inquiry such as. These data are called reverse data or device status data. The status includes error information indicating a printing error, complete information indicating that printing has been completed normally, current status information indicating that printing is currently in progress, that the laser beam printer 1 is on standby, and the like. It is.

An interface task (hereinafter referred to as an I / F task) 301 controls reception of forward data and transmission of reverse data.

The I / F task 301 includes a plurality of lower tasks for managing various interface drivers prepared for each of the interfaces 203 to 206. The lower tasks are, for example, a network task, a parallel task, an IEEE 1394 task, and an IrDA task.

The job control / status management language / task (hereinafter referred to as “JS task”) 302 has a job control / status
While interpreting the status management language data, extract PDL data, determine what the PDL language is,
Transfer to DL task 303. The JS / task 302 acquires print job control information (number of copies, resolution, job name, and the like) added above the PDL data in the print data, and uses the acquired print job control information as an environment variable to execute a main・ Environment variable database 3 of task 304
06.

As the reverse direction, the environment variables read from the environment variable database 306 and the status from the printer task 305 described later are used as job control / status management language data as the I / F task 30.
Pass to 1.

The job control / status management language is, for example, Printer Job of Hewlett-Packard Company.
b Language (PJL) and international standard Si
Mple Network Management P
protocol (SNMP).

FIG. 5 is a block diagram showing the relationship between each task and the memory management unit in the laser beam printer according to the first embodiment.

The language 1 task 303A interprets and rasterizes PDL data of language 1 passed from the JS task 302 for each page. The language 1 task 303A includes an interpreter (IT) task 401A that interprets language 1 data to generate DL data, and a rasterize (RAS) task 402A that converts the DL data into band data. The DL data generated by the interpreter task 401A is temporarily stored in the DL storage memory area of the RAM 202, and is thereafter read by the rasterization task 402A. Rasterize task 402A is D
The band data obtained by converting the L data is stored in the band memory area of the RAM 202. Language 2 Task 303B
Also has an interpreter task 401B and a rasterizing task 4 having the same functions as the language 1 task 303A.
02B, language 2 passed from JS task 302
Interpret the data.

The main task 304 determines the operation of the entire laser beam printer 1 and manages environment variables / device settings, instructs online / offline, and controls print output.

The main task 304 includes an environment variable database 306. The environment variable database 306 manages the environment variables obtained by the JS task 302 and the environment variables input to the panel.

The printer task 305 includes a rasterization task 402A of the language tasks 303A and 303B,
The band data converted by B is read from the band memory area, and the printer engine 209 is controlled to perform printing.
Also, the printer task 305 is the JS task 302
The current printer engine 2 in response to a status request from
09 to obtain the status of each unit and respond to the JS task 302.

The memory management unit 307 has an I / F task 3
01, JS task 302 and main task 3
In accordance with the control command from the CPU 04, various areas such as a transmission / reception buffer area, a DL storage memory area, a band memory area, and a font cache area are secured in the RAM 202.

When a new job (job control / status management language data + PDL data) comes from the host device, the JS / task 302 analyzes the job control / status management language data. It requests the memory management unit 307 to acquire a memory in order to store the analyzed result as job information (document name, number of copies, language type, etc.). This request is sent to the memory management unit 3 as shown in FIG.
07 <Create_Job> function is called. The JS task 302 stores job information in the memory acquired from the memory management unit 307. After that, JS
The task 302 transfers the extracted PDL data to the corresponding language task 303A or 303B. here,
The description is made on the assumption that the language is language 2 and has been passed to language 2 task 303B.

Language 2 task 30 that knows the start of the job
3B notifies main task 304 of the start of a new job. Thereafter, in the language / task 303B, the PDL in the interpreter / task 401B is set for each page.
Repeat data interpretation and band generation in the rasterizer task. The generated band data is stored in the main task 30
4 from the printer task 305.

Here, the interpreter task 401B
By interpreting the PDL data, information of one page (paper size, sheet cassette designation, etc.) is stored as page information in the memory obtained from the memory management unit 307. Also, drawing information (DL, palette, cached font, etc.) is stored in the memory acquired from the memory management unit 307 as necessary. The drawing information includes data (hereinafter referred to as drawing information type A) that can be deleted when printing of one page such as a DL group is completed, and palettes, download fonts, cached fonts, work bands, and the like.
Data is used over a plurality of pages and is stored until the job is completed (hereinafter referred to as drawing information type B). The interpreter task 401B
In FIG. 5, as shown by <Crea> in the memory management unit 307,
Call the te_Page> function to get the memory that stores the page information. On the other hand, as shown by -a and -b,
Call the <Create_DrawWorK> function to call the memory that stores the drawing information.
And, for type B, b as an argument.
The memory for storing the drawing information is distinguished.

The language 2 task 303 B, which has received the paper ejection completion notification (FIG. 5) from the main task 304, sends the page information for one page and the drawing information type A to the memory management unit 307, respectively. Instruct deletion. This instruction is, as shown by -a and -b in FIG.
This is performed by calling the <te_Page> function and the <Delete_DrawWork> function (argument a).

If it is determined that the paper ejection completion notification is that of the last page of the job, the language 2 task 303B transmits an end job notification (shown in the figure) to the main task 304, The deletion is instructed to the memory management unit. This delete instruction is <Delete_DrawW
ork> by calling a function (argument b) (in the figure).

The main task 304, having received the end job notification, calls the <Delete_Job> function (in FIG. 5) to instruct the memory management unit 307 to delete the job information.

As described above, the JS task 302, the language
The tasks 303A and 303B and the main task 304 acquire necessary memory from one global memory area, and release the memory when it becomes unnecessary.

Regarding the memory management in the first embodiment as described above, looking at the interpreter task level,
When interpreting the PDL command, if interpreter tasks 401A and 401B need to write page information and drawing information to a memory, they acquire an area for storing drawing information (hereinafter referred to as an information storage area). Request to the memory management unit 307. This request is made using a memory acquisition function. The required memory size is added to the memory acquisition function as an argument.

The memory management unit 307 stores the information storage area requested by the interpreter tasks 401A and 401B in RAM.
Attempt to acquire from a free space in the global memory area 603 of 202. The memory manager 307 responds to the interpreter tasks 401A, B with the result of this attempt. The response sets OK or NG to the completion code and returns this. If the completion code is OK, a pointer (start address) of the information storage area is added.

The memory management unit 307 performs a previous job determination. The previous job determination means that the global memory area 6
This is to determine whether or not there is a previous job in another language in 03. This determination can be realized by, for example, checking the language type flag in the job information stored in the memory by the JS task 302.

FIG. 6 is a diagram showing a memory map of the main memory in the laser beam printer according to the first embodiment. When the laser beam printer 1 is activated, the main task 304 executes a system management area 601, a program area 602, and the like on the RAM 202 based on the set values described in the header file stored in the ROM 201 as shown in FIG. The global memory area 603, the transmission / reception buffer 604, the band memory 605, the OS work area 606, and the internal font area 607 are respectively allocated. Language 1 task 303A and Language 2 task 30
3B shares the memory required for the global memory area 603 while acquiring and releasing the memory as needed.

Next, a flow in which the laser beam printer 1 having the above-described software configuration processes a print job transmitted from the host device will be described.

FIG. 7 is a flowchart showing the interpretation processing procedure of the interpreter task of the laser beam printer according to the first embodiment. FIG. 8 is a flowchart showing a memory acquisition procedure in the memory management unit of the laser beam printer according to the first embodiment. First, language 1 task 303
A is processing the last page of the previous job in language 1 and language 2
Is received when the language 2 task 303B processes the current job, and the language 1 task 303A
A case where a part of the global memory area 603 is occupied by the drawing information and the like stored by the user but there is a sufficient free area for activating the language 2 task 303B will be described.

As shown in FIG. 7, language 2 task 303
The interpreter task 401B of B interprets one PDL data command (ST701). Next, it is determined whether the command is a page break command or a job completion command (ST702). If it is not a page break command or a job completion command, it is determined whether or not the information storage area needs to be acquired in global memory area 603 (ST703). If it is not necessary to obtain the information storage area (for example, a paper size command or a paper cassette designation command), the process returns to ST701 to return to the next PD.
Interpret the L command.

On the other hand, when it is necessary to acquire the information storage area, interpreter task 401B calls the memory acquisition function of memory management section 307 (ST704), and checks the return value of memory management section 307 (ST705).

As shown in FIG. 8, the memory management unit 307
Responds to the call and attempts to acquire an information storage area of the size specified by the argument of the memory acquisition function (ST8).
01). Next, it is determined whether or not acquisition is successful (ST
802).

In this example, at the stage of starting interpretation, there is a sufficient free area in the global memory area 603, so that the memory management unit 307 succeeds in acquiring the memory. Therefore, the memory management unit 307 sets the interpreter task 401B
As a return value, a completion code = OK and a pointer of the acquired information storage area are set and returned (ST803).

Returning again to FIG. 7, interpreter task 4
Upon receiving the return value from the memory management unit 307, 01B determines whether the completion code is OK (ST705).
Here, since the completion code is OK, the result of interpretation of page information, drawing information, and the like is stored in the information storage area (ST706). Then, returning to ST701, the next P
Start interpretation of the DL command.

In this way, ST701 to ST706
Are repeated to interpret the PDL command and store it in the memory. At some point, a memory full occurs.
Hereinafter, such a case will be described.

In ST801 of FIG. 8, memory management unit 307 fails to acquire the information storage area because there is no space for the required memory size in global memory area 603. In this case, it is determined by the previous job determination of the memory management unit 307 whether or not the drawing information of the previous job in another language is in the global memory area 603 (ST804). In this example, since the language 1 task 303A occupies the global memory area 603, the memory management unit 307 waits until the memory management unit 307 detects completion of the previous job (ST805).

Here, the completion of the previous job means, for example, the <Delete_DrawWork-b> function shown in FIG.
Call the ete_Job> function, or -a <Delete_Page> or -b <Delete_Dr for the last page
awWork-a> when a function is called.

Thereafter, memory management unit 307 restarts the process and tries to acquire the information storage area again (ST80).
1). When the previous job is completed, the language 1 task 303A releases the occupied memory, and the global memory area 6
Since the vacant area 03 has been expanded, the acquisition of the information storage area has succeeded, and a completion code OK is returned to the interpreter task 401B in ST803.

As described above, when the memory is full, the memory management unit 307 delays the response to the interpreter task 401B until the previous job is completed. As a result, the interpreter task 401B waits for storing the drawing information in the memory until the previous job is completed.

After the memory full is resolved, the interpreter
The task 401B repeats interpretation of the PDL command (ST701 to ST706) until there is a page break command or a job completion command in ST703. If there is a page break command or a job completion command, the rasterization task 402B is instructed to rasterize (ST707). A rasterize task 402B converts the DL data in the drawing information into pixel data. Thereafter, interpreter task 402B determines whether or not the command is a job completion command (ST708). If it is not a job completion command (it is a page break command), the process returns to ST701 to continue interpreting the PD command. On the other hand, if it is a job completion command, an end job flag is set (ST709).

The language 2 task 303B executes the global memory area 603 every time the paper ejection for each page is completed.
Of the page information and the memory area occupied by the drawing information type A. FIG. 9 is a flowchart showing a procedure for releasing a language / task memory in the laser beam printer according to the first embodiment. When the language 2 task 303B receives the paper ejection completion notification shown in FIG. 5 from the main task 304 (ST901), the <Delete_Page> function of the memory management unit 307 and the <Delete_DrawWork-a>
> Call the functions sequentially (ST902, ST903). Next, language 2 task 303B determines whether or not the end job flag is ON (ST904). If the end job flag is not ON, the process is completed. If the end job flag is ON, as shown in FIG.
Issue end job notification to task 304 (ST90
5) Also, as shown in the figure, the memory management unit 307
<Delete_DrawWork-b> function (ST90)
6). Accordingly, the memory management unit 307 deletes the page information and the drawing information type A of each page from the memory after the discharge of each page is completed. When the job is completed, the job information and the drawing information type B are deleted from the memory. Language 1 task 303A also performs a similar memory release procedure.

Next, a case where a memory full occurs when the language 1 task 303A is not processing the previous job will be described. In this case, the acquisition of the information storage area fails in ST802 in FIG. 8, and the previous job determination determines that there is no previous job in another language in ST804. Complete code = NG is set and returned (ST8)
06).

On the other hand, in ST705 in FIG. 7, interpreter task 401B determines that the completion code is not OK, and shifts to an abnormality handling operation (ST710). As an abnormal response operation, for example, when the DL data of a page before the current page remains in the global memory area 603, after printing and discharging of this page are completed, the acquisition of the memory is tried again. . Also, when the image data is included in the DL data of the current page,
The DL data is compressed by, for example, lowering the resolution of the image data or converting the image data into an image format having a higher compression rate. After the compression, the acquisition of the memory is attempted again. If it is not possible to acquire a memory even after taking such measures, divided printing is performed. In division printing, rasterization is performed only on a rendering unit that has been translated into DL data before the memory full occurs, and printing is performed. After printing D
The L data (drawing information type A) is erased to secure a free area, and the remaining drawing units are translated and printed. In this manner, print data that could be printed on one sheet if no memory full occurred is printed on a plurality of sheets.

In the above description, language 1 task 30
3A processes the previous job and the language 2 task 303B processes the current job. On the contrary, the language 2 task 303B processes the previous job, and the language 1 task 303A executes the current task. The same applies to the case where is processed.

As described above, in the printing process of the laser beam printer 1 according to the first embodiment, when the memory full occurs during the translation process of the interpreter / task, the memory management unit 307 determines the language different from that of the current job. If the previous job exists, the response is postponed until the end job of the previous job is detected. As a result, the interpreter task will execute PDL when memory full occurs.
It waits for the interpretation of the command, releases the information storage area occupied by the language / task that processes the previous job, and continues the translation processing after the free area is expanded. Conventionally, when a memory / full condition occurs, the language / task that processes the current job occupies the global memory area 603 with another language / task that processes the previous job in a different language, or the language / task processes the current job. The abnormality handling process is executed without discriminating whether the print data to be used occupies the global memory area 603 largely. In this case, different results occur depending on the timing of executing the current job (presence or absence of a previous job) even for the same print data. However, according to the first embodiment, when the previous job exists, the interpretation of the PDL command of the current job is waited until the previous job is completed, and after the other language / task releases the global memory area 603. Since the interpretation is continued, other languages / tasks will be
Regardless of whether the print data No. 3 is occupied or not, the print result is the same if the print data is the same. In other words, if the print data does not fill the global memory area 603 with page information and drawing information for one page, it is possible to always perform normal printing even if a print instruction is issued from the host device at any timing. . Also, if there is a sufficient free area in the global memory area 603, printing can be executed without waiting for the completion of the previous job.

In addition to the above, the language and
As a means for preventing the occurrence of memory full when the task is switched, the start of the processing of the current job may be postponed until the discharge of the last page of the previous job is completed (hereinafter referred to as a comparative example). Conceivable. However, in the first embodiment, the overall printing speed of the laser beam printer 1 can be improved as compared with the comparative example. This effect will be described with reference to FIGS. FIG. 10A shows the relationship between the processing time and the memory occupancy in the first embodiment.
(B) is a diagram showing the relationship between the processing progress and the memory occupancy in the comparative example. FIGS. 11A to 11E are memory map diagrams at the respective processing times shown in FIG. 10A in the first embodiment. In FIG. 11, for convenience of explanation,
Only the DL group (drawing information type A) and the cache font (drawing information type B) are shown.

First, in the first embodiment, FIG.
As shown in FIG. 10A, the processing time t1 shown in FIG.
0 means 75% of the global memory area 603 is
The font cache 1001 of the task 303A and the DL group 1002 of the last page of the previous job are occupied.
In this state, the language 2 task 303B starts interpreting the first page of the current job using the free area 1003 of the global memory area 603. Then, FIG.
As shown in the figure, at the processing time t15, the language 2 task 30
3B font cache 1004 and DL group 100
5 occupies the entire free area 1003, and a memory full occurs. Here, the language 2 task 303B waits for interpretation. At the processing time t20, when the discharge of the previous job is completed, the language 1 task 303A
001 and the DL group 1002 are deleted, the global memory area 603 is released, and as shown in FIG.
A free area 1003 of 5% is generated. Here, the language 2 task 303B resumes interpretation of the current job, and the processing time t2
5, the font cache 1004 and the DL group 1005 of the language 2 task 303B occupy 50% of the global memory area 603, as shown in FIG. Thereafter, as shown in FIG. 11E, when the paper ejection is completed at the processing time t35, the font cache 1004 and the DL group 1005 are deleted, and the global memory area 603 is released.

On the other hand, in the case of the comparative example, FIG.
As shown in (b), when the font memory 1001 of the language 1 task 303A and the DL group 1002 of the last page of the previous job occupy the global memory area 603 at the processing time t10, the language 2 task 303B
Is waiting without interpreting the current job. And
Only after the discharge of the previous job is completed at the processing time t20 and the language 1 task 303A releases the global memory area 603, the language 2 task 303B starts interpreting the current job. After that, the language 2 task 303B takes the processing time t
30 when the interpretation of the current job is completed, and when the paper ejection is completed at the processing time t40, the font cache 1004 and the DL
The group 1005 is deleted, and the global memory area 603 is released. As described above, according to the first embodiment, printing according to the processing time t15 in the comparative example is performed up to the processing time t40.
Language 1 task 303A in the global memory area 60
Even if a part of the job is occupied, the language 2 task 303B starts interpreting the current job.
It can be reduced to 35.

As described above, according to the first embodiment,
The global memory area 603 can be efficiently used in the laser beam printer 1, the total time required for printing can be reduced, and the reliability of the laser beam printer 1 can be improved.

In particular, in the first embodiment, the interpretation of the current job by the interpreter / task 401B of the language 2 / task 303B is awaited by the internal processing of the memory management unit 307 until the discharge of the previous job is completed. This eliminates the need for the language 2 task 303A (caller) that processes the current job to check the language of the previous job and to hold information on the previous job. The language / task is often distributed by the developer of each page description language, and it is often difficult for the printer manufacturer to change the contents. Therefore, it is not necessary to change the language / task. 1 is preferred.

In the first embodiment, ST8 shown in FIG.
05, the memory management unit 307 waits until the end job of the previous job.
The interpretation of the PDL command of the 3B interpreter task 401B is delayed. However, since the language 1 task 303A occupies the global memory area 603, the case where the memory full occurs during the processing of the language 2 task 303B is not limited to the above case. For example, there may be a case where the language 1 task 303A leaves not only the last page but also the page information and the drawing information type A of the previous page in the memory. In such a case, the discharge is completed without waiting for the end job of the previous job (<Delete_Page> function and / or <Delete_DrawWo
rk-a> call function) interpreter 401B
May be resumed.

It is also conceivable that the language 1 task 303A also retains the job information, page information and drawing information of the job preceding the previous job in the memory. In this case, without waiting for the end job of the previous job, if there is an end job of the previous job (call of the <Delete_Job> function and / or <Delete_DrawWork-b> function), the interpretation of the interpreter 401B is restarted. Is also good.

As described above, according to the present invention, if a memory full occurs while one language / task interprets a PDL command, the end job of the previous job in another language / task, the discharge completion of the previous job, One of the subjects is to wait for interpretation until another language or task releases memory, such as the end job of the job before the previous job, and resume interpretation using the released free space. .

(Embodiment 2) In Embodiment 1 described above,
The internal processing of the memory management unit 307 waits for the interpretation by the language 2 task 303B until the discharge of the previous job is completed. In the second embodiment, a case will be described where an inquiry is made between languages and tasks, and the interpretation of the current job is made to wait until the discharge of the previous job is completed.

The laser beam printer according to the second embodiment has substantially the same network configuration, internal structure, hardware configuration, and software configuration as the laser beam printer according to the first embodiment. Therefore, FIG.
4 to FIG. 4, the description is omitted.

FIG. 12 is a block diagram of a main software configuration in the laser beam printer 1 according to the second embodiment of the present invention, in particular, the lower level included in the main task 304 and the language tasks 303A and 303B. FIG. 3 is a block diagram specifically showing tasks.

In FIG. 12, the same components as those in the first embodiment shown in FIG. 5 are denoted by the same reference numerals, and description thereof will be omitted.

The language 2 task 303 B has an inquiry task 1101. The inquiry task 1101 inquires of the answer task 1102 provided in the language 1 task 303A whether there is a job currently being processed. The inquiry task 1101 makes an inquiry from the answer task 1102 until there is an answer. If the language 1 task 303A detects an end job, the answer task 1102 notifies the inquiry task 1101 of the completion of the job.

Next, a description will be given of a flow in which the laser beam printer 1 having the above-described software configuration processes a print job transmitted from the host device. FIG.
FIG. 3 is a flowchart showing a print processing procedure of an interpreter task of the laser beam printer according to the second embodiment.

The interpreter task 401B according to the second embodiment also has ST701 to ST701 similar to the first embodiment.
The procedure of ST706 is repeated, and PDL commands are interpreted one by one. When a memory full occurs and the response from the memory management unit 307 is “NG” in ST 705, the language task
An inquiry is made to the answer task 1102 of 3A (ST1201). Next, it is determined whether or not language 1 task 303A is processing the previous job based on the answer from answer task 1102 (ST1202).

Here, if it is determined that the language 1 task 303A is processing the previous job, the interpreter task 401B waits for a fixed time (ST1203), inquires again of the language 1 task 303A, 1. It is determined whether the task 303A is processing the previous job (ST1).
201, ST1202). In this way, the interpreter task 401B waits until the language 1 task 303A completes the previous job, in other words, until the discharge of the last page of the previous job is completed (end job).

When language 1 task 303A completes the previous job, interpreter task 401B calls the memory acquisition function again (ST704). Next, the memory management unit 307 determines whether the completion code is OK (S
T705). Here, since the language 1 task 303A has completed the processing of the previous job and has released the drawing information area, the memory management unit 30 does not generate a memory full.
No. 7 can acquire a drawing information area for language 2 task 303B. Therefore, the memory management unit 307
Is completed code = OK, the interpreter task 401B proceeds to ST706 and stores the drawing information in the memory.

On the other hand, a case where a memory full occurs when the language 1 task 303A is not processing the previous job will be described. In this case, in ST705, since the completion code from the memory management unit 307 is NG,
Proceeding to T1201, the inquiry task 1101 inquires the language 1 task 303A. However, since the language 1 task 303A is not being processed, the inquiry task 1101 receives an answer from the answer task 1102 that the job is not being processed. In this case, language 2 task 30
3B occupies the global memory area 603 by itself because the print data currently being processed is large, so that even if the interpreter task 401B is on standby, no space is left in the memory. Therefore, interpreter task 401B
Proceeds to ST1204, and executes an abnormality handling process.

In the above description, language 1 task 30
3A processes the previous job and the language 2 task 303B processes the current job. On the contrary, the language 2 task 303B processes the previous job, and the language 1 task 303A executes the current task. The same applies to the case where is processed. That is, language 1 task 3
03A and the language 2 task 303B include both an inquiry task 1101 and an answer task 1102, and mutually inquire and answer.

As described above, in the printing process in the laser beam printer 1 according to the second embodiment, the interpreter / task 4 of the language 2 / task 303B is used.
01B indicates that the memory management unit 307 returns a completion code = NG, that is, when a memory full occurs,
An inquiry is made to the language 1 task 303A to check whether the language 1 task 303A is processing the previous job.
If the task 303A is processing the previous job, the storage of the drawing information in the memory is delayed until the processing is completed. When the memory becomes full, the interpreter task 401B waits for the interpretation of the PDL command, releases the drawing information area occupied by the language 1 task 303A that processes the previous job, expands the free space, and then interprets the interpretation. Will continue. As a result, the same print data can be normally printed regardless of whether another language or task that processes the previous job in a different language occupies the global memory area 603 or not. Can be.
Also, if there is a sufficient free area in the global memory area 603, printing can be executed without waiting for the completion of the previous job.

As described above, according to the second embodiment,
As in the first embodiment, it is possible to efficiently use the global memory area 603 in the laser beam printer 1, shorten the total time required for printing, and improve the reliability of the laser beam printer 1.

In particular, in the second embodiment, the query / language between language 1 / task 303A and language 2 / task 303B
By giving an answer, the interpretation of the current job by the interpreter task 401B of the language 2 task 303B is awaited until the previous job is completed. As a result, the memory management unit 307 does not need to be changed, so that the same specifications as in the past can be used.

In the second embodiment, language 2 / task 3
03B makes an inquiry to the language 1 task 303A, and upon receiving an answer from the language 1 task 303B that the previous job has been completed, the language 2 task 303B has resumed interpretation of the PDL command. However, the present invention is not limited to this. For example, as described in the first embodiment, the completion of printing of one page, such as the completion of paper ejection, and the completion of two or more previous jobs Things like language 1
An inquiry may be made to the task 303A, and the interpretation may be resumed when the answer is received. Furthermore, the memory usage may be inquired to the language 1 task 303A, and the interpretation may be resumed when the value decreases.

As described above, according to the present invention, when a memory full occurs while one language / task interprets a PDL command, an inquiry and an answer are made with another language / task, and another language / task is executed. One of the subjects is to detect a status change that can release memory in a task and restart interpretation using the released free space. Thus, one language / task does not necessarily need to directly detect that another language / task has released memory,
It is sufficient if there is a status change that can release the memory. However, it is needless to say that directly detecting that another language / task has released the memory is also within the scope of the present invention.

The present invention is not limited to the first and second embodiments, and various changes can be made without departing from the gist of the present invention. For example, in the first and second embodiments, one language / task waits for the interpretation until the other language / task releases the memory when the printing of one page is completed or the printing of the job is completed when the memory becomes full. are doing. However, other languages and tasks may store data used over a plurality of jobs in a memory, such as a macro. This data is not deleted until instructed by another language or task, and occupies the memory. Therefore, one language / task is PD
If a memory full occurs while interpreting L data, it requests other languages / tasks to release such memory,
Interpretation can be waited until another language or task releases the memory. In this case, another language / task does not necessarily need to be in processing of the job.

Further, for example, in the first and second embodiments, a laser beam printer is described as an example, but the present invention can be applied to a page printer in general. In addition, the present invention, such as copiers, facsimile machines, Internet facsimile machines,
The present invention can be applied to various devices equipped with an image forming apparatus.

Furthermore, as will be apparent to those skilled in the art, the present invention can be implemented using a general-purpose commercially available digital computer and microprocessor programmed according to the techniques described in the above embodiments. Also,
As will be apparent to those skilled in the art, the present invention includes software created by those skilled in the art based on the technology described in the above embodiments.

Also, a computer program product that is a storage medium containing instructions that can be used to program a computer implementing the present invention is included in the scope of the present invention. This storage medium includes disks such as floppy disks, optical disks, CDROMs and magnetic disks, and ROs.
M, RAM, EPROM, EEPROM, magnetic or optical card, etc., but are not particularly limited thereto.

[0118]

As described above, even if the memory area is occupied by another interpreting means, the page description language is interpreted, and if there is not enough free space in the memory area, another interpreting means is used. Waits for the interpretation until the memory area is released, it is possible to prevent the same print data from producing different print results depending on the timing of the instruction from the host device. As a result, the memory can be efficiently used in the image processing apparatus. In addition to the use, the processing time can be shortened, and the reliability of the image processing apparatus can be improved.

[Brief description of the drawings]

FIG. 1 is a schematic diagram showing a network in which a laser beam printer according to a first embodiment of the present invention operates.

FIG. 2 is an internal structural diagram of the laser beam printer according to the first embodiment.

FIG. 3 is a block diagram showing a printer controller of the laser beam printer according to the first embodiment.

FIG. 4 is a block diagram showing a software configuration of the laser beam printer 1 according to the first embodiment.

FIG. 5 is a block diagram showing a relationship between each task and a memory management unit in the laser beam printer according to the first embodiment.

FIG. 6 is a diagram showing a memory map of a main memory in the laser beam printer according to the first embodiment.

FIG. 7 is a flowchart showing the interpretation processing procedure of the interpreter task of the laser beam printer according to the first embodiment.

FIG. 8 is a flowchart showing a memory acquisition procedure in a memory management unit of the laser beam printer according to the first embodiment.

FIG. 9 is a flowchart showing a language / task memory release procedure in the laser beam printer according to the first embodiment.

10A is a diagram illustrating a relationship between a processing time and a memory occupancy in the first embodiment, and FIG. 10B is a diagram illustrating a relationship between a process progress and a memory occupancy in a comparative example;

FIGS. 11A to 11E are memory map diagrams at respective processing times in the laser beam printer according to the first embodiment.

FIG. 12 is a block diagram of a software configuration in the laser beam printer according to the second embodiment of the present invention.

FIG. 13 is a flowchart showing a print processing procedure of an interpreter task of the laser beam printer according to the second embodiment.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Laser beam printer 2 Parallel cable 4 Serial cable 6 Computer network 200 Printer controller 201 ROM 202 RAM 203 LAN interface 204 Parallel interface 205 IEEE1394 interface 206 IrDA interface 207 FAX unit 208 Option interface 209 Printer engine 210 Printer engine interface 211 Operation panel 212 System Bus 220 CPU 301 I / F task 302 JS task 303A Language 1 task 303B Language 2 task 304 Main task 305 Printer task 307 Memory management unit 401A, B Interpreter task 402A, B Rasterize task 603 Global Moly area

Continuation of the front page (72) Inventor Hiroaki Miyamune 1006 Kadoma, Kazuma, Osaka Prefecture F-term in Matsushita Electric Industrial Co., Ltd. (reference) 2C087 AB06 BC02 BC04 BC05 BC06 BC07 BD01 BD12 BD13 BD42 5B021 AA01 CC05 DD10 EE01 9A001 BB03 DD08 JJ35

Claims (14)

[Claims] 1. An image processing apparatus comprising: a plurality of interpreting means for interpreting different page description languages to generate pixel data by respectively developing drawing work areas in the same memory area; The interpreter starts interpreting the page description language using a free area of the memory area even when another interpreter occupies a part of the memory area as the drawing work area. The image processing apparatus according to claim 1, wherein, if the free space is insufficient, the interpreting unit waits until the other interpreting unit releases the drawing work area. 2. The interpreting means comprises: a translating means for translating the page description language into an intermediate language; and a pixel converting means for converting the intermediate language into pixel data, wherein the translating means converts the intermediate language into the intermediate language. 2. The image processing apparatus according to claim 1, wherein the intermediate language is stored in a drawing work area, and after the intermediate language is no longer needed, the intermediate language is deleted to release the drawing work area. A memory management unit that manages storage of data in a memory area, wherein the memory management unit stores the data when one interpretation unit requests storage of data in the drawing work area. If there is not enough free space, determine whether another interpreting means occupies a part of the memory area as the drawing work area, and if the other interpreting means occupies the memory area. 3. The image processing apparatus according to claim 1, wherein said one interpreting means waits for storing said data until said other interpreting means releases said drawing work area. 4. An image processing apparatus according to claim 1, wherein, when storing data, if there is not enough free space in the drawing work area, the other interpreting means occupies a part of the memory area as the drawing work area. Inquiring whether the other interpreting means occupies a part of the memory area and waiting for storing the data until the other interpreting means notifies that the drawing work area has been released. The image processing apparatus according to claim 1 or 2, wherein: 5. An interpreting means for determining whether a part of a memory area is occupied by the other interpreting means as the drawing work area when there is not enough free space in the drawing work area when storing data. If the other interpreting means occupies a part of the memory area, the data is stored until a status change of the other interpreting means is detected so as to release the drawing work area. The image processing apparatus according to claim 1, wherein the image processing apparatus waits for the image processing. 6. A printing apparatus equipped with the image processing apparatus according to claim 1. 7. A method for controlling an image processing apparatus, comprising: a plurality of interpreting means for developing pixel drawing work areas in the same memory area and interpreting different page description languages to generate pixel data. Even if one interpreting means occupies a part of the memory area as the drawing work area, the interpretation of the page description language is started using a free area of the memory area. Controlling the image processing apparatus to wait for the interpretation until the other interpretation means releases the drawing work area if the free space is insufficient during the interpretation. 8. When one interpreting means requests storage of data in a drawing work area and there is not enough free space to store the data, the other interpreting means sets one of the memory areas as the drawing work area. It is determined whether or not a part is occupied, and when the other interpreting means occupies a part of the memory area, the one interpreting means is used until the other interpreting means releases the drawing work area. 8. The control method according to claim 7, further comprising waiting for storing the data. 9. When storing data, if there is not enough free space in the drawing work area, one interpreting means occupies a part of the memory area as the drawing work area with respect to another interpreting means. Inquiring whether or not, if the other interpreting means occupies the memory area, it waits to store the data until the other interpreting means notifies that the drawing work area has been released. The method for controlling an image processing apparatus according to claim 7. 10. When there is not enough free space in the drawing work area when storing data, one interpretation means includes:
When the other interpreting means occupies a part of the memory area as the drawing work area, it is determined whether the other interpreting means occupies a part of the memory area. 8. The control method according to claim 7, further comprising waiting for storing the data until a status change of the other interpreting unit that can be released is detected. 11. A program for controlling an image processing apparatus, comprising: a plurality of interpreting means for developing drawing work areas in the same memory area and interpreting different page description languages to generate pixel data. Therefore, even if another interpreting means occupies a part of the memory area as the drawing work area, one interpreting means interprets the page description language using a free area of the memory area. A computer-readable storage medium storing a program to start and wait for the interpretation until the other interpretation means releases the drawing work area if the free space is insufficient during the interpretation. 12. A program according to claim 1, wherein when one interpreting means requests storage of data in a drawing work area and there is not enough free space to store the data, the other interpreting means sets a memory as the drawing work area. It is determined whether or not a part of the area is occupied. If the other interpreting means occupies a part of the memory area, the one interpreting means is released until the other interpreting means releases the drawing work area. 12. The storage medium according to claim 11, wherein an interpreting unit is made to wait for storing the data. 13. The program, if there is not enough free space in the drawing work area when storing data, causes one interpreting means to occupy a part of the memory area as the drawing work area for another interpreting means. Inquiring whether the other interpreting means occupies the memory area, and waiting for storing the data until the other interpreting means notifies that the drawing work area has been released. The storage medium according to claim 11, wherein: 14. When storing a data, the program occupies a part of the memory area as one drawing work area for one interpreting means when there is not enough free space in the drawing work area for another interpreting means. Whether the other interpreting means occupies a part of the memory area, and detects the status change of the other interpreting means such that the drawing work area can be released. 12. The storage medium according to claim 11, wherein the storage medium is made to wait for storing.