iteioctl.h revision 1.12 
1/*	$NetBSD: iteioctl.h,v 1.12 2011/02/08 20:20:08 rmind Exp $	*/
2
3/*
4 * Copyright (c) 1988 University of Utah.
5 * Copyright (c) 1990 The Regents of the University of California.
6 * All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
10 * Science Department.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 *    notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 *    notice, this list of conditions and the following disclaimer in the
19 *    documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 *    may be used to endorse or promote products derived from this software
22 *    without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 *
36 * from: Utah $Hdr: iteioctl.h 1.1 90/07/09$
37 *
38 *	@(#)iteioctl.h	7.2 (Berkeley) 11/4/90
39 */
40
41struct itewinsize {
42	int x;			/* leftedge offset to the right */
43	int y;			/* topedge offset down */
44	u_int width;		/* width of ite display */
45	u_int height;		/* height of ite display */
46	u_int depth;		/* depth of ite display */
47};
48
49struct itebell {
50	u_int volume;		/* volume of bell (0-64) */
51	u_int pitch;		/* pitch of bell (10-2000) */
52	u_int msec;		/* duration of bell */
53};
54#define MAXBVOLUME (63)
55#define MAXBPITCH (2000)
56#define MINBPITCH (10)
57#define MAXBTIME (5000)		/* 5 seconds */
58
59struct iterepeat {
60	int start;		/* number of 100/s before repeat start */
61	int next;		/* number of 100/s before next repeat */
62};
63#define ITEMINREPEAT	5	/* mininum number of 100/s for key repeat */
64
65#define ITEIOCSKMAP	_IOW('Z',0x70, struct kbdmap)
66#define ITEIOCGKMAP	_IOR('Z',0x71, struct kbdmap)
67#define ITEIOCGWINSZ	_IOR('Z',0x72, struct itewinsize)
68#define ITEIOCSWINSZ	_IOW('Z',0x73, struct itewinsize)
69#define ITEIOCDSPWIN	_IO('Z', 0x74)
70#define ITEIOCREMWIN	_IO('Z', 0x75)
71#define ITEIOCGBELL	_IOR('Z', 0x76, struct itebell)
72#define ITEIOCSBELL	_IOW('Z', 0x77, struct itebell)
73#define ITEIOCGREPT	_IOR('Z', 0x78, struct iterepeat)
74#define ITEIOCSREPT	_IOW('Z', 0x79, struct iterepeat)
75
76
77#define ITESWITCH	_IOW('Z',0x69, int)	/* XXX */
78
79