# Patent

## Title
Higher accuracy Z-culling in a tile-based architecture

## Abstract

A graphics processing pipeline configured for z-cull operations. The graphics processing pipeline comprising a screen-space pipeline and a tiling unit. The screen-space pipeline includes a z-cull unit configured to perform z-culling operations. The tiling unit is configured to determine that a first set of primitives overlaps a first cache tile. The tiling unit is also configured to transmit the first set of primitives to the screen-space pipeline for processing. The tiling unit is further configured to select between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode. The tiling unit is also configured to cause the z-cull unit to process the first set of primitives in the full-surface z-cull mode or to process the first set of primitives in the partial-surface z-cull mode.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims benefit of U.S. provisional patent application Ser. No. 61/719,271, filed Oct. 26, 2012 and titled, “An Approach for Tiled Caching.” The subject matter of this related application is hereby incorporated herein by reference.


BACKGROUND OF THE INVENTION
Field of the Invention
Embodiments of the present invention relate generally to graphics processing and, more specifically, to higher accuracy z-culling in a tile-based architecture.
Description of the Related Art
Graphics processing subsystems typically write depth information to a depth buffer that stores depth information for samples and pixels. When the graphics processing subsystem processes fragments, the graphics processing system compares depth values associated with those fragments with the depth values stored in the depth buffer. This comparison is referred to as a “z-test,” “depth test”, or “visibility test”. For any particular fragment, if the z-test is successful and the fragment is visible, then the fragment is written to the frame buffer or blended with color data already in the frame buffer. If, on the other hand, the fragment does not pass the visibility test, then the fragment is discarded.
Some graphics processing subsystems also implement a tile-based architecture, where one or more render targets, such as a frame buffer, are divided into screen space partitions referred to as “tiles.” In such an architecture, the graphics processing subsystem rearranges work such that the work associated with any particular tile remains on-chip, in a cache, for a longer time relative to the time work remains on-chip with an architecture that does not rearrange work based on tiles. This rearrangement helps to improve memory bandwidth as compared with a non-tiling architecture.
Some graphics processing subsystems additionally include a z-cull unit that is configured to perform depth-based culling operations on fragments prior to fragment shading. Such operations enable non-visible fragments to be discarded from the graphics pipeline prior to fragment shading, which saves the processing cycles and power associated with shading fragments that are non-visible and ultimately would be discarded during z-testing.
In tiling architectures, and in other architectures, the z-cull unit typically processes data at a fairly coarse level. More specifically, the z-cull unit stores a small amount of z-data for a large number of samples and performs a z-cull test that compares those samples to the z-data. The test performed by the z-cull unit is typically “conservative,” meaning that a z-cull test retains all fragments in a group of fragments for further processing if just one of those fragments passes the z-cull test. Therefore, in many situations, some fragments that are found to be non-visible, are nonetheless transmitted on to the fragment shader for further processing instead of being discarded.
The “resolution” or accuracy of the z-cull test can substantially influence how many non-visible fragments are transmitted to the fragment shader for further processing Increasing the resolution of the z-cull test typically decreases the number of fragments found to be non-visible that are nonetheless transmitted to the fragment shader for processing. However, increasing the resolution of z-cull testing typically causes such testing to take longer and increases the memory requirements of the z-cull unit, which can negatively impact overall system performance.
As the foregoing illustrates, what is needed in the art are more effective approaches to z-culling, especially in tile-based architectures.
SUMMARY OF THE PRESENT INVENTION
One embodiment of the present invention sets forth a graphics processing pipeline configured for z-cull operations. The graphics processing pipeline comprising a screen-space pipeline and a tiling unit. The screen-space pipeline includes a z-cull unit configured to perform z-culling operations. The tiling unit is configured to determine that a first set of primitives overlaps a first cache tile. The tiling unit is also configured to transmit the first set of primitives to the screen-space pipeline for processing. The tiling unit is further configured to select between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode. The tiling unit is also configured to cause the z-cull unit to process the first set of primitives in the full-surface z-cull mode or to process the first set of primitives in the partial-surface z-cull mode.



BRIEF DESCRIPTION OF THE DRAWINGS
So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
FIG. 1 is a block diagram illustrating a computer system configured to implement one or more aspects of the present invention;
FIG. 2 is a block diagram of a parallel processing unit included in the parallel processing subsystem of FIG. 1, according to one embodiment of the present invention;
FIG. 3A is a block diagram of a general processing cluster included in the parallel processing unit of FIG. 2, according to one embodiment of the present invention;
FIG. 3B is a conceptual diagram of a graphics processing pipeline that may be implemented within the parallel processing unit of FIG. 2, according to one embodiment of the present invention;
FIG. 4 is a conceptual diagram of a cache tile that the graphics processing pipeline of FIG. 3B may be configured to generate and process, according to one embodiment of the present invention;
FIG. 5 is a block diagram of a graphics subsystem configured to implement cache tiling, according to one embodiment of the present invention;
FIG. 6 is a more detailed illustration of the screen-space pipeline of FIG. 5, according to one embodiment of the present invention;
FIG. 7A shows a conceptual representation of z-data for a particular surface, according to one embodiment of the present invention;
FIG. 7B shows a conceptual representation of z-data for a cache tile, according to one embodiment of the present invention;
FIG. 8 shows a sequence of operations performed by a z-cull unit operating in a partial mode, according to one embodiment of the present invention; and
FIG. 9 is a flow diagram of method steps for performing z-culling operations in a tile-based architecture, according to one embodiment of the present invention.



DETAILED DESCRIPTION
In the following description, numerous specific details are set forth to provide a more thorough understanding of the present invention. However, it will be apparent to one of skill in the art that the present invention may be practiced without one or more of these specific details.
System Overview
FIG. 1 is a block diagram illustrating a computer system 100 configured to implement one or more aspects of the present invention. As shown, computer system 100 includes, without limitation, a central processing unit (CPU) 102 and a system memory 104 coupled to a parallel processing subsystem 112 via a memory bridge 105 and a communication path 113. Memory bridge 105 is further coupled to an I/O (input/output) bridge 107 via a communication path 106, and I/O bridge 107 is, in turn, coupled to a switch 116.
In operation, I/O bridge 107 is configured to receive user input information from input devices 108, such as a keyboard or a mouse, and forward the input information to CPU 102 for processing via communication path 106 and memory bridge 105. Switch 116 is configured to provide connections between I/O bridge 107 and other components of the computer system 100, such as a network adapter 118 and various add-in cards 120 and 121.
As also shown, I/O bridge 107 is coupled to a system disk 114 that may be configured to store content and applications and data for use by CPU 102 and parallel processing subsystem 112. As a general matter, system disk 114 provides non-volatile storage for applications and data and may include fixed or removable hard disk drives, flash memory devices, and CD-ROM (compact disc read-only-memory), DVD-ROM (digital versatile disc-ROM), Blu-ray, HD-DVD (high definition DVD), or other magnetic, optical, or solid state storage devices. Finally, although not explicitly shown, other components, such as universal serial bus or other port connections, compact disc drives, digital versatile disc drives, film recording devices, and the like, may be connected to I/O bridge 107 as well.
In various embodiments, memory bridge 105 may be a Northbridge chip, and I/O bridge 107 may be a Southbrige chip. In addition, communication paths 106 and 113, as well as other communication paths within computer system 100, may be implemented using any technically suitable protocols, including, without limitation, AGP (Accelerated Graphics Port), HyperTransport, or any other bus or point-to-point communication protocol known in the art.
In some embodiments, parallel processing subsystem 112 comprises a graphics subsystem that delivers pixels to a display device 110 that may be any conventional cathode ray tube, liquid crystal display, light-emitting diode display, or the like. In such embodiments, the parallel processing subsystem 112 incorporates circuitry optimized for graphics and video processing, including, for example, video output circuitry. As described in greater detail below in FIG. 2, such circuitry may be incorporated across one or more parallel processing units (PPUs) included within parallel processing subsystem 112. In other embodiments, the parallel processing subsystem 112 incorporates circuitry optimized for general purpose and/or compute processing. Again, such circuitry may be incorporated across one or more PPUs included within parallel processing subsystem 112 that are configured to perform such general purpose and/or compute operations. In yet other embodiments, the one or more PPUs included within parallel processing subsystem 112 may be configured to perform graphics processing, general purpose processing, and compute processing operations. System memory 104 includes at least one device driver 103 configured to manage the processing operations of the one or more PPUs within parallel processing subsystem 112.
In various embodiments, parallel processing subsystem 112 may be integrated with one or more other elements of FIG. 1 to form a single system. For example, parallel processing subsystem 112 may be integrated with CPU 102 and other connection circuitry on a single chip to form a system on chip (SoC).
It will be appreciated that the system shown herein is illustrative and that variations and modifications are possible. The connection topology, including the number and arrangement of bridges, the number of CPUs 102, and the number of parallel processing subsystems 112, may be modified as desired. For example, in some embodiments, system memory 104 could be connected to CPU 102 directly rather than through memory bridge 105, and other devices would communicate with system memory 104 via memory bridge 105 and CPU 102. In other alternative topologies, parallel processing subsystem 112 may be connected to I/O bridge 107 or directly to CPU 102, rather than to memory bridge 105. In still other embodiments, I/O bridge 107 and memory bridge 105 may be integrated into a single chip instead of existing as one or more discrete devices. Lastly, in certain embodiments, one or more components shown in FIG. 1 may not be present. For example, switch 116 could be eliminated, and network adapter 118 and add-in cards 120, 121 would connect directly to I/O bridge 107.
FIG. 2 is a block diagram of a parallel processing unit (PPU) 202 included in the parallel processing subsystem 112 of FIG. 1, according to one embodiment of the present invention. Although FIG. 2 depicts one PPU 202, as indicated above, parallel processing subsystem 112 may include any number of PPUs 202. As shown, PPU 202 is coupled to a local parallel processing (PP) memory 204. PPU 202 and PP memory 204 may be implemented using one or more integrated circuit devices, such as programmable processors, application specific integrated circuits (ASICs), or memory devices, or in any other technically feasible fashion.
In some embodiments, PPU 202 comprises a graphics processing unit (GPU) that may be configured to implement a graphics rendering pipeline to perform various operations related to generating pixel data based on graphics data supplied by CPU 102 and/or system memory 104. When processing graphics data, PP memory 204 can be used as graphics memory that stores one or more conventional frame buffers and, if needed, one or more other render targets as well. Among other things, PP memory 204 may be used to store and update pixel data and deliver final pixel data or display frames to display device 110 for display. In some embodiments, PPU 202 also may be configured for general-purpose processing and compute operations.
In operation, CPU 102 is the master processor of computer system 100, controlling and coordinating operations of other system components. In particular, CPU 102 issues commands that control the operation of PPU 202. In some embodiments, CPU 102 writes a stream of commands for PPU 202 to a data structure (not explicitly shown in either FIG. 1 or FIG. 2) that may be located in system memory 104, PP memory 204, or another storage location accessible to both CPU 102 and PPU 202. A pointer to the data structure is written to a pushbuffer to initiate processing of the stream of commands in the data structure. The PPU 202 reads command streams from the pushbuffer and then executes commands asynchronously relative to the operation of CPU 102. In embodiments where multiple pushbuffers are generated, execution priorities may be specified for each pushbuffer by an application program via device driver 103 to control scheduling of the different pushbuffers.
As also shown, PPU 202 includes an I/O (input/output) unit 205 that communicates with the rest of computer system 100 via the communication path 113 and memory bridge 105. I/O unit 205 generates packets (or other signals) for transmission on communication path 113 and also receives all incoming packets (or other signals) from communication path 113, directing the incoming packets to appropriate components of PPU 202. For example, commands related to processing tasks may be directed to a host interface 206, while commands related to memory operations (e.g., reading from or writing to PP memory 204) may be directed to a crossbar unit 210. Host interface 206 reads each pushbuffer and transmits the command stream stored in the pushbuffer to a front end 212.
As mentioned above in conjunction with FIG. 1, the connection of PPU 202 to the rest of computer system 100 may be varied. In some embodiments, parallel processing subsystem 112, which includes at least one PPU 202, is implemented as an add-in card that can be inserted into an expansion slot of computer system 100. In other embodiments, PPU 202 can be integrated on a single chip with a bus bridge, such as memory bridge 105 or I/O bridge 107. Again, in still other embodiments, some or all of the elements of PPU 202 may be included along with CPU 102 in a single integrated circuit or system of chip (SoC).
In operation, front end 212 transmits processing tasks received from host interface 206 to a work distribution unit (not shown) within task/work unit 207. The work distribution unit receives pointers to processing tasks that are encoded as task metadata (TMD) and stored in memory. The pointers to TMDs are included in a command stream that is stored as a pushbuffer and received by the front end unit 212 from the host interface 206. Processing tasks that may be encoded as TMDs include indices associated with the data to be processed as well as state parameters and commands that define how the data is to be processed. For example, the state parameters and commands could define the program to be executed on the data. The task/work unit 207 receives tasks from the front end 212 and ensures that GPCs 208 are configured to a valid state before the processing task specified by each one of the TMDs is initiated. A priority may be specified for each TMD that is used to schedule the execution of the processing task. Processing tasks also may be received from the processing cluster array 230. Optionally, the TMD may include a parameter that controls whether the TMD is added to the head or the tail of a list of processing tasks (or to a list of pointers to the processing tasks), thereby providing another level of control over execution priority.
PPU 202 advantageously implements a highly parallel processing architecture based on a processing cluster array 230 that includes a set of C general processing clusters (GPCs) 208, where C≧1. Each GPC 208 is capable of executing a large number (e.g., hundreds or thousands) of threads concurrently, where each thread is an instance of a program. In various applications, different GPCs 208 may be allocated for processing different types of programs or for performing different types of computations. The allocation of GPCs 208 may vary depending on the workload arising for each type of program or computation.
Memory interface 214 includes a set of D of partition units 215, where D≧1. Each partition unit 215 is coupled to one or more dynamic random access memories (DRAMs) 220 residing within PPM memory 204. In one embodiment, the number of partition units 215 equals the number of DRAMs 220, and each partition unit 215 is coupled to a different DRAM 220. In other embodiments, the number of partition units 215 may be different than the number of DRAMs 220. Persons of ordinary skill in the art will appreciate that a DRAM 220 may be replaced with any other technically suitable storage device. In operation, various render targets, such as texture maps and frame buffers, may be stored across DRAMs 220, allowing partition units 215 to write portions of each render target in parallel to efficiently use the available bandwidth of PP memory 204.
A given GPCs 208 may process data to be written to any of the DRAMs 220 within PP memory 204. Crossbar unit 210 is configured to route the output of each GPC 208 to the input of any partition unit 215 or to any other GPC 208 for further processing. GPCs 208 communicate with memory interface 214 via crossbar unit 210 to read from or write to various DRAMs 220. In one embodiment, crossbar unit 210 has a connection to I/O unit 205, in addition to a connection to PP memory 204 via memory interface 214, thereby enabling the processing cores within the different GPCs 208 to communicate with system memory 104 or other memory not local to PPU 202. In the embodiment of FIG. 2, crossbar unit 210 is directly connected with I/O unit 205. In various embodiments, crossbar unit 210 may use virtual channels to separate traffic streams between the GPCs 208 and partition units 215.
Again, GPCs 208 can be programmed to execute processing tasks relating to a wide variety of applications, including, without limitation, linear and nonlinear data transforms, filtering of video and/or audio data, modeling operations (e.g., applying laws of physics to determine position, velocity and other attributes of objects), image rendering operations (e.g., tessellation shader, vertex shader, geometry shader, and/or pixel/fragment shader programs), general compute operations, etc. In operation, PPU 202 is configured to transfer data from system memory 104 and/or PP memory 204 to one or more on-chip memory units, process the data, and write result data back to system memory 104 and/or PP memory 204. The result data may then be accessed by other system components, including CPU 102, another PPU 202 within parallel processing subsystem 112, or another parallel processing subsystem 112 within computer system 100.
As noted above, any number of PPUs 202 may be included in a parallel processing subsystem 112. For example, multiple PPUs 202 may be provided on a single add-in card, or multiple add-in cards may be connected to communication path 113, or one or more of PPUs 202 may be integrated into a bridge chip. PPUs 202 in a multi-PPU system may be identical to or different from one another. For example, different PPUs 202 might have different numbers of processing cores and/or different amounts of PP memory 204. In implementations where multiple PPUs 202 are present, those PPUs may be operated in parallel to process data at a higher throughput than is possible with a single PPU 202. Systems incorporating one or more PPUs 202 may be implemented in a variety of configurations and form factors, including, without limitation, desktops, laptops, handheld personal computers or other handheld devices, servers, workstations, game consoles, embedded systems, and the like.
FIG. 3A is a block diagram of a GPC 208 included in PPU 202 of FIG. 2, according to one embodiment of the present invention. In operation, GPC 208 may be configured to execute a large number of threads in parallel to perform graphics, general processing and/or compute operations. As used herein, a “thread” refers to an instance of a particular program executing on a particular set of input data. In some embodiments, single-instruction, multiple-data (SIMD) instruction issue techniques are used to support parallel execution of a large number of threads without providing multiple independent instruction units. In other embodiments, single-instruction, multiple-thread (SIMT) techniques are used to support parallel execution of a large number of generally synchronized threads, using a common instruction unit configured to issue instructions to a set of processing engines within GPC 208. Unlike a SIMD execution regime, where all processing engines typically execute identical instructions, SIMT execution allows different threads to more readily follow divergent execution paths through a given program. Persons of ordinary skill in the art will understand that a SIMD processing regime represents a functional subset of a SIMT processing regime.
Operation of GPC 208 is controlled via a pipeline manager 305 that distributes processing tasks received from a work distribution unit (not shown) within task/work unit 207 to one or more streaming multiprocessors (SMs) 310. Pipeline manager 305 may also be configured to control a work distribution crossbar 330 by specifying destinations for processed data output by SMs 310.
In one embodiment, GPC 208 includes a set of M of SMs 310, where M ≧1. Also, each SM 310 includes a set of functional execution units (not shown), such as execution units and load-store units. Processing operations specific to any of the functional execution units may be pipelined, which enables a new instruction to be issued for execution before a previous instruction has completed execution. Any combination of functional execution units within a given SM 310 may be provided. In various embodiments, the functional execution units may be configured to support a variety of different operations including integer and floating point arithmetic (e.g., addition and multiplication), comparison operations, Boolean operations (AND, OR, XOR), bit-shifting, and computation of various algebraic functions (e.g., planar interpolation and trigonometric, exponential, and logarithmic functions, etc.). Advantageously, the same functional execution unit can be configured to perform different operations.
In operation, each SM 310 is configured to process one or more thread groups. As used herein, a “thread group” or “warp” refers to a group of threads concurrently executing the same program on different input data, with one thread of the group being assigned to a different execution unit within an SM 310. A thread group may include fewer threads than the number of execution units within the SM 310, in which case some of the execution may be idle during cycles when that thread group is being processed. A thread group may also include more threads than the number of execution units within the SM 310, in which case processing may occur over consecutive clock cycles. Since each SM 310 can support up to G thread groups concurrently, it follows that up to G*M thread groups can be executing in GPC 208 at any given time.
Additionally, a plurality of related thread groups may be active (in different phases of execution) at the same time within an SM 310. This collection of thread groups is referred to herein as a “cooperative thread array” (“CTA”) or “thread array.” The size of a particular CTA is equal to m*k, where k is the number of concurrently executing threads in a thread group, which is typically an integer multiple of the number of execution units within the SM 310, and m is the number of thread groups simultaneously active within the SM 310.
Although not shown in FIG. 3A, each SM 310 contains a level one (L1) cache or uses space in a corresponding L1 cache outside of the SM 310 to support, among other things, load and store operations performed by the execution units. Each SM 310 also has access to level two (L2) caches (not shown) that are shared among all GPCs 208 in PPU 202. The L2 caches may be used to transfer data between threads. Finally, SMs 310 also have access to off-chip “global” memory, which may include PP memory 204 and/or system memory 104. It is to be understood that any memory external to PPU 202 may be used as global memory. Additionally, as shown in FIG. 3A, a level one-point-five (L1.5) cache 335 may be included within GPC 208 and configured to receive and hold data requested from memory via memory interface 214 by SM 310. Such data may include, without limitation, instructions, uniform data, and constant data. In embodiments having multiple SMs 310 within GPC 208, the SMs 310 may beneficially share common instructions and data cached in L1.5 cache 335.
Each GPC 208 may have an associated memory management unit (MMU) 320 that is configured to map virtual addresses into physical addresses. In various embodiments, MMU 320 may reside either within GPC 208 or within the memory interface 214. The MMU 320 includes a set of page table entries (PTEs) used to map a virtual address to a physical address of a tile or memory page and optionally a cache line index. The MMU 320 may include address translation lookaside buffers (TLB) or caches that may reside within SMs 310, within one or more L1 caches, or within GPC 208.
In graphics and compute applications, GPC 208 may be configured such that each SM 310 is coupled to a texture unit 315 for performing texture mapping operations, such as determining texture sample positions, reading texture data, and filtering texture data.
In operation, each SM 310 transmits a processed task to work distribution crossbar 330 in order to provide the processed task to another GPC 208 for further processing or to store the processed task in an L2 cache (not shown), parallel processing memory 204, or system memory 104 via crossbar unit 210. In addition, a pre-raster operations (preROP) unit 325 is configured to receive data from SM 310, direct data to one or more raster operations (ROP) units within partition units 215, perform optimizations for color blending, organize pixel color data, and perform address translations.
It will be appreciated that the core architecture described herein is illustrative and that variations and modifications are possible. Among other things, any number of processing units, such as SMs 310, texture units 315, or preROP units 325, may be included within GPC 208. Further, as described above in conjunction with FIG. 2, PPU 202 may include any number of GPCs 208 that are configured to be functionally similar to one another so that execution behavior does not depend on which GPC 208 receives a particular processing task. Further, each GPC 208 operates independently of the other GPCs 208 in PPU 202 to execute tasks for one or more application programs. In view of the foregoing, persons of ordinary skill in the art will appreciate that the architecture described in FIGS. 1-3A in no way limits the scope of the present invention.
Graphics Pipeline Architecture
FIG. 3B is a conceptual diagram of a graphics processing pipeline 350 that may be implemented within PPU 202 of FIG. 2, according to one embodiment of the present invention. As shown, the graphics processing pipeline 350 includes, without limitation, a primitive distributor (PD) 355; a vertex attribute fetch unit (VAF) 360; a vertex, tessellation, geometry processing unit (VTG) 365; a viewport scale, cull, and clip unit (VPC) 370; a tiling unit 375, a setup unit (setup) 380, a rasterizer (raster) 385; a fragment processing unit, also identified as a pixel shading unit (PS) 390, and a raster operations unit (ROP) 395.
The PD 355 collects vertex data associated with high-order surfaces, graphics primitives, and the like, from the front end 212 and transmits the vertex data to the VAF 360.
The VAF 360 retrieves vertex attributes associated with each of the incoming vertices from shared memory and stores the vertex data, along with the associated vertex attributes, into shared memory.
The VTG 365 is a programmable execution unit that is configured to execute vertex shader programs, tessellation programs, and geometry programs. These programs process the vertex data and vertex attributes received from the VAF 360, and produce graphics primitives, as well as color values, surface normal vectors, and transparency values at each vertex for the graphics primitives for further processing within the graphics processing pipeline 350. Although not explicitly shown, the VTG 365 may include, in some embodiments, one or more of a vertex processing unit, a tessellation initialization processing unit, a task generation unit, a task distributor, a topology generation unit, a tessellation processing unit, and a geometry processing unit.
The vertex processing unit is a programmable execution unit that is configured to execute vertex shader programs, lighting and transforming vertex data as specified by the vertex shader programs. For example, the vertex processing unit may be programmed to transform the vertex data from an object-based coordinate representation (object space) to an alternatively based coordinate system such as world space or normalized device coordinates (NDC) space. The vertex processing unit may read vertex data and vertex attributes that is stored in shared memory by the VAF and may process the vertex data and vertex attributes. The vertex processing unit 415 stores processed vertices in shared memory.
The tessellation initialization processing unit is a programmable execution unit that is configured to execute tessellation initialization shader programs. The tessellation initialization processing unit processes vertices produced by the vertex processing unit and generates graphics primitives known as patches. The tessellation initialization processing unit also generates various patch attributes. The tessellation initialization processing unit then stores the patch data and patch attributes in shared memory. In some embodiments, the tessellation initialization shader program may be called a hull shader or a tessellation control shader.
The task generation unit retrieves data and attributes for vertices and patches from shared memory. The task generation unit generates tasks for processing the vertices and patches for processing by later stages in the graphics processing pipeline 350.
The task distributor redistributes the tasks produced by the task generation unit. The tasks produced by the various instances of the vertex shader program and the tessellation initialization program may vary significantly between one graphics processing pipeline 350 and another. The task distributor redistributes these tasks such that each graphics processing pipeline 350 has approximately the same workload during later pipeline stages.
The topology generation unit retrieves tasks distributed by the task distributor. The topology generation unit indexes the vertices, including vertices associated with patches, and computes (U,V) coordinates for tessellation vertices and the indices that connect the tessellated vertices to form graphics primitives. The topology generation unit then stores the indexed vertices in shared memory.
The tessellation processing unit is a programmable execution unit that is configured to execute tessellation shader programs. The tessellation processing unit reads input data from and writes output data to shared memory. This output data in shared memory is passed to the next shader stage, the geometry processing unit 445 as input data. In some embodiments, the tessellation shader program may be called a domain shader or a tessellation evaluation shader.
The geometry processing unit is a programmable execution unit that is configured to execute geometry shader programs, thereby transforming graphics primitives. Vertices are grouped to construct graphics primitives for processing, where graphics primitives include triangles, line segments, points, and the like. For example, the geometry processing unit may be programmed to subdivide the graphics primitives into one or more new graphics primitives and calculate parameters, such as plane equation coefficients, that are used to rasterize the new graphics primitives.
The geometry processing unit transmits the parameters and vertices specifying new graphics primitives to the VPC 370. The geometry processing unit may read data that is stored in shared memory for use in processing the geometry data. The VPC 370 performs clipping, culling, perspective correction, and viewport transform to determine which graphics primitives are potentially viewable in the final rendered image and which graphics primitives are not potentially viewable. The VPC 370 then transmits processed graphics primitives to the tiling unit 375.
The tiling unit 375 is a graphics primitive sorting engine that resides between a world space pipeline 352 and a screen space pipeline 354, as further described herein. Graphics primitives are processed in the world space pipeline 352 and then transmitted to the tiling unit 375. The screen space is divided into cache tiles, where each cache tile is associated with a portion of the screen space. For each graphics primitive, the tiling unit 375 identifies the set of cache tiles that intersect with the graphics primitive, a process referred to herein as “tiling.” After tiling a certain number of graphics primitives, the tiling unit 375 processes the graphics primitives on a cache tile basis, where graphics primitives associated with a particular cache tile are transmitted to the setup unit 380. The tiling unit 375 transmits graphics primitives to the setup unit 380 one cache tile at a time. Graphics primitives that intersect with multiple cache tiles are typically processed once in the world space pipeline 352, but are then transmitted multiple times to the screen space pipeline 354.
Such a technique improves cache memory locality during processing in the screen space pipeline 354, where multiple memory operations associated with a first cache tile access a region of the L2 caches, or any other technically feasible cache memory, that may stay resident during screen space processing of the first cache tile. Once the graphics primitives associated with the first cache tile are processed by the screen space pipeline 354, the portion of the L2 caches associated with the first cache tile may be flushed and the tiling unit may transmit graphics primitives associated with a second cache tile. Multiple memory operations associated with a second cache tile may then access the region of the L2 caches that may stay resident during screen space processing of the second cache tile. Accordingly, the overall memory traffic to the L2 caches and to the render targets may be reduced. In some embodiments, the world space computation is performed once for a given graphics primitive irrespective of the number of cache tiles in screen space that intersects with the graphics primitive.
The setup unit 380 receives vertex data from the VPC 370 via the tiling unit 375 and calculates parameters associated with the graphics primitives, including, without limitation, edge equations, partial plane equations, and depth plane equations. The setup unit 380 then transmits processed graphics primitives to rasterizer 385.
The rasterizer 385 scan converts the new graphics primitives and transmits fragments and coverage data to the pixel shading unit 390. Additionally, the rasterizer 385 may be configured to perform z culling and other z-based optimizations.
The pixel shading unit 390 is a programmable execution unit that is configured to execute fragment shader programs, transforming fragments received from the rasterizer 385, as specified by the fragment shader programs. Fragment shader programs may shade fragments at pixel-level granularity, where such shader programs may be called pixel shader programs. Alternatively, fragment shader programs may shade fragments at sample-level granularity, where each pixel includes multiple samples, and each sample represents a portion of a pixel. Alternatively, fragment shader programs may shade fragments at any other technically feasible granularity, depending on the programmed sampling rate.
In various embodiments, the fragment processing unit 460 may be programmed to perform operations such as perspective correction, texture mapping, shading, blending, and the like, to produce shaded fragments that are transmitted to the ROP 395. The pixel shading unit 390 may read data that is stored in shared memory.
The ROP 395 is a processing unit that performs raster operations, such as stencil, z test, blending, and the like, and transmits pixel data as processed graphics data for storage in graphics memory via the memory interface 214, where graphics memory is typically structured as one or more render targets. The processed graphics data may be stored in graphics memory, parallel processing memory 204, or system memory 104 for display on display device 110 or for further processing by CPU 102 or parallel processing subsystem 112. In some embodiments, the ROP 395 is configured to compress z or color data that is written to memory and decompress z or color data that is read from memory. In various embodiments, the ROP 395 may be located in the memory interface 214, in the GPCs 208, in the processing cluster array 230 outside of the GPCs, or in a separate unit (not shown) within the PPUs 202.
The graphics processing pipeline may be implemented by any one or more processing elements within PPU 202. For example, one of the SMs 310 of FIG. 3A could be configured to perform the functions of one or more of the VTG 365 and the pixel shading unit 390. The functions of the PD 355, the VAF 360, the VPC 450, the tiling unit 375, the setup unit 380, the rasterizer 385, and the ROP 395 may also be performed by processing elements within a particular GPC 208 in conjunction with a corresponding partition unit 215. Alternatively, graphics processing pipeline 350 may be implemented using dedicated fixed-function processing elements for one or more of the functions listed above. In various embodiments, PPU 202 may be configured to implement one or more graphics processing pipelines 350.
In some embodiments, the graphics processing pipeline 350 may be divided into a world space pipeline 352 and a screen space pipeline 354. The world space pipeline 352 processes graphics objects in 3D space, where the position of each graphics object is known relative to other graphics objects and relative to a 3D coordinate system. The screen space pipeline 354 processes graphics objects that have been projected from the 3D coordinate system onto a 2D planar surface representing the surface of the display device 110. For example, the world space pipeline 352 could include pipeline stages in the graphics processing pipeline 350 from the PD 355 through the VPC 370. The screen space pipeline 354 could include pipeline stages in the graphics processing pipeline 350 from the setup unit 380 through the ROP 395. The tiling unit 375 would follow the last stage of the world space pipeline 352, namely, the VPC 370. The tiling unit 375 would precede the first stage of the screen space pipeline 354, namely, the setup unit 380.
In some embodiments, the world space pipeline 352 may be further divided into an alpha phase pipeline and a beta phase pipeline. For example, the alpha phase pipeline could include pipeline stages in the graphics processing pipeline 350 from the PD 355 through the task generation unit. The beta phase pipeline could include pipeline stages in the graphics processing pipeline 350 from the topology generation unit through the VPC 370. The graphics processing pipeline 350 performs a first set of operations during processing in the alpha phase pipeline and a second set of operations during processing in the beta phase pipeline. As used herein, a set of operations is defined as one or more instructions executed by a single thread, by a thread group, or by multiple thread groups acting in unison.
In a system with multiple graphics processing pipeline 350, the vertex data and vertex attributes associated with a set of graphics objects may be divided so that each graphics processing pipeline 350 has approximately the same amount of workload through the alpha phase. Alpha phase processing may significantly expand the amount of vertex data and vertex attributes, such that the amount of vertex data and vertex attributes produced by the task generation unit is significantly larger than the amount of vertex data and vertex attributes processed by the PD 355 and VAF 360. Further, the task generation unit associated with one graphics processing pipeline 350 may produce a significantly greater quantity of vertex data and vertex attributes than the task generation unit associated with another graphics processing pipeline 350, even in cases where the two graphics processing pipelines 350 process the same quantity of attributes at the beginning of the alpha phase pipeline. In such cases, the task distributor redistributes the attributes produced by the alpha phase pipeline such that each graphics processing pipeline 350 has approximately the same workload at the beginning of the beta phase pipeline.
Please note, as used herein, references to shared memory may include any one or more technically feasible memories, including, without limitation, a local memory shared by one or more SMs 310, or a memory accessible via the memory interface 214, such as a cache memory, parallel processing memory 204, or system memory 104. Please also note, as used herein, references to cache memory may include any one or more technically feasible memories, including, without limitation, an L1 cache, an L1.5 cache, and the L2 caches.
Tiled Caching
FIG. 4 is a conceptual diagram of a cache tile 410(0) that the graphics processing pipeline 350 of FIG. 3B may be configured to generate and process, according to one embodiment of the present invention. As shown, the cache tile 410(0) represents a portion of a screen space 400 and is divided into multiple raster tiles 420.
The screen space 400 represents one or more memory buffers configured to store rendered image data and other data transmitted by functional units within the graphics processing pipeline 350. In some embodiments, the one or more memory buffers may be configured as one or more render targets. The screen space represents a memory buffer configured to store the image rendered by the graphics processing pipeline. The screen space 400 may be associated with any number of render targets, where each render target may be configured independently of other render targets to include any number of fields. Each field within a render target may be configured independently of other fields to include any number of bits. Each render target may include multiple picture elements (pixels), and each pixel may, in turn, include multiple samples. In some embodiments, the size of each cache tile may be based on the size and configuration of the render targets associated with the screen space. In operation, once rendering completes, the pixels in the one or more render targets may be transmitted to a display device in order to display the rendered image.
By way of example, a set of render targets for the screen space 400 could include eight render targets. The first render target could include four fields representing color, including red, green, and blue component colors, and transparency information associated with a corresponding fragment. The second render target could include two fields representing depth and stencil information associated with the corresponding fragment. The third render target could include three fields representing surface normal vector information, including an x-axis normal vector, a y-axis normal vector, and a z-axis normal vector, associated with the corresponding fragment. The remaining five render targets could be configured to store additional information associated with the corresponding fragment. Such configurations could include storage for various information, including, without limitation, 3D positional data, diffuse lighting information, and specular lighting information.
Each cache tile 410 represents a portion of the screen space 400. For clarity, only five cache tiles 410(0)-410(4) are shown in FIG. 4. In some embodiments, cache tiles may have an arbitrary size in X and Y screen space. For example, if a cache tile were to reside in a cache memory that also is used to store other data, then the cache tile could be sized to consume only a specific portion of the cache memory. The size of a cache tile may be based on a number of factors, including, the quantity and configuration of the render targets associated with the screen space 400, the quantity of samples per pixel, and whether the data stored in the cache tile is compressed. As a general matter, a cache tile is sized to increase the likelihood that the cache tile data remains resident in the cache memory until all graphics primitives associated with the cache tile are fully processed.
The raster tiles 420 represent a portion of the cache tile 410(0). As shown, the cache tile 410(0) includes sixteen raster tiles 420(0)-420(15) arranged in an array that is four raster tiles 420 wide and four raster tiles 420 high. In systems that include multiple GPCs 208, processing associated with a given cache tile 410(0) may be divided among the available GPCs 208. In the example shown, if the sixteen raster tiles of cache tile 410(0) were processed by four different GPCs 208, then each GPC 208 could be assigned to process four of the sixteen raster tiles 420 in the cache tile 410(0). Specifically, the first GPC 208 could be assigned to process raster tiles 420(0), 420(7), 420(10), and 420(13). The second GPC 208 could be assigned to process raster tiles 420(1), 420(4), 420(11), and 420(14). The third GPC 208 could be assigned to process raster tiles 420(2), 420(5), 420(8), and 420(15). The fourth GPC 208 would then be assigned to process raster tiles 420(3), 420(6), 420(9), and 420(12). In other embodiments, the processing of the different raster tiles within a given cache tile may be distributed among GPCs 208 or any other processing entities included within computer system 100 in any technically feasible manner.
Tiling Unit Operation
FIG. 5 illustrates a graphics subsystem configured to implement cache tiling, according to one embodiment of the present invention. The graphics subsystem 500 illustrates several units that are described above with respect to FIG. 3B. As shown, the graphics subsystem 500 includes a front end unit 212, a first world-space pipeline 352(0), a second world-space pipeline 352(1), a crossbar unit 530 (“XBAR”), a first tiling unit 575(0), a second tiling unit 575(1), a first screen-space pipeline 354(0), and a second screen-space pipeline 354(1).
The graphics subsystem 500 includes at least two instances of the screen-space pipeline 354 and the world-space pipeline 352, for increased performance. The graphics subsystem 500 also includes a crossbar unit 530 for transmitting work output from the first world-space pipeline 352(0) and the second world-space pipeline 352(1) to the first tiling unit 575(0) and the second tiling unit 575(1). Although depicted in FIG. 5 with two instances of the world-space pipeline 352 and the screen-space pipeline 354, the teachings provided herein apply to graphics pipelines having any number of world-space pipelines 352 and screen-space pipelines 354. Each of the screen-space pipeline 354 and the world-space pipeline 352 are described in more detail above with respect to FIG. 3B.
The functionality of the world-space pipelines 352 and the screen-space pipelines 354 are implemented by processing entities such as general processing clusters (GPC) 208, described above. In one embodiment, the first world-space pipeline 352(0) may be implemented in a first GPC 208(0) and the second world-space pipeline 352(1) may be implemented in a second GPC 208(1). As a general matter, each screen-space pipeline 352 may be implemented in a different GPC 208, and in a similar fashion, each world-space pipeline 354 may be implemented in a different GPC 208. Further, a given GPC 208 can implement a world-space pipeline 354 and also a screen-space pipeline 352. For example, the first GPC 208(0) may implement both the first world-space pipeline 352(0) and the first screen-space pipeline 354(0). In embodiments that include more than one screen-space pipeline 354, each screen-space pipeline 354 is associated with a different set of raster tiles 420 for any particular render target. Again, each of the screen-space pipeline 354 and world-space pipeline 352 are described in more detail above with respect to FIG. 3B.
Each of the pipeline units in the world-space pipelines 352 (i.e., primitive distributor 355, vertex attribute fetch unit 360, vertex, tessellation, geometry processing unit 365, and viewport scale, cull, and clip unit 370) and in the screen-space pipelines 354 (i.e., setup 380, rasterizer 385, pixel shader 390, and ROP 395) depicted in FIG. 5 functions in a similar manner as described above with respect to FIGS. 1-4.
A device driver 103 transmits instructions to the front end unit 212. The instructions include primitives and commands to bind render targets, arranged in application-programming-interface order (API order). API order is the order in which the device driver 103 specifies that the commands should be executed and is typically specified by an application executing on CPU 102. For example, an application may specify that a first primitive is to be drawn and then that a second primitive is to be drawn. The application may also specify that certain work is to be rendered to a particular render target, or that one or more render targets are to be bound.
When the front end unit 212 receives the instructions from the device driver 103, the front end unit 212 distributes tasks associated with the instructions to the world-space pipelines 352 for processing. In one embodiment, the front end unit 212 assigns tasks to the first world-space pipeline 352(0) and the second world-space pipeline 352(1) in round-robin order. For example, the front end unit 212 may transmit tasks for a first batch of primitives associated with the instructions to the first world-space pipeline 352(0) and tasks for a second batch of primitives associated with the instructions to the second world-space pipeline 352(1).
Each of the first world-space pipeline 352(0) and second world-space pipeline 352(1) processes tasks associated with the instructions, and generate primitives for processing by the first screen-space pipeline 354(0) and the second screen-space pipeline 354(1). The first world-space pipeline 352 (0) and second world-space pipeline 352(1) each include a bounding box generator unit (not shown) that determines to which screen space pipeline—the first screen-space pipeline 354(0) or the second screen-space pipeline 354(1)—each primitive should be transmitted. To make this determination, the bounding box generator unit generates bounding boxes for each primitive, and compares the bounding boxes to raster tiles 420. If a bounding box associated with a primitive overlaps one or more raster tiles associated with a particular screen-space pipeline 354, then the bounding box generator unit determines that the primitive is to be transmitted to that screen-space pipeline 354. A primitive may be transmitted to multiple screen-space pipelines 354 if the primitive overlaps raster tiles 420 associated with more than one screen-space pipeline 354. After the world-space pipelines 352 generate the primitives, the world-space pipelines 352 transmit the primitives to the crossbar unit 530, which transmits the primitives to the corresponding tiling units 375 as specified by the bounding box generator unit.
The tiling units 575 receive primitives from the crossbar unit 530. Each tiling unit 575 accepts and stores these primitives until the tiling unit 575 decides to perform a flush operation. Each tiling unit 575 decides to perform a flush operation when one or more resource counters maintained by the tiling units 575 indicates that a resource has exceeded a threshold. Each tiling unit 575 may also perform a flush operation upon receiving a command from upstream in the graphics processing pipeline 500 requesting that the tiling unit 575 perform a flush operation. Such a command is referred to herein as a “flush-tiling-unit command.” The device driver 103 may transmit the flush-tiling-unit command to the graphics processing pipeline 500 in situations that the device driver 103 deems appropriate.
Upon receiving primitives, a tiling unit 575 updates several resource counters associated with the primitives. The resource counters are configured to track the degree of utilization of various resources associated with the primitives received by the tiling units 575. Resources are either global resources or local resources. Global resources are pools of resources that are shared by all screen-space pipelines 354 and world-space pipelines 352. Local resources are resources that not shared between screen-space pipelines 354 or between world-space pipelines 352. Several examples of local and global resources are now provided.
One type of local resource is a primitive storage space for storing primitives in a tiling unit 575. Each tiling unit 575 includes a primitive storage space that is maintained independently of primitive storage space for other tiling units 575. When a tiling unit 575 receives a primitive, some of the primitive storage space is occupied by the primitive. Because only a limited amount of primitive storage space exists for each tiling unit 575, exceeding a threshold amount of storage space in a particular tiling unit 575 causes the tiling unit 575 to perform a flush operation.
One type of global resource is a vertex attribute circular buffer. The vertex attribute circular buffer includes circular buffer entries that include vertex attributes. The vertex attribute circular buffer is available to units in the graphics subsystem 500 for reading vertex attributes associated with primitives. Each circular buffer entry in the vertex attribute circular buffer occupies a variable amount of storage space. Each tiling unit 575 maintains a count of the amount of space occupied by circular buffer entries associated with primitives in the tiling unit 575.
In one embodiment, the vertex attribute circular buffer may be structured as a collection of smaller per-world-space-pipeline circular buffers. Each per-world-space pipeline circular buffer is associated with a different world-space pipeline 352. If memory space associated with any of the per-world-space-pipeline circular buffers exceed a threshold value, then the associated tiling unit performs a flush operation.
Another type of global resource is a pool of constant buffer table indices. At the application-programming-interface level, an application programmer is permitted to associate constants with shader programs. Different shader programs may be associated with different constants. Each constant is a value that may be accessed while performing computations associated with the shader programs. The pool of constant buffer table indices is a global resource by which constants are associated with shader programs.
When a tiling unit 575 performs a flush operation, the tiling unit 575 iterates through all of the cache tiles 410, and for each cache tile 410, generates a cache tile batch that includes primitives that overlap the cache tile 410, and transmits the cache tile batches to the associated screen-space pipeline 354. Each tiling unit 575 is associated with a different screen-space pipeline 354. Thus, each tiling unit 575 transmits cache tile batches to the associated screen-space pipeline 354.
The tiling unit 575 transmits these cache tile batches to the screen-space pipeline 354 associated with the tiling unit as the cache tile batches are generated. The tiling unit 575 continues to generate and transmit cache tile batches in this manner for all cache tiles 410 associated with a render target. In one embodiment, the tiling unit 575 determines which primitives overlap a cache tile 410 by comparing a border of the cache tile 410 with bounding boxes associated with the primitives and received from the bounding box unit.
The cache tile batches flow through the screen-space pipelines 354 in the order in which the tiling unit 575 generates the cache tile batches. This ordering causes the units in the screen-space pipelines 354 to process the primitives in cache tile order. In other words, the screen-space pipelines 354 process primitives that overlap a first cache tile, and then process primitives that overlap a second cache tile, and so on.
Conceptually, each cache tile batch can be thought of as beginning at the point in time at which the tiling unit 575 began accepting primitives after the previous flush operation. In other words, even though the cache tile batches are transmitted to and processed by the screen-space pipelines 354 sequentially, each cache tile batch logically begins at the same point in time. Of course, because the cache tiles generally do not overlap in screen space, sequential processing in this manner generally produces the desired results.
The screen-space pipeline 354 may be configured to perform z-cull operations in which a z-cull unit performs depth testing and discards occluded fragments. Z-cull operations performed in the context of the tiling architecture of FIG. 5 are described below with respect to FIGS. 6-9.
Higher Accuracy Z-Cull in a Tile-Based Architecture
FIG. 6 is a more detailed illustration of the screen-space pipeline 354 of FIG. 5, according to one embodiment of the present invention. As shown, the screen-space pipeline 354 includes a setup unit 380, a rasterizer 385, a pixel shader 390, and a raster operations unit 395. The rasterizer 385 includes a coarse raster unit 610 and a z-cull unit 620.
The coarse raster unit 610 rasterizes primitives received from setup 380 to a coarse resolution. In other words, the coarse raster unit 610 determines coverage of the received primitives for a coarse grid, where each element in the coarse grid includes a plurality of samples and/or pixels in the render target.
The z-cull unit 620 culls groups of fragments that fail a visibility test. More specifically, the z-cull unit 620 stores depth data for fragments that are processed by the screen-space pipeline 354. The stored depth data is stored in z-cull memory 625. A memory buffer 810, stored in a memory unit, such as PP memory 204, stores additional z-cull data that can be read into z-cull memory 625. When the z-cull unit 620 receives one or more primitives, the z-cull unit 620 compares z data for groups of one or more fragments associated with those primitives against data stored in the z-cull memory 625. If the z data for a group of fragments indicates that the group of fragments would fail the depth test (also known as a visibility test) based on the geometry represented in the z-cull memory 625, then the entire group of fragments is discarded. If, on the other hand, the z data for a group of fragments indicate that the group of fragments does not necessarily fail the depth test based on the geometry represented in the z-cull memory, then the group of fragments is not discarded and, instead, is transmitted through the pipeline for further processing. The visibility test may implement one of several functions that compare data associated with incoming fragments to data stored in the z-cull memory 625. For example, the visibility test may implement a less-than-function, a less-than-or-equal-to-function, an equal-to function, a greater-than function, a greater-than-or-equal-to-function, or other functions known to those of skill in the art. Additionally, the visibility test may be based on both or either of depth data and stencil data. Throughout this document, “depth data” and the “depth test” refer to a test that implements one of the above-described comparison functions and that may be based on depth data, stencil data, or both.
By discarding fragments that do not pass the visibility test, the z-cull unit 620 functions to limit the number of fragments that are processed by the pixel shader 390. Further, the fragments that are not processed by the pixel shader 390 are fragments that would be discarded anyway. In other words, these fragments would be processed by the pixel shader 390 and then be discarded, due to being occluded by other fragments already processed. Therefore, the z-cull unit 620 functions to prevent the pixel shader 390 from shading fragments that are to be discarded, thereby saving processing cycles and reducing power consumption.
The z-cull unit 620 is configured to operate in either a full-surface z-cull mode or a partial-surface z-cull mode. A command from the tiling unit 575 or from another unit in the graphics processing system 500 may operate to select between the full-surface z-cull mode and the partial surface z-cull mode. In some embodiments, the z-cull unit 620 may be configured to operate only in the partial-surface z-cull mode. In the full-surface z-cull mode, memory space within z-cull memory 625 stores depth data for an entire surface being rendered. In a partial-surface z-cull mode, memory space within z-cull memory 625 stores depth data for a cache tile within the entire surface being rendered. Because only a portion of the render surface is being stored in the z-cull memory in the partial-surface z-cull mode, the z-cull unit 620 is able to perform z-cull operations with a higher resolution in the partial-surface z-cull mode than in the full-surface z-cull mode. The full-surface z-cull mode is described in greater detail below with respect to FIG. 7A, and the partial-surface z-cull mode is described in greater detail below with respect to FIG. 7B.
FIG. 7A shows a conceptual representation of z-data for a particular surface, according to one embodiment of the present invention. As shown, the conceptual diagram 700 includes a full-mode z-cull representation 702 and a render surface 720 associated with the full-mode z-cull representation 702.
Full-mode z-cull representation 702 (or “full representation 702”) includes z-cull data for an entire surface 720 to be rendered. The full representation 702 is stored in the z-cull memory 625 during operation of the z-cull unit 620 in full mode. The full representation 702 includes a number of full-mode z-cull data elements 704 (or “coarse z elements 704”). Each coarse z element 704 includes z-cull data for a respective portion 730 (or “sub-surface area 730”) of the entire surface 720.
Each sub-surface area 730 includes a number of samples 722 that are included in the surface to be rendered 720 (or “render surface” 720). The “render surface” 720 is similar to the screen space 400 described with respect to FIG. 4). Thus, each sample 722 is located within a particular sub-surface area 730, which includes more than one sample 722. In the example render surface 720, each of nine sub-surface areas 730 includes eighty-one samples 722. The number of samples 722 in a sub-surface area 730 and the number of sub-surface areas 730 in a render surface 720 may be varied as needed. Further, each of the sub-surface areas 730 corresponds to one of the coarse z elements 704 included in the full representation 702. Each of the coarse z elements 704 includes data for a different sub-surface area 730. The data in each of the coarse z elements 704 corresponds to all of the samples 722 included in the corresponding sub-surface area 730 of the render surface 720.
When the z-cull unit 620 operates in full-surface z-cull mode, the z-cull unit 620 performs visibility tests on a per-sub-surface area 730 basis. More specifically, the z-cull unit 620 compares the depth data for all of the samples 722 in a particular sub-surface area 730 for an input primitive being processed to depth data stored in the corresponding coarse z element 704 stored in the full representation 702. Because the data stored in the coarse z element 704 refers to a relatively large number of samples, the visibility test performed by the z-cull unit 620 is a “low-resolution” or “coarse” visibility test. More specifically, the test performed by the z-cull unit 620 compares z-data for groups of samples 722 to z-data that has a less-than-per-sample precision. If a group of fragments for a particular group of samples 722 fails the visibility test, then the group of fragments is discarded. If, on the other hand, the group of fragments passes the visibility test, then the group of fragments is transmitted through the pipeline for further processing.
Because data stored in the coarse z element refers to more than one sample 722, the z-cull visibility test is a “conservative” test. In other words, because the z-cull unit 620 performs tests for groups of samples 722, and decides whether to discard or not discard fragments for those samples 722 all at once, the z-cull unit 620 does not discard the group of fragments so long as at least one fragment within the group passes the visibility test. A conservative test is implemented so that fragments that should be displayed are not accidentally discarded. For example, if a group of eighty-one fragments were discarded because eighty out of the eighty-one fragments failed the visibility test, then one fragment that should be written to the frame buffer would be discarded, which could lead to inaccurate results.
FIG. 7B shows a conceptual representation of z-data for a cache tile, according to one embodiment of the present invention. As shown, the conceptual diagram 750 includes a partial-mode z-cull representation 752 and a render surface 770 associated with the partial-mode z-cull representation 752.
As with the full representation 702 of FIG. 7A, the partial-mode z-cull representation 752 (or “partial representation 752”) includes z-cull data for a render target 770. However, unlike the full representation 702, the partial representation 752 includes z-cull data only for a single cache tile. For example, the partial representation 752 may include z-cull data for cache tile 774. The partial representation 752 includes multiple partial representation elements 754 (or “detailed z elements 754”), each of which corresponds to a different sub-cache-tile-area 780 in a particular cache tile.
Each sub-cache-tile-area 780 includes a number of samples 722 that are included in the render surface 770. The number of samples in a sub-cache-tile-area 780 may be one or more than one. In the example depicted in FIG. 7B, the number of samples 722 in a sub-cache-tile-area 780 is nine. The number of samples 722 in a sub-cache-tile-area 780 may be varied as needed. Further, each of the sub-cache-tile-areas 780 corresponds to one of the detailed z elements 754 included in the partial representation 752. Each of the detailed z elements 754 includes data for a different sub-cache-tile-area 780. The data in each of the detailed z elements 754 corresponds to all of the samples 722 included in the corresponding sub-cache-tile-area 780.
When the z-cull unit 620 operates in partial-surface z-cull mode (or “partial mode”), the z-cull unit 620 performs visibility tests on a per-sub-cache-tile-area 780 basis. More specifically, the z-cull unit 620 compares the depth data for all of the samples 722 in a particular sub-cache-tile-area 780 for an input primitive being processed to depth data stored in the corresponding detailed z element 754 stored in the partial representation 752. The data stored in the detailed z element 754 is associated with a smaller number of samples 722 than the data stored in the coarse z element 704 of the full representation 702. As with full mode, in partial mode, visibility testing for a group of fragments is conducted. If a fragment for one sample 722 in a per-sub-cache-tile-area 780 fails a visibility test, then the group of fragments is discarded. If, on the other hand, the group of fragments passes the visibility test, then the group of fragments is transmitted through the pipeline for further processing.
Further, as with full mode, in the partial mode, the visibility test is “conservative.” In other words, because the z-cull unit 620 performs tests for groups of samples 722 all at once, the z-cull unit 620 does not discard the group of fragments if any one of the fragments passes the visibility test. However, because a smaller group of fragments is examined in the partial mode than in the full mode, more groups of fragments may be discarded in the partial mode than in the full mode. For example, if in the full mode, one sample out of eighty-one samples passes the visibility test, then eighty samples that would eventually be discarded instead cannot be discarded by the z-cull unit 620. However, if in the partial mode, one sample out of eighty-one samples passes the visibility test, then seventy-two samples may be discarded, while only nine are not discarded.
In some embodiments, approximately the same amount of memory that is used to store a full representation 702 in full mode is used to store a partial representation 752 in partial mode. Further, in some embodiments, the same physical memory that is used to store a full representation 702 in full mode is used to store a partial representation 752 in partial mode. In other embodiments, the z-cull memory 625 stores data for an entire render surface in full mode but stores data for less than an entire render surface in partial mode. In further embodiments, including the embodiments in which the z-cull memory 625 stores data for less than an entire render surface in partial mode, the z-cull memory 625 may store data corresponding only to one cache tile, or only to two cache tiles, in the partial mode.
FIG. 8 shows a sequence of operations 800 performed by a z-cull unit 620 operating in partial mode, according to one embodiment of the present invention. The sequence of operations 800 depicts z-cull unit 620 communicating with z-cull memory 625 and with memory buffer 810 to process data in the partial mode.
In operation, the z-cull unit 620 receives cache tile batches from upstream in the screen-space pipeline 354. The z-cull unit 620 processes the cache tile batches in partial mode. More specifically, when the z-cull unit 620 receives a new cache tile batch, the z-cull unit 620 loads a partial representation 752 into the z-cull memory 625. As described above with respect to FIG. 7B, the z-cull unit 620 compares z-data in fragments received for the cache tile batch to the detailed z elements 754 in the partial representation in the z-cull memory 625.
When a first cache tile has completed processing in the z-cull unit 620 and a second cache tile begins processing in the z-cull unit 620, the partial representation 752 loaded into the z-cull memory 625 is changed as well. More specifically, the partial representation 752 associated with the second cache tile is loaded into the z-cull memory 625. The partial representation 752 associated with the first cache tile may be written to the memory buffer 810 or simply discarded if not modified during z-cull operations for the first cache tile.
In the embodiment of z-cull memory 625 depicted in FIG. 8, the z-cull memory is “double buffered.” In other words, the z-cull memory 625 includes space for a cache tile that is currently being processed, as well as a future cache tile. In other embodiments, the z-cull memory 625 may include space for only one cache tile, or for two or more cache tiles.
In some embodiments, the z-cull unit 620 is configured to pre-fetch partial representations 752 for future cache tiles before processing those cache tiles. More specifically, when the tiling unit 375 transmits primitives for a particular cache tile to the screen-space pipeline 354, the tiling unit 375 also transmits a command to the z-cull unit 620 to fetch z-cull data to the z-cull memory 625 for the next cache tile. Then, when the next cache tile is processed by the z-cull unit 620, data for that cache tile is available in the z-cull memory 625.
FIG. 9 is a flow diagram of method steps for performing z-culling operations in a tile-based architecture, according to one embodiment of the present invention. Although the method steps are described in conjunction with the system of FIGS. 1-8, persons skilled in the art will understand that any system configured to perform the method steps, in any order, falls within the scope of the present invention.
As shown, a method 900 begins in step 902, where the tiling unit 575 receives a set of primitives. In step 904, the tiling unit 575 determines whether to process the set of primitives in a full surface z-cull mode. If the tiling unit 575 determines that the set of primitives should be processed in the full surface z-cull mode, then the method proceeds to step 906. In step 906, the tiling unit 575 causes the z-cull unit 620 to fetch a full representation for a render surface into the z-cull memory 625. In step 908, the tiling unit transmits primitives in the set of primitives that overlap the current cache tile to a screen-space pipeline 354. In step 910, the tiling unit 575 causes the z-cull unit 620 to process the current cache tile with the full representation. In step 912, the tiling unit 575 determines whether there are additional cache tiles to process. If there are additional cache tiles, then the method returns to step 908. If there are not additional cache tiles, then the method proceeds to step 922.
Referring back to step 904, if the tiling unit 575 determines that the set of primitives should be processed in the partial surface z-cull mode, then the method proceeds to step 914. In step 914, the tiling unit 575 causes the z-cull memory 620 to fetch a partial representation for a current cache tile. In step 916, the tiling unit 575 causes the z-cull unit 620 to fetch into the z-cull memory 625 a partial representation for a current cache tile. In step 916, the tiling unit 575 transmits primitives in the set of primitives that overlap the current cache tile to a screen-space pipeline 354. In step 918, the tiling unit 575 causes a z-cull unit 620 to process the current cache tile with the partial representation. In step 920, the tiling unit 575 determines whether there are more cache tiles to process. If there are more cache tiles, then the method returns to step 914. If there are not more cache tiles, then the method proceeds to step 922. In step 922, the tiling unit 575 waits for another flush operation.
In sum, a tiling unit 575 generates cache tile batches and transmits the cache tile batches to a screen-space pipeline 354 for processing in either a full surface z-cull mode or a partial surface z-cull mode. In the partial-surface z-cull mode, the tiling unit 575 causes the z-cull unit 620 to load a partial z-cull representation for individual cache tiles as those cache tiles are processed, and to process the cache tiles with those partial z-cull representations. In the full-surface z-cull mode, the tiling unit 575 causes the z-cull unit 620 to load a full z-cull representation for an entire render surface and to process cache tiles with that full z-cull representation.
One advantage of the disclosed approach is that z-culling can be implemented in a tile-based architecture, which reduces the number of non-visible fragments that are shaded. This reduction increases processing efficiency and reduces power consumption. Another advantage is that the z-cull unit operating in the partial mode is able to obtain the benefit of culling primitives at a finer resolution than in the full mode. This benefit results from the fact that the z-cull unit compares data associated with a smaller portion of a render surface to a group samples in the partial mode than in the full mode. Thus, the z-cull unit is able to discard fragments on a higher resolution basis. Consequently, the z-cull unit is able to prevent more fragments from proceeding to the pixel shader, which reduces the amount of processing cycles and power required for the pixel shader. Yet another advantage is that if the z-cull memory is double buffered, z-cull depth information for a subsequent data may be pre-fetched while a current cache tile is being processed. Pre-fetching data in this manner reduces the amount of latency associated with proceeding from one tile to the next tile, which increases the speed with which the z-cull unit may perform z-cull operations.
One embodiment of the invention may be implemented as a program product for use with a computer system. The program(s) of the program product define functions of the embodiments (including the methods described herein) and can be contained on a variety of computer-readable storage media. Illustrative computer-readable storage media include, but are not limited to: (i) non-writable storage media (e.g., read-only memory devices within a computer such as compact disc read only memory (CD-ROM) disks readable by a CD-ROM drive, flash memory, read only memory (ROM) chips or any type of solid-state non-volatile semiconductor memory) on which information is permanently stored; and (ii) writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive or any type of solid-state random-access semiconductor memory) on which alterable information is stored.
The invention has been described above with reference to specific embodiments. Persons of ordinary skill in the art, however, will understand that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The foregoing description and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Therefore, the scope of embodiments of the present invention is set forth in the claims that follow.

## Claims

1. A tile-based graphics processing pipeline configured for z-culling operations, the graphics processing pipeline comprising:
a screen-space pipeline that includes a z-cull processor configured to perform z-culling operations;
a tiling processor configured to:
determine that a first set of primitives overlaps a first cache tile, transmit the first set of primitives to the screen-space pipeline for processing,
select between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode, wherein, in the partial-surface z-cull mode, the first cache tile is divided into a plurality of sub-cache-tile areas, and
in response to selecting between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode, cause the z-cull processor to process the first set of primitives in the full-surface z-cull mode or to process the first set of primitives in the partial-surface z-cull mode; and

a z-cull memory configured to store first z-cull data in the full-surface z-cull mode and to store second z-cull data in the partial-surface z-cull mode.

2. The graphics processing pipeline of claim 1, wherein the z-cull memory is configured to store the first z-cull data for an entire render surface when the z-cull processor is operating in full-surface z-cull mode.

3. The graphics processing pipeline of claim 1, wherein the z-cull memory is configured to store the second z-cull data for less than the entire render surface when the z-cull processor is operated in partial-surface z-cull mode.

4. The graphics processing pipeline of claim 1, wherein the first z-cull data and second z-cull data include a plurality of z-cull elements, and wherein each z-cull element indicates depth information for a different portion of a render surface.

5. The graphics processing pipeline of claim 4, wherein the z-cull processor is configured to compare a group of fragments with depth information for a z-cull element, wherein each fragment in the group of fragments is associated with a portion of the render surface, wherein the z-cull element is associated with the portion of the render surface, and wherein the depth information for the z-cull element is stored in the z-cull memory.

6. The graphics processing pipeline of claim 4, wherein each z-cull element is associated with a first plurality of samples included in the render surface when the z-cull processor is operating in full-surface z-cull mode.

7. The graphics processing pipeline of claim 6, wherein each z-cull element is associated with a second plurality of samples included in the render surface when the z-cull processor is operating in full-surface z-cull mode, wherein the number of samples included in the second plurality of samples is less than the number of samples included in the first plurality of samples.

8. The graphics processing pipeline of claim 1, wherein, when operating in the partial-surface z-cull mode, the z-cull memory is configured to fetch second z-cull data for a second cache tile upon receiving one or more primitives that intersect the second cache tile.

9. The graphics processing pipeline of claim 8, wherein the z-cull processor is further configured to pre-fetch second z-cull data for the second cache tile while still processing the first cache tile.

10. The graphics processing pipeline of claim 1, wherein the z-cull memory is configured to store second z-cull data for at least two different cache tiles when operating in the partial-surface z-cull mode.

11. The graphics processing pipeline of claim 1, further comprising a memory buffer configured to store the second z-cull data.

12. The graphics processing pipeline of claim 11, wherein the tiling processor is further configured to:
transfer the second z-cull data from the memory buffer to the z-cull memory in the partial-surface z-cull mode.

13. A computing device configured for z-culling operations, the computing device comprising:
a graphics processing pipeline comprising:
a screen-space pipeline that includes a z-cull processor configured to perform z-culling operations;
a tiling processor configured to:
determine that a first set of primitives overlaps a first cache tile,
transmit the first set of primitives to the screen-space pipeline for processing,
select between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode, wherein, in the partial-surface z-cull mode, the first cache tile is divided into a plurality of sub-cache-tile areas, and
in response to selecting between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode, cause the z-cull processor to process the first set of primitives in the full-surface z-cull mode or to process the first set of primitives in the partial-surface z-cull mode; and

a z-cull memory configured to store first z-cull data in the full-surface z-cull mode and to store second z-cull data in the partial-surface z-cull mode.

14. The computing device of claim 13, wherein the z-cull memory is configured to store the first z-cull data for an entire render surface when the z-cull processor is operating in full-surface z-cull mode.

15. The computing device of claim 13, wherein the z-cull memory is configured to store the second z-cull data for less than the entire render surface when the z-cull processor is operated in partial-surface z-cull mode.

16. The computing device of claim 13, wherein, when operating in the partial-surface z-cull mode, the z-cull memory is configured to fetch second z-cull data for a second cache tile upon receiving one or more primitives that intersect the second cache tile.

17. The computing device of claim 13, wherein the z-cull memory is configured to store second z-cull data for at least two different cache tiles when operating in the partial-surface z-cull mode.

18. A computer-implemented method for performing z-culling operations, the method comprising:
determining that a first set of primitives overlaps a first cache tile;
transmitting the first set of primitives to a screen-space pipeline for processing;
selecting between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode, wherein, in the partial-surface z-cull mode, the first cache tile is divided into a plurality of sub-cache-tile areas;
storing first z-cull data in the full-surface z-cull mode;
storing second z-cull data in the partial-surface z-cull mode; and
in response to selecting between processing the first set of primitives in a full-surface z-cull mode or processing the first set of primitives in a partial-surface z-cull mode, processing the first set of primitives in the full-surface z-cull mode or processing the first set of primitives in the partial-surface z-cull mode.

19. The method of claim 18, wherein the z-cull memory is configured to store the first z-cull data for an entire render surface when a z-cull processor is operating in full-surface z-cull mode.

20. The method of claim 19, wherein the z-cull memory is configured to store the second z-cull data for less than the entire render surface when the z-cull processor is operated in partial-surface z-cull mode.

21. The method of claim 18, wherein the z-cull memory is configured to store the second z-cull data for less than the entire render surface when the z-cull processor is operated in partial-surface z-cull mode.