diff options
Diffstat (limited to 'src/regress/lib/libc/db/run.test')
-rw-r--r-- | src/regress/lib/libc/db/run.test | 706 |
1 files changed, 706 insertions, 0 deletions
diff --git a/src/regress/lib/libc/db/run.test b/src/regress/lib/libc/db/run.test new file mode 100644 index 0000000000..acbd3f49e1 --- /dev/null +++ b/src/regress/lib/libc/db/run.test | |||
@@ -0,0 +1,706 @@ | |||
1 | #!/bin/sh - | ||
2 | # | ||
3 | # $NetBSD: run.test,v 1.8 1996/05/03 21:57:51 cgd Exp $ | ||
4 | # @(#)run.test 8.10 (Berkeley) 7/26/94 | ||
5 | # | ||
6 | |||
7 | # db regression tests | ||
8 | main() | ||
9 | { | ||
10 | |||
11 | PROG=./dbtest | ||
12 | TMP1=t1 | ||
13 | TMP2=t2 | ||
14 | TMP3=t3 | ||
15 | |||
16 | if [ -f /usr/share/dict/words ]; then | ||
17 | DICT=/usr/share/dict/words | ||
18 | elif [ -f /usr/dict/words ]; then | ||
19 | DICT=/usr/dict/words | ||
20 | else | ||
21 | echo 'run.test: no dictionary' | ||
22 | exit 1 | ||
23 | fi | ||
24 | |||
25 | if [ $# -eq 0 ]; then | ||
26 | for t in 1 2 3 4 5 6 7 8 9 10 11 12 13 20; do | ||
27 | test$t | ||
28 | done | ||
29 | else | ||
30 | while [ $# -gt 0 ] | ||
31 | do case "$1" in | ||
32 | test*) | ||
33 | $1;; | ||
34 | [0-9]*) | ||
35 | test$1;; | ||
36 | btree) | ||
37 | for t in 1 2 3 7 8 9 10 12 13; do | ||
38 | test$t | ||
39 | done;; | ||
40 | hash) | ||
41 | for t in 1 2 3 8 13 20; do | ||
42 | test$t | ||
43 | done;; | ||
44 | recno) | ||
45 | for t in 1 2 3 4 5 6 7 10 11; do | ||
46 | test$t | ||
47 | done;; | ||
48 | *) | ||
49 | echo "run.test: unknown test $1" | ||
50 | echo "usage: run.test test# | type" | ||
51 | exit 1 | ||
52 | esac | ||
53 | shift | ||
54 | done | ||
55 | fi | ||
56 | rm -f $TMP1 $TMP2 $TMP3 | ||
57 | exit 0 | ||
58 | } | ||
59 | |||
60 | # Take the first hundred entries in the dictionary, and make them | ||
61 | # be key/data pairs. | ||
62 | test1() | ||
63 | { | ||
64 | echo "Test 1: btree, hash: small key, small data pairs" | ||
65 | sed 200q $DICT > $TMP1 | ||
66 | for type in btree hash; do | ||
67 | rm -f $TMP2 $TMP3 | ||
68 | for i in `sed 200q $DICT`; do | ||
69 | echo p | ||
70 | echo k$i | ||
71 | echo d$i | ||
72 | echo g | ||
73 | echo k$i | ||
74 | done > $TMP2 | ||
75 | $PROG -o $TMP3 $type $TMP2 | ||
76 | if (cmp -s $TMP1 $TMP3) ; then : | ||
77 | else | ||
78 | echo "test1: type $type: failed" | ||
79 | exit 1 | ||
80 | fi | ||
81 | done | ||
82 | echo "Test 1: recno: small key, small data pairs" | ||
83 | rm -f $TMP2 $TMP3 | ||
84 | sed 200q $DICT | | ||
85 | awk '{ | ||
86 | ++i; | ||
87 | printf("p\nk%d\nd%s\ng\nk%d\n", i, $0, i); | ||
88 | }' > $TMP2 | ||
89 | $PROG -o $TMP3 recno $TMP2 | ||
90 | if (cmp -s $TMP1 $TMP3) ; then : | ||
91 | else | ||
92 | echo "test1: type recno: failed" | ||
93 | exit 1 | ||
94 | fi | ||
95 | } | ||
96 | |||
97 | # Take the first 200 entries in the dictionary, and give them | ||
98 | # each a medium size data entry. | ||
99 | test2() | ||
100 | { | ||
101 | echo "Test 2: btree, hash: small key, medium data pairs" | ||
102 | mdata=abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz | ||
103 | echo $mdata | | ||
104 | awk '{ for (i = 1; i < 201; ++i) print $0 }' > $TMP1 | ||
105 | for type in hash btree; do | ||
106 | rm -f $TMP2 $TMP3 | ||
107 | for i in `sed 200q $DICT`; do | ||
108 | echo p | ||
109 | echo k$i | ||
110 | echo d$mdata | ||
111 | echo g | ||
112 | echo k$i | ||
113 | done > $TMP2 | ||
114 | $PROG -o $TMP3 $type $TMP2 | ||
115 | if (cmp -s $TMP1 $TMP3) ; then : | ||
116 | else | ||
117 | echo "test2: type $type: failed" | ||
118 | exit 1 | ||
119 | fi | ||
120 | done | ||
121 | echo "Test 2: recno: small key, medium data pairs" | ||
122 | rm -f $TMP2 $TMP3 | ||
123 | echo $mdata | | ||
124 | awk '{ for (i = 1; i < 201; ++i) | ||
125 | printf("p\nk%d\nd%s\ng\nk%d\n", i, $0, i); | ||
126 | }' > $TMP2 | ||
127 | $PROG -o $TMP3 recno $TMP2 | ||
128 | if (cmp -s $TMP1 $TMP3) ; then : | ||
129 | else | ||
130 | echo "test2: type recno: failed" | ||
131 | exit 1 | ||
132 | fi | ||
133 | } | ||
134 | |||
135 | # Insert the programs in /bin with their paths as their keys. | ||
136 | test3() | ||
137 | { | ||
138 | echo "Test 3: hash: small key, big data pairs" | ||
139 | rm -f $TMP1 | ||
140 | (find /bin -type f -print | xargs cat) > $TMP1 | ||
141 | for type in hash; do | ||
142 | rm -f $TMP2 $TMP3 | ||
143 | for i in `find /bin -type f -print`; do | ||
144 | echo p | ||
145 | echo k$i | ||
146 | echo D$i | ||
147 | echo g | ||
148 | echo k$i | ||
149 | done > $TMP2 | ||
150 | $PROG -o $TMP3 $type $TMP2 | ||
151 | if (cmp -s $TMP1 $TMP3) ; then : | ||
152 | else | ||
153 | echo "test3: $type: failed" | ||
154 | exit 1 | ||
155 | fi | ||
156 | done | ||
157 | echo "Test 3: btree: small key, big data pairs" | ||
158 | for psize in 512 16384 65536; do | ||
159 | echo " page size $psize" | ||
160 | for type in btree; do | ||
161 | rm -f $TMP2 $TMP3 | ||
162 | for i in `find /bin -type f -print`; do | ||
163 | echo p | ||
164 | echo k$i | ||
165 | echo D$i | ||
166 | echo g | ||
167 | echo k$i | ||
168 | done > $TMP2 | ||
169 | $PROG -i psize=$psize -o $TMP3 $type $TMP2 | ||
170 | if (cmp -s $TMP1 $TMP3) ; then : | ||
171 | else | ||
172 | echo "test3: $type: page size $psize: failed" | ||
173 | exit 1 | ||
174 | fi | ||
175 | done | ||
176 | done | ||
177 | echo "Test 3: recno: big data pairs" | ||
178 | rm -f $TMP2 $TMP3 | ||
179 | find /bin -type f -print | | ||
180 | awk '{ | ||
181 | ++i; | ||
182 | printf("p\nk%d\nD%s\ng\nk%d\n", i, $0, i); | ||
183 | }' > $TMP2 | ||
184 | for psize in 512 16384 65536; do | ||
185 | echo " page size $psize" | ||
186 | $PROG -i psize=$psize -o $TMP3 recno $TMP2 | ||
187 | if (cmp -s $TMP1 $TMP3) ; then : | ||
188 | else | ||
189 | echo "test3: recno: page size $psize: failed" | ||
190 | exit 1 | ||
191 | fi | ||
192 | done | ||
193 | } | ||
194 | |||
195 | # Do random recno entries. | ||
196 | test4() | ||
197 | { | ||
198 | echo "Test 4: recno: random entries" | ||
199 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
200 | awk '{ | ||
201 | for (i = 37; i <= 37 + 88 * 17; i += 17) { | ||
202 | if (i % 41) | ||
203 | s = substr($0, 1, i % 41); | ||
204 | else | ||
205 | s = substr($0, 1); | ||
206 | printf("input key %d: %s\n", i, s); | ||
207 | } | ||
208 | for (i = 1; i <= 15; ++i) { | ||
209 | if (i % 41) | ||
210 | s = substr($0, 1, i % 41); | ||
211 | else | ||
212 | s = substr($0, 1); | ||
213 | printf("input key %d: %s\n", i, s); | ||
214 | } | ||
215 | for (i = 19234; i <= 19234 + 61 * 27; i += 27) { | ||
216 | if (i % 41) | ||
217 | s = substr($0, 1, i % 41); | ||
218 | else | ||
219 | s = substr($0, 1); | ||
220 | printf("input key %d: %s\n", i, s); | ||
221 | } | ||
222 | exit | ||
223 | }' > $TMP1 | ||
224 | rm -f $TMP2 $TMP3 | ||
225 | cat $TMP1 | | ||
226 | awk 'BEGIN { | ||
227 | i = 37; | ||
228 | incr = 17; | ||
229 | } | ||
230 | { | ||
231 | printf("p\nk%d\nd%s\n", i, $0); | ||
232 | if (i == 19234 + 61 * 27) | ||
233 | exit; | ||
234 | if (i == 37 + 88 * 17) { | ||
235 | i = 1; | ||
236 | incr = 1; | ||
237 | } else if (i == 15) { | ||
238 | i = 19234; | ||
239 | incr = 27; | ||
240 | } else | ||
241 | i += incr; | ||
242 | } | ||
243 | END { | ||
244 | for (i = 37; i <= 37 + 88 * 17; i += 17) | ||
245 | printf("g\nk%d\n", i); | ||
246 | for (i = 1; i <= 15; ++i) | ||
247 | printf("g\nk%d\n", i); | ||
248 | for (i = 19234; i <= 19234 + 61 * 27; i += 27) | ||
249 | printf("g\nk%d\n", i); | ||
250 | }' > $TMP2 | ||
251 | $PROG -o $TMP3 recno $TMP2 | ||
252 | if (cmp -s $TMP1 $TMP3) ; then : | ||
253 | else | ||
254 | echo "test4: type recno: failed" | ||
255 | exit 1 | ||
256 | fi | ||
257 | } | ||
258 | |||
259 | # Do reverse order recno entries. | ||
260 | test5() | ||
261 | { | ||
262 | echo "Test 5: recno: reverse order entries" | ||
263 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
264 | awk ' { | ||
265 | for (i = 1500; i; --i) { | ||
266 | if (i % 34) | ||
267 | s = substr($0, 1, i % 34); | ||
268 | else | ||
269 | s = substr($0, 1); | ||
270 | printf("input key %d: %s\n", i, s); | ||
271 | } | ||
272 | exit; | ||
273 | }' > $TMP1 | ||
274 | rm -f $TMP2 $TMP3 | ||
275 | cat $TMP1 | | ||
276 | awk 'BEGIN { | ||
277 | i = 1500; | ||
278 | } | ||
279 | { | ||
280 | printf("p\nk%d\nd%s\n", i, $0); | ||
281 | --i; | ||
282 | } | ||
283 | END { | ||
284 | for (i = 1500; i; --i) | ||
285 | printf("g\nk%d\n", i); | ||
286 | }' > $TMP2 | ||
287 | $PROG -o $TMP3 recno $TMP2 | ||
288 | if (cmp -s $TMP1 $TMP3) ; then : | ||
289 | else | ||
290 | echo "test5: type recno: failed" | ||
291 | exit 1 | ||
292 | fi | ||
293 | } | ||
294 | |||
295 | # Do alternating order recno entries. | ||
296 | test6() | ||
297 | { | ||
298 | echo "Test 6: recno: alternating order entries" | ||
299 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
300 | awk ' { | ||
301 | for (i = 1; i < 1200; i += 2) { | ||
302 | if (i % 34) | ||
303 | s = substr($0, 1, i % 34); | ||
304 | else | ||
305 | s = substr($0, 1); | ||
306 | printf("input key %d: %s\n", i, s); | ||
307 | } | ||
308 | for (i = 2; i < 1200; i += 2) { | ||
309 | if (i % 34) | ||
310 | s = substr($0, 1, i % 34); | ||
311 | else | ||
312 | s = substr($0, 1); | ||
313 | printf("input key %d: %s\n", i, s); | ||
314 | } | ||
315 | exit; | ||
316 | }' > $TMP1 | ||
317 | rm -f $TMP2 $TMP3 | ||
318 | cat $TMP1 | | ||
319 | awk 'BEGIN { | ||
320 | i = 1; | ||
321 | even = 0; | ||
322 | } | ||
323 | { | ||
324 | printf("p\nk%d\nd%s\n", i, $0); | ||
325 | i += 2; | ||
326 | if (i >= 1200) { | ||
327 | if (even == 1) | ||
328 | exit; | ||
329 | even = 1; | ||
330 | i = 2; | ||
331 | } | ||
332 | } | ||
333 | END { | ||
334 | for (i = 1; i < 1200; ++i) | ||
335 | printf("g\nk%d\n", i); | ||
336 | }' > $TMP2 | ||
337 | $PROG -o $TMP3 recno $TMP2 | ||
338 | sort -o $TMP1 $TMP1 | ||
339 | sort -o $TMP3 $TMP3 | ||
340 | if (cmp -s $TMP1 $TMP3) ; then : | ||
341 | else | ||
342 | echo "test6: type recno: failed" | ||
343 | exit 1 | ||
344 | fi | ||
345 | } | ||
346 | |||
347 | # Delete cursor record | ||
348 | test7() | ||
349 | { | ||
350 | echo "Test 7: btree, recno: delete cursor record" | ||
351 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
352 | awk '{ | ||
353 | for (i = 1; i <= 120; ++i) | ||
354 | printf("%05d: input key %d: %s\n", i, i, $0); | ||
355 | printf("%05d: input key %d: %s\n", 120, 120, $0); | ||
356 | printf("seq failed, no such key\n"); | ||
357 | printf("%05d: input key %d: %s\n", 1, 1, $0); | ||
358 | printf("%05d: input key %d: %s\n", 2, 2, $0); | ||
359 | exit; | ||
360 | }' > $TMP1 | ||
361 | rm -f $TMP2 $TMP3 | ||
362 | |||
363 | for type in btree recno; do | ||
364 | cat $TMP1 | | ||
365 | awk '{ | ||
366 | if (i == 120) | ||
367 | exit; | ||
368 | printf("p\nk%d\nd%s\n", ++i, $0); | ||
369 | } | ||
370 | END { | ||
371 | printf("fR_NEXT\n"); | ||
372 | for (i = 1; i <= 120; ++i) | ||
373 | printf("s\n"); | ||
374 | printf("fR_CURSOR\ns\nk120\n"); | ||
375 | printf("r\n"); | ||
376 | printf("fR_NEXT\ns\n"); | ||
377 | printf("fR_CURSOR\ns\nk1\n"); | ||
378 | printf("r\n"); | ||
379 | printf("fR_FIRST\ns\n"); | ||
380 | }' > $TMP2 | ||
381 | $PROG -o $TMP3 recno $TMP2 | ||
382 | if (cmp -s $TMP1 $TMP3) ; then : | ||
383 | else | ||
384 | echo "test7: type $type: failed" | ||
385 | exit 1 | ||
386 | fi | ||
387 | done | ||
388 | } | ||
389 | |||
390 | # Make sure that overflow pages are reused. | ||
391 | test8() | ||
392 | { | ||
393 | echo "Test 8: btree, hash: repeated small key, big data pairs" | ||
394 | rm -f $TMP1 | ||
395 | echo "" | | ||
396 | awk 'BEGIN { | ||
397 | for (i = 1; i <= 10; ++i) { | ||
398 | printf("p\nkkey1\nD/bin/sh\n"); | ||
399 | printf("p\nkkey2\nD/bin/csh\n"); | ||
400 | if (i % 8 == 0) { | ||
401 | printf("c\nkkey2\nD/bin/csh\n"); | ||
402 | printf("c\nkkey1\nD/bin/sh\n"); | ||
403 | printf("e\t%d of 10 (comparison)\n", i); | ||
404 | } else | ||
405 | printf("e\t%d of 10 \n", i); | ||
406 | printf("r\nkkey1\nr\nkkey2\n"); | ||
407 | } | ||
408 | }' > $TMP1 | ||
409 | $PROG btree $TMP1 | ||
410 | # $PROG hash $TMP1 | ||
411 | # No explicit test for success. | ||
412 | } | ||
413 | |||
414 | # Test btree duplicate keys | ||
415 | test9() | ||
416 | { | ||
417 | echo "Test 9: btree: duplicate keys" | ||
418 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
419 | awk '{ | ||
420 | for (i = 1; i <= 543; ++i) | ||
421 | printf("%05d: input key %d: %s\n", i, i, $0); | ||
422 | exit; | ||
423 | }' > $TMP1 | ||
424 | rm -f $TMP2 $TMP3 | ||
425 | |||
426 | for type in btree; do | ||
427 | cat $TMP1 | | ||
428 | awk '{ | ||
429 | if (i++ % 2) | ||
430 | printf("p\nkduplicatekey\nd%s\n", $0); | ||
431 | else | ||
432 | printf("p\nkunique%dkey\nd%s\n", i, $0); | ||
433 | } | ||
434 | END { | ||
435 | printf("o\n"); | ||
436 | }' > $TMP2 | ||
437 | $PROG -iflags=1 -o $TMP3 $type $TMP2 | ||
438 | sort -o $TMP3 $TMP3 | ||
439 | if (cmp -s $TMP1 $TMP3) ; then : | ||
440 | else | ||
441 | echo "test9: type $type: failed" | ||
442 | exit 1 | ||
443 | fi | ||
444 | done | ||
445 | } | ||
446 | |||
447 | # Test use of cursor flags without initialization | ||
448 | test10() | ||
449 | { | ||
450 | echo "Test 10: btree, recno: test cursor flag use" | ||
451 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
452 | awk '{ | ||
453 | for (i = 1; i <= 20; ++i) | ||
454 | printf("%05d: input key %d: %s\n", i, i, $0); | ||
455 | exit; | ||
456 | }' > $TMP1 | ||
457 | rm -f $TMP2 $TMP3 | ||
458 | |||
459 | # Test that R_CURSOR doesn't succeed before cursor initialized | ||
460 | for type in btree recno; do | ||
461 | cat $TMP1 | | ||
462 | awk '{ | ||
463 | if (i == 10) | ||
464 | exit; | ||
465 | printf("p\nk%d\nd%s\n", ++i, $0); | ||
466 | } | ||
467 | END { | ||
468 | printf("fR_CURSOR\nr\n"); | ||
469 | printf("eR_CURSOR SHOULD HAVE FAILED\n"); | ||
470 | }' > $TMP2 | ||
471 | $PROG -o $TMP3 $type $TMP2 > /dev/null 2>&1 | ||
472 | if [ -s $TMP3 ] ; then | ||
473 | echo "Test 10: delete: R_CURSOR SHOULD HAVE FAILED" | ||
474 | exit 1 | ||
475 | fi | ||
476 | done | ||
477 | for type in btree recno; do | ||
478 | cat $TMP1 | | ||
479 | awk '{ | ||
480 | if (i == 10) | ||
481 | exit; | ||
482 | printf("p\nk%d\nd%s\n", ++i, $0); | ||
483 | } | ||
484 | END { | ||
485 | printf("fR_CURSOR\np\nk1\ndsome data\n"); | ||
486 | printf("eR_CURSOR SHOULD HAVE FAILED\n"); | ||
487 | }' > $TMP2 | ||
488 | $PROG -o $TMP3 $type $TMP2 > /dev/null 2>&1 | ||
489 | if [ -s $TMP3 ] ; then | ||
490 | echo "Test 10: put: R_CURSOR SHOULD HAVE FAILED" | ||
491 | exit 1 | ||
492 | fi | ||
493 | done | ||
494 | } | ||
495 | |||
496 | # Test insert in reverse order. | ||
497 | test11() | ||
498 | { | ||
499 | echo "Test 11: recno: reverse order insert" | ||
500 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
501 | awk '{ | ||
502 | for (i = 1; i <= 779; ++i) | ||
503 | printf("%05d: input key %d: %s\n", i, i, $0); | ||
504 | exit; | ||
505 | }' > $TMP1 | ||
506 | rm -f $TMP2 $TMP3 | ||
507 | |||
508 | for type in recno; do | ||
509 | cat $TMP1 | | ||
510 | awk '{ | ||
511 | if (i == 0) { | ||
512 | i = 1; | ||
513 | printf("p\nk1\nd%s\n", $0); | ||
514 | printf("%s\n", "fR_IBEFORE"); | ||
515 | } else | ||
516 | printf("p\nk1\nd%s\n", $0); | ||
517 | } | ||
518 | END { | ||
519 | printf("or\n"); | ||
520 | }' > $TMP2 | ||
521 | $PROG -o $TMP3 $type $TMP2 | ||
522 | if (cmp -s $TMP1 $TMP3) ; then : | ||
523 | else | ||
524 | echo "test11: type $type: failed" | ||
525 | exit 1 | ||
526 | fi | ||
527 | done | ||
528 | } | ||
529 | |||
530 | # Take the first 20000 entries in the dictionary, reverse them, and give | ||
531 | # them each a small size data entry. Use a small page size to make sure | ||
532 | # the btree split code gets hammered. | ||
533 | test12() | ||
534 | { | ||
535 | echo "Test 12: btree: lots of keys, small page size" | ||
536 | mdata=abcdefghijklmnopqrstuvwxy | ||
537 | echo $mdata | | ||
538 | awk '{ for (i = 1; i < 20001; ++i) print $0 }' > $TMP1 | ||
539 | for type in btree; do | ||
540 | rm -f $TMP2 $TMP3 | ||
541 | for i in `sed 20000q $DICT | rev`; do | ||
542 | echo p | ||
543 | echo k$i | ||
544 | echo d$mdata | ||
545 | echo g | ||
546 | echo k$i | ||
547 | done > $TMP2 | ||
548 | $PROG -i psize=512 -o $TMP3 $type $TMP2 | ||
549 | if (cmp -s $TMP1 $TMP3) ; then : | ||
550 | else | ||
551 | echo "test12: type $type: failed" | ||
552 | exit 1 | ||
553 | fi | ||
554 | done | ||
555 | } | ||
556 | |||
557 | # Test different byte orders. | ||
558 | test13() | ||
559 | { | ||
560 | echo "Test 13: btree, hash: differing byte orders" | ||
561 | sed 50q $DICT > $TMP1 | ||
562 | for order in 1234 4321; do | ||
563 | for type in btree hash; do | ||
564 | rm -f byte.file $TMP2 $TMP3 | ||
565 | for i in `sed 50q $DICT`; do | ||
566 | echo p | ||
567 | echo k$i | ||
568 | echo d$i | ||
569 | echo g | ||
570 | echo k$i | ||
571 | done > $TMP2 | ||
572 | $PROG -ilorder=$order -f byte.file -o $TMP3 $type $TMP2 | ||
573 | if (cmp -s $TMP1 $TMP3) ; then : | ||
574 | else | ||
575 | echo "test13: $type/$order put failed" | ||
576 | exit 1 | ||
577 | fi | ||
578 | for i in `sed 50q $DICT`; do | ||
579 | echo g | ||
580 | echo k$i | ||
581 | done > $TMP2 | ||
582 | $PROG -s \ | ||
583 | -ilorder=$order -f byte.file -o $TMP3 $type $TMP2 | ||
584 | if (cmp -s $TMP1 $TMP3) ; then : | ||
585 | else | ||
586 | echo "test13: $type/$order get failed" | ||
587 | exit 1 | ||
588 | fi | ||
589 | done | ||
590 | done | ||
591 | rm -f byte.file | ||
592 | } | ||
593 | |||
594 | # Try a variety of bucketsizes and fill factors for hashing | ||
595 | test20() | ||
596 | { | ||
597 | echo\ | ||
598 | "Test 20: hash: bucketsize, fill factor; nelem 25000 cachesize 65536" | ||
599 | echo "abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | | ||
600 | awk '{ | ||
601 | for (i = 1; i <= 10000; ++i) { | ||
602 | if (i % 34) | ||
603 | s = substr($0, 1, i % 34); | ||
604 | else | ||
605 | s = substr($0, 1); | ||
606 | printf("%s\n", s); | ||
607 | } | ||
608 | exit; | ||
609 | }' > $TMP1 | ||
610 | sed 10000q $DICT | | ||
611 | awk 'BEGIN { | ||
612 | ds="abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg abcdefg" | ||
613 | } | ||
614 | { | ||
615 | if (++i % 34) | ||
616 | s = substr(ds, 1, i % 34); | ||
617 | else | ||
618 | s = substr(ds, 1); | ||
619 | printf("p\nk%s\nd%s\n", $0, s); | ||
620 | }' > $TMP2 | ||
621 | sed 10000q $DICT | | ||
622 | awk '{ | ||
623 | ++i; | ||
624 | printf("g\nk%s\n", $0); | ||
625 | }' >> $TMP2 | ||
626 | bsize=256 | ||
627 | for ffactor in 11 14 21; do | ||
628 | echo " bucketsize $bsize, fill factor $ffactor" | ||
629 | $PROG -o$TMP3 \ | ||
630 | -ibsize=$bsize,ffactor=$ffactor,nelem=25000,cachesize=65536\ | ||
631 | hash $TMP2 | ||
632 | if (cmp -s $TMP1 $TMP3) ; then : | ||
633 | else | ||
634 | echo "test20: type hash:\ | ||
635 | bsize=$bsize ffactor=$ffactor nelem=25000 cachesize=65536 failed" | ||
636 | exit 1 | ||
637 | fi | ||
638 | done | ||
639 | bsize=512 | ||
640 | for ffactor in 21 28 43; do | ||
641 | echo " bucketsize $bsize, fill factor $ffactor" | ||
642 | $PROG -o$TMP3 \ | ||
643 | -ibsize=$bsize,ffactor=$ffactor,nelem=25000,cachesize=65536\ | ||
644 | hash $TMP2 | ||
645 | if (cmp -s $TMP1 $TMP3) ; then : | ||
646 | else | ||
647 | echo "test20: type hash:\ | ||
648 | bsize=$bsize ffactor=$ffactor nelem=25000 cachesize=65536 failed" | ||
649 | exit 1 | ||
650 | fi | ||
651 | done | ||
652 | bsize=1024 | ||
653 | for ffactor in 43 57 85; do | ||
654 | echo " bucketsize $bsize, fill factor $ffactor" | ||
655 | $PROG -o$TMP3 \ | ||
656 | -ibsize=$bsize,ffactor=$ffactor,nelem=25000,cachesize=65536\ | ||
657 | hash $TMP2 | ||
658 | if (cmp -s $TMP1 $TMP3) ; then : | ||
659 | else | ||
660 | echo "test20: type hash:\ | ||
661 | bsize=$bsize ffactor=$ffactor nelem=25000 cachesize=65536 failed" | ||
662 | exit 1 | ||
663 | fi | ||
664 | done | ||
665 | bsize=2048 | ||
666 | for ffactor in 85 114 171; do | ||
667 | echo " bucketsize $bsize, fill factor $ffactor" | ||
668 | $PROG -o$TMP3 \ | ||
669 | -ibsize=$bsize,ffactor=$ffactor,nelem=25000,cachesize=65536\ | ||
670 | hash $TMP2 | ||
671 | if (cmp -s $TMP1 $TMP3) ; then : | ||
672 | else | ||
673 | echo "test20: type hash:\ | ||
674 | bsize=$bsize ffactor=$ffactor nelem=25000 cachesize=65536 failed" | ||
675 | exit 1 | ||
676 | fi | ||
677 | done | ||
678 | bsize=4096 | ||
679 | for ffactor in 171 228 341; do | ||
680 | echo " bucketsize $bsize, fill factor $ffactor" | ||
681 | $PROG -o$TMP3 \ | ||
682 | -ibsize=$bsize,ffactor=$ffactor,nelem=25000,cachesize=65536\ | ||
683 | hash $TMP2 | ||
684 | if (cmp -s $TMP1 $TMP3) ; then : | ||
685 | else | ||
686 | echo "test20: type hash:\ | ||
687 | bsize=$bsize ffactor=$ffactor nelem=25000 cachesize=65536 failed" | ||
688 | exit 1 | ||
689 | fi | ||
690 | done | ||
691 | bsize=8192 | ||
692 | for ffactor in 341 455 683; do | ||
693 | echo " bucketsize $bsize, fill factor $ffactor" | ||
694 | $PROG -o$TMP3 \ | ||
695 | -ibsize=$bsize,ffactor=$ffactor,nelem=25000,cachesize=65536\ | ||
696 | hash $TMP2 | ||
697 | if (cmp -s $TMP1 $TMP3) ; then : | ||
698 | else | ||
699 | echo "test20: type hash:\ | ||
700 | bsize=$bsize ffactor=$ffactor nelem=25000 cachesize=65536 failed" | ||
701 | exit 1 | ||
702 | fi | ||
703 | done | ||
704 | } | ||
705 | |||
706 | main $* | ||