|
|
1.1 root 1: /*
2: * Copyright (c) 1988 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted provided
6: * that: (1) source distributions retain this entire copyright notice and
7: * comment, and (2) distributions including binaries display the following
8: * acknowledgement: ``This product includes software developed by the
9: * University of California, Berkeley and its contributors'' in the
10: * documentation or other materials provided with the distribution and in
11: * all advertising materials mentioning features or use of this software.
12: * Neither the name of the University nor the names of its contributors may
13: * be used to endorse or promote products derived from this software without
14: * specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
16: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
17: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: LAR PURPOSE.
19: *
20: * @(#)defines.h 1.10 (Berkeley) 6/28/90
21: */
22:
23: #define settimer(x) clocks.x = clocks.system++
24:
25: #if !defined(TN3270)
26:
27: #define SetIn3270()
28:
29: #endif /* !defined(TN3270) */
30:
31: #define NETADD(c) { *netoring.supply = c; ring_supplied(&netoring, 1); }
32: #define NET2ADD(c1,c2) { NETADD(c1); NETADD(c2); }
33: #define NETBYTES() (ring_full_count(&netoring))
34: #define NETROOM() (ring_empty_count(&netoring))
35:
36: #define TTYADD(c) if (!(SYNCHing||flushout)) { \
37: *ttyoring.supply = c; \
38: ring_supplied(&ttyoring, 1); \
39: }
40: #define TTYBYTES() (ring_full_count(&ttyoring))
41: #define TTYROOM() (ring_empty_count(&ttyoring))
42:
43: /* Various modes */
44: #define MODE_LOCAL_CHARS(m) ((m)&(MODE_EDIT|MODE_TRAPSIG))
45: #define MODE_LOCAL_ECHO(m) ((m)&MODE_ECHO)
46: #define MODE_COMMAND_LINE(m) ((m)==-1)
47:
48: #define CONTROL(x) ((x)&0x1f) /* CTRL(x) is not portable */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.