| … | |
… | |
| 51 | #include <uudeview.h> |
51 | #include <uudeview.h> |
| 52 | #include <uuint.h> |
52 | #include <uuint.h> |
| 53 | #include <fptools.h> |
53 | #include <fptools.h> |
| 54 | #include <uustring.h> |
54 | #include <uustring.h> |
| 55 | |
55 | |
| 56 | char * uucheck_id = "$Id: uucheck.c,v 1.30 2020/12/13 03:29:40 root Exp $"; |
56 | char * uucheck_id = "$Id: uucheck.c,v 1.31 2020/12/13 03:31:02 root Exp $"; |
| 57 | |
57 | |
| 58 | /* |
58 | /* |
| 59 | * Arbitrary number. This is the maximum number of part numbers we |
59 | * Arbitrary number. This is the maximum number of part numbers we |
| 60 | * store for our have-parts and missing-parts lists |
60 | * store for our have-parts and missing-parts lists |
| 61 | */ |
61 | */ |
| … | |
… | |
| 1012 | * (g) The yencode file size matches. |
1012 | * (g) The yencode file size matches. |
| 1013 | * (2) The MIME-IDs match |
1013 | * (2) The MIME-IDs match |
| 1014 | */ |
1014 | */ |
| 1015 | |
1015 | |
| 1016 | /* TODO: use two hash tables, keyed on filename and mimeid */ |
1016 | /* TODO: use two hash tables, keyed on filename and mimeid */ |
| 1017 | /* unfortunately, its not so easy, as lots of code inserts in interesting ways */ |
1017 | /* unfortunately, its not so easy, as lots of code inserts in interesting ways, */ |
|
|
1018 | /* so I tried to conventionally speed up the search by replacing strcmp with */ |
|
|
1019 | /* hash comparisons, reordering and prefetching struct members and so on */ |
| 1018 | |
1020 | |
| 1019 | /* |
1021 | /* |
| 1020 | * check if this part wants to be left alone. If so, don't bother |
1022 | * check if this part wants to be left alone. If so, don't bother |
| 1021 | * to do all the checks |
1023 | * to do all the checks |
| 1022 | */ |
1024 | */ |
