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