1 /* $NetBSD: ite_subr.c,v 1.3 2003/11/14 16:52:40 tsutsui Exp $ */ 2 3 /* 4 * Copyright (c) 1990, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * the Systems Programming Group of the University of Utah Computer 9 * Science Department. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * from: Utah $Hdr: ite_subr.c 1.2 92/01/20$ 36 * 37 * @(#)ite_subr.c 8.1 (Berkeley) 6/10/93 38 */ 39 /* 40 * Copyright (c) 1988 University of Utah. 41 * 42 * This code is derived from software contributed to Berkeley by 43 * the Systems Programming Group of the University of Utah Computer 44 * Science Department. 45 * 46 * Redistribution and use in source and binary forms, with or without 47 * modification, are permitted provided that the following conditions 48 * are met: 49 * 1. Redistributions of source code must retain the above copyright 50 * notice, this list of conditions and the following disclaimer. 51 * 2. Redistributions in binary form must reproduce the above copyright 52 * notice, this list of conditions and the following disclaimer in the 53 * documentation and/or other materials provided with the distribution. 54 * 3. All advertising materials mentioning features or use of this software 55 * must display the following acknowledgement: 56 * This product includes software developed by the University of 57 * California, Berkeley and its contributors. 58 * 4. Neither the name of the University nor the names of its contributors 59 * may be used to endorse or promote products derived from this software 60 * without specific prior written permission. 61 * 62 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 63 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 64 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 65 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 66 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 67 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 68 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 69 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 70 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 71 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 72 * SUCH DAMAGE. 73 * 74 * from: Utah $Hdr: ite_subr.c 1.2 92/01/20$ 75 * 76 * @(#)ite_subr.c 8.1 (Berkeley) 6/10/93 77 */ 78 79 #ifdef ITECONSOLE 80 81 #include <sys/param.h> 82 83 #include <hp300/dev/itereg.h> 84 85 #include <hp300/stand/common/samachdep.h> 86 #include <hp300/stand/common/itevar.h> 87 88 void 89 ite_fontinfo(ip) 90 struct ite_data *ip; 91 { 92 u_long fontaddr = getword(ip, getword(ip, FONTROM) + FONTADDR); 93 94 ip->ftheight = getbyte(ip, fontaddr + FONTHEIGHT); 95 ip->ftwidth = getbyte(ip, fontaddr + FONTWIDTH); 96 ip->rows = ip->dheight / ip->ftheight; 97 ip->cols = ip->dwidth / ip->ftwidth; 98 99 if (ip->fbwidth > ip->dwidth) { 100 /* 101 * Stuff goes to right of display. 102 */ 103 ip->fontx = ip->dwidth; 104 ip->fonty = 0; 105 ip->cpl = (ip->fbwidth - ip->dwidth) / ip->ftwidth; 106 ip->cblankx = ip->dwidth; 107 ip->cblanky = ip->fonty + ((128 / ip->cpl) +1) * ip->ftheight; 108 } 109 else { 110 /* 111 * Stuff goes below the display. 112 */ 113 ip->fontx = 0; 114 ip->fonty = ip->dheight; 115 ip->cpl = ip->fbwidth / ip->ftwidth; 116 ip->cblankx = 0; 117 ip->cblanky = ip->fonty + ((128 / ip->cpl) + 1) * ip->ftheight; 118 } 119 } 120 121 void 122 ite_fontinit(ip) 123 struct ite_data *ip; 124 { 125 int bytewidth = (((ip->ftwidth - 1) / 8) + 1); 126 int glyphsize = bytewidth * ip->ftheight; 127 u_char fontbuf[500]; 128 u_char *dp, *fbmem; 129 int c, i, romp; 130 131 romp = getword(ip, getword(ip, FONTROM) + FONTADDR) + FONTDATA; 132 for (c = 0; c < 128; c++) { 133 fbmem = (u_char *) 134 (FBBASE + 135 (ip->fonty + (c / ip->cpl) * ip->ftheight) * ip->fbwidth + 136 (ip->fontx + (c % ip->cpl) * ip->ftwidth)); 137 dp = fontbuf; 138 for (i = 0; i < glyphsize; i++) { 139 *dp++ = getbyte(ip, romp); 140 romp += 2; 141 } 142 writeglyph(ip, fbmem, fontbuf); 143 } 144 } 145 146 /* 147 * Display independent versions of the readbyte and writeglyph routines. 148 */ 149 u_char 150 ite_readbyte(ip, disp) 151 struct ite_data *ip; 152 int disp; 153 { 154 155 return (u_char)*(((u_char *)ip->regbase) + disp); 156 } 157 158 void 159 ite_writeglyph(ip, fbmem, glyphp) 160 struct ite_data *ip; 161 u_char *fbmem, *glyphp; 162 { 163 int bn; 164 int l, b; 165 166 for (l = 0; l < ip->ftheight; l++) { 167 bn = 7; 168 for (b = 0; b < ip->ftwidth; b++) { 169 if ((1 << bn) & *glyphp) 170 *fbmem++ = 1; 171 else 172 *fbmem++ = 0; 173 if (--bn < 0) { 174 bn = 7; 175 glyphp++; 176 } 177 } 178 if (bn < 7) 179 glyphp++; 180 fbmem -= ip->ftwidth; 181 fbmem += ip->fbwidth; 182 } 183 } 184 #endif 185