forked from wolfi-dev/os
-
Notifications
You must be signed in to change notification settings - Fork 0
/
remove-linear-interpol-test.patch
279 lines (276 loc) · 7.1 KB
/
remove-linear-interpol-test.patch
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
diff --git a/testbed/testcms.c b/testbed/testcms.c
index 98ec153..1f3f162 100755
--- a/testbed/testcms.c
+++ b/testbed/testcms.c
@@ -329,266 +329,6 @@ int TestReversingOfCurves(void)
// Tables are supposed to be monotonic, but the algorithm works on
// non-monotonic as well.
-static
-int TestLinearInterpolation(int lExhaustive)
-{
- static WORD Tab[4098];
- int j, i, k = 0;
- L16PARAMS p;
- int n;
- clock_t time;
-
- printf("Testing linear interpolation ...");
-
- // First I will check exact values. Since prime factors of 65535 (FFFF) are,
- //
- // 0xFFFF = 1 * 3 * 5 * 17 * 257
- //
- // I test tables of 2, 4, 6, and 18 points, that will be exact.
- // Then, a table of 3 elements are tested. Error must be < 1
- // Since no floating point is involved, This will be a measure of speed.
-
-
- // Perform 10 times, so i can measure average times
-
- time = clock();
- for (j=0; j < 10; j++)
- {
-
- // 2 points - exact
-
- Tab[0] = 0;
- Tab[1] = 0xffffU;
-
- cmsCalcL16Params(2, &p);
-
- for (i=0; i <= 0xffffL; i++)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if (n != i)
- {
- printf("Error in Linear interpolation (2p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
-
- }
-
-
- // 3 points - Here the error must be <= 1, since
- // 2 == (3 - 1) is not a factor of 0xffff
-
- Tab[0] = 0;
- Tab[1] = 0x7FFF;
- Tab[2] = 0xffffU;
-
- cmsCalcL16Params(3, &p);
-
- for (i=0; i <= 0xffffL; i++)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if (abs(n - i) > 1)
- {
- printf("Error in Linear interpolation (3p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
-
- }
-
-
- // 4 points - exact
-
- Tab[0] = 0;
- Tab[1] = 0x5555U;
- Tab[2] = 0xAAAAU;
- Tab[3] = 0xffffU;
-
- cmsCalcL16Params(4, &p);
-
- for (i=0; i <= 0xffffL; i++)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if (n != i) {
- printf("Error in Linear interpolation (4p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
-
- }
-
-
- // 6 - points
-
- Tab[0] = 0;
- Tab[1] = 0x3333U;
- Tab[2] = 0x6666U;
- Tab[3] = 0x9999U;
- Tab[4] = 0xCCCCU;
- Tab[5] = 0xFFFFU;
-
- cmsCalcL16Params(6, &p);
-
- for (i=0; i <= 0xffffL; i++)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if (n != i) {
- printf("Error in Linear interpolation (6p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
-
- }
-
-
- // 18 points
-
- for (i=0; i < 18; i++)
- Tab[i] = (WORD) (0x0f0fU*i);
-
- cmsCalcL16Params(18, &p);
-
- for (i=0; i <= 0xffffL; i++)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if (n != i) {
- printf("Error in Linear interpolation (18p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
- }
- }
-
-
-
- printf("pass. (%d tics)\n", (int) (clock() - time));
-
- // Now test descending tables
- printf("Testing descending tables (linear interpolation)...");
-
- // 2 points - exact
-
- Tab[1] = 0;
- Tab[0] = 0xffffU;
-
- cmsCalcL16Params(2, &p);
-
- for (i=0xffffL; i > 0; --i)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if ((0xffffL - n) != i) {
-
- printf("Error in Linear interpolation (descending) (2p): Must be i=%x, But is n=%x\n", i, 0xffff - n);
- return 0;
- }
- }
-
-
- // 3 points - Here the error must be <= 1, since
- // 2 = (3 - 1) is not a factor of 0xffff
-
- Tab[2] = 0;
- Tab[1] = 0x7FFF;
- Tab[0] = 0xffffU;
-
- cmsCalcL16Params(3, &p);
-
- for (i=0xffffL; i > 0; --i)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if (abs((0xffffL - n) - i) > 1) {
-
- printf("Error in Linear interpolation (descending) (3p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
- }
-
-
- // 4 points - exact
-
- Tab[3] = 0;
- Tab[2] = 0x5555U;
- Tab[1] = 0xAAAAU;
- Tab[0] = 0xffffU;
-
- cmsCalcL16Params(4, &p);
-
- for (i=0xffffL; i > 0; --i)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if ((0xffffL - n) != i) {
-
- printf("Error in Linear interpolation (descending) (4p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
- }
-
-
- // 6 - points
-
- Tab[5] = 0;
- Tab[4] = 0x3333U;
- Tab[3] = 0x6666U;
- Tab[2] = 0x9999U;
- Tab[1] = 0xCCCCU;
- Tab[0] = 0xFFFFU;
-
- cmsCalcL16Params(6, &p);
-
- for (i=0xffffL; i > 0; --i)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if ((0xffffL - n) != i) {
- printf("Error in Linear interpolation (descending) (6p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
-
- }
-
-
- // 18 points
-
- for (i=0; i < 18; i++)
- Tab[17-i] = (WORD) (0x0f0fU*i);
-
- cmsCalcL16Params(18, &p);
-
- for (i=0xffffL; i > 0; --i)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if ((0xffffL - n) != i) {
-
- printf("Error in Linear interpolation (descending) (18p): Must be i=%x, But is n=%x\n", i, n);
- return 0;
- }
- }
-
- printf("pass.\n");
-
- if (!lExhaustive) return 1;
-
- printf("Now, testing interpolation errors for tables of n elements ...\n");
-
- for (j=10; j < 4096; j ++)
- {
- if ((j % 10) == 0) printf("%d\r", j);
-
- for (i=0; i <= j; i++)
- {
- Tab[i] = (WORD) floor((((double) i / ((double) j-1)) * 65535.0) + .5);
- }
-
- k =0;
- cmsCalcL16Params(j, &p);
- for (i=0; i <= 0xffffL; i++)
- {
- n = cmsLinearInterpLUT16((WORD) i, Tab, &p);
- if (n != i) k++;
-
- }
-
- }
- printf("\n%d: %d errors\n\n", j, k);
- return 1;
-}
-
-
-
static
int IsGood(const char *frm, WORD in, WORD out)
{
@@ -2318,7 +2058,6 @@ int main(int argc, char *argv[])
if (!TestFixedScaling()) return 1;
if (!TestJointCurves()) return 1;
if (!TestReversingOfCurves()) return 1;
- if (!TestLinearInterpolation(lExhaustive)) return 1;
if (!TestReverseLinearInterpolation()) return 1;