| … | |
… | |
| 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.17 2009/08/24 06:15:00 root Exp $"; |
56 | char * uucheck_id = "$Id: uucheck.c,v 1.18 2009/10/13 20:53:49 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 | */ |
| … | |
… | |
| 1371 | } |
1371 | } |
| 1372 | |
1372 | |
| 1373 | fiter = fiter->NEXT; |
1373 | fiter = fiter->NEXT; |
| 1374 | |
1374 | |
| 1375 | while (fiter != NULL) { |
1375 | while (fiter != NULL) { |
| 1376 | for (count=part+1; count<fiter->partno && miscount<MAXPLIST; count++) |
1376 | for (count = part+1; count < fiter->partno && miscount < MAXPLIST; count++) |
| 1377 | misparts[miscount++] = count; |
1377 | misparts[miscount++] = count; |
| 1378 | |
1378 | |
| 1379 | part = fiter->partno; |
1379 | part = fiter->partno; |
| 1380 | |
1380 | |
| 1381 | if (havecount<MAXPLIST) |
1381 | if (havecount < MAXPLIST) |
| 1382 | haveparts[havecount++]=part; |
1382 | haveparts[havecount++] = part; |
| 1383 | |
1383 | |
| 1384 | if (fiter->data->begin) flag |= 1; |
1384 | if (fiter->data->begin) flag |= 1; |
| 1385 | if (fiter->data->end) flag |= 2; |
1385 | if (fiter->data->end) flag |= 2; |
| 1386 | if (fiter->data->uudet) flag |= 4; |
1386 | if (fiter->data->uudet) flag |= 4; |
| 1387 | |
1387 | |
