JPH09188011A - Apparatus and method for controlling memory means - Google Patents

Abstract

PROBLEM TO BE SOLVED: To minimize the memory region recovered from a memory mean when the memory capacity of the predetermined memory region of the memory becomes insufficient with respect to the memory capacity necessary for command processing. SOLUTION: When a command is sent from a host computer 1, the demand quantity of the memory capacity of a predetermined memory region using the command is discriminated to judge whether or not the present memory capacity of the predetermined memory region is insufficient with respect to the demand quantity of the memory capacity. When the memory capacity is judged to be insufficient, the memory region becoming unnecessary in the memory region is successively selected on the basis of the preferential degree of the memory region by the quantity corresponding to insufficient capacity to be recovered. When the totalized value of the memory capacity of the recovered memory region reaches an insufficient capacity, the recovery of the memory region is completed. If necessary, the rearrangement of the memory region after recovery or the selection of a memory region to be recovered is performed so that the recovered memory region continues. By this constitution, the recovery of the memory region storing important data such as frequently used data can be suppressed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an output device for receiving data transmitted from an external device such as a host computer and outputting the data such as printing and displaying, and more particularly to an external device such as a host computer. The page description code sent from the device is once converted into intermediate data such as run length data, vertex coordinate data, bitmap data, etc., and the converted intermediate data is expanded into bitmap data. Belongs to the technical field of output devices for printing, displaying, etc.

[0002]

2. Description of the Related Art In a host computer such as a personal computer, an operator draws a screen by using a page description language, that is, by inputting codes or data defining the screen. This page description language is designed to be easy for an operator to recognize and to reduce the number of input data. An example is shown in FIG. In the figure, for example, page description code 101 shows an example of the page description code for drawing a circle having a center coordinate of (1000, 1875) and a radius of 500 in black. Hereinafter, the page description code refers to data defining a figure or character input according to the page description language.

A screen drawn by an operator is used as an output device such as an ink jet printer, a thermal transfer printer, or the like.
Bit map data corresponding to the screen is required for printing and displaying by a printing device such as a laser beam printer or a display device. This bitmap data has 1-bit data indicating the presence or absence of display or printing for each dot or pixel corresponding to the two-dimensional position on the output of the output device. For example, as shown in FIG. 2481 x 350
2481 for a 1-page screen composed of 8 pixels
It has a data length of × 3508 bits.

When the function of the output device is low, the page description code is expanded into bit map data on the host computer side and the expanded bit map data is sent to the output device.

Since this system imposes a heavy burden on the host computer, a system is used in which the output device is highly functionalized and the process of expanding the page description code into bit map data is performed on the output device side. When the page description code is expanded to bitmap data on the output device side, the host computer
A method for converting page description data sent from the data into intermediate data that can be easily expanded into bit map data is widely used. For example, when the page description code is a code "drawing a circle", it is converted into data indicating a regular polygon having many vertices. Then, the converted intermediate code is expanded into bit map data and output to the output means. When the page description code is converted into the intermediate data and the converted intermediate code is expanded into the bit map data as described above, the page description code is directly expanded into the bitmap data. Thus, the bit map data can be expanded at high speed.

Various formats have been proposed for the intermediate data, and an example of converting the curve figure into the vertex coordinate data indicating each vertex of the approximated straight line figure (referred to as the vertex coordinate format) as described above. , An example of converting coordinate data indicating a print start position and a print end position for each scanning line of a pixel forming means (for example, a laser in the case of a laser printer) (called a run length format), a bit map data corresponding to a page description code -When the data is already stored in the storage means, an example of converting it into a storage address indicating the position where the bitmap data is stored, or bitmap data
There is an example in which it is processed as intermediate data after being expanded into data. In the case of the last example, since the intermediate data already developed in the bitmap data is used, the intermediate data may be output as it is. In addition, the same output device converts plural page description codes into run length format intermediate data and other specific description codes into vertex coordinate format intermediate data. Sometimes it has intermediate data.

In developing the intermediate data into bitmap data, one page of intermediate data is bitmapped data.
There is a method of expanding the data into a plurality of areas (bands) and a method of expanding intermediate data into bitmap data for each area (called a band processing method). The former method is a method of preparing a storage means (called a page memory) for storing one page of bitmap data. On the other hand, in the latter method (band processing method), one page is divided into a plurality of areas, an intermediate code is stored for each area, and the intermediate code can be expanded into bitmap data. Is prepared, and the intermediate code of each area is sequentially expanded into bitmap data while alternately using the storage means. According to this method, it is sufficient to use at least two storage means having a storage capacity capable of expanding the intermediate code of one area in one page into the bitmap data, so that the intermediate code can be set in units of one page. The total storage capacity of the storage means for storing the expanded bit map data can be smaller than that of the method of expanding the bit map data into the bit map data.

[0008]

In such an output device, when a large amount of image data, complicated data, etc. are sent from the host computer side, the predetermined storage of the storage means is performed. The storage capacity of the area, for example, a storage area for storing intermediate data or a work storage area for temporarily storing various data when processing commands may be insufficient with the current storage capacity. is there. The conventional storage device management device is
When the storage capacity of a predetermined storage area of the storage means is insufficient, the storage area that is no longer needed, for example, a storage area such as a cache memory, is collected. Therefore, even if it is not necessary to collect all the cache memory,
Since the cache memory that stores frequently used data, such as the font cache memory that stores the font data obtained by expanding the outline font into bitmap data, the font data is also collected. It was necessary to re-register to the font cache memory of. However, since it takes time to register font data in the font cache memory, printing,
There is a problem that the processing time for displaying and the like is delayed. The present invention was devised in order to solve the above-mentioned problems, and is a storage means capable of suppressing the storage area to be recovered to the minimum necessary when the storage capacity of a predetermined storage area of the storage means is insufficient. It is an object of the present invention to provide a management device and a management method of a storage unit.

[0009]

In order to solve the above-mentioned problems, the invention according to claim 1 stores data in a predetermined storage area based on an input command, code data or the like. The storage unit management device stores the priority storage unit that stores the priority of a predetermined storage area of the storage unit, and the storage capacity of the predetermined storage area of the storage unit is insufficient for the storage capacity request amount. In this case, an area collection unit that selects and collects an unnecessary storage area out of the storage areas of the storage unit based on the priority of the storage area as much as the insufficient capacity is satisfied. The storage device management apparatus according to claim 1, wherein when the storage capacity of a predetermined storage area of the storage means is insufficient with respect to the storage capacity request amount, the area collecting means is unnecessary in the storage area of the storage means. The storage capacity of the predetermined storage area of the storage means is increased by selecting and recovering the storage area that has become the storage area that satisfies the insufficient capacity based on the priority of the storage area. As a result, the storage area to be collected can be suppressed to the necessary minimum, and the processing time of the output device can be prevented from being delayed.

[0010] The invention described in claim 2 is the same as the claim 1.
In the management device of the storage means described in (1), there is provided a priority changing means for changing the priority of the storage area stored in the priority storage means. In the storage unit management device according to the second aspect, when the process of using the data stored in the specific storage region is frequently used, the priority changing unit changes the priority of the storage region. Thereby, the priority of the storage area can be changed according to the usage state.

[0011] The invention according to claim 3 is based on claim 1.
Alternatively, in the management device of the storage means according to the second aspect, the area collection means determines a storage capacity request amount of a predetermined storage area used for processing of the command based on the input command, and the storage capacity request. The amount is compared with the storage capacity of the predetermined storage area to determine the insufficient capacity. A storage means management device according to claim 3 determines a storage capacity required amount of a predetermined storage area used for processing of a command based on a command sent from an external device such as a host computer, Further, when the current storage capacity of the predetermined storage area is less than or equal to the storage capacity request amount, the difference is calculated and defined as the insufficient capacity. This makes it possible to easily determine whether or not the storage capacity of the predetermined storage area of the storage means is insufficient, and to easily determine the insufficient capacity.

The invention described in claim 4 is the first invention.
In the management device of the storage means described in any one of
The area collection means is configured to select and collect the storage areas in order of decreasing priority. When reclaiming a storage area, the management device of the storage means according to claim 4 sequentially selects and reclaims from the storage area having a low priority. This allows
The storage area with high priority can be saved as much as possible.

The invention according to claim 5 is the same as claim 5
In the management device of the storage means described in (3), when the plurality of collected storage areas are not continuous, an area arrangement means for rearranging the storage areas of the storage means is arranged so that the plurality of collected storage areas are continuous. Set up. When the storage unit management apparatus according to the fifth aspect collects the storage areas in ascending order of priority, the plurality of collected storage areas may not be continuous. However, depending on a command sent from an external device such as a fosso computer, a continuous storage area may be required as a predetermined storage area to be used for the processing, so the area arranging means uses a plurality of collected storage areas. When the areas are not continuous, the storage areas of the storage means are rearranged so that the plurality of collected storage areas are continuous. This makes it possible to secure a continuous storage area as the predetermined storage area.

[0014] The invention according to claim 6 is the first invention.
In the management device of the storage means described in any one of
The area collection unit is configured to select and collect continuous storage areas that satisfy the storage capacity requirement. According to a sixth aspect of the present invention, the management device of the storage means selects, when recovering a storage area, a continuous storage area in which the recovered storage area satisfies the required storage capacity. With this, it is possible to secure a continuous storage area as a predetermined storage area without rearranging the storage area of the storage unit after the storage area is collected.

In order to solve the above-mentioned problems, the invention according to claim 7 is a storage means for storing data in a predetermined storage area based on an input command or code data. In the management method, when the storage capacity of a predetermined storage area of the storage means is insufficient with respect to the storage capacity request amount, the storage area that is no longer needed among the storage areas of the storage means is filled with the insufficient capacity. It is configured to select and collect based on the priority of. The management method of the storage means according to claim 7, wherein when the storage capacity of a predetermined storage area of the storage means is insufficient with respect to the storage capacity request amount, the storage area that is no longer needed Is selected and collected based on the priority of the storage area corresponding to the insufficient capacity, thereby increasing the storage capacity of the predetermined storage area of the storage means. As a result, the storage area to be collected can be suppressed to the necessary minimum, and the processing time of the output device can be prevented from being delayed.

The invention described in claim 8 is the same as the claim 7.
In the management method of the storage means described in (3), the storage capacity request amount of the predetermined storage area used for the command is determined based on the input command, and the storage capacity request amount and the storage capacity of the predetermined storage area are also determined. It is configured so as to determine the insufficient capacity by comparing with. The storage means management method according to claim 8 determines a storage capacity required amount of a predetermined storage area used for processing of a command based on a command sent from an external device such as a host computer, Further, when the current storage capacity of the predetermined storage area is less than or equal to the storage capacity request amount, the difference is calculated and defined as the insufficient capacity. This makes it possible to easily determine whether or not the storage capacity of the predetermined storage area of the storage means is insufficient, and to easily determine the insufficient capacity.

The invention described in claim 9 is the same as claim 7
Alternatively, in the management method of the storage means described in 8, the storage areas are selected and collected in ascending order of priority.
According to the storage means management method of the ninth aspect, when the storage areas are collected, the storage areas are selected and collected in ascending order of priority. As a result, a storage area having a high priority can be saved as much as possible.

According to a tenth aspect of the present invention, in the storage means management method according to the ninth aspect, when the plurality of collected storage areas are not continuous, the collected storage areas are continuous. Further, the storage area of the storage means is rearranged. In the storage unit management method according to the tenth aspect, when the storage areas are collected in the order of low priority, the plurality of collected storage areas may not be continuous. However, some commands sent from the FOSCO computer may require a continuous storage area as a predetermined storage area to be used for the processing, so if multiple recovered storage areas are not continuous, The storage areas of the storage means are rearranged so that the plurality of collected storage areas are continuous. This makes it possible to secure a continuous storage area as the predetermined storage area.

Further, the invention according to claim 11 is the management method of the storage means according to claim 7 or 8, wherein the continuous storage area satisfying the storage capacity requirement is selected and collected. . According to the storage means management method of the eleventh aspect, when the storage area is collected, a continuous storage area in which the collected storage area satisfies the storage capacity requirement is selected and collected. With this, it is possible to secure a continuous storage area as a predetermined storage area without rearranging the storage area of the storage unit after the storage area is collected.

[0020]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of a storage unit management apparatus and a storage unit management method according to the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram of an example of an output device to which the present invention is applied. The output device is a host computer.
Is connected to the control circuit 2 via the communication line 5 and the control circuit 2,
A panel 3 for performing various displays and setting of parameters, and a print engine 4 as an output unit are provided. Control circuit 2
Is an input interface circuit (I /
F) 11, CPU (central processing unit) 12, ROM (read only memory) 13, RAM (read / write memory) 14 as storage means, input / output interface circuit (I / I)
F) 15 and an output interface circuit (I / F) 16. These components are the communication bus 1
7, and exchanges data via the communication bus 17.

In the ROM 13, a program for receiving a page description code or the like sent from the host computer 1 and storing it in the reception buffer 28, and a page description code or the like stored in the reception buffer 14 are intermediate. A program for converting the data into intermediate data, a program for expanding the intermediate data into bitmap data, a program for outputting the expanded bitmap data to the print engine 4 via the output interface circuit 16, and parameters. A program for collecting the storage area of the RAM 14 based on a parameter indicating the priority of the storage area stored in the memory 27, a program for reallocating the storage area of the RAM 14 after collecting the storage area, and a parameter memory The RAM 14 is returned to the state before the storage area is recovered on the basis of the parameter indicating the return mode stored in 27. A program for changing the parameters stored in the parameter memory 28 based on various displays on the panel 3 and the operation of the panel 3 via the input / output interface 15 is stored. There is. The ROM 13 also has a font ROM which stores bitmap data and outline data forming a character specified by the character description code included in the page description code.

The RAM 14 has an intermediate data memory 21 for storing an intermediate code, a page memory 22 for storing one page of bitmap data expanded from the intermediate code, and an intermediate page description code. A data temporarily storing various data in a process of converting the data into intermediate data, a process of expanding the intermediate data into bitmap data, a process of outputting the bitmap data to the print engine 4, and the like. Memory 23, parameter memory 24 for storing various parameters, reception buffer 25 for storing received data, cache memory 26 for temporarily storing data that is likely to be used in the future, etc. have.

The cache memory 26 of the RAM 14 is constructed as shown in FIG. 6a, for example. In FIG. 6a, a cache memory 26 is a reprint data cache memory 31, a user path cache memory 32, a form cache memory 33, a pattern cache memory 34, a circle cache memory 35, and a screen. The cache memory 36 and the font cache memory 37 are included. The reprint data cache memory 31 is a memory for storing the printed data until the next page of print data is input, and the user path cache memory 32 is defined by the user. The form cache memory 33 is a memory for storing a collection of drawn figures, a logo, and the like. The form cache memory 33 stores the form of a form having ruled lines and entry fields like a slip.
The pattern cache memory 34 is a memory for storing mats, the pattern cache memory 34 is a memory for storing pattern data such as hatching used when painting an area, and the circle cache memory 35 is a circular figure such as a straight seam. , The screen cache memory 36 is a memory for storing a bit map when an area is painted in halftone, and the font cache memory 37 is a memory for storing a character shape or a bit map.

In FIG. 1, an intermediate data memory for storing one page of intermediate data and a page memory for storing one page of bitmap data expanded from the intermediate code are used. I have shown the output device of the method that processes on a page-by-page basis.
For example, as shown in FIG. 3, a band (1) obtained by dividing one page into four
Band processing is performed using a plurality of band memories for storing intermediate data for each band such as band (4) and at least two band buffers for storing bitmap data developed for each band. A system output device may be used.

The intermediate data stored in the intermediate data memory 21 is composed of a packet and shape intermediate data or a packet and character intermediate data. Each packet is provided for each page description code and has an identifier, color data, and position data.
It is composed of data and point data. The identifier is
In what format the intermediate data is stored, for example, is the address of the font ROM specified, is the intermediate shape data group or the polygonal shape data in the cache memory specified? Alternatively, it indicates whether the address of the run length data or the bit mat data in the cache memory is designated. The color data indicates the color of characters and figures and is obtained from the page description code. The position data indicates the position of a character or graphic on a page, and is determined from the page description code or the order in which the page description code is sent. The pointer data is an address indicating a storage location of intermediate data corresponding to the shape of a character or a figure. For example, when the curve is approximated by a polygon, the stored address of the vertex coordinate data defining the shape of the polygon is indicated. If the page description code is a character code, the character code
The address of the font ROM in which the bitmap data of the character corresponding to the code is stored is shown. If the data is already stored in the cache memory,
Indicates the address of the cache memory. Shape intermediate data other than a predetermined pattern such as characters, for example, intermediate data or run length data defining a polygon is stored in the intermediate shape data group storage area,
The pointer data indicates the address.

In the case of the output device shown in FIG. 1, when the page description code is stored in the reception buffer 25, it is converted into intermediate data of a format suitable for the type of the page description code and converted. The stored intermediate data is stored in the intermediate data memory 21.
Then, the intermediate data is expanded into bit map data and stored in the page memory 22 to output one page.

The storage means and the priority storage means in the present invention correspond to the RAM 14, and the priority changing means and the mode setting means correspond to the panel 3. The area collecting means and the area arranging means in the present invention operate according to a program stored in the ROM 13
Has been realized.

Next, when the storage capacity of the predetermined storage area of the RAM 14 shown in FIG. 1 is insufficient, an area recovery process for recovering the storage area of the RAM 14 to increase the storage capacity of the predetermined storage area of the RAM 14. The operation of will be described. The cache memory is for storing data or the like which is not necessary immediately for performing the current processing but is likely to be used in the future. Therefore, the case where the cache memory is the object of collection will be described.

Priority is given to each of the cache memories 31 to 37. This priority is stored in the parameter memory 24 as a parameter indicating the priority of each cache memory. The priority of each cache memory is generally
Although it is preliminarily set assuming the user, the data stored in a specific cache memory may be used depending on the user. Therefore, the cache memory of each cache memory stored in the parameter memory 24 may be used. A priority changing means for changing the priority is provided. As the priority changing means, for example,
The panel 3 for performing key operations or the keyboard of the host computer 1 is used.

Various methods can be used to determine the unnecessary cache memory among the cache memories. One example will be described. Each cache data stored in the cache memory is referred to by the intermediate data, that is, the pointer data of the intermediate data is the address of the cache data stored in the cache memory. It has a reference counter for identifying what is being shown. For example, when the pointer data of the intermediate data corresponding to the character data "A" indicates the address of the data "A" stored in the font cache memory, the data of the font cache memory. The reference counter of "A" becomes "1". The value of the reference counter is incremented every time the pointer data in the intermediate data indicates the address of the data "A" in the font cache memory. That is, the value of the reference counter is a value according to the number of times the reference is made in the intermediate data. When the intermediate data is expanded into the bitmap data, the intermediate data which referred to the cache data disappears, so that the value of the reference counter of the cache data is decreased. The state where the value of the reference counter is "0" means that there is no reference from the intermediate data. Therefore, it is possible to determine whether or not each cache memory is no longer needed based on the value of the reference counter of each cache data stored in each cache memory.

The operation of changing the priority of each of the cache memories 31 to 37 by operating the key on the panel 3 will be described with reference to FIG. Normally, [READY] is displayed on the panel 3. (Fig. 4a) In this state, the "Online" key is operated to display [OFF LINE] on the panel 3. (Fig. 4b) Next, operate the "MENU" key to display [Cac
he Priority? ] Is displayed. (Fig. 4c) In this state, operate the "SET" key to display [Cache memory name ("FONT" in the figure) and priority 1] on the panel 3.
Is displayed. (FIG. 4d) When the priority of the font cache memory is set to 1, the "SET" key is operated in the state of FIG. 4d. As a result, the priority of the font cache memory is set to 1, and the next cache memory name is displayed on the panel 3. When the "NEXT" key is operated once in the state of FIG. 4d, the priority changes to 2. (FIG. 4e) When the priority of the font cache memory is set to 2, the "SET" key is operated in the state of FIG. 4e. As a result, the priority of the font cache memory is set to 2, and the next cache memory name is displayed on the panel 3.

Next, an embodiment of a process for recovering the storage area of the cache memory 26 when the capacity of the predetermined storage area of the RAM 14 shown in FIG. 1 is insufficient is shown in the flowchart of FIG. It will be explained based on. Based on the command sent from the host computer 1, the required storage capacity of a predetermined storage area such as the intermediate data memory and the work memory can be determined. For example, when both the image data processing command and the image data amount are sent, the required storage capacity of the storage area can be determined based on the image data amount, and the specific storage capacity can be determined. For the command, the storage capacity required amount of the storage area used for the processing of the command is stored in the ROM 13 in advance, so that the determination can be made based on that. Therefore, step (a1)
Then, the storage capacity requirement of the predetermined storage area is determined based on the command input from the host computer 1, and whether the current storage capacity of the predetermined storage area is insufficient with respect to this storage capacity requirement. If it is determined that the storage capacity is insufficient, the shortage capacity is calculated, and the process proceeds to step (a2). If the storage capacity is not insufficient, the storage area collection process ends. In step (a2), the cache memories 31 to 31
It is determined whether or not there is an unnecessary cache memory out of 37. If there is an unnecessary cache memory, the process proceeds to step (a3), and if there is no unnecessary cache memory, the process proceeds to step (a5). In step (a3), the cache memory with the lowest priority among the unnecessary cache memories is selected and collected based on the priority of the storage area stored in the parameter memory 24, and then step (a4). Proceed to. In step (a4), the storage capacity of the collected cache memory is totaled, and it is judged whether or not the total collected capacity has reached an insufficient capacity. If not, the process returns to step (a2) and becomes unnecessary cache. The memory recovery process is continued, and if the insufficient capacity is reached, this storage area recovery process is terminated. In step (a5), an error process such as displaying an error message such as insufficient storage capacity or re-running the printing process is executed, and then the storage area collecting process is terminated.

FIG. 6 shows an arrangement state of the storage areas of the RAM 14 when the cache memories are collected in the order of low priority. It is assumed that the RAM 14 is in an arrangement state as shown in FIG. 6a before the storage area is collected. The reprint data cache memory 31 has a storage capacity of 100 Kbytes, and the user-pass cache memory 32 has a storage capacity of 10 Kbytes.
K bytes, the storage capacity of the form cache memory 33 is 20 Kbytes, the storage capacity of the pattern cache memory 34 is 30 Kbytes, the storage capacity of the circle cache memory 35 is 10 Kbytes, and the screen cache memory 3
6 has a storage capacity of 50 Kbytes, and the font cache memory 37 has a storage capacity of 30 Kbytes. The priority levels of the cache memories 31 to 37 are font cache memory, screen cache memory, user path cache memory, and font cache memory. The memory cache memory, the pattern cache memory, the circle cache memory, and the reprint data cache memory are set in this order.

For example, the current storage capacity of the work memory 23 is 1 with respect to the required storage capacity of the work memory for processing the command sent from the host computer 1.
When it is determined that there is a shortage of 50 Kbytes (step a
1) The shortage capacity is calculated, and it is determined whether there is an unnecessary cache memory among the cache memories 31 to 37 (step a2). Now, the reprint data
If the data cache memory 31, the user path cache memory 32, the form cache memory 33, the pattern cache memory 34, and the circle cache memory 35 are no longer needed, the cache memory that has become unnecessary is given priority within the cache memory. The reprint data cache memory 31 having the lowest frequency is collected (step a3). Since the storage capacity of the reprint data cache memory 31 is 100 Kbytes, the recovery capacity is 100 Kbytes. Therefore, since the collected capacity has not reached 150 Kbytes (step a4), the circle cache memory 3 with the next lowest priority is stored.
Collect 5. In the same manner, the pattern cache memory 34 and the form cache memory 33 are collected in the ascending order of priority. When the form cache memory 33 is recovered, the recovery capacity becomes 160 Kbytes, and since the insufficient capacity reaches 150 Kbytes, the recovery of the storage area is completed. Then, the collected cache memories 31, 33-
35 is used as a work memory. An arrangement state of the storage area of the RAM 14 after the cache memory is collected in this way is shown in FIG. 6b.

In the above embodiment, the shortage of the storage capacity of the current work memory 23 with respect to the storage capacity required for command processing is calculated, and the cache memory is collected for the shortage. Depending on the command, a continuous storage area may be required as a storage area used for processing the command. In such a case, the shortage capacity is not calculated and the shortage capacity is not set as the collection capacity, but the storage capacity required amount necessary for the processing of the command is set as the collection capacity. On the other hand, when the storage areas are collected in ascending order of priority, the plurality of collected storage areas are often not continuous as shown in FIG. 6b. If the collected storage areas are not continuous, the command that requires the continuous storage area cannot be processed. Therefore, if the collected storage areas are not continuous, the collected storage areas Area arranging means for rearranging the memory areas of the memory means so that the memory areas of the memory area become one continuous memory area. Now, when processing a command that requires a continuous storage area of 150 Kbytes, the storage capacity of the current storage area is insufficient, so 150 Kbytes of unnecessary cache memory are collected in ascending order of priority. In the case of the arrangement state as shown in FIG. 6b, the area arrangement means rearranges the storage area of the RAM 14 so that the collected cache memories are continuous.
For example, as shown in FIG. 6c, the storage user path cache memory 3 between the plurality of retrieved cache memories
The cache memories 31 and 33 recovered by copying the second data, changing the address pointer indicating the storage area, etc.
Rearrange so that 35 and 35 are continuous. Alternatively, when the plurality of collected storage areas are not continuous, the storage areas between the plurality of storage areas, that is, the user path cache in FIG. The memory 32 may also be collected at the same time.

In the above, the cache memories that have become unnecessary are collected in the order of low priority, and after the collection, the storage areas of the RAM 14 are rearranged so that the storage areas collected by the area collecting means are continuous. When collecting the cache memory, the storage area to be collected may be selected so that one continuous storage area satisfying the storage capacity requirement is secured. This operation will be described with reference to FIG. 6d. First, the reprint data cache memory 31 having the lowest priority among the unnecessary cache memories is selected and collected. Then, the form cache memory 33 having the next lowest priority is selected, and the form cache memory 3 is selected.
It is judged whether or not 3 is continuous with the collected reprint data cache memory 31. Formush Memory 3
Since No. 3 is not continuous with the collected reprint data cache memory 31, the pattern cache memory 34 having the next lowest priority is selected. A cache memory having a lower priority is sequentially selected, and the user pass cache memory 31 that is continuous with the collected reprint data cache memory 31 is collected. Hereinafter, the user path cache memory 3 which is continuous with the cache memory collected in the same manner
2. Collect the form cache memory 33 and the pattern cache memory 34.

Although the storage area to be collected is a cache memory in the above embodiments, the storage area to be collected may be a storage area other than the cache memory, for example, a storage area not used for command processing. Alternatively, a minimum storage capacity may be set in each storage area so that the storage capacity above the minimum storage capacity cannot be recovered. As a method of selecting a storage area to be collected, first, it is determined whether or not one continuous storage area can be collected, and when it is determined that one continuous storage area cannot be collected. May be collected in order from a storage area having a low priority. Further, first, it is determined whether or not there is a storage area whose storage capacity is close to the insufficient capacity, and if so, the storage area is collected, and if not, the storage areas with lower priority are collected in order. Good. Alternatively, the storage capacity requirement may be input from the panel 3.

[0038]

As described above, if the management device for the storage means according to the first aspect is used, the storage area to be recovered can be suppressed to the necessary minimum, and the processing time of the output device is delayed. Can be prevented. Claim 2
By using the management device of the storage means described in (1), the priority of the storage area can be changed according to the usage state. Also,
By using the management device of the storage means according to the third aspect, it is possible to easily determine whether or not the storage capacity of the predetermined storage area is insufficient and the insufficient capacity. Further, by using the management device of the storage means according to the fourth aspect, it is possible to save a storage area having a high priority as much as possible. Further, by using the management device of the storage means described in claim 5, it is possible to secure a continuous storage area. Further, by using the management device of the storage means according to the sixth aspect, it is possible to secure a continuous storage area without rearranging the collected storage area.
Further, by using the management method of the storage means according to the seventh aspect, it is possible to suppress the storage area to be collected to the necessary minimum and prevent the processing time of the output device from being delayed. Further, by using the management method of the storage means according to the eighth aspect, it is possible to easily determine whether or not the storage capacity of the predetermined storage area is insufficient and the insufficient capacity. Further, if the management method of the storage means according to claim 9 is used,
The storage area with high priority can be saved as much as possible. Further, by using the management method of the storage means described in claim 10, it is possible to secure a continuous storage area. Also,
According to the storage means management method of the eleventh aspect, continuous storage areas can be secured without rearranging the collected storage areas.

[Brief description of the drawings]

FIG. 1 is a schematic configuration diagram of an output device.

FIG. 2 is a diagram showing an example of a page description code.

FIG. 3 is a diagram showing an example of a graphic output from an output device.

FIG. 4 is a diagram showing an operation of setting parameters.

FIG. 5 is a flowchart illustrating an operation of collecting a storage area of a storage unit.

FIG. 6 is a diagram showing a state inside the storage unit before and after collecting the storage region of the storage unit.

[Explanation of symbols]

1; host computer, 2; control circuit, 3; panel,
4; print engine, 11; input interface circuit,
12; CPU, 13; ROM, 14; RAM

Claims (11)

[Claims] 1. A management device of a storage means for storing data in a predetermined storage area on the basis of an inputted command, code data, etc., stores priority of the storage area of the storage means. When the storage capacity of the priority storage means and the predetermined storage area of the storage means is insufficient with respect to the storage capacity required amount, the storage area that is no longer needed among the storage areas of the storage means is filled with the insufficient capacity. A storage unit management apparatus, comprising: an area collection unit for selecting and collecting the storage area based on the priority of the storage area. 2. The storage unit management apparatus according to claim 1, further comprising a priority changing unit that changes a priority of a storage area stored in the priority storage unit. 3. The area collection unit determines a storage capacity required amount of a predetermined storage area used for processing of the command based on an input command, and the storage capacity required amount and the predetermined storage area. 3. The storage unit management device according to claim 1, wherein the storage capacity of the storage means is compared to determine the insufficient capacity. 4. The area retrieving means selects and retrieves storage areas in ascending order of priority.
4. A storage unit management device according to any one of 3 to 3. 5. An area arranging unit for rearranging the storage areas of the storage unit so that the plurality of collected storage areas are continuous when the plurality of collected storage areas are not continuous. The management device for storage means according to claim 4. 6. The storage unit management apparatus according to claim 1, wherein the area collection unit selects and collects continuous storage areas that satisfy the storage capacity requirement. 7. A storage means management method for storing data in a predetermined storage area based on an input command, code data, etc., wherein the storage capacity of the predetermined storage area of the storage means is When the storage capacity is insufficient, the unnecessary storage area of the storage areas of the storage means is selected and collected based on the priority of the storage area that satisfies the insufficient capacity. Management method of storage means. 8. A storage capacity request amount of a predetermined storage area used for processing the command is determined based on an input command, and the storage capacity request amount is compared with the storage capacity of the predetermined storage area. The management method of the storage means according to claim 7, wherein the shortage capacity is determined by performing the determination. 9. The method of managing storage means according to claim 7, wherein the storage areas are selected and collected in order of decreasing priority. 10. The storage area of the storage means is rearranged so that the plurality of collected storage areas are continuous when the plurality of collected storage areas are not continuous. Management method of the described storage means. 11. The method of managing storage means according to claim 7, wherein continuous storage areas satisfying the storage capacity requirement are selected and collected.