Home | History | Annotate | Line # | Download | only in sun
bt_subr.c revision 1.5
      1  1.5     agc /*	$NetBSD: bt_subr.c,v 1.5 2003/08/07 16:31:22 agc Exp $ */
      2  1.1      pk 
      3  1.1      pk /*
      4  1.1      pk  * Copyright (c) 1993
      5  1.1      pk  *	The Regents of the University of California.  All rights reserved.
      6  1.1      pk  *
      7  1.1      pk  * This software was developed by the Computer Systems Engineering group
      8  1.1      pk  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
      9  1.1      pk  * contributed to Berkeley.
     10  1.1      pk  *
     11  1.1      pk  * All advertising materials mentioning features or use of this software
     12  1.1      pk  * must display the following acknowledgement:
     13  1.1      pk  *	This product includes software developed by the University of
     14  1.1      pk  *	California, Lawrence Berkeley Laboratory.
     15  1.1      pk  *
     16  1.1      pk  * Redistribution and use in source and binary forms, with or without
     17  1.1      pk  * modification, are permitted provided that the following conditions
     18  1.1      pk  * are met:
     19  1.1      pk  * 1. Redistributions of source code must retain the above copyright
     20  1.1      pk  *    notice, this list of conditions and the following disclaimer.
     21  1.1      pk  * 2. Redistributions in binary form must reproduce the above copyright
     22  1.1      pk  *    notice, this list of conditions and the following disclaimer in the
     23  1.1      pk  *    documentation and/or other materials provided with the distribution.
     24  1.5     agc  * 3. Neither the name of the University nor the names of its contributors
     25  1.1      pk  *    may be used to endorse or promote products derived from this software
     26  1.1      pk  *    without specific prior written permission.
     27  1.1      pk  *
     28  1.1      pk  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     29  1.1      pk  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     30  1.1      pk  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     31  1.1      pk  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     32  1.1      pk  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     33  1.1      pk  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     34  1.1      pk  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     35  1.1      pk  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     36  1.1      pk  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     37  1.1      pk  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     38  1.1      pk  * SUCH DAMAGE.
     39  1.1      pk  *
     40  1.1      pk  *	@(#)bt_subr.c	8.2 (Berkeley) 1/21/94
     41  1.1      pk  */
     42  1.2   lukem 
     43  1.2   lukem #include <sys/cdefs.h>
     44  1.5     agc __KERNEL_RCSID(0, "$NetBSD: bt_subr.c,v 1.5 2003/08/07 16:31:22 agc Exp $");
     45  1.1      pk 
     46  1.1      pk #include <sys/param.h>
     47  1.1      pk #include <sys/systm.h>
     48  1.1      pk #include <sys/buf.h>
     49  1.1      pk #include <sys/errno.h>
     50  1.1      pk #include <sys/malloc.h>
     51  1.1      pk 
     52  1.1      pk #include <uvm/uvm_extern.h>
     53  1.1      pk 
     54  1.1      pk #include <dev/sun/fbio.h>
     55  1.1      pk 
     56  1.1      pk #include <dev/sun/btreg.h>
     57  1.1      pk #include <dev/sun/btvar.h>
     58  1.1      pk 
     59  1.1      pk /*
     60  1.1      pk  * Common code for dealing with Brooktree video DACs.
     61  1.1      pk  * (Contains some software-only code as well, since the colormap
     62  1.1      pk  * ioctls are shared between the cgthree and cgsix drivers.)
     63  1.1      pk  */
     64  1.1      pk 
     65  1.1      pk /*
     66  1.1      pk  * Implement an FBIOGETCMAP-like ioctl.
     67  1.1      pk  */
     68  1.1      pk int
     69  1.1      pk bt_getcmap(p, cm, cmsize, uspace)
     70  1.1      pk 	struct fbcmap *p;
     71  1.1      pk 	union bt_cmap *cm;
     72  1.1      pk 	int cmsize;
     73  1.1      pk 	int uspace;
     74  1.1      pk {
     75  1.1      pk 	u_int i, start, count;
     76  1.1      pk 	int error = 0;
     77  1.1      pk 	u_char *cp, *r, *g, *b;
     78  1.1      pk 	u_char *cbuf = NULL;
     79  1.1      pk 
     80  1.1      pk 	start = p->index;
     81  1.1      pk 	count = p->count;
     82  1.3  itojun 	if (start >= cmsize || count > cmsize - start)
     83  1.1      pk 		return (EINVAL);
     84  1.1      pk 
     85  1.1      pk 	if (uspace) {
     86  1.1      pk 		/* Check user buffers for appropriate access */
     87  1.1      pk 		if (!uvm_useracc(p->red, count, B_WRITE) ||
     88  1.1      pk 		    !uvm_useracc(p->green, count, B_WRITE) ||
     89  1.1      pk 		    !uvm_useracc(p->blue, count, B_WRITE))
     90  1.1      pk 			return (EFAULT);
     91  1.1      pk 
     92  1.1      pk 		/* Allocate temporary buffer for color values */
     93  1.1      pk 		cbuf = malloc(3*count*sizeof(char), M_TEMP, M_WAITOK);
     94  1.1      pk 		r = cbuf;
     95  1.1      pk 		g = r + count;
     96  1.1      pk 		b = g + count;
     97  1.1      pk 	} else {
     98  1.1      pk 		/* Direct access in kernel space */
     99  1.1      pk 		r = p->red;
    100  1.1      pk 		g = p->green;
    101  1.1      pk 		b = p->blue;
    102  1.1      pk 	}
    103  1.1      pk 
    104  1.1      pk 	/* Copy colors from BT map to fbcmap */
    105  1.1      pk 	for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
    106  1.1      pk 		r[i] = cp[0];
    107  1.1      pk 		g[i] = cp[1];
    108  1.1      pk 		b[i] = cp[2];
    109  1.1      pk 	}
    110  1.1      pk 
    111  1.1      pk 	if (uspace) {
    112  1.1      pk 		error = copyout(r, p->red, count);
    113  1.1      pk 		if (error)
    114  1.1      pk 			goto out;
    115  1.1      pk 		error = copyout(g, p->green, count);
    116  1.1      pk 		if (error)
    117  1.1      pk 			goto out;
    118  1.1      pk 		error = copyout(b, p->blue, count);
    119  1.1      pk 		if (error)
    120  1.1      pk 			goto out;
    121  1.1      pk 	}
    122  1.1      pk 
    123  1.1      pk out:
    124  1.1      pk 	if (cbuf != NULL)
    125  1.1      pk 		free(cbuf, M_TEMP);
    126  1.1      pk 
    127  1.1      pk 	return (error);
    128  1.1      pk }
    129  1.1      pk 
    130  1.1      pk /*
    131  1.1      pk  * Implement the software portion of an FBIOPUTCMAP-like ioctl.
    132  1.1      pk  */
    133  1.1      pk int
    134  1.1      pk bt_putcmap(p, cm, cmsize, uspace)
    135  1.1      pk 	struct fbcmap *p;
    136  1.1      pk 	union bt_cmap *cm;
    137  1.1      pk 	int cmsize;
    138  1.1      pk 	int uspace;
    139  1.1      pk {
    140  1.1      pk 	u_int i, start, count;
    141  1.1      pk 	int error = 0;
    142  1.1      pk 	u_char *cp, *r, *g, *b;
    143  1.1      pk 	u_char *cbuf = NULL;
    144  1.1      pk 
    145  1.1      pk 	start = p->index;
    146  1.1      pk 	count = p->count;
    147  1.4  itojun 	if (start >= cmsize || count > cmsize - start)
    148  1.1      pk 		return (EINVAL);
    149  1.1      pk 
    150  1.1      pk 	if (uspace) {
    151  1.1      pk 		/* Check user buffers for appropriate access */
    152  1.1      pk 		if (!uvm_useracc(p->red, count, B_READ) ||
    153  1.1      pk 		    !uvm_useracc(p->green, count, B_READ) ||
    154  1.1      pk 		    !uvm_useracc(p->blue, count, B_READ))
    155  1.1      pk 			return (EFAULT);
    156  1.1      pk 
    157  1.1      pk 		/* Allocate temporary buffer for color values */
    158  1.1      pk 		cbuf = malloc(3*count*sizeof(char), M_TEMP, M_WAITOK);
    159  1.1      pk 		r = cbuf;
    160  1.1      pk 		g = r + count;
    161  1.1      pk 		b = g + count;
    162  1.1      pk 		error = copyin(p->red, r, count);
    163  1.1      pk 		if (error)
    164  1.1      pk 			goto out;
    165  1.1      pk 		error = copyin(p->green, g, count);
    166  1.1      pk 		if (error)
    167  1.1      pk 			goto out;
    168  1.1      pk 		error = copyin(p->blue, b, count);
    169  1.1      pk 		if (error)
    170  1.1      pk 			goto out;
    171  1.1      pk 	} else {
    172  1.1      pk 		/* Direct access in kernel space */
    173  1.1      pk 		r = p->red;
    174  1.1      pk 		g = p->green;
    175  1.1      pk 		b = p->blue;
    176  1.1      pk 	}
    177  1.1      pk 
    178  1.1      pk 	/* Copy colors from fbcmap to BT map */
    179  1.1      pk 	for (cp = &cm->cm_map[start][0], i = 0; i < count; cp += 3, i++) {
    180  1.1      pk 		cp[0] = r[i];
    181  1.1      pk 		cp[1] = g[i];
    182  1.1      pk 		cp[2] = b[i];
    183  1.1      pk 	}
    184  1.1      pk 
    185  1.1      pk out:
    186  1.1      pk 	if (cbuf != NULL)
    187  1.1      pk 		free(cbuf, M_TEMP);
    188  1.1      pk 
    189  1.1      pk 	return (error);
    190  1.1      pk }
    191  1.1      pk 
    192  1.1      pk /*
    193  1.1      pk  * Initialize the color map to the default state:
    194  1.1      pk  *
    195  1.1      pk  *	- 0 is white			(PROM uses entry 0 for background)
    196  1.1      pk  *	- all other entries are black	(PROM uses entry 255 for foreground)
    197  1.1      pk  */
    198  1.1      pk void
    199  1.1      pk bt_initcmap(cm, cmsize)
    200  1.1      pk 	union bt_cmap *cm;
    201  1.1      pk 	int cmsize;
    202  1.1      pk {
    203  1.1      pk 	int i;
    204  1.1      pk 	u_char *cp;
    205  1.1      pk 
    206  1.1      pk 	cp = &cm->cm_map[0][0];
    207  1.1      pk 	cp[0] = cp[1] = cp[2] = 0xff;
    208  1.1      pk 
    209  1.1      pk 	for (i = 1, cp = &cm->cm_map[i][0]; i < cmsize; cp += 3, i++)
    210  1.1      pk 		cp[0] = cp[1] = cp[2] = 0;
    211  1.1      pk 
    212  1.1      pk #ifdef RASTERCONSOLE
    213  1.1      pk 	if (cmsize > 16) {
    214  1.1      pk 		/*
    215  1.1      pk 		 * Setup an ANSI map at offset 1, for rasops;
    216  1.1      pk 		 * see dev/fb.c for usage (XXX - this should
    217  1.1      pk 		 * be replaced by more general colormap handling)
    218  1.1      pk 		 */
    219  1.1      pk 		extern u_char rasops_cmap[];
    220  1.1      pk 		bcopy(rasops_cmap, &cm->cm_map[1][0], 3*16);
    221  1.1      pk 	}
    222  1.1      pk #endif
    223  1.1      pk }
    224  1.1      pk 
    225  1.1      pk #if notyet
    226  1.1      pk static void
    227  1.1      pk bt_loadcmap_packed256(fb, bt, start, ncolors)
    228  1.1      pk 	struct fbdevice	*fb;
    229  1.1      pk 	volatile struct bt_regs *bt;
    230  1.1      pk 	int start, ncolors;
    231  1.1      pk {
    232  1.1      pk 	u_int v;
    233  1.1      pk 	int count, i;
    234  1.1      pk 	u_char *c[3], **p;
    235  1.1      pk 	struct cmap *cm = &fb->fb_cmap;
    236  1.1      pk 
    237  1.1      pk 	count = BT_D4M3(start + ncolors - 1) - BT_D4M3(start) + 3;
    238  1.1      pk 	bt = &sc->sc_fbc->fbc_dac;
    239  1.1      pk 	bt->bt_addr = BT_D4M4(start);
    240  1.1      pk 
    241  1.1      pk 	/*
    242  1.1      pk 	 * Figure out where to start in the RGB arrays
    243  1.1      pk 	 * See btreg.h for the way RGB triplets are packed into 4-byte words.
    244  1.1      pk 	 */
    245  1.1      pk 	c[0] = &cm->red[(4 * count) / 3)];
    246  1.1      pk 	c[1] = &cm->green[(4 * count) / 3];
    247  1.1      pk 	c[2] = &cm->blue[(4 * count) / 3];
    248  1.1      pk 	p = &c[0];
    249  1.1      pk 	i = (4 * count) % 3;	/* This much of the last triplet is already in
    250  1.1      pk 				   the last packed word */
    251  1.1      pk 	while (i--) {
    252  1.1      pk 		c[1-i]++;
    253  1.1      pk 		p++;
    254  1.1      pk 	}
    255  1.1      pk 
    256  1.1      pk 
    257  1.1      pk 	while (--count >= 0) {
    258  1.1      pk 		u_int v = 0;
    259  1.1      pk 
    260  1.1      pk 		/*
    261  1.1      pk 		 * Retrieve four colormap entries, pack them into
    262  1.1      pk 		 * a 32-bit word and write to the hardware register.
    263  1.1      pk 		 */
    264  1.1      pk 		for (i = 0; i < 4; i++) {
    265  1.1      pk 			u_char *cp = *p;
    266  1.1      pk 			v |= *cp++ << (8 * i);
    267  1.1      pk 			*p = cp;
    268  1.1      pk 			if (p++ == &c[2])
    269  1.1      pk 				/* Wrap around */
    270  1.1      pk 				p = &c[0];
    271  1.1      pk 		}
    272  1.1      pk 
    273  1.1      pk 		bt->bt_cmap = v;
    274  1.1      pk 	}
    275  1.1      pk }
    276  1.1      pk #endif
    277