Adobe, Inc.

James G Sandman, Jr

Michael D Cooper

Edward R Fiala

Michael L Hodgson

Eric Berdahl

Paul D Rovner

Lars U Borg

Paul C Chen

Geoffrey C Sherwood

Michael Daumling

Scott Kovatch

Patrick S-h Ong

Patrick Swee-Hock Ong

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for embedded application communication. In one aspect, a method includes providing a first Application Programming Interface (API) in the host application, where the first API is configured to interact with a virtual machine object model of the virtual machine to allow the host application to set and get properties of one or more first class instances residing in a virtual machine memory space, and to invoke methods on the first class instances, and providing a second API in the virtual machine configured to interact with a host application object model in the host application.

Embedded application communication

Methods, systems, and apparatus, including computer program products feature receiving, from a client application running in a virtual machine and displayed within a first window of a graphic display, a request to create a second window within the graphic display. In an example implementation, a first set of one or more parameters is received in association with the request. The request and some or all of the first set of one or more parameters are provided to a host application. An indication of a determination is received from the host application as to whether the second window has been created. The determination is based on a policy of the host application. The indication of the determination is provided to the client application. If the indication of the determination indicates that the second window has been created, the indication further includes an identifier associated with the second window.

Managing windows through policies

Methods and apparatus, including computer program products, to rasterize an image by generating assignments and allocating the assignments among multiple processor threads such that no two processor threads are rasterizing concurrently into overlapping regions of a pixel array. Multiple assignments are generated. Each assignment specifies one or more graphics objects and a region of the pixel array into which the specified graphics objects are to be rasterized. Multiple processes are established for rasterizing objects into a pixel array. Each process is operable to receive an assignment and to rasterize the objects of the assignment into the region of the assignment. Assignments are selected for concurrent execution by processes so that no two selected assignments have overlapping regions. The selected assignments are concurrently executed by separate processes to rasterize the respective objects of the assignments into their respective regions.

Assignments for parallel rasterization

A page printer uses alternative internal representations for the print data in each of multiple lateral strips that make up the page. Page description language input is converted to an intermediate display list format that is sorted into display commands associated with each strip. If during input the display list representation of the data fills the memory allotted to its storage, one or more of the strips is converted from display list format to raster format and compressed using a lossless compression algorithm. If storage of compressed strips subsequently exceeds available memory, raster data is further compressed using a lossy compression algorithm. Additional display list commands are rasterized by decompressing the compressed strips, processing the new commands and recompressing the data using lossless or lossy compression as required. If the display list does not overflow memory during input, the complete strips are rasterized and compressed one at a time in the order in which they will be printed. The rasterizing time is stored. Should memory overflow at any point in the process, then the rasterizing times for the remaining strips are determined without storing the raster output. A decision can then be made for each strip to rasterize it to the print engine on the fly, pre-compute and store it as lossless compressed raster data, or revert to a lossy-compressed pre-computed version.

Method and apparatus for saving printer memory

A method building a tile of pixels usable by a marking routine in a raster output device to mark an output device pixel according to a sample value. The method includes the steps of receiving the sample value in a rendering process; deriving, from the sample value, a base value and a fractional tile of pixels; and building the pixels of the tile by adding the base value to the corresponding pixels of the fractional tile. The fractional tile may have a bit depth of one. The invention also features building a chunky color tile by deriving, from a sample color, one component base value for each color component; obtaining a component fractional tile for each color component of the sample color; and building each pixel in the chunky color tile as the composition of the sum of the component base values and the component fractional tile pixel values for the corresponding color components and pixel position. The component fractional tiles can be stored in a packed representation. The chunky color tile can have four color components. The invention also builds a pixel in chunky color tile by deriving, from a sample color, a base pixel in a device color space; obtaining a fractional tile for each component of the sample color; forming an addend from all the fractional tiles; and building the chunky color tile pixel by adding the addend to the base pixel.

Efficient gray tile storage

A page printer uses alternative internal representations for the print data in each of multiple lateral strips that make up the page. Page description language input is converted to an intermediate display list format that is sorted into display commands associated with each strip. If during input the display list representation of the data fills the memory allotted to its storage, one or more of the strips is converted from display list format to raster format and compressed using a lossless compression algorithm. If storage of compressed strips subsequently exceeds available memory, raster data is further compressed using a lossy compression algorithm. Additional display list commands are rasterized by decompressing the compressed strips, processing the new commands and recompressing the data using lossless or lossy compression as required. If the display list does not overflow memory during input, the complete strips are rasterized and compressed one at a time in the order in which they will be printed. The rasterizing time is stored. Should memory overflow at any point in the process, then the rasterizing times for the remaining strips are determined without storing the raster output. A decision can then be made for each strip to rasterize it to the print engine on the fly, precompute and store it as lossless compressed raster data, or revert to a lossy-compressed precomputed version.

Growing community of inventors

Los Altos Hills, CA, United States of America

James G Sandman, Jr