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
|
/****************************************************************************
* Copyright (c) 2000 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/*
* Author: Thomas E. Dickey <dickey@clark.net> 2000
*
* $Id: railroad.c,v 1.5 2001/03/24 22:01:42 tom Exp $
*
* A simple demo of the termcap interface.
*/
#include <test.priv.h>
#include <termcap.h>
#include <ctype.h>
#include <signal.h>
static char *wipeit;
static char *moveit;
static int length;
static int height;
static char *finisC;
static char *finisS;
static char *finisU;
static char *startC;
static char *startS;
static char *startU;
static char *backup;
static bool interrupted = FALSE;
static int
outc(int c)
{
if (interrupted) {
char tmp = c;
write(STDOUT_FILENO, &tmp, 1);
} else {
putc(c, stdout);
}
return 0;
}
static void
PutChar(int ch)
{
putchar(ch);
fflush(stdout);
napms(moveit ? 10 : 50); /* not really termcap... */
}
static void
Backup(void)
{
tputs(backup != 0 ? backup : "\b", 1, outc);
}
static void
ShowCursor(int flag)
{
if (startC != 0 && finisC != 0) {
tputs(flag ? startC : finisC, 1, outc);
}
}
static void
StandOut(int flag)
{
if (startS != 0 && finisS != 0) {
tputs(flag ? startS : finisS, 1, outc);
}
}
static void
Underline(int flag)
{
if (startU != 0 && finisU != 0) {
tputs(flag ? startU : finisU, 1, outc);
}
}
static void
ShowSign(char *string)
{
char *base = string;
int ch, first, last;
if (moveit != 0) {
tputs(tgoto(moveit, 0, height - 1), 1, outc);
tputs(wipeit, 1, outc);
}
while (*string != 0) {
ch = *string;
if (moveit != 0) {
for (first = length - 2; first >= (string - base); first--) {
if (first < length - 1) {
tputs(tgoto(moveit, first + 1, height - 1), 1, outc);
PutChar(' ');
}
tputs(tgoto(moveit, first, height - 1), 1, outc);
PutChar(ch);
}
} else {
last = ch;
if (isalpha(ch)) {
first = isupper(ch) ? 'A' : 'a';
} else if (isdigit(ch)) {
first = '0';
} else {
first = ch;
}
if (first < last) {
Underline(1);
while (first < last) {
PutChar(first);
Backup();
first++;
}
Underline(0);
}
}
if (moveit != 0)
Backup();
StandOut(1);
PutChar(ch);
StandOut(0);
fflush(stdout);
string++;
}
if (moveit != 0)
tputs(wipeit, 1, outc);
putchar('\n');
}
static void
cleanup(void)
{
Underline(0);
StandOut(0);
ShowCursor(1);
}
static void
onsig(int n GCC_UNUSED)
{
interrupted = TRUE;
cleanup();
exit(EXIT_FAILURE);
}
static void
railroad(char **args)
{
NCURSES_CONST char *name = getenv("TERM");
char buffer[1024];
char area[1024], *ap = area;
int j;
if (name == 0)
name = "dumb";
if (tgetent(buffer, name)) {
wipeit = tgetstr("ce", &ap);
height = tgetnum("li");
length = tgetnum("co");
moveit = tgetstr("cm", &ap);
if (wipeit == 0
|| moveit == 0
|| height <= 0
|| length <= 0) {
wipeit = 0;
moveit = 0;
height = 0;
length = 0;
}
startS = tgetstr("so", &ap);
finisS = tgetstr("se", &ap);
startU = tgetstr("us", &ap);
finisU = tgetstr("ue", &ap);
backup = tgetstr("le", &ap);
startC = tgetstr("ve", &ap);
finisC = tgetstr("vi", &ap);
ShowCursor(0);
for (j = SIGHUP; j <= SIGTERM; j++)
if (signal(j, SIG_IGN) != SIG_IGN)
signal(j, onsig);
while (*args) {
ShowSign(*args++);
}
ShowCursor(1);
}
}
int
main(int argc, char *argv[])
{
if (argc > 1) {
railroad(argv + 1);
} else {
static char world[] = "Hello World";
static char *hello[] =
{world, 0};
railroad(hello);
}
return EXIT_SUCCESS;
}
|
