xref: /netbsd/sys/arch/sun3/dev/bt_subr.c (revision bf9ec67e)
1 /*	$NetBSD: bt_subr.c,v 1.4 2001/09/19 18:10:34 thorpej Exp $ */
2 
3 /*
4  * Copyright (c) 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This software was developed by the Computer Systems Engineering group
8  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9  * contributed to Berkeley.
10  *
11  * All advertising materials mentioning features or use of this software
12  * must display the following acknowledgement:
13  *	This product includes software developed by the University of
14  *	California, Lawrence Berkeley Laboratory.
15  *
16  * Redistribution and use in source and binary forms, with or without
17  * modification, are permitted provided that the following conditions
18  * are met:
19  * 1. Redistributions of source code must retain the above copyright
20  *    notice, this list of conditions and the following disclaimer.
21  * 2. Redistributions in binary form must reproduce the above copyright
22  *    notice, this list of conditions and the following disclaimer in the
23  *    documentation and/or other materials provided with the distribution.
24  * 3. All advertising materials mentioning features or use of this software
25  *    must display the following acknowledgement:
26  *	This product includes software developed by the University of
27  *	California, Berkeley and its contributors.
28  * 4. Neither the name of the University nor the names of its contributors
29  *    may be used to endorse or promote products derived from this software
30  *    without specific prior written permission.
31  *
32  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
33  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
34  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
36  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
40  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
41  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42  * SUCH DAMAGE.
43  *
44  *	@(#)bt_subr.c	8.2 (Berkeley) 1/21/94
45  */
46 
47 #include <sys/param.h>
48 #include <sys/buf.h>
49 #include <sys/errno.h>
50 
51 #include <dev/sun/fbio.h>
52 
53 #include "btreg.h"
54 #include "btvar.h"
55 
56 /*
57  * Common code for dealing with Brooktree video DACs.
58  * (Contains some software-only code as well, since the colormap
59  * ioctls are shared between the cgthree and cgsix drivers.)
60  */
61 
62 /*
63  * Implement an FBIOGETCMAP-like ioctl.
64  */
65 int
66 bt_getcmap(p, cm, cmsize)
67 	struct fbcmap *p;
68 	union bt_cmap *cm;
69 	int cmsize;
70 {
71 	u_int i, start, count;
72 	u_char *cp;
73 
74 	start = p->index;
75 	count = p->count;
76 	if (start >= cmsize || start + count > cmsize)
77 		return (EINVAL);
78 	if (!useracc(p->red, count, B_WRITE) ||
79 	    !useracc(p->green, count, B_WRITE) ||
80 	    !useracc(p->blue, count, B_WRITE))
81 		return (EFAULT);
82 	for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
83 		p->red[i] = cp[0];
84 		p->green[i] = cp[1];
85 		p->blue[i] = cp[2];
86 	}
87 	return (0);
88 }
89 
90 /*
91  * Implement the software portion of an FBIOPUTCMAP-like ioctl.
92  */
93 int
94 bt_putcmap(p, cm, cmsize)
95 	struct fbcmap *p;
96 	union bt_cmap *cm;
97 	int cmsize;
98 {
99 	u_int i, start, count;
100 	u_char *cp;
101 
102 	start = p->index;
103 	count = p->count;
104 	if (start >= cmsize || start + count > cmsize)
105 		return (EINVAL);
106 	if (!useracc(p->red, count, B_READ) ||
107 	    !useracc(p->green, count, B_READ) ||
108 	    !useracc(p->blue, count, B_READ))
109 		return (EFAULT);
110 	for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
111 		cp[0] = p->red[i];
112 		cp[1] = p->green[i];
113 		cp[2] = p->blue[i];
114 	}
115 	return (0);
116 }
117