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