1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
|
/**************************************************************************
*
* Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
* IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
/*
* Binning code for triangles
*/
#include "util/u_math.h"
#include "util/u_memory.h"
#include "util/u_rect.h"
#include "lp_perf.h"
#include "lp_setup_context.h"
#include "lp_setup_coef.h"
#include "lp_rast.h"
#include "lp_state_fs.h"
#define NUM_CHANNELS 4
static INLINE int
subpixel_snap(float a)
{
return util_iround(FIXED_ONE * a);
}
static INLINE float
fixed_to_float(int a)
{
return a * (1.0 / FIXED_ONE);
}
/**
* Alloc space for a new triangle plus the input.a0/dadx/dady arrays
* immediately after it.
* The memory is allocated from the per-scene pool, not per-tile.
* \param tri_size returns number of bytes allocated
* \param nr_inputs number of fragment shader inputs
* \return pointer to triangle space
*/
struct lp_rast_triangle *
lp_setup_alloc_triangle(struct lp_scene *scene,
unsigned nr_inputs,
unsigned nr_planes,
unsigned *tri_size)
{
unsigned input_array_sz = NUM_CHANNELS * (nr_inputs + 1) * sizeof(float);
struct lp_rast_triangle *tri;
unsigned tri_bytes, bytes;
char *inputs;
tri_bytes = align(Offset(struct lp_rast_triangle, plane[nr_planes]), 16);
bytes = tri_bytes + (3 * input_array_sz);
tri = lp_scene_alloc_aligned( scene, bytes, 16 );
if (tri) {
inputs = ((char *)tri) + tri_bytes;
tri->inputs.a0 = (float (*)[4]) inputs;
tri->inputs.dadx = (float (*)[4]) (inputs + input_array_sz);
tri->inputs.dady = (float (*)[4]) (inputs + 2 * input_array_sz);
*tri_size = bytes;
}
return tri;
}
void
lp_setup_print_vertex(struct lp_setup_context *setup,
const char *name,
const float (*v)[4])
{
int i, j;
debug_printf(" wpos (%s[0]) xyzw %f %f %f %f\n",
name,
v[0][0], v[0][1], v[0][2], v[0][3]);
for (i = 0; i < setup->fs.nr_inputs; i++) {
const float *in = v[setup->fs.input[i].src_index];
debug_printf(" in[%d] (%s[%d]) %s%s%s%s ",
i,
name, setup->fs.input[i].src_index,
(setup->fs.input[i].usage_mask & 0x1) ? "x" : " ",
(setup->fs.input[i].usage_mask & 0x2) ? "y" : " ",
(setup->fs.input[i].usage_mask & 0x4) ? "z" : " ",
(setup->fs.input[i].usage_mask & 0x8) ? "w" : " ");
for (j = 0; j < 4; j++)
if (setup->fs.input[i].usage_mask & (1<<j))
debug_printf("%.5f ", in[j]);
debug_printf("\n");
}
}
/**
* Print triangle vertex attribs (for debug).
*/
void
lp_setup_print_triangle(struct lp_setup_context *setup,
const float (*v0)[4],
const float (*v1)[4],
const float (*v2)[4])
{
debug_printf("triangle\n");
{
const float ex = v0[0][0] - v2[0][0];
const float ey = v0[0][1] - v2[0][1];
const float fx = v1[0][0] - v2[0][0];
const float fy = v1[0][1] - v2[0][1];
/* det = cross(e,f).z */
const float det = ex * fy - ey * fx;
if (det < 0.0f)
debug_printf(" - ccw\n");
else if (det > 0.0f)
debug_printf(" - cw\n");
else
debug_printf(" - zero area\n");
}
lp_setup_print_vertex(setup, "v0", v0);
lp_setup_print_vertex(setup, "v1", v1);
lp_setup_print_vertex(setup, "v2", v2);
}
static unsigned
lp_rast_tri_tab[9] = {
0, /* should be impossible */
LP_RAST_OP_TRIANGLE_1,
LP_RAST_OP_TRIANGLE_2,
LP_RAST_OP_TRIANGLE_3,
LP_RAST_OP_TRIANGLE_4,
LP_RAST_OP_TRIANGLE_5,
LP_RAST_OP_TRIANGLE_6,
LP_RAST_OP_TRIANGLE_7,
LP_RAST_OP_TRIANGLE_8
};
/**
* The primitive covers the whole tile- shade whole tile.
*
* \param tx, ty the tile position in tiles, not pixels
*/
static boolean
lp_setup_whole_tile(struct lp_setup_context *setup,
const struct lp_rast_shader_inputs *inputs,
int tx, int ty)
{
struct lp_scene *scene = setup->scene;
LP_COUNT(nr_fully_covered_64);
/* if variant is opaque and scissor doesn't effect the tile */
if (inputs->opaque) {
if (!scene->fb.zsbuf) {
/*
* All previous rendering will be overwritten so reset the bin.
*/
lp_scene_bin_reset( scene, tx, ty );
}
LP_COUNT(nr_shade_opaque_64);
return lp_scene_bin_command( scene, tx, ty,
LP_RAST_OP_SHADE_TILE_OPAQUE,
lp_rast_arg_inputs(inputs) );
} else {
LP_COUNT(nr_shade_64);
return lp_scene_bin_command( scene, tx, ty,
LP_RAST_OP_SHADE_TILE,
lp_rast_arg_inputs(inputs) );
}
}
/**
* Do basic setup for triangle rasterization and determine which
* framebuffer tiles are touched. Put the triangle in the scene's
* bins for the tiles which we overlap.
*/
static boolean
do_triangle_ccw(struct lp_setup_context *setup,
const float (*v0)[4],
const float (*v1)[4],
const float (*v2)[4],
boolean frontfacing )
{
struct lp_scene *scene = setup->scene;
struct lp_rast_triangle *tri;
int x[3];
int y[3];
int area;
struct u_rect bbox;
unsigned tri_bytes;
int i;
int nr_planes = 3;
if (0)
lp_setup_print_triangle(setup, v0, v1, v2);
if (setup->scissor_test) {
nr_planes = 7;
}
else {
nr_planes = 3;
}
/* x/y positions in fixed point */
x[0] = subpixel_snap(v0[0][0] - setup->pixel_offset);
x[1] = subpixel_snap(v1[0][0] - setup->pixel_offset);
x[2] = subpixel_snap(v2[0][0] - setup->pixel_offset);
y[0] = subpixel_snap(v0[0][1] - setup->pixel_offset);
y[1] = subpixel_snap(v1[0][1] - setup->pixel_offset);
y[2] = subpixel_snap(v2[0][1] - setup->pixel_offset);
/* Bounding rectangle (in pixels) */
{
/* Yes this is necessary to accurately calculate bounding boxes
* with the two fill-conventions we support. GL (normally) ends
* up needing a bottom-left fill convention, which requires
* slightly different rounding.
*/
int adj = (setup->pixel_offset != 0) ? 1 : 0;
bbox.x0 = (MIN3(x[0], x[1], x[2]) + (FIXED_ONE-1)) >> FIXED_ORDER;
bbox.x1 = (MAX3(x[0], x[1], x[2]) + (FIXED_ONE-1)) >> FIXED_ORDER;
bbox.y0 = (MIN3(y[0], y[1], y[2]) + (FIXED_ONE-1) + adj) >> FIXED_ORDER;
bbox.y1 = (MAX3(y[0], y[1], y[2]) + (FIXED_ONE-1) + adj) >> FIXED_ORDER;
/* Inclusive coordinates:
*/
bbox.x1--;
bbox.y1--;
}
if (bbox.x1 < bbox.x0 ||
bbox.y1 < bbox.y0) {
if (0) debug_printf("empty bounding box\n");
LP_COUNT(nr_culled_tris);
return TRUE;
}
if (!u_rect_test_intersection(&setup->draw_region, &bbox)) {
if (0) debug_printf("offscreen\n");
LP_COUNT(nr_culled_tris);
return TRUE;
}
u_rect_find_intersection(&setup->draw_region, &bbox);
tri = lp_setup_alloc_triangle(scene,
setup->fs.nr_inputs,
nr_planes,
&tri_bytes);
if (!tri)
return FALSE;
#ifdef DEBUG
tri->v[0][0] = v0[0][0];
tri->v[1][0] = v1[0][0];
tri->v[2][0] = v2[0][0];
tri->v[0][1] = v0[0][1];
tri->v[1][1] = v1[0][1];
tri->v[2][1] = v2[0][1];
#endif
tri->plane[0].dcdy = x[0] - x[1];
tri->plane[1].dcdy = x[1] - x[2];
tri->plane[2].dcdy = x[2] - x[0];
tri->plane[0].dcdx = y[0] - y[1];
tri->plane[1].dcdx = y[1] - y[2];
tri->plane[2].dcdx = y[2] - y[0];
area = (tri->plane[0].dcdy * tri->plane[2].dcdx -
tri->plane[2].dcdy * tri->plane[0].dcdx);
LP_COUNT(nr_tris);
/* Cull non-ccw and zero-sized triangles.
*
* XXX: subject to overflow??
*/
if (area <= 0) {
lp_scene_putback_data( scene, tri_bytes );
LP_COUNT(nr_culled_tris);
return TRUE;
}
/* Setup parameter interpolants:
*/
lp_setup_tri_coef( setup, &tri->inputs, v0, v1, v2, frontfacing );
tri->inputs.facing = frontfacing ? 1.0F : -1.0F;
tri->inputs.disable = FALSE;
tri->inputs.opaque = setup->fs.current.variant->opaque;
tri->inputs.state = setup->fs.stored;
for (i = 0; i < 3; i++) {
struct lp_rast_plane *plane = &tri->plane[i];
/* half-edge constants, will be interated over the whole render
* target.
*/
plane->c = plane->dcdx * x[i] - plane->dcdy * y[i];
/* correct for top-left vs. bottom-left fill convention.
*
* note that we're overloading gl_rasterization_rules to mean
* both (0.5,0.5) pixel centers *and* bottom-left filling
* convention.
*
* GL actually has a top-left filling convention, but GL's
* notion of "top" differs from gallium's...
*
* Also, sometimes (in FBO cases) GL will render upside down
* to its usual method, in which case it will probably want
* to use the opposite, top-left convention.
*/
if (plane->dcdx < 0) {
/* both fill conventions want this - adjust for left edges */
plane->c++;
}
else if (plane->dcdx == 0) {
if (setup->pixel_offset == 0) {
/* correct for top-left fill convention:
*/
if (plane->dcdy > 0) plane->c++;
}
else {
/* correct for bottom-left fill convention:
*/
if (plane->dcdy < 0) plane->c++;
}
}
plane->dcdx *= FIXED_ONE;
plane->dcdy *= FIXED_ONE;
/* find trivial reject offsets for each edge for a single-pixel
* sized block. These will be scaled up at each recursive level to
* match the active blocksize. Scaling in this way works best if
* the blocks are square.
*/
plane->eo = 0;
if (plane->dcdx < 0) plane->eo -= plane->dcdx;
if (plane->dcdy > 0) plane->eo += plane->dcdy;
/* Calculate trivial accept offsets from the above.
*/
plane->ei = plane->dcdy - plane->dcdx - plane->eo;
}
/*
* When rasterizing scissored tris, use the intersection of the
* triangle bounding box and the scissor rect to generate the
* scissor planes.
*
* This permits us to cut off the triangle "tails" that are present
* in the intermediate recursive levels caused when two of the
* triangles edges don't diverge quickly enough to trivially reject
* exterior blocks from the triangle.
*
* It's not really clear if it's worth worrying about these tails,
* but since we generate the planes for each scissored tri, it's
* free to trim them in this case.
*
* Note that otherwise, the scissor planes only vary in 'C' value,
* and even then only on state-changes. Could alternatively store
* these planes elsewhere.
*/
if (nr_planes == 7) {
tri->plane[3].dcdx = -1;
tri->plane[3].dcdy = 0;
tri->plane[3].c = 1-bbox.x0;
tri->plane[3].ei = 0;
tri->plane[3].eo = 1;
tri->plane[4].dcdx = 1;
tri->plane[4].dcdy = 0;
tri->plane[4].c = bbox.x1+1;
tri->plane[4].ei = -1;
tri->plane[4].eo = 0;
tri->plane[5].dcdx = 0;
tri->plane[5].dcdy = 1;
tri->plane[5].c = 1-bbox.y0;
tri->plane[5].ei = 0;
tri->plane[5].eo = 1;
tri->plane[6].dcdx = 0;
tri->plane[6].dcdy = -1;
tri->plane[6].c = bbox.y1+1;
tri->plane[6].ei = -1;
tri->plane[6].eo = 0;
}
return lp_setup_bin_triangle( setup, tri, &bbox, nr_planes );
}
/*
* __fls: find last set bit in word
* @word: The word to search
*
* Undefined if no zero exists, so code should check against ~0UL first.
*/
#if defined(PIPE_ARCH_X86)
static inline unsigned fls(unsigned word)
{
asm("bsr %1,%0"
: "=r" (word)
: "rm" (word));
return word;
}
#else
static inline unsigned fls(unsigned n)
{
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
return n - (n >> 1);
}
#endif
boolean
lp_setup_bin_triangle( struct lp_setup_context *setup,
struct lp_rast_triangle *tri,
const struct u_rect *bbox,
int nr_planes )
{
struct lp_scene *scene = setup->scene;
int i;
/* What is the largest power-of-two boundary this triangle crosses:
*/
int dx = 1 << fls((bbox->x0 ^ bbox->x1) |
(bbox->y0 ^ bbox->y1));
/* The largest dimension of the rasterized area of the triangle
* (aligned to a 4x4 grid), rounded up to the next power of two:
*/
int sz = 1 << fls((bbox->x1 - (bbox->x0 & ~3)) |
(bbox->y1 - (bbox->y0 & ~3)));
if (nr_planes == 3) {
if (sz < 16 && dx < 64)
{
int mask = (bbox->x0 & 63 & ~3) | ((bbox->y0 & 63 & ~3) << 8);
/* Triangle is contained in a single 16x16 block:
*/
return lp_scene_bin_command( scene,
bbox->x0/64, bbox->y0/64,
LP_RAST_OP_TRIANGLE_3_16,
lp_rast_arg_triangle(tri, mask) );
}
}
/* Determine which tile(s) intersect the triangle's bounding box
*/
if (dx < TILE_SIZE)
{
int ix0 = bbox->x0 / TILE_SIZE;
int iy0 = bbox->y0 / TILE_SIZE;
assert(iy0 == bbox->y1 / TILE_SIZE &&
ix0 == bbox->x1 / TILE_SIZE);
/* Triangle is contained in a single tile:
*/
return lp_scene_bin_command( scene, ix0, iy0,
lp_rast_tri_tab[nr_planes],
lp_rast_arg_triangle(tri, (1<<nr_planes)-1) );
}
else
{
int c[7];
int ei[7];
int eo[7];
int xstep[7];
int ystep[7];
int x, y;
int ix0 = bbox->x0 / TILE_SIZE;
int iy0 = bbox->y0 / TILE_SIZE;
int ix1 = bbox->x1 / TILE_SIZE;
int iy1 = bbox->y1 / TILE_SIZE;
for (i = 0; i < nr_planes; i++) {
c[i] = (tri->plane[i].c +
tri->plane[i].dcdy * iy0 * TILE_SIZE -
tri->plane[i].dcdx * ix0 * TILE_SIZE);
ei[i] = tri->plane[i].ei << TILE_ORDER;
eo[i] = tri->plane[i].eo << TILE_ORDER;
xstep[i] = -(tri->plane[i].dcdx << TILE_ORDER);
ystep[i] = tri->plane[i].dcdy << TILE_ORDER;
}
/* Test tile-sized blocks against the triangle.
* Discard blocks fully outside the tri. If the block is fully
* contained inside the tri, bin an lp_rast_shade_tile command.
* Else, bin a lp_rast_triangle command.
*/
for (y = iy0; y <= iy1; y++)
{
boolean in = FALSE; /* are we inside the triangle? */
int cx[7];
for (i = 0; i < nr_planes; i++)
cx[i] = c[i];
for (x = ix0; x <= ix1; x++)
{
int out = 0;
int partial = 0;
for (i = 0; i < nr_planes; i++) {
int planeout = cx[i] + eo[i];
int planepartial = cx[i] + ei[i] - 1;
out |= (planeout >> 31);
partial |= (planepartial >> 31) & (1<<i);
}
if (out) {
/* do nothing */
if (in)
break; /* exiting triangle, all done with this row */
LP_COUNT(nr_empty_64);
}
else if (partial) {
/* Not trivially accepted by at least one plane -
* rasterize/shade partial tile
*/
int count = util_bitcount(partial);
in = TRUE;
if (!lp_scene_bin_command( scene, x, y,
lp_rast_tri_tab[count],
lp_rast_arg_triangle(tri, partial) ))
goto fail;
LP_COUNT(nr_partially_covered_64);
}
else {
/* triangle covers the whole tile- shade whole tile */
LP_COUNT(nr_fully_covered_64);
in = TRUE;
if (!lp_setup_whole_tile(setup, &tri->inputs, x, y))
goto fail;
}
/* Iterate cx values across the region:
*/
for (i = 0; i < nr_planes; i++)
cx[i] += xstep[i];
}
/* Iterate c values down the region:
*/
for (i = 0; i < nr_planes; i++)
c[i] += ystep[i];
}
}
return TRUE;
fail:
/* Need to disable any partially binned triangle. This is easier
* than trying to locate all the triangle, shade-tile, etc,
* commands which may have been binned.
*/
tri->inputs.disable = TRUE;
return FALSE;
}
/**
* Draw triangle if it's CW, cull otherwise.
*/
static void triangle_cw( struct lp_setup_context *setup,
const float (*v0)[4],
const float (*v1)[4],
const float (*v2)[4] )
{
if (!do_triangle_ccw( setup, v1, v0, v2, !setup->ccw_is_frontface ))
{
lp_setup_flush_and_restart(setup);
if (!do_triangle_ccw( setup, v1, v0, v2, !setup->ccw_is_frontface ))
assert(0);
}
}
/**
* Draw triangle if it's CCW, cull otherwise.
*/
static void triangle_ccw( struct lp_setup_context *setup,
const float (*v0)[4],
const float (*v1)[4],
const float (*v2)[4] )
{
if (!do_triangle_ccw( setup, v0, v1, v2, setup->ccw_is_frontface ))
{
lp_setup_flush_and_restart(setup);
if (!do_triangle_ccw( setup, v0, v1, v2, setup->ccw_is_frontface ))
assert(0);
}
}
/**
* Draw triangle whether it's CW or CCW.
*/
static void triangle_both( struct lp_setup_context *setup,
const float (*v0)[4],
const float (*v1)[4],
const float (*v2)[4] )
{
/* edge vectors e = v0 - v2, f = v1 - v2 */
const float ex = v0[0][0] - v2[0][0];
const float ey = v0[0][1] - v2[0][1];
const float fx = v1[0][0] - v2[0][0];
const float fy = v1[0][1] - v2[0][1];
/* det = cross(e,f).z */
const float det = ex * fy - ey * fx;
if (det < 0.0f)
triangle_ccw( setup, v0, v1, v2 );
else if (det > 0.0f)
triangle_cw( setup, v0, v1, v2 );
}
static void triangle_nop( struct lp_setup_context *setup,
const float (*v0)[4],
const float (*v1)[4],
const float (*v2)[4] )
{
}
void
lp_setup_choose_triangle( struct lp_setup_context *setup )
{
switch (setup->cullmode) {
case PIPE_FACE_NONE:
setup->triangle = triangle_both;
break;
case PIPE_FACE_BACK:
setup->triangle = setup->ccw_is_frontface ? triangle_ccw : triangle_cw;
break;
case PIPE_FACE_FRONT:
setup->triangle = setup->ccw_is_frontface ? triangle_cw : triangle_ccw;
break;
default:
setup->triangle = triangle_nop;
break;
}
}
|