NetBSD/sys/arch/pmax/dev/bt478.c

304 lines
7.3 KiB
C
Raw Normal View History

/* $NetBSD: bt478.c,v 1.15 2000/01/10 03:24:31 simonb Exp $ */
1995-09-11 12:11:20 +04:00
/*-
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Ralph Campbell and Rick Macklem.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)bt478.c 8.1 (Berkeley) 6/10/93
*/
/*
1995-09-11 12:11:20 +04:00
* devGraphics.c --
*
* This file contains machine-dependent routines for the graphics device.
*
* Copyright (C) 1989 Digital Equipment Corporation.
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appears in all copies.
1995-09-11 12:11:20 +04:00
* Digital Equipment Corporation makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
*
* from: Header: /sprite/src/kernel/dev/ds3100.md/RCS/devGraphics.c,
* v 9.2 90/02/13 22:16:24 shirriff Exp SPRITE (DECWRL)";
*/
#include <sys/param.h>
#include <sys/systm.h>
1995-09-11 12:11:20 +04:00
#include <sys/device.h>
#include <machine/bus.h> /* wbflush() */
1995-09-11 12:11:20 +04:00
#include <machine/fbio.h>
#include <machine/fbvar.h>
#include <pmax/dev/bt478.h> /* chipset definitions */
#include <pmax/dev/bt478var.h>
1995-09-11 12:11:20 +04:00
#include <pmax/pmax/kn01.h>
1995-09-11 12:11:20 +04:00
/*
* Forward references.
*/
1995-09-11 12:11:20 +04:00
static u_char bg_RGB[3]; /* background color for the cursor */
static u_char fg_RGB[3]; /* foreground color for the cursor */
/* Initialize the VDAC. */
int
bt478init(fi)
struct fbinfo *fi;
{
VDACRegs *vdac = (VDACRegs *)(fi -> fi_vdac);
1995-09-11 12:11:20 +04:00
/*
*
* Initialize the VDAC
*/
vdac->overWA = 0x04; wbflush();
vdac->over = 0x00; wbflush();
vdac->over = 0x00; wbflush();
vdac->over = 0x00; wbflush();
vdac->overWA = 0x08; wbflush();
vdac->over = 0x00; wbflush();
vdac->over = 0x00; wbflush();
vdac->over = 0x7f; wbflush();
vdac->overWA = 0x0c; wbflush();
vdac->over = 0xff; wbflush();
vdac->over = 0xff; wbflush();
vdac->over = 0xff; wbflush();
1995-09-11 12:11:20 +04:00
/* Initialize the cursor position... */
fi -> fi_cursor.width = 16;
fi -> fi_cursor.height = 16;
fi -> fi_cursor.x = 0;
fi -> fi_cursor.y = 0;
/*
* Initialize the color map and the screen.
*/
bt478InitColorMap(fi);
return (1);
}
/* restore the color of the cursor. */
void
bt478RestoreCursorColor(fi)
struct fbinfo *fi;
{
VDACRegs *vdac = (VDACRegs *)(fi -> fi_vdac);
int i;
1995-09-11 12:11:20 +04:00
vdac->overWA = 0x04;
wbflush();
for (i = 0; i < 3; i++) {
1995-09-11 12:11:20 +04:00
vdac->over = bg_RGB[i];
wbflush();
1995-09-11 12:11:20 +04:00
}
vdac->overWA = 0x08;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->over = 0x00;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->over = 0x00;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->over = 0x7f;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->overWA = 0x0c;
wbflush();
1995-09-11 12:11:20 +04:00
for (i = 0; i < 3; i++) {
vdac->over = fg_RGB[i];
wbflush();
1995-09-11 12:11:20 +04:00
}
}
/* Set the color of the cursor. */
void
bt478CursorColor (fi, color)
struct fbinfo *fi;
unsigned int color[];
{
int i, j;
1995-09-11 12:11:20 +04:00
for (i = 0; i < 3; i++)
bg_RGB[i] = (u_char)(color[i] >> 8);
for (i = 3, j = 0; i < 6; i++, j++)
fg_RGB[j] = (u_char)(color[i] >> 8);
bt478RestoreCursorColor (fi);
}
/* Set the cursor foreground color to zero (used by pm.c
for screen blanking). */
void
bt478BlankCursor(fi)
struct fbinfo *fi;
{
VDACRegs *vdac = (VDACRegs *)(fi -> fi_vdac);
int i;
1995-09-11 12:11:20 +04:00
vdac->overWA = 0x0c;
wbflush();
1995-09-11 12:11:20 +04:00
for (i = 0; i < 3; i++) {
vdac->over = 0;
wbflush();
1995-09-11 12:11:20 +04:00
}
}
/* Initialize the color map. */
/*static*/
void
bt478InitColorMap (fi)
struct fbinfo *fi;
{
VDACRegs *vdac = (VDACRegs *)(fi -> fi_vdac);
int i;
1995-09-11 12:11:20 +04:00
*(volatile char *)MIPS_PHYS_TO_KSEG1
1995-09-11 12:11:20 +04:00
(KN01_PHYS_COLMASK_START) = 0xff; /* XXX */
wbflush();
1995-09-11 12:11:20 +04:00
if (fi -> fi_type.fb_depth == 1) {
vdac->mapWA = 0; wbflush();
1995-09-11 12:11:20 +04:00
for (i = 0; i < 256; i++) {
((u_char *)(fi -> fi_cmap_bits)) [i * 3] = 0;
1995-09-11 12:11:20 +04:00
((u_char *)(fi -> fi_cmap_bits)) [i * 3 + 1]
= (i < 128) ? 0x00 : 0xff;
((u_char *)(fi -> fi_cmap_bits)) [i * 3 + 2] = 0;
vdac->map = 0;
wbflush();
vdac->map = (i < 128) ? 0x00 : 0xff;
wbflush();
vdac->map = 0;
wbflush();
1995-09-11 12:11:20 +04:00
}
} else {
vdac->mapWA = 0; wbflush();
1995-09-11 12:11:20 +04:00
((u_char *)(fi -> fi_cmap_bits)) [0] = 0;
((u_char *)(fi -> fi_cmap_bits)) [1] = 0;
((u_char *)(fi -> fi_cmap_bits)) [2] = 0;
vdac->map = 0;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->map = 0;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->map = 0;
wbflush();
1995-09-11 12:11:20 +04:00
for (i = 1; i < 256; i++) {
((u_char *)(fi -> fi_cmap_bits)) [i * 3] = 0xff;
((u_char *)(fi -> fi_cmap_bits)) [i * 3 + 1] = 0xff;
((u_char *)(fi -> fi_cmap_bits)) [i * 3 + 2] = 0xff;
vdac->map = 0xff;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->map = 0xff;
wbflush();
1995-09-11 12:11:20 +04:00
vdac->map = 0xff;
wbflush();
1995-09-11 12:11:20 +04:00
}
}
for (i = 0; i < 3; i++) {
bg_RGB[i] = 0x00;
fg_RGB[i] = 0xff;
}
bt478RestoreCursorColor(fi);
1995-09-11 12:11:20 +04:00
}
/* Load the color map. */
int
bt478LoadColorMap(fi, bits, index, count)
struct fbinfo *fi;
const u_char *bits;
1995-09-11 12:11:20 +04:00
int index, count;
{
VDACRegs *vdac = (VDACRegs *)(fi -> fi_vdac);
1995-09-11 12:11:20 +04:00
u_char *cmap_bits;
u_char *cmap;
int i;
if (index < 0 || count < 1 || index + count > 256)
1995-09-11 12:11:20 +04:00
return EINVAL;
cmap_bits = (u_char *)bits;
cmap = (u_char *)(fi -> fi_cmap_bits) + index * 3;
for (i = 0; i < count; i++) {
vdac->mapWA = i + index; wbflush();
cmap [i * 3] = cmap_bits [i * 3];
vdac->map = cmap_bits [i * 3];
wbflush();
cmap [i * 3 + 1] = cmap_bits [i * 3 + 1];
vdac->map = cmap_bits [i * 3 + 1];
wbflush();
cmap [i * 3 + 2] = cmap_bits [i * 3 + 2];
vdac -> map = cmap_bits [i * 3 + 2];
wbflush();
1995-09-11 12:11:20 +04:00
}
return 0;
}
/* Copy out count entries of the colormap starting at index into bits. */
int
bt478GetColorMap(fi, bits, index, count)
struct fbinfo *fi;
u_char *bits;
1995-09-11 12:11:20 +04:00
int index, count;
{
u_char *cmap_bits;
u_char *cmap;
if (index > 256 || index < 0 || index + count > 256)
return EINVAL;
cmap_bits = (u_char *)bits;
cmap = (u_char *)(fi -> fi_cmap_bits) + index * 3;
bcopy (cmap, cmap_bits, count * 3);
return 0;
}