|
|
1.1 root 1: /*-
2: * Copyright (c) 1982, 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: * @(#)qvioctl.h 7.1 (Berkeley) 5/9/91
34: */
35:
36: /*
37: * derived from: @(#)qvioctl.h 1.7 (ULTRIX) 6/11/85
38: */
39: /*
40: * Ioctl definitions for the qvss.
41: */
42: #ifdef KERNEL
43: #include "sys/ioctl.h"
44: #include "qvreg.h"
45: #include "qevent.h"
46: #else
47: #include <sys/ioctl.h>
48: #include <vax/uba/qvreg.h>
49: #include <vax/uba/qevent.h>
50: #endif
51:
52: struct qv_kpcmd {
53: char nbytes; /* number of bytes in parameter */
54: unsigned char cmd; /* command to be sent, peripheral bit will */
55: /* be forced by driver */
56: unsigned char par[2]; /* bytes of parameters to be sent */
57: };
58: /*
59: * qvss information block
60: */
61:
62: struct qv_info {
63: short mswitches; /* current value of mouse buttons */
64: vsCursor tablet; /* current tablet position */
65: short tswitches; /* current tablet buttons NI! */
66: vsCursor cursor; /* current cursor position */
67: short row; /* screen row */
68: short col; /* screen col */
69: short max_row; /* max character row */
70: short max_col; /* max character col */
71: short max_x; /* max x position */
72: short max_y; /* max y position */
73: short max_cur_x; /* max cursor y position */
74: short max_cur_y; /* max cursor y position */
75: char *bitmap; /* bit map position */
76: short *scanmap; /* scanline map position */
77: short *cursorbits; /* cursor bit position */
78: struct qvdevice *qvaddr; /* virtual address of the csr */
79: vsEvent *ibuff; /* pointer to event queue */
80: int iqsize; /* may assume power of two */
81: int ihead; /* atomic write */
82: int itail; /* atomic read */
83: vsCursor mouse; /* atomic read/write */
84: vsBox mbox; /* atomic read/write */
85: short mthreshold; /* mouse motion parameter */
86: short mscale; /* mouse scale factor (if
87: negative, then do square). */
88: };
89: typedef struct qv_info vsIoAddr;
90:
91: #define QIOCGINFO _IOR('q', 1, struct qv_info) /* get the info */
92: #define QIOCSMSTATE _IOW('q', 2, vsCursor) /* set mouse pos */
93: #define QIOCINIT _IO('q', 4) /* init screen */
94: #define QIOCKPCMD _IOW('q', 5, struct qv_kpcmd) /* keybd. per. cmd */
95: #define QIOCADDR _IOR('q', 6, struct qv_info *) /* get address */
96:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.