Subversion Repositories wimsdev

Rev

Rev 3718 | Rev 6876 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
10 reyssat 1
/*    Copyright (C) 1998-2003 XIAO, Gang of Universite de Nice - Sophia Antipolis
2
 *
3
 *  This program is free software; you can redistribute it and/or modify
4
 *  it under the terms of the GNU General Public License as published by
5
 *  the Free Software Foundation; either version 2 of the License, or
6
 *  (at your option) any later version.
7
 *
8
 *  This program is distributed in the hope that it will be useful,
9
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
10
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
11
 *  GNU General Public License for more details.
12
 *
13
 *  You should have received a copy of the GNU General Public License
14
 *  along with this program; if not, write to the Free Software
15
 *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
16
 */
17
 
18
        /* Versatile translation according to a dictionary */
19
 
20
/*************** Customization: change values hereafter ****************/
21
 
22
        /* limit of dictionary entries */
23
#define entrylim 32768
24
        /* limit of dictionary length */
25
#define diclim  2*1024*1024
26
        /* limit of source length */
27
#define sourcelim 16*1024*1024
28
 
29
/***************** Nothing should need change hereafter *****************/
30
 
31
#include "../wims.h"
3718 reyssat 32
#include "../Lib/basicstr.c"
10 reyssat 33
 
34
char *inpbuf, outbuf[2*(MAX_LINELEN+1)];
35
char *dicbuf;
36
struct entry {
37
    unsigned char *original, *replace;
38
    int olen,earlier;
39
} entry[entrylim];
40
int entrycount;
41
 
42
enum {
43
    unk_delete, unk_leave, unk_replace
44
};
45
 
46
int has_digits=0;
47
int unknown_type=unk_delete;
48
int nocase=0,leaveline=0,fromfile=0;
49
char *unknown, unkbuf[1024];
50
 
51
void *xmalloc(size_t n)
52
{
53
    void *p;
54
    p=malloc(n);
55
    if(p==NULL) exit(1);
56
    return p;
57
}
58
 
59
        /* Exit without translating anything */
60
void escape(void)
61
{
62
    printf("%s",inpbuf); exit(0);
63
}
64
 
65
        /* Points to the end of the word */
66
char *find_word_end(char *p)
67
{
68
    int i;
69
    for(i=0;!isspace(*p) && *p!=0 && i<MAX_LINELEN; p++,i++);
70
    return p;
71
}
72
 
73
        /* Strips leading spaces */
74
char *find_word_start(char *p)
75
{
76
    int i;
77
    for(i=0; isspace(*p) && i<MAX_LINELEN; p++,i++);
78
    return p;
79
}
80
 
81
        /* strip trailing spaces; return string end. */
82
char *strip_trailing_spaces(char *p)
83
{
84
    char *pp;
85
    if(*p==0) return p;
86
    for(pp=p+strlen(p)-1; pp>=p && isspace(*pp); *(pp--)=0);
87
    return pp;
88
}
89
 
90
int compare(int i1, const char *s2)
91
{
92
    int k;
3247 bpr 93
    if(nocase) k=strncasecmp((char*)entry[i1].original,s2,entry[i1].olen);
94
    else k=strncmp((char*)entry[i1].original,s2,entry[i1].olen);
10 reyssat 95
    if(k==0 && (isalnum(*(s2+entry[i1].olen)) || (*(s2+entry[i1].olen)&128)!=0)) return -1;
96
    else return k;
97
}
98
 
99
        /* searches a list. Returns index if found, -1 if nomatch.
100
         * Uses binary search, list must be sorted. */
101
int search_list(struct entry *list, int items, size_t item_size, const char *str)
102
{
103
    int i1,i2,j,k,t,t1;
104
    unsigned char c;
105
 
106
    if(items<=0) return -1;
107
    j=0; c=str[0];
108
    k=list[0].original[0]-c; if(k==0) k=compare(0,str);
109
    if(k==0) goto more; if(k>0) return -1;
110
    j=items-1; k=list[j].original[0]-c; if(k==0) k=compare(j,str);
111
    if(k==0) return j;
112
    if(k>0) for(i1=0,i2=j;i2>i1+1;) {
113
        j=i1+(i2-i1)/2;
114
        k=list[j].original[0]-c; if(k==0) k=compare(j,str);
115
        if(k==0) goto more;
116
        if(k>0) {i2=j; continue;}
117
        if(k<0) {i1=j; continue;}      
118
    }
119
    if(k>0) {j--;k=compare(j,str);}
120
    more:
121
    if((t=list[j].earlier)<0) {
122
        if(k==0) return j; else return -1;
123
    }
124
    if(compare(t,str)!=0) return -1;
125
    for(j=t1=t,k=0;j<items && list[j].earlier==t1 && (k=compare(j,str))<=0; j++) {
126
        if(k==0) t=j;
127
    }
128
    return t;
129
}
130
 
131
        /* modify a string. Bufferlen must be ast least 2*MAX_LINELEN */
132
void string_modify(char *start, char *bad_beg, char *bad_end, char *good,...)
133
{
134
    char buf[MAX_LINELEN+1];
135
    va_list vp;
136
 
137
    va_start(vp,good);
138
    vsnprintf(buf,sizeof(buf),good,vp); va_end(vp);
139
    if(strlen(start)-(bad_end-bad_beg)+strlen(buf)>=2*MAX_LINELEN)
140
      return;   /* this is an error situation. */
141
    strcat(buf,bad_end);
3718 reyssat 142
    ovlstrcpy(bad_beg,buf);
10 reyssat 143
}
144
 
145
        /* change all spaces into ' ', and collapse multiple occurences */
146
void singlespace(char *p)
147
{
148
    char *pp, *p2;
149
    for(pp=p;*pp;pp++) {
150
        if(!isspace(*pp)) continue;
151
        if(leaveline) {
3718 reyssat 152
            if(*pp==13) ovlstrcpy(pp,pp+1);
10 reyssat 153
            if(*pp=='\n') {
154
                pp++;
155
                gopt: for(p2=pp; isspace(*p2) && *p2!='\n'; p2++);
3718 reyssat 156
                if(p2>pp) ovlstrcpy(pp,p2); pp--;
10 reyssat 157
            }
158
            else {
159
                pp++; if(!isspace(*pp) || *pp=='\n') continue;
160
                goto gopt;
161
            }
162
        }
163
        else {
164
            if(*pp!=' ') *pp=' ';
165
            pp++; if(!isspace(*pp)) continue;
166
            for(p2=pp;isspace(*p2);p2++);
3718 reyssat 167
            ovlstrcpy(pp,p2); pp--;
10 reyssat 168
        }
169
    }
170
}
171
 
172
#include "suffix.c"
173
 
174
        /* Prepare dictionary */
175
void prepare_dic(void)
176
{
177
    int i,l;
178
    FILE *dicf;
179
    char *fname, *p1, *p2, *pp, buf[1024];
180
    long int flen;
181
    fname=getenv("w_dictionary");
182
    if(fname==NULL || *fname==0 || *fname=='/' || strstr(fname,"..")) {
183
        p1=getenv("w_module"); if(p1 && strncmp(p1,"classes/",strlen("classes/"))==0) {
184
            p1=getenv("w_wims_class"); p2=getenv("w_wims_home");
185
            if(p1 && p2) {
186
                snprintf(buf,sizeof(buf),"%s/log/classes/%s/",p2,p1);
187
                if(strncmp(fname,buf,strlen(buf))!=0) escape();
188
            }
189
            else escape();
190
        }
191
        else {
192
            p1=getenv("untrust"); if(p1 && strstr(p1,"yes")) escape();
193
        }
194
    }
195
    dicf=fopen(fname,"r"); if(dicf==NULL) escape();
196
    fseek(dicf,0,SEEK_END);flen=ftell(dicf); fseek(dicf,0,SEEK_SET);
197
    if(flen>diclim) escape();
198
    dicbuf=xmalloc(flen+16);flen=fread(dicbuf,1,flen,dicf);
199
    fclose(dicf);
200
    if(flen>0 && flen<diclim) dicbuf[flen]=0;
201
    else escape();
202
    for(i=0,p1=dicbuf;p1!=NULL && *p1!=0 && i<entrylim;p1=p2) {
203
        p2=strchr(p1+1,'\n'); if(p2>p1) *p2++=0;
204
        pp=strchr(p1,':'); if(pp==NULL) continue;
205
        *pp++=0;
206
        strip_trailing_spaces(p1); strip_trailing_spaces(pp);
207
        singlespace(p1);
208
        p1=find_word_start(p1); pp=find_word_start(pp);
209
        if(*p1==0) continue;
210
        if(has_digits==0) {
211
            char *p;
212
            for(p=p1;*p!=0 && p<pp && !isdigit(*p);p++);
213
            if(isdigit(*p)) has_digits=1;
214
        }
3247 bpr 215
        entry[i].original=(unsigned char*)p1;
216
        entry[i].replace=(unsigned char*)pp;
10 reyssat 217
        entry[i].olen=l=strlen(p1); entry[i].earlier=-1;
218
        if(i>0) {
219
            int l1,l2;
220
            l1=entry[i-1].earlier; if(l1>=0) l2=entry[l1].olen;
221
            else {l2=entry[i-1].olen;l1=i-1;}
222
            if(l>l2 && isspace(p1[l2])
3247 bpr 223
               && strncmp((char*)entry[l1].original,p1,l2)==0)
10 reyssat 224
              entry[i].earlier=entry[i-1].earlier=l1;
225
        }
226
        i++;
227
    }
228
    entrycount=i; if(entrycount<=0) escape();
229
}
230
 
231
        /* now make the translation. */
232
void translate(void)
233
{
234
    char *p1, *p2, *pp;
235
    int t;
236
 
237
    for(p1=find_word_start(outbuf);
238
        p1!=NULL && p1-outbuf<MAX_LINELEN && *p1!=0;
239
        p1=p2) {
240
        p2=find_word_end(p1);
241
        for(pp=p1;pp<p2 &&
242
            ((!has_digits && isalpha(*pp)) ||
243
             (has_digits && isalnum(*pp)) || (*pp&128)!=0 ||
244
             strchr("_",*pp)!=NULL);pp++);
245
        p2=find_word_start(p2);
246
        if(pp==p1 ||
247
           (has_digits==0 && isdigit(*pp)) ||
248
           (*pp!=0 && !isspace(*pp) && strchr(",.?!/;",*pp)==NULL)) continue;
249
        t=search_list(entry,entrycount,sizeof(entry[0]),p1);
250
        if(t<0) {
251
            switch(unknown_type) {
252
                case unk_leave: break;
253
                case unk_delete: {
3718 reyssat 254
                    ovlstrcpy(p1,find_word_start(pp)); p2=p1;
10 reyssat 255
                    break;
256
                }
257
                case unk_replace: {
258
                    string_modify(outbuf,p1,pp,unkbuf);
259
                    p2=find_word_start(p1+strlen(unkbuf));
260
                }
261
            }
262
            continue;
263
        }
3247 bpr 264
        string_modify(outbuf,p1,p1+strlen((char*)entry[t].original),
265
                      (char*)entry[t].replace);
266
        p2=find_word_start(p1+strlen((char*)entry[t].replace));
10 reyssat 267
    }
268
    outbuf[MAX_LINELEN]=0; printf("%s",outbuf);
269
}
270
 
271
void switches(void)
272
{
273
    char *sw;
274
    unknown=getenv("w_translator_unknown");
275
    if(unknown==NULL) unknown="";
276
    snprintf(unkbuf,sizeof(unkbuf),"%s",find_word_start(unknown));
277
    *find_word_end(unkbuf)=0;
278
    if(strcasecmp(unkbuf,"leave")==0) unknown_type=unk_leave;
279
    else if(unkbuf[0]!=0) unknown_type=unk_replace;
280
    sw=getenv("w_translator_switch");
281
    if(sw==NULL) return;
282
    if(strstr(sw,"leaveline")) leaveline=1;
283
    if(strstr(sw,"nocase")) nocase=1;
284
    if(strstr(sw,"file")) fromfile=1;
285
}
286
 
287
int main()
288
{
289
    char c, *p1, *p2, *s;
290
    unsigned int l;
291
 
292
    switches();
293
    if(!fromfile) {
294
        s=getenv("wims_exec_parm");
295
        if(s==NULL || *s==0) return 0;  /* Nothing to translate */
296
        l=strlen(s); if(l<=0 || l>sourcelim) return 0; /* too long */
297
        inpbuf=xmalloc(l+16); memmove(inpbuf,s,l+1);
298
    }
299
    else {
300
        FILE *f;
301
        s=getenv("translator_input"); if(s==NULL || *s==0) return 0;
302
        f=fopen(s,"r"); if(f==NULL) return 0; /* no file */
303
        fseek(f,0,SEEK_END); l=ftell(f); fseek(f,0,SEEK_SET);
304
        if(l<=0 || l>sourcelim) return 0; /* too long */
3840 kbelabas 305
        inpbuf=xmalloc(l+16); (void)fread(inpbuf,1,l,f); fclose(f); inpbuf[l]=0;
10 reyssat 306
    }
307
    p1=inpbuf; prepare_dic();
308
    if(leaveline) c='\n'; else c=' ';
309
    do {
310
        l=strlen(p1);
311
        if(l>MAX_LINELEN-1024) l=MAX_LINELEN-1024; p2=p1+l;
312
        if(*p2) {
313
            while(p2>p1 && *p2!=c) p2--;
314
        }
315
        if(p2<=p1) return 0;
316
        memmove(outbuf,p1,p2-p1); outbuf[p2-p1]=0;
317
        singlespace(outbuf);
318
        s=getenv("w_suffix_dictionary");
319
        if(s!=NULL && *s!=0) suffix(outbuf,s);
320
        translate();
321
        if(*p2==c) {printf("%c",c); p1=++p2;}
322
    }
323
    while(*p2);
324
    return 0;
325
}
326