Commit | Line | Data |
---|---|---|
e951485f | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
1da177e4 LT |
2 | /* |
3 | * Implementation of the extensible bitmap type. | |
4 | * | |
0fe53224 | 5 | * Author : Stephen Smalley, <stephen.smalley.work@gmail.com> |
1da177e4 | 6 | */ |
7420ed23 | 7 | /* |
82c21bfa | 8 | * Updated: Hewlett-Packard <paul@paul-moore.com> |
e951485f PM |
9 | * Added support to import/export the NetLabel category bitmap |
10 | * (c) Copyright Hewlett-Packard Development Company, L.P., 2006 | |
7420ed23 | 11 | * |
9fe79ad1 | 12 | * Updated: KaiGai Kohei <kaigai@ak.jp.nec.com> |
e951485f | 13 | * Applied standard bit operations to improve bitmap scanning. |
9fe79ad1 | 14 | */ |
7420ed23 | 15 | |
1da177e4 LT |
16 | #include <linux/kernel.h> |
17 | #include <linux/slab.h> | |
18 | #include <linux/errno.h> | |
50077289 | 19 | #include <linux/jhash.h> |
02752760 | 20 | #include <net/netlabel.h> |
1da177e4 LT |
21 | #include "ebitmap.h" |
22 | #include "policydb.h" | |
23 | ||
e951485f | 24 | #define BITS_PER_U64 (sizeof(u64) * 8) |
cee74f47 | 25 | |
cd2bb4cb | 26 | static struct kmem_cache *ebitmap_node_cachep __ro_after_init; |
b4958c89 | 27 | |
6354324d | 28 | int ebitmap_cmp(const struct ebitmap *e1, const struct ebitmap *e2) |
1da177e4 | 29 | { |
6354324d | 30 | const struct ebitmap_node *n1, *n2; |
1da177e4 LT |
31 | |
32 | if (e1->highbit != e2->highbit) | |
33 | return 0; | |
34 | ||
35 | n1 = e1->node; | |
36 | n2 = e2->node; | |
e951485f | 37 | while (n1 && n2 && (n1->startbit == n2->startbit) && |
9fe79ad1 | 38 | !memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) { |
1da177e4 LT |
39 | n1 = n1->next; |
40 | n2 = n2->next; | |
41 | } | |
42 | ||
43 | if (n1 || n2) | |
44 | return 0; | |
45 | ||
46 | return 1; | |
47 | } | |
48 | ||
6354324d | 49 | int ebitmap_cpy(struct ebitmap *dst, const struct ebitmap *src) |
1da177e4 | 50 | { |
6354324d CG |
51 | struct ebitmap_node *new, *prev; |
52 | const struct ebitmap_node *n; | |
1da177e4 LT |
53 | |
54 | ebitmap_init(dst); | |
55 | n = src->node; | |
56 | prev = NULL; | |
57 | while (n) { | |
b4958c89 | 58 | new = kmem_cache_zalloc(ebitmap_node_cachep, GFP_ATOMIC); |
1da177e4 LT |
59 | if (!new) { |
60 | ebitmap_destroy(dst); | |
61 | return -ENOMEM; | |
62 | } | |
1da177e4 | 63 | new->startbit = n->startbit; |
9fe79ad1 | 64 | memcpy(new->maps, n->maps, EBITMAP_SIZE / 8); |
1da177e4 LT |
65 | new->next = NULL; |
66 | if (prev) | |
67 | prev->next = new; | |
68 | else | |
69 | dst->node = new; | |
70 | prev = new; | |
71 | n = n->next; | |
72 | } | |
73 | ||
74 | dst->highbit = src->highbit; | |
75 | return 0; | |
76 | } | |
77 | ||
e951485f PM |
78 | int ebitmap_and(struct ebitmap *dst, const struct ebitmap *e1, |
79 | const struct ebitmap *e2) | |
42345b68 JB |
80 | { |
81 | struct ebitmap_node *n; | |
82 | int bit, rc; | |
83 | ||
84 | ebitmap_init(dst); | |
85 | ||
e951485f PM |
86 | ebitmap_for_each_positive_bit(e1, n, bit) |
87 | { | |
42345b68 JB |
88 | if (ebitmap_get_bit(e2, bit)) { |
89 | rc = ebitmap_set_bit(dst, bit, 1); | |
90 | if (rc < 0) | |
91 | return rc; | |
92 | } | |
93 | } | |
94 | return 0; | |
95 | } | |
96 | ||
02752760 | 97 | #ifdef CONFIG_NETLABEL |
7420ed23 | 98 | /** |
02752760 PM |
99 | * ebitmap_netlbl_export - Export an ebitmap into a NetLabel category bitmap |
100 | * @ebmap: the ebitmap to export | |
101 | * @catmap: the NetLabel category bitmap | |
7420ed23 VY |
102 | * |
103 | * Description: | |
02752760 PM |
104 | * Export a SELinux extensibile bitmap into a NetLabel category bitmap. |
105 | * Returns zero on success, negative values on error. | |
7420ed23 VY |
106 | * |
107 | */ | |
02752760 | 108 | int ebitmap_netlbl_export(struct ebitmap *ebmap, |
4fbe63d1 | 109 | struct netlbl_lsm_catmap **catmap) |
7420ed23 | 110 | { |
02752760 | 111 | struct ebitmap_node *e_iter = ebmap->node; |
4b8feff2 PM |
112 | unsigned long e_map; |
113 | u32 offset; | |
114 | unsigned int iter; | |
115 | int rc; | |
02752760 PM |
116 | |
117 | if (e_iter == NULL) { | |
118 | *catmap = NULL; | |
bf0edf39 PM |
119 | return 0; |
120 | } | |
121 | ||
4b8feff2 | 122 | if (*catmap != NULL) |
4fbe63d1 | 123 | netlbl_catmap_free(*catmap); |
4b8feff2 | 124 | *catmap = NULL; |
02752760 | 125 | |
dbc74c65 | 126 | while (e_iter) { |
4b8feff2 PM |
127 | offset = e_iter->startbit; |
128 | for (iter = 0; iter < EBITMAP_UNIT_NUMS; iter++) { | |
129 | e_map = e_iter->maps[iter]; | |
130 | if (e_map != 0) { | |
e951485f PM |
131 | rc = netlbl_catmap_setlong(catmap, offset, |
132 | e_map, GFP_ATOMIC); | |
4b8feff2 | 133 | if (rc != 0) |
9fe79ad1 | 134 | goto netlbl_export_failure; |
9fe79ad1 | 135 | } |
4b8feff2 | 136 | offset += EBITMAP_UNIT_SIZE; |
02752760 | 137 | } |
6d2b6855 | 138 | e_iter = e_iter->next; |
02752760 | 139 | } |
7420ed23 | 140 | |
7420ed23 | 141 | return 0; |
02752760 PM |
142 | |
143 | netlbl_export_failure: | |
4fbe63d1 | 144 | netlbl_catmap_free(*catmap); |
02752760 | 145 | return -ENOMEM; |
7420ed23 VY |
146 | } |
147 | ||
148 | /** | |
02752760 | 149 | * ebitmap_netlbl_import - Import a NetLabel category bitmap into an ebitmap |
9fe79ad1 | 150 | * @ebmap: the ebitmap to import |
02752760 | 151 | * @catmap: the NetLabel category bitmap |
7420ed23 VY |
152 | * |
153 | * Description: | |
02752760 PM |
154 | * Import a NetLabel category bitmap into a SELinux extensibile bitmap. |
155 | * Returns zero on success, negative values on error. | |
7420ed23 VY |
156 | * |
157 | */ | |
02752760 | 158 | int ebitmap_netlbl_import(struct ebitmap *ebmap, |
4fbe63d1 | 159 | struct netlbl_lsm_catmap *catmap) |
7420ed23 | 160 | { |
4b8feff2 | 161 | int rc; |
02752760 | 162 | struct ebitmap_node *e_iter = NULL; |
4b8feff2 PM |
163 | struct ebitmap_node *e_prev = NULL; |
164 | u32 offset = 0, idx; | |
165 | unsigned long bitmap; | |
166 | ||
167 | for (;;) { | |
4fbe63d1 | 168 | rc = netlbl_catmap_getlong(catmap, &offset, &bitmap); |
4b8feff2 PM |
169 | if (rc < 0) |
170 | goto netlbl_import_failure; | |
171 | if (offset == (u32)-1) | |
172 | return 0; | |
173 | ||
33246035 PM |
174 | /* don't waste ebitmap space if the netlabel bitmap is empty */ |
175 | if (bitmap == 0) { | |
176 | offset += EBITMAP_UNIT_SIZE; | |
177 | continue; | |
178 | } | |
179 | ||
4b8feff2 PM |
180 | if (e_iter == NULL || |
181 | offset >= e_iter->startbit + EBITMAP_SIZE) { | |
182 | e_prev = e_iter; | |
e951485f PM |
183 | e_iter = kmem_cache_zalloc(ebitmap_node_cachep, |
184 | GFP_ATOMIC); | |
4b8feff2 PM |
185 | if (e_iter == NULL) |
186 | goto netlbl_import_failure; | |
8bebe88c | 187 | e_iter->startbit = offset - (offset % EBITMAP_SIZE); |
4b8feff2 PM |
188 | if (e_prev == NULL) |
189 | ebmap->node = e_iter; | |
190 | else | |
191 | e_prev->next = e_iter; | |
192 | ebmap->highbit = e_iter->startbit + EBITMAP_SIZE; | |
02752760 | 193 | } |
7420ed23 | 194 | |
4b8feff2 PM |
195 | /* offset will always be aligned to an unsigned long */ |
196 | idx = EBITMAP_NODE_INDEX(e_iter, offset); | |
197 | e_iter->maps[idx] = bitmap; | |
198 | ||
199 | /* next */ | |
200 | offset += EBITMAP_UNIT_SIZE; | |
201 | } | |
202 | ||
203 | /* NOTE: we should never reach this return */ | |
7420ed23 | 204 | return 0; |
02752760 PM |
205 | |
206 | netlbl_import_failure: | |
207 | ebitmap_destroy(ebmap); | |
208 | return -ENOMEM; | |
7420ed23 | 209 | } |
02752760 | 210 | #endif /* CONFIG_NETLABEL */ |
7420ed23 | 211 | |
fee71142 WL |
212 | /* |
213 | * Check to see if all the bits set in e2 are also set in e1. Optionally, | |
214 | * if last_e2bit is non-zero, the highest set bit in e2 cannot exceed | |
215 | * last_e2bit. | |
216 | */ | |
e951485f PM |
217 | int ebitmap_contains(const struct ebitmap *e1, const struct ebitmap *e2, |
218 | u32 last_e2bit) | |
1da177e4 | 219 | { |
6354324d | 220 | const struct ebitmap_node *n1, *n2; |
9fe79ad1 | 221 | int i; |
1da177e4 LT |
222 | |
223 | if (e1->highbit < e2->highbit) | |
224 | return 0; | |
225 | ||
226 | n1 = e1->node; | |
227 | n2 = e2->node; | |
fee71142 | 228 | |
1da177e4 LT |
229 | while (n1 && n2 && (n1->startbit <= n2->startbit)) { |
230 | if (n1->startbit < n2->startbit) { | |
231 | n1 = n1->next; | |
232 | continue; | |
233 | } | |
e951485f PM |
234 | for (i = EBITMAP_UNIT_NUMS - 1; (i >= 0) && !n2->maps[i];) |
235 | i--; /* Skip trailing NULL map entries */ | |
fee71142 WL |
236 | if (last_e2bit && (i >= 0)) { |
237 | u32 lastsetbit = n2->startbit + i * EBITMAP_UNIT_SIZE + | |
238 | __fls(n2->maps[i]); | |
239 | if (lastsetbit > last_e2bit) | |
240 | return 0; | |
241 | } | |
242 | ||
243 | while (i >= 0) { | |
9fe79ad1 KK |
244 | if ((n1->maps[i] & n2->maps[i]) != n2->maps[i]) |
245 | return 0; | |
fee71142 | 246 | i--; |
9fe79ad1 | 247 | } |
1da177e4 LT |
248 | |
249 | n1 = n1->next; | |
250 | n2 = n2->next; | |
251 | } | |
252 | ||
253 | if (n2) | |
254 | return 0; | |
255 | ||
256 | return 1; | |
257 | } | |
258 | ||
6354324d | 259 | int ebitmap_get_bit(const struct ebitmap *e, unsigned long bit) |
1da177e4 | 260 | { |
6354324d | 261 | const struct ebitmap_node *n; |
1da177e4 LT |
262 | |
263 | if (e->highbit < bit) | |
264 | return 0; | |
265 | ||
266 | n = e->node; | |
267 | while (n && (n->startbit <= bit)) { | |
9fe79ad1 KK |
268 | if ((n->startbit + EBITMAP_SIZE) > bit) |
269 | return ebitmap_node_get_bit(n, bit); | |
1da177e4 LT |
270 | n = n->next; |
271 | } | |
272 | ||
273 | return 0; | |
274 | } | |
275 | ||
276 | int ebitmap_set_bit(struct ebitmap *e, unsigned long bit, int value) | |
277 | { | |
278 | struct ebitmap_node *n, *prev, *new; | |
279 | ||
280 | prev = NULL; | |
281 | n = e->node; | |
282 | while (n && n->startbit <= bit) { | |
9fe79ad1 | 283 | if ((n->startbit + EBITMAP_SIZE) > bit) { |
1da177e4 | 284 | if (value) { |
9fe79ad1 | 285 | ebitmap_node_set_bit(n, bit); |
1da177e4 | 286 | } else { |
9fe79ad1 KK |
287 | unsigned int s; |
288 | ||
289 | ebitmap_node_clr_bit(n, bit); | |
290 | ||
291 | s = find_first_bit(n->maps, EBITMAP_SIZE); | |
292 | if (s < EBITMAP_SIZE) | |
293 | return 0; | |
294 | ||
295 | /* drop this node from the bitmap */ | |
296 | if (!n->next) { | |
297 | /* | |
298 | * this was the highest map | |
299 | * within the bitmap | |
300 | */ | |
1da177e4 | 301 | if (prev) |
e951485f PM |
302 | e->highbit = prev->startbit + |
303 | EBITMAP_SIZE; | |
1da177e4 | 304 | else |
9fe79ad1 | 305 | e->highbit = 0; |
1da177e4 | 306 | } |
9fe79ad1 KK |
307 | if (prev) |
308 | prev->next = n->next; | |
309 | else | |
310 | e->node = n->next; | |
b4958c89 | 311 | kmem_cache_free(ebitmap_node_cachep, n); |
1da177e4 LT |
312 | } |
313 | return 0; | |
314 | } | |
315 | prev = n; | |
316 | n = n->next; | |
317 | } | |
318 | ||
319 | if (!value) | |
320 | return 0; | |
321 | ||
b4958c89 | 322 | new = kmem_cache_zalloc(ebitmap_node_cachep, GFP_ATOMIC); |
1da177e4 LT |
323 | if (!new) |
324 | return -ENOMEM; | |
1da177e4 | 325 | |
9fe79ad1 KK |
326 | new->startbit = bit - (bit % EBITMAP_SIZE); |
327 | ebitmap_node_set_bit(new, bit); | |
1da177e4 LT |
328 | |
329 | if (!n) | |
330 | /* this node will be the highest map within the bitmap */ | |
9fe79ad1 | 331 | e->highbit = new->startbit + EBITMAP_SIZE; |
1da177e4 LT |
332 | |
333 | if (prev) { | |
334 | new->next = prev->next; | |
335 | prev->next = new; | |
336 | } else { | |
337 | new->next = e->node; | |
338 | e->node = new; | |
339 | } | |
340 | ||
341 | return 0; | |
342 | } | |
343 | ||
344 | void ebitmap_destroy(struct ebitmap *e) | |
345 | { | |
346 | struct ebitmap_node *n, *temp; | |
347 | ||
348 | if (!e) | |
349 | return; | |
350 | ||
351 | n = e->node; | |
352 | while (n) { | |
353 | temp = n; | |
354 | n = n->next; | |
b4958c89 | 355 | kmem_cache_free(ebitmap_node_cachep, temp); |
1da177e4 LT |
356 | } |
357 | ||
358 | e->highbit = 0; | |
359 | e->node = NULL; | |
1da177e4 LT |
360 | } |
361 | ||
362 | int ebitmap_read(struct ebitmap *e, void *fp) | |
363 | { | |
9fe79ad1 KK |
364 | struct ebitmap_node *n = NULL; |
365 | u32 mapunit, count, startbit, index; | |
8ba1d537 | 366 | __le32 ebitmap_start; |
9fe79ad1 | 367 | u64 map; |
8ba1d537 | 368 | __le64 mapbits; |
b5bf6c55 | 369 | __le32 buf[3]; |
9fe79ad1 | 370 | int rc, i; |
1da177e4 LT |
371 | |
372 | ebitmap_init(e); | |
373 | ||
374 | rc = next_entry(buf, fp, sizeof buf); | |
375 | if (rc < 0) | |
376 | goto out; | |
377 | ||
9fe79ad1 | 378 | mapunit = le32_to_cpu(buf[0]); |
1da177e4 LT |
379 | e->highbit = le32_to_cpu(buf[1]); |
380 | count = le32_to_cpu(buf[2]); | |
381 | ||
cee74f47 | 382 | if (mapunit != BITS_PER_U64) { |
180cfc58 | 383 | pr_err("SELinux: ebitmap: map size %u does not " |
5b5e0928 | 384 | "match my size %zd (high bit was %d)\n", |
cee74f47 | 385 | mapunit, BITS_PER_U64, e->highbit); |
1da177e4 LT |
386 | goto bad; |
387 | } | |
9fe79ad1 KK |
388 | |
389 | /* round up e->highbit */ | |
390 | e->highbit += EBITMAP_SIZE - 1; | |
391 | e->highbit -= (e->highbit % EBITMAP_SIZE); | |
392 | ||
1da177e4 LT |
393 | if (!e->highbit) { |
394 | e->node = NULL; | |
395 | goto ok; | |
396 | } | |
9fe79ad1 | 397 | |
74d977b6 WR |
398 | if (e->highbit && !count) |
399 | goto bad; | |
400 | ||
1da177e4 | 401 | for (i = 0; i < count; i++) { |
8ba1d537 | 402 | rc = next_entry(&ebitmap_start, fp, sizeof(u32)); |
1da177e4 | 403 | if (rc < 0) { |
180cfc58 | 404 | pr_err("SELinux: ebitmap: truncated map\n"); |
1da177e4 LT |
405 | goto bad; |
406 | } | |
8ba1d537 | 407 | startbit = le32_to_cpu(ebitmap_start); |
1da177e4 | 408 | |
9fe79ad1 | 409 | if (startbit & (mapunit - 1)) { |
180cfc58 | 410 | pr_err("SELinux: ebitmap start bit (%d) is " |
087feb98 | 411 | "not a multiple of the map unit size (%u)\n", |
9fe79ad1 KK |
412 | startbit, mapunit); |
413 | goto bad; | |
1da177e4 | 414 | } |
9fe79ad1 | 415 | if (startbit > e->highbit - mapunit) { |
180cfc58 | 416 | pr_err("SELinux: ebitmap start bit (%d) is " |
087feb98 | 417 | "beyond the end of the bitmap (%u)\n", |
9fe79ad1 KK |
418 | startbit, (e->highbit - mapunit)); |
419 | goto bad; | |
420 | } | |
421 | ||
422 | if (!n || startbit >= n->startbit + EBITMAP_SIZE) { | |
423 | struct ebitmap_node *tmp; | |
e951485f PM |
424 | tmp = kmem_cache_zalloc(ebitmap_node_cachep, |
425 | GFP_KERNEL); | |
9fe79ad1 | 426 | if (!tmp) { |
180cfc58 | 427 | pr_err("SELinux: ebitmap: out of memory\n"); |
9fe79ad1 KK |
428 | rc = -ENOMEM; |
429 | goto bad; | |
430 | } | |
431 | /* round down */ | |
432 | tmp->startbit = startbit - (startbit % EBITMAP_SIZE); | |
7696ee80 | 433 | if (n) |
9fe79ad1 | 434 | n->next = tmp; |
7696ee80 | 435 | else |
9fe79ad1 | 436 | e->node = tmp; |
9fe79ad1 KK |
437 | n = tmp; |
438 | } else if (startbit <= n->startbit) { | |
180cfc58 | 439 | pr_err("SELinux: ebitmap: start bit %d" |
9fe79ad1 KK |
440 | " comes after start bit %d\n", |
441 | startbit, n->startbit); | |
442 | goto bad; | |
1da177e4 | 443 | } |
9fe79ad1 | 444 | |
8ba1d537 | 445 | rc = next_entry(&mapbits, fp, sizeof(u64)); |
1da177e4 | 446 | if (rc < 0) { |
180cfc58 | 447 | pr_err("SELinux: ebitmap: truncated map\n"); |
9fe79ad1 | 448 | goto bad; |
1da177e4 | 449 | } |
8ba1d537 | 450 | map = le64_to_cpu(mapbits); |
0142c566 CG |
451 | if (!map) { |
452 | pr_err("SELinux: ebitmap: empty map\n"); | |
453 | goto bad; | |
454 | } | |
1da177e4 | 455 | |
9fe79ad1 KK |
456 | index = (startbit - n->startbit) / EBITMAP_UNIT_SIZE; |
457 | while (map) { | |
087feb98 KK |
458 | n->maps[index++] = map & (-1UL); |
459 | map = EBITMAP_SHIFT_UNIT_SIZE(map); | |
1da177e4 | 460 | } |
1da177e4 | 461 | } |
0142c566 CG |
462 | |
463 | if (n && n->startbit + EBITMAP_SIZE != e->highbit) { | |
464 | pr_err("SELinux: ebitmap: high bit %d is not equal to the expected value %ld\n", | |
465 | e->highbit, n->startbit + EBITMAP_SIZE); | |
466 | goto bad; | |
467 | } | |
468 | ||
1da177e4 LT |
469 | ok: |
470 | rc = 0; | |
471 | out: | |
472 | return rc; | |
1da177e4 LT |
473 | bad: |
474 | if (!rc) | |
475 | rc = -EINVAL; | |
476 | ebitmap_destroy(e); | |
477 | goto out; | |
478 | } | |
cee74f47 | 479 | |
6354324d | 480 | int ebitmap_write(const struct ebitmap *e, void *fp) |
cee74f47 EP |
481 | { |
482 | struct ebitmap_node *n; | |
483 | u32 count; | |
484 | __le32 buf[3]; | |
485 | u64 map; | |
486 | int bit, last_bit, last_startbit, rc; | |
487 | ||
488 | buf[0] = cpu_to_le32(BITS_PER_U64); | |
489 | ||
490 | count = 0; | |
491 | last_bit = 0; | |
492 | last_startbit = -1; | |
e951485f PM |
493 | ebitmap_for_each_positive_bit(e, n, bit) |
494 | { | |
cee74f47 EP |
495 | if (rounddown(bit, (int)BITS_PER_U64) > last_startbit) { |
496 | count++; | |
497 | last_startbit = rounddown(bit, BITS_PER_U64); | |
498 | } | |
499 | last_bit = roundup(bit + 1, BITS_PER_U64); | |
500 | } | |
501 | buf[1] = cpu_to_le32(last_bit); | |
502 | buf[2] = cpu_to_le32(count); | |
503 | ||
504 | rc = put_entry(buf, sizeof(u32), 3, fp); | |
505 | if (rc) | |
506 | return rc; | |
507 | ||
508 | map = 0; | |
509 | last_startbit = INT_MIN; | |
e951485f PM |
510 | ebitmap_for_each_positive_bit(e, n, bit) |
511 | { | |
cee74f47 EP |
512 | if (rounddown(bit, (int)BITS_PER_U64) > last_startbit) { |
513 | __le64 buf64[1]; | |
514 | ||
515 | /* this is the very first bit */ | |
516 | if (!map) { | |
517 | last_startbit = rounddown(bit, BITS_PER_U64); | |
518 | map = (u64)1 << (bit - last_startbit); | |
519 | continue; | |
520 | } | |
521 | ||
522 | /* write the last node */ | |
523 | buf[0] = cpu_to_le32(last_startbit); | |
524 | rc = put_entry(buf, sizeof(u32), 1, fp); | |
525 | if (rc) | |
526 | return rc; | |
527 | ||
528 | buf64[0] = cpu_to_le64(map); | |
529 | rc = put_entry(buf64, sizeof(u64), 1, fp); | |
530 | if (rc) | |
531 | return rc; | |
532 | ||
533 | /* set up for the next node */ | |
534 | map = 0; | |
535 | last_startbit = rounddown(bit, BITS_PER_U64); | |
536 | } | |
537 | map |= (u64)1 << (bit - last_startbit); | |
538 | } | |
539 | /* write the last node */ | |
540 | if (map) { | |
541 | __le64 buf64[1]; | |
542 | ||
543 | /* write the last node */ | |
544 | buf[0] = cpu_to_le32(last_startbit); | |
545 | rc = put_entry(buf, sizeof(u32), 1, fp); | |
546 | if (rc) | |
547 | return rc; | |
548 | ||
549 | buf64[0] = cpu_to_le64(map); | |
550 | rc = put_entry(buf64, sizeof(u64), 1, fp); | |
551 | if (rc) | |
552 | return rc; | |
553 | } | |
554 | return 0; | |
555 | } | |
b4958c89 | 556 | |
50077289 OM |
557 | u32 ebitmap_hash(const struct ebitmap *e, u32 hash) |
558 | { | |
559 | struct ebitmap_node *node; | |
560 | ||
561 | /* need to change hash even if ebitmap is empty */ | |
562 | hash = jhash_1word(e->highbit, hash); | |
563 | for (node = e->node; node; node = node->next) { | |
564 | hash = jhash_1word(node->startbit, hash); | |
565 | hash = jhash(node->maps, sizeof(node->maps), hash); | |
566 | } | |
567 | return hash; | |
568 | } | |
569 | ||
aa8e712c | 570 | void __init ebitmap_cache_init(void) |
b4958c89 JL |
571 | { |
572 | ebitmap_node_cachep = kmem_cache_create("ebitmap_node", | |
e951485f PM |
573 | sizeof(struct ebitmap_node), 0, |
574 | SLAB_PANIC, NULL); | |
b4958c89 | 575 | } |