Print this page
8115 parallel zfs mount
| Split |
Close |
| Expand all |
| Collapse all |
--- old/usr/src/uts/common/sys/bitmap.h
+++ new/usr/src/uts/common/sys/bitmap.h
1 1 /*
2 2 * CDDL HEADER START
3 3 *
4 4 * The contents of this file are subject to the terms of the
5 5 * Common Development and Distribution License (the "License").
6 6 * You may not use this file except in compliance with the License.
7 7 *
8 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 9 * or http://www.opensolaris.org/os/licensing.
10 10 * See the License for the specific language governing permissions
11 11 * and limitations under the License.
12 12 *
13 13 * When distributing Covered Code, include this CDDL HEADER in each
14 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 15 * If applicable, add the following below this CDDL HEADER, with the
16 16 * fields enclosed by brackets "[]" replaced with your own identifying
17 17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 18 *
|
↓ open down ↓ |
18 lines elided |
↑ open up ↑ |
19 19 * CDDL HEADER END
20 20 */
21 21
22 22 /*
23 23 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
24 24 * Use is subject to license terms.
25 25 */
26 26
27 27 /*
28 28 * Copyright (c) 2014 by Delphix. All rights reserved.
29 + * Copyright 2017 RackTop Systems.
29 30 */
30 31
31 32 /* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
32 33 /* All Rights Reserved */
33 34
34 35
35 36 #ifndef _SYS_BITMAP_H
36 37 #define _SYS_BITMAP_H
37 38
38 39 #ifdef __cplusplus
39 40 extern "C" {
40 41 #endif
41 42
42 43 #include <sys/feature_tests.h>
43 44 #if defined(__GNUC__) && defined(_ASM_INLINES) && \
44 45 (defined(__i386) || defined(__amd64))
45 46 #include <asm/bitmap.h>
46 47 #endif
47 48
48 49 /*
49 50 * Operations on bitmaps of arbitrary size
50 51 * A bitmap is a vector of 1 or more ulong_t's.
51 52 * The user of the package is responsible for range checks and keeping
52 53 * track of sizes.
53 54 */
54 55
55 56 #ifdef _LP64
56 57 #define BT_ULSHIFT 6 /* log base 2 of BT_NBIPUL, to extract word index */
57 58 #define BT_ULSHIFT32 5 /* log base 2 of BT_NBIPUL, to extract word index */
58 59 #else
59 60 #define BT_ULSHIFT 5 /* log base 2 of BT_NBIPUL, to extract word index */
60 61 #endif
61 62
62 63 #define BT_NBIPUL (1 << BT_ULSHIFT) /* n bits per ulong_t */
63 64 #define BT_ULMASK (BT_NBIPUL - 1) /* to extract bit index */
64 65
65 66 #ifdef _LP64
66 67 #define BT_NBIPUL32 (1 << BT_ULSHIFT32) /* n bits per ulong_t */
67 68 #define BT_ULMASK32 (BT_NBIPUL32 - 1) /* to extract bit index */
68 69 #define BT_ULMAXMASK 0xffffffffffffffff /* used by bt_getlowbit */
69 70 #else
70 71 #define BT_ULMAXMASK 0xffffffff
71 72 #endif
72 73
73 74 /*
74 75 * bitmap is a ulong_t *, bitindex an index_t
75 76 *
76 77 * The macros BT_WIM and BT_BIW internal; there is no need
77 78 * for users of this package to use them.
78 79 */
79 80
80 81 /*
81 82 * word in map
82 83 */
83 84 #define BT_WIM(bitmap, bitindex) \
84 85 ((bitmap)[(bitindex) >> BT_ULSHIFT])
85 86 /*
86 87 * bit in word
87 88 */
88 89 #define BT_BIW(bitindex) \
89 90 (1UL << ((bitindex) & BT_ULMASK))
90 91
91 92 #ifdef _LP64
92 93 #define BT_WIM32(bitmap, bitindex) \
93 94 ((bitmap)[(bitindex) >> BT_ULSHIFT32])
94 95
95 96 #define BT_BIW32(bitindex) \
96 97 (1UL << ((bitindex) & BT_ULMASK32))
97 98 #endif
98 99
99 100 /*
100 101 * These are public macros
101 102 *
102 103 * BT_BITOUL == n bits to n ulong_t's
103 104 */
104 105 #define BT_BITOUL(nbits) \
105 106 (((nbits) + BT_NBIPUL - 1l) / BT_NBIPUL)
106 107 #define BT_SIZEOFMAP(nbits) \
107 108 (BT_BITOUL(nbits) * sizeof (ulong_t))
108 109 #define BT_TEST(bitmap, bitindex) \
109 110 ((BT_WIM((bitmap), (bitindex)) & BT_BIW(bitindex)) ? 1 : 0)
110 111 #define BT_SET(bitmap, bitindex) \
111 112 { BT_WIM((bitmap), (bitindex)) |= BT_BIW(bitindex); }
112 113 #define BT_CLEAR(bitmap, bitindex) \
113 114 { BT_WIM((bitmap), (bitindex)) &= ~BT_BIW(bitindex); }
114 115
115 116 #ifdef _LP64
116 117 #define BT_BITOUL32(nbits) \
117 118 (((nbits) + BT_NBIPUL32 - 1l) / BT_NBIPUL32)
118 119 #define BT_SIZEOFMAP32(nbits) \
119 120 (BT_BITOUL32(nbits) * sizeof (uint_t))
120 121 #define BT_TEST32(bitmap, bitindex) \
121 122 ((BT_WIM32((bitmap), (bitindex)) & BT_BIW32(bitindex)) ? 1 : 0)
122 123 #define BT_SET32(bitmap, bitindex) \
123 124 { BT_WIM32((bitmap), (bitindex)) |= BT_BIW32(bitindex); }
124 125 #define BT_CLEAR32(bitmap, bitindex) \
125 126 { BT_WIM32((bitmap), (bitindex)) &= ~BT_BIW32(bitindex); }
126 127 #endif /* _LP64 */
|
↓ open down ↓ |
88 lines elided |
↑ open up ↑ |
127 128
128 129
129 130 /*
130 131 * BIT_ONLYONESET is a private macro not designed for bitmaps of
131 132 * arbitrary size. u must be an unsigned integer/long. It returns
132 133 * true if one and only one bit is set in u.
133 134 */
134 135 #define BIT_ONLYONESET(u) \
135 136 ((((u) == 0) ? 0 : ((u) & ((u) - 1)) == 0))
136 137
137 -#if defined(_KERNEL) && !defined(_ASM)
138 +#if (defined(_KERNEL) || defined(_FAKE_KERNEL)) && !defined(_ASM)
138 139 #include <sys/atomic.h>
139 140
140 141 /*
141 142 * return next available bit index from map with specified number of bits
142 143 */
143 144 extern index_t bt_availbit(ulong_t *bitmap, size_t nbits);
144 145 /*
145 146 * find the highest order bit that is on, and is within or below
146 147 * the word specified by wx
147 148 */
148 149 extern int bt_gethighbit(ulong_t *mapp, int wx);
149 150 extern int bt_range(ulong_t *bitmap, size_t *pos1, size_t *pos2,
150 151 size_t end_pos);
151 152 /*
152 153 * Find highest and lowest one bit set.
153 154 * Returns bit number + 1 of bit that is set, otherwise returns 0.
154 155 * Low order bit is 0, high order bit is 31.
155 156 */
156 157 extern int highbit(ulong_t);
157 158 extern int highbit64(uint64_t);
158 159 extern int lowbit(ulong_t);
159 160 extern int bt_getlowbit(ulong_t *bitmap, size_t start, size_t stop);
160 161 extern void bt_copy(ulong_t *, ulong_t *, ulong_t);
161 162
162 163 /*
163 164 * find the parity
164 165 */
165 166 extern int odd_parity(ulong_t);
166 167
167 168 /*
168 169 * Atomically set/clear bits
169 170 * Atomic exclusive operations will set "result" to "-1"
170 171 * if the bit is already set/cleared. "result" will be set
171 172 * to 0 otherwise.
172 173 */
173 174 #define BT_ATOMIC_SET(bitmap, bitindex) \
174 175 { atomic_or_ulong(&(BT_WIM(bitmap, bitindex)), BT_BIW(bitindex)); }
175 176 #define BT_ATOMIC_CLEAR(bitmap, bitindex) \
176 177 { atomic_and_ulong(&(BT_WIM(bitmap, bitindex)), ~BT_BIW(bitindex)); }
177 178
178 179 #define BT_ATOMIC_SET_EXCL(bitmap, bitindex, result) \
179 180 { result = atomic_set_long_excl(&(BT_WIM(bitmap, bitindex)), \
180 181 (bitindex) % BT_NBIPUL); }
|
↓ open down ↓ |
33 lines elided |
↑ open up ↑ |
181 182 #define BT_ATOMIC_CLEAR_EXCL(bitmap, bitindex, result) \
182 183 { result = atomic_clear_long_excl(&(BT_WIM(bitmap, bitindex)), \
183 184 (bitindex) % BT_NBIPUL); }
184 185
185 186 /*
186 187 * Extracts bits between index h (high, inclusive) and l (low, exclusive) from
187 188 * u, which must be an unsigned integer.
188 189 */
189 190 #define BITX(u, h, l) (((u) >> (l)) & ((1LU << ((h) - (l) + 1LU)) - 1LU))
190 191
191 -#endif /* _KERNEL && !_ASM */
192 +#endif /* (_KERNEL || _FAKE_KERNEL) && !_ASM */
192 193
193 194 #ifdef __cplusplus
194 195 }
195 196 #endif
196 197
197 198 #endif /* _SYS_BITMAP_H */
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX