Home | History | Annotate | Line # | Download | only in sun
bt_subr.c revision 1.11
      1 /*	$NetBSD: bt_subr.c,v 1.11 2009/03/14 21:04:23 dsl 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. Neither the name of the University nor the names of its contributors
     25  *    may be used to endorse or promote products derived from this software
     26  *    without specific prior written permission.
     27  *
     28  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     29  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     30  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     31  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     32  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     33  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     34  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     35  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     36  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     37  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     38  * SUCH DAMAGE.
     39  *
     40  *	@(#)bt_subr.c	8.2 (Berkeley) 1/21/94
     41  */
     42 
     43 #include <sys/cdefs.h>
     44 __KERNEL_RCSID(0, "$NetBSD: bt_subr.c,v 1.11 2009/03/14 21:04:23 dsl Exp $");
     45 
     46 #include <sys/param.h>
     47 #include <sys/systm.h>
     48 #include <sys/buf.h>
     49 #include <sys/errno.h>
     50 #include <sys/malloc.h>
     51 
     52 #include <uvm/uvm_extern.h>
     53 
     54 #include <dev/sun/fbio.h>
     55 
     56 #include <dev/sun/btreg.h>
     57 #include <dev/sun/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(struct fbcmap *p, union bt_cmap *cm, int cmsize, int uspace)
     70 {
     71 	u_int i, start, count;
     72 	int error = 0;
     73 	u_char *cp, *r, *g, *b;
     74 	u_char *cbuf = NULL;
     75 
     76 	start = p->index;
     77 	count = p->count;
     78 	if (start >= cmsize || count > cmsize - start)
     79 		return (EINVAL);
     80 
     81 	if (uspace) {
     82 		/* Allocate temporary buffer for color values */
     83 		cbuf = malloc(3 * count * sizeof(char), M_TEMP, M_WAITOK);
     84 		r = cbuf;
     85 		g = r + count;
     86 		b = g + count;
     87 	} else {
     88 		/* Direct access in kernel space */
     89 		r = p->red;
     90 		g = p->green;
     91 		b = p->blue;
     92 	}
     93 
     94 	/* Copy colors from BT map to fbcmap */
     95 	for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
     96 		r[i] = cp[0];
     97 		g[i] = cp[1];
     98 		b[i] = cp[2];
     99 	}
    100 
    101 	if (uspace) {
    102 		error = copyout(r, p->red, count);
    103 		if (error)
    104 			goto out;
    105 		error = copyout(g, p->green, count);
    106 		if (error)
    107 			goto out;
    108 		error = copyout(b, p->blue, count);
    109 		if (error)
    110 			goto out;
    111 	}
    112 
    113 out:
    114 	if (cbuf != NULL)
    115 		free(cbuf, M_TEMP);
    116 
    117 	return (error);
    118 }
    119 
    120 /*
    121  * Implement the software portion of an FBIOPUTCMAP-like ioctl.
    122  */
    123 int
    124 bt_putcmap(struct fbcmap *p, union bt_cmap *cm, int cmsize, int uspace)
    125 {
    126 	u_int i, start, count;
    127 	int error = 0;
    128 	u_char *cp, *r, *g, *b;
    129 	u_char *cbuf = NULL;
    130 
    131 	start = p->index;
    132 	count = p->count;
    133 	if (start >= cmsize || count > cmsize - start)
    134 		return (EINVAL);
    135 
    136 	if (uspace) {
    137 		/* Allocate temporary buffer for color values */
    138 		cbuf = malloc(3 * count * sizeof(char), M_TEMP, M_WAITOK);
    139 		r = cbuf;
    140 		g = r + count;
    141 		b = g + count;
    142 		error = copyin(p->red, r, count);
    143 		if (error)
    144 			goto out;
    145 		error = copyin(p->green, g, count);
    146 		if (error)
    147 			goto out;
    148 		error = copyin(p->blue, b, count);
    149 		if (error)
    150 			goto out;
    151 	} else {
    152 		/* Direct access in kernel space */
    153 		r = p->red;
    154 		g = p->green;
    155 		b = p->blue;
    156 	}
    157 
    158 	/* Copy colors from fbcmap to BT map */
    159 	for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
    160 		cp[0] = r[i];
    161 		cp[1] = g[i];
    162 		cp[2] = b[i];
    163 	}
    164 
    165 out:
    166 	if (cbuf != NULL)
    167 		free(cbuf, M_TEMP);
    168 
    169 	return (error);
    170 }
    171 
    172 /*
    173  * Initialize the color map to the default state:
    174  *
    175  *	- 0 is white			(PROM uses entry 0 for background)
    176  *	- all other entries are black	(PROM uses entry 255 for foreground)
    177  */
    178 void
    179 bt_initcmap(union bt_cmap *cm, int cmsize)
    180 {
    181 	int i;
    182 	u_char *cp;
    183 
    184 	cp = &cm->cm_map[0][0];
    185 	cp[0] = cp[1] = cp[2] = 0xff;
    186 
    187 	for (i = 1, cp = &cm->cm_map[i][0]; i < cmsize; cp += 3, i++)
    188 		cp[0] = cp[1] = cp[2] = 0;
    189 
    190 #ifdef RASTERCONSOLE
    191 	if (cmsize > 16) {
    192 		/*
    193 		 * Setup an ANSI map at offset 1, for rasops;
    194 		 * see dev/fb.c for usage (XXX - this should
    195 		 * be replaced by more general colormap handling)
    196 		 */
    197 		extern u_char rasops_cmap[];
    198 		bcopy(rasops_cmap, &cm->cm_map[1][0], 3*16);
    199 	}
    200 #endif
    201 }
    202 
    203 #if notyet
    204 static void
    205 bt_loadcmap_packed256(struct fbdevice *fb, volatile struct bt_regs *bt, int start, int ncolors)
    206 {
    207 	u_int v;
    208 	int count, i;
    209 	u_char *c[3], **p;
    210 	struct cmap *cm = &fb->fb_cmap;
    211 
    212 	count = BT_D4M3(start + ncolors - 1) - BT_D4M3(start) + 3;
    213 	bt = &sc->sc_fbc->fbc_dac;
    214 	bt->bt_addr = BT_D4M4(start);
    215 
    216 	/*
    217 	 * Figure out where to start in the RGB arrays
    218 	 * See btreg.h for the way RGB triplets are packed into 4-byte words.
    219 	 */
    220 	c[0] = &cm->red[(4 * count) / 3)];
    221 	c[1] = &cm->green[(4 * count) / 3];
    222 	c[2] = &cm->blue[(4 * count) / 3];
    223 	p = &c[0];
    224 	i = (4 * count) % 3;	/* This much of the last triplet is already in
    225 				   the last packed word */
    226 	while (i--) {
    227 		c[1-i]++;
    228 		p++;
    229 	}
    230 
    231 
    232 	while (--count >= 0) {
    233 		u_int v = 0;
    234 
    235 		/*
    236 		 * Retrieve four colormap entries, pack them into
    237 		 * a 32-bit word and write to the hardware register.
    238 		 */
    239 		for (i = 0; i < 4; i++) {
    240 			u_char *cp = *p;
    241 			v |= *cp++ << (8 * i);
    242 			*p = cp;
    243 			if (p++ == &c[2])
    244 				/* Wrap around */
    245 				p = &c[0];
    246 		}
    247 
    248 		bt->bt_cmap = v;
    249 	}
    250 }
    251 #endif
    252