tscroll.c revision 1.12 1 1.12 agc /* $NetBSD: tscroll.c,v 1.12 2003/08/07 16:44:25 agc Exp $ */
2 1.4 mikel
3 1.1 cgd /*-
4 1.3 cgd * Copyright (c) 1992, 1993, 1994
5 1.1 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.12 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.4 mikel #include <sys/cdefs.h>
33 1.6 jdc
34 1.1 cgd #ifndef lint
35 1.4 mikel #if 0
36 1.3 cgd static char sccsid[] = "@(#)tscroll.c 8.4 (Berkeley) 7/27/94";
37 1.4 mikel #else
38 1.12 agc __RCSID("$NetBSD: tscroll.c,v 1.12 2003/08/07 16:44:25 agc Exp $");
39 1.4 mikel #endif
40 1.5 mrg #endif /* not lint */
41 1.1 cgd
42 1.11 christos #include <string.h>
43 1.11 christos #include <stdarg.h>
44 1.3 cgd #include "curses.h"
45 1.6 jdc #include "curses_private.h"
46 1.1 cgd
47 1.1 cgd #define MAXRETURNSIZE 64
48 1.1 cgd
49 1.6 jdc char *
50 1.7 jdc __tscroll(const char *cap, int n1, int n2)
51 1.6 jdc {
52 1.6 jdc return (__parse_cap(cap, n1, n2));
53 1.6 jdc }
54 1.6 jdc
55 1.1 cgd /*
56 1.6 jdc * Routines to parse capabilities. Derived from tgoto.c in termcap(3)
57 1.3 cgd * library. Cap is a string containing printf type escapes to allow
58 1.3 cgd * scrolling. The following escapes are defined for substituting n:
59 1.1 cgd *
60 1.1 cgd * %d as in printf
61 1.1 cgd * %2 like %2d
62 1.1 cgd * %3 like %3d
63 1.1 cgd * %. gives %c hacking special case characters
64 1.1 cgd * %+x like %c but adding x first
65 1.1 cgd *
66 1.1 cgd * The codes below affect the state but don't use up a value.
67 1.1 cgd *
68 1.1 cgd * %>xy if value > x add y
69 1.1 cgd * %i increments n
70 1.1 cgd * %% gives %
71 1.1 cgd * %B BCD (2 decimal digits encoded in one byte)
72 1.1 cgd * %D Delta Data (backwards bcd)
73 1.1 cgd *
74 1.1 cgd * all other characters are ``self-inserting''.
75 1.6 jdc *
76 1.6 jdc * XXX:
77 1.6 jdc * %r reverse order of two parameters
78 1.6 jdc * is also defined but we don't support it (yet).
79 1.1 cgd */
80 1.6 jdc char *
81 1.6 jdc __parse_cap (char const *cap, ...)
82 1.1 cgd {
83 1.6 jdc va_list ap;
84 1.1 cgd static char result[MAXRETURNSIZE];
85 1.5 mrg int c, n;
86 1.5 mrg char *dp;
87 1.6 jdc int have_input;
88 1.1 cgd
89 1.6 jdc va_start (ap, cap);
90 1.9 jdc n = 0; /* XXX gcc -Wuninitialized */
91 1.9 jdc
92 1.3 cgd if (cap == NULL)
93 1.3 cgd goto err;
94 1.6 jdc #ifdef DEBUG
95 1.9 jdc {
96 1.9 jdc int i;
97 1.9 jdc
98 1.9 jdc __CTRACE("__parse_cap: cap = ");
99 1.9 jdc for (i = 0; i < strlen(cap); i++)
100 1.9 jdc __CTRACE("%s", unctrl(cap[i]));
101 1.9 jdc __CTRACE("\n");
102 1.9 jdc }
103 1.6 jdc #endif
104 1.6 jdc have_input = 0;
105 1.6 jdc for (dp = result; (c = *cap++) != '\0';) {
106 1.1 cgd if (c != '%') {
107 1.1 cgd *dp++ = c;
108 1.1 cgd continue;
109 1.1 cgd }
110 1.3 cgd switch (c = *cap++) {
111 1.1 cgd case 'n':
112 1.6 jdc if (!have_input) {
113 1.6 jdc n = va_arg (ap, int);
114 1.6 jdc have_input = 1;
115 1.6 jdc #ifdef DEBUG
116 1.6 jdc __CTRACE ("__parse_cap: %%n, val = %d\n", n);
117 1.6 jdc #endif
118 1.6 jdc }
119 1.1 cgd n ^= 0140;
120 1.1 cgd continue;
121 1.1 cgd case 'd':
122 1.6 jdc if (!have_input) {
123 1.6 jdc n = va_arg (ap, int);
124 1.6 jdc have_input = 1;
125 1.6 jdc #ifdef DEBUG
126 1.6 jdc __CTRACE ("__parse_cap: %%d, val = %d\n", n);
127 1.6 jdc #endif
128 1.6 jdc }
129 1.1 cgd if (n < 10)
130 1.1 cgd goto one;
131 1.1 cgd if (n < 100)
132 1.1 cgd goto two;
133 1.3 cgd /* FALLTHROUGH */
134 1.1 cgd case '3':
135 1.6 jdc if (!have_input) {
136 1.6 jdc n = va_arg (ap, int);
137 1.6 jdc have_input = 1;
138 1.6 jdc #ifdef DEBUG
139 1.6 jdc __CTRACE ("__parse_cap: %%3, val = %d\n", n);
140 1.6 jdc #endif
141 1.6 jdc }
142 1.1 cgd *dp++ = (n / 100) | '0';
143 1.1 cgd n %= 100;
144 1.3 cgd /* FALLTHROUGH */
145 1.1 cgd case '2':
146 1.6 jdc if (!have_input) {
147 1.6 jdc n = va_arg (ap, int);
148 1.6 jdc have_input = 1;
149 1.6 jdc #ifdef DEBUG
150 1.6 jdc __CTRACE ("__parse_cap: %%2, val = %d\n", n);
151 1.6 jdc #endif
152 1.6 jdc }
153 1.5 mrg two: *dp++ = n / 10 | '0';
154 1.5 mrg one: *dp++ = n % 10 | '0';
155 1.6 jdc have_input = 0;
156 1.1 cgd continue;
157 1.1 cgd case '>':
158 1.6 jdc if (!have_input) {
159 1.6 jdc n = va_arg (ap, int);
160 1.6 jdc have_input = 1;
161 1.6 jdc #ifdef DEBUG
162 1.6 jdc __CTRACE ("__parse_cap: %%>, val = %d\n", n);
163 1.6 jdc #endif
164 1.6 jdc }
165 1.3 cgd if (n > *cap++)
166 1.3 cgd n += *cap++;
167 1.1 cgd else
168 1.3 cgd cap++;
169 1.1 cgd continue;
170 1.1 cgd case '+':
171 1.6 jdc if (!have_input) {
172 1.6 jdc n = va_arg (ap, int);
173 1.6 jdc have_input = 1;
174 1.6 jdc #ifdef DEBUG
175 1.6 jdc __CTRACE ("__parse_cap: %%+, val = %d\n", n);
176 1.6 jdc #endif
177 1.6 jdc }
178 1.3 cgd n += *cap++;
179 1.3 cgd /* FALLTHROUGH */
180 1.1 cgd case '.':
181 1.6 jdc if (!have_input) {
182 1.6 jdc n = va_arg (ap, int);
183 1.6 jdc have_input = 1;
184 1.6 jdc #ifdef DEBUG
185 1.6 jdc __CTRACE ("__parse_cap: %%., val = %d\n", n);
186 1.6 jdc #endif
187 1.6 jdc }
188 1.1 cgd *dp++ = n;
189 1.6 jdc have_input = 0;
190 1.1 cgd continue;
191 1.1 cgd case 'i':
192 1.6 jdc if (!have_input) {
193 1.6 jdc n = va_arg (ap, int);
194 1.6 jdc have_input = 1;
195 1.6 jdc #ifdef DEBUG
196 1.6 jdc __CTRACE ("__parse_cap: %%i, val = %d\n", n);
197 1.6 jdc #endif
198 1.6 jdc }
199 1.1 cgd n++;
200 1.1 cgd continue;
201 1.1 cgd case '%':
202 1.1 cgd *dp++ = c;
203 1.1 cgd continue;
204 1.1 cgd case 'B':
205 1.6 jdc if (!have_input) {
206 1.6 jdc n = va_arg (ap, int);
207 1.6 jdc have_input = 1;
208 1.6 jdc #ifdef DEBUG
209 1.6 jdc __CTRACE ("__parse_cap: %%B, val = %d\n", n);
210 1.6 jdc #endif
211 1.6 jdc }
212 1.1 cgd n = (n / 10 << 4) + n % 10;
213 1.1 cgd continue;
214 1.1 cgd case 'D':
215 1.6 jdc if (!have_input) {
216 1.6 jdc n = va_arg (ap, int);
217 1.6 jdc have_input = 1;
218 1.6 jdc #ifdef DEBUG
219 1.6 jdc __CTRACE ("__parse_cap: %%D, val = %d\n", n);
220 1.6 jdc #endif
221 1.6 jdc }
222 1.1 cgd n = n - 2 * (n % 16);
223 1.1 cgd continue;
224 1.5 mrg /*
225 1.5 mrg * XXX
226 1.5 mrg * System V terminfo files have lots of extra gunk.
227 1.6 jdc * The only other one we've seen in capability strings
228 1.6 jdc * is %pN, and it seems to work okay if we ignore it.
229 1.5 mrg */
230 1.3 cgd case 'p':
231 1.3 cgd ++cap;
232 1.3 cgd continue;
233 1.1 cgd default:
234 1.3 cgd goto err;
235 1.1 cgd }
236 1.1 cgd }
237 1.1 cgd *dp = '\0';
238 1.6 jdc va_end (ap);
239 1.1 cgd return (result);
240 1.3 cgd
241 1.6 jdc err: va_end (ap);
242 1.8 blymn return ((char *) "\0");
243 1.1 cgd }
244