Method and apparatus for managing dynamically sizeable color tables

Abstract

A method, apparatus, and computer instructions for managing color maps in a data processing system. Responsive to a request to add a color map to a color table, a determination is made as to whether the color map is already installed in the color table. If the color map is not already installed in the color table, a decision is made as to whether a free block of color table entries sufficient to hold the color map is present in the color table. A determination is made as to whether existing blocks of color table entries in the color table can be rearranged to form a new free block of color table entries, if the free block of color table entries is insufficient to hold the color map. The existing blocks of color table entries in the color table are rearranged if the existing blocks of color table entries can be rearranged to form the new free block of color table entries. The color map is installed in the new free block of color table entries after the block of color table entries has been formed by rearranging the existing blocks of color table entries.

Description

BACKGROUND OF THE INVENTION

[0002] 1. Technical Field

[0003] The present invention relates generally to an improved data processing system, and in particular a method and apparatus for processing graphics data. Still more particularly, the present invention provides a method, apparatus, and computer instructions for storing color maps in a data processing system.

[0004] 2. Description of Related Art

[0005] Computer graphics concerns the synthesis or display of real or imaginary objects from computer-based models. In computer graphics systems, images are displayed on a display device to a user in two dimensional and three dimensional forms. These images are displayed using pixels. A pixel is short for a picture element. One spot in a rectilinear grid of thousands of such spots that are individually “painted” to form an image produced on the screen by a computer or on paper by a printer. A pixel is the smallest element that display or print hardware and software can manipulate in creating letters, numbers, or graphics. These pixels and information relating to these pixels are stored in a buffer. The information describing a pixel is identified using a window ID (WID). A WID is used as an index into a window attribute table (WAT) . The WAT contains information describing how a pixel will be displayed on the screen. For example, a WAT identifies depth, color map, buffer, and gamma for a pixel.

[0006] In displaying pixels, a color table, also referred to as a “color lookup table,” is a piece of hardware in which pixel values or colors may be stored. A color map is a list of colors used to display pixels in a window or application. This list of colors must be loaded into a color table to be used. Presently, color tables on a graphics adapter are defined as fixed size tables with the most common size being 256 entries. This size color table is one required to support a fully populated 8-bit color map.

[0007] The present invention recognizes that many applications create color maps and only populate the first few entries, leaving many unused color table entries. Typically, each application will use a single color table for its color map. Most adapters provide very few color tables, resulting in the sharing of entries within a color table by applications. Such a sharing of color tables results in technicolor, which causes a window to be displayed with the wrong color map values. In other words, a window may be displayed with the incorrect colors due to a sharing of the color table with multiple applications.

[0008] Thus, it would be advantageous to have an improved method, apparatus, and computer instructions for storing and managing colors in a color table.

SUMMARY OF THE INVENTION

[0009] The present invention provides a method, apparatus, and computer instructions for managing color maps in a data processing system. Responsive to a request to add a color map to a color table, a determination is made as to whether the color map is already installed in the color table. If the color map is not already installed in the color table, a decision is made as to whether a free block of color table entries sufficient to hold the color map is present in the color table. A determination is made as to whether existing blocks of color table entries in the color table can be rearranged to form a new free block of color table entries, if the free block of color table entries is insufficient to hold the color map. The existing blocks of color table entries in the color table are rearranged if the existing blocks of color table entries can be rearranged to form the new free block of color table entries. The color map is installed in the new free block of color table entries after the block of color table entries has been formed by rearranging the existing blocks of color table entries.

BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further objectives and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:

[0011] FIG. 1 is a pictorial representation of a data processing system in which the present invention may be implemented in accordance with a preferred embodiment of the present invention;

[0012] FIG. 2 is a block diagram illustrating a data processing system in which the present invention may be implemented;

[0013] FIG. 3 is a block diagram illustrating a graphics adapter in accordance with a preferred embodiment of the present invention;

[0014] FIG. 4 is a diagram illustrating components and data flow used in dynamically sizing a color table in accordance with a preferred embodiment of the present invention;

[0015] FIG. 5 is a diagram illustrating color table registers for defining location and number of entries for color maps within a color table in accordance with a preferred embodiment of the present invention;

[0016] FIG. 6 is a flowchart of a process for dynamically loading color maps into a dynamically sized color table in accordance with a preferred embodiment of the present invention;

[0017] FIG. 7 is a flowchart of a process to create a color map in accordance with a preferred embodiment of the present invention;

[0018] FIG. 8 is a flowchart of a process for storing colors into a color map in accordance with a preferred embodiment of the present invention; and

[0019] FIG. 9 is a flowchart of a process to handle a request to install a color map in a color table in accordance with a preferred embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0020] With reference now to the figures and in particular with reference to FIG. 1, a pictorial representation of a data processing system in which the present invention may be implemented is depicted in accordance with a preferred embodiment of the present invention. A computer 100 is depicted which includes a system unit 102, a video display terminal 104, a keyboard 106, storage devices 108, which may include floppy drives and other types of permanent and removable storage media, and mouse 110. Additional input devices may be included with personal computer 100. Computer 100 can be implemented using any suitable computer, such as an IBM RS/6000 computer or IntelliStation computer, which are products of International Business Machines Corporation, located in Armonk, N.Y. Although the depicted representation shows a computer, other embodiments of the present invention may be implemented in other types of data processing systems, such as a network computer. Computer 100 also preferably includes a graphical user interface that may be implemented by means of systems software residing in computer readable media in operation within computer 100.

[0021] With reference now to FIG. 2, a block diagram illustrates a data processing system in which the present invention may be implemented. Data processing system 200 is an example of a computer, such as computer 100 in FIG. 1, in which code or instructions implementing the processes of the present invention may be located. Data processing system 200 employs a peripheral component interconnect (PCI) local bus architecture. Although the depicted example employs a PCI bus, other bus architectures such as Accelerated Graphics Port (AGP) and Industry Standard Architecture (ISA) may be used. Processor 202 and main memory 204 are connected to PCI local bus 206 through PCI bridge 208. PCI bridge 208 also may include an integrated memory controller and cache memory for processor 202. Additional connections to PCI local bus 206 may be made through direct component interconnection or through add-in boards. In the depicted example, local area network (LAN) adapter 210, small computer system interface SCSI host bus adapter 212, and expansion bus interface 214 are connected to PCI local bus 206 by direct component connection. In contrast, audio adapter 216, graphics adapter 218, and audio/video adapter 219 are connected to PCI local bus 206 by add-in boards inserted into expansion slots. The processes of the present invention may be used to manage rendering of data by graphics adapter 218 or audio/video adapter 219.

[0022] Expansion bus interface 214 provides a connection for a keyboard and mouse adapter 220, modem 222, and additional memory 224. SCSI host bus adapter 212 provides a connection for hard disk drive 226, tape drive 228, and CD-ROM drive 230. Typical PCI local bus implementations will support three or four PCI expansion slots or add-in connectors.

[0023] An operating system runs on processor 202 and is used to coordinate and provide control of various components within data processing system 200 in FIG. 2. The operating system may be a commercially available operating system such as Windows XP, which is available from Microsoft Corporation. Instructions for the operating system and applications or programs are located on storage devices, such as hard disk drive 226, and may be loaded into main memory 204 for execution by processor 202.

[0024] Those of ordinary skill in the art will appreciate that the hardware in FIG. 2 may vary depending on the implementation. Other internal hardware or peripheral devices, such as flash ROM (or equivalent nonvolatile memory) or optical disk drives and the like, may be used in addition to or in place of the hardware depicted in FIG. 2. Also, the processes of the present invention may be applied to a multiprocessor data processing system.

[0025] For example, data processing system 200, if optionally configured as a network computer, may not include SCSI host bus adapter 212, hard disk drive 226, tape drive 228, and CD-ROM 230. In that case, the computer, to be properly called a client computer, must include some type of network communication interface, such as LAN adapter 210, modem 222, or the like. As another example, data processing system 200 may be a stand-alone system configured to be bootable without relying on some type of network communication interface, whether or not data processing system 200 comprises some type of network communication interface. As a further example, data processing system 200 may be a Personal Digital Assistant (PDA) device which is configured with ROM and/or flash ROM in order to provide non-volatile memory for storing operating system files and/or user-generated data.

[0026] The depicted example in FIG. 2 and above-described examples are not meant to imply architectural limitations. For example, data processing system 200 also may be a notebook computer or hand held computer in addition to taking the form of a PDA. Data processing system 200 also may be a kiosk or a Web appliance.

[0027] Turning next to FIG. 3, a block diagram illustrating a graphics adapter is depicted in accordance with a preferred embodiment of the present invention. Graphics adapter 300 is an example of a graphics adapter, such as graphics adapter 218 in FIG. 2.

[0028] In this example, graphics adapter 300 includes an adapter memory 302 and a random access memory digital to analog converter (RAMDAC) 304. Adapter memory 302 contains window ID (WID) buffer 305, color frame buffer 306, and overlay frame buffer 308. RAMDAC 304 includes window attribute table (WAT) table 310 and dynamically sizeable color table 312, which includes color table registers 314 and color table 316. The two frame buffers, color frame buffer 306 and overlay frame buffer 308, contain pixels, which are sent to RAMDAC 304 for output to a display device, such as screen 318. RAMDAC 304 is a graphics controller chip that maintains the color palette and converts data from memory into analog signals for a display device. The color palette takes the form of color maps and is maintained within dynamically sizable color table 312.

[0029] In these examples, a dynamic color table is provided, dynamically sizeable color table 312, to facilitate a more efficient use of space within this color table. The mechanism of the present invention allows for dynamically changing the entries provided for color maps. The size and location of different sets of entries for different color maps are controlled through color table registers 314. Through the use of color table registers 314 and color table 316, a single color table may be employed to hold or contain multiple color maps in which the color maps are assigned only the space needed.

[0030] In this manner, problems, such as technicolor, may be avoided with limited numbers of color tables in a graphics adapter. For example, if a single color map uses only eight colors, only eight color table entries are needed instead of a full 256 entry color table. Previously, such a color map would require the use of the entire 256 color table because no mechanism was provided for dynamically sizing within the color table. With the present invention, the remaining entries in the color table are available for use by other color maps.

[0031] Additionally, the present invention also recognizes that with this ability to allocate different sizes of entries to color maps, the location of color maps and the amount of space in the color table, a result in inefficient color table usage if the allocation of color maps is not properly managed. A mechanism of the present invention includes an ability to manage and rearrange color maps to allow for efficient use of space within the color tables and to maximize the number of color maps that may be placed into the color table.

[0032] Turning next to FIG. 4, a diagram illustrating components and data flow used in dynamically sizing a color table are depicted in accordance with a preferred embodiment of the present invention.

[0033] Application 400 and application 402 may generate requests to install color maps in graphics adapter 404 to display colors for windows. These requests are sent to Xserver 406 and are processed by install color map function 408 in Xserver 406. An Xserver is a graphics device driver that displays an application, such as application 400 or 402 on a display device. In this example, Xserver 406 processes requests from both local and remote applications. The results of this processing are displayed on a screen by this driver.

[0034] The requests are processed to identify the number of entries needed in a color table for each color map. In response to identifying the number of entries needed, install color map function 408 sets the appropriate registers within color table registers 410, which is located within RAMDAC 412 in graphics adapter 404. Based on the location and size set for the color map in color table registers 410, install color map function 408 then loads the colors into color table 414 in RAMDAC 412. Additionally, install color map function 408 also includes management processes for managing the space within color table 414.

[0035] For example, install color map function 408 may check to see if a color map is already installed in response to a request to install a color map in color table 414. This component also checks to see whether a large enough block of empty color table entries is present if the color map is not already installed. If a large enough block is present, the color block is loaded.

[0036] Otherwise, install color map function 408 may rearrange the color maps located within color table 414 so that sufficient entries within color table 414 are contiguous to each other. If install color map function 408 is unable to rearrange or defragment color table 414 to provide sufficient empty entries for the new color map, one or more color maps may be removed for the new color map.

[0037] In this manner, the mechanism of the present invention allows for multiple color maps of different sizes to be placed into color table 414 through dynamic sizing within color table 414, as well as managing the use of space within color table 414. As a result, color table 414 is in essence multiple color tables in which each of these color tables have sizes that are created to support different sized color maps.

[0038] With reference next to FIG. 5, a diagram illustrating color table registers for defining location and number of entries for color maps within a color table is depicted in accordance with a preferred embodiment of the present invention. In this example, registers 500 include start registers 502 and size registers 504. As illustrated, four color maps are illustrated by registers 500 in this example.

[0039] Start registers 502 are used to identify the starting points for entries within color table 506. Size registers 504 are used to define the number of color table entries that will be dynamically allocated for a first color map. For example, start register 508 indicates that the starting address for a color map is at address 0, with a size of 2, as shown in register 510. This corresponds to section 512 within color table 506. Another color map is defined by registers 514 and 516. Register 514 indicates that the color map will start at address 2, while register 516 indicates that 206 entries are used for this color map. Section 518 in color table 506 is defined by these registers. Register 520 indicates a starting address of 513, while register 522 indicates that 254 entries are used for this third color map. These two registers define the third color map as being located within section 524 in color table 506. In another example, register 526 indicates that a fourth color map begins at address 767, while register 528 indicates that this color map contains 256 entries. These registers define section 530 in color table 506 for this fourth color map.

[0040] Turning now to FIG. 6, a flowchart of a process for dynamically loading color maps into a dynamically sized color table is depicted in accordance with a preferred embodiment of the present invention. The process illustrated in FIG. 6 may be in a graphics process such as Xserver 406 in FIG. 4. This process illustrates an example for loading color maps, without requiring management of color maps in the color table. When management of color maps is implemented, the process illustrated in FIG. 9 below is used in place of this process in FIG. 6.

[0041] The process begins by receiving a request to install a color map (step 600). This request is typically received from an application or window manager and usually includes a number of entries required for the color map. The application or window manager passes in a color map identifier to the process. With this identifier, internal color map structures may be accessed to see how many colors the color map has, the actual colors, and if the colors are already loaded into the color table. Based on the requests received, a number of colors for the color maps is identified (step 602). A color map location and size is set based upon the number of colors identified (step 604). In these examples, the number of colors equals the number of entries needed in the color table. The location and size is set by setting registers within the graphics adapter. These are registers that are specifically designed for setting a location and size for a color map within a color table. Thereafter, the colors for the color map are loaded into the color table (step 606) with the process terminating thereafter.

[0042] Turning next to FIG. 7, a flowchart of a process to create a color map is depicted in accordance with a preferred embodiment of the present invention. The process illustrated in FIG. 6 may be implemented in an operating component, such as a device driver such as Xserver 406 in FIG. 4. The process begins by receiving a request to create a color map (step 700). Thereafter, color map structures are allocated and initialized (step 702), with the process terminating thereafter.

[0043] With reference now to FIG. 8, a flowchart of a process for storing colors into a color map is depicted in accordance with a preferred embodiment of the present invention. The process illustrated in FIG. 8 may be implemented as a part of a device driver, such as Xserver 406 in FIG. 4. The process illustrated in this figure shows how an application sets up colors in a color map before installation of the color map.

[0044] The process begins by receiving a request to store colors into a color map (step 800). Thereafter, the process stores the colors (step 802), with the process terminating thereafter. In step 802, the last color stored in the color map also is saved in a last color field. For example, if the application requests color indices 0, 1, 2, and 10 to be stored in the color map, the last color field in the color map structure is set equal to 10. This field is later used to determine whether sufficient free space is present in the color table for this color map. If the last color field is equal to 10, then 11 free entries are needed in the color table. A color map structure is a software data structure that contains control data. This control data is used for managing the color map, including storing the colors into the color table. The color map structure itself resides in the Xserver and is not stored in the color table. Only the colors for the color map are actually stored in the color table.

[0045] The “last color” field indicates how many entries are required for the color map. For example, within an 8-bit color map, this map may contain up to 256 colors. If the application stores only 4 colors in the color map, such as red in index 0, blue in index 1, green in index 2, and yellow in index 10, then 11 free entries are needed in the color table for this color map. What is important is not the actual number of colors that are in the color map, but the last color index used, in this case 10. Index 10 requires 11 free entries because the data is 0 based; 0,1,2,3,4,5,6,7,8,9, and 10. Almost all applications allocate the colors starting at index 0 and work their way up, such that the number of colors and the last index used are almost always the same.

[0046] Turning now to FIG. 9, a flowchart of a process to handle a request to install a color map in a color table is depicted in accordance with a preferred embodiment of the present invention. The process illustrated in FIG. 9 may be implemented within a device driver, such as Xserver 406 in FIG. 4. More specifically, this process may be part of a function, such as install color map function 408 in FIG. 4.

[0047] The process begins by receiving a request to install a color map (step 900). Thereafter, a determination is made as to whether the color map requested has already been installed (step 902). If the color map has already been installed, the process terminates, otherwise a determination is made as to whether a large enough block of empty color table entries are present to store the color map (step 904). If sufficient entries are present, a color map location and size registers are set (step 906). Thereafter, the colors for the color map are loaded into the color table (step 908), with the process terminating thereafter.

[0048] With reference again to step 904, if a block of empty color table entries is not sufficient to store the color map, the number of free entries in the color table are calculated (step 910). A determination is then made as to whether enough free entries are present to store the color map (step 912). If sufficient free entries are present in the color table, the currently stored color maps are rearranged to generate a block of contiguous entries sufficient to hold the new color map (step 914), with the process then proceeding to step 906 as described above.

[0049] Turning back to step 912, if insufficient free entries are present in the color table to store the color map, then one or more currently stored color maps are removed to make room for the new color map (step 916), with the process then proceeding to step 906. In step 916, various processes and algorithms may be used to determine which color map or color maps should be removed. For example, a color map may be removed to free up entries in the color table by selecting the color map to be removed as a color map that has been least recently used. Another mechanism involved may be identifying a color map to be removed as one that was first installed in the color table.

[0050] The last color field is used in steps 904, 912, 914, and 916, but not in 910. All of these steps need to know what number of entries are required.

[0051] In step 910, only the number of available entries are calculated. For step 910, the number of free entries is calculated by knowing the total number of entries available in the hardware and knowing the number of entries that are in use. The number of entries in use can be calculated by reading the start and size registers in the RAMDAC. Further, the number of consecutive free entries that are available are identified by reading the start and size registers. For example, looking back at FIG. 5, 305 empty entries are present between color map 518 and color map 524.

[0052] Thus, the present invention provides a method, apparatus, and computer instructions for managing color maps in a graphics adapter. The mechanism of the present invention allows for dynamic sizing within a color table to allow for multiple color maps to be placed within the color table. Each color map is allocated only with as much space as needed for a particular color map, rather than a set allocation. For example, if a color map only includes two colors, only two entries are allocated, while a color map having 256 colors is allocated 256 entries. This mechanism does not require any changes or modifications to applications requesting color maps. Instead, a set of registers are included within the graphics adapter in which these registers are used to set locations and sizes of color maps within a color table.

[0053] The mechanism of the present invention also allows for management of color maps within a color table. When a request to install a color map is received, a check is made to determine whether the color map has already been installed in the color table. If the color map has not already been installed, a determination is made as to whether a large enough block of empty color table entries is present to hold the color map. If a large enough block is present, the color map is loaded. Otherwise, color maps within the color table are rearranged to create contiguous empty slots. A determination is made as to whether these contiguous empty slots provide enough color table entries for the color map. If insufficient entries are still present, then one or more color maps may be removed to make room for the new color map. With this mechanism, improved efficiency in color table usage is provided, reducing the need to implement large numbers of expensive color tables. Further, this mechanism provides improved usability over current color tables, reducing the occurrence of technicolor.

[0054] It is important to note that while the present invention has been described in the context of a fully functioning data processing system, those of ordinary skill in the art will appreciate that the processes of the present invention are capable of being distributed in the form of a computer readable medium of instructions and a variety of forms and that the present invention applies equally regardless of the particular type of signal bearing media actually used to carry out the distribution. Examples of computer readable media include recordable-type media, such as a floppy disk, a hard disk drive, a RAM, CD-ROMs, DVD-ROMs, and transmission-type media, such as digital and analog communications links, wired or wireless communications links using transmission forms, such as, for example, radio frequency and light wave transmissions. The computer readable media may take the form of coded formats that are decoded for actual use in a particular data processing system.

[0055] The description of the present invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention, the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.

Claims

1. A method in a data processing system for managing color maps, the method comprising: responsive to a request to add a color map to a color table, determining whether the color map is already installed in the color table; if the color map is not already installed in the color table, deciding whether a free block of color table entries sufficient to hold the color map is present in the color table; determining whether existing blocks of color table entries in the color table can be rearranged to form a new free block of color table entries, if the free block of color table entries is insufficient to hold the color map; rearranging the existing blocks of color table entries in the color table if the existing blocks of color table entries can be rearranged to form the new free block of color table entries; and installing the color map in the new free block of color table entries after the block of color table entries has been formed by rearranging the existing blocks of color table entries.

2. The method of claim 1 further comprising: terminating the method if the color map is already installed in the color table.

3. The method of claim 1 further comprising: removing a selected block of color table entries if the existing blocks of color table entries cannot be rearranged to form the block of color table entries.

4. The method of claim 1, wherein the selected block is selected as a block of color table entries having a size that is at least equal to a size of the block of color table entries.

5. The method of claim 1, wherein the selected block is selected as a least recently used block of color table entries.

6. The method of claim 3 further comprising: repeating to the determining step after removing the selected block of color table entries.

7. The method of claim 1, wherein the rearranging step rearranges all empty slots within the color table into a single block of color table entries.

8. The method of claim 1, further comprising: allocating a color map structure; and storing colors and a last color identification in the color map structure.

9. A data processing system for managing color maps, the data processing system comprising: a bus system; a memory connected to the bus system, wherein the memory includes a set of instructions; and a processing unit, wherein the processing unit executes the set of instructions to determine whether the color map is already installed in the color table in response to a request to add a color map to a color table; decide whether a free block of color table entries sufficient to hold the color map is present in the color table if the color map is not already installed in the color table; determine whether existing blocks of color table entries in the color table can be rearranged to form a new free block of color table entries if the free block of color table entries is insufficient to hold the color map; rearrange the existing blocks of color table entries in the color table if the existing blocks of color table entries can be rearranged to form the new free block of color table entries; and install the color map in the new free block of color table entries after the block of color table entries has been formed by rearranging the existing blocks of color table entries.

10. A data processing system for managing color maps, the data processing system comprising: first determining means, responsive to a request to add a color map to a color table, for determining whether the color map is already installed in the color table; deciding means for deciding whether a free block of color table entries sufficient to hold the color map is present in the color table if the color map is not already installed in the color table; second determining means for determining whether existing blocks of color table entries in the color table can be rearranged to form a new free block of color table entries, if the free block of color table entries is insufficient to hold the color map; rearranging means for rearranging the existing blocks of color table entries in the color table if the existing blocks of color table entries can be rearranged to form the new free block of color table entries; and installing means for installing the color map in the new free block of color table entries after the block of color table entries has been formed by rearranging the existing blocks of color table entries.

11. The data processing system of claim 10 further comprising: removing a selected block of color table entries if the existing blocks of color table entries cannot be rearranged to form the block of color table entries.

12. The data processing system of claim 10, wherein the selected block is selected as a block of color table entries having a size that is at least equal to a size of the block of color table entries.

13. The data processing system of claim 10, wherein the selected block is selected as a least recently used block of color table entries.

14. The data processing system of claim 11 further comprising: repeating to the determining step after deleting the selected block of color table entries.

15. The data processing system of claim 10, wherein the rearranging step rearranges all empty slots within the color table into a single block of color table entries.

16. A computer program product in a computer readable medium for managing color maps, the computer program product comprising: first instructions responsive to a request to add a color map to a color table, for determining whether the color map is already installed in the color table; second instructions for deciding whether a free block of color table entries sufficient to hold the color map is present in the color table if the color map is not already installed in the color table; third instructions for determining whether existing blocks of color table entries in the color table can be rearranged to form a new free block of color table entries, if the free block of color table entries is insufficient to hold the color map; fourth instructions for rearranging the existing blocks of color table entries in the color table if the existing blocks of color table entries can be rearranged to form the new free block of color table entries; and fifth instructions for installing the color map in the new free block of color table entries after the block of color table entries has been formed by rearranging the existing blocks of color table entries.

17. The computer program product of claim 16 further comprising: sixth instructions for terminating the method if the color map is already installed in the color table.

18. The computer program product of claim 16 further comprising: sixth instructions for removing a selected block of color table entries if the existing blocks of color table entries cannot be rearranged to form the block of color table entries.

19. The computer program product of claim 16, wherein the selected block is selected as a block of color table entries having a size that is at least equal to a size of the block of color table entries.

20. The computer program product of claim 16, wherein the selected block is selected as a least recently used block of color table entries.