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
|
/*
* Copyright 2004 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*/
#include <string.h>
#include "curses.ext"
#include <term.h>
#define HARDTABS 8
/* forward declarations */
/* should be static, but we may have prior application-dependency, sigh! */
void fgoto(void);
int plodput(char);
int plod(int);
int tabcol(int, int);
/*
* Terminal driving and line formatting routines.
* Basic motion optimizations are done here as well
* as formatting of lines (printing of control characters,
* line numbering and the like).
*/
/*
* Sync the position of the output cursor.
* Most work here is rounding for terminal boundaries getting the
* column position implied by wraparound or the lack thereof and
* rolling up the screen to get destline on the screen.
*/
static int outcol, outline, destcol, destline;
extern WINDOW *_win;
int
mvcur(int ly, int lx, int y, int x)
{
#ifdef DEBUG
fprintf(outf, "MVCUR: moving cursor from (%d,%d) to (%d,%d)\n",
ly, lx, y, x);
#endif
destcol = x;
destline = y;
outcol = lx;
outline = ly;
fgoto();
return (OK);
}
void
fgoto(void)
{
char *cgp;
int l, c;
if (destcol >= COLS) {
destline += destcol / COLS;
destcol %= COLS;
}
if (outcol >= COLS) {
l = (outcol + 1) / COLS;
outline += l;
outcol %= COLS;
if (AM == 0) {
while (l > 0) {
if (_pfast)
if (CR)
(void) _puts(CR);
else
(void) _putchar('\r');
if (NL)
(void) _puts(NL);
else
(void) _putchar('\n');
l--;
}
outcol = 0;
}
if (outline > LINES - 1) {
destline -= outline - (LINES - 1);
outline = LINES - 1;
}
}
if (destline >= LINES) {
l = destline;
destline = LINES - 1;
if (outline < LINES - 1) {
c = destcol;
if (_pfast == 0 && !CA)
destcol = 0;
fgoto();
destcol = c;
}
while (l >= LINES) {
/*
* The following linefeed (or simulation thereof)
* is supposed to scroll up the screen, since we
* are on the bottom line. We make the assumption
* that linefeed will scroll. If ns is in the
* capability list this won't work. We should
* probably have an sc capability but sf will
* generally take the place if it works.
*
* Superbee glitch: in the middle of the screen we
* have to use esc B (down) because linefeed screws up
* in "Efficient Paging" (what a joke) mode (which is
* essential in some SB's because CRLF mode puts garbage
* in at end of memory), but you must use linefeed to
* scroll since down arrow won't go past memory end.
* I turned this off after recieving Paul Eggert's
* Superbee description which wins better.
*/
if (NL /* && !XB */ && _pfast)
(void) _puts(NL);
else
(void) _putchar('\n');
l--;
if (_pfast == 0)
outcol = 0;
}
}
if (destline < outline && !(CA || UP))
destline = outline;
if (CA) {
cgp = tgoto(CM, destcol, destline);
if (plod((int)strlen(cgp)) > 0)
(void) plod(0);
else
(void) tputs(cgp, 0, _putchar);
}
else
(void) plod(0);
outline = destline;
outcol = destcol;
}
/*
* Move (slowly) to destination.
* Hard thing here is using home cursor on really deficient terminals.
* Otherwise just use cursor motions, hacking use of tabs and overtabbing
* and backspace.
*/
static int plodcnt, plodflg;
int
plodput(char c)
{
if (plodflg)
plodcnt--;
else
(void) _putchar(c);
return (OK);
}
int
plod(int cnt)
{
int i, j, k;
int soutcol, soutline;
plodcnt = plodflg = cnt;
soutcol = outcol;
soutline = outline;
/*
* Consider homing and moving down/right from there, vs moving
* directly with local motions to the right spot.
*/
if (HO) {
/*
* i is the cost to home and tab/space to the right to
* get to the proper column. This assumes ND space costs
* 1 char. So i+destcol is cost of motion with home.
*/
if (GT)
i = (destcol / HARDTABS) + (destcol % HARDTABS);
else
i = destcol;
/*
* j is cost to move locally without homing
*/
if (destcol >= outcol) { /* if motion is to the right */
j = destcol / HARDTABS - outcol / HARDTABS;
if (GT && j)
j += destcol % HARDTABS;
else
j = destcol - outcol;
}
else
/* leftward motion only works if we can backspace. */
if (outcol - destcol <= i && (BS || BC))
i = j = outcol - destcol;
/* cheaper to backspace */
else
j = i + 1; /* impossibly expensive */
/* k is the absolute value of vertical distance */
k = outline - destline;
if (k < 0)
k = -k;
j += k;
/*
* Decision. We may not have a choice if no UP.
*/
if (i + destline < j || (!UP && destline < outline)) {
/*
* Cheaper to home. Do it now and pretend it's a
* regular local motion.
*/
(void) tputs(HO, 0, plodput);
outcol = outline = 0;
} else if (LL) {
/*
* Quickly consider homing down and moving from there.
* Assume cost of LL is 2.
*/
k = (LINES - 1) - destline;
if (i + k + 2 < j && (k <= 0 || UP)) {
(void) tputs(LL, 0, plodput);
outcol = 0;
outline = LINES - 1;
}
}
}
else
/*
* No home and no up means it's impossible.
*/
if (!UP && destline < outline)
return (-1);
if (GT)
i = destcol % HARDTABS + destcol / HARDTABS;
else
i = destcol;
/*
* if (BT && outcol > destcol &&
* (j = (((outcol+7) & ~7) - destcol - 1) >> 3)) {
* j *= (k = (int)strlen(BT));
* if ((k += (destcol&7)) > 4)
* j += 8 - (destcol&7);
* else
* j += k;
* }
* else
*/
j = outcol - destcol;
/*
* If we will later need a \n which will turn into a \r\n by
* the system or the terminal, then don't bother to try to \r.
*/
if ((NONL || !_pfast) && outline < destline)
goto dontcr;
/*
* If the terminal will do a \r\n and there isn't room for it,
* then we can't afford a \r.
*/
if (NC && outline >= destline)
goto dontcr;
/*
* If it will be cheaper, or if we can't back up, then send
* a return preliminarily.
*/
if (j > i + 1 || outcol > destcol && !BS && !BC) {
/*
* BUG: this doesn't take the (possibly long) length
* of CR into account.
*/
if (CR)
(void) tputs(CR, 0, plodput);
else
(void) plodput('\r');
if (NC) {
if (NL)
(void) tputs(NL, 0, plodput);
else
(void) plodput('\n');
outline++;
}
outcol = 0;
}
dontcr:
while (outline < destline) {
outline++;
if (NL)
(void) tputs(NL, 0, plodput);
else
(void) plodput('\n');
if (plodcnt < 0)
goto out;
if (NONL || _pfast == 0)
outcol = 0;
}
if (BT)
k = (int)strlen(BT);
while (outcol > destcol) {
if (plodcnt < 0)
goto out;
/*
* if (BT && outcol - destcol > k + 4) {
* (void) tputs(BT, 0, plodput);
* outcol--;
* outcol &= ~7;
* continue;
* }
*/
outcol--;
if (BC)
(void) tputs(BC, 0, plodput);
else
(void) plodput('\b');
}
while (outline > destline) {
outline--;
(void) tputs(UP, 0, plodput);
if (plodcnt < 0)
goto out;
}
if (GT && destcol - outcol > 1) {
for (;;) {
i = tabcol(outcol, HARDTABS);
if (i > destcol)
break;
if (TA)
(void) tputs(TA, 0, plodput);
else
(void) plodput('\t');
outcol = i;
}
if (destcol - outcol > 4 && i < COLS && (BC || BS)) {
if (TA)
(void) tputs(TA, 0, plodput);
else
(void) plodput('\t');
outcol = i;
while (outcol > destcol) {
outcol--;
if (BC)
(void) tputs(BC, 0, plodput);
else
(void) plodput('\b');
}
}
}
while (outcol < destcol) {
/*
* move one char to the right. We don't use ND space
* because it's better to just print the char we are
* moving over.
*/
if (_win != NULL)
if (plodflg) /* avoid a complex calculation */
plodcnt--;
else {
i = curscr->_y[outline][outcol];
if ((i&_STANDOUT) == (curscr->_flags&_STANDOUT))
(void) _putchar(i & 0177);
else
goto nondes;
}
else
nondes:
if (ND)
(void) tputs(ND, 0, plodput);
else
(void) plodput(' ');
outcol++;
if (plodcnt < 0)
goto out;
}
out:
if (plodflg) {
outcol = soutcol;
outline = soutline;
}
return (plodcnt);
}
/*
* Return the column number that results from being in column col and
* hitting a tab, where tabs are set every ts columns. Work right for
* the case where col > COLS, even if ts does not divide COLS.
*/
int
tabcol(int col, int ts)
{
int offset;
if (col >= COLS) {
offset = COLS * (col / COLS);
col -= offset;
}
else
offset = 0;
return (col + ts - (col % ts) + offset);
}
|