1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/* $OpenBSD: rasops_masks.h,v 1.5 2014/12/19 22:44:59 guenther Exp $ */
/* $NetBSD: rasops_masks.h,v 1.5 2000/06/13 13:37:01 ad Exp $ */
/*-
* Copyright (c) 1999 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Andrew Doran.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef _RASOPS_MASKS_H_
#define _RASOPS_MASKS_H_ 1
#include <sys/types.h>
#include <sys/endian.h>
/*
* Convenience macros. To get around the problem of dealing with properly
* ordered bits on little-endian machines, we just convert everything to
* big-endian and back again when we're done.
*
* MBL: move bits left
* MBR: move bits right
* MBE: make big-endian
*/
#define MBL(x,y) ((y) > 31 ? 0 : (x) >> (y))
#define MBR(x,y) ((y) > 31 ? 0 : (x) << (y))
#if BYTE_ORDER == BIG_ENDIAN
#define MBE(x) (x)
#else
#define MBE(x) \
({ \
u_int32_t tmp = (x); \
tmp = ((tmp >> 1) & 0x55555555) | ((tmp << 1) & 0xaaaaaaaa); \
tmp = ((tmp >> 2) & 0x33333333) | ((tmp << 2) & 0xcccccccc); \
tmp = ((tmp >> 4) & 0x0f0f0f0f) | ((tmp << 4) & 0xf0f0f0f0); \
tmp = ((tmp >> 8) & 0x00ff00ff) | ((tmp << 8) & 0xff00ff00); \
tmp = ((tmp >> 16) & 0x0000ffff) | ((tmp << 16) & 0xffff0000); \
tmp; \
})
#endif
/*
* Using GETBITS() and PUTBITS() inside a loop mightn't be such a good idea.
* There's probably some CSE and strength-reduction that the compiler won't
* even think about - really should have a few assumptions/separate cases.
*/
/* Get a number of bits ( <= 32 ) from *sp and store in dw */
#define GETBITS(sp, x, w, dw) do { \
dw = MBL(*(sp), (x)); \
if (((x) + (w)) > 32) \
dw |= (MBR((sp)[1], 32 - (x))); \
} while(0);
/* Put a number of bits ( <= 32 ) from sw to *dp */
#define PUTBITS(sw, x, w, dp) do { \
int n = (x) + (w) - 32; \
\
if (n <= 0) { \
n = rasops_pmask[x & 31][w & 31]; \
*(dp) = (*(dp) & ~n) | (MBR(sw, x) & n); \
} else { \
*(dp) = (*(dp) & rasops_rmask[x]) | (MBR((sw), x)); \
(dp)[1] = ((dp)[1] & rasops_rmask[n]) | \
(MBL(sw, 32-(x)) & rasops_lmask[n]); \
} \
} while(0);
/* rasops_masks.c */
#if BYTE_ORDER == BIG_ENDIAN
extern const int32_t rasops_lmask[32+1];
extern const int32_t rasops_rmask[32+1];
extern const int32_t rasops_pmask[32][32];
#define rasops_masks_init() do { } while (0)
#else
extern int32_t rasops_lmask[32+1];
extern int32_t rasops_rmask[32+1];
extern int32_t rasops_pmask[32][32];
void rasops_masks_init(void);
#endif
#endif /* _RASOPS_MASKS_H_ */
|
