rasops_masks.h revision 1.2 1 1.2 ad /* $NetBSD: rasops_masks.h,v 1.2 1999/05/18 21:51:59 ad Exp $ */
2 1.1 ad
3 1.2 ad /*-
4 1.2 ad * Copyright (c) 1999 The NetBSD Foundation, Inc.
5 1.1 ad * All rights reserved.
6 1.1 ad *
7 1.2 ad * This code is derived from software contributed to The NetBSD Foundation
8 1.2 ad * by Andy Doran.
9 1.2 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.2 ad * 3. All advertising materials mentioning features or use of this software
19 1.2 ad * must display the following acknowledgement:
20 1.2 ad * This product includes software developed by the NetBSD
21 1.2 ad * Foundation, Inc. and its contributors.
22 1.2 ad * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.2 ad * contributors may be used to endorse or promote products derived
24 1.2 ad * from this software without specific prior written permission.
25 1.1 ad *
26 1.2 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.2 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.2 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.2 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.2 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.2 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.2 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.2 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.2 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.2 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.2 ad * POSSIBILITY OF SUCH DAMAGE.
37 1.1 ad */
38 1.1 ad
39 1.1 ad #ifndef _RASOPS_MASKS_H_
40 1.1 ad #define _RASOPS_MASKS_H_ 1
41 1.1 ad
42 1.1 ad #include <sys/types.h>
43 1.1 ad #include <machine/endian.h>
44 1.1 ad
45 1.1 ad /*
46 1.1 ad * Convenience macros. To get around the problem of dealing with properly
47 1.1 ad * ordered bits on little-endian machines, we just convert everything to
48 1.1 ad * big-endian and back again when we're done.
49 1.1 ad *
50 1.1 ad * MBL: move bits left
51 1.1 ad * MBR: move bits right
52 1.1 ad * MBE: make big-endian
53 1.1 ad */
54 1.1 ad #if BYTE_ORDER == BIG_ENDIAN
55 1.1 ad
56 1.1 ad #define MBL(x,y) ((y) > 31 ? 0 : (x) >> (y))
57 1.1 ad #define MBR(x,y) ((y) > 31 ? 0 : (x) << (y))
58 1.1 ad #define MBE(x) (x)
59 1.1 ad
60 1.1 ad #else
61 1.1 ad
62 1.1 ad #define MBL(x,y) ((y) > 31 ? 0 : MBE(MBE(x) << (y)))
63 1.1 ad #define MBR(x,y) ((y) > 31 ? 0 : MBE(MBE(x) >> (y)))
64 1.1 ad #define MBE(x) ( (((x) & 0x000000FFU) << 24) \
65 1.1 ad | (((x) & 0x0000FF00U) << 8) \
66 1.1 ad | (((x) & 0x00FF0000U) >> 8) \
67 1.1 ad | (((x) & 0xFF000000U) >> 24) )
68 1.1 ad #endif
69 1.1 ad
70 1.1 ad /*
71 1.1 ad * Using GETBITS() and PUTBITS() inside a loop mightn't be such a good idea.
72 1.1 ad * There's probably some CSE and strength-reduction that the compiler won't
73 1.1 ad * even think about - really should have a few assumptions/separate cases.
74 1.1 ad */
75 1.1 ad
76 1.1 ad /* Get a number of bits ( <= 32 ) from *sp and store in dw */
77 1.1 ad #define GETBITS(sp, x, w, dw) do { \
78 1.1 ad dw = MBL(*(sp), (x)); \
79 1.1 ad if (((x) + (w)) > 32) \
80 1.1 ad dw |= (MBR((sp)[1], 32 - (x))); \
81 1.1 ad } while(0);
82 1.1 ad
83 1.1 ad /* Put a number of bits ( <= 32 ) from sw to *dp */
84 1.1 ad #define PUTBITS(sw, x, w, dp) do { \
85 1.1 ad int n = (x) + (w) - 32; \
86 1.1 ad \
87 1.1 ad if (n <= 0) { \
88 1.1 ad n = rasops_pmask[x & 31][w & 31]; \
89 1.1 ad *(dp) = (*(dp) & ~n) | (MBR(sw, x) & n); \
90 1.1 ad } else { \
91 1.1 ad *(dp) = (*(dp) & rasops_rmask[x]) | (MBR((sw), x)); \
92 1.1 ad (dp)[1] = ((dp)[1] & rasops_rmask[n]) | \
93 1.1 ad (MBL(sw, 32-(x)) & rasops_lmask[n]); \
94 1.1 ad } \
95 1.1 ad } while(0);
96 1.1 ad
97 1.1 ad /* rasops_masks.c */
98 1.1 ad extern int32_t rasops_lmask[32+1];
99 1.1 ad extern int32_t rasops_rmask[32+1];
100 1.1 ad extern int32_t rasops_pmask[32][32];
101 1.1 ad #ifdef notyet
102 1.1 ad extern int32_t rasops_lbmask[4+1];
103 1.1 ad extern int32_t rasops_rbmask[4+1];
104 1.1 ad #endif
105 1.1 ad
106 1.1 ad #endif /* _RASOPS_MASKS_H_ */
107