1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
diff -urN aspell-0.50.5/prog/compress.c aspell-0.50.5.new/prog/compress.c
--- aspell-0.50.5/prog/compress.c 2002-08-31 11:51:11.000000000 -0700
+++ aspell-0.50.5.new/prog/compress.c 2004-06-16 10:14:42.000000000 -0700
@@ -28,6 +28,11 @@
#endif
+#define WORD_BUFF_SIZE 256
+
+int count = 0;
+
+
void usage ()
{
fputs("Compresses or uncompresses sorted word lists.\n" , stderr);
@@ -45,8 +50,9 @@
if (c == EOF) return 0;
do {
*w++ = (char)(c);
- } while (c = getc(in), c != EOF && c > 32);
+ } while (c = getc(in), c != EOF && c > 32 && count < (WORD_BUFF_SIZE - 1));
*w = '\0';
+ count++;
ungetc(c, in);
if (c == EOF) return 0;
else return 1;
@@ -61,14 +67,15 @@
} else if (argv[1][0] == 'c') {
- char s1[256];
- char s2[256];
+ char s1[WORD_BUFF_SIZE];
+ char s2[WORD_BUFF_SIZE];
char * prev = s2;
char * cur = s1;
*prev = '\0';
SETBIN (stdout);
+ while (count < WORD_BUFF_SIZE) {
while (get_word(stdin, cur)) {
int i = 0;
/* get the length of the prefix */
@@ -85,11 +92,12 @@
prev = s2; cur = s1;
}
}
+ }
return 0;
} else if (argv[1][0] == 'd') {
- char cur[256];
+ char cur[WORD_BUFF_SIZE];
int i;
int c;
@@ -100,8 +108,11 @@
if (i == 0)
i = getc(stdin);
--i;
- while ((c = getc(stdin)) > 32)
+ while ((c = getc(stdin)) > 32 && i < (WORD_BUFF_SIZE -1)) {
cur[i++] = (char)c;
+ count++;
+ }
+
cur[i] = '\0';
fputs(cur, stdout);
putc('\n', stdout);
|
GitWeb
