diofb_mono.c revision 1.1.2.2
1 1.1.2.2 bouyer /* $NetBSD: diofb_mono.c,v 1.1.2.2 2011/02/08 16:19:21 bouyer Exp $ */ 2 1.1.2.2 bouyer /* $OpenBSD: diofb_mono.c,v 1.3 2006/08/11 18:33:13 miod Exp $ */ 3 1.1.2.2 bouyer 4 1.1.2.2 bouyer /* 5 1.1.2.2 bouyer * Copyright (c) 2005, Miodrag Vallat. 6 1.1.2.2 bouyer * All rights reserved. 7 1.1.2.2 bouyer * 8 1.1.2.2 bouyer * Redistribution and use in source and binary forms, with or without 9 1.1.2.2 bouyer * modification, are permitted provided that the following conditions 10 1.1.2.2 bouyer * are met: 11 1.1.2.2 bouyer * 1. Redistributions of source code must retain the above copyright 12 1.1.2.2 bouyer * notice, this list of conditions and the following disclaimer. 13 1.1.2.2 bouyer * 2. Redistributions in binary form must reproduce the above copyright 14 1.1.2.2 bouyer * notice, this list of conditions and the following disclaimer in the 15 1.1.2.2 bouyer * documentation and/or other materials provided with the distribution. 16 1.1.2.2 bouyer * 17 1.1.2.2 bouyer * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 18 1.1.2.2 bouyer * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 19 1.1.2.2 bouyer * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 20 1.1.2.2 bouyer * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, 21 1.1.2.2 bouyer * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 22 1.1.2.2 bouyer * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 23 1.1.2.2 bouyer * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 1.1.2.2 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 25 1.1.2.2 bouyer * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 26 1.1.2.2 bouyer * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 27 1.1.2.2 bouyer * POSSIBILITY OF SUCH DAMAGE. 28 1.1.2.2 bouyer * 29 1.1.2.2 bouyer */ 30 1.1.2.2 bouyer /*- 31 1.1.2.2 bouyer * Copyright (c) 1996, 1997 The NetBSD Foundation, Inc. 32 1.1.2.2 bouyer * All rights reserved. 33 1.1.2.2 bouyer * 34 1.1.2.2 bouyer * This code is derived from software contributed to The NetBSD Foundation 35 1.1.2.2 bouyer * by Jason R. Thorpe. 36 1.1.2.2 bouyer * 37 1.1.2.2 bouyer * Redistribution and use in source and binary forms, with or without 38 1.1.2.2 bouyer * modification, are permitted provided that the following conditions 39 1.1.2.2 bouyer * are met: 40 1.1.2.2 bouyer * 1. Redistributions of source code must retain the above copyright 41 1.1.2.2 bouyer * notice, this list of conditions and the following disclaimer. 42 1.1.2.2 bouyer * 2. Redistributions in binary form must reproduce the above copyright 43 1.1.2.2 bouyer * notice, this list of conditions and the following disclaimer in the 44 1.1.2.2 bouyer * documentation and/or other materials provided with the distribution. 45 1.1.2.2 bouyer * 46 1.1.2.2 bouyer * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 47 1.1.2.2 bouyer * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 48 1.1.2.2 bouyer * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 49 1.1.2.2 bouyer * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 50 1.1.2.2 bouyer * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 51 1.1.2.2 bouyer * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 52 1.1.2.2 bouyer * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 53 1.1.2.2 bouyer * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 54 1.1.2.2 bouyer * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 55 1.1.2.2 bouyer * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 56 1.1.2.2 bouyer * POSSIBILITY OF SUCH DAMAGE. 57 1.1.2.2 bouyer */ 58 1.1.2.2 bouyer 59 1.1.2.2 bouyer /* 60 1.1.2.2 bouyer * Copyright (c) 1991 University of Utah. 61 1.1.2.2 bouyer * Copyright (c) 1990, 1993 62 1.1.2.2 bouyer * The Regents of the University of California. All rights reserved. 63 1.1.2.2 bouyer * 64 1.1.2.2 bouyer * This code is derived from software contributed to Berkeley by 65 1.1.2.2 bouyer * the Systems Programming Group of the University of Utah Computer 66 1.1.2.2 bouyer * Science Department and Mark Davies of the Department of Computer 67 1.1.2.2 bouyer * Science, Victoria University of Wellington, New Zealand. 68 1.1.2.2 bouyer * 69 1.1.2.2 bouyer * Redistribution and use in source and binary forms, with or without 70 1.1.2.2 bouyer * modification, are permitted provided that the following conditions 71 1.1.2.2 bouyer * are met: 72 1.1.2.2 bouyer * 1. Redistributions of source code must retain the above copyright 73 1.1.2.2 bouyer * notice, this list of conditions and the following disclaimer. 74 1.1.2.2 bouyer * 2. Redistributions in binary form must reproduce the above copyright 75 1.1.2.2 bouyer * notice, this list of conditions and the following disclaimer in the 76 1.1.2.2 bouyer * documentation and/or other materials provided with the distribution. 77 1.1.2.2 bouyer * 3. Neither the name of the University nor the names of its contributors 78 1.1.2.2 bouyer * may be used to endorse or promote products derived from this software 79 1.1.2.2 bouyer * without specific prior written permission. 80 1.1.2.2 bouyer * 81 1.1.2.2 bouyer * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 82 1.1.2.2 bouyer * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 83 1.1.2.2 bouyer * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 84 1.1.2.2 bouyer * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 85 1.1.2.2 bouyer * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 86 1.1.2.2 bouyer * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 87 1.1.2.2 bouyer * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 88 1.1.2.2 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 89 1.1.2.2 bouyer * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 90 1.1.2.2 bouyer * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 91 1.1.2.2 bouyer * SUCH DAMAGE. 92 1.1.2.2 bouyer * 93 1.1.2.2 bouyer * from: Utah $Hdr: grf_hy.c 1.2 93/08/13$ 94 1.1.2.2 bouyer * 95 1.1.2.2 bouyer * @(#)grf_hy.c 8.4 (Berkeley) 1/12/94 96 1.1.2.2 bouyer */ 97 1.1.2.2 bouyer 98 1.1.2.2 bouyer /* 99 1.1.2.2 bouyer * Graphics routines for real 1bpp frame buffers (i.e. pixels not being 100 1.1.2.2 bouyer * byte-addressed) 101 1.1.2.2 bouyer */ 102 1.1.2.2 bouyer 103 1.1.2.2 bouyer #include <sys/param.h> 104 1.1.2.2 bouyer #include <sys/systm.h> 105 1.1.2.2 bouyer #include <sys/bus.h> 106 1.1.2.2 bouyer 107 1.1.2.2 bouyer #include <dev/wscons/wsconsio.h> 108 1.1.2.2 bouyer #include <dev/wscons/wsdisplayvar.h> 109 1.1.2.2 bouyer #include <dev/rasops/rasops.h> 110 1.1.2.2 bouyer 111 1.1.2.2 bouyer #include <hp300/dev/diofbreg.h> 112 1.1.2.2 bouyer #include <hp300/dev/diofbvar.h> 113 1.1.2.2 bouyer 114 1.1.2.2 bouyer #include <dev/rasops/rasops_masks.h> 115 1.1.2.2 bouyer #include <hp300/dev/maskbits.h> 116 1.1.2.2 bouyer 117 1.1.2.2 bouyer int 118 1.1.2.2 bouyer diofb_mono_windowmove(struct diofb *fb, u_int16_t sx, u_int16_t sy, 119 1.1.2.2 bouyer u_int16_t dx, u_int16_t dy, u_int16_t cx, u_int16_t cy, int16_t rop, 120 1.1.2.2 bouyer int16_t planemask /* ignored */) 121 1.1.2.2 bouyer { 122 1.1.2.2 bouyer int width; /* add to get to same position in next line */ 123 1.1.2.2 bouyer 124 1.1.2.2 bouyer unsigned int *psrcLine, *pdstLine; 125 1.1.2.2 bouyer /* pointers to line with current src and dst */ 126 1.1.2.2 bouyer unsigned int *psrc; /* pointer to current src longword */ 127 1.1.2.2 bouyer unsigned int *pdst; /* pointer to current dst longword */ 128 1.1.2.2 bouyer 129 1.1.2.2 bouyer /* following used for looping through a line */ 130 1.1.2.2 bouyer unsigned int startmask, endmask; /* masks for writing ends of dst */ 131 1.1.2.2 bouyer int nlMiddle; /* whole longwords in dst */ 132 1.1.2.2 bouyer int nl; /* temp copy of nlMiddle */ 133 1.1.2.2 bouyer int xoffSrc; /* offset (>= 0, < 32) from which to 134 1.1.2.2 bouyer fetch whole longwords fetched in src */ 135 1.1.2.2 bouyer int nstart; /* number of ragged bits at start of dst */ 136 1.1.2.2 bouyer int nend; /* number of ragged bits at end of dst */ 137 1.1.2.2 bouyer int srcStartOver; /* pulling nstart bits from src 138 1.1.2.2 bouyer overflows into the next word? */ 139 1.1.2.2 bouyer 140 1.1.2.2 bouyer width = fb->fbwidth >> 5; 141 1.1.2.2 bouyer 142 1.1.2.2 bouyer if (sy < dy) { /* start at last scanline of rectangle */ 143 1.1.2.2 bouyer psrcLine = ((u_int *)fb->fbkva) + ((sy + cy - 1) * width); 144 1.1.2.2 bouyer pdstLine = ((u_int *)fb->fbkva) + ((dy + cy - 1) * width); 145 1.1.2.2 bouyer width = -width; 146 1.1.2.2 bouyer } else { /* start at first scanline */ 147 1.1.2.2 bouyer psrcLine = ((u_int *)fb->fbkva) + (sy * width); 148 1.1.2.2 bouyer pdstLine = ((u_int *)fb->fbkva) + (dy * width); 149 1.1.2.2 bouyer } 150 1.1.2.2 bouyer 151 1.1.2.2 bouyer /* x direction doesn't matter for < 1 longword */ 152 1.1.2.2 bouyer if (cx <= 32) { 153 1.1.2.2 bouyer int srcBit, dstBit; /* bit offset of src and dst */ 154 1.1.2.2 bouyer 155 1.1.2.2 bouyer pdstLine += (dx >> 5); 156 1.1.2.2 bouyer psrcLine += (sx >> 5); 157 1.1.2.2 bouyer psrc = psrcLine; 158 1.1.2.2 bouyer pdst = pdstLine; 159 1.1.2.2 bouyer 160 1.1.2.2 bouyer srcBit = sx & 0x1f; 161 1.1.2.2 bouyer dstBit = dx & 0x1f; 162 1.1.2.2 bouyer 163 1.1.2.2 bouyer while (cy--) { 164 1.1.2.2 bouyer getandputrop(psrc, srcBit, dstBit, cx, pdst, rop); 165 1.1.2.2 bouyer pdst += width; 166 1.1.2.2 bouyer psrc += width; 167 1.1.2.2 bouyer } 168 1.1.2.2 bouyer } else { 169 1.1.2.2 bouyer maskbits(dx, cx, startmask, endmask, nlMiddle); 170 1.1.2.2 bouyer if (startmask) 171 1.1.2.2 bouyer nstart = 32 - (dx & 0x1f); 172 1.1.2.2 bouyer else 173 1.1.2.2 bouyer nstart = 0; 174 1.1.2.2 bouyer if (endmask) 175 1.1.2.2 bouyer nend = (dx + cx) & 0x1f; 176 1.1.2.2 bouyer else 177 1.1.2.2 bouyer nend = 0; 178 1.1.2.2 bouyer 179 1.1.2.2 bouyer xoffSrc = ((sx & 0x1f) + nstart) & 0x1f; 180 1.1.2.2 bouyer srcStartOver = ((sx & 0x1f) + nstart) > 31; 181 1.1.2.2 bouyer 182 1.1.2.2 bouyer if (sx >= dx) { /* move left to right */ 183 1.1.2.2 bouyer pdstLine += (dx >> 5); 184 1.1.2.2 bouyer psrcLine += (sx >> 5); 185 1.1.2.2 bouyer 186 1.1.2.2 bouyer while (cy--) { 187 1.1.2.2 bouyer psrc = psrcLine; 188 1.1.2.2 bouyer pdst = pdstLine; 189 1.1.2.2 bouyer 190 1.1.2.2 bouyer if (startmask) { 191 1.1.2.2 bouyer getandputrop(psrc, (sx & 0x1f), 192 1.1.2.2 bouyer (dx & 0x1f), nstart, pdst, rop); 193 1.1.2.2 bouyer pdst++; 194 1.1.2.2 bouyer if (srcStartOver) 195 1.1.2.2 bouyer psrc++; 196 1.1.2.2 bouyer } 197 1.1.2.2 bouyer 198 1.1.2.2 bouyer /* special case for aligned operations */ 199 1.1.2.2 bouyer if (xoffSrc == 0) { 200 1.1.2.2 bouyer nl = nlMiddle; 201 1.1.2.2 bouyer while (nl--) { 202 1.1.2.2 bouyer if (rop == RR_CLEAR) 203 1.1.2.2 bouyer *pdst = 0; 204 1.1.2.2 bouyer else 205 1.1.2.2 bouyer *pdst = *psrc; 206 1.1.2.2 bouyer psrc++; 207 1.1.2.2 bouyer pdst++; 208 1.1.2.2 bouyer } 209 1.1.2.2 bouyer } else { 210 1.1.2.2 bouyer nl = nlMiddle + 1; 211 1.1.2.2 bouyer while (--nl) { 212 1.1.2.2 bouyer if (rop == RR_CLEAR) 213 1.1.2.2 bouyer *pdst = 0; 214 1.1.2.2 bouyer else 215 1.1.2.2 bouyer getunalignedword(psrc, 216 1.1.2.2 bouyer xoffSrc, *pdst); 217 1.1.2.2 bouyer pdst++; 218 1.1.2.2 bouyer psrc++; 219 1.1.2.2 bouyer } 220 1.1.2.2 bouyer } 221 1.1.2.2 bouyer 222 1.1.2.2 bouyer if (endmask) { 223 1.1.2.2 bouyer getandputrop(psrc, xoffSrc, 0, nend, 224 1.1.2.2 bouyer pdst, rop); 225 1.1.2.2 bouyer } 226 1.1.2.2 bouyer 227 1.1.2.2 bouyer pdstLine += width; 228 1.1.2.2 bouyer psrcLine += width; 229 1.1.2.2 bouyer } 230 1.1.2.2 bouyer } else { /* move right to left */ 231 1.1.2.2 bouyer pdstLine += ((dx + cx) >> 5); 232 1.1.2.2 bouyer psrcLine += ((sx + cx) >> 5); 233 1.1.2.2 bouyer /* 234 1.1.2.2 bouyer * If fetch of last partial bits from source crosses 235 1.1.2.2 bouyer * a longword boundary, start at the previous longword 236 1.1.2.2 bouyer */ 237 1.1.2.2 bouyer if (xoffSrc + nend >= 32) 238 1.1.2.2 bouyer --psrcLine; 239 1.1.2.2 bouyer 240 1.1.2.2 bouyer while (cy--) { 241 1.1.2.2 bouyer psrc = psrcLine; 242 1.1.2.2 bouyer pdst = pdstLine; 243 1.1.2.2 bouyer 244 1.1.2.2 bouyer if (endmask) { 245 1.1.2.2 bouyer getandputrop(psrc, xoffSrc, 0, nend, 246 1.1.2.2 bouyer pdst, rop); 247 1.1.2.2 bouyer } 248 1.1.2.2 bouyer 249 1.1.2.2 bouyer nl = nlMiddle + 1; 250 1.1.2.2 bouyer while (--nl) { 251 1.1.2.2 bouyer --psrc; 252 1.1.2.2 bouyer --pdst; 253 1.1.2.2 bouyer if (rop == RR_CLEAR) 254 1.1.2.2 bouyer *pdst = 0; 255 1.1.2.2 bouyer else 256 1.1.2.2 bouyer getunalignedword(psrc, xoffSrc, 257 1.1.2.2 bouyer *pdst); 258 1.1.2.2 bouyer } 259 1.1.2.2 bouyer 260 1.1.2.2 bouyer if (startmask) { 261 1.1.2.2 bouyer if (srcStartOver) 262 1.1.2.2 bouyer --psrc; 263 1.1.2.2 bouyer --pdst; 264 1.1.2.2 bouyer getandputrop(psrc, (sx & 0x1f), 265 1.1.2.2 bouyer (dx & 0x1f), nstart, pdst, rop); 266 1.1.2.2 bouyer } 267 1.1.2.2 bouyer 268 1.1.2.2 bouyer pdstLine += width; 269 1.1.2.2 bouyer psrcLine += width; 270 1.1.2.2 bouyer } 271 1.1.2.2 bouyer } 272 1.1.2.2 bouyer } 273 1.1.2.2 bouyer 274 1.1.2.2 bouyer return (0); 275 1.1.2.2 bouyer } 276
Indexes created Sun Oct 19 02:09:48 GMT 2025