-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcorrect.c
2016 lines (1918 loc) · 55.1 KB
/
correct.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: correct.c,v 1.87 2021-01-09 13:12:35-08 geoff Exp $";
#endif
/*
* correct.c - Routines to manage the higher-level aspects of spell-checking
*
* This code originally resided in ispell.c, but was moved here to keep
* file sizes smaller.
*
* Copyright (c), 1983, by Pace Willisson
*
* Copyright 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: correct.c,v $
* Revision 1.87 2021-01-09 13:12:35-08 geoff
* Suppress warnings about empty printf format strings.
*
* Revision 1.86 2020-12-30 22:33:41-08 geoff
* Support SQUEEZE_STRINGS and RAW_DISPLAY. Also fix a compiler warning
* and a minor bug in counting possibilities.
*
* Revision 1.85 2020-10-26 11:39:55-07 geoff
* Include header files needed for C99 function declarations. This probably
* breaks backwards compatibility but I don't have time to research it and
* add appropriate config.X options. Sigh.
*
* Revision 1.84 2020-04-28 17:55:52-07 geoff
* Don't segfault if user input starts with a null byte
*
* Revision 1.83 2015-02-08 00:35:41-08 geoff
* Fix a namespace collision with "getline".
*
* Revision 1.82 2005/04/28 14:46:51 geoff
* Add code to log all corrections and replacements.
*
* Revision 1.81 2005/04/20 23:16:32 geoff
* Add inpossibilities, and use it to deal with the case where uppercase
* SS in German causes ambiguities. Rename some variables to make them
* more meaningful.
*
* Revision 1.80 2005/04/14 14:38:23 geoff
* Update license. Use i-prefixed names for terminal access functions to
* prevent conflicts with libraries. Fix a bug that caused a hang when
* using external deformatters.
*
* Revision 1.79 2001/09/06 00:40:44 geoff
* In ask mode, when extending long lines to ensure that a word hasn't
* been broken, remember to do the extension inside both the context and
* the filtered buffer.
*
* Revision 1.78 2001/09/06 00:30:29 geoff
* Many changes from Eli Zaretskii to support DJGPP compilation.
*
* Revision 1.77 2001/07/25 21:51:47 geoff
* Minor license update.
*
* Revision 1.76 2001/07/23 20:24:03 geoff
* Update the copyright and the license.
*
* Revision 1.75 2001/06/14 09:11:11 geoff
* Use a non-conflicting macro for bcopy to avoid compilation problems on
* smarter compilers.
*
* Revision 1.74 2001/06/10 23:54:56 geoff
* Fix an ask-mode bug that could cause hangs.
*
* Revision 1.73 2001/06/07 08:02:18 geoff
* When copying out, be sure to use the information from contextbufs[0]
* (the original file) rather then filteredbuf (the deformatted
* information).
*
* Revision 1.72 2000/08/24 06:47:16 geoff
* Fix a dumb error in merging the correct_verbose_mode patch
*
* Revision 1.71 2000/08/22 10:52:25 geoff
* Fix a whole bunch of signed/unsigned compiler warnings.
*
* Revision 1.70 2000/08/22 00:11:25 geoff
* Add support for correct_verbose_mode.
*
* Revision 1.69 1999/11/04 07:51:05 geoff
* In verbose ask mode, put out a newline after the EOF so the TTY looks
* nice.
*
* Revision 1.68 1999/11/04 07:19:59 geoff
* Add "oktochange" to inserttoken, and set it to false on the first of
* each paired call.
*
* Revision 1.67 1999/10/05 05:49:56 geoff
* When processing the ~ command, don't pass a newline by accident!
*
* Revision 1.66 1999/01/18 03:28:24 geoff
* Turn many char declarations into unsigned char, so that we won't have
* sign-extension problems.
*
* Revision 1.65 1999/01/07 01:57:51 geoff
* Update the copyright.
*
* Revision 1.64 1999/01/03 01:46:25 geoff
* Add support for external deformatters. Also display tab characters
* correctly when showing context.
*
* Revision 1.63 1997/12/02 06:24:38 geoff
* Get rid of some compile options that really shouldn't be optional.
*
* Revision 1.62 1997/12/01 00:53:43 geoff
* Don't strip out the newline at the end of contextbufs on long lines.
*
* Revision 1.61 1995/11/08 05:09:26 geoff
* Add the new interactive mode ("askverbose"). Modify the deformatting
* support to allow html/sgml as a full equal of nroff and TeX.
*
* Revision 1.60 1995/10/25 04:05:28 geoff
* Line added by Gerry Tierney to reset insidehtml flag for each new file
* in case a tag was left open by a previous file. 10/14/95.
*
* Revision 1.59 1995/08/05 23:19:43 geoff
* Fix a bug that caused offsets for long lines to be confused if the
* line started with a quoting uparrow.
*
* Revision 1.58 1994/11/02 06:56:00 geoff
* Remove the anyword feature, which I've decided is a bad idea.
*
* Revision 1.57 1994/10/26 05:12:39 geoff
* Try boundary characters when inserting or substituting letters, except
* (naturally) at word boundaries.
*
* Revision 1.56 1994/10/25 05:46:30 geoff
* Fix an assignment inside a conditional that could generate spurious
* warnings (as well as being bad style). Add support for the FF_ANYWORD
* option.
*
* Revision 1.55 1994/09/16 04:48:24 geoff
* Don't pass newlines from the input to various other routines, and
* don't assume that those routines leave the input unchanged.
*
* Revision 1.54 1994/09/01 06:06:41 geoff
* Change erasechar/killchar to uerasechar/ukillchar to avoid
* shared-library problems on HP systems.
*
* Revision 1.53 1994/08/31 05:58:38 geoff
* Add code to handle extremely long lines in -a mode without splitting
* words or reporting incorrect offsets.
*
* Revision 1.52 1994/05/25 04:29:24 geoff
* Fix a bug that caused line widths to be calculated incorrectly when
* displaying lines containing tabs. Fix a couple of places where
* characters were sign-extended incorrectly, which could cause 8-bit
* characters to be displayed wrong.
*
* Revision 1.51 1994/05/17 06:44:05 geoff
* Add support for controlled compound formation and the COMPOUNDONLY
* option to affix flags.
*
* Revision 1.50 1994/04/27 05:20:14 geoff
* Allow compound words to be formed from more than two components
*
* Revision 1.49 1994/04/27 01:50:31 geoff
* Add support to correctly capitalize words generated as a result of a
* missing-space suggestion.
*
* Revision 1.48 1994/04/03 23:23:02 geoff
* Clean up the code in missingspace() to be a bit simpler and more
* efficient.
*
* Revision 1.47 1994/03/15 06:24:23 geoff
* Fix the +/-/~ commands to be independent. Allow the + command to
* receive a suffix which is a deformatter type (currently hardwired to
* be either tex or nroff/troff).
*
* Revision 1.46 1994/02/21 00:20:03 geoff
* Fix some bugs that could cause bad displays in the interaction between
* TeX parsing and string characters. Show_char now will not overrun
* the inverse-video display area by accident.
*
* Revision 1.45 1994/02/14 00:34:51 geoff
* Fix correct to accept length parameters for ctok and itok, so that it
* can pass them to the to/from ichar routines.
*
* Revision 1.44 1994/01/25 07:11:22 geoff
* Get rid of all old RCS log lines in preparation for the 3.1 release.
*
*/
#include <ctype.h>
#include <fcntl.h>
#include "config.h"
#include "ispell.h"
#include "proto.h"
#include "msgs.h"
#include "version.h"
void givehelp P ((int interactive));
void checkfile P ((void));
void correct P ((unsigned char * ctok, int ctokl, ichar_t * itok,
int itokl, unsigned char ** curchar));
static void show_line P ((unsigned char * line, unsigned char * invstart,
int invlen));
static int show_char P ((unsigned char ** cp, int linew, int output,
int maxw));
static int line_size P ((unsigned char * buf, unsigned char * bufend));
static void inserttoken P ((unsigned char * buf, unsigned char * start,
unsigned char * tok, unsigned char ** curchar,
int oktochange));
static int posscmp P ((unsigned char * a, unsigned char * b));
int casecmp P ((unsigned char * a, unsigned char * b, int canonical));
void makepossibilities P ((ichar_t * word));
int inpossibilities P ((unsigned char * ctok));
static int insert P ((ichar_t * word));
static void wrongcapital P ((ichar_t * word));
static void wrongletter P ((ichar_t * word));
static void extraletter P ((ichar_t * word));
static void missingletter P ((ichar_t * word));
static void missingspace P ((ichar_t * word));
int compoundgood P ((ichar_t * word, int pfxopts));
static void transposedletter P ((ichar_t * word));
static void tryveryhard P ((ichar_t * word));
static int ins_cap P ((ichar_t * word, ichar_t * pattern));
static int save_cap P ((ichar_t * word, ichar_t * pattern,
ichar_t savearea[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN]));
int ins_root_cap P ((ichar_t * word, ichar_t * pattern,
int prestrip, int preadd, int sufstrip, int sufadd,
struct dent * firstdent, struct flagent * pfxent,
struct flagent * sufent));
static void save_root_cap P ((ichar_t * word, ichar_t * pattern,
int prestrip, int preadd, int sufstrip, int sufadd,
struct dent * firstdent, struct flagent * pfxent,
struct flagent * sufent,
ichar_t savearea[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN],
int * nsaved));
static char * get_line_from_user P ((char * buf, int bufsize));
void askmode P ((void));
void copyout P ((unsigned char ** cc, int cnt));
static void lookharder P ((unsigned char * string));
#ifdef REGEX_LOOKUP
static void regex_dict_lookup P ((char * cmd, char * grepstr));
#endif /* REGEX_LOOKUP */
void givehelp (interactive)
int interactive; /* NZ for interactive-mode help */
{
#ifdef COMMANDFORSPACE
char ch;
#endif
register FILE *helpout; /* File to write help to */
if (interactive)
{
ierase ();
helpout = stdout;
}
else
helpout = stderr;
#ifdef CORR_C_HELP_1
(void) fprintf (helpout, CORR_C_HELP_1, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_1 */
#ifdef CORR_C_HELP_2
(void) fprintf (helpout, CORR_C_HELP_2, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_2 */
#ifdef CORR_C_HELP_3
(void) fprintf (helpout, CORR_C_HELP_3, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_3 */
#ifdef CORR_C_HELP_4
(void) fprintf (helpout, CORR_C_HELP_4, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_4 */
#ifdef CORR_C_HELP_5
(void) fprintf (helpout, CORR_C_HELP_5, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_5 */
#ifdef CORR_C_HELP_6
(void) fprintf (helpout, CORR_C_HELP_6, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_6 */
#ifdef CORR_C_HELP_7
(void) fprintf (helpout, CORR_C_HELP_7, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_7 */
#ifdef CORR_C_HELP_8
(void) fprintf (helpout, CORR_C_HELP_8, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_8 */
#ifdef CORR_C_HELP_9
(void) fprintf (helpout, CORR_C_HELP_9, MAYBE_CR (helpout));
#endif /* CORR_C_HELP_9 */
(void) fprintf (helpout, CORR_C_HELP_COMMANDS, MAYBE_CR (helpout),
MAYBE_CR (helpout), MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_R_CMD, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_BLANK, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_A_CMD, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_I_CMD, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_U_CMD, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_0_CMD, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_L_CMD, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_X_CMD, MAYBE_CR (helpout),
MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_Q_CMD, MAYBE_CR (helpout),
MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_BANG, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_REDRAW, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_SUSPEND, MAYBE_CR (helpout));
(void) fprintf (helpout, CORR_C_HELP_HELP, MAYBE_CR (helpout));
if (interactive)
{
(void) fprintf (helpout, "\r\n");
imove (li - 1, 0); /* bottom line, no matter what screen size is */
(void) fprintf (helpout, CORR_C_HELP_TYPE_SPACE);
(void) fflush (helpout);
#ifdef COMMANDFORSPACE
ch = GETKEYSTROKE ();
if (ch != ' ' && ch != '\n' && ch != '\r')
(void) ungetc (ch, stdin);
#else
while (GETKEYSTROKE () != ' ')
;
#endif
}
}
void checkfile ()
{
int bufno;
unsigned int bufsize;
int ch;
insidehtml = 0;
math_mode = 0;
LaTeX_Mode = 'P';
for (bufno = 0; bufno < contextsize; bufno++)
contextbufs[bufno][0] = '\0';
for ( ; ; )
{
for (bufno = contextsize; --bufno > 0; )
(void) strcpy ((char *) contextbufs[bufno],
(char *) contextbufs[bufno - 1]);
if (quit) /* quit can't be set in l mode */
{
if (sourcefile == NULL)
sourcefile = infile;
while (fgets ((char *) contextbufs[0], sizeof contextbufs[0],
sourcefile)
!= NULL)
(void) fputs ((char *) contextbufs[0], outfile);
break;
}
/*
* Only read in enough characters to fill half this buffer so that any
* corrections we make are not likely to cause an overflow.
*/
if (fgets ((char *) filteredbuf, sizeof filteredbuf / 2, infile)
== NULL)
{
if (sourcefile != NULL)
{
while (fgets ((char *) contextbufs[0], sizeof contextbufs[0],
sourcefile)
!= NULL)
(void) fputs ((char *) contextbufs[0], outfile);
}
break;
}
/*
* If we didn't read to end-of-line, we may have ended the
* buffer in the middle of a word. So keep reading until we
* see some sort of character that can't possibly be part of a
* word. (or until the buffer is full, which fortunately isn't
* all that likely).
*/
bufsize = strlen ((char *) filteredbuf);
if (bufsize == sizeof filteredbuf / 2 - 1)
{
ch = (unsigned char) filteredbuf[bufsize - 1];
while (bufsize < sizeof filteredbuf - 1
&& (iswordch ((ichar_t) ch) || isboundarych ((ichar_t) ch)
|| isstringstart (ch)))
{
ch = getc (infile);
if (ch == EOF)
break;
filteredbuf[bufsize++] = (char) ch;
filteredbuf[bufsize] = '\0';
}
}
/*
* If we're not filtering, make a duplicate of filteredbuf in
* contextbufs[0]. Otherwise, read the same number of
* characters into contextbufs[0] from sourcefile.
*/
if (sourcefile == NULL)
(void) strcpy ((char *) contextbufs[0], (char *) filteredbuf);
else
{
if (fread (contextbufs[0], 1, bufsize, sourcefile) != bufsize)
{
(void) fprintf (stderr, CORR_C_SHORT_SOURCE,
MAYBE_CR (stderr));
(void) sleep ((unsigned) 2);
xflag = 0; /* Preserve file backup */
break;
}
contextbufs[0][bufsize] = '\0';
}
checkline (outfile);
}
}
void correct (ctok, ctokl, itok, itokl, curchar)
unsigned char * ctok;
int ctokl;
ichar_t * itok;
int itokl;
unsigned char ** curchar; /* Pointer into filteredbuf */
{
register int c;
register int i;
int col_ht;
unsigned char * curcontextchar; /* Pointer into contextbufs[0] */
int ncols;
unsigned char * start_l2;
unsigned char * begintoken;
curcontextchar = contextbufs[0] + (*curchar - filteredbuf);
begintoken = curcontextchar - strlen ((char *) ctok);
if (icharlen (itok) <= minword)
return; /* Accept very short words */
checkagain:
if (good (itok, 0, 0, 0, 0) || compoundgood (itok, 0))
return;
makepossibilities (itok);
if (inpossibilities (ctok)) /* Kludge for German and similar languages */
return;
ierase ();
(void) printf (" %s", (char *) ctok);
if (currentfile)
(void) printf (CORR_C_FILE_LABEL, currentfile);
if (readonly)
(void) printf (" %s", CORR_C_READONLY);
(void) printf ("\r\n\r\n");
/*
* Make sure we have enough room on the screen to hold the
* possibilities. Reduce the list if necessary. co / (maxposslen + 8)
* is the maximum number of columns that will fit. col_ht is the
* height of the columns. The constant 4 allows 2 lines (1 blank) at
* the top of the screen, plus another blank line between the
* columns and the context, plus a final blank line at the bottom
* of the screen for command entry (R, L, etc).
*/
col_ht = li - contextsize - 4 - minimenusize;
ncols = co / (maxposslen + 8);
if (pcount > ncols * col_ht)
pcount = ncols * col_ht;
#ifdef EQUAL_COLUMNS
/*
* Equalize the column sizes. The last column will be short.
*/
col_ht = (pcount + ncols - 1) / ncols;
#endif
for (i = 0; i < pcount; i++)
{
#ifdef BOTTOMCONTEXT
imove (2 + (i % col_ht), (maxposslen + 8) * (i / col_ht));
#else /* BOTTOMCONTEXT */
imove (3 + contextsize + (i % col_ht), (maxposslen + 8) * (i / col_ht));
#endif /* BOTTOMCONTEXT */
if (i >= easypossibilities)
(void) printf ("??: %s", possibilities[i]);
else if (easypossibilities > 10 && i < 10)
(void) printf ("0%d: %s", i, possibilities[i]);
else
(void) printf ("%2d: %s", i, possibilities[i]);
}
#ifdef BOTTOMCONTEXT
imove (li - contextsize - 1 - minimenusize, 0);
#else /* BOTTOMCONTEXT */
imove (2, 0);
#endif /* BOTTOMCONTEXT */
for (i = contextsize; --i > 0; )
show_line (contextbufs[i], contextbufs[i], 0);
start_l2 = contextbufs[0];
if (line_size (contextbufs[0], curcontextchar) > co - (sg << 1) - 1)
{
start_l2 = begintoken - (co / 2);
while (start_l2 < begintoken)
{
i = line_size (start_l2, curcontextchar) + 1;
if (i + (sg << 1) <= co)
break;
start_l2 += i - co;
}
if (start_l2 > begintoken)
start_l2 = begintoken;
if (start_l2 < contextbufs[0])
start_l2 = contextbufs[0];
}
show_line (start_l2, begintoken, (int) strlen ((char *) ctok));
if (minimenusize != 0)
{
imove (li - 2, 0);
(void) printf (CORR_C_MINI_MENU);
}
for ( ; ; )
{
(void) fflush (stdout);
switch (c = GETKEYSTROKE ())
{
case 'Z' & 037:
stop ();
ierase ();
goto checkagain;
case ' ':
ierase ();
(void) fflush (stdout);
return;
case 'q': case 'Q':
if (changes)
{
(void) printf (CORR_C_CONFIRM_QUIT);
(void) fflush (stdout);
c = GETKEYSTROKE ();
}
else
c = 'y';
if (c == 'y' || c == 'Y')
{
ierase ();
(void) fflush (stdout);
fclose (outfile); /* So `done' may unlink it safely */
done (0);
}
goto checkagain;
case 'i': case 'I':
treeinsert (ichartosstr (strtosichar (ctok, 0), 1),
ICHARTOSSTR_SIZE, 1);
ierase ();
(void) fflush (stdout);
changes = 1;
return;
case 'u': case 'U':
itok = strtosichar (ctok, 0);
lowcase (itok);
treeinsert (ichartosstr (itok, 1), ICHARTOSSTR_SIZE, 1);
ierase ();
(void) fflush (stdout);
changes = 1;
return;
case 'a': case 'A':
treeinsert (ichartosstr (strtosichar (ctok, 0), 1),
ICHARTOSSTR_SIZE, 0);
ierase ();
(void) fflush (stdout);
return;
case 'L' & 037:
goto checkagain;
case '?':
givehelp (1);
goto checkagain;
case '!':
{
unsigned char buf[200];
imove (li - 1, 0);
(void) putchar ('!');
if (get_line_from_user ((char *) buf, sizeof buf) == NULL)
{
(void) putchar (7);
ierase ();
(void) fflush (stdout);
goto checkagain;
}
(void) printf ("\r\n");
(void) fflush (stdout);
#ifdef USESH
shescape ((char *) buf);
#else
(void) shellescape ((char *) buf);
#endif
ierase ();
goto checkagain;
}
case 'r': case 'R':
imove (li - 1, 0);
if (readonly)
{
(void) putchar (7);
(void) printf ("%s ", CORR_C_READONLY);
}
(void) printf (CORR_C_REPLACE_WITH);
if (get_line_from_user ((char *) ctok, ctokl) == NULL)
{
(void) putchar (7);
/* Put it back */
(void) ichartostr (ctok, itok, ctokl, 0);
}
else
{
inserttoken (contextbufs[0],
begintoken, ctok, &curcontextchar, 0);
inserttoken (filteredbuf,
filteredbuf + (begintoken - contextbufs[0]),
ctok, curchar, 1);
if (strtoichar (itok, ctok, itokl, 0))
{
(void) putchar (7);
(void) printf (WORD_TOO_LONG ((char *) ctok));
}
changes = 1;
}
ierase ();
if (icharlen (itok) <= minword)
return; /* Accept very short replacements */
goto checkagain;
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
i = c - '0';
if (easypossibilities > 10)
{
c = GETKEYSTROKE ();
if (c >= '0' && c <= '9')
i = i * 10 + c - '0';
else if (c != '\r' && c != '\n')
{
(void) putchar (7);
break;
}
}
if (i < easypossibilities)
{
(void) strcpy ((char *) ctok, possibilities[i]);
changes = 1;
inserttoken (contextbufs[0],
begintoken, ctok, &curcontextchar, 0);
inserttoken (filteredbuf,
filteredbuf + (begintoken - contextbufs[0]),
ctok, curchar, 1);
ierase ();
if (readonly)
{
imove (li - 1, 0);
(void) putchar (7);
(void) printf ("%s", CORR_C_READONLY);
(void) fflush (stdout);
(void) sleep ((unsigned) 2);
}
return;
}
(void) putchar (7);
break;
case '\r': /* This makes typing \n after single digits */
case '\n': /* ..less obnoxious */
break;
case 'l': case 'L':
{
unsigned char buf[100];
imove (li - 1, 0);
(void) printf (CORR_C_LOOKUP_PROMPT);
if (get_line_from_user ((char *) buf, sizeof buf) == NULL)
{
(void) putchar (7);
ierase ();
goto checkagain;
}
(void) printf ("\r\n");
(void) fflush (stdout);
lookharder (buf);
ierase ();
goto checkagain;
}
case 'x': case 'X':
quit = 1;
ierase ();
(void) fflush (stdout);
return;
default:
(void) putchar (7);
break;
}
}
}
static void show_line (line, invstart, invlen)
unsigned char * line;
register unsigned char *
invstart;
register int invlen;
{
register int width = 0;
int maxwidth = co - 1;
if (invlen != 0)
maxwidth -= sg << 1;
while (line < invstart && width < maxwidth)
width += show_char (&line, width, 1, invstart - line);
if (invlen)
{
inverse ();
invstart += invlen;
while (line < invstart && width < maxwidth)
width += show_char (&line, width, 1, invstart - line);
normal ();
}
while (*line && width < maxwidth)
width += show_char (&line, width, 1, 0);
(void) printf ("\r\n");
}
static int show_char (cp, linew, output, maxw)
register unsigned char **
cp;
int linew;
int output; /* NZ to actually do output */
int maxw; /* NZ to limit width shown */
{
register int ch;
register int i;
int len;
ichar_t ichar;
register int width;
ch = **cp;
if (l1_isstringch (*cp, len, 0))
ichar = SET_SIZE + laststringch;
else
ichar = chartoichar (ch);
if (!vflag && iswordch (ichar) && len == 1)
{
if (output)
(void) putchar (ch);
(*cp)++;
return 1;
}
if (ch == '\t')
{
if (output)
{
for (i = 8 - (linew & 0x07); --i >= 0; )
(void) putchar (' ');
}
(*cp)++;
return 8 - (linew & 0x07);
}
if (!vflag && chartypes[defstringgroup].options & RAW_DISPLAY)
{
if (output)
{
for (i = 0; i < len; i++)
putchar(*(*cp)++);
}
else
*cp += len;
if (chartypes[defstringgroup].options & SQUEEZE_STRINGS)
return 1;
else
return len;
}
/*
* Character is non-printing, or it's printing but vflag is set. Display
* it in "cat -v" form. For string characters, display every element
* separately in that form.
*/
width = 0;
if (maxw != 0 && len > maxw)
len = maxw; /* Don't show too much */
for (i = 0; i < len; i++)
{
ch = (unsigned char) *(*cp)++;
if (ch > '\177')
{
if (output)
{
(void) putchar ('M');
(void) putchar ('-');
}
width += 2;
ch &= 0x7f;
}
if (ch < ' ' || ch == '\177')
{
if (output)
{
(void) putchar ('^');
if (ch == '\177')
(void) putchar ('?');
else
(void) putchar (ch + 'A' - '\001');
}
width += 2;
}
else
{
if (output)
(void) putchar (ch);
width += 1;
}
}
return width;
}
static int line_size (buf, bufend)
unsigned char * buf;
register unsigned char *
bufend;
{
register int width;
for (width = 0; buf < bufend && *buf != '\0'; )
width += show_char (&buf, width, 0, bufend - buf);
return width;
}
static void inserttoken (buf, start, tok, curchar, oktochange)
unsigned char * buf;
unsigned char * start;
register unsigned char *
tok;
unsigned char ** curchar; /* Where to do insertion (updated) */
int oktochange; /* NZ if OK to modify tok */
{
unsigned char copy[BUFSIZ];
register unsigned char *
p;
register unsigned char *
q;
unsigned char * ew;
if (!oktochange && logfile != NULL)
{
for (p = start; p != *curchar; p++)
(void) putc (*p, logfile);
(void) putc (' ', logfile);
(void) fputs ((char *) tok, logfile);
(void) putc ('\n', logfile);
(void) fflush (logfile);
}
(void) strcpy ((char *) copy, (char *) buf);
p = start;
q = copy + (*curchar - buf);
ew = skipoverword (tok);
while (tok < ew)
*p++ = *tok++;
*curchar = p;
if (*tok)
{
/*
** The token changed to two words. Split it up and save the
** second one for later.
*/
*p++ = *tok;
if (oktochange)
*tok = '\0';
tok++;
while (*tok)
*p++ = *tok++;
}
while ((*p++ = *q++) != '\0')
;
}
static int posscmp (a, b)
unsigned char * a;
unsigned char * b;
{
return casecmp (a, b, 0);
}
int casecmp (a, b, canonical)
unsigned char * a;
unsigned char * b;
int canonical; /* NZ for canonical string chars */
{
register ichar_t * ap;
register ichar_t * bp;
ichar_t inta[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4];
ichar_t intb[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4];
(void) strtoichar (inta, a, sizeof inta, canonical);
(void) strtoichar (intb, b, sizeof intb, canonical);
for (ap = inta, bp = intb; *ap != 0; ap++, bp++)
{
if (*ap != *bp)
{
if (*bp == '\0')
return hashheader.sortorder[*ap];
else if (mylower (*ap))
{
if (mylower (*bp) || mytoupper (*ap) != *bp)
return (int) hashheader.sortorder[*ap]
- (int) hashheader.sortorder[*bp];
}
else
{
if (myupper (*bp) || mytolower (*ap) != *bp)
return (int) hashheader.sortorder[*ap]
- (int) hashheader.sortorder[*bp];
}
}
}
if (*bp != '\0')
return -(int) hashheader.sortorder[*bp];
for (ap = inta, bp = intb; *ap; ap++, bp++)
{
if (*ap != *bp)
{
return (int) hashheader.sortorder[*ap]
- (int) hashheader.sortorder[*bp];
}
}
return 0;
}
void makepossibilities (word)
register ichar_t * word;
{
register int i;
for (i = 0; i < MAXPOSSIBLE; i++)
possibilities[i][0] = 0;
pcount = 0;
maxposslen = 0;
easypossibilities = 0;
wrongcapital (word);
/*
* according to Pollock and Zamora, CACM April 1984 (V. 27, No. 4),
* page 363, the correct order for this is:
* OMISSION = TRANSPOSITION > INSERTION > SUBSTITUTION
* thus, it was exactly backwards in the old version. -- PWP
*/
if (pcount < MAXPOSSIBLE)
missingletter (word); /* omission */
if (pcount < MAXPOSSIBLE)
transposedletter (word); /* transposition */
if (pcount < MAXPOSSIBLE)
extraletter (word); /* insertion */
if (pcount < MAXPOSSIBLE)
wrongletter (word); /* substitution */
if ((compoundflag != COMPOUND_ANYTIME) && pcount < MAXPOSSIBLE)
missingspace (word); /* two words */
easypossibilities = pcount;
if (easypossibilities == 0 || tryhardflag)
tryveryhard (word);
if ((sortit || (pcount > easypossibilities)) && pcount)
{