-
Notifications
You must be signed in to change notification settings - Fork 4
/
word.c
431 lines (379 loc) · 9.36 KB
/
word.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
/* word.c of ue/Gulam -- from microEmacs and microGNU-Emacs
The routines in this file implement commands that work word at a time.
Code for dealing with paragraphs and filling. Adapted from MicroEMACS
3.6. GNU-ified by mwm@ucbvax. Several bug fixes by
blarson@usc-oberon. Gulam-ified by pm@Case. fillpara() is new by
pm@Case */
#include "ue.h"
static void lowerc(uchar *p)
{
uchar c;
c = *p;
if ('A' <= c && c <= 'Z')
{
*p -= 'A' - 'a';
lchange(WFHARD);
}
}
static void upperc(uchar *p)
{
uchar c;
c = *p;
if ('a' <= c && c <= 'z')
{
*p -= 'a' - 'A';
lchange(WFHARD);
}
}
/* Return TRUE if the character at dot is a character that is
considered to be part of a word. The word character list is hard
coded. Should be setable. */
static int inword(void)
{
int c;
int n;
ELINE *lp;
lp = curwp->w_dotp;
n = curwp->w_doto;
if (n == llength(lp))
return FALSE;
c = lp->l_text[n];
return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9') || (c == '$' || c == '_'); /* For identifiers */
}
static int bgnofword(void)
{
int n;
for (n = 0; (inword() == FALSE); n++)
{
if (forwchar(FALSE, 1) == FALSE)
{
n = -1;
break;
}
}
return n;
}
/* Move the cursor forward by the specified number of words. As you
move convert the first character of the word by applying f1, and
subsequent characters by f2. Error if you try and move past the end
of the buffer. */
static int casechange(int n, void (*f1)(uchar *), void (*f2)(uchar *))
{
if (n < 0)
return FALSE;
while (n--)
{
if (bgnofword() == -1)
return FALSE;
if (inword() != FALSE)
{
(*f1) (&(curwp->w_dotp->l_text[curwp->w_doto]));
if (forwchar(FALSE, 1) == FALSE)
return FALSE;
while (inword() != FALSE)
{
(*f2) (&(curwp->w_dotp->l_text[curwp->w_doto]));
if (forwchar(FALSE, 1) == FALSE)
return FALSE;
}
}
}
return TRUE;
}
/* Move the cursor forward by the specified number of words. As you
move, convert any characters to upper case. Error if you try and move
beyond the end of the buffer. Bound to "M-U". */
int upperword(int f, int n)
{
UNUSED(f);
return casechange(n, upperc, upperc);
}
/* Move the cursor forward by the specified number of words. As you
move convert characters to lower case. Error if you try and move over
the end of the buffer. Bound to "M-L". */
int lowerword(int f, int n)
{
UNUSED(f);
return casechange(n, lowerc, lowerc);
}
/* Move the cursor forward by the specified number of words. As you
move convert the first character of the word to upper case, and
subsequent characters to lower case. Error if you try and move past
the end of the buffer. Bound to "M-C". */
int capword(int f, int n)
{
UNUSED(f);
return casechange(n, upperc, lowerc);
}
/* Move the cursor backward by "n" words. All of the details of
motion are performed by the "backchar" and "forwchar" routines. Error
if you try to move beyond the buffers. */
int backword(int f, int n)
{
if (n < 0)
return forwword(f, -n);
if (backchar(FALSE, 1) == FALSE)
return FALSE;
while (n--)
{
while (inword() == FALSE)
if (backchar(FALSE, 1) == FALSE)
return FALSE;
while (inword() != FALSE)
if (backchar(FALSE, 1) == FALSE)
return FALSE;
}
return forwchar(FALSE, 1);
}
/* Move the cursor forward by the specified number of words. All of
the motion is done by "forwchar". Error if you try and move beyond
the buffer's end. */
int forwword(int f, int n)
{
if (n < 0)
return backword(f, -n);
while (n--)
{
if (bgnofword() == -1)
return FALSE;
while (inword() != FALSE)
if (forwchar(FALSE, 1) == FALSE)
return FALSE;
}
return TRUE;
}
/* Kill forward by "n" words. Remember the location of dot. Move
forward by the right number of words. Put dot back where it was and
issue the kill command for the right number of characters. Bound to
"M-D". */
int delfword(int f, int n)
{
RSIZE size;
ELINE *dotp;
int doto;
UNUSED(f);
if (n < 0)
return FALSE;
if ((lastflag & CFKILL) == 0) /* Purge kill buffer. */
kdelete();
thisflag |= CFKILL;
dotp = curwp->w_dotp;
doto = curwp->w_doto;
size = 0;
while (n--)
{
while (inword() == FALSE)
{
if (forwchar(FALSE, 1) == FALSE)
goto out; /* Hit end of buffer. */
++size;
}
while (inword() != FALSE)
{
if (forwchar(FALSE, 1) == FALSE)
goto out; /* Hit end of buffer. */
++size;
}
}
out:
curwp->w_dotp = dotp;
curwp->w_doto = doto;
return ldelete(size, KFORW);
}
/* Kill backwards by "n" words. Move backwards by the desired number
of words, counting the characters. When dot is finally moved to its
resting place, fire off the kill command. The rules for success and
failure are now different, to prevent strange behavior at the start of
the buffer. The command only fails if something goes wrong with the
actual delete of the characters. It is successful even if no
characters are deleted, or if you say delete 5 words, and there are
only 4 words left. I (who?) considered making the first call to
"backchar" special, but decided that that would just be wierd.
Normally this is bound to "M-Rubout" and to "M-Backspace". */
int delbword(int f, int n)
{
RSIZE size;
UNUSED(f);
if (n < 0)
return FALSE;
if ((lastflag & CFKILL) == 0)
kdelete(); /* Purge kill buffer. */
thisflag |= CFKILL;
if (backchar(FALSE, 1) == FALSE)
return TRUE;
size = 1; /* One deleted. */
while (n--)
{
while (inword() == FALSE)
{
if (backchar(FALSE, 1) == FALSE)
goto out; /* Hit buffer start. */
++size;
}
while (inword() != FALSE)
{
if (backchar(FALSE, 1) == FALSE)
goto out; /* Hit buffer start. */
++size;
}
}
if (forwchar(FALSE, 1) == FALSE)
return FALSE;
--size; /* Undo assumed delete. */
out:
return ldelete(size, KBACK);
}
static int fillcol = 70;
/* Go back to the begining of the current paragraph. We look for a
<NL><NL> or <NL><TAB> or <NL><SPACE> combination to delimit the
begining of a paragraph. */
int gotobop(int f, int n)
{
ELINE *lp;
ELINE *lastp;
int suc;
int c;
if (n < 0)
return gotoeop(f, -n);
while (n--)
{
for (;;) /* first scan back until we are in a word */
{
suc = backchar(FALSE, 1);
if (inword() || suc != TRUE)
break;
}
curwp->w_doto = 0;
lastp = curbp->b_linep;
for (lp = curwp->w_dotp; lback(lp) != lastp; lp = lback(lp))
{
if (0 == llength(lback(lp)) || ' ' == (c = lgetc(lp, 0)) || '\t' == c)
break;
}
curwp->w_dotp = lp;
}
curwp->w_flag |= WFMOVE; /* force screen update */
return TRUE;
}
/* Go forword to the end of the current paragraph. We look for a
<NL><NL> or <NL><TAB> or <NL><SPACE> combination to delimit the
begining of a paragraph. */
int gotoeop(int f, int n)
{
ELINE *lp;
ELINE *lastp;
int suc;
int c;
if (n < 0)
return gotobop(f, -n);
while (n--)
{
curwp->w_doto = 0;
for (;;) /* Find the first word on/after the current line */
{
suc = forwchar(FALSE, 1);
if (inword() || suc != TRUE)
break;
}
curwp->w_doto = 0;
lp = curwp->w_dotp;
lastp = curbp->b_linep;
if (lp == lastp)
break;
for (;;)
{
lp = lforw(lp);
if (lp == lastp)
break;
if (0 == llength(lp) || ' ' == (c = lgetc(lp, 0)) || '\t' == c)
{
lp = lback(lp);
break;
}
}
curwp->w_dotp = lp;
}
curwp->w_flag |= WFMOVE; /* force screen update */
return TRUE;
}
static uchar *blanks[3] = { "", " ", " " }; /* 0, 1, 2 blanks */
/* Make a string out of the lines belonging to the current para.
Delete these lines. curwp->dotp pts to the line below the para. */
static WS *makeparastr(void)
{
ELINE *lp;
ELINE *eopg;
WS *ws;
int n;
gotoeop(TRUE, 1);
eopg = curwp->w_dotp;
gotobop(TRUE, 1);
if ((ws = initws()) != NULL)
{
for (n = 1, lp = curwp->w_dotp; lp != eopg; n++)
lp = lforw(lp);
while (n--)
{
strwcat(ws, makelnstr(curwp->w_dotp), 0);
strwcat(ws, " ", 0);
killtext(TRUE, 1); /* kill changes the curwp->w_dotp */
lastflag = thisflag;
}
}
return ws;
}
/* Fill the current paragraph according to the current fill column */
int fillpara(int f, int n)
{
WS *ln;
WS *ws;
uchar *p;
int nln;
int i;
UNUSED(f);
if ((ws = makeparastr()) == NULL)
return FALSE;
if ((ln = initws()) == NULL)
{
freews(ws);
return FALSE;
}
for (nln = i = 0; WHITEDELIMS[n = ws->ps[i]]; i++)
{
if (n == '\t')
nln |= 007;
nln++;
}
ws->ps[i] = '\0';
strwcat(ln, ws->ps, 0);
ws->ps[i] = n;
/* added the para delimiter as is */
lex(&(ws->ps[i]), WHITEDELIMS, EMPTY2);
freews(ws);
for (i = 0;;) /* i == #blanks between words */
{
n = (int)strlen(p = lexgetword());
nln += i + n;
if (nln > fillcol || n == 0)
{
lnlink(curwp->w_dotp, ln->ps, ln->nc);
if (n == 0)
break;
ln->nc = i = 0;
nln = n;
}
strwcat(ln, blanks[i], 0);
strwcat(ln, p, 0);