On Thu, Dec 29, 2011 at 09:10:03AM +0100, Michel Dänzer wrote:
On Don, 2011-12-29 at 10:03 +0800, Yuanhan Liu wrote:
On Wed, Dec 28, 2011 at 12:07:08PM -0800, Eric Anholt wrote:
On Wed, 28 Dec 2011 13:54:43 +0800, Yuanhan Liu
yuanhan@linux.intel.com wrote:
The current code would
On Don, 2011-12-29 at 10:03 +0800, Yuanhan Liu wrote:
On Wed, Dec 28, 2011 at 12:07:08PM -0800, Eric Anholt wrote:
On Wed, 28 Dec 2011 13:54:43 +0800, Yuanhan Liu
yuanhan@linux.intel.com wrote:
The current code would just calculate min/max_index for the first prim
unconditionally,
On Wed, Dec 28, 2011 at 12:07:08PM -0800, Eric Anholt wrote:
On Wed, 28 Dec 2011 13:54:43 +0800, Yuanhan Liu yuanhan@linux.intel.com
wrote:
The current code would just calculate min/max_index for the first prim
unconditionally, which is wrong if nr_prims 1.
This would some cases
The current code would just calculate min/max_index for the first prim
unconditionally, which is wrong if nr_prims 1.
This would some cases like that the index is stored in element array
buffer object and drawing by glMultiDrawEelements. Thus it fixes some
intel oglc primbuff test cases.
