bt_subr.c revision 1.6 1 /* $NetBSD: bt_subr.c,v 1.6 2003/07/15 03:36:13 lukem 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/cdefs.h>
48 __KERNEL_RCSID(0, "$NetBSD: bt_subr.c,v 1.6 2003/07/15 03:36:13 lukem Exp $");
49
50 #include <sys/param.h>
51 #include <sys/buf.h>
52 #include <sys/errno.h>
53
54 #include <dev/sun/fbio.h>
55
56 #include "btreg.h"
57 #include "btvar.h"
58
59 /*
60 * Common code for dealing with Brooktree video DACs.
61 * (Contains some software-only code as well, since the colormap
62 * ioctls are shared between the cgthree and cgsix drivers.)
63 */
64
65 /*
66 * Implement an FBIOGETCMAP-like ioctl.
67 */
68 int
69 bt_getcmap(p, cm, cmsize)
70 struct fbcmap *p;
71 union bt_cmap *cm;
72 int cmsize;
73 {
74 u_int i, start, count;
75 u_char *cp;
76
77 start = p->index;
78 count = p->count;
79 if (start >= cmsize || count > cmsize - start)
80 return (EINVAL);
81 if (!useracc(p->red, count, B_WRITE) ||
82 !useracc(p->green, count, B_WRITE) ||
83 !useracc(p->blue, count, B_WRITE))
84 return (EFAULT);
85 for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
86 p->red[i] = cp[0];
87 p->green[i] = cp[1];
88 p->blue[i] = cp[2];
89 }
90 return (0);
91 }
92
93 /*
94 * Implement the software portion of an FBIOPUTCMAP-like ioctl.
95 */
96 int
97 bt_putcmap(p, cm, cmsize)
98 struct fbcmap *p;
99 union bt_cmap *cm;
100 int cmsize;
101 {
102 u_int i, start, count;
103 u_char *cp;
104
105 start = p->index;
106 count = p->count;
107 if (start >= cmsize || count > cmsize - start)
108 return (EINVAL);
109 if (!useracc(p->red, count, B_READ) ||
110 !useracc(p->green, count, B_READ) ||
111 !useracc(p->blue, count, B_READ))
112 return (EFAULT);
113 for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
114 cp[0] = p->red[i];
115 cp[1] = p->green[i];
116 cp[2] = p->blue[i];
117 }
118 return (0);
119 }
120