1 /**************************************************************************
3 * Copyright 2007-2009 VMware, Inc.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **************************************************************************/
29 * Rasterization for binned triangles within a tile
33 #include "util/u_math.h"
36 #include "lp_rast_priv.h"
37 #include "lp_tile_soa.h"
41 * Map an index in [0,15] to an x,y position, multiplied by 4.
42 * This is used to get the position of each subtile in a 4x4
43 * grid of edge step values.
44 * Note: we can use some bit twiddling to compute these values instead
45 * of using a look-up table, but there's no measurable performance
48 static const int pos_table4
[16][2] = {
68 static const int pos_table16
[16][2] = {
89 * Shade all pixels in a 4x4 block.
92 block_full_4( struct lp_rasterizer_task
*rast_task
,
93 const struct lp_rast_triangle
*tri
,
96 lp_rast_shade_quads_all(rast_task
->rast
,
97 rast_task
->thread_index
,
104 * Shade all pixels in a 16x16 block.
107 block_full_16( struct lp_rasterizer_task
*rast_task
,
108 const struct lp_rast_triangle
*tri
,
114 for (iy
= 0; iy
< 16; iy
+= 4)
115 for (ix
= 0; ix
< 16; ix
+= 4)
116 block_full_4(rast_task
, tri
, x
+ ix
, y
+ iy
);
121 * Pass the 4x4 pixel block to the shader function.
122 * Determination of which of the 16 pixels lies inside the triangle
123 * will be done as part of the fragment shader.
126 do_block_4( struct lp_rasterizer_task
*rast_task
,
127 const struct lp_rast_triangle
*tri
,
133 lp_rast_shade_quads(rast_task
->rast
,
134 rast_task
->thread_index
,
142 * Evaluate a 16x16 block of pixels to determine which 4x4 subblocks are in/out
143 * of the triangle's bounds.
146 do_block_16( struct lp_rasterizer_task
*rast_task
,
147 const struct lp_rast_triangle
*tri
,
161 eo
[0] = tri
->eo1
* 4;
162 eo
[1] = tri
->eo2
* 4;
163 eo
[2] = tri
->eo3
* 4;
169 for (j
= 0; j
< 3; j
++) {
170 const int *step
= tri
->inputs
.step
[j
];
171 const int cx
= c
[j
] + eo
[j
];
173 /* Mask has bits set whenever we are outside any of the edges.
175 for (i
= 0; i
< 16; i
++) {
176 int out
= cx
+ step
[i
] * 4;
177 mask
|= (out
>> 31) & (1 << i
);
181 mask
= ~mask
& 0xffff;
183 int i
= ffs(mask
) - 1;
184 int px
= x
+ pos_table4
[i
][0];
185 int py
= y
+ pos_table4
[i
][1];
186 int cx1
= c0
+ tri
->inputs
.step
[0][i
] * 4;
187 int cx2
= c1
+ tri
->inputs
.step
[1][i
] * 4;
188 int cx3
= c2
+ tri
->inputs
.step
[2][i
] * 4;
192 /* Don't bother testing if the 4x4 block is entirely in/out of
193 * the triangle. It's a little faster to do it in the jit code.
195 LP_COUNT(nr_non_empty_4
);
196 do_block_4(rast_task
, tri
, px
, py
, cx1
, cx2
, cx3
);
202 * Scan the tile in chunks and figure out which pixels to rasterize
206 lp_rast_triangle( struct lp_rasterizer
*rast
,
207 unsigned thread_index
,
208 const union lp_rast_cmd_arg arg
)
210 struct lp_rasterizer_task
*rast_task
= &rast
->tasks
[thread_index
];
211 const struct lp_rast_triangle
*tri
= arg
.triangle
;
213 int x
= rast_task
->x
;
214 int y
= rast_task
->y
;
215 int ei
[3], eo
[3], c
[3];
216 unsigned outmask
, inmask
, partial_mask
;
219 c
[0] = tri
->c1
+ tri
->dx12
* y
- tri
->dy12
* x
;
220 c
[1] = tri
->c2
+ tri
->dx23
* y
- tri
->dy23
* x
;
221 c
[2] = tri
->c3
+ tri
->dx31
* y
- tri
->dy31
* x
;
223 eo
[0] = tri
->eo1
* 16;
224 eo
[1] = tri
->eo2
* 16;
225 eo
[2] = tri
->eo3
* 16;
227 ei
[0] = tri
->ei1
* 16;
228 ei
[1] = tri
->ei2
* 16;
229 ei
[2] = tri
->ei3
* 16;
234 for (j
= 0; j
< 3; j
++) {
235 const int *step
= tri
->inputs
.step
[j
];
236 const int cox
= c
[j
] + eo
[j
];
237 const int cio
= ei
[j
]- eo
[j
];
239 /* Outmask has bits set whenever we are outside any of the
242 /* Inmask has bits set whenever we are inside all of the edges.
244 for (i
= 0; i
< 16; i
++) {
245 int out
= cox
+ step
[i
] * 16;
247 outmask
|= (out
>> 31) & (1 << i
);
248 inmask
&= ~((in
>> 31) & (1 << i
));
252 assert((outmask
& inmask
) == 0);
254 if (outmask
== 0xffff)
257 /* Invert mask, so that bits are set whenever we are at least
258 * partially inside all of the edges:
260 partial_mask
= ~inmask
& ~outmask
& 0xffff;
262 /* Iterate over partials:
264 while (partial_mask
) {
265 int i
= ffs(partial_mask
) - 1;
266 int px
= x
+ pos_table16
[i
][0];
267 int py
= y
+ pos_table16
[i
][1];
268 int cx1
= c
[0] + tri
->inputs
.step
[0][i
] * 16;
269 int cx2
= c
[1] + tri
->inputs
.step
[1][i
] * 16;
270 int cx3
= c
[2] + tri
->inputs
.step
[2][i
] * 16;
272 partial_mask
&= ~(1 << i
);
274 LP_COUNT(nr_partially_covered_16
);
275 do_block_16(rast_task
, tri
, px
, py
, cx1
, cx2
, cx3
);
278 /* Iterate over fulls:
281 int i
= ffs(inmask
) - 1;
282 int px
= x
+ pos_table16
[i
][0];
283 int py
= y
+ pos_table16
[i
][1];
287 LP_COUNT(nr_fully_covered_16
);
288 block_full_16(rast_task
, tri
, px
, py
);