1 /*
2  * Unit tests for "stb.h"
3  */
4 
5 #define _CRT_SECURE_NO_WARNINGS
6 //#include <windows.h>
7 #include <stdio.h>
8 #include <string.h>
9 #include <time.h>
10 #include <assert.h>
11 #include <stdlib.h>
12 
13 #ifdef _WIN32
14 #include <crtdbg.h>
15 #endif
16 
17 //#define STB_FASTMALLOC
18 #ifdef _DEBUG
19 #define STB_MALLOC_WRAPPER_DEBUG
20 #endif
21 #ifndef _M_AMD64
22 #define STB_NPTR
23 #endif
24 #define STB_DEFINE
25 #include "stb.h"
26 
27 //#include "stb_file.h"
28 //#include "stb_pixel32.h"
29 
30 //#define DEBUG_BLOCK
31 #ifdef DEBUG_BLOCK
32 #include <conio.h>
33 #endif
34 
35 #ifdef STB_FASTMALLOC
36 #error "can't use FASTMALLOC with threads"
37 #endif
38 
39 int count;
c(int truth,char * error)40 void c(int truth, char *error)
41 {
42    if (!truth) {
43       fprintf(stderr, "Test failed: %s\n", error);
44       ++count;
45    }
46 }
47 
48 
49 #if 0
50 void show(void)
51 {
52    #ifdef _WIN32
53    SYSTEM_INFO x;
54    GetSystemInfo(&x);
55    printf("%d\n", x.dwPageSize);
56    #endif
57 }
58 #endif
59 
test_classes(void)60 void test_classes(void)
61 {
62    unsigned char size_base[32], size_shift[32];
63    int class_to_pages[256];
64    int class_to_size[256], cl;
65    int lg, size, wasted_pages;
66    int kAlignShift = 3;
67    int kAlignment = 1 << kAlignShift;
68    int kMaxSize = 8 * 4096;
69    int kPageShift = 12;
70    int kPageSize = (1 << kPageShift);
71   int next_class = 1;
72   int alignshift = kAlignShift;
73   int last_lg = -1;
74 
75   for (lg = 0; lg < kAlignShift; lg++) {
76     size_base[lg] = 1;
77     size_shift[lg] = kAlignShift;
78   }
79 
80   for (size = kAlignment; size <= kMaxSize; size += (1 << alignshift)) {
81     int lg = stb_log2_floor(size);
82     if (lg > last_lg) {
83       // Increase alignment every so often.
84       //
85       // Since we double the alignment every time size doubles and
86       // size >= 128, this means that space wasted due to alignment is
87       // at most 16/128 i.e., 12.5%.  Plus we cap the alignment at 256
88       // bytes, so the space wasted as a percentage starts falling for
89       // sizes > 2K.
90       if ((lg >= 7) && (alignshift < 8)) {
91         alignshift++;
92       }
93       size_base[lg] = next_class - ((size-1) >> alignshift);
94       size_shift[lg] = alignshift;
95     }
96 
97     class_to_size[next_class] = size;
98     last_lg = lg;
99 
100     next_class++;
101   }
102 
103   // Initialize the number of pages we should allocate to split into
104   // small objects for a given class.
105   wasted_pages = 0;
106   for (cl = 1; cl < next_class; cl++) {
107     // Allocate enough pages so leftover is less than 1/8 of total.
108     // This bounds wasted space to at most 12.5%.
109     size_t psize = kPageSize;
110     const size_t s = class_to_size[cl];
111     while ((psize % s) > (psize >> 3)) {
112       psize += kPageSize;
113     }
114     class_to_pages[cl] = (int) (psize >> kPageShift);
115     wasted_pages += (int) psize;
116   }
117 
118   printf("TCMalloc can waste as much as %d memory on one-shot allocations\n", wasted_pages);
119 
120 
121   return;
122 }
123 
124 #ifdef STB_STUA
test_script(void)125 void test_script(void)
126 {
127    stua_run_script(
128       "var g = (2+3)*5 + 3*(2+1) + ((7)); \n"
129       "func sprint(x) _print(x) _print(' ') x end;\n"
130       "func foo(y) var q = func(x) sprint(x) end; q end;\n "
131       "var z=foo(5); z(77);\n"
132       "func counter(z) func(x) z=z+1 end end\n"
133       "var q=counter(0), p=counter(5);\n"
134       "sprint(q()) sprint(p()) sprint(q()) sprint(p()) sprint(q()) sprint(p())\n"
135       "var x=2222;\n"
136       "if 1 == 2 then 3333 else 4444 end; => x; sprint(x);\n"
137       "var x1 = sprint(1.5e3);  \n"
138       "var x2 = sprint(.5);  \n"
139       "var x3 = sprint(1.);  \n"
140       "var x4 = sprint(1.e3);  \n"
141       "var x5 = sprint(1e3);  \n"
142       "var x6 = sprint(0.5e3);  \n"
143       "var x7 = sprint(.5e3);  \n"
144       " func sum(x,y) x+y end                                       \n"
145       " func sumfunc(a) sum+{x=a} end                               \n"
146       " var q = sumfunc(3) \n"
147       " var p = sumfunc(20) \n"
148       " var d = sprint(q(5)) - sprint(q(8)) \n"
149       " var e = sprint(p(5)) - sprint(p(8)) \n"
150       " func test3(x)       \n"
151       "    sprint(x)         \n"
152       "    x = x+3          \n"
153       "    sprint(x)         \n"
154       "    x+5              \n"
155       " end                 \n"
156       " var y = test3(4);   \n"
157       " func fib(x)         \n"
158       "    if x < 3 then    \n"
159       "       1             \n"
160       "    else             \n"
161       "      fib(x-1) + fib(x-2); \n"
162       "    end              \n"
163       " end                 \n"
164       "                     \n"
165       " func fib2(x)        \n"
166       "    var a=1          \n"
167       "    var b=1          \n"
168       "    sprint(a)        \n"
169       "    sprint(b)        \n"
170       "    while x > 2 do   \n"
171       "       var c=a+b     \n"
172       "       a=b           \n"
173       "       b=c           \n"
174       "       sprint(b)     \n"
175       "       x=x-1         \n"
176       "    end              \n"
177       "    b                \n"
178       " end                 \n"
179       "                                                             \n"
180       " func assign(z)                                              \n"
181       "    var y = { 'this', 'is', 'a', 'lame', 'day', 'to', 'die'} \n"
182       "    y[3] = z                                                 \n"
183       "    var i = 0                                                \n"
184       "    while y[i] != nil do                                     \n"
185       "       sprint(y[i])                                          \n"
186       "       i = i+1                                               \n"
187       "    end                                                      \n"
188       " end                                                         \n"
189       "                                                             \n"
190       " sprint(fib(12)); \n"
191       " assign(\"good\"); \n"
192       " fib2(20); \n"
193       " sprint('ok'); \n"
194       " sprint(-5); \n"
195       " // final comment with no newline"
196    );
197 }
198 #endif
199 
200 #ifdef STB_THREADS
201 extern void __stdcall Sleep(unsigned long);
202 
thread_1(void * x)203 void * thread_1(void *x)
204 {
205    Sleep(80);
206    printf("thread 1\n"); fflush(stdout);
207    return (void *) 2;
208 }
209 
thread_2(void * y)210 void * thread_2(void *y)
211 {
212    stb_work(thread_1, NULL, y);
213    Sleep(50);
214    printf("thread 2\n"); fflush(stdout);
215    return (void *) 3;
216 }
217 
218 stb_semaphore stest;
219 stb_mutex mutex;
220 volatile int tc1, tc2;
221 
thread_3(void * p)222 void *thread_3(void *p)
223 {
224    stb_mutex_begin(mutex);
225    ++tc1;
226    stb_mutex_end(mutex);
227    stb_sem_waitfor(stest);
228    stb_mutex_begin(mutex);
229    ++tc2;
230    stb_mutex_end(mutex);
231    return NULL;
232 }
233 
test_threads(void)234 void test_threads(void)
235 {
236    volatile int a=0,b=0;
237    //stb_work_numthreads(2);
238    stb_work(thread_2, (void *) &a, (void *) &b);
239    while (a==0 || b==0) {
240       Sleep(10);
241       //printf("a=%d b=%d\n", a, b);
242    }
243    c(a==2 && b == 3, "stb_thread");
244    stb_work_numthreads(4);
245    stest = stb_sem_new(8);
246    mutex = stb_mutex_new();
247    stb_work(thread_3, NULL, NULL);
248    stb_work(thread_3, NULL, NULL);
249    stb_work(thread_3, NULL, NULL);
250    stb_work(thread_3, NULL, NULL);
251    stb_work(thread_3, NULL, NULL);
252    stb_work(thread_3, NULL, NULL);
253    stb_work(thread_3, NULL, NULL);
254    stb_work(thread_3, NULL, NULL);
255    while (tc1 < 4)
256       Sleep(10);
257    c(tc1 == 4, "stb_work 1");
258    stb_sem_release(stest);
259    stb_sem_release(stest);
260    stb_sem_release(stest);
261    stb_sem_release(stest);
262    stb_sem_release(stest);
263    stb_sem_release(stest);
264    stb_sem_release(stest);
265    stb_sem_release(stest);
266    Sleep(40);
267    while (tc1 != 8 || tc2 != 8)
268       Sleep(10);
269    c(tc1 == 8 && tc2 == 8, "stb_work 2");
270    stb_work_numthreads(2);
271    stb_work(thread_3, NULL, NULL);
272    stb_work(thread_3, NULL, NULL);
273    stb_work(thread_3, NULL, NULL);
274    stb_work(thread_3, NULL, NULL);
275    while (tc1 < 10)
276       Sleep(10);
277    c(tc1 == 10, "stb_work 1");
278    stb_sem_release(stest);
279    stb_sem_release(stest);
280    stb_sem_release(stest);
281    stb_sem_release(stest);
282 
283    Sleep(100);
284    stb_sem_delete(stest);
285    stb_mutex_delete(mutex);
286 }
287 #else
test_threads(void)288 void test_threads(void)
289 {
290 }
291 #endif
292 
thread4(void * p)293 void *thread4(void *p)
294 {
295    return NULL;
296 }
297 
298 #ifdef STB_THREADS
299 stb_threadqueue *tq;
300 stb_sync synch;
301 stb_mutex msum;
302 
303 volatile int thread_sum;
304 
consume1(void * p)305 void *consume1(void *p)
306 {
307    volatile int *q = (volatile int *) p;
308    for(;;) {
309       int z;
310       stb_threadq_get_block(tq, &z);
311       stb_mutex_begin(msum);
312       thread_sum += z;
313       *q += z;
314       stb_mutex_end(msum);
315       stb_sync_reach(synch);
316    }
317 }
318 
test_threads2(void)319 void test_threads2(void)
320 {
321    int array[256],i,n=0;
322    volatile int which[4];
323    synch = stb_sync_new();
324    stb_sync_set_target(synch,2);
325    stb_work_reach(thread4, NULL, NULL, synch);
326    stb_sync_reach_and_wait(synch);
327    printf("ok\n");
328 
329    tq = stb_threadq_new(4, 1, TRUE,TRUE);
330    msum = stb_mutex_new();
331    thread_sum = 0;
332    stb_sync_set_target(synch, 65);
333    for (i=0; i < 4; ++i) {
334       which[i] = 0;
335       stb_create_thread(consume1, (int *) &which[i]);
336    }
337    for (i=1; i <= 64; ++i) {
338       array[i] = i;
339       n += i;
340       stb_threadq_add_block(tq, &array[i]);
341    }
342    stb_sync_reach_and_wait(synch);
343    stb_barrier();
344    c(thread_sum == n, "stb_threadq 1");
345    c(which[0] + which[1] + which[2] + which[3] == n, "stb_threadq 2");
346    printf("(Distribution: %d %d %d %d)\n", which[0], which[1], which[2], which[3]);
347 
348    stb_sync_delete(synch);
349    stb_threadq_delete(tq);
350    stb_mutex_delete(msum);
351 }
352 #else
test_threads2(void)353 void test_threads2(void)
354 {
355 }
356 #endif
357 
358 char tc[] = "testing compression test quick test voila woohoo what the hell";
359 
360 unsigned char storage1[1 << 23];
test_compression(unsigned char * buffer,int length)361 int test_compression(unsigned char *buffer, int length)
362 {
363    unsigned char *storage2;
364    int c_len = stb_compress(storage1, buffer, length);
365    int dc_len;
366    printf("Compressed %d to %d\n", length, c_len);
367    dc_len = stb_decompress_length(storage1);
368    storage2 = malloc(dc_len);
369    dc_len = stb_decompress(storage2, storage1, c_len);
370    if (dc_len != length) { free(storage2); return -1; }
371    if (memcmp(buffer, storage2, length) != 0) { free(storage2); return -1; }
372    free(storage2);
373    return c_len;
374 }
375 
376 #if 0
377 int test_en_compression(char *buffer, int length)
378 {
379    int c_len = stb_en_compress(storage1, buffer, length);
380    int dc_len;
381    printf("Encompressed %d to %d\n", length, c_len);
382    dc_len = stb_en_decompress(storage2, storage1, c_len);
383    if (dc_len != length) return -1;
384    if (memcmp(buffer, storage2, length) != 0) return -1;
385    return c_len;
386 }
387 #endif
388 
389 #define STR_x "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
390 #define STR_y "yyyyyyyyyyyyyyyyyy"
391 
392 #define STR_xy STR_x STR_y
393 #define STR_xyyxy STR_xy STR_y STR_xy
394 
395 #define STR_1 "testing"
396 #define STR_2 STR_xyyxy STR_xy STR_xyyxy STR_xyyxy STR_xy STR_xyyxy
397 #define STR_3 "buh"
398 
399 char buffer[] = STR_1 "\r\n" STR_2 STR_2 STR_2 "\n" STR_3;
400 char str1[] = STR_1;
401 char str2[] = STR_2 STR_2 STR_2;
402 char str3[] = STR_3;
403 
sum(short * s)404 int sum(short *s)
405 {
406    int i,total=0;
407    for (i=0; i < stb_arr_len(s); ++i)
408       total += s[i];
409    return total;
410 }
411 
stb_adler32_old(stb_uint adler32,stb_uchar * buffer,stb_uint buflen)412 stb_uint stb_adler32_old(stb_uint adler32, stb_uchar *buffer, stb_uint buflen)
413 {
414    const stb_uint ADLER_MOD = 65521;
415    stb_uint s1 = adler32 & 0xffff;
416    stb_uint s2 = adler32 >> 16;
417 
418    while (buflen-- > 0) { // NOTE: much faster implementations are possible!
419       s1 += *buffer++; if (s1 > ADLER_MOD) s1 -= ADLER_MOD;
420       s2 += s1       ; if (s2 > ADLER_MOD) s2 -= ADLER_MOD;
421    }
422    return (s2 << 16) + s1;
423 }
424 
425 int sample_test[3][5] =
426 {
427    { 1,2,3,4,5 },
428    { 6,7,8,9,10, },
429    { 11,12,13,14,15 },
430 };
431 
432 typedef struct { unsigned short x,y,z; } struct1;
433 typedef struct { double a; int x,y,z; } struct2;
434 
435 char *args_raw[] = { "foo", "-dxrf", "bar", "-ts" };
436 char *args[8];
437 
438 void do_compressor(int,char**);
439 void test_sha1(void);
440 
441 int alloc_num, alloc_size;
dumpfunc(void * ptr,int sz,char * file,int line)442 void dumpfunc(void *ptr, int sz, char *file, int line)
443 {
444    printf("%p (%6d)  -- %3d:%s\n", ptr, sz, line, file);
445    alloc_size += sz;
446    alloc_num  += 1;
447 }
448 
expects(stb_matcher * m,char * s,int result,int len,char * str)449 char *expects(stb_matcher *m, char *s, int result, int len, char *str)
450 {
451    int res2,len2=0;
452    res2 = stb_lex(m, s, &len2);
453    c(result == res2 && len == len2, str);
454    return s + len;
455 }
456 
test_lex(void)457 void test_lex(void)
458 {
459    stb_matcher *m = stb_lex_matcher();
460    //         tok_en5 .3 20.1 20. .20 .1
461    char *s = "tok_en5.3 20.1 20. .20.1";
462 
463    stb_lex_item(m, "[a-zA-Z_][a-zA-Z0-9_]*", 1   );
464    stb_lex_item(m, "[0-9]*\\.?[0-9]*"      , 2   );
465    stb_lex_item(m, "[\r\n\t ]+"            , 3   );
466    stb_lex_item(m, "."                     , -99 );
467    s=expects(m,s,1,7, "stb_lex 1");
468    s=expects(m,s,2,2, "stb_lex 2");
469    s=expects(m,s,3,1, "stb_lex 3");
470    s=expects(m,s,2,4, "stb_lex 4");
471    s=expects(m,s,3,1, "stb_lex 5");
472    s=expects(m,s,2,3, "stb_lex 6");
473    s=expects(m,s,3,1, "stb_lex 7");
474    s=expects(m,s,2,3, "stb_lex 8");
475    s=expects(m,s,2,2, "stb_lex 9");
476    s=expects(m,s,0,0, "stb_lex 10");
477    stb_matcher_free(m);
478 }
479 
480 typedef struct Btest
481 {
482    struct Btest stb_bst_fields(btest_);
483    int v;
484 } Btest;
485 
486 stb_bst(Btest, btest_, BT2,bt2,v, int, a - b)
487 
bst_test(void)488 void bst_test(void)
489 {
490    Btest *root = NULL, *t;
491    int items[500], sorted[500];
492    int i,j,z;
493    for (z=0; z < 10; ++z) {
494       for (i=0; i < 500; ++i)
495          items[i] = stb_rand() & 0xfffffff;
496 
497       // check for collisions, and retrry if so
498       memcpy(sorted, items, sizeof(sorted));
499       qsort(sorted, 500, sizeof(sorted[0]), stb_intcmp(0));
500       for (i=1; i < 500; ++i)
501          if (sorted[i-1] == sorted[i])
502             break;
503       if (i != 500) { --z; break; }
504 
505       for (i=0; i < 500; ++i)  {
506          t = malloc(sizeof(*t));
507          t->v = items[i];
508          root = btest_insert(root, t);
509          #ifdef STB_DEBUG
510          btest__validate(root,1);
511          #endif
512          for (j=0; j <= i; ++j)
513             c(btest_find(root, items[j]) != NULL, "stb_bst 1");
514          for (   ; j < 500; ++j)
515             c(btest_find(root, items[j]) == NULL, "stb_bst 2");
516       }
517 
518       t = btest_first(root);
519       for (i=0; i < 500; ++i)
520          t = btest_next(root,t);
521       c(t == NULL, "stb_bst 5");
522       t = btest_last(root);
523       for (i=0; i < 500; ++i)
524          t = btest_prev(root,t);
525       c(t == NULL, "stb_bst 6");
526 
527       memcpy(sorted, items, sizeof(sorted));
528       qsort(sorted, 500, sizeof(sorted[0]), stb_intcmp(0));
529       t = btest_first(root);
530       for (i=0; i < 500; ++i) {
531          assert(t->v == sorted[i]);
532          t = btest_next(root, t);
533       }
534       assert(t == NULL);
535 
536       if (z==1)
537          stb_reverse(items, 500, sizeof(items[0]));
538       else if (z)
539          stb_shuffle(items, 500, sizeof(items[0]), stb_rand());
540 
541       for (i=0; i < 500; ++i)  {
542          t = btest_find(root, items[i]);
543          assert(t != NULL);
544          root = btest_remove(root, t);
545          c(btest_find(root, items[i]) == NULL, "stb_bst 5");
546          #ifdef STB_DEBUG
547          btest__validate(root, 1);
548          #endif
549          for (j=0; j <= i; ++j)
550             c(btest_find(root, items[j]) == NULL, "stb_bst 3");
551          for (   ; j < 500; ++j)
552             c(btest_find(root, items[j]) != NULL, "stb_bst 4");
553          free(t);
554       }
555    }
556 }
557 
558 extern void stu_uninit(void);
559 
560 stb_define_sort(sort_int, int, *a < *b)
561 
562 stb_rand_define(prime_rand, 1)
563 void test_packed_floats(void);
564 void test_parser_generator(void);
565 
rec_print(stb_dirtree2 * d,int depth)566 void rec_print(stb_dirtree2 *d, int depth)
567 {
568    int i;
569    for (i=0; i < depth; ++i) printf("  ");
570    printf("%s (%d)\n", d->relpath, stb_arr_len(d->files));
571    for (i=0; i < stb_arr_len(d->subdirs); ++i)
572       rec_print(d->subdirs[i], depth+1);
573    d->weight = (float) stb_arr_len(d->files);
574 }
575 
576 #ifdef MAIN_TEST
main(int argc,char ** argv)577 int main(int argc, char **argv)
578 {
579    char *z;
580    stb__wchar buffer7[1024],buffer9[1024];
581    char buffer8[4096];
582    FILE *f;
583    char *p1 = "foo/bar\\baz/test.xyz";
584    char *p2 = "foo/.bar";
585    char *p3 = "foo.bar";
586    char *p4 = "foo/bar";
587    char *wildcards[] = { "*foo*", "*bar", "baz", "*1*2*3*", "*/CVS/repository", "*oof*" };
588    char **s;
589    char buf[256], *p;
590    int n,len2,*q,i;
591    stb_matcher *mt=NULL;
592 
593    if (argc > 1) {
594       do_compressor(argc,argv);
595       return 0;
596    }
597    test_classes();
598    //show();
599 
600    //stb_malloc_check_counter(2,2);
601    //_CrtSetBreakAlloc(10398);
602 
603    stbprint("Checking {!if} the {$fancy} print function {#works}?  - should\n");
604    stbprint("                                                      - align\n");
605    stbprint("But {#3this}} {one}}                                  - shouldn't\n");
606 
607    #if 0
608    {
609       int i;
610       char **s = stb_readdir_recursive("/sean", NULL);
611       stb_dirtree *d = stb_dirtree_from_files_relative("", s, stb_arr_len(s));
612       stb_dirtree **e;
613       rec_print(d, 0);
614       e = stb_summarize_tree(d,12,4);
615       for (i=0; i < stb_arr_len(e); ++i) {
616          printf("%s\n", e[i]->fullpath);
617       }
618       stb_arr_free(e);
619 
620       stb_fatal("foo");
621    }
622    #endif
623 
624    stb_("Started stb.c");
625    test_threads2();
626    test_threads();
627 
628    for (i=0; i < 1023 && 5+77*i < 0xd800; ++i)
629       buffer7[i] = 5+77*i;
630    buffer7[i++] = 0xd801;
631    buffer7[i++] = 0xdc02;
632    buffer7[i++] = 0xdbff;
633    buffer7[i++] = 0xdfff;
634    buffer7[i] = 0;
635    p = stb_to_utf8(buffer8, buffer7, sizeof(buffer8));
636    c(p != NULL, "stb_to_utf8");
637    if (p != NULL) {
638       stb_from_utf8(buffer9, buffer8, sizeof(buffer9)/2);
639       c(!memcmp(buffer7, buffer9, i*2), "stb_from_utf8");
640    }
641 
642    z = "foo.*[bd]ak?r";
643    c( stb_regex(z, "muggle man food is barfy") == 1, "stb_regex 1");
644    c( stb_regex("foo.*bar", "muggle man food is farfy") == 0, "stb_regex 2");
645    c( stb_regex("[^a-zA-Z]foo[^a-zA-Z]", "dfoobar xfood") == 0, "stb_regex 3");
646    c( stb_regex(z, "muman foob is bakrfy") == 1, "stb_regex 4");
647    z = "foo.*[bd]bk?r";
648    c( stb_regex(z, "muman foob is bakrfy") == 0, "stb_regex 5");
649    c( stb_regex(z, "muman foob is bbkrfy") == 1, "stb_regex 6");
650 
651    stb_regex(NULL,NULL);
652 
653    #if 0
654    test_parser_generator();
655    stb_wrapper_listall(dumpfunc);
656    if (alloc_num)
657       printf("Memory still in use: %d allocations of %d bytes.\n", alloc_num, alloc_size);
658    #endif
659 
660    test_script();
661    p = stb_file("sieve.stua", NULL);
662    if (p) {
663       stua_run_script(p);
664       free(p);
665    }
666    stua_uninit();
667 
668    //stb_wrapper_listall(dumpfunc);
669    printf("Memory still in use: %d allocations of %d bytes.\n", alloc_num, alloc_size);
670 
671    c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 0");
672 
673    bst_test();
674 
675    c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 0");
676 
677 #if 0
678    // stb_block
679    {
680       int inuse=0, freespace=0;
681       int *x = malloc(10000*sizeof(*x));
682       stb_block *b = stb_block_new(1, 10000);
683       #define BLOCK_COUNT  1000
684       int *p = malloc(sizeof(*p) * BLOCK_COUNT);
685       int *l = malloc(sizeof(*l) * BLOCK_COUNT);
686       int i, n, k = 0;
687 
688       memset(x, 0, 10000 * sizeof(*x));
689 
690       n = 0;
691       while (n < BLOCK_COUNT && k < 1000) {
692          l[n] = 16 + (rand() & 31);
693          p[n] = stb_block_alloc(b, l[n], 0);
694          if (p[n] == 0)
695             break;
696          inuse += l[n];
697 
698          freespace = 0;
699          for (i=0; i < b->len; ++i)
700             freespace += b->freelist[i].len;
701          assert(freespace + inuse == 9999);
702 
703          for (i=0; i < l[n]; ++i)
704             x[ p[n]+i ] = p[n];
705          ++n;
706 
707          if (k > 20) {
708             int sz;
709             i = (stb_rand() % n);
710             sz = l[i];
711             stb_block_free(b, p[i], sz);
712             inuse -= sz;
713             p[i] = p[n-1];
714             l[i] = l[n-1];
715             --n;
716 
717             freespace = 0;
718             for (i=0; i < b->len; ++i)
719                freespace += b->freelist[i].len;
720             assert(freespace + inuse == 9999);
721          }
722 
723 
724          ++k;
725 
726          // validate
727          if ((k % 50) == 0) {
728             int j;
729             for (j=0; j < n; ++j) {
730                for (i=0; i < l[j]; ++i)
731                   assert(x[ p[j]+i ] == p[j]);
732             }
733          }
734 
735          if ((k % 200) == 0) {
736             stb_block_compact_freelist(b);
737          }
738       }
739 
740       for (i=0; i < n; ++i)
741          stb_block_free(b, p[i], l[i]);
742 
743       stb_block_destroy(b);
744       free(p);
745       free(l);
746       free(x);
747    }
748 
749    blockfile_test();
750 #endif
751 
752    mt = stb_lex_matcher();
753    for (i=0; i < 5; ++i)
754       stb_lex_item_wild(mt, wildcards[i], i+1);
755 
756    c(1==stb_lex(mt, "this is a foo in the middle",NULL), "stb_matcher_match 1");
757    c(0==stb_lex(mt, "this is a bar in the middle",NULL), "stb_matcher_match 2");
758    c(0==stb_lex(mt, "this is a baz in the middle",NULL), "stb_matcher_match 3");
759    c(2==stb_lex(mt, "this is a bar",NULL), "stb_matcher_match 4");
760    c(0==stb_lex(mt, "this is a baz",NULL), "stb_matcher_match 5");
761    c(3==stb_lex(mt, "baz",NULL), "stb_matcher_match 6");
762    c(4==stb_lex(mt, "1_2_3_4",NULL), "stb_matcher_match 7");
763    c(0==stb_lex(mt, "1  3  3 3 3  2 ",NULL), "stb_matcher_match 8");
764    c(4==stb_lex(mt, "1  3  3 3 2  3 ",NULL), "stb_matcher_match 9");
765    c(5==stb_lex(mt, "C:/sean/prj/old/gdmag/mipmap/hqp/adol-c/CVS/Repository",NULL), "stb_matcher_match 10");
766    stb_matcher_free(mt);
767 
768    {
769       #define SSIZE  500000
770       static int arr[SSIZE],arr2[SSIZE];
771       int i,good;
772       for (i=0; i < SSIZE; ++i)
773          arr2[i] = stb_rand();
774       memcpy(arr,arr2,sizeof(arr));
775       printf("stb_define_sort:\n");
776       sort_int(arr, SSIZE);
777       good = 1;
778       for (i=0; i+1 < SSIZE; ++i)
779          if (arr[i] > arr[i+1])
780             good = 0;
781       c(good, "stb_define_sort");
782       printf("qsort:\n");
783       qsort(arr2, SSIZE, sizeof(arr2[0]), stb_intcmp(0));
784       printf("done\n");
785       // check for bugs
786       memset(arr, 0, sizeof(arr[0]) * 1000);
787       sort_int(arr, 1000);
788    }
789 
790 
791    c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc -2");
792 
793    c( stb_is_prime( 2), "stb_is_prime 1");
794    c( stb_is_prime( 3), "stb_is_prime 2");
795    c( stb_is_prime( 5), "stb_is_prime 3");
796    c( stb_is_prime( 7), "stb_is_prime 4");
797    c(!stb_is_prime( 9), "stb_is_prime 5");
798    c( stb_is_prime(11), "stb_is_prime 6");
799    c(!stb_is_prime(25), "stb_is_prime 7");
800    c(!stb_is_prime(27), "stb_is_prime 8");
801    c( stb_is_prime(29), "stb_is_prime 9");
802    c( stb_is_prime(31), "stb_is_prime a");
803    c(!stb_is_prime(33), "stb_is_prime b");
804    c(!stb_is_prime(35), "stb_is_prime c");
805    c(!stb_is_prime(36), "stb_is_prime d");
806 
807    for (n=7; n < 64; n += 3) {
808       int i;
809       stb_perfect s;
810       unsigned int *p = malloc(n * sizeof(*p));
811       for (i=0; i < n; ++i)
812          p[i] = i*i;
813       c(stb_perfect_create(&s, p, n), "stb_perfect_hash 1");
814       stb_perfect_destroy(&s);
815       for (i=0; i < n; ++i)
816          p[i] = stb_rand();
817       c(stb_perfect_create(&s, p, n), "stb_perfect_hash 2");
818       stb_perfect_destroy(&s);
819       for (i=0; i < n; ++i)
820          p[i] = (0x80000000 >> stb_log2_ceil(n>>1)) * i;
821       c(stb_perfect_create(&s, p, n), "stb_perfect_hash 2");
822       stb_perfect_destroy(&s);
823       for (i=0; i < n; ++i)
824          p[i] = (int) malloc(1024);
825       c(stb_perfect_create(&s, p, n), "stb_perfect_hash 3");
826       stb_perfect_destroy(&s);
827       for (i=0; i < n; ++i)
828          free((void *) p[i]);
829       free(p);
830    }
831    printf("Maximum attempts required to find perfect hash: %d\n",
832          stb_perfect_hash_max_failures);
833 
834    p = "abcdefghijklmnopqrstuvwxyz";
835    c(stb_ischar('c', p), "stb_ischar 1");
836    c(stb_ischar('x', p), "stb_ischar 2");
837    c(!stb_ischar('#', p), "stb_ischar 3");
838    c(!stb_ischar('X', p), "stb_ischar 4");
839    p = "0123456789";
840    c(!stb_ischar('c', p), "stb_ischar 5");
841    c(!stb_ischar('x', p), "stb_ischar 6");
842    c(!stb_ischar('#', p), "stb_ischar 7");
843    c(!stb_ischar('X', p), "stb_ischar 8");
844    p = "#####";
845    c(!stb_ischar('c', p), "stb_ischar a");
846    c(!stb_ischar('x', p), "stb_ischar b");
847    c(stb_ischar('#', p), "stb_ischar c");
848    c(!stb_ischar('X', p), "stb_ischar d");
849    p = "xXyY";
850    c(!stb_ischar('c', p), "stb_ischar e");
851    c(stb_ischar('x', p), "stb_ischar f");
852    c(!stb_ischar('#', p), "stb_ischar g");
853    c(stb_ischar('X', p), "stb_ischar h");
854 
855    c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 1");
856 
857    q = stb_wordwrapalloc(15, "How now brown cow. Testinglishously. Okey dokey");
858    // How now brown
859    // cow. Testinglis
860    // hously. Okey
861    // dokey
862    c(stb_arr_len(q) ==  8, "stb_wordwrap 8");
863    c(q[2] == 14 && q[3] == 15, "stb_wordwrap 9");
864    c(q[4] == 29 && q[5] == 12, "stb_wordwrap 10");
865    stb_arr_free(q);
866 
867    q = stb_wordwrapalloc(20, "How now brown cow. Testinglishously. Okey dokey");
868    // How now brown cow.
869    // Testinglishously.
870    // Okey dokey
871    c(stb_arr_len(q) ==  6, "stb_wordwrap 1");
872    c(q[0] ==  0 && q[1] == 18, "stb_wordwrap 2");
873    c(q[2] == 19 && q[3] == 17, "stb_wordwrap 3");
874    c(q[4] == 37 && q[5] == 10, "stb_wordwrap 4");
875    stb_arr_free(q);
876 
877    q = stb_wordwrapalloc(12, "How now brown cow. Testinglishously. Okey dokey");
878    // How now
879    // brown cow.
880    // Testinglisho
881    // usly. Okey
882    // dokey
883    c(stb_arr_len(q) ==  10, "stb_wordwrap 5");
884    c(q[4] == 19 && q[5] == 12, "stb_wordwrap 6");
885    c(q[6] == 31 && q[3] == 10, "stb_wordwrap 7");
886    stb_arr_free(q);
887 
888    //test_script();
889 
890    //test_packed_floats();
891 
892    c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 0");
893    if (stb_alloc_count_alloc != stb_alloc_count_free) {
894       printf("%d allocs, %d frees\n", stb_alloc_count_alloc, stb_alloc_count_free);
895    }
896    test_lex();
897 
898    mt = stb_regex_matcher(".*foo.*bar.*");
899    c(stb_matcher_match(mt, "foobarx")                == 1, "stb_matcher_match 1");
900    c(stb_matcher_match(mt, "foobar")                 == 1, "stb_matcher_match 2");
901    c(stb_matcher_match(mt, "foo bar")                == 1, "stb_matcher_match 3");
902    c(stb_matcher_match(mt, "fo foo ba ba bar ba")    == 1, "stb_matcher_match 4");
903    c(stb_matcher_match(mt, "fo oo oo ba ba bar foo") == 0, "stb_matcher_match 5");
904    stb_free(mt);
905 
906    mt = stb_regex_matcher(".*foo.?bar.*");
907    c(stb_matcher_match(mt, "abfoobarx")                == 1, "stb_matcher_match 6");
908    c(stb_matcher_match(mt, "abfoobar")                 == 1, "stb_matcher_match 7");
909    c(stb_matcher_match(mt, "abfoo bar")                == 1, "stb_matcher_match 8");
910    c(stb_matcher_match(mt, "abfoo  bar")               == 0, "stb_matcher_match 9");
911    c(stb_matcher_match(mt, "abfo foo ba ba bar ba")    == 0, "stb_matcher_match 10");
912    c(stb_matcher_match(mt, "abfo oo oo ba ba bar foo") == 0, "stb_matcher_match 11");
913    stb_free(mt);
914 
915    mt = stb_regex_matcher(".*m((foo|bar)*baz)m.*");
916    c(stb_matcher_match(mt, "abfoobarx")                == 0, "stb_matcher_match 12");
917    c(stb_matcher_match(mt, "a mfoofoofoobazm d")       == 1, "stb_matcher_match 13");
918    c(stb_matcher_match(mt, "a mfoobarbazfoom d")       == 0, "stb_matcher_match 14");
919    c(stb_matcher_match(mt, "a mbarbarfoobarbazm d")    == 1, "stb_matcher_match 15");
920    c(stb_matcher_match(mt, "a mfoobarfoo bazm d")      == 0, "stb_matcher_match 16");
921    c(stb_matcher_match(mt, "a mm foobarfoobarfoobar ") == 0, "stb_matcher_match 17");
922    stb_free(mt);
923 
924    mt = stb_regex_matcher("f*|z");
925    c(stb_matcher_match(mt, "fz")       == 0, "stb_matcher_match 0a");
926    c(stb_matcher_match(mt, "ff")       == 1, "stb_matcher_match 0b");
927    c(stb_matcher_match(mt, "z")        == 1, "stb_matcher_match 0c");
928    stb_free(mt);
929 
930    mt = stb_regex_matcher("m(f|z*)n");
931    c(stb_matcher_match(mt, "mfzn")     == 0, "stb_matcher_match 0d");
932    c(stb_matcher_match(mt, "mffn")     == 0, "stb_matcher_match 0e");
933    c(stb_matcher_match(mt, "mzn")      == 1, "stb_matcher_match 0f");
934    c(stb_matcher_match(mt, "mn")       == 1, "stb_matcher_match 0g");
935    c(stb_matcher_match(mt, "mzfn")     == 0, "stb_matcher_match 0f");
936 
937    c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmm       ") == 0, "stb_matcher_find 1");
938    c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmm       ") == 0, "stb_matcher_find 2");
939    c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmmffzzz  ") == 0, "stb_matcher_find 3");
940    c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmmnfzzz  ") == 1, "stb_matcher_find 4");
941    c(stb_matcher_find(mt, "mmmfn aanmannnnnnnmmmmmm fzzz  ") == 1, "stb_matcher_find 5");
942    c(stb_matcher_find(mt, "mmmzzn anmannnnnnnmmmmmm fzzz  ") == 1, "stb_matcher_find 6");
943    c(stb_matcher_find(mt, "mm anmannnnnnnmmmmmm fzmzznzz  ") == 1, "stb_matcher_find 7");
944    c(stb_matcher_find(mt, "mm anmannnnnnnmmmmmm fzmzzfnzz ") == 0, "stb_matcher_find 8");
945    c(stb_matcher_find(mt, "manmfnmannnnnnnmmmmmmmmmffzzz  ") == 1, "stb_matcher_find 9");
946    stb_free(mt);
947 
948    mt = stb_regex_matcher(".*m((foo|bar)*|baz)m.*");
949    c(stb_matcher_match(mt, "abfoobarx")                == 0, "stb_matcher_match 18");
950    c(stb_matcher_match(mt, "a mfoofoofoobazm d")       == 0, "stb_matcher_match 19");
951    c(stb_matcher_match(mt, "a mfoobarbazfoom d")       == 0, "stb_matcher_match 20");
952    c(stb_matcher_match(mt, "a mbazm d")                == 1, "stb_matcher_match 21");
953    c(stb_matcher_match(mt, "a mfoobarfoom d")          == 1, "stb_matcher_match 22");
954    c(stb_matcher_match(mt, "a mm foobarfoobarfoobar ") == 1, "stb_matcher_match 23");
955    stb_free(mt);
956 
957    mt = stb_regex_matcher("[a-fA-F]..[^]a-zA-Z]");
958    c(stb_matcher_match(mt, "Axx1")                     == 1, "stb_matcher_match 24");
959    c(stb_matcher_match(mt, "Fxx1")                     == 1, "stb_matcher_match 25");
960    c(stb_matcher_match(mt, "Bxx]")                     == 0, "stb_matcher_match 26");
961    c(stb_matcher_match(mt, "Cxxz")                     == 0, "stb_matcher_match 27");
962    c(stb_matcher_match(mt, "gxx[")                     == 0, "stb_matcher_match 28");
963    c(stb_matcher_match(mt, "-xx0")                     == 0, "stb_matcher_match 29");
964    stb_free(mt);
965 
966    c(stb_wildmatch("foo*bar", "foobarx")    == 0, "stb_wildmatch 0a");
967    c(stb_wildmatch("foo*bar", "foobar")     == 1, "stb_wildmatch 1a");
968    c(stb_wildmatch("foo*bar", "foo bar")    == 1, "stb_wildmatch 2a");
969    c(stb_wildmatch("foo*bar", "fo foo ba ba bar ba") == 0, "stb_wildmatch 3a");
970    c(stb_wildmatch("foo*bar", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4a");
971 
972    c(stb_wildmatch("*foo*bar*", "foobar")     == 1, "stb_wildmatch 1b");
973    c(stb_wildmatch("*foo*bar*", "foo bar")    == 1, "stb_wildmatch 2b");
974    c(stb_wildmatch("*foo*bar*", "fo foo ba ba bar ba") == 1, "stb_wildmatch 3b");
975    c(stb_wildmatch("*foo*bar*", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4b");
976 
977    c(stb_wildmatch("foo*bar*", "foobarx")     == 1, "stb_wildmatch 1c");
978    c(stb_wildmatch("foo*bar*", "foobabar")    == 1, "stb_wildmatch 2c");
979    c(stb_wildmatch("foo*bar*", "fo foo ba ba bar ba") == 0, "stb_wildmatch 3c");
980    c(stb_wildmatch("foo*bar*", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4c");
981 
982    c(stb_wildmatch("*foo*bar", "foobar")     == 1, "stb_wildmatch 1d");
983    c(stb_wildmatch("*foo*bar", "foo bar")    == 1, "stb_wildmatch 2d");
984    c(stb_wildmatch("*foo*bar", "fo foo ba ba bar ba") == 0, "stb_wildmatch 3d");
985    c(stb_wildmatch("*foo*bar", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4d");
986 
987    c(stb_wildfind("foo*bar", "xyfoobarx")    == 2, "stb_wildfind 0a");
988    c(stb_wildfind("foo*bar", "aaafoobar")    == 3, "stb_wildfind 1a");
989    c(stb_wildfind("foo*bar", "foo bar")      == 0, "stb_wildfind 2a");
990    c(stb_wildfind("foo*bar", "fo foo ba ba bar ba") == 3, "stb_wildfind 3a");
991    c(stb_wildfind("foo*bar", "fo oo oo ba ba ar foo") == -1, "stb_wildfind 4a");
992 
993    c(stb_wildmatch("*foo*;*bar*", "foobar")  == 1, "stb_wildmatch 1e");
994    c(stb_wildmatch("*foo*;*bar*", "afooa")  == 1, "stb_wildmatch 2e");
995    c(stb_wildmatch("*foo*;*bar*", "abara")  == 1, "stb_wildmatch 3e");
996    c(stb_wildmatch("*foo*;*bar*", "abaza")  == 0, "stb_wildmatch 4e");
997    c(stb_wildmatch("*foo*;*bar*", "foboar")  == 0, "stb_wildmatch 5e");
998 
999    test_sha1();
1000 
1001    n = sizeof(args_raw)/sizeof(args_raw[0]);
1002    memcpy(args, args_raw, sizeof(args_raw));
1003    s = stb_getopt(&n, args);
1004    c(n >= 1 && !strcmp(args[1], "bar" ), "stb_getopt 1");
1005    c(stb_arr_len(s) >= 2 && !strcmp(s[2]   , "r"   ), "stb_getopt 2");
1006    stb_getopt_free(s);
1007 
1008    n = sizeof(args_raw)/sizeof(args_raw[0]);
1009    memcpy(args, args_raw, sizeof(args_raw));
1010    s = stb_getopt_param(&n, args, "f");
1011    c(stb_arr_len(s) >= 3 && !strcmp(s[3]   , "fbar"), "stb_getopt 3");
1012    stb_getopt_free(s);
1013 
1014    n = sizeof(args_raw)/sizeof(args_raw[0]);
1015    memcpy(args, args_raw, sizeof(args_raw));
1016    s = stb_getopt_param(&n, args, "x");
1017    c(stb_arr_len(s) >= 2 && !strcmp(s[1]   , "xrf" ), "stb_getopt 4");
1018    stb_getopt_free(s);
1019 
1020    n = sizeof(args_raw)/sizeof(args_raw[0]);
1021    memcpy(args, args_raw, sizeof(args_raw));
1022    s = stb_getopt_param(&n, args, "s");
1023    c(s == NULL && n == 0     , "stb_getopt 5");
1024    stb_getopt_free(s);
1025 
1026 #if 0
1027    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, -1, -1) ==  1, "stb_csample_int 1");
1028    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3,  1, -3) ==  2, "stb_csample_int 2");
1029    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 12, -2) ==  5, "stb_csample_int 3");
1030    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 15,  1) == 10, "stb_csample_int 4");
1031    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3,  5,  4) == 15, "stb_csample_int 5");
1032    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3,  3,  3) == 14, "stb_csample_int 6");
1033    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, -2,  5) == 11, "stb_csample_int 7");
1034    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, -7,  0) ==  1, "stb_csample_int 8");
1035    c(*stb_csample_int(sample_test[0], 1, 5, 5, 3,  2,  1) ==  8, "stb_csample_int 9");
1036 #endif
1037 
1038    c(!strcmp(stb_splitpath(buf, p1, STB_PATH      ), "foo/bar\\baz/"), "stb_splitpath 1");
1039    c(!strcmp(stb_splitpath(buf, p1, STB_FILE      ), "test"), "stb_splitpath 2");
1040    c(!strcmp(stb_splitpath(buf, p1, STB_EXT       ), ".xyz"), "stb_splitpath 3");
1041    c(!strcmp(stb_splitpath(buf, p1, STB_PATH_FILE ), "foo/bar\\baz/test"), "stb_splitpath 4");
1042    c(!strcmp(stb_splitpath(buf, p1, STB_FILE_EXT  ), "test.xyz"), "stb_splitpath 5");
1043 
1044    c(!strcmp(stb_splitpath(buf, p2, STB_PATH      ), "foo/"), "stb_splitpath 6");
1045    c(!strcmp(stb_splitpath(buf, p2, STB_FILE      ), ""), "stb_splitpath 7");
1046    c(!strcmp(stb_splitpath(buf, p2, STB_EXT       ), ".bar"), "stb_splitpath 8");
1047    c(!strcmp(stb_splitpath(buf, p2, STB_PATH_FILE ), "foo/"), "stb_splitpath 9");
1048    c(!strcmp(stb_splitpath(buf, p2, STB_FILE_EXT  ), ".bar"), "stb_splitpath 10");
1049 
1050    c(!strcmp(stb_splitpath(buf, p3, STB_PATH      ), "./"), "stb_splitpath 11");
1051    c(!strcmp(stb_splitpath(buf, p3, STB_FILE      ), "foo"), "stb_splitpath 12");
1052    c(!strcmp(stb_splitpath(buf, p3, STB_EXT       ), ".bar"), "stb_splitpath 13");
1053    c(!strcmp(stb_splitpath(buf, p3, STB_PATH_FILE ), "foo"), "stb_splitpath 14");
1054 
1055    c(!strcmp(stb_splitpath(buf, p4, STB_PATH      ), "foo/"), "stb_splitpath 16");
1056    c(!strcmp(stb_splitpath(buf, p4, STB_FILE      ), "bar"), "stb_splitpath 17");
1057    c(!strcmp(stb_splitpath(buf, p4, STB_EXT       ), ""), "stb_splitpath 18");
1058    c(!strcmp(stb_splitpath(buf, p4, STB_PATH_FILE ), "foo/bar"), "stb_splitpath 19");
1059    c(!strcmp(stb_splitpath(buf, p4, STB_FILE_EXT  ), "bar"), "stb_splitpath 20");
1060 
1061    c(!strcmp(p=stb_dupreplace("testfootffooo foo fox", "foo", "brap"), "testbraptfbrapo brap fox"), "stb_dupreplace 1"); free(p);
1062    c(!strcmp(p=stb_dupreplace("testfootffooo foo fox", "foo", ""    ), "testtfo  fox"            ), "stb_dupreplace 2"); free(p);
1063    c(!strcmp(p=stb_dupreplace("abacab", "a", "aba"),                   "abababacabab"            ), "stb_dupreplace 3"); free(p);
1064 
1065 
1066 #if 0
1067    m = stb_mml_parse("<a><b><c>x</c><d>y</d></b><e>&lt;&amp;f&gt;</e></a>");
1068    c(m != NULL, "stb_mml_parse 1");
1069    if (m) {
1070       c(!strcmp(m->child[0]->child[0]->child[1]->tag, "d"), "stb_mml_parse 2");
1071       c(!strcmp(m->child[0]->child[1]->leaf_data, "<&f>"), "stb_mml_parse 3");
1072    }
1073    if (m)
1074       stb_mml_free(m);
1075    c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 1");
1076    if (stb_alloc_count_alloc != stb_alloc_count_free) {
1077       printf("%d allocs, %d frees\n", stb_alloc_count_alloc, stb_alloc_count_free);
1078    }
1079 #endif
1080 
1081    c(stb_linear_remap(3.0f,0,8,1,2) == 1.375, "stb_linear_remap()");
1082 
1083    c(stb_bitreverse(0x1248fec8) == 0x137f1248, "stb_bitreverse() 1");
1084    c(stb_bitreverse8(0x4e) == 0x72, "stb_bitreverse8() 1");
1085    c(stb_bitreverse8(0x31) == 0x8c, "stb_bitreverse8() 2");
1086    for (n=1; n < 255; ++n) {
1087       unsigned int m = stb_bitreverse8((uint8) n);
1088       c(stb_bitreverse8((uint8) m) == (unsigned int) n, "stb_bitreverse8() 3");
1089    }
1090 
1091    for (n=2; n <= 31; ++n) {
1092       c(stb_is_pow2   ((1 << n)  ) == 1  , "stb_is_pow2() 1");
1093       c(stb_is_pow2   ((1 << n)+1) == 0  , "stb_is_pow2() 2");
1094       c(stb_is_pow2   ((1 << n)-1) == 0  , "stb_is_pow2() 3");
1095 
1096       c(stb_log2_floor((1 << n)  ) == n  , "stb_log2_floor() 1");
1097       c(stb_log2_floor((1 << n)+1) == n  , "stb_log2_floor() 2");
1098       c(stb_log2_floor((1 << n)-1) == n-1, "stb_log2_floor() 3");
1099 
1100       c(stb_log2_ceil ((1 << n)  ) == n  , "stb_log2_ceil() 1");
1101       c(stb_log2_ceil ((1 << n)+1) == n+1, "stb_log2_ceil() 2");
1102       c(stb_log2_ceil ((1 << n)-1) == n  , "stb_log2_ceil() 3");
1103 
1104       c(stb_bitreverse(1 << n) == 1U << (31-n), "stb_bitreverse() 2");
1105    }
1106 
1107    c(stb_log2_floor(0) == -1, "stb_log2_floor() 4");
1108    c(stb_log2_ceil (0) == -1, "stb_log2_ceil () 4");
1109 
1110    c(stb_log2_floor(-1) == 31, "stb_log2_floor() 5");
1111    c(stb_log2_ceil (-1) == 32, "stb_log2_ceil () 5");
1112 
1113    c(stb_bitcount(0xffffffff) == 32, "stb_bitcount() 1");
1114    c(stb_bitcount(0xaaaaaaaa) == 16, "stb_bitcount() 2");
1115    c(stb_bitcount(0x55555555) == 16, "stb_bitcount() 3");
1116    c(stb_bitcount(0x00000000) ==  0, "stb_bitcount() 4");
1117 
1118    c(stb_lowbit8(0xf0) == 4, "stb_lowbit8 1");
1119    c(stb_lowbit8(0x10) == 4, "stb_lowbit8 2");
1120    c(stb_lowbit8(0xf3) == 0, "stb_lowbit8 3");
1121    c(stb_lowbit8(0xf8) == 3, "stb_lowbit8 4");
1122    c(stb_lowbit8(0x60) == 5, "stb_lowbit8 5");
1123 
1124    for (n=0; n < sizeof(buf); ++n)
1125       buf[n] = 0;
1126 
1127    for (n = 0; n < 200000; ++n) {
1128       unsigned int k = stb_rand();
1129       int i,z=0;
1130       for (i=0; i < 32; ++i)
1131          if (k & (1 << i)) ++z;
1132       c(stb_bitcount(k) == z, "stb_bitcount() 5");
1133 
1134       buf[k >> 24] = 1;
1135 
1136       if (k != 0) {
1137          if (stb_is_pow2(k)) {
1138             c(stb_log2_floor(k) == stb_log2_ceil(k), "stb_is_pow2() 1");
1139             c(k == 1U << stb_log2_floor(k), "stb_is_pow2() 2");
1140          } else {
1141             c(stb_log2_floor(k) == stb_log2_ceil(k)-1, "stb_is_pow2() 3");
1142          }
1143       }
1144 
1145       c(stb_bitreverse(stb_bitreverse(n)) == (uint32) n, "stb_bitreverse() 3");
1146    }
1147 
1148    // make sure reasonable coverage from stb_rand()
1149    for (n=0; n < sizeof(buf); ++n)
1150       c(buf[n] != 0, "stb_rand()");
1151 
1152    for (n=0; n < sizeof(buf); ++n)
1153       buf[n] = 0;
1154 
1155    for (n=0; n < 60000; ++n) {
1156       float z = (float) stb_frand();
1157       int n = (int) (z * sizeof(buf));
1158       c(z >= 0 && z < 1, "stb_frand() 1");
1159       c(n >= 0 && n < sizeof(buf), "stb_frand() 2");
1160       buf[n] = 1;
1161    }
1162 
1163    // make sure reasonable coverage from stb_frand(),
1164    // e.g. that the range remap isn't incorrect
1165    for (n=0; n < sizeof(buf); ++n)
1166       c(buf[n] != 0, "stb_frand()");
1167 
1168 
1169    // stb_arr
1170    {
1171       short *s = NULL;
1172 
1173       c(sum(s) == 0, "stb_arr 1");
1174 
1175       stb_arr_add(s); s[0] = 3;
1176       stb_arr_push(s,7);
1177 
1178       c( stb_arr_valid(s,1), "stb_arr 2");
1179       c(!stb_arr_valid(s,2), "stb_arr 3");
1180 
1181       // force a realloc
1182       stb_arr_push(s,0);
1183       stb_arr_push(s,0);
1184       stb_arr_push(s,0);
1185       stb_arr_push(s,0);
1186 
1187       c(sum(s) == 10, "stb_arr 4");
1188       stb_arr_push(s,0);
1189       s[0] = 1; s[1] = 5; s[2] = 20;
1190       c(sum(s) == 26, "stb_arr 5");
1191       stb_arr_setlen(s,2);
1192       c(sum(s) == 6, "stb_arr 6");
1193       stb_arr_setlen(s,1);
1194       c(sum(s) == 1, "stb_arr 7");
1195       stb_arr_setlen(s,0);
1196       c(sum(s) == 0, "stb_arr 8");
1197 
1198       stb_arr_push(s,3);
1199       stb_arr_push(s,4);
1200       stb_arr_push(s,5);
1201       stb_arr_push(s,6);
1202       stb_arr_push(s,7);
1203       stb_arr_deleten(s,1,3);
1204       c(stb_arr_len(s)==2 && sum(s) == 10, "stb_arr_9");
1205 
1206       stb_arr_push(s,2);
1207       // 3 7 2
1208       stb_arr_insertn(s,2,2);
1209       // 3 7 x x 2
1210       s[2] = 5;
1211       s[3] = 6;
1212       c(s[0]==3 && s[1] == 7 && s[2] == 5 && s[3] == 6 && s[4] == 2, "stb_arr 10");
1213       stb_arr_free(s);
1214    }
1215 
1216    #if 1
1217    f= stb_fopen("data/stb.test", "wb");
1218    fwrite(buffer, 1, sizeof(buffer)-1, f);
1219    stb_fclose(f, stb_keep_yes);
1220    #ifndef WIN32
1221    sleep(1);  // andLinux has some synchronization problem here
1222    #endif
1223    #else
1224    f= fopen("data/stb.test", "wb");
1225    fwrite(buffer, 1, sizeof(buffer)-1, f);
1226    fclose(f);
1227    #endif
1228    if (!stb_fexists("data/stb.test")) {
1229       fprintf(stderr, "Error: couldn't open file just written, or stb_fexists() is broken.\n");
1230    }
1231 
1232    f = fopen("data/stb.test", "rb");
1233    // f = NULL; // test stb_fatal()
1234    if (!f) { stb_fatal("Error: couldn't open file just written\n"); }
1235    else {
1236       char temp[4];
1237       int len1 = stb_filelen(f), len2;
1238       int n1,n2;
1239       if (fread(temp,1,4,f) == 0) {
1240          int n = ferror(f);
1241          if (n) { stb_fatal("Error reading from stream: %d", n); }
1242          if (feof(f)) stb_fatal("Weird, read 0 bytes and hit eof");
1243          stb_fatal("Read 0, but neither feof nor ferror is true");
1244       }
1245       fclose(f);
1246       p = stb_file("data/stb.test", &len2);
1247       if (p == NULL) stb_fatal("Error: stb_file() failed");
1248       c(len1 == sizeof(buffer)-1, "stb_filelen()");
1249       c(len2 == sizeof(buffer)-1, "stb_file():n");
1250       c(memcmp(p, buffer, sizeof(buffer)-1) == 0, "stb_file()");
1251       c(strcmp(p, buffer)==0, "stb_file() terminated");
1252       free(p);
1253 
1254       s = stb_stringfile("data/stb.test", &n1);
1255       c(n1 == 3, "stb_stringfile():n");
1256       n2 = 0;
1257       while (s[n2]) ++n2;
1258       c(n1 == n2, "stb_stringfile():n length matches the non-NULL strings");
1259       if (n2 == 3) {
1260          c(strcmp(s[0],str1)==0, "stb_stringfile()[0]");
1261          c(strcmp(s[1],str2)==0, "stb_stringfile()[1]");
1262          c(strcmp(s[2],str3)==0, "stb_stringfile()[2] (no terminating newlines)");
1263       }
1264       free(s);
1265 
1266       f = fopen("data/stb.test", "rb");
1267       stb_fgets(buf, sizeof(buf), f);
1268       //c(strcmp(buf, str1)==0, "stb_fgets()");
1269       p = stb_fgets_malloc(f);
1270       n1 = strlen(p);
1271       n2 = strlen(str2);
1272       c(strcmp(p, str2)==0, "stb_fgets_malloc()");
1273       free(p);
1274       stb_fgets(buf, sizeof(buf), f);
1275       c(strcmp(buf, str3)==0, "stb_fgets()3");
1276    }
1277 
1278    c( stb_prefix("foobar", "foo"), "stb_prefix() 1");
1279    c(!stb_prefix("foo", "foobar"), "stb_prefix() 2");
1280    c( stb_prefix("foob", "foob" ), "stb_prefix() 3");
1281 
1282    stb_strncpy(buf, "foobar", 6);  c(strcmp(buf,"fooba" )==0, "stb_strncpy() 1");
1283    stb_strncpy(buf, "foobar", 8);  c(strcmp(buf,"foobar")==0, "stb_strncpy() 2");
1284 
1285    c(!strcmp(p=stb_duplower("FooBar"), "foobar"), "stb_duplower()"); free(p);
1286    strcpy(buf, "FooBar");
1287    stb_tolower(buf);
1288    c(!strcmp(buf, "foobar"), "stb_tolower()");
1289 
1290    p = stb_strtok(buf, "foo=ba*r", "#=*");
1291    c(!strcmp(buf, "foo" ), "stb_strtok() 1");
1292    c(!strcmp(p  , "ba*r"), "stb_strtok() 2");
1293    p = stb_strtok(buf, "foobar", "#=*");
1294    c(*p == 0, "stb_strtok() 3");
1295 
1296    c(!strcmp(stb_skipwhite(" \t\n foo"), "foo"), "stb_skipwhite()");
1297 
1298    s = stb_tokens("foo == ba*r", "#=*", NULL);
1299    c(!strcmp(s[0], "foo "), "stb_tokens() 1");
1300    c(!strcmp(s[1], " ba"),  "stb_tokens() 2");
1301    c(!strcmp(s[2], "r"),    "stb_tokens() 3");
1302    c(s[3] == 0,             "stb_tokens() 4");
1303    free(s);
1304 
1305    s = stb_tokens_allowempty("foo == ba*r", "#=*", NULL);
1306    c(!strcmp(s[0], "foo "), "stb_tokens_allowempty() 1");
1307    c(!strcmp(s[1], ""    ), "stb_tokens_allowempty() 2");
1308    c(!strcmp(s[2], " ba"),  "stb_tokens_allowempty() 3");
1309    c(!strcmp(s[3], "r"),    "stb_tokens_allowempty() 4");
1310    c(s[4] == 0,             "stb_tokens_allowempty() 5");
1311    free(s);
1312 
1313    s = stb_tokens_stripwhite("foo == ba*r", "#=*", NULL);
1314    c(!strcmp(s[0], "foo"),  "stb_tokens_stripwhite() 1");
1315    c(!strcmp(s[1], ""   ),  "stb_tokens_stripwhite() 2");
1316    c(!strcmp(s[2], "ba"),   "stb_tokens_stripwhite() 3");
1317    c(!strcmp(s[3], "r"),    "stb_tokens_stripwhite() 4");
1318    c(s[4] == 0,             "stb_tokens_stripwhite() 5");
1319    free(s);
1320 
1321    s = stb_tokens_quoted("foo =\"=\" ba*\"\"r \" foo\" bah    ", "#=*", NULL);
1322    c(!strcmp(s[0], "foo"),  "stb_tokens_quoted() 1");
1323    c(!strcmp(s[1], "= ba"), "stb_tokens_quoted() 2");
1324    c(!strcmp(s[2], "\"r  foo bah"),  "stb_tokens_quoted() 3");
1325    c(s[3] == 0,             "stb_tokens_quoted() 4");
1326    free(s);
1327 
1328 
1329    p = stb_file("stb.h", &len2);
1330    if (p) {
1331       uint32 z = stb_adler32_old(1, p, len2);
1332       uint32 x = stb_adler32    (1, p, len2);
1333       c(z == x, "stb_adler32() 1");
1334       memset(p,0xff,len2);
1335       z = stb_adler32_old((65520<<16) + 65520, p, len2);
1336       x = stb_adler32    ((65520<<16) + 65520, p, len2);
1337       c(z == x, "stb_adler32() 2");
1338       free(p);
1339    }
1340 
1341    //   stb_hheap
1342    {
1343       #define HHEAP_COUNT  100000
1344       void **p = malloc(sizeof(*p) * HHEAP_COUNT);
1345       int i, j;
1346       #if 0
1347       stb_hheap *h2, *h = stb_newhheap(sizeof(struct1),0);
1348 
1349       for (i=0; i < HHEAP_COUNT; ++i)
1350          p[i] = stb_halloc(h);
1351       stb_shuffle(p, HHEAP_COUNT, sizeof(*p), stb_rand());
1352       for (i=0; i < HHEAP_COUNT; ++i)
1353          stb_hfree(p[i]);
1354 
1355       c(h->num_alloc == 0, "stb_hheap 1");
1356       stb_delhheap(h);
1357 
1358       h = stb_newhheap(sizeof(struct1),0);
1359       h2 = stb_newhheap(sizeof(struct2),8);
1360 
1361       for (i=0; i < HHEAP_COUNT; ++i) {
1362          if (i & 1)
1363             p[i] = stb_halloc(h);
1364          else {
1365             p[i] = stb_halloc(h2);
1366             c((((int) p[i]) & 4) == 0, "stb_hheap 2");
1367          }
1368       }
1369 
1370       stb_shuffle(p, HHEAP_COUNT, sizeof(*p), stb_rand());
1371       for (i=0; i < HHEAP_COUNT; ++i)
1372          stb_hfree(p[i]);
1373 
1374       c(h->num_alloc == 0, "stb_hheap 3");
1375       c(h2->num_alloc == 0, "stb_hheap 4");
1376 
1377       stb_delhheap(h);
1378       stb_delhheap(h2);
1379       #else
1380       for (i=0; i < HHEAP_COUNT; ++i)
1381          p[i] = malloc(32);
1382       stb_shuffle(p, HHEAP_COUNT, sizeof(*p), stb_rand());
1383       for (i=0; i < HHEAP_COUNT; ++i)
1384          free(p[i]);
1385       #endif
1386 
1387       // now use the same array of pointers to do pointer set operations
1388       for (j=100; j < HHEAP_COUNT; j += 25000) {
1389          stb_ps *ps = NULL;
1390          for (i=0; i < j; ++i)
1391             ps = stb_ps_add(ps, p[i]);
1392 
1393          for (i=0; i < HHEAP_COUNT; ++i)
1394             c(stb_ps_find(ps, p[i]) == (i < j), "stb_ps 1");
1395          c(stb_ps_count(ps) == j, "stb_ps 1b");
1396 
1397          for (i=j; i < HHEAP_COUNT; ++i)
1398             ps = stb_ps_add(ps, p[i]);
1399 
1400          for (i=0; i < j; ++i)
1401             ps = stb_ps_remove(ps, p[i]);
1402 
1403          for (i=0; i < HHEAP_COUNT; ++i)
1404             c(stb_ps_find(ps, p[i]) == !(i < j), "stb_ps 2");
1405 
1406          stb_ps_delete(ps);
1407       }
1408 
1409       #define HHEAP_COUNT2   100
1410       // now use the same array of pointers to do pointer set operations
1411       for (j=1; j < 40; ++j) {
1412          stb_ps *ps = NULL;
1413          for (i=0; i < j; ++i)
1414             ps = stb_ps_add(ps, p[i]);
1415 
1416          for (i=0; i < HHEAP_COUNT2; ++i)
1417             c(stb_ps_find(ps, p[i]) == (i < j), "stb_ps 3");
1418          c(stb_ps_count(ps) == j, "stb_ps 3b");
1419 
1420          for (i=j; i < HHEAP_COUNT2; ++i)
1421             ps = stb_ps_add(ps, p[i]);
1422 
1423          for (i=0; i < j; ++i)
1424             ps = stb_ps_remove(ps, p[i]);
1425 
1426          for (i=0; i < HHEAP_COUNT2; ++i)
1427             c(stb_ps_find(ps, p[i]) == !(i < j), "stb_ps 4");
1428 
1429          stb_ps_delete(ps);
1430       }
1431 
1432       free(p);
1433    }
1434 
1435 
1436    n = test_compression(tc, sizeof(tc));
1437    c(n >= 0, "stb_compress()/stb_decompress() 1");
1438 
1439    p = stb_file("stb.h", &len2);
1440    if (p) {
1441       FILE *f = fopen("data/stb_h.z", "wb");
1442       if (stb_compress_stream_start(f)) {
1443          int i;
1444          void *q;
1445          int len3;
1446 
1447          for (i=0; i < len2; ) {
1448             int n = stb_rand() % 10;
1449             if (n <= 6) n = 1 + stb_rand()%16;
1450             else if (n <= 8) n = 20 + stb_rand() % 1000;
1451             else n = 15000;
1452             if (i + n > len2) n = len2 - i;
1453             stb_write(p + i, n);
1454             i += n;
1455          }
1456          stb_compress_stream_end(1);
1457 
1458          q = stb_decompress_fromfile("data/stb_h.z", &len3);
1459          c(len3 == len2, "stb_compress_stream 2");
1460          if (len2 == len3)
1461             c(!memcmp(p,q,len2), "stb_compress_stream 3");
1462          if (q) free(q);
1463       } else {
1464          c(0, "stb_compress_stream 1");
1465       }
1466 
1467       free(p);
1468       stb_compress_window(65536*4);
1469    }
1470 
1471    p = stb_file("stb.h", &len2);
1472    if (p) {
1473       n = test_compression(p, len2);
1474       c(n >= 0, "stb_compress()/stb_decompress() 2");
1475       #if 0
1476       n = test_en_compression(p, len2);
1477       c(n >= 0, "stb_en_compress()/stb_en_decompress() 2");
1478       #endif
1479       free(p);
1480    } else {
1481       fprintf(stderr, "No stb.h to compression test.\n");
1482    }
1483 
1484    p = stb_file("data/test.bmp", &len2);
1485    if (p) {
1486       n = test_compression(p, len2);
1487       c(n == 106141, "stb_compress()/stb_decompress() 4");
1488       #if 0
1489       n = test_en_compression(p, len2);
1490       c(n >= 0, "stb_en_compress()/stb_en_decompress() 4");
1491       #endif
1492       free(p);
1493    }
1494 
1495    // the hardcoded compressed lengths being verified _could_
1496    // change if you changed the compressor parameters; but pure
1497    // performance optimizations shouldn't change them
1498    p = stb_file("data/cantrbry.zip", &len2);
1499    if (p) {
1500       n = test_compression(p, len2);
1501       c(n == 642787, "stb_compress()/stb_decompress() 3");
1502       #if 0
1503       n = test_en_compression(p, len2);
1504       c(n >= 0, "stb_en_compress()/stb_en_decompress() 3");
1505       #endif
1506       free(p);
1507    }
1508 
1509    p = stb_file("data/bible.txt", &len2);
1510    if (p) {
1511       n = test_compression(p, len2);
1512       c(n == 2022520, "stb_compress()/stb_decompress() 4");
1513       #if 0
1514       n = test_en_compression(p, len2);
1515       c(n >= 0, "stb_en_compress()/stb_en_decompress() 4");
1516       #endif
1517       free(p);
1518    }
1519 
1520    {
1521       int len = 1 << 25, o=0; // 32MB
1522       char *buffer = malloc(len);
1523       int i;
1524       for (i=0; i < 8192; ++i)
1525          buffer[o++] = (char) stb_rand();
1526       for (i=0; i < (1 << 15); ++i)
1527          buffer[o++] = 1;
1528       for (i=0; i < 64; ++i)
1529          buffer[o++] = buffer[i];
1530       for (i=0; i < (1 << 21); ++i)
1531          buffer[o++] = 2;
1532       for (i=0; i < 64; ++i)
1533          buffer[o++] = buffer[i];
1534       for (i=0; i < (1 << 21); ++i)
1535          buffer[o++] = 3;
1536       for (i=0; i < 8192; ++i)
1537          buffer[o++] = buffer[i];
1538       for (i=0; i < (1 << 21); ++i)
1539          buffer[o++] = 4;
1540       assert(o < len);
1541       stb_compress_window(1 << 24);
1542       i = test_compression(buffer, len);
1543       c(n >= 0, "stb_compress() 6");
1544       free(buffer);
1545    }
1546 
1547    #ifdef STB_THREADS
1548    stb_thread_cleanup();
1549    #endif
1550    stb_ischar(0,NULL);
1551    stb_wrapper_listall(dumpfunc);
1552    printf("Memory still in use: %d allocations of %d bytes.\n", alloc_num, alloc_size);
1553 
1554    // force some memory checking
1555    for (n=1; n < 20; ++n)
1556       malloc(1 << n);
1557 
1558    printf("Finished stb.c with %d errors.\n", count);
1559 
1560    #ifdef _MSC_VER
1561    if (count)
1562       __asm int 3;
1563    #endif
1564 
1565    return 0;
1566 }
1567 
1568 #endif
1569 
1570 
1571 
1572 
1573 
1574 // NIST test vectors
1575 
1576 struct
1577 {
1578    int length;
1579    char *message;
1580    char *digest;
1581 } sha1_tests[] =
1582 {
1583 {   24,
1584 "616263",
1585 "a9993e364706816aba3e25717850c26c9cd0d89d",
1586 },{
1587    1304,
1588 "ec29561244ede706b6eb30a1c371d74450a105c3f9735f7fa9fe38cf67f304a5736a106e"
1589 "92e17139a6813b1c81a4f3d3fb9546ab4296fa9f722826c066869edacd73b25480351858"
1590 "13e22634a9da44000d95a281ff9f264ecce0a931222162d021cca28db5f3c2aa24945ab1"
1591 "e31cb413ae29810fd794cad5dfaf29ec43cb38d198fe4ae1da2359780221405bd6712a53"
1592 "05da4b1b737fce7cd21c0eb7728d08235a9011",
1593 "970111c4e77bcc88cc20459c02b69b4aa8f58217",
1594 },{
1595    2096,
1596 "5fc2c3f6a7e79dc94be526e5166a238899d54927ce470018fbfd668fd9dd97cbf64e2c91"
1597 "584d01da63be3cc9fdff8adfefc3ac728e1e335b9cdc87f069172e323d094b47fa1e652a"
1598 "fe4d6aa147a9f46fda33cacb65f3aa12234746b9007a8c85fe982afed7815221e43dba55"
1599 "3d8fe8a022cdac1b99eeeea359e5a9d2e72e382dffa6d19f359f4f27dc3434cd27daeeda"
1600 "8e38594873398678065fbb23665aba9309d946135da0e4a4afdadff14db18e85e71dd93c"
1601 "3bf9faf7f25c8194c4269b1ee3d9934097ab990025d9c3aaf63d5109f52335dd3959d38a"
1602 "e485050e4bbb6235574fc0102be8f7a306d6e8de6ba6becf80f37415b57f9898a5824e77"
1603 "414197422be3d36a6080",
1604    "0423dc76a8791107d14e13f5265b343f24cc0f19",
1605 },{
1606    2888,
1607 "0f865f46a8f3aed2da18482aa09a8f390dc9da07d51d1bd10fe0bf5f3928d5927d08733d"
1608 "32075535a6d1c8ac1b2dc6ba0f2f633dc1af68e3f0fa3d85e6c60cb7b56c239dc1519a00"
1609 "7ea536a07b518ecca02a6c31b46b76f021620ef3fc6976804018380e5ab9c558ebfc5cb1"
1610 "c9ed2d974722bf8ab6398f1f2b82fa5083f85c16a5767a3a07271d67743f00850ce8ec42"
1611 "8c7f22f1cf01f99895c0c844845b06a06cecb0c6cf83eb55a1d4ebc44c2c13f6f7aa5e0e"
1612 "08abfd84e7864279057abc471ee4a45dbbb5774afa24e51791a0eada11093b88681fe30b"
1613 "aa3b2e94113dc63342c51ca5d1a6096d0897b626e42cb91761058008f746f35465465540"
1614 "ad8c6b8b60f7e1461b3ce9e6529625984cb8c7d46f07f735be067588a0117f23e34ff578"
1615 "00e2bbe9a1605fde6087fb15d22c5d3ac47566b8c448b0cee40373e5ba6eaa21abee7136"
1616 "6afbb27dbbd300477d70c371e7b8963812f5ed4fb784fb2f3bd1d3afe883cdd47ef32bea"
1617 "ea",
1618    "6692a71d73e00f27df976bc56df4970650d90e45",
1619 },{
1620    3680,
1621 "4893f1c763625f2c6ce53aacf28026f14b3cd8687e1a1d3b60a81e80fcd1e2b038f9145a"
1622 "b64a0718f948f7c3c9ac92e3d86fb669a5257da1a18c776291653688338210a3242120f1"
1623 "01788e8acc9110db9258b1554bf3d26602516ea93606a25a7f566c0c758fb39ecd9d876b"
1624 "c5d8abc1c3205095382c2474cb1f8bbdb45c2c0e659cb0fc703ec607a5de6bcc7a28687d"
1625 "b1ee1c8f34797bb2441d5706d210df8c2d7d65dbded36414d063c117b52a51f7a4eb9cac"
1626 "0782e008b47459ed5acac0bc1f20121087f992ad985511b33c866d18e63f585478ee5a5e"
1627 "654b19d81231d98683ae3f0533565aba43dce408d7e3c4c6be11d8f05165f29c9dcb2030"
1628 "c4ee31d3a04e7421aa92c3231a1fc07e50e95fea7389a5e65891afaba51cf55e36a9d089"
1629 "bf293accb356d5d06547307d6e41456d4ed146a056179971c56521c83109bf922866186e"
1630 "184a99a96c7bb96df8937e35970e438412a2b8d744cf2ad87cb605d4232e976f9f151697"
1631 "76e4e5b6b786132c966b25fc56d815c56c819af5e159aa39f8a93d38115f5580cda93bc0"
1632 "73c30b39920e726fe861b72483a3f886269ab7a8eefe952f35d25c4eb7f443f4f3f26e43"
1633 "d51fb54591e6a6dad25fcdf5142033084e5624bdd51435e77dea86b8",
1634    "dc5859dd5163c4354d5d577b855fa98e37f04384",
1635 },{
1636    4472,
1637 "cf494c18a4e17bf03910631471bca5ba7edea8b9a63381e3463517961749848eb03abefd"
1638 "4ce676dece3740860255f57c261a558aa9c7f11432f549a9e4ce31d8e17c79450ce2ccfc"
1639 "148ad904aedfb138219d7052088520495355dadd90f72e6f69f9c6176d3d45f113f275b7"
1640 "fbc2a295784d41384cd7d629b23d1459a22e45fd5097ec9bf65fa965d3555ec77367903c"
1641 "32141065fc24da5c56963d46a2da3c279e4035fb2fb1c0025d9dda5b9e3443d457d92401"
1642 "a0d3f58b48469ecb1862dc975cdbe75ca099526db8b0329b03928206f084c633c04eef5e"
1643 "8e377f118d30edf592504be9d2802651ec78aeb02aea167a03fc3e23e5fc907c324f283f"
1644 "89ab37e84687a9c74ccf055402db95c29ba2c8d79b2bd4fa96459f8e3b78e07e923b8119"
1645 "8267492196ecb71e01c331f8df245ec5bdf8d0e05c91e63bb299f0f6324895304dda721d"
1646 "39410458f117c87b7dd6a0ee734b79fcbe482b2c9e9aa0cef03a39d4b0c86de3bc34b4aa"
1647 "dabfa373fd2258f7c40c187744d237080762382f547a36adb117839ca72f8ebbc5a20a07"
1648 "e86f4c8bb923f5787698d278f6db0040e76e54645bb0f97083995b34b9aa445fc4244550"
1649 "58795828dd00c32471ec402a307f5aa1b37b1a86d6dae3bcbfbe9ba41cab0beeabf489af"
1650 "0073d4b3837d3f14b815120bc3602d072b5aeefcdec655fe756b660eba7dcf34675acbce"
1651 "317746270599424b9248791a0780449c1eabbb9459cc1e588bfd74df9b1b711c85c09d8a"
1652 "a171b309281947e8f4b6ac438753158f4f36fa",
1653    "4c17926feb6e87f5bca7890d8a5cde744f231dab",
1654 },{
1655    5264,
1656 "8236153781bd2f1b81ffe0def1beb46f5a70191142926651503f1b3bb1016acdb9e7f7ac"
1657 "ced8dd168226f118ff664a01a8800116fd023587bfba52a2558393476f5fc69ce9c65001"
1658 "f23e70476d2cc81c97ea19caeb194e224339bcb23f77a83feac5096f9b3090c51a6ee6d2"
1659 "04b735aa71d7e996d380b80822e4dfd43683af9c7442498cacbea64842dfda238cb09992"
1660 "7c6efae07fdf7b23a4e4456e0152b24853fe0d5de4179974b2b9d4a1cdbefcbc01d8d311"
1661 "b5dda059136176ea698ab82acf20dd490be47130b1235cb48f8a6710473cfc923e222d94"
1662 "b582f9ae36d4ca2a32d141b8e8cc36638845fbc499bce17698c3fecae2572dbbd4705524"
1663 "30d7ef30c238c2124478f1f780483839b4fb73d63a9460206824a5b6b65315b21e3c2f24"
1664 "c97ee7c0e78faad3df549c7ca8ef241876d9aafe9a309f6da352bec2caaa92ee8dca3928"
1665 "99ba67dfed90aef33d41fc2494b765cb3e2422c8e595dabbfaca217757453fb322a13203"
1666 "f425f6073a9903e2dc5818ee1da737afc345f0057744e3a56e1681c949eb12273a3bfc20"
1667 "699e423b96e44bd1ff62e50a848a890809bfe1611c6787d3d741103308f849a790f9c015"
1668 "098286dbacfc34c1718b2c2b77e32194a75dda37954a320fa68764027852855a7e5b5274"
1669 "eb1e2cbcd27161d98b59ad245822015f48af82a45c0ed59be94f9af03d9736048570d6e3"
1670 "ef63b1770bc98dfb77de84b1bb1708d872b625d9ab9b06c18e5dbbf34399391f0f8aa26e"
1671 "c0dac7ff4cb8ec97b52bcb942fa6db2385dcd1b3b9d567aaeb425d567b0ebe267235651a"
1672 "1ed9bf78fd93d3c1dd077fe340bb04b00529c58f45124b717c168d07e9826e33376988bc"
1673 "5cf62845c2009980a4dfa69fbc7e5a0b1bb20a5958ca967aec68eb31dd8fccca9afcd30a"
1674 "26bab26279f1bf6724ff",
1675    "11863b483809ef88413ca9b0084ac4a5390640af",
1676 },{
1677    6056,
1678 "31ec3c3636618c7141441294fde7e72366a407fa7ec6a64a41a7c8dfda150ca417fac868"
1679 "1b3c5be253e3bff3ab7a5e2c01b72790d95ee09b5362be835b4d33bd20e307c3c702aa15"
1680 "60cdc97d190a1f98b1c78e9230446e31d60d25155167f73e33ed20cea27b2010514b57ba"
1681 "b05ed16f601e6388ea41f714b0f0241d2429022e37623c11156f66dd0fa59131d8401dba"
1682 "f502cffb6f1d234dcb53e4243b5cf9951688821586a524848123a06afa76ab8058bcfa72"
1683 "27a09ce30d7e8cb100c8877bb7a81b615ee6010b8e0daced7cc922c971940b757a9107de"
1684 "60b8454dda3452e902092e7e06faa57c20aadc43c8012b9d28d12a8cd0ba0f47ab4b377f"
1685 "316902e6dff5e4f2e4a9b9de1e4359f344e66d0565bd814091e15a25d67d89cf6e30407b"
1686 "36b2654762bbe53a6f204b855a3f9108109e351825cf9080c89764c5f74fb4afef89d804"
1687 "e7f7d097fd89d98171d63eaf11bd719df44c5a606be0efea358e058af2c265b2da2623fd"
1688 "afc62b70f0711d0150625b55672060cea6a253c590b7db1427a536d8a51085756d1e6ada"
1689 "41d9d506b5d51bcae41249d16123b7df7190e056777a70feaf7d9f051fdbbe45cbd60fc6"
1690 "295dda84d4ebbd7284ad44be3ee3ba57c8883ead603519b8ad434e3bf630734a9243c00a"
1691 "a07366b8f88621ec6176111f0418c66b20ff9a93009f43432aaea899dad0f4e3ae72e9ab"
1692 "a3f678f140118eb7117230c357a5caa0fe36c4e6cf1957bbe7499f9a68b0f1536e476e53"
1693 "457ed826d9dea53a6ded52e69052faaa4d3927b9a3f9e8b435f424b941bf2d9cd6849874"
1694 "42a44d5acaa0da6d9f390d1a0dd6c19af427f8bb7c082ae405a8dd535dea76aa360b4faa"
1695 "d786093e113424bb75b8cc66c41af637a7b2acdca048a501417919cf9c5cd3b2fa668860"
1696 "d08b6717eea6f125fa1b0bae1dbb52aafce8ae2deaf92aeb5be003fb9c09fedbc286ffb5"
1697 "e16ad8e07e725faa46ebc35500cf205fc03250075ddc050c263814b8d16d141db4ca289f"
1698 "386719b28a09a8e5934722202beb3429899b016dfeb972fee487cdd8d18f8a681042624f"
1699 "51",
1700    "f43937922444421042f76756fbed0338b354516f",
1701 },{
1702    6848,
1703 "21b9a9686ec200456c414f2e6963e2d59e8b57e654eced3d4b57fe565b51c9045c697566"
1704 "44c953178f0a64a6e44d1b46f58763c6a71ce4c373b0821c0b3927a64159c32125ec916b"
1705 "6edd9bf41c3d80725b9675d6a97c8a7e3b662fac9dbcf6379a319a805b5341a8d360fe00"
1706 "5a5c9ac1976094fea43566d66d220aee5901bd1f2d98036b2d27eb36843e94b2e5d1f09c"
1707 "738ec826de6e0034cf8b1dca873104c5c33704cae290177d491d65f307c50a69b5c81936"
1708 "a050e1fe2b4a6f296e73549323b6a885c3b54ee5eca67aa90660719126b590163203909e"
1709 "470608f157f033f017bcf48518bf17d63380dabe2bc9ac7d8efe34aedcae957aeb68f10c"
1710 "8ad02c4465f1f2b029d5fbb8e8538d18be294394b54b0ee6e67a79fce11731604f3ac4f8"
1711 "d6ffa9ef3d2081f3d1c99ca107a7bf3d624324a7978ec38af0bcd0d7ee568572328b212b"
1712 "9dc831efb7880e3f4d6ca7e25f8e80d73913fb8edfffd758ae4df61b4140634a92f49314"
1713 "6138ebdcdaa083ea72d52a601230aa6f77874dcad9479f5bcac3763662cc30cb99823c5f"
1714 "f469dcbd64c028286b0e579580fd3a17b56b099b97bf62d555798f7a250e08b0e4f238c3"
1715 "fcf684198bd48a68c208a6268be2bb416eda3011b523388bce8357b7f26122640420461a"
1716 "bcabcb5004519adfa2d43db718bce7d0c8f1b4645c89315c65df1f0842e5741244bba3b5"
1717 "10801d2a446818635d0e8ffcd80c8a6f97ca9f878793b91780ee18eb6c2b99ffac3c38ef"
1718 "b7c6d3af0478317c2b9c421247eba8209ea677f984e2398c7c243696a12df2164417f602"
1719 "d7a1d33809c865b73397550ff33fe116166ae0ddbccd00e2b6fc538733830ac39c328018"
1720 "bcb87ac52474ad3cce8780d6002e14c6734f814cb551632bcc31965c1cd23d048b9509a4"
1721 "e22ab88f76a6dba209d5dd2febd1413a64d32be8574a22341f2a14e4bd879abb35627ef1"
1722 "35c37be0f80843006a7cc7158d2bb2a71bf536b36de20ca09bb5b674e5c408485106e6fa"
1723 "966e4f2139779b46f6010051615b5b41cda12d206d48e436b9f75d7e1398a656abb0087a"
1724 "a0eb453368fc1ecc71a31846080f804d7b67ad6a7aa48579c3a1435eff7577f4e6004d46"
1725 "aac4130293f6f62ae6d50c0d0c3b9876f0728923a94843785966a27555dd3ce68602e7d9"
1726 "0f7c7c552f9bda4969ec2dc3e30a70620db6300e822a93e633ab9a7a",
1727    "5d4d18b24b877092188a44be4f2e80ab1d41e795",
1728 },{
1729    7640,
1730 "1c87f48f4409c3682e2cf34c63286dd52701b6c14e08669851a6dc8fa15530ad3bef692c"
1731 "7d2bf02238644561069df19bdec3bccae5311fce877afc58c7628d08d32d9bd2dc1df0a6"
1732 "24360e505944219d211f33bff62e9ff2342ac86070240a420ccaf14908e6a93c1b27b6e2"
1733 "0324e522199e83692805cc4c7f3ea66f45a490a50d4dd558aa8e052c45c1a5dfad452674"
1734 "edc7149024c09024913f004ceee90577ff3eaec96a1eebbdc98b440ffeb0cad9c6224efc"
1735 "9267d2c192b53dc012fb53010926e362ef9d4238d00df9399f6cbb9acc389a7418007a6c"
1736 "a926c59359e3608b548bdeece213f4e581d02d273781dffe26905ec161956f6dfe1c008d"
1737 "6da8165d08f8062eea88e80c055b499f6ff8204ffdb303ab132d9b0cba1e5675f3525bbe"
1738 "4cf2c3f2b00506f58336b36aefd865d37827f2fad7d1e59105b52f1596ea19f848037dfe"
1739 "dc9136e824ead5505e2995d4c0769276548835430667f333fc77375125b29c1b1535602c"
1740 "10fe161864f49a98fc274ae7335a736be6bf0a98cd019d120b87881103f86c0a6efadd8c"
1741 "aa405b6855c384141b4f8751cc42dc0cb2913382210baaa84fe242ca66679472d815c08b"
1742 "f3d1a7c6b5705a3de17ad157522de1eb90c568a8a1fbcbb422cca293967bb14bfdd91bc5"
1743 "a9c4d2774dee524057e08f937f3e2bd8a04ced0fc7b16fb78a7b16ee9c6447d99e53d846"
1744 "3726c59066af25c317fc5c01f5dc9125809e63a55f1cd7bdf7f995ca3c2655f4c7ab940f"
1745 "2aa48bc3808961eb48b3a03c731ce627bb67dd0037206c5f2c442fc72704258548c6a9db"
1746 "e16da45e40da009dc8b2600347620eff8361346116b550087cb9e2ba6b1d6753622e8b22"
1747 "85589b90a8e93902aa17530104455699a1829efef153327639b2ae722d5680fec035575c"
1748 "3b48d9ec8c8e9550e15338cc76b203f3ab597c805a8c6482676deabc997a1e4ba857a889"
1749 "97ceba32431443c53d4d662dd5532aa177b373c93bf93122b72ed7a3189e0fa171dfabf0"
1750 "520edf4b9d5caef595c9a3a13830c190cf84bcf9c3596aadb2a674fbc2c951d135cb7525"
1751 "3ee6c59313444f48440a381e4b95f5086403beb19ff640603394931f15d36b1cc9f3924f"
1752 "794c965d4449bfbdd8b543194335bdf70616dc986b49582019ac2bf8e68cfd71ec67e0aa"
1753 "dff63db39e6a0ef207f74ec6108fae6b13f08a1e6ae01b813cb7ee40961f95f5be189c49"
1754 "c43fbf5c594f5968e4e820a1d38f105f2ff7a57e747e4d059ffb1d0788b7c3c772b9bc1f"
1755 "e147c723aca999015230d22c917730b935e902092f83e0a8e6db9a75d2626e0346e67e40"
1756 "8d5b815439dab8ccb8ea23f828fff6916c4047",
1757    "32e0f5d40ceec1fbe45ddd151c76c0b3fef1c938",
1758 },{
1759    8432,
1760 "084f04f8d44b333dca539ad2f45f1d94065fbb1d86d2ccf32f9486fe98f7c64011160ec0"
1761 "cd66c9c7478ed74fde7945b9c2a95cbe14cedea849978cc2d0c8eb0df48d4834030dfac2"
1762 "b043e793b6094a88be76b37f836a4f833467693f1aa331b97a5bbc3dbd694d96ce19d385"
1763 "c439b26bc16fc64919d0a5eab7ad255fbdb01fac6b2872c142a24aac69b9a20c4f2f07c9"
1764 "923c9f0220256b479c11c90903193d4e8f9e70a9dbdf796a49ca5c12a113d00afa844694"
1765 "de942601a93a5c2532031308ad63c0ded048633935f50a7e000e9695c1efc1e59c426080"
1766 "a7d1e69a93982a408f1f6a4769078f82f6e2b238b548e0d4af271adfa15aa02c5d7d7052"
1767 "6e00095ffb7b74cbee4185ab54385f2707e8362e8bd1596937026f6d95e700340b6338ce"
1768 "ba1ee854a621ce1e17a016354016200b1f98846aa46254ab15b7a128b1e840f494b2cdc9"
1769 "daccf14107c1e149a7fc27d33121a5cc31a4d74ea6945816a9b7a83850dc2c11d26d767e"
1770 "ec44c74b83bfd2ef8a17c37626ed80be10262fe63cf9f804b8460c16d62ae63c8dd0d124"
1771 "1d8aaac5f220e750cb68d8631b162d80afd6b9bf929875bf2e2bc8e2b30e05babd8336be"
1772 "31e41842673a66a68f0c5acd4d7572d0a77970f42199a4da26a56df6aad2fe420e0d5e34"
1773 "448eb2ed33afbfb35dffaba1bf92039df89c038bae3e11c02ea08aba5240c10ea88a45a1"
1774 "d0a8631b269bec99a28b39a3fc5b6b5d1381f7018f15638cc5274ab8dc56a62b2e9e4fee"
1775 "f172be20170b17ec72ff67b81c15299f165810222f6a001a281b5df1153a891206aca89e"
1776 "e7baa761a5af7c0493a3af840b9219e358b1ec1dd301f35d4d241b71ad70337bda42f0ea"
1777 "dc9434a93ed28f96b6ea073608a314a7272fefd69d030cf22ee6e520b848fa705ed6160f"
1778 "e54bd3bf5e89608506e882a16aced9c3cf80657cd03749f34977ced9749caa9f52b683e6"
1779 "4d96af371b293ef4e5053a8ea9422df9dd8be45d5574730f660e79bf4cbaa5f3c93a79b4"
1780 "0f0e4e86e0fd999ef4f26c509b0940c7a3eaf1f87c560ad89aff43cd1b9d4863aa3ebc41"
1781 "a3dd7e5b77372b6953dae497fc7f517efe99e553052e645e8be6a3aeb362900c75ce712d"
1782 "fcba712c4c25583728db9a883302939655ef118d603e13fcf421d0cea0f8fb7c49224681"
1783 "d013250defa7d4fd64b69b0b52e95142e4cc1fb6332486716a82a3b02818b25025ccd283"
1784 "198b07c7d9e08519c3c52c655db94f423912b9dc1c95f2315e44be819477e7ff6d2e3ccd"
1785 "daa6da27722aaadf142c2b09ce9472f7fd586f68b64d71fc653decebb4397bf7af30219f"
1786 "25c1d496514e3c73b952b8aa57f4a2bbf7dcd4a9e0456aaeb653ca2d9fa7e2e8a532b173"
1787 "5c4609e9c4f393dd70901393e898ed704db8e9b03b253357f333a66aba24495e7c3d1ad1"
1788 "b5200b7892554b59532ac63af3bdef590b57bd5df4fbf38d2b3fa540fa5bf89455802963"
1789 "036bd173fe3967ed1b7d",
1790    "ee976e4ad3cad933b283649eff9ffdb41fcccb18",
1791 },{
1792    9224,
1793 "bd8320703d0cac96a96aeefa3abf0f757456bf42b3e56f62070fc03e412d3b8f4e4e427b"
1794 "c47c4600bb423b96de6b4910c20bc5c476c45feb5b429d4b35088813836fa5060ceb26db"
1795 "bb9162e4acd683ef879a7e6a0d6549caf0f0482de8e7083d03ed2f583de1b3ef505f4b2c"
1796 "cd8a23d86c09d47ba05093c56f21a82c815223d777d0cabb7ee4550423b5deb6690f9394"
1797 "1862ae41590ea7a580dda79229d141a786215d75f77e74e1db9a03c9a7eb39eb35adf302"
1798 "5e26eb31ca2d2ca507edca77d9e7cfcfd136784f2117a2afafa87fa468f08d07d720c933"
1799 "f61820af442d260d172a0a113494ca169d33a3aeaacdcc895b356398ed85a871aba769f6"
1800 "071abd31e9f2f5834721d0fef6f6ee0fc0e38760b6835dfcc7dbefb592e1f0c3793af7ad"
1801 "f748786d3364f3cfd5686b1a18711af220e3637d8fad08c553ce9d5dc1183d48e8337b16"
1802 "1fe69b50e1920316dbffec07425b5d616a805a699576590e0939f5c965bce6c7342d314a"
1803 "c37b9c4d30166567c4f633f182de4d6b00e20a1c762789f915eaa1c89ac31b85222b1f05"
1804 "403dedd94db9ce75ff4e49923d1999d032695fa0a1c595617830c3c9a7ab758732fcec26"
1805 "85ae14350959b6a5f423ef726587e186b055a8daf6fa8fdefa02841b2fdbca1616dcee78"
1806 "c685fc6dcc09f24a36097572eba3c37a3eabe98bc23836085f63ef71a54b4488615d83b2"
1807 "6ed28c9fce78852df9b6cf8a75ca3899a7567298e91bc4ffdd04ffab0066b43b8286a4bb"
1808 "555c78808496b252c6e0e4d153631f11f68baf88630e052acc2af5d2af2e22e4f23bb630"
1809 "314c561a577455f86b6727bcad3c19d3e271404dec30af3d9dd0ed63cd9fa708aadfa12a"
1810 "500ef2d99a6b71e137b56ba90036975b88004b45f577ef800f0fb3cf97577dc9da37253b"
1811 "8675e5c8bb7e0bd26564f19eca232fb25f280f82e014424c9fbdd1411d7556e5d7906bb8"
1812 "62206316ba03385cd820c54c82ed35b36735bc486b1885d84053eba036c1ebfb5422d93d"
1813 "a71c53deda7f74db07cd4959cdfa898ba37080d76b564d344b124dd7b80cd70ed3b52a6c"
1814 "f9c9a32695d134bd39eb11ddeecdac86c808e469bd8a7995b667c452e7d9a54d5c85bcf6"
1815 "d5ffdc27d491bc06f438f02c7cf018073431587c78ba08d18a8daccb2d3b26136f612ade"
1816 "c673f3cd5eb83412b29652d55a10d0d6238d0b5365db272c917349450aff062c36191cfc"
1817 "d45660819083f89cd42ecae9e26934a020cafeb9b2b68d544edf59574c0ca159fd195dbf"
1818 "3e3e74244d942fffdbd4ed7f626219bab88b5a07e50b09a832d3e8ad82091114e54f2c35"
1819 "6b48e55e36589ebad3ac6077cb7b1827748b00670df65bbf0a2e65caad3f8a97d654d64e"
1820 "1c7dad171cafbc37110d2f7ca66524dc08fe60593e914128bd95f41137bfe819b5ca835f"
1821 "e5741344b5c907ce20a35f4f48726141c6398e753ed9d46d3692050628c78859d5014fe4"
1822 "dd3708e58d4d9807f8dac540492e32fa579491717ad4145c9efc24cf95605660b2e09b89"
1823 "9369b74d3ebff41e707917ff314d93e6ac8dfd643ef2c087cd9912005b4b2681da01a369"
1824 "42a756a3e22123cbf38c429373c6a8663130c24b24b2690b000013960b1c46a32d1d5397"
1825 "47",
1826    "2df09b10933afedfcd3f2532dfd29e7cb6213859",
1827 },{
1828    10016,
1829 "7a94978bec7f5034b12c96b86498068db28cd2726b676f54d81d8d7350804cc106bead8a"
1830 "252b465a1f413b1c41e5697f8cece49ec0dea4dfb9fa7b1bfe7a4a00981875b420d094bb"
1831 "1ce86c1b8c2e1dbebf819c176b926409fdec69042e324e71d7a8d75006f5a11f512811fe"
1832 "6af88a12f450e327950b18994dfc3f740631beda6c78bca5fe23d54e6509120e05cd1842"
1833 "d3639f1466cf26585030e5b4aefe0404fe900afc31e1980f0193579085342f1803c1ba27"
1834 "0568f80eaf92440c4f2186b736f6ab9dc7b7522ccdcfc8cf12b6375a2d721aa89b5ef482"
1835 "112a42c31123aebabcb485d0e72d6b6b70c44e12d2da98d1f87fa9df4f37847e1ffec823"
1836 "1b8be3d737d282ddb9cc4b95937acfa0f028ba450def4d134a7d0fc88119bf7296e18cd4"
1837 "4f56890b661b5b72ddfa34c29228067e13caf08eb3b7fd29de800df9a9ae137aad4a81a4"
1838 "16a301c9f74b66c0e163e243b3187996b36eb569de3d9c007d78df91f9b554eef0eaa663"
1839 "88754ce20460b75d95e2d0747229a1502a5652cf39ca58e1daa0e9321d7ab3093981cd70"
1840 "23a7ee956030dd70177028a66ad619ad0629e631f91228b7c5db8e81b276d3b168c1edb1"
1841 "bc0888d1cbcbb23245c2d8e40c1ff14bfe13f9c70e93a1939a5c45eef9351e795374b9e1"
1842 "b5c3a7bd642477ba7233e1f590ab44a8232c53099a3c0a6ffe8be8b7ca7b58e6fedf700f"
1843 "6f03dd7861ee1ef857e3f1a32a2e0baa591d0c7ca04cb231cc254d29cda873f00d68f465"
1844 "00d6101cfdc2e8004c1f333d8007325d06ffe6b0ff7b80f24ba51928e65aa3cb78752028"
1845 "27511207b089328bb60264595a2cebfc0b84d9899f5eca7ea3e1d2f0f053b4e67f975500"
1846 "7ff3705ca4178ab9c15b29dd99494135f35befbcec05691d91f6361cad9c9a32e0e65577"
1847 "f14d8dc66515081b51d09e3f6c25eea868cf519a83e80c935968cae6fce949a646ad53c5"
1848 "6ee1f07dda23daef3443310bc04670afedb1a0132a04cb64fa84b4af4b3dc501044849cd"
1849 "dd4adb8d733d1eac9c73afa4f7d75864c87787f4033ffe5ba707cbc14dd17bd1014b8b61"
1850 "509c1f55a25cf6c0cbe49e4ddcc9e4de3fa38f7203134e4c7404ee52ef30d0b3f4e69bcc"
1851 "7d0b2e4d8e60d9970e02cc69d537cfbc066734eb9f690a174e0194ca87a6fadad3883d91"
1852 "6bd1700a052b26deee832701590d67e6f78938eac7c4beef3061a3474dd90dd588c1cd6e"
1853 "6a4cda85b110fd08a30dcd85a3ebde910283366a17a100db920885600db7578be46bcfa6"
1854 "4765ba9a8d6d5010cb1766d5a645e48365ed785e4b1d8c7c233c76291c92ef89d70bc77f"
1855 "bf37d7ce9996367e5b13b08242ce73971f1e0c6ff2d7920fb9c821768a888a7fe0734908"
1856 "33efb854cbf482aed5cb594fb715ec82a110130664164db488666d6198279006c1aa521f"
1857 "9cf04250476c934eba0914fd586f62d6c5825b8cf82cd7ef915d93106c506ea6760fd8b0"
1858 "bf39875cd1036b28417de54783173446026330ef701c3a6e5b6873b2025a2c1666bb9e41"
1859 "a40adb4a81c1052047dabe2ad092df2ae06d6d67b87ac90be7d826ca647940c4da264cad"
1860 "43c32a2bb8d5e27f87414e6887561444a80ed879ce91af13e0fbd6af1b5fa497ad0cbd2e"
1861 "7f0f898f52f9e4710de2174e55ad07c45f8ead3b02cac6c811becc51e72324f2439099a0"
1862 "5740090c1b165ecae7dec0b341d60a88f46d7ad8624aac231a90c93fad61fcfbbea12503"
1863 "59fcd203862a6b0f1d71ac43db6c58a6b60c2c546edc12dd658998e8",
1864    "f32e70862a16e3e8b199e9d81a9949d66f812cad",
1865 },{
1866    10808,
1867 "88dd7f273acbe799219c23184782ac0b07bade2bc46b4f8adbd25ed3d59c0fd3e2931638"
1868 "837d31998641bbb7374c7f03d533ca60439ac4290054ff7659cc519bdda3dff2129a7bdb"
1869 "66b3300068931ade382b7b813c970c8e15469187d25cb04b635403dc50ea6c65ab38a97c"
1870 "431f28a41ae81c16192bd0c103f03b8fa815d6ea5bf0aa7fa534ad413b194eb12eb74f5d"
1871 "62b3d3a7411eb8c8b09a261542bf6880acbdfb617a42e577009e482992253712f8d4c8bd"
1872 "1c386bad068c7aa10a22111640041f0c35dabd0de00ebf6cd82f89cbc49325df12419278"
1873 "ec0d5ebb670577b2fe0c3e0840c5dd0dc5b3da00669eed8ead380f968b00d42f4967faec"
1874 "c131425fce1f7edb01cbec7e96d3c26fa6390a659e0ab069ef3edadc07e077bb816f1b22"
1875 "98830a0fe2b393693bb79f41feca89577c5230e0a6c34b860dc1fdb10d85aa054481082c"
1876 "494779d59ba798fcd817116c3059b7831857d0364352b354ce3b960fbb61a1b8a04d47ca"
1877 "a0ead52a9bea4bada2646cdbaec211f391dac22f2c5b8748e36bfc3d4e8ea45131ca7f52"
1878 "af09df21babe776fcecbb5c5dfa352c790ab27b9a5e74242bbd23970368dbefd7c3c74d1"
1879 "61ae01c7e13c65b415f38aa660f51b69ea1c9a504fe1ad31987cb9b26a4db2c37d7b326c"
1880 "50dbc8c91b13925306ff0e6098532dee7282a99c3ddf99f9e1024301f76e31e58271870b"
1881 "d94b9356e892a6a798d422a48c7fd5b80efe855a4925cc93b8cf27badec5498338e2b538"
1882 "70758b45d3e7a2fa059ed88df320a65e0a7cf87fa7e63b74cea1b7371e221f8004726642"
1883 "30d4d57945a85b23d58f248c8cd06ccfabfa969ab8cb78317451fab60e4fdfa796e2e2a8"
1884 "b46405839a91266d37e8d38bae545fb4060c357923b86d62f5d59d7bef5af20fbb9c7fb4"
1885 "2c6fd487748ed3b9973dbf4b1f2c9615129fa10d21cc49c622842c37c01670be71715765"
1886 "a98814634efbdee66bf3420f284dbd3efafc8a9117a8b9a72d9b81aa53ded78c409f3f90"
1887 "bad6e30d5229e26f4f0cea7ee82c09e3b60ec0e768f35a7fb9007b869f9bfc49c518f648"
1888 "3c951d3b6e22505453266ec4e7fe6a80dbe6a2458a1d6cd93044f2955607412091009c7d"
1889 "6cd81648a3b0603c92bfdff9ec3c0104b07ed2105962ca7c56ede91cb932073c337665e2"
1890 "409387549f9a46da05bc21c5126bd4b084bc2c06ab1019c51df30581aa4464ab92978c13"
1891 "f6d7c7ac8d30a78f982b9a43181bbe3c3eb9f7a1230b3e53b98a3c2a028317827fbe8cf6"
1892 "ec5e3e6b2a084d517d472b25f72fab3a34415bba488f14e7f621cfa72396ba40890e8c60"
1893 "b04815601a0819c9bebc5e18b95e04be3f9c156bd7375d8cc8a97c13ce0a3976123419fa"
1894 "592631317ca638c1182be06886f9663d0e8e6839573df8f52219eeb5381482a6a1681a64"
1895 "173660bfbb6d98bf06ee31e601ee99b4b99b5671ed0253260b3077ed5b977c6a79b4ff9a"
1896 "08efd3cba5c39bec1a1e9807d40bbf0c988e0fd071cf2155ed7b014c88683cd869783a95"
1897 "4cbfced9c0e80c3a92d45b508985cbbc533ba868c0dc4f112e99400345cf7524e42bf234"
1898 "5a129e53da4051c429af2ef09aba33ae3c820ec1529132a203bd2b81534f2e865265f55c"
1899 "9395caf0e0d3e1762c95eaaec935e765dc963b3e0d0a04b28373ab560fa9ba5ca71ced5d"
1900 "17bb8b56f314f6f0d0bc8104b3f1835eca7eaac15adf912cf9a6945cfd1de392342dd596"
1901 "d67e7ffcb7e086a6c1ea318aa2e0c2b5c2da079078232c637de0d317a1f26640bc1dac5b"
1902 "e8699b53edc86e4bfdfaf797a2ae350bf4ea29790face675c4d2e85b8f37a694c91f6a14"
1903 "1fd561274392ee6ee1a14424d5c134a69bcb4333079400f03615952fc4c99bf03f5733a8"
1904 "dc71524269fc5c648371f5f3098314d9d10258",
1905    "08632c75676571a5db5971f5d99cb8de6bf1792a",
1906 },{
1907    11600,
1908 "85d43615942fcaa449329fd1fe9efb17545eb252cac752228f1e9d90955a3cf4e72cb116"
1909 "3c3d8e93ccb7e4826206ff58b3e05009ee82ab70943db3f18a32925d6d5aed1525c91673"
1910 "bd33846571af815b09bb236466807d935b5816a8be8e9becbe65d05d765bcc0bc3ae66c2"
1911 "5320ebe9fff712aa5b4931548b76b0fd58f6be6b83554435587b1725873172e130e1a3ca"
1912 "3d9d0425f4632d79cca0683780f266a0633230e4f3b25f87b0c390092f7b13c66ab5e31b"
1913 "5a58dbcac8dd26a0600bf85507057bb36e870dfae76da8847875a1a52e4596d5b4b0a211"
1914 "2435d27e1dc8dd5016d60feaf2838746d436a2983457b72e3357059b2bf1e9148bb0551a"
1915 "e2b27d5a39abd3d1a62c36331e26668e8baabc2a1ef218b5e7a51a9ca35795bcd54f403a"
1916 "188eafafb30d82896e45ddaea4f418629a1fb76a0f539c7114317bac1e2a8fba5a868bce"
1917 "40abd40f6b9ced3fa8c0329b4de5ca03cc84d75b8746ef31e6c8d0a0a79b4f747690928e"
1918 "be327f8bbe9374a0df4c39c845bf3322a49fda9455b36db5a9d6e4ea7d4326cf0e0f7cd8"
1919 "0ff74538f95cec01a38c188d1243221e9272ccc1053e30787c4cf697043cca6fc3730d2a"
1920 "431ecbf60d73ee667a3ab114c68d578c66dc1c659b346cb148c053980190353f6499bfef"
1921 "acfd1d73838d6dc1188c74dd72b690fb0481eee481a3fd9af1d4233f05d5ae33a7b10d7d"
1922 "d643406cb1f88d7dd1d77580dcbee6f757eeb2bfbcc940f2cddb820b2718264b1a64115c"
1923 "b85909352c44b13d4e70bbb374a8594d8af7f41f65b221bf54b8d1a7f8f9c7da563550cb"
1924 "2b062e7a7f21d5e07dd9da8d82e5a89074627597551c745718094c2eb316ca077526d27f"
1925 "9a589c461d891dc7cd1bc20ba3f464da53c97924219c87a0f683dfb3b3ac8793c59e78ac"
1926 "fac109439221ac599a6fd8d2754946d6bcba60784805f7958c9e34ff287ad1dbbc888848"
1927 "fa80cc4200dbb8c5e4224535906cbffdd0237a77a906c10ced740f9c0ce7821f2dbf8c8d"
1928 "7d41ecfcc7dfdc0846b98c78b765d01fb1eb15ff39149ab592e5dd1152665304bba85bbf"
1929 "4705751985aaaf31245361554d561a2337e3daeef58a826492fd886d5f18ef568c1e772e"
1930 "f6461170407695e3254eb7bf0c683811ddde5960140d959114998f08bdb24a104095987d"
1931 "3255d590e0dbd41ae32b1ae4f4ea4a4f011de1388034231e034756870c9f2d9f23788723"
1932 "27055a7de2b5e931dfb53e7780b6d4294bf094e08567025b026db9203b681565a1d52f30"
1933 "318d0ebe49471b22ba5fd62e1ed6c8966c99b853c9062246a1ace51ef7523c7bf93bef53"
1934 "d8a9cb96d6a04f0da1eca888df66e0380a72525a7ecc6115d08569a66248f6ba34e2341b"
1935 "fd01a78f7b3c1cfe0754e0d26cba2fa3f951ef14d5749ff8933b8aba06fa40fb570b467c"
1936 "54ce0d3f0bed21e998e5a36b3bc2f9e1ae29c4bab59c121af6fad67c0b45959cd6a86194"
1937 "14b90b4535fb95f86ca7e64502acc135eff4f8a3abe9dde84238fab7a7d402454a3f07ad"
1938 "ec05ec94b2891e0879037fae6acaa31dcecf3f85236ade946f5ad69ad4077beb65099285"
1939 "38ee09f2bc38e5704da67b5006b5e39cd765aafcd740c7dadb99d0c547126e1324610fcb"
1940 "7353dac2c110e803fca2b17485b1c4b78690bc4f867e6f043b2568889f67985a465a48eb"
1941 "ee915200589e915756d4968d26529c3ffe3dbe70e84c682ad08a0c68db571634fbb0210d"
1942 "c1b16b8b725886465c8c51f36a5e27d0f78e5643e051d3bddd512ce511f6bdf3dfe42759"
1943 "00c5fea9d248c2b3f36911ed0ff41a19f6445521f251724657ea8f795b3ead0928a1657f"
1944 "308dd7c7c1e7e490d9849df43becfa5cc25ed09ef614fd69ddc7e5e3147623901d647876"
1945 "fb60077ffc48c51ed7d02b35f6802e3715fc708a0c88b82fe9cba0a442d38d09ca5ae483"
1946 "21487bdef1794e7636bf7457dd2b51a391880c34d229438347e5fec8555fe263f08ba87b"
1947 "b16dcde529248a477628067d13d0cb3bf51776f4d39fb3fbc5f669e91019323e40360e4b"
1948 "78b6584f077bf9e03b66",
1949    "ab7213f6becb980d40dc89fbda0ca39f225a2d33",
1950 },{
1951    12392,
1952 "7ae3ca60b3a96be914d24980fb5652eb68451fed5fa47abe8e771db8301fbd5331e64753"
1953 "93d96a4010d6551701e5c23f7ecb33bec7dd7bade21381e9865d410c383a139cb4863082"
1954 "8e9372bd197c5b5788b6599853e8487bddfd395e537772fdd706b6a1de59c695d63427da"
1955 "0dc3261bce2e1ae3cd6de90ec45ecd7e5f14580f5672b6ccd8f9336330dffcd6a3612a74"
1956 "975afc08fb136450e25dc6b071ddfc28fca89d846c107fd2e4bd7a19a4ff6f482d62896d"
1957 "a583c3277e23ab5e537a653112cdf2306043b3cc39f5280bd744fe81d66f497b95650e7d"
1958 "dfd704efcb929b13e00c3e3a7d3cd53878af8f1506d9de05dba9c39a92604b394ea25acb"
1959 "a2cda7b4ae8b08098ba3f0fdea15359df76517be84377f33631c844313ac335aa0d590fe"
1960 "c472d805521f0905d44ca40d7391b292184105acd142c083761c1a038c4f5ed869ea3696"
1961 "99592a37817f64cb4205b66be1f1de6fa47a08e1bf1a94312fe61a29e71bab242af95a7b"
1962 "38d4fb412c682b30256d91e2a46b634535d02b495240cbdb842cbe17cba6a2b94073f3d5"
1963 "f9621ac92ddda66f98bed997216466b4bb0579d58945f8d7450808d9e285d4f1709d8a1d"
1964 "416aa57d4a1a72bfcbfecdda33de2cff3e90e0cc60c897c4663224fc5bbe8316a83c1773"
1965 "802837a57bc7e9238173ed41ea32fe5fe38e546014a16d5e80700d9bac7a84bb03902f31"
1966 "79e641f86f6bc383d656daf69801499633fb367ea7593195934c72bc9bf9624c0c845ebf"
1967 "c36eb7ad4b22fdfb45ca7d4f0d6708c69a21f6eaa6db6bde0f0bd9dc7ec9c6e24626d0a7"
1968 "8fbeeed4b391f871e80e6a9d207165832d4ff689296f9bca15dc03c7c0381659ea5335eb"
1969 "aafdc3e50d18e46b00f1844870d09c25afcdb0ff1ae69dd8f94f91aca6095ba6f2b6e594"
1970 "c4acfe9903485d21b684e31a6acc2162d40e1a7bb8114a860a07e76f5265666555f2418d"
1971 "f11ef8f7499656d12215f5da8d7d041ac72648d15d7661ad93b24f3f071334b0921d5bb0"
1972 "6f2c7ab09f5034518b5ae21cec379373e87d51c77d44a70c2337606aadeb9036716fd920"
1973 "a824e7ae18ce3de9f0ec3456f3454027d8c476b3f1854b240c309f6f9786fa8a073915d9"
1974 "7a019ce99aec3260c5f6b6346cd9c41cb9267f4475958e45289965548238c6b9f91a8784"
1975 "b4e0957ba8b73956012c9a2fc3428434b1c1679f6ed2a3e8e2c90238df428622046f668e"
1976 "e2b053f55e64ffd45600e05a885e3264af573bacee93d23d72a0222b5442ac80bc0a8b79"
1977 "4c2afcf3bc881d20c111f57e3450b50a703f3db1fc5de2076a006f3b7eed694b93269874"
1978 "3b03c2ed2684bad445e69a692e744c7ac3a04f1e0e52b7a6708076d1fbffdb3f1c995828"
1979 "7d5f884e29407030f2db06811092efd80ae08da9daec39744c5ecd3ca771663b8f4968d4"
1980 "2a88c2c9821c73ae2a5a4d9e2551f82c03583b9c4dea775423b4748d24eb604e8ee3159b"
1981 "a6de9bea5b22eed6264e011734ed02b2c74ce06dda890b8604ed7ba49e7bf30e28c9871b"
1982 "e90f5cead67eaf52b5d3181c822b10701219b28ef6f6bebfa278e38acf863e2a1d4b1e40"
1983 "fd8a0ac6ce31054446301046148bf10dc3ae3385e2026e7762bdc8003ffebc4263191a59"
1984 "c72f4f90db03e7d52808506b33bfe1dfa53f1a3daa152e83974fbe56cfd4e8f4e7f7806a"
1985 "084b9d0795b858100eced0b5355a72446f37779d6c67ade60a627b8077ae1f3996b03bc3"
1986 "a5c290651c8609f0d879fbf578cbab35086e1159dd6ddbe3bf7fb5654edcc8f09e4f80d0"
1987 "258c9376d7c53fb68f78d333b18b70170d9a11070790c956f5744c78c986b1baf08b7631"
1988 "7a65c5f07ae6f57eb0e65488659324d29709e3735623d0426e90aa8c4629bb080881150c"
1989 "02be1c004da84414ac001c2eb6138c26388f5a36d594f3acef0e69e2cb43b870efa84da0"
1990 "cff9c923a9880202aed64ad76260f53c45bb1584b3e388a909d13586094b924680006a1d"
1991 "25d4dd36c579a8ec9d3fa63c082d977a5a5021440b5314b51850f2daa6e6af6ae88cb5b1"
1992 "44242bceb1d4771e641101f8abfc3a9b19f2de64e35e76458ad22072ba57925d73015de5"
1993 "66c66fcaa28fdc656f90de967ad51afd331e246d74ed469d63dd7d219935c59984bd9629"
1994 "09d1af296eb3121d782650e7d038063bab5fa854aac77de5ffebeb53d263f521e3fc02ac"
1995 "70",
1996    "b0e15d39025f5263e3efa255c1868d4a37041382",
1997 },{
1998    13184,
1999 "fa922061131282d91217a9ff07463843ae34ff7f8c28b6d93b23f1ea031d5020aa92f660"
2000 "8c3d3df0ee24a8958fd41af880ee454e36e26438defb2de8f09c018607c967d2f0e8b80a"
2001 "00c91c0eabe5b4c253e319b45e6106ff8bf0516f866020e5ba3f59fd669c5aeff310ebb3"
2002 "85007069d01c64f72d2b02f4ec0b45c5ecf313056afcb52b17e08b666d01fecc42adb5b4"
2003 "9ea00c60cacac2e0a953f1324bdd44aec00964a22a3cb33916a33da10d74ec6c6577fb37"
2004 "5dc6ac8a6ad13e00cba419a8636d4daac8383a2e98fe90790cde7b59cfaa17c410a52abc"
2005 "d68b127593d2fcbafd30578d195d890e981ae09e6772cb4382404a4e09f1a33c958b57db"
2006 "ccee54ae335b6c91443206a0c100135647b844f226417a1f70317fd350d9f3789d81894a"
2007 "aff4730072401aaeb8b713ead4394e2e64b6917d6eee2549af7bd0952f12035719065320"
2008 "ca0d2dfe2847c6a2357c52bee4a676b12bafff66597bd479aa29299c1896f63a7523a85a"
2009 "b7b916c5930ab66b4d191103cefc74f2f7e0e96e354f65e355ae43959a0af1880d14ea9d"
2010 "1569e4fd47174aba7f5decb430b3f6baf80a1ef27855227b62487250d3602970e423423c"
2011 "7ca90920685bcf75adfbe2a61ce5bd9228947b32f567927cb1a5bd8727c03aef91d6367b"
2012 "ae7d86fd15c0977ac965a88b0d7236037aefb8d24eec8d2a07c633e031a7b9147c4c7714"
2013 "110bfc7e261448a5d0f73c3619664e1c533c81a0acbf95d502227a33f84f0b8249e3f9fa"
2014 "5c7905a8192b7313fc56bb20679e81333d32c797ac5162204a0eaa0e64507635921c485b"
2015 "8f17c4e2484667a733197529e2a833eed83c57229b11bd820b5a5b78f1867787dbc217ea"
2016 "28bfba785fb545cbc5a840a12eea428213e1aaa4e50a900ba13efcf4a5345574c2481c5d"
2017 "927ada610bba567a55630c89d905db3d9b67fe36c9cc3d6a947664c83e69f51c74711a33"
2018 "df66dd3ff6af9b7c1605b614d4798b4192b9a4b1508f2e2ec5aaad7eaea1ee8867353db9"
2019 "b8d7d9a6f16aa5f339492073238c979082879aee7f94ac4be8133eaacbaedfb044e2ad4e"
2020 "93ba0fa071dea615a5cd80d1d2678f4f93ae5a4bc9cdf3df345a29ec41d8febb23805ce4"
2021 "2541036f3f05c63ae736f79a29802045fad9f370cabf843458c1b636ca41f387fd7821c9"
2022 "1abbd1946afcb9186b936403233f28a5b467595131a6bc07b0873e51a08de66b5d7709a6"
2023 "02c1bd0e7f6e8f4beb0579c51bda0e0c738ef876fcd9a40ab7873c9c31c1d63a588eebc7"
2024 "8d9a0ae6fa35cd1a269e0d2bc68252cbd7c08d79e96f0aa6be22a016136a2b8abe9d3c9c"
2025 "f9d60eeafe3dbc76d489b24d68c36167df4c38cf2b21cf03dc5e659e39018c3490f1237e"
2026 "ca3f85b742ab0045d86a899c4126ad60a147cbc95b71814c274d6478668df41eb32acfb4"
2027 "bbf024fb4e3d6be0b60653a0471afc3037ab67dcb00a2b2e24b26911e1880136e56106b7"
2028 "f3c570fbe6f311d94624cb001914ff96fbbf481f71686aa17be0850568058fc1ee8900b4"
2029 "7af5cf51c5ed9e00a8b532c131f42513f6b8df14a9bbc2e9ede5a560681184d41a147552"
2030 "edfbdef98d95e6a7793229d25ba9b0b395a020aa1c0731de89e662246d59ec22e5d8f4b4"
2031 "6fbc048efcffbc234744c5c66417070f9c751c81788f04691ccb1a09d60c46f6f73375bf"
2032 "e2e646cf6290069541a8dfe216374c925e94d06ece72e851e81d3e8acd011f82526c2f9f"
2033 "55955c6752dc10e93153ab58627e30fa2c573e4042954337982eec1f741be058c85bad86"
2034 "bf3a02ed96d3201dadd48bd4de8105200dfcbcc400c3c3dd717abfc562ebe338b14b1eb5"
2035 "ecbe9227661e49c58bf8233770d813faafc78b05711135adcc4ce4c65095ca0bdc1debc0"
2036 "b6e5d195dbc582ce94b3afa14a422edf9b69abd7ae869a78c3a26fb50ef7122ec5af8d0c"
2037 "78ef082ca114f8817c3d93b31809870caea2eb9533fa767c2954efb9ba07e4f1077e9f9b"
2038 "be845661eabea2c91079321477a7c167c7234528d63d6aabbe723e0e337b2e61138a310a"
2039 "3fd04368aa4215b7af9d0334a8a74681bcb86b4af87a0329a1ed9dc7c9aef14521785eda"
2040 "0eeb97bdff8c9945fd0ee04e84d0dae091a69c0bfcdcd4150878fed839c0db6565fc1fed"
2041 "0e7d6ae2efde7a59d58a9fb3b07e6f7cea51ba93f771c18b2eafa252d7fe171085776052"
2042 "a6a17e6858f0a20b7e8be54413523989bf20a028a84d9ce98b78e6ee0b8362df49de5344"
2043 "b409cc322354672a21ea383e870d047551a3af71aaf2f44f49a859cf001e61b592dd036f"
2044 "c6625bf7b91ea0fb78c1563cceb8c4345bf4a9fbe6ee2b6bf5e81083",
2045    "8b6d59106f04300cb57c7c961945cd77f3536b0a",
2046 },{
2047    13976,
2048 "162cca41155de90f6e4b76a34261be6666ef65bdb92b5831b47604ce42e0c6c8d2eda265"
2049 "ab9a3716809bf2e745e7831a41768d0f6349a268d9ac6e6adfb832a5d51b75d7951cf60e"
2050 "03d9e40de6d351f1f6ade5143531cf32839401ca6dfb9dc7473daa607aeb0c3d1e8eb3db"
2051 "cc2f1231ad1dd394d7eac9d8dab726b895b1ee774fdcabc8031063ecfa41c71a9f03ad23"
2052 "904cc056f17c76a1059c43faffe30dfd157fdfd7d792e162bf7a889109550a0fc4c41523"
2053 "2af0c0d72dcbc2595299e1a1c2aeae549f7970e994c15e0ab02f113d740d38c32a4d8ec0"
2054 "79cd099d37d954ab7ef2800902cdf7c7a19fb14b3c98aaf4c6ad93fe9a9bc7a61229828e"
2055 "55ad4d6270d1bdbca9975d450f9be91e5699bd7ee22e8c9c22e355cf1f6793f3551cb510"
2056 "c1d5cd363bdf8cab063e6e49a6383221f1188d64692c1f84c910a696de2e72fb9886193f"
2057 "61ab6b41ad0ea894d37ff1261bf1fd1f187e0d0c38ab223d99ec6d6b1e6b079fc305e24e"
2058 "2d9500c98676e2d587434495d6e107b193c06fb12d5d8eaa7b0c001d08f4d91cae5bdcae"
2059 "6624ee755e95ca8e4c5ef5b903d7f5ba438abeffd6f16d82d88138f157e7a50d1c91fb50"
2060 "c770f6d222fcbf6daf791b1f8379e3b157a3b496ddb2e71650c1c4ac4fc5f2aceb5b3228"
2061 "ffc44e15c02d4baa9434e60928a93f21bc91cfd3c2719f53a8c9bcd2f2dee65a8bbc88f9"
2062 "5d7ced211fc3b04f6e8b74eb2026d66fd57fa0cccea43f0a0381782e6fee5660afed674d"
2063 "cb2c28cb54d2bdbbaf78e534b0742ede6b5e659b46cd516d5362a194dd0822f6417935c4"
2064 "ff05815b118fe5687cd8b050240015cfe449d9dfde1f4fdb105586e429b2c1849aac2791"
2065 "ef73bc54603190eba39037ec057e784bb92d497e705dfcde2addb3514b4f1926f12d5440"
2066 "850935779019b23bd0f2977a8c9478c424a7eaaeec04f3743a77bee2bec3937412e707bc"
2067 "92a070046e2f9c35fe5cc3f755bbb91a182e683591ab7e8cff40633730546e81522f588f"
2068 "07bdf142b78e115d2a22d2eb5664fcdb7574c1ee5ba9abd307d7d29078cd5223c222fc69"
2069 "60324c40cc639be84dad96b01059efce7b08538ebef89bafab834609c7e82774a14e5be6"
2070 "62067edba6111efa8ae270f5066442b17e3f31a793581c8a3f96d92921ec26981594e28a"
2071 "08987d020b97ad2ba5c662836e35fd3fd954bcec52b579528913959d0d942fbf1c4b9910"
2072 "ba010c3700359a4eb7616541257f0f7727cc71b580cc903f718ecc408a315b6bbfa7f6e3"
2073 "beb9d258804bd2731ee2fb75e763281baf1effc4690a23d5f952ab5d4311d4f5885af2eb"
2074 "f27cad9f6d84692cb903064bbd11ca751f919b4811b7722c6ec80c360521e34d357b5c8b"
2075 "ba6d42e5c632730f53add99ab8aa9c607b6796216753086ede158bc670d04900aca66ce8"
2076 "357bd72d19fb147b5fde8ee4df6a0184573a2e65ba3fd3a0cb04dac5eb36d17d2f639a6e"
2077 "b602645f3ab4da9de4c9999d6506e8e242a5a3216f9e79a4202558ecdc74249ad3caaf90"
2078 "71b4e653338b48b3ba3e9daf1e51e49384268d63f37ce87c6335de79175cdf542d661bcd"
2079 "74b8f5107d6ab492f54b7c3c31257ecb0b426b77ed2e2ed22bbfdaf49653e1d54e5988fa"
2080 "d71397546f9955659f22b3a4117fc823a1e87d6fb6fb8ab7d302a1316975e8baf0c0adbd"
2081 "35455655f6a596b6ac3be7c9a8ea34166119d5e70dfbc1aa6e14ff98eff95e94ef576656"
2082 "5d368ec8857fb0b029bcb990d420a5ca6bc7ab08053eb4dbfc4612a345d56faefc5e03a4"
2083 "43520b224de776a5b618e1aa16edc513d5fcefcd413031b0ddc958a6fca45d108fbde065"
2084 "3cf2d11cb00a71cd35f57993875598b4e33e2384623a0986859105d511c717c21d6534bf"
2085 "69fd3d7cf1682e4fc25298d90df951e77a316996beac61bb7078988118c906548af92cfe"
2086 "72cd4b102ffad584e5e721a0cdb5621ed07dda8955d84bea57a5afa4ba06289ddfac3a9e"
2087 "765538fd9392fc7904cedb65e38cd90967f01845ff819777a22d199f608e62c13e6ba98b"
2088 "40824b38c784bdb41d62c4014fc7e8d93be52695e975e54d1ff92b412f451177143d74a6"
2089 "bde0ee53a986043ab465a1ef315ac4c538e775ef4178fde5f2ea560a364de18b8fe9578a"
2090 "ad80027c3fd32dcf0967d9d03789b1cdf19040762f626289cf3af8afe5a8e0a152d9258e"
2091 "981872c1ec95cd7f8d65812e55cb5cbd8db61b3f068a23d9652372dfbf18d43a663c5a0d"
2092 "026b0898e383ce5c95b0ba7fb5ed6b7304c7c9d3ba64f38d1dc579465148ccfa7271f2e3"
2093 "e0e97e9ddac7c0874f0f396cf07851638a734df393687b7b0343afd1652ff32a2da17b3a"
2094 "4c99d79c02256c73f32625527e5666594a8a42a12135eddb022e743371b3ab7b12ad6785"
2095 "7635eed03558ac673d17280769b2368056276d5d72f5dbc75525f8a7558bd90b544aa6cb"
2096 "dd964e6c70be79441969bfdf471f17a2dc0c92",
2097    "6144c4786145852e2a01b20604c369d1b9721019",
2098 },{
2099    14768,
2100 "c9bed88d93806b89c2d028866842e6542ab88c895228c96c1f9f05125f8697c7402538b0"
2101 "6465b7ae33daef847500f73d20c598c86e4804e633e1c4466e61f3ed1e9baadc5723bbed"
2102 "9455a2ff4f99b852cfe6aa3442852ade0b18e4995ddab4250928165a9441de108d4a293d"
2103 "1d95935de022aa17f366a31d4f4c4c54557a4235a9d56473444787ddc5c06c87087aef24"
2104 "fa8280b7ac74d76ba685e4be7dc705e5a8a97c6c8fbd201ee5bf522438d23371c60c155d"
2105 "93352f8fb8cc9421fe4b66ffabad46909c2c1099944fc55ed424c90aecca4f50d0331153"
2106 "2e2844c3ff8ecb495de7ab26941cbf177b79ad7b05f918b713c417da8cf6e67db0a2dcee"
2107 "a9179d8d636191759e13955f4244f0c4f2d88842e3015641ef0417d6e54144e8246e4591"
2108 "6823e2c6e39bfa3b90b97781c44981710689f2ce20e70a26760d65f9971b291e12338461"
2109 "8b3b56710dde2afaa2d46b0e2164d5c9482729350a0e256b2aa6b3fb099b618ebd7c11ca"
2110 "62bdf176b502aedfdf9be57a8e4adbca4a4d6d8407984af2f6635f95a1e4930e375eb53f"
2111 "245ab2ade5340c281bda87afded1268e537955c9819168bd60fd440533c75c9b1865e03f"
2112 "de3a301d165f97aa6da236cf39cf3e49512f6350224f8d76ff02d0d3b9a99e5f70b23b9f"
2113 "a85f72849fc98790df246c3a0f4437940e60d42b4317f72e2eb055d343a614f7f9648005"
2114 "1e4dff186dff476462d9ced24dbb82eaa60cbbf6a0026e64001da36d30f529f48f3688b1"
2115 "0ce9378ef3f50f5106e5007cd0eb037136254fda4f20d048769bd51a9d8d09a1e469a482"
2116 "6aa0e25b6267b5a96abcb6e919a362fdd7b683d2f2dcec40ee5969311c07f6066ee22f36"
2117 "89ca08381c85bea470040e9541e7a451cd43d62c2aa292a9dc4b95e3a7c4de2ba29663f3"
2118 "8d5002eb64ceba6934bb1b0e2e55fba7fa706b514ebeeae1be4dd882d6512da066246a05"
2119 "1d8bd042593bd0513e9cc47806ccdc7097e75bc75b8603834c85cd084e0ade3cc2c2b7e8"
2120 "586eac62249f9769f5bdcd50e24e515f257548762db9adf3ee0846d67cfcd723d85d9588"
2121 "09e6dd406f4c2637557c356fc52490a2a0763429ee298a1c72c098bb810e740c15faffc6"
2122 "1e80cf6e18f86dc0e29bc150ce43ca71f5729356cd966277fd8b32366f6263c3a761b13d"
2123 "544a631a25e1c4c8dea8d794abed47ccb4069d20f1dcb54e40a673ffb5f7b2eb31fb7d44"
2124 "36fd8252f92dc35bb9a18fc55099b17e0807e79caf4f9641ee4bbbc2d6922508bcfae236"
2125 "475bf78bc796548bc8d60659e816af68e5e43352fa64b5086c97c22c60ddcbbbefb9d9ef"
2126 "7cd57c64454604793910f4f90aedb4fb824a86061a93bb79c9b0272a1ad0d24e8165f099"
2127 "ef6f14a6a4fea09845f280022e061804090d7ab79f7bddcbef264b6f7d4e9971eddb9ca7"
2128 "d0e79a8dbe7cff2fa59f514a608d66ae8c44d5e69745aa1b19995e366812064567d3ca20"
2129 "9e12994c901d1b1f489be7253615f7c339b5581afd4d262e879ab8480ecb18990d3db61f"
2130 "96895dcde9c065e645f52baafefcbe34d072dba373fd1c786fd56c3f3284be7260eaff9a"
2131 "6a8348b762ed59e20ea443313b1164db53c3989c32fcae5b366f190b9548e8cff46df961"
2132 "350369b490354ed8e530a91f5072967eff45c63540862fb2deab02b3ae05deac65414368"
2133 "ac3549f277da92b692947de47cba9c1579526931e31c3490c1d3605f9bafcf468c2e9b47"
2134 "981407ea40b0b59754621943095a2d4f4ba266ac545fe7447e54f69555a7ac9ff1e8f001"
2135 "834fa65f2d4523061726e4d3bf4680519032dc21b7389e9f3229e4c2295d354482f8b803"
2136 "b06ca3a8cb3ff786e60f6bc59dd3a5bfed63b0aa493bab78e97bbefb6633534d84de826f"
2137 "4e2ccc3069050d50a2caace6c9de15ffc2656988d94b736e5688df0351a3a6a4c875cd99"
2138 "ef304f3cc7a0585df2b0b3e6c62f86bba0d43de47b80c4eec1c4f98e60a36188219919cf"
2139 "36dc10ee11e174a67d226ad9e71f02a7fca26ad67a4862773f3defc6a747545314063e5f"
2140 "ce7a3f890ec57daa5532acfd027739832437c8a58dcbe11c2842e60e8ca64979d081fbd5"
2141 "a1a028f59317212fb5869abc689a156171d69e4f4c93b949c3459904c00192d3603cd184"
2142 "48d64b843c57f34aee7830f313e58e2abc41b44be46a96c845ffebcb7120e21d1d751046"
2143 "c072adf65dd901a39c8019742054be5e159ea88d0885ee05fcd4c189bafe5abb68603186"
2144 "5dc570b9342fa7f41fd5c1c87e68371ab19a83c82ae1d890c678102d5da8e6c29845657c"
2145 "027ba07362cba4d24950ab38e747925e22ce8df9eaec1ae2c6d23374b360c8352feb6cb9"
2146 "913e4fc49bde6caf5293030d0d234a8ecd616023cc668262591f812de208738e5336a9e6"
2147 "9f9be2479b86be1e1369761518dfc93797ed3a55308878a944581eba50bc9c7f7a0e75c7"
2148 "6a28acd95b277857726f3f684eefc215e0a696f47d65d30431d710d957c08ef96682b385"
2149 "0ee5ba1c8417aafc1af2846a127ec155b4b7fb369e90eb3a5c3793a3389bbc6b532ca32b"
2150 "f5e1f03c2280e71c6e1ae21312d4ff163eee16ebb1fdee8e887bb0d453829b4e6ed5fa70"
2151 "8f2053f29b81e277be46",
2152    "a757ead499a6ec3d8ab9814f839117354ae563c8"
2153 }
2154 };
2155 
test_sha1(void)2156 void test_sha1(void)
2157 {
2158    unsigned char buffer[4000];
2159    int i;
2160    for (i=0; i < sizeof(sha1_tests) / sizeof(sha1_tests[0]); ++i) {
2161       stb_uint len = sha1_tests[i].length / 8;
2162       unsigned char digest[20], fdig[20];
2163       unsigned int h;
2164       assert(len <= sizeof(buffer));
2165       assert(strlen(sha1_tests[i].message) == len*2);
2166       assert(strlen(sha1_tests[i].digest) == 20 * 2);
2167       for (h=0; h < len; ++h) {
2168          char v[3];
2169          v[0] = sha1_tests[i].message[h*2];
2170          v[1] = sha1_tests[i].message[h*2+1];
2171          v[2] = 0;
2172          buffer[h] = (unsigned char) strtol(v, NULL, 16);
2173       }
2174       stb_sha1(digest, buffer, len);
2175       for (h=0; h < 20; ++h) {
2176          char v[3];
2177          int res;
2178          v[0] = sha1_tests[i].digest[h*2];
2179          v[1] = sha1_tests[i].digest[h*2+1];
2180          v[2] = 0;
2181          res = digest[h] == strtol(v, NULL, 16);
2182          c(res, sha1_tests[i].digest);
2183          if (!res)
2184             break;
2185       }
2186       {
2187          int z;
2188          FILE *f = fopen("data/test.bin", "wb");
2189          if (!f) stb_fatal("Couldn't write to test.bin");
2190          fwrite(buffer, len, 1, f);
2191          fclose(f);
2192          #ifdef _WIN32
2193          z = stb_sha1_file(fdig, "data/test.bin");
2194          if (!z) stb_fatal("Couldn't digest test.bin");
2195          c(memcmp(digest, fdig, 20)==0, "stb_sh1_file");
2196          #endif
2197       }
2198    }
2199 }
2200 
2201 
2202 #if 0
2203 
2204 stb__obj zero, one;
2205 
2206 void test_packed_floats(void)
2207 {
2208    stb__obj *p;
2209    float x,y,*q;
2210    clock_t a,b,c;
2211    int i;
2212    stb_float_init();
2213    for (i=-10; i < 10; ++i) {
2214       float f = (float) pow(10,i);
2215       float g = f * 10;
2216       float delta = (g - f) / 10000;
2217       while (f < g) {
2218          stb__obj z = stb_float(f);
2219          float k = stb_getfloat(z);
2220          float p = stb_getfloat_table(z);
2221          assert((z & 1) == 1);
2222          assert(f == k);
2223          assert(k == p);
2224          f += delta;
2225       }
2226    }
2227 
2228    zero = stb_float(0);
2229    one  = stb_float(1);
2230 
2231    p = malloc(8192 * 4);
2232    for (i=0; i < 8192; ++i)
2233       p[i] = stb_rand();
2234    for (i=0; i < 8192; ++i)
2235       if ((stb_rand() & 31) < 28)
2236          p[i] = zero;
2237 
2238    q = malloc(4 * 1024);
2239 
2240    a = clock();
2241 
2242    x = y = 0;
2243    for (i=0; i < 200000000; ++i)
2244       q[i&1023] = stb_getfloat_table(p[i&8191]);
2245    b = clock();
2246    for (i=0; i < 200000000; ++i)
2247       q[i&1023] = stb_getfloat_table2(p[i&8191]);
2248    c = clock();
2249    free(p);
2250 
2251    free(q);
2252 
2253    printf("Table: %d\nIFs: %d\n", b-a, c-b);
2254 }
2255 #endif
2256 
2257 
do_compressor(int argc,char ** argv)2258 void do_compressor(int argc,char**argv)
2259 {
2260    char *p;
2261    size_t slen;
2262    unsigned int len;
2263 
2264    int window;
2265    if (argc == 2) {
2266       p = stb_file(argv[1], &slen);
2267       len = (unsigned int) slen;
2268       if (p) {
2269          unsigned int dlen, clen = stb_compress_tofile("data/dummy.bin", p, len);
2270          char *q = stb_decompress_fromfile("data/dummy.bin", &dlen);
2271 
2272          if (len != dlen) {
2273             printf("FAILED %d -> %d\n", len, clen);
2274          } else {
2275             int z = memcmp(q,p,dlen);
2276             if (z != 0)
2277                printf("FAILED %d -> %d\n", len, clen);
2278             else
2279                printf("%d -> %d\n", len, clen);
2280          }
2281       }
2282       return;
2283    }
2284 
2285    window = atoi(argv[1]);
2286    if (window && argc == 4) {
2287       p = stb_file(argv[3], &slen);
2288       len = (int) slen;
2289       if (p) {
2290          stb_compress_hashsize(window);
2291          stb_compress_tofile(argv[2], p, len);
2292       }
2293    } else if (argc == 3) {
2294       p = stb_decompress_fromfile(argv[2], &len);
2295       if (p) {
2296          FILE *f = fopen(argv[1], "wb");
2297          fwrite(p,1,len,f);
2298          fclose(f);
2299       } else {
2300          fprintf(stderr, "FAILED.\n");
2301       }
2302    } else {
2303       fprintf(stderr, "Usage: stb <hashsize> <output> <filetocompress>\n"
2304                       "   or  stb            <output> <filetodecompress>\n");
2305    }
2306 }
2307 
2308 #if 0
2309 // naive backtracking implementation
2310 int wildmatch(char *expr, char *candidate)
2311 {
2312    while(*expr) {
2313       if (*expr == '?') {
2314          if (!*candidate) return 0;
2315          ++candidate;
2316          ++expr;
2317       } else if (*expr == '*') {
2318          ++expr;
2319          while (*expr == '*' || *expr =='?') ++expr;
2320          // '*' at end of expression matches anything
2321          if (!*expr) return 1;
2322          // now scan candidate 'til first match
2323          while (*candidate) {
2324             if (*candidate == *expr) {
2325                // check this candidate
2326                if (stb_wildmatch(expr+1, candidate+1))
2327                   return 1;
2328                // if not, then backtrack
2329             }
2330             ++candidate;
2331          }
2332       } else {
2333          if (*expr != *candidate)
2334             return 0;
2335          ++expr, ++candidate;
2336       }
2337    }
2338    return *candidate != 0;
2339 }
2340 
2341 int stb_matcher_find_slow(stb_matcher *m, char *str)
2342 {
2343    int result = 1;
2344    int i,j,y,z;
2345    uint16 *previous = NULL;
2346    uint16 *current = NULL;
2347    uint16 *temp;
2348 
2349    stb_arr_setsize(previous, 4);
2350    stb_arr_setsize(current, 4);
2351 
2352    previous = stb__add_if_inactive(m, previous, m->start_node);
2353    previous = stb__eps_closure(m,previous);
2354    if (stb__clear_goalcheck(m, previous))
2355       goto done;
2356 
2357    while (*str) {
2358       y = stb_arr_len(previous);
2359       for (i=0; i < y; ++i) {
2360          stb_nfa_node *n = &m->nodes[previous[i]];
2361          z = stb_arr_len(n->out);
2362          for (j=0; j < z; ++j) {
2363             if (n->out[j].match == *str)
2364                current = stb__add_if_inactive(m, current, n->out[j].node);
2365             else if (n->out[j].match == -1) {
2366                if (*str != '\n')
2367                   current = stb__add_if_inactive(m, current, n->out[j].node);
2368             } else if (n->out[j].match < -1) {
2369                int z = -n->out[j].match - 2;
2370                if (m->charset[(uint8) *str] & (1 << z))
2371                   current = stb__add_if_inactive(m, current, n->out[j].node);
2372             }
2373          }
2374       }
2375       ++str;
2376       stb_arr_setlen(previous, 0);
2377 
2378       temp = previous;
2379       previous = current;
2380       current = temp;
2381 
2382       if (!m->match_start)
2383          previous = stb__add_if_inactive(m, previous, m->start_node);
2384       previous = stb__eps_closure(m,previous);
2385       if (stb__clear_goalcheck(m, previous))
2386          goto done;
2387    }
2388 
2389    result=0;
2390 
2391 done:
2392    stb_arr_free(previous);
2393    stb_arr_free(current);
2394 
2395    return result;
2396 }
2397 #endif
2398 
2399 
2400 
2401 
2402 
2403 #if 0 // parser generator
2404 //////////////////////////////////////////////////////////////////////////
2405 //
2406 //   stb_parser
2407 //
2408 //   Generates an LR(1) parser from a grammar, and can parse with it
2409 
2410 
2411 
2412 // Symbol representations
2413 //
2414 // Client:     Internal:
2415 //    -           c=0     e aka epsilon
2416 //    -           c=1     $ aka end of string
2417 //   > 0        2<=c<M    terminals (note these are remapped from a sparse layout)
2418 //   < 0        M<=c<N    non-terminals
2419 
2420 #define END 1
2421 #define EPS 0
2422 
2423 short encode_term[4096];  // @TODO: malloc these
2424 short encode_nonterm[4096];
2425 int first_nonterm, num_symbols, symset;
2426 #define encode_term(x)     encode_term[x]
2427 #define encode_nonterm(x)  encode_nonterm[~(x)]
2428 #define encode_symbol(x)   ((x) >= 0 ? encode_term(x) : encode_nonterm(x))
2429 
2430 stb_bitset **compute_first(short ** productions)
2431 {
2432    int i, changed;
2433    stb_bitset **first = malloc(sizeof(*first) * num_symbols);
2434 
2435    assert(symset);
2436    for (i=0; i < num_symbols; ++i)
2437       first[i] = stb_bitset_new(0, symset);
2438 
2439    for (i=END; i < first_nonterm; ++i)
2440       stb_bitset_setbit(first[i], i);
2441 
2442    for (i=0; i < stb_arr_len(productions); ++i) {
2443       if (productions[i][2] == 0) {
2444          int nt = encode_nonterm(productions[i][0]);
2445          stb_bitset_setbit(first[nt], EPS);
2446       }
2447    }
2448 
2449    do {
2450       changed = 0;
2451       for (i=0; i < stb_arr_len(productions); ++i) {
2452          int j, nt = encode_nonterm(productions[i][0]);
2453          for (j=2; productions[i][j]; ++j) {
2454             int z = encode_symbol(productions[i][j]);
2455             changed |= stb_bitset_unioneq_changed(first[nt], first[z], symset);
2456             if (!stb_bitset_testbit(first[z], EPS))
2457                break;
2458          }
2459          if (!productions[i][j] && !stb_bitset_testbit(first[nt], EPS)) {
2460             stb_bitset_setbit(first[nt], EPS);
2461             changed = 1;
2462          }
2463       }
2464    } while (changed);
2465    return first;
2466 }
2467 
2468 stb_bitset **compute_follow(short ** productions, stb_bitset **first, int start)
2469 {
2470    int i,j,changed;
2471    stb_bitset **follow = malloc(sizeof(*follow) * num_symbols);
2472 
2473    assert(symset);
2474    for (i=0; i < num_symbols; ++i)
2475       follow[i] = (i >= first_nonterm ? stb_bitset_new(0, symset) : NULL);
2476 
2477    stb_bitset_setbit(follow[start], END);
2478    do {
2479       changed = 0;
2480       for (i=0; i < stb_arr_len(productions); ++i) {
2481          int nt = encode_nonterm(productions[i][0]);
2482          for (j=2; productions[i][j]; ++j) {
2483             if (productions[i][j] < 0) {
2484                int k,z = encode_nonterm(productions[i][j]);
2485                for (k=j+1; productions[i][k]; ++k) {
2486                   int q = encode_symbol(productions[i][k]);
2487                   changed |= stb_bitset_unioneq_changed(follow[z], first[q], symset);
2488                   if (!stb_bitset_testbit(first[q], EPS))
2489                      break;
2490                }
2491                if (!productions[i][k] == 0)
2492                   changed |= stb_bitset_unioneq_changed(follow[z], follow[nt], symset);
2493             }
2494          }
2495       }
2496    } while (changed);
2497 
2498    for (i=first_nonterm; i < num_symbols; ++i)
2499       stb_bitset_clearbit(follow[i], EPS);
2500 
2501    return follow;
2502 }
2503 
2504 void first_for_prod_plus_sym(stb_bitset **first, stb_bitset *out, short *prod, int symbol)
2505 {
2506    stb_bitset_clearall(out, symset);
2507    for(;*prod;++prod) {
2508       int z = encode_symbol(*prod);
2509       stb_bitset_unioneq_changed(out, first[z], symset);
2510       if (!stb_bitset_testbit(first[z], EPS))
2511          return;
2512    }
2513    stb_bitset_unioneq_changed(out, first[symbol], symset);
2514 }
2515 
2516 #define Item(p,c,t)       ((void *) (size_t) (((t) << 18) + ((c) << 12) + ((p) << 2)))
2517 #define ItemProd(i)       ((((uint32) (size_t) (i)) >> 2) & 1023)
2518 #define ItemCursor(i)     ((((uint32) (size_t) (i)) >> 12) & 63)
2519 #define ItemLookahead(i)  (((uint32) (size_t) (i)) >> 18)
2520 
2521 static void pc(stb_ps *p)
2522 {
2523 }
2524 
2525 typedef struct
2526 {
2527    short *prod;
2528    int prod_num;
2529 } ProdRef;
2530 
2531 typedef struct
2532 {
2533    stb_bitset **first;
2534    stb_bitset **follow;
2535    short **   prod;
2536    ProdRef ** prod_by_nt;
2537 } Grammar;
2538 
2539 stb_ps *itemset_closure(Grammar g, stb_ps *set)
2540 {
2541    stb_bitset *lookahead;
2542    int changed,i,j,k, list_len;
2543    if (set == NULL) return set;
2544    lookahead = stb_bitset_new(0, symset);
2545    do {
2546       void **list = stb_ps_getlist(set, &list_len);
2547       changed = 0;
2548       for (i=0; i < list_len; ++i) {
2549          ProdRef *prod;
2550          int nt, *looklist;
2551          int p = ItemProd(list[i]), c = ItemCursor(list[i]), t = ItemLookahead(list[i]);
2552          if (g.prod[p][c] >= 0) continue;
2553          nt = encode_nonterm(g.prod[p][c]);
2554          first_for_prod_plus_sym(g.first, lookahead, g.prod[p]+c+1, t);
2555          looklist = stb_bitset_getlist(lookahead, 1, first_nonterm);
2556 
2557          prod = g.prod_by_nt[nt];
2558          for (j=0; j < stb_arr_len(prod); ++j) {
2559             assert(prod[j].prod[0] == g.prod[p][c]);
2560             // matched production; now iterate terminals
2561             for (k=0; k < stb_arr_len(looklist); ++k) {
2562                void *item = Item(prod[j].prod_num,2,looklist[k]);
2563                if (!stb_ps_find(set, item)) {
2564                   changed = 1;
2565                   set = stb_ps_add(set, item);
2566                   pc(set);
2567                }
2568             }
2569          }
2570          stb_arr_free(looklist);
2571       }
2572       free(list);
2573    } while (changed);
2574    free(lookahead);
2575    return set;
2576 }
2577 
2578 stb_ps *itemset_goto(Grammar g, stb_ps *set, int sym)
2579 {
2580    int i, listlen;
2581    void **list = stb_ps_fastlist(set, &listlen);
2582    stb_ps *out = NULL;
2583    for (i=0; i < listlen; ++i) {
2584       int p,c;
2585       if (!stb_ps_fastlist_valid(list[i])) continue;
2586       p = ItemProd(list[i]), c = ItemCursor(list[i]);
2587       if (encode_symbol(g.prod[p][c]) == sym) {
2588          void *z = Item(p,c+1,ItemLookahead(list[i]));
2589          if (!stb_ps_find(out, z))
2590             out = stb_ps_add(out, z);
2591          pc(out);
2592       }
2593    }
2594    return itemset_closure(g, out);
2595 }
2596 
2597 void itemset_all_nextsym(Grammar g, stb_bitset *out, stb_ps *set)
2598 {
2599    int i, listlen;
2600    void **list = stb_ps_fastlist(set, &listlen);
2601    stb_bitset_clearall(out, symset);
2602    pc(set);
2603    for (i=0; i < listlen; ++i) {
2604       if (stb_ps_fastlist_valid(list[i])) {
2605          int p = ItemProd(list[i]);
2606          int c = ItemCursor(list[i]);
2607          if (g.prod[p][c])
2608             stb_bitset_setbit(out, encode_symbol(g.prod[p][c]));
2609       }
2610    }
2611 }
2612 
2613 stb_ps ** generate_items(Grammar g, int start_prod)
2614 {
2615    stb_ps ** all=NULL;
2616    int i,j,k;
2617    stb_bitset *try = stb_bitset_new(0,symset);
2618    stb_ps *set = NULL;
2619    void *item = Item(start_prod, 2, END);
2620    set = stb_ps_add(set, item);
2621    pc(set);
2622    set = itemset_closure(g, set);
2623    pc(set);
2624    stb_arr_push(all, set);
2625    for (i = 0; i < stb_arr_len(all); ++i) {
2626       // only try symbols that appear in all[i]... there's a smarter way to do this,
2627       // which is to take all[i], and divide it up by symbol
2628       pc(all[i]);
2629       itemset_all_nextsym(g, try, all[i]);
2630       for (j = 1; j < num_symbols; ++j) {
2631          if (stb_bitset_testbit(try, j)) {
2632             stb_ps *out;
2633             if (stb_arr_len(all) > 4) pc(all[4]);
2634             if (i == 1 && j == 29) {
2635                if (stb_arr_len(all) > 4) pc(all[4]);
2636                out = itemset_goto(g, all[i], j);
2637                if (stb_arr_len(all) > 4) pc(all[4]);
2638             } else
2639                out = itemset_goto(g, all[i], j);
2640             pc(out);
2641             if (stb_arr_len(all) > 4) pc(all[4]);
2642             if (out != NULL) {
2643                // add it to the array if it's not already there
2644                for (k=0; k < stb_arr_len(all); ++k)
2645                   if (stb_ps_eq(all[k], out))
2646                      break;
2647                if (k == stb_arr_len(all)) {
2648                   stb_arr_push(all, out);
2649                   pc(out);
2650                   if (stb_arr_len(all) > 4) pc(all[4]);
2651                } else
2652                   stb_ps_delete(out);
2653             }
2654          }
2655       }
2656    }
2657    free(try);
2658    return all;
2659 }
2660 
2661 typedef struct
2662 {
2663    int num_stack;
2664    int function;
2665 } Reduction;
2666 
2667 typedef struct
2668 {
2669    short *encode_term;
2670    Reduction *reductions;
2671    short **action_goto; // terminals are action, nonterminals are goto
2672    int start;
2673    int end_term;
2674 } Parser;
2675 
2676 enum
2677 {
2678    A_error, A_accept, A_shift, A_reduce, A_conflict
2679 };
2680 
2681 typedef struct
2682 {
2683    uint8 type;
2684    uint8 cursor;
2685    short prod;
2686    short value;
2687 } Action;
2688 
2689 Parser *parser_create(short **productions, int num_prod, int start_nt, int end_term)
2690 {
2691    short *mini_rule = malloc(4 * sizeof(mini_rule[0]));
2692    Action *actions;
2693    Grammar g;
2694    stb_ps ** sets;
2695    Parser *p = malloc(sizeof(*p));
2696    int i,j,n;
2697    stb_bitset *mapped;
2698    int min_s=0, max_s=0, termset, ntset, num_states, num_reductions, init_prod;
2699 
2700    int synth_start;
2701 
2702    // remap sparse terminals and nonterminals
2703 
2704    for (i=0; i < num_prod; ++i) {
2705       for (j=2; productions[i][j]; ++j) {
2706          if (productions[i][j] < min_s) min_s = productions[i][j];
2707          if (productions[i][j] > max_s) max_s = productions[i][j];
2708       }
2709    }
2710    synth_start = --min_s;
2711 
2712    termset = (max_s + 32) >> 5;
2713    ntset = (~min_s + 32) >> 5;
2714    memset(encode_term, 0, sizeof(encode_term));
2715    memset(encode_nonterm, 0, sizeof(encode_nonterm));
2716 
2717    mapped = stb_bitset_new(0, termset);
2718    n = 2;
2719    for (i=0; i < num_prod; ++i)
2720       for (j=2; productions[i][j]; ++j)
2721          if (productions[i][j] > 0)
2722             if (!stb_bitset_testbit(mapped, productions[i][j])) {
2723                stb_bitset_setbit(mapped, productions[i][j]);
2724                encode_term[productions[i][j]] = n++;
2725             }
2726    free(mapped);
2727 
2728    first_nonterm = n;
2729 
2730    mapped = stb_bitset_new(0, ntset);
2731    for (i=0; i < num_prod; ++i)
2732       for (j=2; productions[i][j]; ++j)
2733          if (productions[i][j] < 0)
2734             if (!stb_bitset_testbit(mapped, ~productions[i][j])) {
2735                stb_bitset_setbit(mapped, ~productions[i][j]);
2736                encode_nonterm[~productions[i][j]] = n++;
2737             }
2738    free(mapped);
2739 
2740    // add a special start state for internal processing
2741    p->start = n++;
2742    encode_nonterm[synth_start] = p->start;
2743    mini_rule[0] = synth_start;
2744    mini_rule[1] = -32768;
2745    mini_rule[2] = start_nt;
2746    mini_rule[3] = 0;
2747 
2748    p->end_term = end_term;
2749 
2750    num_symbols = n;
2751 
2752    // create tables
2753    g.prod = NULL;
2754    g.prod_by_nt = malloc(num_symbols * sizeof(g.prod_by_nt[0]));
2755    for (i=0; i < num_symbols; ++i)
2756       g.prod_by_nt[i] = NULL;
2757 
2758    for (i=0; i < num_prod; ++i) {
2759       stb_arr_push(g.prod, productions[i]);
2760    }
2761    init_prod = stb_arr_len(g.prod);
2762    stb_arr_push(g.prod, mini_rule);
2763 
2764    num_reductions = stb_arr_len(g.prod);
2765    p->reductions = malloc(num_reductions * sizeof(*p->reductions));
2766 
2767    symset = (num_symbols + 31) >> 5;
2768    g.first = compute_first(g.prod);
2769    g.follow = compute_follow(g.prod, g.first, p->start);
2770 
2771    for (i=0; i < stb_arr_len(g.prod); ++i) {
2772       ProdRef pr = { g.prod[i], i };
2773       stb_arr_push(g.prod_by_nt[encode_nonterm(g.prod[i][0])], pr);
2774    }
2775 
2776    sets = generate_items(g, init_prod);
2777 
2778    num_states = stb_arr_len(sets);
2779    // now generate tables
2780 
2781    actions = malloc(sizeof(*actions) * first_nonterm);
2782    p->action_goto = (short **) stb_array_block_alloc(num_states, sizeof(short) * num_symbols);
2783    for (i=0; i < num_states; ++i) {
2784       int j,n;
2785       void **list = stb_ps_getlist(sets[i], &n);
2786       memset(actions, 0, sizeof(*actions) * first_nonterm);
2787       for (j=0; j < n; ++j) {
2788          int p = ItemProd(list[j]), c = ItemCursor(list[j]), t = ItemLookahead(list[j]);
2789          if (g.prod[p][c] == 0) {
2790             if (p == init_prod) {
2791                // @TODO: check for conflicts
2792                assert(actions[t].type == A_error || actions[t].type == A_accept);
2793                actions[t].type = A_accept;
2794             } else {
2795                // reduce production p
2796                if (actions[t].type == A_reduce) {
2797                   // is it the same reduction we already have?
2798                   if (actions[t].prod != p) {
2799                      // no, it's a reduce-reduce conflict!
2800                      printf("Reduce-reduce conflict for rule %d and %d, lookahead %d\n", p, actions[t].prod, t);
2801                      // @TODO: use precedence
2802                      actions[t].type = A_conflict;
2803                   }
2804                } else if (actions[t].type == A_shift) {
2805                   printf("Shift-reduce conflict for rule %d and %d, lookahead %d\n", actions[t].prod, p, t);
2806                   actions[t].type = A_conflict;
2807                } else if (actions[t].type == A_accept) {
2808                   assert(0);
2809                } else if (actions[t].type == A_error) {
2810                   actions[t].type = A_reduce;
2811                   actions[t].prod = p;
2812                }
2813             }
2814          } else if (g.prod[p][c] > 0) {
2815             int a = encode_symbol(g.prod[p][c]), k;
2816             stb_ps *out = itemset_goto(g, sets[i], a);
2817             for (k=0; k < stb_arr_len(sets); ++k)
2818                if (stb_ps_eq(sets[k], out))
2819                   break;
2820             assert(k < stb_arr_len(sets));
2821             // shift k
2822             if (actions[a].type == A_shift) {
2823                if (actions[a].value != k) {
2824                   printf("Shift-shift conflict! Rule %d and %d with lookahead %d/%d\n", actions[a].prod, p, a,t);
2825                   actions[a].type = A_conflict;
2826                }
2827             } else if (actions[a].type == A_reduce) {
2828                printf("Shift-reduce conflict for rule %d and %d, lookahead %d/%d\n", p, actions[a].prod, a,t);
2829                actions[a].type = A_conflict;
2830             } else if (actions[a].type == A_accept) {
2831                assert(0);
2832             } else if (actions[a].type == A_error) {
2833                actions[a].type = A_shift;
2834                actions[a].prod = p;
2835                actions[a].cursor = c;
2836                actions[a].value  = k;
2837             }
2838          }
2839       }
2840       // @TODO: recompile actions into p->action_goto
2841    }
2842 
2843    free(mini_rule);
2844    stb_pointer_array_free(g.first , num_symbols); free(g.first );
2845    stb_pointer_array_free(g.follow, num_symbols); free(g.follow);
2846    stb_arr_free(g.prod);
2847    for (i=0; i < num_symbols; ++i)
2848       stb_arr_free(g.prod_by_nt[i]);
2849    free(g.prod_by_nt);
2850    for (i=0; i < stb_arr_len(sets); ++i)
2851       stb_ps_delete(sets[i]);
2852    stb_arr_free(sets);
2853 
2854    return p;
2855 }
2856 
2857 void parser_destroy(Parser *p)
2858 {
2859    free(p);
2860 }
2861 
2862 #if 0
2863 enum nonterm
2864 {
2865    N_globals = -50,
2866    N_global, N_vardef, N_varinitlist, N_varinit, N_funcdef, N_optid, N_optparamlist,
2867    N_paramlist, N_param, N_optinit, N_optcomma, N_statements, N_statement,
2868    N_optexpr, N_assign, N_if, N_ifcore, N_else, N_dictdef, N_dictdef2,
2869    N_dictdefitem, N_expr,
2870    N__last
2871 };
2872 
2873 short grammar[][10] =
2874 {
2875    { N_globals    ,  0, N_globals, N_global                                 },
2876    { N_globals    ,  0                                                      },
2877    { N_global     ,  0, N_vardef                                            },
2878    { N_global     ,  0, N_funcdef                                           },
2879    { N_vardef     ,  0, ST_var, N_varinitlist,                               },
2880    { N_varinitlist,  0, N_varinitlist, ',', N_varinit                       },
2881    { N_varinitlist,  0, N_varinit,                                          },
2882    { N_varinit    ,  0, ST_id, N_optinit,                                    },
2883    { N_funcdef    ,  0, ST_func, N_optid, '(', N_optparamlist, ')', N_statements, ST_end },
2884    { N_optid      ,  0, ST_id                                                },
2885    { N_optid      ,  0,                                                     },
2886    { N_optparamlist, 0,                                                     },
2887    { N_optparamlist, 0, N_paramlist, N_optcomma                             },
2888    { N_paramlist  ,  0, N_paramlist, ',', N_param                           },
2889    { N_paramlist  ,  0, N_param                                             },
2890    { N_param      ,  0, ST_id, N_optinit                                     },
2891    { N_optinit    ,  0, '=', N_expr                                         },
2892    { N_optinit    ,  0,                                                     },
2893    { N_optcomma   ,  0, ','                                                 },
2894    { N_optcomma   ,  0,                                                     },
2895    { N_statements ,  0, N_statements, N_statement                           },
2896    { N_statement  ,  0, N_statement, ';'                                    },
2897    { N_statement  ,  0, N_varinit                                           },
2898    { N_statement  ,  0, ST_return, N_expr                                    },
2899    { N_statement  ,  0, ST_break , N_optexpr                                 },
2900    { N_optexpr    ,  0, N_expr                                              },
2901    { N_optexpr    ,  0,                                                     },
2902    { N_statement  ,  0, ST_continue                                          },
2903    { N_statement  ,  0, N_assign                                            },
2904    { N_assign     ,  0, N_expr, '=', N_assign                               },
2905    //{ N_assign     ,  0, N_expr                                              },
2906    { N_statement  ,  0, ST_while, N_expr, N_statements, ST_end                },
2907    { N_statement  ,  0, ST_if, N_if,                                         },
2908    { N_if         ,  0, N_ifcore, ST_end,                                    },
2909    { N_ifcore     ,  0, N_expr, ST_then, N_statements, N_else, ST_end         },
2910    { N_else       ,  0, ST_elseif, N_ifcore                                  },
2911    { N_else       ,  0, ST_else, N_statements                                },
2912    { N_else       ,  0,                                                     },
2913    { N_dictdef    ,  0, N_dictdef2, N_optcomma                              },
2914    { N_dictdef2   ,  0, N_dictdef2, ',', N_dictdefitem                      },
2915    { N_dictdef2   ,  0, N_dictdefitem                                       },
2916    { N_dictdefitem,  0, ST_id, '=', N_expr                                   },
2917    { N_dictdefitem,  0, N_expr                                              },
2918    { N_expr       ,  0, ST_number                                            },
2919    { N_expr       ,  0, ST_string                                            },
2920    { N_expr       ,  0, ST_id                                                },
2921    { N_expr       ,  0, N_funcdef                                           },
2922    { N_expr       ,  0, '-', N_expr                                         },
2923    { N_expr       ,  0, '{', N_dictdef, '}'                                 },
2924    { N_expr       ,  0, '(', N_expr, ')'                                    },
2925    { N_expr       ,  0, N_expr, '.', ST_id                                   },
2926    { N_expr       ,  0, N_expr, '[', N_expr, ']'                            },
2927    { N_expr       ,  0, N_expr, '(', N_dictdef, ')'                         },
2928 #if 0
2929 #define BINOP(op)  { N_expr, 0, N_expr, op, N_expr }
2930    BINOP(ST_and), BINOP(ST_or), BINOP(ST_eq), BINOP(ST_ne),
2931    BINOP(ST_le),  BINOP(ST_ge), BINOP('>') , BINOP('<' ),
2932    BINOP('&'), BINOP('|'), BINOP('^'), BINOP('+'), BINOP('-'),
2933    BINOP('*'), BINOP('/'), BINOP('%'),
2934 #undef BINOP
2935 #endif
2936 };
2937 
2938 short *grammar_list[stb_arrcount(grammar)];
2939 
2940 void test_parser_generator(void)
2941 {
2942    Parser *p;
2943    int i;
2944    assert(N__last <= 0);
2945    for (i=0; i < stb_arrcount(grammar); ++i)
2946       grammar_list[i] = grammar[i];
2947    p = parser_create(grammar_list, stb_arrcount(grammar), N_globals, 0);
2948    parser_destroy(p);
2949 }
2950 #endif
2951 #endif // parser generator
2952 
2953 #if 0
2954 // stb_threadtest.c
2955 
2956 
2957 #include <windows.h>
2958 #define STB_DEFINE
2959 //#define STB_THREAD_TEST
2960 #include "../stb.h"
2961 
2962 #define NUM_WORK 100
2963 
2964 void *work_consumer(void *p)
2965 {
2966    stb__thread_sleep(20);
2967    return NULL;
2968 }
2969 
2970 int pass;
2971 stb_threadqueue *tq1, *tq2, *tq3, *tq4;
2972 volatile float t1,t2;
2973 
2974 //    with windows.h
2975 // Worked correctly with 100,000,000 enqueue/dequeue WAITLESS
2976 // (770 passes, 170000 per pass)
2977 // Worked correctly with   2,500,000 enqueue/dequeue !WAITLESS
2978 // (15 passes, 170000 per pass)
2979 // Worked correctly with   1,500,000 enqueue/dequeue WAITLESS && STB_THREAD_TEST
2980 // (9 passes, 170000 per pass)
2981 //    without windows.h
2982 // Worked correctly with   1,000,000 enqueue/dequeue WAITLESS && STB_THREAD_TEST
2983 // (6 passes, 170000 per pass)
2984 // Worked correctly with     500,000 enqueue/dequeue !WAITLESS && STB_THREAD_TEST
2985 // (3 passes, 170000 per pass)
2986 // Worked correctly with   1,000,000 enqueue/dequeue WAITLESS
2987 // (15 passes, 170000 per pass)
2988 #define WAITLESS
2989 
2990 volatile int table[1000*1000*10];
2991 
2992 void wait(int n)
2993 {
2994 #ifndef WAITLESS
2995    int j;
2996    float y;
2997    for (j=0; j < n; ++j)
2998       y += 1 / (t1+j);
2999    t2 = y;
3000 #endif
3001 }
3002 
3003 void *tq1_consumer(void *p)
3004 {
3005    for(;;) {
3006       int z;
3007       float y = 0;
3008       stb_threadq_get_block(tq1, &z);
3009       wait(5000);
3010       table[z] = pass;
3011    }
3012 }
3013 
3014 void *tq2_consumer(void *p)
3015 {
3016    for(;;) {
3017       int z;
3018       if (stb_threadq_get(tq2, &z))
3019          table[z] = pass;
3020       wait(1000);
3021    }
3022 }
3023 
3024 void *tq3_consumer(void *p)
3025 {
3026    for(;;) {
3027       int z;
3028       stb_threadq_get_block(tq3, &z);
3029       table[z] = pass;
3030       wait(500);
3031    }
3032 }
3033 
3034 void *tq4_consumer(void *p)
3035 {
3036    for (;;) {
3037       int z;
3038       stb_threadq_get_block(tq4, &z);
3039       table[z] = pass;
3040       wait(500);
3041    }
3042 }
3043 
3044 typedef struct
3045 {
3046    int start, end;
3047    stb_threadqueue *tq;
3048    int delay;
3049 } write_data;
3050 
3051 void *writer(void *q)
3052 {
3053    int i;
3054    write_data *p = (write_data *) q;
3055    for (i=p->start; i < p->end; ++i) {
3056       stb_threadq_add_block(p->tq, &i);
3057       #ifndef WAITLESS
3058       if (p->delay) stb__thread_sleep(p->delay);
3059       else {
3060          int j;
3061          float z = 0;
3062          for (j=0; j <= 20; ++j)
3063             z += 1 / (t1+j);
3064          t2 = z;
3065       }
3066       #endif
3067    }
3068    return NULL;
3069 }
3070 
3071 write_data info[256];
3072 int pos;
3073 
3074 void start_writer(int z, int count, stb_threadqueue *tq, int delay)
3075 {
3076    info[z].start = pos;
3077    info[z].end = pos+count;
3078    info[z].tq = tq;
3079    info[z].delay = delay;
3080    stb_create_thread(writer, &info[z]);
3081    pos += count;
3082 }
3083 
3084 int main(int argc, char **argv)
3085 {
3086    int i;
3087    stb_sync s = stb_sync_new();
3088    stb_sync_set_target(s, NUM_WORK+1);
3089    stb_work_numthreads(2);
3090    for (i=0; i < NUM_WORK; ++i) {
3091       stb_work_reach(work_consumer, NULL, NULL, s);
3092    }
3093    printf("Started stb_work test.\n");
3094 
3095    t1 = 1;
3096 
3097    // create the queues
3098    tq1 = stb_threadq_new(4, 4, TRUE , TRUE);
3099    tq2 = stb_threadq_new(4, 4, TRUE , FALSE);
3100    tq3 = stb_threadq_new(4, 4, FALSE, TRUE);
3101    tq4 = stb_threadq_new(4, 4, FALSE, FALSE);
3102 
3103    // start the consumers
3104    stb_create_thread(tq1_consumer, NULL);
3105    stb_create_thread(tq1_consumer, NULL);
3106    stb_create_thread(tq1_consumer, NULL);
3107 
3108    stb_create_thread(tq2_consumer, NULL);
3109 
3110    stb_create_thread(tq3_consumer, NULL);
3111    stb_create_thread(tq3_consumer, NULL);
3112    stb_create_thread(tq3_consumer, NULL);
3113    stb_create_thread(tq3_consumer, NULL);
3114    stb_create_thread(tq3_consumer, NULL);
3115    stb_create_thread(tq3_consumer, NULL);
3116    stb_create_thread(tq3_consumer, NULL);
3117 
3118    stb_create_thread(tq4_consumer, NULL);
3119 
3120    for (pass=1; pass <= 5000; ++pass) {
3121       int z = 0;
3122       int last_n = -1;
3123       int identical = 0;
3124       pos = 0;
3125       start_writer(z++, 50000, tq1, 0);
3126       start_writer(z++, 50000, tq1, 0);
3127       start_writer(z++, 50000, tq1, 0);
3128 
3129       start_writer(z++, 5000, tq2, 1);
3130       start_writer(z++, 3000, tq2, 3);
3131       start_writer(z++, 2000, tq2, 5);
3132 
3133       start_writer(z++, 5000, tq3, 3);
3134 
3135       start_writer(z++, 5000, tq4, 3);
3136       #ifndef WAITLESS
3137       stb__thread_sleep(8000);
3138       #endif
3139       for(;;) {
3140          int n =0;
3141          for (i=0; i < pos; ++i) {
3142             if (table[i] == pass)
3143                ++n;
3144          }
3145          if (n == pos) break;
3146          if (n == last_n) {
3147             ++identical;
3148             if (identical == 3) {
3149                printf("Problem slots:\n");
3150                for (i=0; i < pos; ++i) {
3151                   if (table[i] != pass) printf("%d ", i);
3152                }
3153                printf("\n");
3154             } else {
3155                if (identical < 3)
3156                   printf("Processed %d of %d\n", n, pos);
3157                else
3158                   printf(".");
3159             }
3160          } else {
3161             identical = 0;
3162             printf("Processed %d of %d\n", n, pos);
3163          }
3164          last_n = n;
3165          #ifdef WAITLESS
3166          stb__thread_sleep(750);
3167          #else
3168          stb__thread_sleep(3000);
3169          #endif
3170       }
3171       printf("Finished pass %d\n", pass);
3172    }
3173 
3174    stb_sync_reach_and_wait(s);
3175    printf("stb_work test completed ok.\n");
3176    return 0;
3177 }
3178 #endif
3179 
3180 
3181 #if 0
3182 //////////////////////////////////////////////////////////////////////////////
3183 //
3184 //   collapse tree leaves up to parents until we only have N nodes
3185 //   useful for cmirror summaries
3186 
3187 typedef struct stb_summary_tree
3188 {
3189    struct stb_summary_tree **children;
3190    int num_children;
3191    float weight;
3192 } stb_summary_tree;
3193 
3194 STB_EXTERN void *stb_summarize_tree(void *tree, int limit, float reweight);
3195 
3196 #ifdef STB_DEFINE
3197 
3198 typedef struct stb_summary_tree2
3199 {
3200    STB__ARR(struct stb_summary_tree2 *) children;
3201    int num_children;
3202    float weight;
3203    float weight_with_all_children;
3204    float makes_target_weight;
3205    float weight_at_target;
3206    stb_summary_tree *original;
3207    struct stb_summary_tree2 *target;
3208    STB__ARR(struct stb_summary_tree2 *) targeters;
3209 } stb_summary_tree2;
3210 
3211 static stb_summary_tree2 *stb__summarize_clone(stb_summary_tree *t)
3212 {
3213    int i;
3214    stb_summary_tree2 *s;
3215    s = (stb_summary_tree2 *) malloc(sizeof(*s));
3216    s->original = t;
3217    s->weight = t->weight;
3218    s->weight_with_all_children = 0;
3219    s->weight_at_target = 0;
3220    s->target = NULL;
3221    s->targeters = NULL;
3222    s->num_children = t->num_children;
3223    s->children = NULL;
3224    for (i=0; i < s->num_children; ++i)
3225       stb_arr_push(s->children, stb__summarize_clone(t->children[i]));
3226    return s;
3227 }
3228 
3229 static float stb__summarize_compute_targets(stb_summary_tree2 *parent, stb_summary_tree2 *node, float reweight, float weight)
3230 {
3231    float total = 0;
3232    if (node->weight == 0 && node->num_children == 1 && parent) {
3233       node->target = parent;
3234       return stb__summarize_compute_targets(parent, node->children[0], reweight, weight*reweight);
3235    } else {
3236       float total=0;
3237       int i;
3238       for (i=0; i < node->num_children; ++i)
3239          total += stb__summarize_compute_targets(node, node->children[i], reweight, reweight);
3240       node->weight_with_all_children = total + node->weight;
3241       if (parent && node->weight_with_all_children) {
3242          node->target = parent;
3243          node->weight_at_target = node->weight_with_all_children * weight;
3244          node->makes_target_weight = node->weight_at_target + parent->weight;
3245          stb_arr_push(parent->targeters, node);
3246       } else {
3247          node->target = NULL;
3248          node->weight_at_target = node->weight;
3249          node->makes_target_weight = 0;
3250       }
3251       return node->weight_with_all_children * weight;
3252    }
3253 }
3254 
3255 static stb_summary_tree2 ** stb__summarize_make_array(STB__ARR(stb_summary_tree2 *) all, stb_summary_tree2 *tree)
3256 {
3257    int i;
3258    stb_arr_push(all, tree);
3259    for (i=0; i < tree->num_children; ++i)
3260       all = stb__summarize_make_array(all, tree->children[i]);
3261    return all;
3262 }
3263 
3264 typedef stb_summary_tree2 * stb__stree2;
3265 stb_define_sort(stb__summarysort, stb__stree2, (*a)->makes_target_weight < (*b)->makes_target_weight)
3266 
3267 void *stb_summarize_tree(void *tree, int limit, float reweight)
3268 {
3269    int i,j,k;
3270    STB__ARR(stb_summary_tree *) ret=NULL;
3271    STB__ARR(stb_summary_tree2 *) all=NULL;
3272 
3273    // first clone the tree so we can manipulate it
3274    stb_summary_tree2 *t = stb__summarize_clone((stb_summary_tree *) tree);
3275    if (reweight < 1) reweight = 1;
3276 
3277    // now compute how far up the tree each node would get pushed
3278    // there's no value in pushing a node up to an empty node with
3279    // only one child, so we keep pushing it up
3280    stb__summarize_compute_targets(NULL, t, reweight, 1);
3281 
3282    all = stb__summarize_make_array(all, t);
3283 
3284    // now we want to iteratively find the smallest 'makes_target_weight',
3285    // update that, and then fix all the others (which will be all descendents)
3286    // to do this efficiently, we need a heap or a sorted binary tree
3287    // what we have is an array. maybe we can insertion sort the array?
3288    stb__summarysort(all, stb_arr_len(all));
3289 
3290    for (i=0; i < stb_arr_len(all) - limit; ++i) {
3291       stb_summary_tree2 *src, *dest;
3292       src = all[i];
3293       dest = all[i]->target;
3294       if (src->makes_target_weight == 0) continue;
3295       assert(dest != NULL);
3296 
3297       for (k=0; k < stb_arr_len(all); ++k)
3298          if (all[k] == dest)
3299             break;
3300       assert(k != stb_arr_len(all));
3301       assert(i < k);
3302 
3303       // move weight from all[i] to target
3304       src->weight = dest->makes_target_weight;
3305       src->weight = 0;
3306       src->makes_target_weight = 0;
3307       // recompute effect of other descendents
3308       for (j=0; j < stb_arr_len(dest->targeters); ++j) {
3309          if (dest->targeters[j]->weight) {
3310             dest->targeters[j]->makes_target_weight = dest->weight + dest->targeters[j]->weight_at_target;
3311             assert(dest->targeters[j]->makes_target_weight <= dest->weight_with_all_children);
3312          }
3313       }
3314       STB_(stb__summarysort,_ins_sort)(all+i, stb_arr_len(all)-i);
3315    }
3316    // now the elements in [ i..stb_arr_len(all) ) are the relevant ones
3317    for (; i < stb_arr_len(all); ++i)
3318       stb_arr_push(ret, all[i]->original);
3319 
3320    // now free all our temp data
3321    for (i=0; i < stb_arr_len(all); ++i) {
3322       stb_arr_free(all[i]->children);
3323       free(all[i]);
3324    }
3325    stb_arr_free(all);
3326    return ret;
3327 }
3328 #endif
3329 
3330 #endif
3331