rasops_bitops.h revision 1.5 1 1.5 ad /* $NetBSD: rasops_bitops.h,v 1.5 1999/10/23 23:14:14 ad Exp $ */
2 1.1 ad
3 1.3 ad /*-
4 1.3 ad * Copyright (c) 1999 The NetBSD Foundation, Inc.
5 1.1 ad * All rights reserved.
6 1.1 ad *
7 1.3 ad * This code is derived from software contributed to The NetBSD Foundation
8 1.3 ad * by Andy Doran.
9 1.3 ad *
10 1.1 ad * Redistribution and use in source and binary forms, with or without
11 1.1 ad * modification, are permitted provided that the following conditions
12 1.1 ad * are met:
13 1.1 ad * 1. Redistributions of source code must retain the above copyright
14 1.1 ad * notice, this list of conditions and the following disclaimer.
15 1.1 ad * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 ad * notice, this list of conditions and the following disclaimer in the
17 1.1 ad * documentation and/or other materials provided with the distribution.
18 1.3 ad * 3. All advertising materials mentioning features or use of this software
19 1.3 ad * must display the following acknowledgement:
20 1.3 ad * This product includes software developed by the NetBSD
21 1.3 ad * Foundation, Inc. and its contributors.
22 1.3 ad * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.3 ad * contributors may be used to endorse or promote products derived
24 1.3 ad * from this software without specific prior written permission.
25 1.1 ad *
26 1.3 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.3 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.3 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.3 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.3 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.3 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.3 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.3 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.3 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.3 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.3 ad * POSSIBILITY OF SUCH DAMAGE.
37 1.1 ad */
38 1.1 ad
39 1.1 ad #ifndef _RASOPS_BITOPS_H_
40 1.1 ad #define _RASOPS_BITOPS_H_ 1
41 1.1 ad
42 1.1 ad /*
43 1.1 ad * Erase columns.
44 1.1 ad */
45 1.1 ad static void
46 1.1 ad NAME(erasecols)(cookie, row, col, num, attr)
47 1.1 ad void *cookie;
48 1.1 ad int row, col, num;
49 1.1 ad long attr;
50 1.1 ad {
51 1.5 ad int lmask, rmask, lclr, rclr, clr;
52 1.1 ad struct rasops_info *ri;
53 1.5 ad int32_t *dp, *rp;
54 1.1 ad int height, cnt;
55 1.1 ad
56 1.1 ad ri = (struct rasops_info *)cookie;
57 1.1 ad
58 1.1 ad #ifdef RASOPS_CLIPPING
59 1.1 ad if ((unsigned)row >= (unsigned)ri->ri_rows)
60 1.1 ad return;
61 1.1 ad
62 1.1 ad if (col < 0) {
63 1.1 ad num += col;
64 1.1 ad col = 0;
65 1.1 ad }
66 1.1 ad
67 1.1 ad if ((col + num) > ri->ri_cols)
68 1.1 ad num = ri->ri_cols - col;
69 1.1 ad
70 1.1 ad if (num <= 0)
71 1.1 ad return;
72 1.1 ad #endif
73 1.1 ad col *= ri->ri_font->fontwidth << PIXEL_SHIFT;
74 1.1 ad num *= ri->ri_font->fontwidth << PIXEL_SHIFT;
75 1.1 ad height = ri->ri_font->fontheight;
76 1.1 ad clr = ri->ri_devcmap[(attr >> 16) & 15];
77 1.1 ad rp = (int32_t *)(ri->ri_bits + row*ri->ri_yscale + ((col >> 3) & ~3));
78 1.1 ad
79 1.1 ad if ((col & 31) + num <= 32) {
80 1.1 ad lmask = ~rasops_pmask[col & 31][num];
81 1.1 ad lclr = clr & ~lmask;
82 1.1 ad
83 1.1 ad while (height--) {
84 1.1 ad dp = rp;
85 1.1 ad DELTA(rp, ri->ri_stride, int32_t *);
86 1.1 ad
87 1.1 ad *dp = (*dp & lmask) | lclr;
88 1.1 ad }
89 1.1 ad } else {
90 1.1 ad lmask = rasops_rmask[col & 31];
91 1.1 ad rmask = rasops_lmask[(col + num) & 31];
92 1.1 ad
93 1.1 ad if (lmask)
94 1.1 ad num = (num - (32 - (col & 31))) >> 5;
95 1.1 ad else
96 1.1 ad num = num >> 5;
97 1.1 ad
98 1.1 ad lclr = clr & ~lmask;
99 1.1 ad rclr = clr & ~rmask;
100 1.1 ad
101 1.1 ad while (height--) {
102 1.1 ad dp = rp;
103 1.1 ad DELTA(rp, ri->ri_stride, int32_t *);
104 1.1 ad
105 1.1 ad if (lmask)
106 1.1 ad *dp++ = (*dp & lmask) | lclr;
107 1.1 ad
108 1.1 ad for (cnt = num; cnt > 0; cnt--)
109 1.1 ad *dp++ = clr;
110 1.1 ad
111 1.1 ad if (rmask)
112 1.1 ad *dp = (*dp & rmask) | rclr;
113 1.1 ad }
114 1.1 ad }
115 1.1 ad }
116 1.1 ad
117 1.1 ad /*
118 1.1 ad * Actually paint the cursor.
119 1.1 ad */
120 1.1 ad static void
121 1.1 ad NAME(do_cursor)(ri)
122 1.1 ad struct rasops_info *ri;
123 1.1 ad {
124 1.5 ad int lmask, rmask, height, row, col, num;
125 1.5 ad int32_t *dp, *rp;
126 1.1 ad
127 1.1 ad row = ri->ri_crow;
128 1.1 ad col = ri->ri_ccol * ri->ri_font->fontwidth << PIXEL_SHIFT;
129 1.1 ad height = ri->ri_font->fontheight;
130 1.1 ad num = ri->ri_font->fontwidth << PIXEL_SHIFT;
131 1.1 ad rp = (int32_t *)(ri->ri_bits + row * ri->ri_yscale + ((col >> 3) & ~3));
132 1.1 ad
133 1.1 ad if ((col & 31) + num <= 32) {
134 1.1 ad lmask = rasops_pmask[col & 31][num];
135 1.1 ad
136 1.1 ad while (height--) {
137 1.1 ad dp = rp;
138 1.1 ad DELTA(rp, ri->ri_stride, int32_t *);
139 1.1 ad *dp ^= lmask;
140 1.1 ad }
141 1.1 ad } else {
142 1.1 ad lmask = ~rasops_rmask[col & 31];
143 1.1 ad rmask = ~rasops_lmask[(col + num) & 31];
144 1.1 ad
145 1.1 ad while (height--) {
146 1.1 ad dp = rp;
147 1.1 ad DELTA(rp, ri->ri_stride, int32_t *);
148 1.1 ad
149 1.1 ad if (lmask != -1)
150 1.1 ad *dp++ ^= lmask;
151 1.1 ad
152 1.1 ad if (rmask != -1)
153 1.1 ad *dp ^= rmask;
154 1.1 ad }
155 1.1 ad }
156 1.1 ad }
157 1.1 ad
158 1.1 ad /*
159 1.4 ad * Copy columns. Ick!
160 1.1 ad */
161 1.1 ad static void
162 1.1 ad NAME(copycols)(cookie, row, src, dst, num)
163 1.1 ad void *cookie;
164 1.1 ad int row, src, dst, num;
165 1.1 ad {
166 1.5 ad int tmp, lmask, rmask, height, lnum, rnum, sb, db, cnt, full;
167 1.5 ad int32_t *sp, *dp, *srp, *drp;
168 1.1 ad struct rasops_info *ri;
169 1.1 ad
170 1.1 ad ri = (struct rasops_info *)cookie;
171 1.1 ad
172 1.1 ad #ifdef RASOPS_CLIPPING
173 1.1 ad if (dst == src)
174 1.1 ad return;
175 1.1 ad
176 1.1 ad /* Catches < 0 case too */
177 1.1 ad if ((unsigned)row >= (unsigned)ri->ri_rows)
178 1.1 ad return;
179 1.1 ad
180 1.1 ad if (src < 0) {
181 1.1 ad num += src;
182 1.1 ad src = 0;
183 1.1 ad }
184 1.1 ad
185 1.1 ad if ((src + num) > ri->ri_cols)
186 1.1 ad num = ri->ri_cols - src;
187 1.1 ad
188 1.1 ad if (dst < 0) {
189 1.1 ad num += dst;
190 1.1 ad dst = 0;
191 1.1 ad }
192 1.1 ad
193 1.1 ad if ((dst + num) > ri->ri_cols)
194 1.1 ad num = ri->ri_cols - dst;
195 1.1 ad
196 1.1 ad if (num <= 0)
197 1.1 ad return;
198 1.1 ad #endif
199 1.2 ad
200 1.1 ad cnt = ri->ri_font->fontwidth << PIXEL_SHIFT;
201 1.1 ad src *= cnt;
202 1.1 ad dst *= cnt;
203 1.1 ad num *= cnt;
204 1.1 ad row *= ri->ri_yscale;
205 1.1 ad height = ri->ri_font->fontheight;
206 1.4 ad db = dst & 31;
207 1.1 ad
208 1.1 ad if (db + num <= 32) {
209 1.4 ad /* Destination is contained within a single word */
210 1.1 ad srp = (int32_t *)(ri->ri_bits + row + ((src >> 3) & ~3));
211 1.1 ad drp = (int32_t *)(ri->ri_bits + row + ((dst >> 3) & ~3));
212 1.1 ad sb = src & 31;
213 1.1 ad
214 1.1 ad while (height--) {
215 1.1 ad GETBITS(srp, sb, num, tmp);
216 1.1 ad PUTBITS(tmp, db, num, drp);
217 1.1 ad DELTA(srp, ri->ri_stride, int32_t *);
218 1.1 ad DELTA(drp, ri->ri_stride, int32_t *);
219 1.1 ad }
220 1.1 ad
221 1.1 ad return;
222 1.1 ad }
223 1.1 ad
224 1.4 ad lmask = rasops_rmask[db];
225 1.1 ad rmask = rasops_lmask[(dst + num) & 31];
226 1.4 ad lnum = (32 - db) & 31;
227 1.4 ad rnum = (dst + num) & 31;
228 1.1 ad
229 1.1 ad if (lmask)
230 1.1 ad full = (num - (32 - (dst & 31))) >> 5;
231 1.1 ad else
232 1.1 ad full = num >> 5;
233 1.1 ad
234 1.4 ad if (src < dst && src + num > dst) {
235 1.4 ad /* Copy right-to-left */
236 1.4 ad sb = src & 31;
237 1.1 ad src = src + num;
238 1.1 ad dst = dst + num;
239 1.1 ad srp = (int32_t *)(ri->ri_bits + row + ((src >> 3) & ~3));
240 1.1 ad drp = (int32_t *)(ri->ri_bits + row + ((dst >> 3) & ~3));
241 1.1 ad
242 1.1 ad src = src & 31;
243 1.4 ad rnum = 32 - lnum;
244 1.1 ad db = dst & 31;
245 1.4 ad
246 1.4 ad if ((src -= db) < 0) {
247 1.4 ad sp--;
248 1.4 ad src += 32;
249 1.4 ad }
250 1.4 ad
251 1.1 ad while (height--) {
252 1.1 ad sp = srp;
253 1.1 ad dp = drp;
254 1.1 ad DELTA(srp, ri->ri_stride, int32_t *);
255 1.1 ad DELTA(drp, ri->ri_stride, int32_t *);
256 1.1 ad
257 1.1 ad if (db) {
258 1.4 ad GETBITS(sp, src, db, tmp);
259 1.4 ad PUTBITS(tmp, 0, db, dp);
260 1.1 ad dp--;
261 1.4 ad sp--;
262 1.1 ad }
263 1.1 ad
264 1.4 ad /* Now aligned to 32-bits wrt dp */
265 1.1 ad for (cnt = full; cnt; cnt--, sp--) {
266 1.4 ad GETBITS(sp, src, 32, tmp);
267 1.1 ad *dp-- = tmp;
268 1.1 ad }
269 1.1 ad
270 1.1 ad if (lmask) {
271 1.5 ad #if 0
272 1.5 ad if (src > sb)
273 1.5 ad sp++;
274 1.5 ad #endif
275 1.4 ad GETBITS(sp, sb, lnum, tmp);
276 1.4 ad PUTBITS(tmp, rnum, lnum, dp);
277 1.1 ad }
278 1.1 ad }
279 1.1 ad } else {
280 1.4 ad /* Copy left-to-right */
281 1.1 ad srp = (int32_t *)(ri->ri_bits + row + ((src >> 3) & ~3));
282 1.1 ad drp = (int32_t *)(ri->ri_bits + row + ((dst >> 3) & ~3));
283 1.1 ad db = dst & 31;
284 1.1 ad
285 1.1 ad while (height--) {
286 1.1 ad sb = src & 31;
287 1.1 ad sp = srp;
288 1.1 ad dp = drp;
289 1.1 ad DELTA(srp, ri->ri_stride, int32_t *);
290 1.1 ad DELTA(drp, ri->ri_stride, int32_t *);
291 1.1 ad
292 1.1 ad if (lmask) {
293 1.1 ad GETBITS(sp, sb, lnum, tmp);
294 1.1 ad PUTBITS(tmp, db, lnum, dp);
295 1.1 ad dp++;
296 1.1 ad
297 1.1 ad if ((sb += lnum) > 31) {
298 1.1 ad sp++;
299 1.1 ad sb -= 32;
300 1.1 ad }
301 1.1 ad }
302 1.1 ad
303 1.4 ad /* Now aligned to 32-bits wrt dp */
304 1.4 ad for (cnt = full; cnt; cnt--, sp++) {
305 1.1 ad GETBITS(sp, sb, 32, tmp);
306 1.1 ad *dp++ = tmp;
307 1.1 ad }
308 1.1 ad
309 1.1 ad if (rmask) {
310 1.1 ad GETBITS(sp, sb, rnum, tmp);
311 1.1 ad PUTBITS(tmp, 0, rnum, dp);
312 1.1 ad }
313 1.1 ad }
314 1.1 ad }
315 1.1 ad }
316 1.5 ad
317 1.1 ad #endif /* _RASOPS_BITOPS_H_ */
318