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
|
// BEGIN_COPYRIGHT -*- glean -*-
//
// Copyright (C) 1999 Allen Akin 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, 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 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 ALLEN AKIN 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.
//
// END_COPYRIGHT
// tpointatten.h: Test GL_ARB_point_parameters extension.
// Brian Paul 6 October 2005
#include "tpointatten.h"
#include <cassert>
#include <cmath>
namespace GLEAN {
// Max tested point size
#define MAX_SIZE 24.0
/* Clamp X to [MIN,MAX] */
#define CLAMP( X, MIN, MAX ) ( (X)<(MIN) ? (MIN) : ((X)>(MAX) ? (MAX) : (X)) )
void
PointAttenuationTest::setup(void)
{
glGetFloatv(GL_ALIASED_POINT_SIZE_RANGE, aliasedLimits);
glGetFloatv(GL_SMOOTH_POINT_SIZE_RANGE, smoothLimits);
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
glOrtho(-10.0, 10.0, -10.0, 10.0, -10.0, 10.0);
glMatrixMode(GL_MODELVIEW);
glLoadIdentity();
}
void
PointAttenuationTest::reportFailure(GLfloat initSize,
const GLfloat attenuation[3],
GLfloat min, GLfloat max,
GLfloat eyeZ, GLboolean smooth,
GLfloat expected, GLfloat actual) const
{
env->log << "\tFAILURE:\n";
env->log << "\tExpected size: " << expected << " Actual size: " << actual << "\n";
env->log << "\tSize: " << initSize << "\n";
env->log << "\tMin: " << min << " Max: " << max << "\n";
env->log << "\tAttenuation: " << attenuation[0] << " " << attenuation[1] << " " << attenuation[2] << "\n";
env->log << "\tEye Z: " << eyeZ << "\n";
if (smooth)
env->log << "\tSmooth/antialiased\n";
else
env->log << "\tAliased\n";
}
void
PointAttenuationTest::reportSuccess(int count, GLboolean smooth) const
{
env->log << "PASS: " << count;
if (smooth)
env->log << " aliased combinations tested.\n";
else
env->log << " antialiased combinations tested.\n";
}
// Compute the expected point size given various point state
GLfloat
PointAttenuationTest::expectedSize(GLfloat initSize,
const GLfloat attenuation[3],
GLfloat min, GLfloat max,
GLfloat eyeZ, GLboolean smooth) const
{
const GLfloat dist = fabs(eyeZ);
const GLfloat atten = sqrt(1.0 / (attenuation[0] +
attenuation[1] * dist +
attenuation[2] * dist * dist));
float size = initSize * atten;
size = CLAMP(size, min, max);
if (smooth)
size = CLAMP(size, smoothLimits[0], smoothLimits[1]);
else
size = CLAMP(size, aliasedLimits[0], aliasedLimits[1]);
return size;
}
// measure size of rendered point at yPos (in model coords)
GLfloat
PointAttenuationTest::measureSize(GLfloat yPos) const
{
assert(yPos >= -10.0);
assert(yPos <= 10.0);
float yNdc = (yPos + 10.0) / 20.0; // See glOrtho above
int x = 0;
int y = (int) (yNdc * windowHeight);
int w = windowWidth;
int h = 3;
GLfloat image[3 * windowWidth * 3]; // three rows of RGB values
// Read three row of pixels and add up colors in each row.
// Use the row with the greatest sum. This helps gives us a bit
// of leeway in vertical point positioning.
// Colors should be white or shades of gray if smoothing is enabled.
glReadPixels(x, y - 1, w, h, GL_RGB, GL_FLOAT, image);
float sum[3] = { 0.0, 0.0, 0.0 };
for (int j = 0; j < 3; j++) {
for (int i = 0; i < w; i++) {
int k = j * 3 * w + i * 3;
sum[j] += (image[k+0] + image[k+1] + image[k+2]) / 3.0;
}
}
// find max of the row sums
if (sum[0] >= sum[1] && sum[0] >= sum[2])
return sum[0];
else if (sum[1] >= sum[0] && sum[1] >= sum[2])
return sum[1];
else
return sum[2];
}
bool
PointAttenuationTest::testPointRendering(GLboolean smooth)
{
// epsilon is the allowed size difference in pixels between the
// expected and actual rendering.
const GLfloat epsilon = (smooth ? 1.5 : 1.0) + 0.0;
GLfloat atten[3];
int count = 0;
unsigned testNo, testStride;
// Enable front buffer if you want to see the rendering
glDrawBuffer(GL_FRONT);
glReadBuffer(GL_FRONT);
if (env->options.quick)
testStride = 5; // a prime number
else
testStride = 1;
testNo = 0;
printf("stride %u\n", testStride);
if (smooth) {
glEnable(GL_POINT_SMOOTH);
glEnable(GL_BLEND);
glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);
}
else {
glDisable(GL_POINT_SMOOTH);
glDisable(GL_BLEND);
}
for (int a = 0; a < 3; a++) {
atten[0] = pow(10.0, -a);
for (int b = -2; b < 3; b++) {
atten[1] = (b == -1) ? 0.0 : pow(10.0, -b);
for (int c = -2; c < 3; c++) {
atten[2] = (c == -1) ? 0.0 : pow(10.0, -c);
glPointParameterfvARB(GL_POINT_DISTANCE_ATTENUATION_ARB, atten);
for (float min = 1.0; min < MAX_SIZE; min += 10) {
glPointParameterfARB(GL_POINT_SIZE_MIN_ARB, min);
for (float max = min; max < MAX_SIZE; max += 10) {
glPointParameterfARB(GL_POINT_SIZE_MAX_ARB, max);
for (float size = 1.0; size < MAX_SIZE; size += 8) {
glPointSize(size);
testNo++;
if (testNo % testStride != 0) {
// skip this test
continue;
}
// draw column of points
glClear(GL_COLOR_BUFFER_BIT);
glBegin(GL_POINTS);
for (float z = -6.0; z <= 6.0; z += 1.0) {
glVertex3f(0, z, z);
}
glEnd();
// test the column of points
for (float z = -6.0; z <= 6.0; z += 1.0) {
count++;
float expected
= expectedSize(size, atten, min, max,
z, smooth);
float actual = measureSize(z);
if (fabs(expected - actual) > epsilon) {
reportFailure(size, atten, min, max,
z, smooth,
expected, actual);
return false;
}
else if(0){
printf("pass z=%f exp=%f act=%f\n",
z, expected, actual);
}
}
}
}
}
}
}
}
printf("Tested %u\n", testNo);
reportSuccess(count, smooth);
return true;
}
void
PointAttenuationTest::runOne(BasicResult &r, Window &w)
{
(void) w; // silence warning
r.pass = true;
errorCode = 0;
errorPos = NULL;
setup();
if (r.pass)
r.pass = testPointRendering(GL_FALSE);
if (r.pass)
r.pass = testPointRendering(GL_TRUE);
}
void
PointAttenuationTest::logOne(BasicResult &r)
{
if (r.pass) {
logPassFail(r);
logConcise(r);
}
}
// constructor
PointAttenuationTest::PointAttenuationTest(const char *testName,
const char *filter,
const char *extensions,
const char *description)
: BasicTest(testName, filter, extensions, description)
{
fWidth = windowWidth;
fHeight = windowHeight;
errorCode = GL_NO_ERROR;
errorPos = NULL;
for (int i = 0; i < 2; i++) {
aliasedLimits[i] = 0;
smoothLimits[i] = 0;
}
}
// The test object itself:
PointAttenuationTest pointAttenuationTest("pointAtten", "window, rgb",
"GL_ARB_point_parameters",
"Test point size attenuation with the GL_ARB_point_parameters extension.\n");
} // namespace GLEAN
|