sys/arch/sun3/dev/bt_subr.c

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