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
|
/*
* Copyright © 2008-2009 Intel Corporation
*
* 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, sublicense,
* 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 NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS 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.
*
* Authors:
* Eric Anholt <eric@anholt.net>
*
*/
#include "piglit-util.h"
#define PAD 5
int piglit_window_mode = GLUT_DOUBLE | GLUT_RGB;
int piglit_width = (64 * 6 + PAD * 9) * 2;
int piglit_height = 400;
int max_size;
static GLfloat colors[][3] = {
{1.0, 1.0, 1.0},
{1.0, 1.0, 0.0},
{1.0, 0.0, 0.0},
{1.0, 0.0, 1.0},
{0.0, 0.0, 1.0},
{0.0, 1.0, 1.0},
{0.0, 1.0, 0.0},
};
#if defined(_MSC_VER)
/**
* Find the first bit set in i and return the index set of that bit.
*/
static int
ffs(int i)
{
int bit;
if (i == 0) {
return 0;
}
for (bit = 1; !(i & 1); bit++) {
i = i >> 1;
}
return bit;
}
#endif
static void
set_face_image(int level, GLenum face, int size, int color)
{
GLfloat *color1 = colors[color];
GLfloat *color2 = colors[(color + 1) % ARRAY_SIZE(colors)];
GLfloat *tex;
int x, y;
tex = malloc(size * size * 3 * sizeof(GLfloat));
/* Set the texture for this face to one corner being color2 and the
* rest color1. If the texture is 1x1, then it's all color1.
*/
for (y = 0; y < size; y++) {
for (x = 0; x < size; x++) {
GLfloat *chosen_color;
if (y >= (size / 2) || x >= (size / 2))
chosen_color = color1;
else
chosen_color = color2;
tex[(y * size + x) * 3 + 0] = chosen_color[0];
tex[(y * size + x) * 3 + 1] = chosen_color[1];
tex[(y * size + x) * 3 + 2] = chosen_color[2];
}
}
glTexImage2D(face, level, GL_RGB, size, size, 0, GL_RGB, GL_FLOAT, tex);
free(tex);
}
/**
* Tests that the mipmap drawn at (x,y)-(x+size,y+size) has the majority color,
* with color+1 in bottom left.
*/
static GLboolean
test_results(int x, int y, int size, int level, int face, GLboolean mipmapped,
int color)
{
GLfloat *color1 = colors[color];
GLfloat *color2 = colors[(color + 1) % ARRAY_SIZE(colors)];
GLboolean pass = GL_TRUE;
int x1 = x + size / 4, x2 = x + size * 3 / 4;
int y1 = y + size / 4, y2 = y + size * 3 / 4;
if (size == 1) {
pass = pass && piglit_probe_pixel_rgb(x1, y1, color1);
} else {
pass = pass && piglit_probe_pixel_rgb(x1, y1, color2);
pass = pass && piglit_probe_pixel_rgb(x2, y1, color1);
pass = pass && piglit_probe_pixel_rgb(x2, y2, color1);
pass = pass && piglit_probe_pixel_rgb(x1, y2, color1);
}
if (!pass) {
int base_size = size * (1 << level);
printf("Cube map failed at size %dx%d, level %d (%dx%d), face %s%s\n",
base_size, base_size, level, size, size,
cube_face_names[face],
mipmapped ? ", mipmapped" : "");
}
return pass;
}
static GLboolean
draw_at_size(int size, int x_offset, int y_offset, GLboolean mipmapped)
{
GLfloat row_y = PAD + y_offset;
int dim, face;
int color = 0, level = 0;
GLuint texname;
GLboolean pass = GL_TRUE;
/* Create the texture. */
glGenTextures(1, &texname);
glBindTexture(GL_TEXTURE_CUBE_MAP_ARB, texname);
/* For each face drawing, we want to only see that face's contents at
* that mipmap level.
*/
if (mipmapped) {
glTexParameteri(GL_TEXTURE_CUBE_MAP_ARB,
GL_TEXTURE_MIN_FILTER,
GL_NEAREST_MIPMAP_NEAREST);
} else {
glTexParameteri(GL_TEXTURE_CUBE_MAP_ARB,
GL_TEXTURE_MIN_FILTER,
GL_NEAREST);
}
glTexParameteri(GL_TEXTURE_CUBE_MAP_ARB,
GL_TEXTURE_MAG_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_CUBE_MAP_ARB,
GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_CUBE_MAP_ARB,
GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);
/* Fill in faces on each level */
for (dim = size; dim > 0; dim /= 2) {
for (face = 0; face < 6; face++) {
set_face_image(level, cube_face_targets[face],
dim, color);
color = (color + 1) % ARRAY_SIZE(colors);
}
if (!mipmapped)
break;
level++;
}
glEnable(GL_TEXTURE_CUBE_MAP_ARB);
color = 0;
level = 0;
for (dim = size; dim > 0; dim /= 2) {
GLfloat row_x = PAD + x_offset;
for (face = 0; face < 6; face++) {
GLfloat base_x = row_x + face * (max_size + PAD);
GLfloat base_y = row_y;
glBegin(GL_QUADS);
glTexCoord3fv(cube_face_texcoords[face][0]);
glVertex2f(base_x, base_y);
glTexCoord3fv(cube_face_texcoords[face][1]);
glVertex2f(base_x + dim, base_y);
glTexCoord3fv(cube_face_texcoords[face][2]);
glVertex2f(base_x + dim, base_y + dim);
glTexCoord3fv(cube_face_texcoords[face][3]);
glVertex2f(base_x, base_y + dim);
glEnd();
if (dim > 2) {
pass = test_results(base_x, base_y,
dim, level, face,
mipmapped,
color) && pass;
}
color = (color + 1) % ARRAY_SIZE(colors);
}
if (!mipmapped)
break;
row_y += dim + PAD;
level++;
}
glDeleteTextures(1, &texname);
return pass;
}
enum piglit_result
piglit_display(void)
{
int dim;
GLboolean pass = GL_TRUE;
int i = 0, y_offset = 0;
int row_dim = 0;
piglit_ortho_projection(piglit_width, piglit_height, GL_FALSE);
/* Clear background to gray */
glClearColor(0.5, 0.5, 0.5, 1.0);
glClear(GL_COLOR_BUFFER_BIT);
/* First, do each size from MAX_SIZExMAX_SIZE to 1x1 as a
* single texture level.
*/
y_offset = 0;
for (dim = max_size; dim > 0; dim /= 2) {
pass = draw_at_size(dim, 0, y_offset, GL_FALSE) && pass;
y_offset += dim + PAD;
}
/* Next, do each size with mipmaps from MAX_SIZExMAX_SIZE
* to 1x1.
*/
y_offset = 0;
for (dim = max_size; dim > 0; dim /= 2) {
int x_offset = (i % 2 == 1) ? 0 : piglit_width / 2;
row_dim = (row_dim < dim) ? dim : row_dim;
pass &= draw_at_size(dim, x_offset, y_offset, GL_TRUE);
if (i % 2 == 0) {
y_offset += row_dim * 2 + (ffs(dim) + 3) * PAD;
row_dim = 0;
}
i++;
}
glutSwapBuffers();
return pass ? PIGLIT_PASS : PIGLIT_FAIL;
}
void
piglit_init(int argc, char **argv)
{
int i;
piglit_require_extension("GL_ARB_texture_cube_map");
max_size = 64;
for (i = 1; i < argc; i++) {
if (strcmp(argv[i], "npot") == 0) {
piglit_require_extension("GL_ARB_texture_non_power_of_two");
max_size = 50;
break;
}
}
}
|