Abstract: A system, method, and computer program product are provided for generating display data. The data processing system loads coefficient values corresponding to a behavior of a selected function in pre-defined ranges of input data. The data processing system then determines, responsive to items of input data, the range of input data in which the selected function is to be estimated. The data processing system then selects, through the use of a vector permute function, the coefficient values, and evaluates an index function at the each of the items of input data. It then estimates the value of the selected function through parallel mathematical operations on the items of input data, the selected coefficient values, and the values of the index function, and, responsive to the one or more values of the selected function, generates display data.

Abstract: A method, apparatus, and computer implemented instructions for managing a set of memory resources used to store texture objects in a data processing system. A texture manager allocates memory to a current texture object in a set of memory resources. A stored texture object, handled by the texture manager, is selectively removed in response to an inability to allocate sufficient memory to the current texture object. The allocating and selectively removing steps are repeated until the current texture object is allocated sufficient memory. The repeating step is halted in response to an absence of any stored texture objects, handled by a texture manager, being present in the first memory resource. Stored texture objects, handled by another texture manager, are selectively removed in response to an inability to allocate sufficient memory to the current texture object. Memory is allocated in the set of memory resources to the current texture object in response to selectively removing stored texture objects.

Abstract: A method and an apparatus are provided for enhancing lock acquisition in a multiprocessor system. A lock-load instruction is sent from a first processor to a cache. In response, a reservation flag for the first processor is set, and lock data is sent to the first processor. The lock data is placed in target and shadow registers of the first processor. Upon a determination that the lock is taken, the lock-load instruction is resent from the first processor to the cache. Upon a determination that the reservation flag is still set for the first processor, a status-quo signal is sent to the first processor without resending the lock data to the first processor. In response, the lock data is copied from the shadow register to the target register.

Abstract: A method and apparatus in a data processing system for processing graphics data. A set of clip areas defining a window for use in clipping graphics data is identified in which a portion of the graphics data is obscured. A clip area in a first hardware clipper is set, wherein the clip area encompasses the window to process the graphics data. The graphics data within the first clip area is graphics data to be displayed. A no clip area is set in a second hardware clipper, wherein the no clip area encompasses the portion and wherein which graphics data in the second clip area is to remain undisplayed. The graphics data is sent to the first hardware clipper and the second hardware clipper.

Abstract: The present invention renders a triangular mesh for employment in graphical displays. The triangular mesh comprises triangle-shaped graphics primitives. The triangle-shaped graphics primitives represent a subdivided triangular shape. Each triangle-shaped graphics primitive shares defined vertices with adjoining triangle-shaped graphics primitives. These shared vertices are transmitted and employed for the rendering of the triangle-shaped graphics primitives.

Abstract: A system, method, and computer program product are provided for generating display data. The data processing system loads coefficient values corresponding to a behavior of a selected function in pre-defined ranges of input data. The data processing system then determines, responsive to items of input data, the range of input data in which the selected function is to be estimated. The data processing system then selects, through the use of a vector permute function, the coefficient values, and evaluates an index function at the each of the items of input data. It then estimates the value of the selected function through parallel mathematical operations on the items of input data, the selected coefficient values, and the values of the index function, and, responsive to the one or more values of the selected function, generates display data.

Abstract: A method and apparatus in a data processing system for processing perspective transformations. An estimate of a depth coordinate is obtained. A determination is made as to whether the estimate is sufficiently accurate for the perspective transformation. An algebraic operation is performed on the estimate if the estimate is insufficiently accurate for the perspective transformation, wherein the algebraic operation increases the accuracy of the estimate.

Abstract: A method, system, and computer program product for reducing a boundary of a subspace in a binary space partitioning tree is provided. In one embodiment a space containing an object for which an image is to be rendered and displayed to a user is divided into subspaces. The boundaries of each subspace are recalculated to remove at least a portion of the dead space from within the subspace. The recalculation is performed by analyzing the spatial extent of the object or objects within the each subspace and recalculating the boundaries of each subspace to be coextensive with the boundaries of the object or objects within the subspace.

Abstract: A method, system, and program product for creating a child node of a binary space partitioning (BSP) tree node that better approximates the size of an object to be rendered is provided. In one embodiment, a a binary space partitioning tree is created. A rendering process then determines whether either a top node or a child node in a first level of child nodes is a good approximation of the object to be rendered. If not, then the rendering process modifies the binary space partitioning tree to include a new child node having boundaries that are closer to the maximum coordinates of primitives defining the object than are the boundaries of the top node or of the child nodes in the first level of child nodes. This new child node may have a bounding volume that overlaps the bounding volumes of other child nodes in the BSP tree.

Abstract: A method, apparatus, and computer implemented instructions for managing a set of memory resources used to store texture objects in a data processing system. A texture manager allocates memory to a current texture object in a set of memory resources. A stored texture object, handled by the texture manager, is selectively removed in response to an inability to allocate sufficient memory to the current texture object. The allocating and selectively removing steps are repeated until the current texture object is allocated sufficient memory. The repeating step is halted in response to an absence of any stored texture objects, handled by a texture manager, being present in the first memory resource. Stored texture objects, handled by another texture manager, are selectively removed in response to an inability to allocate sufficient memory to the current texture object. Memory is allocated in the set of memory resources to the current texture object in response to selectively removing stored texture objects.

Abstract: A method, system, and computer program product for reducing a boundary of a subspace in a binary space partitioning tree is provided. In one embodiment a space containing an object for which an image is to be rendered and displayed to a user is divided into subspaces. The boundaries of each subspace are recalculated to remove at least a portion of the dead space from within the subspace. The recalculation is performed by analyzing the spatial extent of the object or objects within the each subspace and recalculating the boundaries of each subspace to be coextensive with the boundaries of the object or objects within the subspace.

Abstract: A method, system, and program product for creating a child node of a binary space partitioning (BSP) tree node that better approximates the size of an object to be rendered is provided. In one embodiment, a a binary space partitioning tree is created. A rendering process then determines whether either a top node or a child node in a first level of child nodes is a good approximation of the object to be rendered. If not, then the rendering process modifies the binary space partitioning tree to include a new child node having boundaries that are closer to the maximum coordinates of primitives defining the object than are the boundaries of the top node or of the child nodes in the first level of child nodes. This new child node may have a bounding volume that overlaps the bounding volumes of other child nodes in the BSP tree.