tscroll.c revision 1.1 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1992, 1993
3 1.1 cgd * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd static char sccsid[] = "@(#)tscroll.c 8.1 (Berkeley) 6/4/93";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #include <curses.h>
39 1.1 cgd
40 1.1 cgd #define MAXRETURNSIZE 64
41 1.1 cgd
42 1.1 cgd /*
43 1.1 cgd * Routine to perform scrolling. Derived from tgoto.c in tercamp(3) library.
44 1.1 cgd * Cap is a string containing printf type escapes to allow
45 1.1 cgd * scrolling.
46 1.1 cgd * The following escapes are defined for substituting n:
47 1.1 cgd *
48 1.1 cgd * %d as in printf
49 1.1 cgd * %2 like %2d
50 1.1 cgd * %3 like %3d
51 1.1 cgd * %. gives %c hacking special case characters
52 1.1 cgd * %+x like %c but adding x first
53 1.1 cgd *
54 1.1 cgd * The codes below affect the state but don't use up a value.
55 1.1 cgd *
56 1.1 cgd * %>xy if value > x add y
57 1.1 cgd * %i increments n
58 1.1 cgd * %% gives %
59 1.1 cgd * %B BCD (2 decimal digits encoded in one byte)
60 1.1 cgd * %D Delta Data (backwards bcd)
61 1.1 cgd *
62 1.1 cgd * all other characters are ``self-inserting''.
63 1.1 cgd */
64 1.1 cgd char *
65 1.1 cgd __tscroll(cap, n)
66 1.1 cgd const char *cap;
67 1.1 cgd int n;
68 1.1 cgd {
69 1.1 cgd static char result[MAXRETURNSIZE];
70 1.1 cgd register char *dp;
71 1.1 cgd register int c;
72 1.1 cgd char *cp;
73 1.1 cgd
74 1.1 cgd if (cap == NULL) {
75 1.1 cgd toohard:
76 1.1 cgd /*
77 1.1 cgd * ``We don't do that under BOZO's big top''
78 1.1 cgd */
79 1.1 cgd return ("OOPS");
80 1.1 cgd }
81 1.1 cgd
82 1.1 cgd cp = (char *) cap;
83 1.1 cgd dp = result;
84 1.1 cgd while (c = *cp++) {
85 1.1 cgd if (c != '%') {
86 1.1 cgd *dp++ = c;
87 1.1 cgd continue;
88 1.1 cgd }
89 1.1 cgd switch (c = *cp++) {
90 1.1 cgd case 'n':
91 1.1 cgd n ^= 0140;
92 1.1 cgd continue;
93 1.1 cgd case 'd':
94 1.1 cgd if (n < 10)
95 1.1 cgd goto one;
96 1.1 cgd if (n < 100)
97 1.1 cgd goto two;
98 1.1 cgd /* fall into... */
99 1.1 cgd case '3':
100 1.1 cgd *dp++ = (n / 100) | '0';
101 1.1 cgd n %= 100;
102 1.1 cgd /* fall into... */
103 1.1 cgd case '2':
104 1.1 cgd two:
105 1.1 cgd *dp++ = n / 10 | '0';
106 1.1 cgd one:
107 1.1 cgd *dp++ = n % 10 | '0';
108 1.1 cgd continue;
109 1.1 cgd case '>':
110 1.1 cgd if (n > *cp++)
111 1.1 cgd n += *cp++;
112 1.1 cgd else
113 1.1 cgd cp++;
114 1.1 cgd continue;
115 1.1 cgd case '+':
116 1.1 cgd n += *cp++;
117 1.1 cgd /* fall into... */
118 1.1 cgd case '.':
119 1.1 cgd *dp++ = n;
120 1.1 cgd continue;
121 1.1 cgd case 'i':
122 1.1 cgd n++;
123 1.1 cgd continue;
124 1.1 cgd case '%':
125 1.1 cgd *dp++ = c;
126 1.1 cgd continue;
127 1.1 cgd
128 1.1 cgd case 'B':
129 1.1 cgd n = (n / 10 << 4) + n % 10;
130 1.1 cgd continue;
131 1.1 cgd case 'D':
132 1.1 cgd n = n - 2 * (n % 16);
133 1.1 cgd continue;
134 1.1 cgd default:
135 1.1 cgd goto toohard;
136 1.1 cgd }
137 1.1 cgd }
138 1.1 cgd *dp = '\0';
139 1.1 cgd return (result);
140 1.1 cgd }
141