1 | /*
|
---|
2 | * Copyright (c) 2006 Ondrej Palkovsky
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup generic
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /** @file
|
---|
33 | */
|
---|
34 |
|
---|
35 | #ifndef LIBC_BITOPS_H_
|
---|
36 | #define LIBC_BITOPS_H_
|
---|
37 |
|
---|
38 | #include <sys/types.h>
|
---|
39 |
|
---|
40 | /** Mask with bit @a n set. */
|
---|
41 | #define BIT_V(type, n) \
|
---|
42 | ((type) 1 << (n))
|
---|
43 |
|
---|
44 | /** Mask with rightmost @a n bits set. */
|
---|
45 | #define BIT_RRANGE(type, n) \
|
---|
46 | (BIT_V(type, (n)) - 1)
|
---|
47 |
|
---|
48 | /** Mask with bits @a hi .. @a lo set. @a hi >= @a lo. */
|
---|
49 | #define BIT_RANGE(type, hi, lo) \
|
---|
50 | (BIT_RRANGE(type, (hi) - (lo) + 1) << (lo))
|
---|
51 |
|
---|
52 | /** Extract range of bits @a hi .. @a lo from @a value. */
|
---|
53 | #define BIT_RANGE_EXTRACT(type, hi, lo, value) \
|
---|
54 | (((value) >> (lo)) & BIT_RRANGE(type, (hi) - (lo) + 1))
|
---|
55 |
|
---|
56 | /** Return position of first non-zero bit from left (i.e. [log_2(arg)]).
|
---|
57 | *
|
---|
58 | * If number is zero, it returns 0
|
---|
59 | */
|
---|
60 | static inline unsigned int fnzb32(uint32_t arg)
|
---|
61 | {
|
---|
62 | unsigned int n = 0;
|
---|
63 |
|
---|
64 | if (arg >> 16) {
|
---|
65 | arg >>= 16;
|
---|
66 | n += 16;
|
---|
67 | }
|
---|
68 |
|
---|
69 | if (arg >> 8) {
|
---|
70 | arg >>= 8;
|
---|
71 | n += 8;
|
---|
72 | }
|
---|
73 |
|
---|
74 | if (arg >> 4) {
|
---|
75 | arg >>= 4;
|
---|
76 | n += 4;
|
---|
77 | }
|
---|
78 |
|
---|
79 | if (arg >> 2) {
|
---|
80 | arg >>= 2;
|
---|
81 | n += 2;
|
---|
82 | }
|
---|
83 |
|
---|
84 | if (arg >> 1) {
|
---|
85 | arg >>= 1;
|
---|
86 | n += 1;
|
---|
87 | }
|
---|
88 |
|
---|
89 | return n;
|
---|
90 | }
|
---|
91 |
|
---|
92 | static inline unsigned int fnzb64(uint64_t arg)
|
---|
93 | {
|
---|
94 | unsigned int n = 0;
|
---|
95 |
|
---|
96 | if (arg >> 32) {
|
---|
97 | arg >>= 32;
|
---|
98 | n += 32;
|
---|
99 | }
|
---|
100 |
|
---|
101 | return (n + fnzb32((uint32_t) arg));
|
---|
102 | }
|
---|
103 |
|
---|
104 | static inline unsigned int fnzb(size_t arg)
|
---|
105 | {
|
---|
106 | return fnzb64(arg);
|
---|
107 | }
|
---|
108 |
|
---|
109 | #endif
|
---|
110 |
|
---|
111 | /** @}
|
---|
112 | */
|
---|