| 1 | /*
|
|---|
| 2 | * Copyright (c) 2006 Jakub Jermar
|
|---|
| 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 genericadt
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 | /** @file
|
|---|
| 33 | */
|
|---|
| 34 |
|
|---|
| 35 | #ifndef KERN_BITMAP_H_
|
|---|
| 36 | #define KERN_BITMAP_H_
|
|---|
| 37 |
|
|---|
| 38 | #include <stddef.h>
|
|---|
| 39 | #include <stdbool.h>
|
|---|
| 40 |
|
|---|
| 41 | #define BITMAP_ELEMENT 8
|
|---|
| 42 | #define BITMAP_REMAINER 7
|
|---|
| 43 |
|
|---|
| 44 | typedef struct {
|
|---|
| 45 | size_t elements;
|
|---|
| 46 | uint8_t *bits;
|
|---|
| 47 | size_t next_fit;
|
|---|
| 48 | } bitmap_t;
|
|---|
| 49 |
|
|---|
| 50 | static inline void bitmap_set(bitmap_t *bitmap, size_t element,
|
|---|
| 51 | unsigned int value)
|
|---|
| 52 | {
|
|---|
| 53 | if (element >= bitmap->elements)
|
|---|
| 54 | return;
|
|---|
| 55 |
|
|---|
| 56 | size_t byte = element / BITMAP_ELEMENT;
|
|---|
| 57 | uint8_t mask = 1 << (element & BITMAP_REMAINER);
|
|---|
| 58 |
|
|---|
| 59 | if (value) {
|
|---|
| 60 | bitmap->bits[byte] |= mask;
|
|---|
| 61 | } else {
|
|---|
| 62 | bitmap->bits[byte] &= ~mask;
|
|---|
| 63 | bitmap->next_fit = byte;
|
|---|
| 64 | }
|
|---|
| 65 | }
|
|---|
| 66 |
|
|---|
| 67 | static inline unsigned int bitmap_get(bitmap_t *bitmap, size_t element)
|
|---|
| 68 | {
|
|---|
| 69 | if (element >= bitmap->elements)
|
|---|
| 70 | return 0;
|
|---|
| 71 |
|
|---|
| 72 | size_t byte = element / BITMAP_ELEMENT;
|
|---|
| 73 | uint8_t mask = 1 << (element & BITMAP_REMAINER);
|
|---|
| 74 |
|
|---|
| 75 | return !!((bitmap->bits)[byte] & mask);
|
|---|
| 76 | }
|
|---|
| 77 |
|
|---|
| 78 | extern size_t bitmap_size(size_t);
|
|---|
| 79 | extern void bitmap_initialize(bitmap_t *, size_t, void *);
|
|---|
| 80 |
|
|---|
| 81 | extern void bitmap_set_range(bitmap_t *, size_t, size_t);
|
|---|
| 82 | extern void bitmap_clear_range(bitmap_t *, size_t, size_t);
|
|---|
| 83 |
|
|---|
| 84 | extern bool bitmap_allocate_range(bitmap_t *, size_t, size_t, size_t, size_t,
|
|---|
| 85 | size_t *);
|
|---|
| 86 | extern void bitmap_copy(bitmap_t *, bitmap_t *, size_t);
|
|---|
| 87 |
|
|---|
| 88 | #endif
|
|---|
| 89 |
|
|---|
| 90 | /** @}
|
|---|
| 91 | */
|
|---|
