Print this page
NEX-3553 SMB2/3 durable handles
Reviewed by: Gordon Ross <gwr@nexenta.com>
Reviewed by: Kevin Crowe <kevin.crowe@nexenta.com>
NEX-5599 SMB needs a pointer-based hash table for durable handles
Reviewed by: Gordon Ross <gwr@nexenta.com>
| 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 2015 Nexenta Systems, Inc. All rights reserved.
29 30 * Copyright 2017 RackTop Systems.
30 31 */
31 32
32 33 /* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
33 34 /* All Rights Reserved */
34 35
35 36
36 37 #ifndef _SYS_BITMAP_H
37 38 #define _SYS_BITMAP_H
38 39
39 40 #ifdef __cplusplus
40 41 extern "C" {
41 42 #endif
42 43
43 44 #include <sys/feature_tests.h>
44 45 #if defined(__GNUC__) && defined(_ASM_INLINES) && \
45 46 (defined(__i386) || defined(__amd64))
46 47 #include <asm/bitmap.h>
47 48 #endif
48 49
49 50 /*
50 51 * Operations on bitmaps of arbitrary size
51 52 * A bitmap is a vector of 1 or more ulong_t's.
52 53 * The user of the package is responsible for range checks and keeping
53 54 * track of sizes.
54 55 */
55 56
56 57 #ifdef _LP64
57 58 #define BT_ULSHIFT 6 /* log base 2 of BT_NBIPUL, to extract word index */
58 59 #define BT_ULSHIFT32 5 /* log base 2 of BT_NBIPUL, to extract word index */
59 60 #else
60 61 #define BT_ULSHIFT 5 /* log base 2 of BT_NBIPUL, to extract word index */
61 62 #endif
62 63
63 64 #define BT_NBIPUL (1 << BT_ULSHIFT) /* n bits per ulong_t */
64 65 #define BT_ULMASK (BT_NBIPUL - 1) /* to extract bit index */
65 66
66 67 #ifdef _LP64
67 68 #define BT_NBIPUL32 (1 << BT_ULSHIFT32) /* n bits per ulong_t */
68 69 #define BT_ULMASK32 (BT_NBIPUL32 - 1) /* to extract bit index */
69 70 #define BT_ULMAXMASK 0xffffffffffffffff /* used by bt_getlowbit */
70 71 #else
71 72 #define BT_ULMAXMASK 0xffffffff
72 73 #endif
73 74
74 75 /*
75 76 * bitmap is a ulong_t *, bitindex an index_t
76 77 *
77 78 * The macros BT_WIM and BT_BIW internal; there is no need
78 79 * for users of this package to use them.
79 80 */
80 81
81 82 /*
82 83 * word in map
83 84 */
84 85 #define BT_WIM(bitmap, bitindex) \
85 86 ((bitmap)[(bitindex) >> BT_ULSHIFT])
86 87 /*
87 88 * bit in word
88 89 */
89 90 #define BT_BIW(bitindex) \
90 91 (1UL << ((bitindex) & BT_ULMASK))
91 92
92 93 #ifdef _LP64
93 94 #define BT_WIM32(bitmap, bitindex) \
94 95 ((bitmap)[(bitindex) >> BT_ULSHIFT32])
95 96
96 97 #define BT_BIW32(bitindex) \
97 98 (1UL << ((bitindex) & BT_ULMASK32))
98 99 #endif
99 100
100 101 /*
101 102 * These are public macros
102 103 *
103 104 * BT_BITOUL == n bits to n ulong_t's
104 105 */
105 106 #define BT_BITOUL(nbits) \
106 107 (((nbits) + BT_NBIPUL - 1l) / BT_NBIPUL)
107 108 #define BT_SIZEOFMAP(nbits) \
108 109 (BT_BITOUL(nbits) * sizeof (ulong_t))
109 110 #define BT_TEST(bitmap, bitindex) \
110 111 ((BT_WIM((bitmap), (bitindex)) & BT_BIW(bitindex)) ? 1 : 0)
111 112 #define BT_SET(bitmap, bitindex) \
112 113 { BT_WIM((bitmap), (bitindex)) |= BT_BIW(bitindex); }
113 114 #define BT_CLEAR(bitmap, bitindex) \
114 115 { BT_WIM((bitmap), (bitindex)) &= ~BT_BIW(bitindex); }
115 116
116 117 #ifdef _LP64
117 118 #define BT_BITOUL32(nbits) \
118 119 (((nbits) + BT_NBIPUL32 - 1l) / BT_NBIPUL32)
119 120 #define BT_SIZEOFMAP32(nbits) \
120 121 (BT_BITOUL32(nbits) * sizeof (uint_t))
121 122 #define BT_TEST32(bitmap, bitindex) \
122 123 ((BT_WIM32((bitmap), (bitindex)) & BT_BIW32(bitindex)) ? 1 : 0)
123 124 #define BT_SET32(bitmap, bitindex) \
124 125 { BT_WIM32((bitmap), (bitindex)) |= BT_BIW32(bitindex); }
125 126 #define BT_CLEAR32(bitmap, bitindex) \
126 127 { BT_WIM32((bitmap), (bitindex)) &= ~BT_BIW32(bitindex); }
127 128 #endif /* _LP64 */
128 129
129 130
130 131 /*
131 132 * BIT_ONLYONESET is a private macro not designed for bitmaps of
132 133 * arbitrary size. u must be an unsigned integer/long. It returns
133 134 * true if one and only one bit is set in u.
134 135 */
135 136 #define BIT_ONLYONESET(u) \
136 137 ((((u) == 0) ? 0 : ((u) & ((u) - 1)) == 0))
137 138
138 139 #if (defined(_KERNEL) || defined(_FAKE_KERNEL)) && !defined(_ASM)
139 140 #include <sys/atomic.h>
140 141
141 142 /*
142 143 * return next available bit index from map with specified number of bits
143 144 */
144 145 extern index_t bt_availbit(ulong_t *bitmap, size_t nbits);
145 146 /*
146 147 * find the highest order bit that is on, and is within or below
147 148 * the word specified by wx
148 149 */
149 150 extern int bt_gethighbit(ulong_t *mapp, int wx);
150 151 extern int bt_range(ulong_t *bitmap, size_t *pos1, size_t *pos2,
151 152 size_t end_pos);
152 153 /*
153 154 * Find highest and lowest one bit set.
154 155 * Returns bit number + 1 of bit that is set, otherwise returns 0.
155 156 * Low order bit is 0, high order bit is 31.
156 157 */
157 158 extern int highbit(ulong_t);
158 159 extern int highbit64(uint64_t);
159 160 extern int lowbit(ulong_t);
160 161 extern int bt_getlowbit(ulong_t *bitmap, size_t start, size_t stop);
161 162 extern void bt_copy(ulong_t *, ulong_t *, ulong_t);
162 163
163 164 /*
164 165 * find the parity
165 166 */
166 167 extern int odd_parity(ulong_t);
167 168
168 169 /*
169 170 * Atomically set/clear bits
170 171 * Atomic exclusive operations will set "result" to "-1"
171 172 * if the bit is already set/cleared. "result" will be set
172 173 * to 0 otherwise.
173 174 */
174 175 #define BT_ATOMIC_SET(bitmap, bitindex) \
175 176 { atomic_or_ulong(&(BT_WIM(bitmap, bitindex)), BT_BIW(bitindex)); }
176 177 #define BT_ATOMIC_CLEAR(bitmap, bitindex) \
177 178 { atomic_and_ulong(&(BT_WIM(bitmap, bitindex)), ~BT_BIW(bitindex)); }
178 179
179 180 #define BT_ATOMIC_SET_EXCL(bitmap, bitindex, result) \
180 181 { result = atomic_set_long_excl(&(BT_WIM(bitmap, bitindex)), \
181 182 (bitindex) % BT_NBIPUL); }
182 183 #define BT_ATOMIC_CLEAR_EXCL(bitmap, bitindex, result) \
183 184 { result = atomic_clear_long_excl(&(BT_WIM(bitmap, bitindex)), \
184 185 (bitindex) % BT_NBIPUL); }
185 186
186 187 /*
187 188 * Extracts bits between index h (high, inclusive) and l (low, exclusive) from
188 189 * u, which must be an unsigned integer.
189 190 */
190 191 #define BITX(u, h, l) (((u) >> (l)) & ((1LU << ((h) - (l) + 1LU)) - 1LU))
191 192
192 193 #endif /* (_KERNEL || _FAKE_KERNEL) && !_ASM */
193 194
194 195 #ifdef __cplusplus
195 196 }
196 197 #endif
197 198
198 199 #endif /* _SYS_BITMAP_H */
|
↓ open down ↓ |
160 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX