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
|
/**************************************************************************
*
* Copyright 2007-2009 VMware, Inc.
* 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 VMWARE 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.
*
**************************************************************************/
/*
* Rasterization for binned triangles within a tile
*/
#include <limits.h>
#include "util/u_math.h"
#include "lp_debug.h"
#include "lp_perf.h"
#include "lp_rast_priv.h"
#include "lp_tile_soa.h"
/**
* Map an index in [0,15] to an x,y position, multiplied by 4.
* This is used to get the position of each subtile in a 4x4
* grid of edge step values.
* Note: we can use some bit twiddling to compute these values instead
* of using a look-up table, but there's no measurable performance
* difference.
*/
static const int pos_table4[16][2] = {
{ 0, 0 },
{ 4, 0 },
{ 0, 4 },
{ 4, 4 },
{ 8, 0 },
{ 12, 0 },
{ 8, 4 },
{ 12, 4 },
{ 0, 8 },
{ 4, 8 },
{ 0, 12 },
{ 4, 12 },
{ 8, 8 },
{ 12, 8 },
{ 8, 12 },
{ 12, 12 }
};
static const int pos_table16[16][2] = {
{ 0, 0 },
{ 16, 0 },
{ 0, 16 },
{ 16, 16 },
{ 32, 0 },
{ 48, 0 },
{ 32, 16 },
{ 48, 16 },
{ 0, 32 },
{ 16, 32 },
{ 0, 48 },
{ 16, 48 },
{ 32, 32 },
{ 48, 32 },
{ 32, 48 },
{ 48, 48 }
};
/**
* Shade all pixels in a 4x4 block.
*/
static void
block_full_4(struct lp_rasterizer_task *task,
const struct lp_rast_triangle *tri,
int x, int y)
{
lp_rast_shade_quads_all(task, &tri->inputs, x, y);
}
/**
* Shade all pixels in a 16x16 block.
*/
static void
block_full_16(struct lp_rasterizer_task *task,
const struct lp_rast_triangle *tri,
int x, int y)
{
unsigned ix, iy;
assert(x % 16 == 0);
assert(y % 16 == 0);
for (iy = 0; iy < 16; iy += 4)
for (ix = 0; ix < 16; ix += 4)
block_full_4(task, tri, x + ix, y + iy);
}
#define TAG(x) x##_1
#define NR_PLANES 1
#include "lp_rast_tri_tmp.h"
#define TAG(x) x##_2
#define NR_PLANES 2
#include "lp_rast_tri_tmp.h"
#define TAG(x) x##_3
#define NR_PLANES 3
#include "lp_rast_tri_tmp.h"
#define TAG(x) x##_4
#define NR_PLANES 4
#include "lp_rast_tri_tmp.h"
#define TAG(x) x##_5
#define NR_PLANES 5
#include "lp_rast_tri_tmp.h"
#define TAG(x) x##_6
#define NR_PLANES 6
#include "lp_rast_tri_tmp.h"
#define TAG(x) x##_7
#define NR_PLANES 7
#include "lp_rast_tri_tmp.h"
|
