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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
|
/* $NetBSD: io.c,v 1.18 1995/12/23 17:21:26 perry Exp $ */
/*
* Ported to boot 386BSD by Julian Elischer (julian@tfs.com) Sept 1992
*
* Mach Operating System
* Copyright (c) 1992, 1991 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie Mellon
* the rights to redistribute these changes.
*/
#include <sys/types.h>
#include <machine/pio.h>
void gateA20 __P((int on));
/*void printf __P((const char *format, int data));*/ /* not quite right XXX */
void putchar __P((int c));
int gets __P((char *buf));
int strcmp __P((const char *s1, const char *s2));
void bcopy __P((char *from, char *to, int len));
int awaitkey __P((int seconds));
void twiddle __P((void));
#define K_RDWR 0x60 /* keyboard data & cmds (read/write) */
#define K_STATUS 0x64 /* keyboard status */
#define K_CMD 0x64 /* keybd ctlr command (write-only) */
#define K_OBUF_FUL 0x01 /* output buffer full */
#define K_IBUF_FUL 0x02 /* input buffer full */
#define KC_CMD_WIN 0xd0 /* read output port */
#define KC_CMD_WOUT 0xd1 /* write output port */
#define KB_A20 0xdf /* enable A20,
enable output buffer full interrupt
enable data line
enable clock line */
/*
* Gate A20 for high memory
*/
void
gateA20(on)
int on;
{
#ifdef IBM_L40
outb(0x92, 0x2);
#else IBM_L40
while (inb(K_STATUS) & K_IBUF_FUL);
while (inb(K_STATUS) & K_OBUF_FUL)
(void)inb(K_RDWR);
outb(K_CMD, KC_CMD_WOUT);
while (inb(K_STATUS) & K_IBUF_FUL);
if (on)
outb(K_RDWR, 0xdf);
else
outb(K_RDWR, 0xcd);
while (inb(K_STATUS) & K_IBUF_FUL);
while (inb(K_STATUS) & K_OBUF_FUL)
(void)inb(K_RDWR);
#endif IBM_L40
}
/* printf - only handles %d as decimal, %c as char, %s as string */
void
printf(format, data)
const char *format;
int data;
{
int *dataptr = &data;
char c;
while (c = *format++) {
if (c != '%') {
putchar(c);
continue;
}
c = *format++;
if (c == 'd') {
int num = *dataptr++, dig;
char buf[10], *ptr = buf;
if (num < 0) {
num = -num;
putchar('-');
}
do {
dig = num % 10;
*ptr++ = '0' + dig;
} while (num /= 10);
do
putchar(*--ptr);
while (ptr != buf);
} else if (c == 'x') {
unsigned int num = (unsigned int)*dataptr++, dig;
char buf[8], *ptr = buf;
do {
dig = num & 0xf;
*ptr++ = dig > 9 ?
'a' + dig - 10 :
'0' + dig;
} while (num >>= 4);
do
putchar(*--ptr);
while (ptr != buf);
} else if (c == 'c') {
putchar((char)*dataptr++);
} else if (c == 's') {
char *ptr = (char *)*dataptr++;
while (c = *ptr++)
putchar(c);
}
}
}
void
putchar(c)
int c;
{
if (c == '\n')
putc('\r');
putc(c);
}
int
gets(buf)
char *buf;
{
char *ptr = buf;
static char hadchar=0;
#ifdef DOSREAD
/*
* Simulate keyboard input of the command line arguments.
*/
static int first=1;
int hadarg=0;
if (first) {
char *arg = (char *) 0x80;
int argcnt = *arg++;
while (argcnt && *arg==' ') {
arg++;
argcnt--;
}
while (argcnt--) {
if (*arg>='A' && *arg<='Z')
*arg += 'a' - 'A';
putchar(*arg);
*ptr++ = *arg++;
hadarg=1;
}
first=0;
}
#endif
for (;;) {
register int c = getc();
hadchar=1;
#ifdef DOSREAD
if (c == 3 || c== 27 ) {
printf("Exiting\n");
dosexit(0);
printf("Exiting failed\n");
}
#endif
if (c == '\n' || c == '\r') {
putchar('\n');
*ptr = '\0';
return 1;
} else if (c == '\b' || c == '\177') {
if (ptr > buf) {
putchar('\b');
#ifdef DOSREAD
if (hadarg) {
putchar('\n');
*ptr=0;
return 1;
}
#endif
putchar(' ');
putchar('\b');
ptr--;
}
} else {
putchar(c);
*ptr++ = c;
}
}
/* shouldn't ever be reached; we have to return in the loop. */
}
int
strcmp(s1, s2)
const char *s1, *s2;
{
while (*s1 == *s2) {
if (!*s1++)
return 0;
s2++;
}
return 1;
}
void
bcopy(from, to, len)
char *from, *to;
int len;
{
if (from > to)
while (--len >= 0)
*to++ = *from++;
else {
to += len;
from += len;
while (--len >= 0)
*--to = *--from;
}
}
/* Number of milliseconds to sleep during each microsleep */
#define NAPTIME 50
/*
* awaitkey takes a number of seconds to wait for a key to be
* struck. If a key is struck during the period, it returns true, else
* it returns false. It returns (nearly) as soon as the key is
* hit. Note that it does something only slightly smarter than busy waiting.
*/
int
awaitkey(seconds)
int seconds;
{
int i;
/*
* We sleep for brief periods (typically 50 milliseconds, set
* by NAPTIME), polling the input buffer at the end of
* each period.
*/
for (i = ((seconds*1000)/NAPTIME); i > 0; i--) {
/* multiply by 1000 to get microseconds. */
usleep(NAPTIME*1000);
if (ischar())
break;
}
/* If a character was hit, "i" will still be non-zero. */
return (i != 0);
}
void
twiddle()
{
static int pos;
putchar("|/-\\"[pos++ & 3]);
putchar('\b');
}
|