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