-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
makedent.c
1251 lines (1181 loc) · 35.2 KB
/
makedent.c
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#ifndef lint
static char Rcs_Id[] =
"$Id: makedent.c,v 1.62 2021-01-09 13:12:35-08 geoff Exp $";
#endif
/*
* Copyright 1988, 1989, 1992, 1993, 1999, 2001, 2005, Geoff Kuenning,
* Claremont, CA
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All modifications to the source code must be clearly marked as
* such. Binary redistributions based on modified source code
* must be clearly marked as modified versions in the documentation
* and/or other materials provided with the distribution.
* 4. The code that causes the 'ispell -v' command to display a prominent
* link to the official ispell Web site may not be removed.
* 5. The name of Geoff Kuenning may not be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY GEOFF KUENNING AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL GEOFF KUENNING OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* $Log: makedent.c,v $
* Revision 1.62 2021-01-09 13:12:35-08 geoff
* Rewrite the binary search in stringcharlen to use the new ordering of
* stringchars, which uses the character type as the major sort key and
* the character itself as the secondary key.
*
* Revision 1.61 2020-12-30 22:33:41-08 geoff
* Fix a binary-search bug that could cause string characters to not be
* found in some situations.
*
* Revision 1.60 2005-11-03 14:14:26-08 geoff
* When combining capitals, insert new variants at the end of the variant
* list. This maintains the order of variants in the personal dictionary.
*
* Revision 1.59 2005/04/20 23:16:32 geoff
* Rename some variables to make them more meaningful.
*
* Revision 1.58 2005/04/14 23:11:36 geoff
* Move initck from ispell.c.
*
* Revision 1.57 2005/04/14 15:19:37 geoff
* Stick in a couple of strategic const declarations.
*
* Revision 1.56 2001/09/06 00:30:28 geoff
* Many changes from Eli Zaretskii to support DJGPP compilation.
*
* Revision 1.55 2001/07/25 21:51:46 geoff
* Minor license update.
*
* Revision 1.54 2001/07/23 20:24:04 geoff
* Update the copyright and the license.
*
* Revision 1.53 2001/06/14 09:11:11 geoff
* Use a non-conflicting macro for bzero to avoid compilation problems on
* smarter compilers.
*
* Revision 1.52 2000/08/22 10:52:25 geoff
* Fix a whole bunch of signed/unsigned discrepancies.
*
* Revision 1.51 1999/01/18 03:28:37 geoff
* Turn many char declarations into unsigned char, so that we won't have
* sign-extension problems.
*
* Revision 1.50 1999/01/07 01:23:09 geoff
* Update the copyright.
*
* Revision 1.49 1999/01/03 01:46:39 geoff
* Add support for the "plain" deformatters.
*
* Revision 1.48 1998/07/06 05:03:39 geoff
* Don't issue bad-flag messages in -a mode; it confuses emacs
*
* Revision 1.47 1997/12/02 06:24:58 geoff
* Get rid of some compile options that really shouldn't be optional.
*
* Revision 1.46 1995/11/08 05:09:20 geoff
* Allow sgml as a deformatter type.
*
* Revision 1.45 1994/12/27 23:08:52 geoff
* Add code to makedent to reject words that contain non-word characters.
* This helps protect people who use ISO 8-bit characters when ispell
* isn't configured for that option.
*
* Revision 1.44 1994/10/25 05:46:20 geoff
* Fix some incorrect declarations in the lint versions of some routines.
*
* Revision 1.43 1994/09/16 03:32:34 geoff
* Issue an error message for bad affix flags
*
* Revision 1.42 1994/02/07 04:23:43 geoff
* Correctly identify the deformatter when changing file types
*
* Revision 1.41 1994/01/25 07:11:55 geoff
* Get rid of all old RCS log lines in preparation for the 3.1 release.
*
*/
#include "config.h"
#include "ispell.h"
#include "proto.h"
#include "msgs.h"
#include <ctype.h>
int makedent P ((unsigned char * lbuf, int lbuflen,
struct dent * ent));
long whatcap P ((ichar_t * word));
int addvheader P ((struct dent * ent));
int combinecaps P ((struct dent * hdr, struct dent * newent));
static void forcevheader P ((struct dent * hdrp, struct dent * oldp,
struct dent * newp));
static int combine_two_entries P ((struct dent * hdrp,
struct dent * oldp, struct dent * newp));
static int acoversb P ((struct dent * enta, struct dent * entb));
void upcase P ((ichar_t * string));
void lowcase P ((ichar_t * string));
void chupcase P ((unsigned char * s));
static int issubset P ((struct dent * ent1, struct dent * ent2));
static void combineaffixes P ((struct dent * ent1, struct dent * ent2));
void toutent P ((FILE * outfile, struct dent * hent,
int onlykeep));
static void toutword P ((FILE * outfile, unsigned char * word,
struct dent * cent));
static void flagout P ((FILE * outfile, int flag));
int stringcharlen P ((unsigned char * bufp, int canonical));
int strtoichar P ((ichar_t * out, unsigned char * in, int outlen,
int canonical));
int ichartostr P ((unsigned char * out, const ichar_t * in,
int outlen, int canonical));
ichar_t * strtosichar P ((unsigned char * in, int canonical));
unsigned char * ichartosstr P ((const ichar_t * in, int canonical));
char * printichar P ((int in));
#ifndef ICHAR_IS_CHAR
ichar_t * icharcpy P ((ichar_t * out, ichar_t * in));
int icharlen P ((ichar_t * str));
int icharcmp P ((ichar_t * s1, ichar_t * s2));
int icharncmp P ((ichar_t * s1, ichar_t * s2, int n));
#endif /* ICHAR_IS_CHAR */
int findfiletype P ((char * name, int searchnames,
int * deformatter));
void initckch P ((const char * wchars));
static int has_marker;
/*
* Fill in a directory entry, including setting the capitalization flags, and
* allocate and initialize memory for the d->word field. Returns -1
* if there was trouble. The input word must be in canonical form.
*/
int makedent (lbuf, lbuflen, d)
unsigned char * lbuf;
int lbuflen;
struct dent * d;
{
ichar_t ibuf[INPUTWORDLEN + MAXAFFIXLEN];
ichar_t * ip;
unsigned char * p;
int bit;
int len;
/* Strip off any trailing newlines and returns */
len = (int) strlen ((char *) lbuf) - 1;
while (len >= 0 && (lbuf[len] == '\n' || lbuf[len] == '\r'))
lbuf[len--] = '\0';
d->next = NULL;
/* WARNING: flagfield might be the same as mask! See ispell.h. */
d->flagfield = 0;
(void) BZERO ((char *) d->mask, sizeof (d->mask));
d->flagfield |= USED;
d->flagfield &= ~KEEP;
p = (unsigned char *) index ((char *) lbuf, hashheader.flagmarker);
if (p != NULL)
*p = 0;
/*
** Convert the word to an ichar_t and back; this makes sure that
** it is in canonical form and thus that the length is correct.
*/
if (strtoichar (ibuf, lbuf, INPUTWORDLEN * sizeof (ichar_t), 1)
|| ichartostr (lbuf, ibuf, lbuflen, 1))
{
(void) fprintf (stderr, WORD_TOO_LONG ((char *) lbuf));
return (-1);
}
/*
** Make sure the word is well-formed (contains only legal characters).
*/
for (ip = ibuf; *ip != 0; ip++)
{
if (!iswordch (*ip))
{
/* Boundary characters are legal as long as they're not at edges */
if (!isboundarych (*ip)
|| ip == ibuf || ip[1] == 0)
{
(void) fprintf (stderr, MAKEDENT_C_BAD_WORD_CHAR,
MAYBE_CR (stderr), (char *) lbuf, MAYBE_CR (stderr));
return -1;
}
}
}
len = (int) strlen ((char *) lbuf);
/*
** Figure out the capitalization rules from the capitalization of
** the sample entry.
*/
d->flagfield |= whatcap (ibuf);
if (len > INPUTWORDLEN - 1)
{
(void) fprintf (stderr, WORD_TOO_LONG ((char *) lbuf));
return (-1);
}
d->word = mymalloc ((unsigned) len + 1);
if (d->word == NULL)
{
(void) fprintf (stderr, MAKEDENT_C_NO_WORD_SPACE,
MAYBE_CR (stderr), (char *) lbuf, MAYBE_CR (stderr));
return -1;
}
(void) strcpy ((char *) d->word, (char *) lbuf);
if (captype (d->flagfield) != FOLLOWCASE)
chupcase (d->word);
if (p == NULL)
return (0);
p++;
while (*p != '\0' && *p != '\n')
{
bit = CHARTOBIT ((unsigned char) *p);
if (bit >= 0 && bit <= LARGESTFLAG)
SETMASKBIT (d->mask, bit);
else if (!aflag)
(void) fprintf (stderr, BAD_FLAG,
MAYBE_CR (stderr), (unsigned char) *p, MAYBE_CR (stderr));
p++;
if (*p == hashheader.flagmarker)
p++; /* Handle old-format dictionaries too */
}
return (0);
}
/*
** Classify the capitalization of a sample entry. Returns one of the
** four capitalization codes ANYCASE, ALLCAPS, CAPITALIZED, or FOLLOWCASE.
*/
long whatcap (word)
register ichar_t * word;
{
register ichar_t * p;
for (p = word; *p; p++)
{
if (mylower (*p))
break;
}
if (*p == '\0')
return ALLCAPS;
else
{
for ( ; *p; p++)
{
if (myupper (*p))
break;
}
if (*p == '\0')
{
/*
** No uppercase letters follow the lowercase ones.
** If there is more than one uppercase letter, it's
** "followcase". If only the first one is capitalized,
** it's "capitalize". If there are no capitals
** at all, it's ANYCASE.
*/
if (myupper (word[0]))
{
for (p = word + 1; *p != '\0'; p++)
{
if (myupper (*p))
return FOLLOWCASE;
}
return CAPITALIZED;
}
else
return ANYCASE;
}
else
return FOLLOWCASE; /* .../lower/upper */
}
}
/*
** Add a variant-capitalization header to a word. This routine may be
** called even for a followcase word that doesn't yet have a header.
**
** Returns 0 if all was ok, -1 if allocation error.
*/
int addvheader (dp)
register struct dent * dp; /* Entry to update */
{
register struct dent * tdent; /* Copy of entry */
/*
** Add a second entry with the correct capitalization, and then make
** dp into a special dummy entry.
*/
tdent = (struct dent *) mymalloc (sizeof (struct dent));
if (tdent == NULL)
{
(void) fprintf (stderr, MAKEDENT_C_NO_WORD_SPACE,
MAYBE_CR (stderr), (char *) dp->word, MAYBE_CR (stderr));
return -1;
}
*tdent = *dp;
if (captype (tdent->flagfield) != FOLLOWCASE)
tdent->word = NULL;
else
{
/* Followcase words need a copy of the capitalization */
tdent->word =
mymalloc ((unsigned int) strlen ((char *) tdent->word) + 1);
if (tdent->word == NULL)
{
(void) fprintf (stderr, MAKEDENT_C_NO_WORD_SPACE,
MAYBE_CR (stderr), (char *) dp->word, MAYBE_CR (stderr));
myfree ((char *) tdent);
return -1;
}
(void) strcpy ((char *) tdent->word, (char *) dp->word);
}
chupcase (dp->word);
dp->next = tdent;
dp->flagfield &= ~CAPTYPEMASK;
dp->flagfield |= (ALLCAPS | MOREVARIANTS);
return 0;
}
/*
** Combine and resolve the entries describing two capitalizations of the same
** word. This may require allocating yet more entries.
**
** Hdrp is a pointer into a hash table. If the word covered by hdrp has
** variations, hdrp must point to the header. Newp is a pointer to temporary
** storage, and space is malloc'ed if newp is to be kept. The newp->word
** field must have been allocated with mymalloc, so that this routine may free
** the space if it keeps newp but not the word.
**
** Return value: 0 if the word was added, 1 if the word was combined
** with an existing entry, and -1 if trouble occurred (e.g., malloc).
** If 1 is returned, newp->word may have been be freed using myfree.
**
** Life is made much more difficult by the KEEP flag's possibilities. We
** must ensure that a !KEEP word doesn't find its way into the personal
** dictionary as a result of this routine's actions. However, a !KEEP
** word that has affixes must have come from the main dictionary, so it
** is acceptable to combine entries in that case (got that?).
**
** The net result of all this is a set of rules that is a bloody pain
** to figure out. Basically, we want to choose one of the following actions:
**
** (1) Add newp's affixes and KEEP flag to oldp, and discard newp.
** (2) Add oldp's affixes and KEEP flag to newp, replace oldp with
** newp, and discard newp.
** (3) Insert newp as a new entry in the variants list. If there is
** currently no variant header, this requires adding one. Adding a
** header splits into two sub-cases:
**
** (3a) If oldp is ALLCAPS and the KEEP flags match, just turn it
** into the header.
** (3b) Otherwise, add a new entry to serve as the header.
** To ease list linking, this is done by copying oldp into
** the new entry, and then performing (3a).
**
** After newp has been added as a variant, its affixes and KEEP
** flag are OR-ed into the variant header.
**
** So how to choose which? The default is always case (3), which adds newp
** as a new entry in the variants list. Cases (1) and (2) are symmetrical
** except for which entry is discarded. We can use case (1) or (2) whenever
** one entry "covers" the other. "Covering" is defined as follows:
**
** (4) For entries with matching capitalization types, A covers B
** if:
**
** (4a) B's affix flags are a subset of A's, or the KEEP flags
** match, and
** (4b) either the KEEP flags match, or A's KEEP flag is set.
** (Since A has more suffixes, combining B with it won't
** cause any extra suffixes to be added to the dictionary.)
** (4c) If the words are FOLLOWCASE, the capitalizations match
** exactly.
**
** (5) For entries with mismatched capitalization types, A covers B
** if (4a) and (4b) are true, and:
**
** (5a) B is ALLCAPS, or
** (5b) A is ANYCASE, and B is CAPITALIZED.
**
** For any "hdrp" without variants, oldp is the same as hdrp. Otherwise,
** the above tests are applied using each variant in turn for oldp.
*/
int combinecaps (hdrp, newp)
struct dent * hdrp; /* Header of entry currently in dictionary */
register struct dent *
newp; /* Entry to add */
{
register struct dent *
oldp; /* Current "oldp" entry */
register struct dent *
tdent; /* Entry we'll add to the dictionary */
register int retval = 0; /* Return value from combine_two_entries */
/*
** First, see if we can combine the two entries (cases 1 and 2). If
** combine_two_entries does so, it will return 1. If it has trouble,
** it will return zero.
*/
oldp = hdrp;
if ((oldp->flagfield & (CAPTYPEMASK | MOREVARIANTS))
== (ALLCAPS | MOREVARIANTS))
{
while (oldp->flagfield & MOREVARIANTS)
{
oldp = oldp->next;
retval = combine_two_entries (hdrp, oldp, newp);
if (retval != 0) /* Did we combine them? */
break;
}
}
else
retval = combine_two_entries (hdrp, oldp, newp);
if (retval == 0)
{
/*
** Couldn't combine the two entries. Add a new variant. We
** stick it at the end of the variant list because it's
** important to maintain order; this causes the personal
** dictionary to have a stable ordering.
*/
forcevheader (hdrp, oldp, newp);
tdent = (struct dent *) mymalloc (sizeof (struct dent));
if (tdent == NULL)
{
(void) fprintf (stderr, MAKEDENT_C_NO_WORD_SPACE,
MAYBE_CR (stderr), (char *) newp->word, MAYBE_CR (stderr));
return -1;
}
*tdent = *newp;
for (oldp = hdrp;
oldp->next != NULL && oldp->flagfield & MOREVARIANTS;
oldp = oldp->next)
;
tdent->next = oldp->next;
oldp->next = tdent;
oldp->flagfield |= MOREVARIANTS;
combineaffixes (hdrp, newp);
hdrp->flagfield |= (newp->flagfield & KEEP);
if (captype (newp->flagfield) == FOLLOWCASE)
tdent->word = newp->word;
else
{
tdent->word = NULL;
myfree (newp->word); /* newp->word isn't needed */
}
}
return retval;
}
/*
** The following routine implements steps 3a and 3b in the commentary
** for "combinecaps".
*/
static void forcevheader (hdrp, oldp, newp)
register struct dent * hdrp;
struct dent * oldp;
struct dent * newp;
{
if ((hdrp->flagfield & (CAPTYPEMASK | MOREVARIANTS)) == ALLCAPS
&& ((oldp->flagfield ^ newp->flagfield) & KEEP) == 0)
return; /* Caller will set MOREVARIANTS */
else if ((hdrp->flagfield & (CAPTYPEMASK | MOREVARIANTS))
!= (ALLCAPS | MOREVARIANTS))
(void) addvheader (hdrp);
}
/*
** This routine implements steps 4 and 5 of the commentary for "combinecaps".
**
** Returns 1 if newp can be discarded, 0 if nothing done.
*/
static int combine_two_entries (hdrp, oldp, newp)
struct dent * hdrp; /* (Possible) header of variant chain */
register struct dent *
oldp; /* Pre-existing dictionary entry */
register struct dent *
newp; /* Entry to possibly combine */
{
if (acoversb (oldp, newp))
{
/* newp is superfluous. Drop it, preserving affixes and keep flag */
combineaffixes (oldp, newp);
oldp->flagfield |= (newp->flagfield & KEEP);
hdrp->flagfield |= (newp->flagfield & KEEP);
myfree (newp->word);
return 1;
}
else if (acoversb (newp, oldp))
{
/*
** oldp is superfluous. Replace it with newp, preserving affixes and
** the keep flag.
*/
combineaffixes (newp, oldp);
newp->flagfield |= (oldp->flagfield & (KEEP | MOREVARIANTS));
hdrp->flagfield |= (newp->flagfield & KEEP);
newp->next = oldp->next;
/*
** We really want to free oldp->word, but that might be part of
** "hashstrings". So we'll futz around to arrange things so we can
** free newp->word instead. This depends very much on the fact
** that both words are the same length.
*/
if (oldp->word != NULL)
(void) strcpy ((char *) oldp->word, (char *) newp->word);
myfree (newp->word); /* No longer needed */
newp->word = oldp->word;
*oldp = *newp;
/* We may need to add a header if newp is followcase */
if (captype (newp->flagfield) == FOLLOWCASE
&& (hdrp->flagfield & (CAPTYPEMASK | MOREVARIANTS))
!= (ALLCAPS | MOREVARIANTS))
(void) addvheader (hdrp);
return 1;
}
else
return 0;
}
/*
** Determine if enta covers entb, according to the rules in steps 4 and 5
** of the commentary for "combinecaps".
*/
static int acoversb (enta, entb)
register struct dent * enta; /* "A" in the rules */
register struct dent * entb; /* "B" in the rules */
{
int subset; /* NZ if entb is a subset of enta */
if ((subset = issubset (entb, enta)) != 0)
{
/* entb is a subset of enta; thus enta might cover entb */
if (((enta->flagfield ^ entb->flagfield) & KEEP) != 0
&& (enta->flagfield & KEEP) == 0) /* Inverse of condition (4b) */
return 0;
}
else
{
/* not a subset; KEEP flags must match exactly (both (4a) and (4b)) */
if (((enta->flagfield ^ entb->flagfield) & KEEP) != 0)
return 0;
}
/* Rules (4a) and (4b) are satisfied; check for capitalization match */
if (((enta->flagfield ^ entb->flagfield) & CAPTYPEMASK) == 0)
{
if (captype (enta->flagfield) != FOLLOWCASE /* Condition (4c) */
|| strcmp ((char *) enta->word, (char *) entb->word) == 0)
return 1; /* Perfect match */
else
return 0;
}
else if (subset == 0) /* No flag subset, refuse */
return 0; /* ..near matches */
else if (captype (entb->flagfield) == ALLCAPS)
return 1;
else if (captype (enta->flagfield) == ANYCASE
&& captype (entb->flagfield) == CAPITALIZED)
return 1;
else
return 0;
}
void upcase (s)
register ichar_t * s;
{
while (*s)
{
*s = mytoupper (*s);
s++;
}
}
void lowcase (s)
register ichar_t * s;
{
while (*s)
{
*s = mytolower (*s);
s++;
}
}
/*
* Upcase variant that works on normal strings. Note that it is a lot
* slower than the normal upcase. The input must be in canonical form.
*/
void chupcase (s)
unsigned char * s;
{
ichar_t * is;
is = strtosichar (s, 1);
upcase (is);
(void) ichartostr (s, is, strlen ((char *) s) + 1, 1);
}
/*
** See if one affix field is a subset of another. Returns NZ if ent1
** is a subset of ent2. The KEEP flag is not taken into consideration.
*/
static int issubset (ent1, ent2)
register struct dent * ent1;
register struct dent * ent2;
{
/* The following is really testing for MASKSIZE > 1, but cpp can't do that */
#if MASKBITS > 32
register int flagword;
#ifdef FULLMASKSET
#define MASKMAX MASKSIZE
#else
#define MASKMAX MASKSIZE - 1
#endif /* FULLMASKSET */
for (flagword = MASKMAX; --flagword >= 0; )
{
if ((ent1->mask[flagword] & ent2->mask[flagword])
!= ent1->mask[flagword])
return 0;
}
#endif /* MASKBITS > 32 */
#ifdef FULLMASKSET
return ((ent1->mask[MASKSIZE - 1] & ent2->mask[MASKSIZE - 1])
== ent1->mask[MASKSIZE - 1]);
#else
if (((ent1->mask[MASKSIZE - 1] & ent2->mask[MASKSIZE - 1])
^ ent1->mask[MASKSIZE - 1]) & ~ALLFLAGS)
return 0;
else
return 1;
#endif /* FULLMASKSET */
}
/*
** Add ent2's affix flags to ent1.
*/
static void combineaffixes (ent1, ent2)
register struct dent * ent1;
register struct dent * ent2;
{
/* The following is really testing for MASKSIZE > 1, but cpp can't do that */
#if MASKBITS > 32
register int flagword;
if (ent1 == ent2)
return;
/* MASKMAX is defined in issubset, just above */
for (flagword = MASKMAX; --flagword >= 0; )
ent1->mask[flagword] |= ent2->mask[flagword];
#endif /* MASKBITS > 32 */
#ifndef FULLMASKSET
ent1->mask[MASKSIZE - 1] |= ent2->mask[MASKSIZE - 1] & ~ALLFLAGS;
#endif
}
/*
** Write out a dictionary entry, including capitalization variants.
** If onlykeep is true, only those variants with KEEP set will be
** written.
*/
void toutent (toutfile, hent, onlykeep)
register FILE * toutfile;
struct dent * hent;
register int onlykeep;
{
register struct dent * cent;
ichar_t wbuf[INPUTWORDLEN + MAXAFFIXLEN];
cent = hent;
if (strtoichar (wbuf, cent->word, INPUTWORDLEN, 1))
(void) fprintf (stderr, WORD_TOO_LONG ((char *) cent->word));
for ( ; ; )
{
if (!onlykeep || (cent->flagfield & KEEP))
{
switch (captype (cent->flagfield))
{
case ANYCASE:
lowcase (wbuf);
toutword (toutfile, ichartosstr (wbuf, 1), cent);
break;
case ALLCAPS:
if ((cent->flagfield & MOREVARIANTS) == 0
|| cent != hent)
{
upcase (wbuf);
toutword (toutfile, ichartosstr (wbuf, 1), cent);
}
break;
case CAPITALIZED:
lowcase (wbuf);
wbuf[0] = mytoupper (wbuf[0]);
toutword (toutfile, ichartosstr (wbuf, 1), cent);
break;
case FOLLOWCASE:
toutword (toutfile, cent->word, cent);
break;
}
}
if (cent->flagfield & MOREVARIANTS)
cent = cent->next;
else
break;
}
}
static void toutword (toutfile, word, cent)
register FILE * toutfile;
unsigned char * word;
register struct dent * cent;
{
register int bit;
has_marker = 0;
(void) fprintf (toutfile, "%s", (char *) word);
for (bit = 0; bit < LARGESTFLAG; bit++)
{
if (TSTMASKBIT (cent->mask, bit))
flagout (toutfile, BITTOCHAR (bit));
}
(void) fprintf (toutfile, "\n");
}
static void flagout (toutfile, flag)
register FILE * toutfile;
int flag;
{
if (!has_marker)
(void) putc (hashheader.flagmarker, toutfile);
has_marker = 1;
(void) putc (flag, toutfile);
}
/*
* If the string under the given pointer begins with a string character,
* return the length of that "character". If not, return 0.
* May be called any time, but it's best if "isstrstart" is first
* used to filter out unnecessary calls.
*
* As a side effect, "laststringch" is set to the number of the string
* found, or to -1 if none was found. This can be useful for such things
* as case conversion.
*/
int stringcharlen (bufp, canonical)
unsigned char * bufp;
int canonical; /* NZ if input is in canonical form */
{
#ifdef SLOWMULTIPLY
static int * gp[MAXSTRINGCHARS];
/* Pointers to groupnos */
static unsigned char *
sp[MAXSTRINGCHARS];
static int inited = 0;
#endif /* SLOWMULTIPLY */
register unsigned char *
bufcur;
register unsigned char *
stringcur;
register int stringno;
register int lowstringno;
register int highstringno;
int dupwanted;
#ifdef SLOWMULTIPLY
if (!inited)
{
inited = 1;
for (stringno = 0; stringno < MAXSTRINGCHARS; stringno++)
{
gp[stringno] = &hashheader.groupnos[stringno];
sp[stringno] = &hashheader.stringchars[stringno][0];
}
}
#endif /* SLOWMULTIPLY */
lowstringno = 0;
highstringno = hashheader.nstrchars - 1;
dupwanted = canonical ? 0 : defstringgroup;
while (lowstringno <= highstringno)
{
stringno = (lowstringno + highstringno) >> 1;
#ifdef SLOWMULTIPLY
if (dupwanted < gp[stringno])
{
highstringno = stringno - 1;
continue;
}
else if (dupwanted > gp[stringno])
{
lowstringno = stringno + 1;
continue;
}
stringcur = sp[stringno];
#else /* SLOWMULTIPLY */
if (dupwanted < hashheader.groupnos[stringno])
{
highstringno = stringno - 1;
continue;
}
else if (dupwanted > hashheader.groupnos[stringno])
{
lowstringno = stringno + 1;
continue;
}
stringcur = &hashheader.stringchars[stringno][0];
#endif /* SLOWMULTIPLY */
bufcur = bufp;
/*
* Doing a correct comparison is a touch tricky because the
* data in bufp isn't null-terminated; we have to identify the
* stringchar as a prefix in bufp. We don't bother to check
* for a null byte in bufp because a null byte will just show
* up as a mismatch with the current stringchar.
*/
while (*stringcur != '\0' && *bufcur == *stringcur)
{
stringcur++;
bufcur++;
}
/*
* If we got to the end of the stringchar, we have a match
* regardless of what the next character in bufcur is. But
* it's a "true" match only if dupwanted also matches.
* Otherwise we need to continue the search.
*/
if (*stringcur == '\0')
{
laststringch = hashheader.stringdups[stringno];
#ifdef SLOWMULTIPLY
return stringcur - sp[stringno];
#else /* SLOWMULTIPLY */
return stringcur - &hashheader.stringchars[stringno][0];
#endif /* SLOWMULTIPLY */
}
/*
* We aren't at the end of the stringchar, so we can decide
* our direction based on the mismatch between the stringchar
* and bufp.
*/
if (*bufcur < *stringcur)
highstringno = stringno - 1;
else
lowstringno = stringno + 1;
}
laststringch = -1;
return 0; /* Not a string character */
}
/*
* Convert an external string to an ichar_t string.
*
* Returns NZ if the output string overflowed.
*/
int strtoichar (out, in, outlen, canonical)
register ichar_t * out; /* Where to put result */
register unsigned char *
in; /* String to convert */
int outlen; /* Size of output buffer, *BYTES* */
int canonical; /* NZ if input is in canonical form */
{
register int len; /* Length of next character */
outlen /= sizeof (ichar_t); /* Convert to an ichar_t count */
for ( ; --outlen > 0 && *in != '\0'; in += len)
{
if (l1_isstringch (in, len, canonical))
*out++ = SET_SIZE + laststringch;
else
*out++ = *in;
}
*out = 0;
return outlen <= 0;
}
/*
* Convert an ichar_t string to an external string.
*
* WARNING: the resulting string may wind up being longer than the
* original. In fact, even the sequence strtoichar->ichartostr may
* produce a result longer than the original, because the output form
* may use a different string type set than the original input form.
*
* Returns NZ if the output string overflowed.
*/
int ichartostr (out, in, outlen, canonical)
register unsigned char *
out; /* Where to put result */
register const ichar_t *
in; /* String to convert */
int outlen; /* Size of output buffer, bytes */
int canonical; /* NZ for canonical form */
{
register unsigned int
ch; /* Next character to store */
register int i; /* Index into duplicates list */
register unsigned char *
scharp; /* Pointer into a string char */
while (--outlen > 0 && (ch = *in++) != '\0')
{
if (ch < SET_SIZE)
*out++ = (char) ch;
else
{
ch -= SET_SIZE;
if (!canonical)
{
for (i = hashheader.nstrchars; --i >= 0; )
{
if (hashheader.groupnos[i] == defstringgroup
&& hashheader.stringdups[i] == ch)
{
ch = i;
break;
}
}
}
scharp = hashheader.stringchars[(unsigned) ch];
while ((*out++ = *scharp++) != '\0')
;
out--;
}
}
*out = '\0';
return outlen <= 0;
}
/*
* Convert a string to an ichar_t *, storing the result in a static area.
*/
ichar_t * strtosichar (in, canonical)
unsigned char * in; /* String to convert */
int canonical; /* NZ if input is in canonical form */
{
static ichar_t out[STRTOSICHAR_SIZE / sizeof (ichar_t)];
if (strtoichar (out, in, sizeof out, canonical))
(void) fprintf (stderr, WORD_TOO_LONG ((char *) in));
return out;
}
/*
* Convert an ichar_t * to a string, storing the result in a static area.
*/
unsigned char * ichartosstr (in, canonical)
const ichar_t * in; /* Internal string to convert */
int canonical; /* NZ for canonical conversion */
{
static unsigned char
out[ICHARTOSSTR_SIZE];