|
|
1.1 root 1: /*-
2: * Copyright (c) 1985, 1986 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
8: * 1. Redistributions of source code must retain the above copyright
9: * notice, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
33: * @(#)tablet.h 7.5 (Berkeley) 2/15/91
34: */
35:
36: #ifndef _TABLET_H_
37: #define _TABLET_H_
38:
39: /*
40: * Tablet line discipline.
41: */
42: /*
43: * Reads on the tablet return one of the following structures, depending on
44: * the underlying tablet type. The first two are defined such that a read of
45: * sizeof (gtcopos) on a non-gtco tablet will return meaningful info. The
46: * in-proximity bit is simulated where the tablet does not directly provide
47: * the information.
48: */
49: struct tbpos {
50: int xpos, ypos; /* raw x-y coordinates */
51: short status; /* buttons/pen down */
52: #define TBINPROX 0100000 /* pen in proximity of tablet */
53: short scount; /* sample count */
54: };
55:
56: struct gtcopos {
57: int xpos, ypos; /* raw x-y coordinates */
58: short status; /* as above */
59: short scount; /* sample count */
60: short xtilt, ytilt; /* raw tilt */
61: short pressure;
62: short pad; /* pad to longword boundary */
63: };
64:
65: struct polpos {
66: short p_x, p_y, p_z; /* raw 3-space coordinates */
67: short p_azi, p_pit, p_rol; /* azimuth, pitch, and roll */
68: short p_stat; /* status, as above */
69: char p_key; /* calculator input keyboard */
70: };
71:
72: #define BIOSMODE _IOW('b', 1, int) /* set mode bit(s) */
73: #define BIOGMODE _IOR('b', 2, int) /* get mode bit(s) */
74: #define TBMODE 0xfff0 /* mode bits: */
75: #define TBPOINT 0x0010 /* single point */
76: #define TBRUN 0x0000 /* runs contin. */
77: #define TBSTOP 0x0020 /* shut-up */
78: #define TBGO 0x0000 /* ~TBSTOP */
79: #define TBTYPE 0x000f /* tablet type: */
80: #define TBUNUSED 0x0
81: #define TBHITACHI 0x1 /* hitachi tablet */
82: #define TBTIGER 0x2 /* hitachi tiger */
83: #define TBGTCO 0x3 /* gtco */
84: #define TBPOL 0x4 /* polhemus 3space */
85: #define TBHDG 0x5 /* hdg-1111b, low res */
86: #define TBHDGHIRES 0x6 /* hdg-1111b, high res */
87: #define TBDIGI 0x7 /* gtco digi-pad, low res */
88: #define TBDIGIHIRES 0x8 /* gtco digi-pad, high res */
89: #define BIOSTYPE _IOW('b', 3, int) /* set tablet type */
90: #define BIOGTYPE _IOR('b', 4, int) /* get tablet type*/
91:
92: #endif /* !_TABLET_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.