fancy.c revision 1.14 1 1.14 dholland /* $NetBSD: fancy.c,v 1.14 2009/08/12 05:17:57 dholland Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.11 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.5 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.3 cgd #if 0
35 1.3 cgd static char sccsid[] = "@(#)fancy.c 8.1 (Berkeley) 5/31/93";
36 1.3 cgd #else
37 1.14 dholland __RCSID("$NetBSD: fancy.c,v 1.14 2009/08/12 05:17:57 dholland Exp $");
38 1.3 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #include "back.h"
42 1.5 lukem
43 1.14 dholland static void bsect(int, int, int, int);
44 1.14 dholland static void fixpos(int, int, int, int, int);
45 1.14 dholland static void fixcol(int, int, int, int, int);
46 1.14 dholland static void newline(void);
47 1.14 dholland
48 1.14 dholland /*
49 1.14 dholland * These need to be declared so they come out as commons, because
50 1.14 dholland * termcap might or might not define some of them. Our termcap defines
51 1.14 dholland * PC, BC, and UP only. This is gross.
52 1.14 dholland *
53 1.14 dholland * XXX: rewrite this crap using curses.
54 1.14 dholland */
55 1.5 lukem char PC; /* padding character */
56 1.5 lukem char *BC; /* backspace sequence */
57 1.5 lukem char *CD; /* clear to end of screen sequence */
58 1.5 lukem char *CE; /* clear to end of line sequence */
59 1.5 lukem char *CL; /* clear screen sequence */
60 1.5 lukem char *CM; /* cursor movement instructions */
61 1.5 lukem char *HO; /* home cursor sequence */
62 1.5 lukem char *MC; /* column cursor movement map */
63 1.5 lukem char *ML; /* row cursor movement map */
64 1.5 lukem char *ND; /* forward cursor sequence */
65 1.5 lukem char *UP; /* up cursor sequence */
66 1.5 lukem
67 1.14 dholland static int lHO; /* length of HO */
68 1.14 dholland static int lBC; /* length of BC */
69 1.14 dholland static int lND; /* length of ND */
70 1.14 dholland static int lUP; /* length of UP */
71 1.14 dholland static int CO; /* number of columns */
72 1.14 dholland static int LI; /* number of lines */
73 1.14 dholland static int *linect; /* array of lengths of lines on screen (the
74 1.5 lukem * actual screen is not stored) */
75 1.5 lukem
76 1.5 lukem /* two letter codes */
77 1.14 dholland static char tcap[] = "bccdceclcmhomcmlndup";
78 1.5 lukem /* corresponding strings */
79 1.14 dholland static char **tstr[] = {&BC, &CD, &CE, &CL, &CM, &HO, &MC, &ML, &ND, &UP};
80 1.5 lukem
81 1.5 lukem int buffnum; /* pointer to output buffer */
82 1.5 lukem
83 1.14 dholland static char tbuf[1024]; /* buffer for decoded termcap entries */
84 1.5 lukem
85 1.14 dholland static int oldb[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
86 1.14 dholland 0, 0, 0, 0, 0, 0};
87 1.5 lukem
88 1.14 dholland static int oldr;
89 1.14 dholland static int oldw;
90 1.5 lukem /* "real" cursor positions, so it knows when to reposition. These are -1 if
91 1.5 lukem * curr and curc are accurate */
92 1.14 dholland static int realr;
93 1.14 dholland static int realc;
94 1.1 cgd
95 1.5 lukem void
96 1.13 jmc fboard(void)
97 1.5 lukem {
98 1.5 lukem int i, j, l;
99 1.1 cgd
100 1.5 lukem curmove(0, 0); /* do top line */
101 1.1 cgd for (i = 0; i < 53; i++)
102 1.5 lukem fancyc('_');
103 1.1 cgd
104 1.5 lukem curmove(15, 0); /* do botttom line */
105 1.1 cgd for (i = 0; i < 53; i++)
106 1.5 lukem fancyc('_');
107 1.1 cgd
108 1.5 lukem l = 1; /* do vertical lines */
109 1.5 lukem for (i = 52; i > -1; i -= 28) {
110 1.5 lukem curmove((l == 1 ? 1 : 15), i);
111 1.5 lukem fancyc('|');
112 1.5 lukem for (j = 0; j < 14; j++) {
113 1.5 lukem curmove(curr + l, curc - 1);
114 1.5 lukem fancyc('|');
115 1.1 cgd }
116 1.1 cgd if (i == 24)
117 1.1 cgd i += 32;
118 1.5 lukem l = -l; /* alternate directions */
119 1.1 cgd }
120 1.1 cgd
121 1.5 lukem curmove(2, 1); /* label positions 13-18 */
122 1.5 lukem for (i = 13; i < 18; i++) {
123 1.5 lukem fancyc('1');
124 1.5 lukem fancyc((i % 10) + '0');
125 1.5 lukem curmove(curr, curc + 2);
126 1.5 lukem }
127 1.5 lukem fancyc('1');
128 1.5 lukem fancyc('8');
129 1.5 lukem
130 1.5 lukem curmove(2, 29); /* label positions 19-24 */
131 1.5 lukem fancyc('1');
132 1.5 lukem fancyc('9');
133 1.5 lukem for (i = 20; i < 25; i++) {
134 1.5 lukem curmove(curr, curc + 2);
135 1.5 lukem fancyc('2');
136 1.5 lukem fancyc((i % 10) + '0');
137 1.5 lukem }
138 1.5 lukem
139 1.5 lukem curmove(14, 1); /* label positions 12-7 */
140 1.5 lukem fancyc('1');
141 1.5 lukem fancyc('2');
142 1.5 lukem for (i = 11; i > 6; i--) {
143 1.5 lukem curmove(curr, curc + 2);
144 1.5 lukem fancyc(i > 9 ? '1' : ' ');
145 1.5 lukem fancyc((i % 10) + '0');
146 1.1 cgd }
147 1.1 cgd
148 1.5 lukem curmove(14, 30); /* label positions 6-1 */
149 1.5 lukem fancyc('6');
150 1.1 cgd for (i = 5; i > 0; i--) {
151 1.5 lukem curmove(curr, curc + 3);
152 1.5 lukem fancyc(i + '0');
153 1.1 cgd }
154 1.1 cgd
155 1.5 lukem for (i = 12; i > 6; i--)/* print positions 12-7 */
156 1.1 cgd if (board[i])
157 1.5 lukem bsect(board[i], 13, 1 + 4 * (12 - i), -1);
158 1.1 cgd
159 1.5 lukem if (board[0]) /* print red men on bar */
160 1.5 lukem bsect(board[0], 13, 25, -1);
161 1.1 cgd
162 1.5 lukem for (i = 6; i > 0; i--) /* print positions 6-1 */
163 1.1 cgd if (board[i])
164 1.5 lukem bsect(board[i], 13, 29 + 4 * (6 - i), -1);
165 1.1 cgd
166 1.5 lukem l = (off[1] < 0 ? off[1] + 15 : off[1]); /* print white's home */
167 1.5 lukem bsect(l, 3, 54, 1);
168 1.1 cgd
169 1.5 lukem curmove(8, 25); /* print the word BAR */
170 1.5 lukem fancyc('B');
171 1.5 lukem fancyc('A');
172 1.5 lukem fancyc('R');
173 1.1 cgd
174 1.5 lukem for (i = 13; i < 19; i++) /* print positions 13-18 */
175 1.1 cgd if (board[i])
176 1.5 lukem bsect(board[i], 3, 1 + 4 * (i - 13), 1);
177 1.1 cgd
178 1.5 lukem if (board[25]) /* print white's men on bar */
179 1.5 lukem bsect(board[25], 3, 25, 1);
180 1.1 cgd
181 1.5 lukem for (i = 19; i < 25; i++) /* print positions 19-24 */
182 1.1 cgd if (board[i])
183 1.5 lukem bsect(board[i], 3, 29 + 4 * (i - 19), 1);
184 1.1 cgd
185 1.5 lukem l = (off[0] < 0 ? off[0] + 15 : off[0]); /* print red's home */
186 1.5 lukem bsect(-l, 13, 54, -1);
187 1.1 cgd
188 1.5 lukem for (i = 0; i < 26; i++)/* save board position for refresh later */
189 1.1 cgd oldb[i] = board[i];
190 1.5 lukem oldr = (off[1] < 0 ? off[1] + 15 : off[1]);
191 1.5 lukem oldw = -(off[0] < 0 ? off[0] + 15 : off[0]);
192 1.1 cgd }
193 1.1 cgd /*
194 1.1 cgd * bsect (b,rpos,cpos,cnext)
195 1.1 cgd * Print the contents of a board position. "b" has the value of the
196 1.1 cgd * position, "rpos" is the row to start printing, "cpos" is the column to
197 1.1 cgd * start printing, and "cnext" is positive if the position starts at the top
198 1.1 cgd * and negative if it starts at the bottom. The value of "cpos" is checked
199 1.1 cgd * to see if the position is a player's home, since those are printed
200 1.1 cgd * differently.
201 1.1 cgd */
202 1.14 dholland static void
203 1.13 jmc bsect(int b, int rpos, int cpos, int cnext)
204 1.5 lukem {
205 1.5 lukem int j; /* index */
206 1.5 lukem int n; /* number of men on position */
207 1.5 lukem int bct; /* counter */
208 1.5 lukem int k; /* index */
209 1.5 lukem char pc; /* color of men on position */
210 1.5 lukem
211 1.5 lukem bct = 0;
212 1.5 lukem n = abs(b); /* initialize n and pc */
213 1.5 lukem pc = (b > 0 ? 'r' : 'w');
214 1.1 cgd
215 1.5 lukem if (n < 6 && cpos < 54) /* position cursor at start */
216 1.5 lukem curmove(rpos, cpos + 1);
217 1.5 lukem else
218 1.5 lukem curmove(rpos, cpos);
219 1.1 cgd
220 1.5 lukem for (j = 0; j < 5; j++) { /* print position row by row */
221 1.1 cgd
222 1.5 lukem for (k = 0; k < 15; k += 5) /* print men */
223 1.5 lukem if (n > j + k)
224 1.5 lukem fancyc(pc);
225 1.1 cgd
226 1.5 lukem if (j < 4) { /* figure how far to back up for next row */
227 1.5 lukem if (n < 6) { /* stop if none left */
228 1.5 lukem if (j + 1 == n)
229 1.1 cgd break;
230 1.5 lukem bct = 1; /* single column */
231 1.5 lukem } else {
232 1.5 lukem if (n < 11) { /* two columns */
233 1.5 lukem if (cpos == 54) { /* home pos */
234 1.5 lukem if (j + 5 >= n)
235 1.1 cgd bct = 1;
236 1.1 cgd else
237 1.1 cgd bct = 2;
238 1.1 cgd }
239 1.5 lukem if (cpos < 54) { /* not home */
240 1.5 lukem if (j + 6 >= n)
241 1.1 cgd bct = 1;
242 1.1 cgd else
243 1.1 cgd bct = 2;
244 1.1 cgd }
245 1.5 lukem } else { /* three columns */
246 1.5 lukem if (j + 10 >= n)
247 1.1 cgd bct = 2;
248 1.1 cgd else
249 1.1 cgd bct = 3;
250 1.1 cgd }
251 1.1 cgd }
252 1.13 jmc /* reposition cursor */
253 1.13 jmc curmove(curr + cnext, curc - bct);
254 1.1 cgd }
255 1.1 cgd }
256 1.1 cgd }
257 1.1 cgd
258 1.5 lukem void
259 1.13 jmc refresh(void)
260 1.5 lukem {
261 1.5 lukem int i, r, c;
262 1.5 lukem
263 1.5 lukem r = curr; /* save current position */
264 1.1 cgd c = curc;
265 1.1 cgd
266 1.5 lukem for (i = 12; i > 6; i--)/* fix positions 12-7 */
267 1.5 lukem if (board[i] != oldb[i]) {
268 1.5 lukem fixpos(oldb[i], board[i], 13, 1 + (12 - i) * 4, -1);
269 1.1 cgd oldb[i] = board[i];
270 1.1 cgd }
271 1.5 lukem if (board[0] != oldb[0]) { /* fix red men on bar */
272 1.5 lukem fixpos(oldb[0], board[0], 13, 25, -1);
273 1.1 cgd oldb[0] = board[0];
274 1.1 cgd }
275 1.5 lukem for (i = 6; i > 0; i--) /* fix positions 6-1 */
276 1.5 lukem if (board[i] != oldb[i]) {
277 1.5 lukem fixpos(oldb[i], board[i], 13, 29 + (6 - i) * 4, -1);
278 1.1 cgd oldb[i] = board[i];
279 1.1 cgd }
280 1.5 lukem i = -(off[0] < 0 ? off[0] + 15 : off[0]); /* fix white's home */
281 1.5 lukem if (oldw != i) {
282 1.5 lukem fixpos(oldw, i, 13, 54, -1);
283 1.1 cgd oldw = i;
284 1.1 cgd }
285 1.5 lukem for (i = 13; i < 19; i++) /* fix positions 13-18 */
286 1.5 lukem if (board[i] != oldb[i]) {
287 1.5 lukem fixpos(oldb[i], board[i], 3, 1 + (i - 13) * 4, 1);
288 1.1 cgd oldb[i] = board[i];
289 1.1 cgd }
290 1.5 lukem if (board[25] != oldb[25]) { /* fix white men on bar */
291 1.5 lukem fixpos(oldb[25], board[25], 3, 25, 1);
292 1.1 cgd oldb[25] = board[25];
293 1.1 cgd }
294 1.5 lukem for (i = 19; i < 25; i++) /* fix positions 19-24 */
295 1.5 lukem if (board[i] != oldb[i]) {
296 1.5 lukem fixpos(oldb[i], board[i], 3, 29 + (i - 19) * 4, 1);
297 1.1 cgd oldb[i] = board[i];
298 1.1 cgd }
299 1.5 lukem i = (off[1] < 0 ? off[1] + 15 : off[1]); /* fix red's home */
300 1.5 lukem if (oldr != i) {
301 1.5 lukem fixpos(oldr, i, 3, 54, 1);
302 1.1 cgd oldr = i;
303 1.1 cgd }
304 1.5 lukem curmove(r, c); /* return to saved position */
305 1.1 cgd newpos();
306 1.1 cgd buflush();
307 1.1 cgd }
308 1.1 cgd
309 1.14 dholland static void
310 1.13 jmc fixpos(int cur, int new, int r, int c, int inc)
311 1.1 cgd {
312 1.5 lukem int o, n, nv;
313 1.5 lukem int ov, nc;
314 1.5 lukem char col;
315 1.1 cgd
316 1.5 lukem nc = 0;
317 1.13 jmc if (cur * new >= 0) {
318 1.13 jmc ov = abs(cur);
319 1.1 cgd nv = abs(new);
320 1.13 jmc col = (cur + new > 0 ? 'r' : 'w');
321 1.5 lukem o = (ov - 1) / 5;
322 1.5 lukem n = (nv - 1) / 5;
323 1.5 lukem if (o == n) {
324 1.1 cgd if (o == 2)
325 1.5 lukem nc = c + 2;
326 1.1 cgd if (o == 1)
327 1.5 lukem nc = c < 54 ? c : c + 1;
328 1.1 cgd if (o == 0)
329 1.5 lukem nc = c < 54 ? c + 1 : c;
330 1.1 cgd if (ov > nv)
331 1.13 jmc fixcol(r + inc * (nv - n * 5), nc,
332 1.13 jmc abs(ov - nv), ' ', inc);
333 1.1 cgd else
334 1.13 jmc fixcol(r + inc * (ov - o * 5), nc,
335 1.13 jmc abs(ov - nv), col, inc);
336 1.1 cgd return;
337 1.5 lukem } else {
338 1.5 lukem if (c < 54) {
339 1.5 lukem if (o + n == 1) {
340 1.5 lukem if (n) {
341 1.13 jmc fixcol(r, c, abs(nv - 5), col,
342 1.13 jmc inc);
343 1.1 cgd if (ov != 5)
344 1.13 jmc fixcol(r + inc * ov,
345 1.13 jmc c + 1, abs(ov - 5),
346 1.13 jmc col, inc);
347 1.5 lukem } else {
348 1.13 jmc fixcol(r, c, abs(ov - 5), ' ',
349 1.13 jmc inc);
350 1.1 cgd if (nv != 5)
351 1.13 jmc fixcol(r + inc * nv,
352 1.13 jmc c + 1, abs(nv - 5),
353 1.13 jmc ' ', inc);
354 1.1 cgd }
355 1.1 cgd return;
356 1.1 cgd }
357 1.5 lukem if (n == 2) {
358 1.1 cgd if (ov != 10)
359 1.5 lukem fixcol(r + inc * (ov - 5), c,
360 1.5 lukem abs(ov - 10), col, inc);
361 1.13 jmc fixcol(r, c + 2, abs(nv - 10), col,
362 1.13 jmc inc);
363 1.5 lukem } else {
364 1.1 cgd if (nv != 10)
365 1.5 lukem fixcol(r + inc * (nv - 5), c,
366 1.5 lukem abs(nv - 10), ' ', inc);
367 1.13 jmc fixcol(r, c + 2, abs(ov - 10), ' ',
368 1.13 jmc inc);
369 1.1 cgd }
370 1.1 cgd return;
371 1.1 cgd }
372 1.5 lukem if (n > o) {
373 1.13 jmc fixcol(r + inc * (ov % 5), c + o,
374 1.13 jmc abs(5 * n - ov), col, inc);
375 1.5 lukem if (nv != 5 * n)
376 1.13 jmc fixcol(r, c + n, abs(5 * n - nv),
377 1.13 jmc col, inc);
378 1.5 lukem } else {
379 1.13 jmc fixcol(r + inc * (nv % 5), c + n,
380 1.13 jmc abs(5 * n - nv), ' ', inc);
381 1.5 lukem if (ov != 5 * o)
382 1.13 jmc fixcol(r, c + o, abs(5 * o - ov),
383 1.13 jmc ' ', inc);
384 1.1 cgd }
385 1.1 cgd return;
386 1.1 cgd }
387 1.1 cgd }
388 1.1 cgd nv = abs(new);
389 1.5 lukem fixcol(r, c + 1, nv, new > 0 ? 'r' : 'w', inc);
390 1.13 jmc if (abs(cur) <= abs(new))
391 1.1 cgd return;
392 1.13 jmc fixcol(r + inc * new, c + 1, abs(cur + new), ' ', inc);
393 1.1 cgd }
394 1.1 cgd
395 1.14 dholland static void
396 1.13 jmc fixcol(int r, int c, int l, int ch, int inc)
397 1.1 cgd {
398 1.5 lukem int i;
399 1.1 cgd
400 1.5 lukem curmove(r, c);
401 1.5 lukem fancyc(ch);
402 1.5 lukem for (i = 1; i < l; i++) {
403 1.5 lukem curmove(curr + inc, curc - 1);
404 1.5 lukem fancyc(ch);
405 1.1 cgd }
406 1.1 cgd }
407 1.1 cgd
408 1.5 lukem void
409 1.13 jmc curmove(int r, int c)
410 1.1 cgd {
411 1.1 cgd if (curr == r && curc == c)
412 1.1 cgd return;
413 1.5 lukem if (realr == -1) {
414 1.1 cgd realr = curr;
415 1.1 cgd realc = curc;
416 1.1 cgd }
417 1.1 cgd curr = r;
418 1.1 cgd curc = c;
419 1.1 cgd }
420 1.1 cgd
421 1.5 lukem void
422 1.13 jmc newpos(void)
423 1.5 lukem {
424 1.5 lukem int r; /* destination row */
425 1.5 lukem int c; /* destination column */
426 1.5 lukem int mode = -1; /* mode of movement */
427 1.1 cgd
428 1.13 jmc int ccount = 1000; /* character count */
429 1.5 lukem int i; /* index */
430 1.5 lukem int n; /* temporary variable */
431 1.5 lukem char *m; /* string containing CM movement */
432 1.1 cgd
433 1.1 cgd
434 1.5 lukem m = NULL;
435 1.5 lukem if (realr == -1) /* see if already there */
436 1.1 cgd return;
437 1.1 cgd
438 1.5 lukem r = curr; /* set current and dest. positions */
439 1.1 cgd c = curc;
440 1.1 cgd curr = realr;
441 1.1 cgd curc = realc;
442 1.1 cgd
443 1.5 lukem /* double check position */
444 1.5 lukem if (curr == r && curc == c) {
445 1.1 cgd realr = realc = -1;
446 1.1 cgd return;
447 1.1 cgd }
448 1.5 lukem if (CM) { /* try CM to get there */
449 1.1 cgd mode = 0;
450 1.5 lukem m = (char *) tgoto(CM, c, r);
451 1.13 jmc ccount = strlen(m);
452 1.1 cgd }
453 1.5 lukem /* try HO and local movement */
454 1.13 jmc if (HO && (n = r + c * lND + lHO) < ccount) {
455 1.1 cgd mode = 1;
456 1.13 jmc ccount = n;
457 1.1 cgd }
458 1.5 lukem /* try various LF combinations */
459 1.5 lukem if (r >= curr) {
460 1.5 lukem /* CR, LF, and ND */
461 1.13 jmc if ((n = (r - curr) + c * lND + 1) < ccount) {
462 1.1 cgd mode = 2;
463 1.13 jmc ccount = n;
464 1.1 cgd }
465 1.5 lukem /* LF, ND */
466 1.13 jmc if (c >= curc && (n = (r - curr) + (c - curc) * lND) < ccount) {
467 1.1 cgd mode = 3;
468 1.13 jmc ccount = n;
469 1.1 cgd }
470 1.5 lukem /* LF, BS */
471 1.13 jmc if (c < curc && (n = (r - curr) + (curc - c) * lBC) < ccount) {
472 1.1 cgd mode = 4;
473 1.13 jmc ccount = n;
474 1.1 cgd }
475 1.1 cgd }
476 1.5 lukem /* try corresponding UP combinations */
477 1.5 lukem if (r < curr) {
478 1.5 lukem /* CR, UP, and ND */
479 1.13 jmc if ((n = (curr - r) * lUP + c * lND + 1) < ccount) {
480 1.1 cgd mode = 5;
481 1.13 jmc ccount = n;
482 1.1 cgd }
483 1.5 lukem /* UP and ND */
484 1.13 jmc if (c >= curc &&
485 1.13 jmc (n = (curr - r) * lUP + (c - curc) * lND) < ccount) {
486 1.1 cgd mode = 6;
487 1.13 jmc ccount = n;
488 1.1 cgd }
489 1.5 lukem /* UP and BS */
490 1.13 jmc if (c < curc &&
491 1.13 jmc (n = (curr - r) * lUP + (curc - c) * lBC) < ccount) {
492 1.1 cgd mode = 7;
493 1.13 jmc ccount = n;
494 1.1 cgd }
495 1.1 cgd }
496 1.5 lukem /* space over */
497 1.13 jmc if (curr == r && c > curc && linect[r] < curc && c - curc < ccount)
498 1.1 cgd mode = 8;
499 1.1 cgd
500 1.5 lukem switch (mode) {
501 1.1 cgd
502 1.5 lukem case -1: /* error! */
503 1.5 lukem write(2, "\r\nInternal cursor error.\r\n", 26);
504 1.5 lukem getout(0);
505 1.5 lukem
506 1.5 lukem /* direct cursor motion */
507 1.5 lukem case 0:
508 1.5 lukem tputs(m, abs(curr - r), addbuf);
509 1.1 cgd break;
510 1.1 cgd
511 1.5 lukem /* relative to "home" */
512 1.5 lukem case 1:
513 1.5 lukem tputs(HO, r, addbuf);
514 1.1 cgd for (i = 0; i < r; i++)
515 1.5 lukem addbuf('\012');
516 1.1 cgd for (i = 0; i < c; i++)
517 1.5 lukem tputs(ND, 1, addbuf);
518 1.1 cgd break;
519 1.1 cgd
520 1.5 lukem /* CR and down and over */
521 1.5 lukem case 2:
522 1.5 lukem addbuf('\015');
523 1.5 lukem for (i = 0; i < r - curr; i++)
524 1.5 lukem addbuf('\012');
525 1.1 cgd for (i = 0; i < c; i++)
526 1.5 lukem tputs(ND, 1, addbuf);
527 1.1 cgd break;
528 1.5 lukem
529 1.5 lukem /* down and over */
530 1.5 lukem case 3:
531 1.5 lukem for (i = 0; i < r - curr; i++)
532 1.5 lukem addbuf('\012');
533 1.5 lukem for (i = 0; i < c - curc; i++)
534 1.5 lukem tputs(ND, 1, addbuf);
535 1.1 cgd break;
536 1.5 lukem
537 1.5 lukem /* down and back */
538 1.5 lukem case 4:
539 1.5 lukem for (i = 0; i < r - curr; i++)
540 1.5 lukem addbuf('\012');
541 1.5 lukem for (i = 0; i < curc - c; i++)
542 1.5 lukem addbuf('\010');
543 1.1 cgd break;
544 1.5 lukem
545 1.5 lukem /* CR and up and over */
546 1.5 lukem case 5:
547 1.5 lukem addbuf('\015');
548 1.5 lukem for (i = 0; i < curr - r; i++)
549 1.5 lukem tputs(UP, 1, addbuf);
550 1.1 cgd for (i = 0; i < c; i++)
551 1.5 lukem tputs(ND, 1, addbuf);
552 1.1 cgd break;
553 1.5 lukem
554 1.5 lukem /* up and over */
555 1.5 lukem case 6:
556 1.5 lukem for (i = 0; i < curr - r; i++)
557 1.5 lukem tputs(UP, 1, addbuf);
558 1.5 lukem for (i = 0; i < c - curc; i++)
559 1.5 lukem tputs(ND, 1, addbuf);
560 1.1 cgd break;
561 1.5 lukem
562 1.5 lukem /* up and back */
563 1.5 lukem case 7:
564 1.5 lukem for (i = 0; i < curr - r; i++)
565 1.5 lukem tputs(UP, 1, addbuf);
566 1.5 lukem for (i = 0; i < curc - c; i++) {
567 1.1 cgd if (BC)
568 1.5 lukem tputs(BC, 1, addbuf);
569 1.1 cgd else
570 1.5 lukem addbuf('\010');
571 1.1 cgd }
572 1.1 cgd break;
573 1.1 cgd
574 1.5 lukem /* safe space */
575 1.5 lukem case 8:
576 1.5 lukem for (i = 0; i < c - curc; i++)
577 1.5 lukem addbuf(' ');
578 1.1 cgd }
579 1.1 cgd
580 1.5 lukem /* fix positions */
581 1.1 cgd curr = r;
582 1.1 cgd curc = c;
583 1.1 cgd realr = -1;
584 1.1 cgd realc = -1;
585 1.1 cgd }
586 1.1 cgd
587 1.5 lukem void
588 1.13 jmc clear(void)
589 1.5 lukem {
590 1.5 lukem int i;
591 1.5 lukem
592 1.5 lukem /* double space if can't clear */
593 1.5 lukem if (CL == 0) {
594 1.5 lukem writel("\n\n");
595 1.1 cgd return;
596 1.1 cgd }
597 1.5 lukem curr = curc = 0; /* fix position markers */
598 1.1 cgd realr = realc = -1;
599 1.5 lukem for (i = 0; i < 24; i++)/* clear line counts */
600 1.1 cgd linect[i] = -1;
601 1.5 lukem buffnum = -1; /* ignore leftover buffer contents */
602 1.5 lukem tputs(CL, CO, addbuf); /* put CL in buffer */
603 1.1 cgd }
604 1.5 lukem
605 1.5 lukem void
606 1.13 jmc fancyc(int c)
607 1.1 cgd {
608 1.5 lukem int sp; /* counts spaces in a tab */
609 1.1 cgd
610 1.5 lukem if (c == '\007') { /* bells go in blindly */
611 1.5 lukem addbuf(c);
612 1.1 cgd return;
613 1.1 cgd }
614 1.12 simonb /* process tabs, use spaces if the tab should be erasing things,
615 1.5 lukem * otherwise use cursor movement routines. Note this does not use
616 1.5 lukem * hardware tabs at all. */
617 1.5 lukem if (c == '\t') {
618 1.5 lukem sp = (curc + 8) & (~7); /* compute spaces */
619 1.5 lukem /* check line length */
620 1.5 lukem if (linect[curr] >= curc || sp < 4) {
621 1.1 cgd for (; sp > curc; sp--)
622 1.5 lukem addbuf(' ');
623 1.5 lukem curc = sp; /* fix curc */
624 1.1 cgd } else
625 1.5 lukem curmove(curr, sp);
626 1.1 cgd return;
627 1.1 cgd }
628 1.5 lukem /* do newline be calling newline */
629 1.5 lukem if (c == '\n') {
630 1.1 cgd newline();
631 1.1 cgd return;
632 1.1 cgd }
633 1.5 lukem /* ignore any other control chars */
634 1.1 cgd if (c < ' ')
635 1.1 cgd return;
636 1.1 cgd
637 1.5 lukem /* if an erasing space or non-space, just add it to buffer. Otherwise
638 1.5 lukem * use cursor movement routine, so that multiple spaces will be
639 1.5 lukem * grouped together */
640 1.5 lukem if (c > ' ' || linect[curr] >= curc) {
641 1.5 lukem newpos(); /* make sure position correct */
642 1.5 lukem addbuf(c); /* add character to buffer */
643 1.5 lukem /* fix line length */
644 1.1 cgd if (c == ' ' && linect[curr] == curc)
645 1.1 cgd linect[curr]--;
646 1.5 lukem else
647 1.5 lukem if (linect[curr] < curc)
648 1.5 lukem linect[curr] = curc;
649 1.5 lukem curc++; /* fix curc */
650 1.1 cgd } else
651 1.5 lukem /* use cursor movement routine */
652 1.5 lukem curmove(curr, curc + 1);
653 1.1 cgd }
654 1.1 cgd
655 1.5 lukem void
656 1.13 jmc clend(void)
657 1.5 lukem {
658 1.5 lukem int i;
659 1.1 cgd
660 1.5 lukem if (CD) {
661 1.5 lukem tputs(CD, CO - curr, addbuf);
662 1.1 cgd for (i = curr; i < LI; i++)
663 1.1 cgd linect[i] = -1;
664 1.1 cgd return;
665 1.1 cgd }
666 1.5 lukem curmove(i = curr, 0);
667 1.1 cgd cline();
668 1.5 lukem while (curr < LI - 1) {
669 1.5 lukem curmove(curr + 1, 0);
670 1.1 cgd if (linect[curr] > -1)
671 1.5 lukem cline();
672 1.1 cgd }
673 1.5 lukem curmove(i, 0);
674 1.1 cgd }
675 1.1 cgd
676 1.5 lukem void
677 1.13 jmc cline(void)
678 1.5 lukem {
679 1.5 lukem int c;
680 1.1 cgd
681 1.1 cgd if (curc > linect[curr])
682 1.1 cgd return;
683 1.5 lukem newpos();
684 1.5 lukem if (CE) {
685 1.5 lukem tputs(CE, 1, addbuf);
686 1.5 lukem linect[curr] = curc - 1;
687 1.5 lukem } else {
688 1.5 lukem c = curc - 1;
689 1.5 lukem while (linect[curr] > c) {
690 1.5 lukem addbuf(' ');
691 1.1 cgd curc++;
692 1.1 cgd linect[curr]--;
693 1.1 cgd }
694 1.5 lukem curmove(curr, c + 1);
695 1.1 cgd }
696 1.1 cgd }
697 1.1 cgd
698 1.14 dholland static void
699 1.13 jmc newline(void)
700 1.5 lukem {
701 1.1 cgd cline();
702 1.5 lukem if (curr == LI - 1)
703 1.5 lukem curmove(begscr, 0);
704 1.1 cgd else
705 1.5 lukem curmove(curr + 1, 0);
706 1.1 cgd }
707 1.1 cgd
708 1.5 lukem int
709 1.13 jmc getcaps(const char *s)
710 1.1 cgd {
711 1.5 lukem char *code; /* two letter code */
712 1.5 lukem char ***cap; /* pointer to cap string */
713 1.5 lukem char *bufp; /* pointer to cap buffer */
714 1.5 lukem char tentry[1024]; /* temporary uncoded caps buffer */
715 1.1 cgd
716 1.9 hubertf tgetent(tentry, s); /* get uncoded termcap entry */
717 1.1 cgd
718 1.5 lukem LI = tgetnum("li"); /* get number of lines */
719 1.1 cgd if (LI == -1)
720 1.1 cgd LI = 12;
721 1.5 lukem CO = tgetnum("co"); /* get number of columns */
722 1.1 cgd if (CO == -1)
723 1.1 cgd CO = 65;
724 1.1 cgd
725 1.5 lukem bufp = tbuf; /* get padding character */
726 1.5 lukem tgetstr("pc", &bufp);
727 1.1 cgd if (bufp != tbuf)
728 1.1 cgd PC = *tbuf;
729 1.1 cgd else
730 1.1 cgd PC = 0;
731 1.1 cgd
732 1.5 lukem bufp = tbuf; /* get string entries */
733 1.1 cgd cap = tstr;
734 1.1 cgd for (code = tcap; *code; code += 2)
735 1.5 lukem **cap++ = (char *) tgetstr(code, &bufp);
736 1.1 cgd
737 1.5 lukem /* get pertinent lengths */
738 1.1 cgd if (HO)
739 1.5 lukem lHO = strlen(HO);
740 1.1 cgd if (BC)
741 1.5 lukem lBC = strlen(BC);
742 1.1 cgd else
743 1.1 cgd lBC = 1;
744 1.1 cgd if (UP)
745 1.5 lukem lUP = strlen(UP);
746 1.1 cgd if (ND)
747 1.5 lukem lND = strlen(ND);
748 1.1 cgd if (LI < 24 || CO < 72 || !(CL && UP && ND))
749 1.1 cgd return (0);
750 1.5 lukem linect = (int *) calloc(LI + 1, sizeof(int));
751 1.10 hubertf if (linect == NULL) {
752 1.10 hubertf write(2, "\r\nOut of memory!\r\n", 18);
753 1.10 hubertf getout(0);
754 1.10 hubertf }
755 1.1 cgd return (1);
756 1.1 cgd }
757