| /branches/dd/kernel/generic/include/adt/avl.h |
|---|
| 0,0 → 1,141 |
| /* |
| * Copyright (C) 2007 Vojtech Mencl |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * - Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * - Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * - The name of the author may not be used to endorse or promote products |
| * derived from this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** @addtogroup genericadt |
| * @{ |
| */ |
| /** @file |
| */ |
| #ifndef KERN_AVLTREE_H_ |
| #define KERN_AVLTREE_H_ |
| #include <arch/types.h> |
| /** |
| * Macro for getting a pointer to the structure which contains the avltree |
| * structure. |
| * |
| * @param link Pointer to the avltree structure. |
| * @param type Name of the outer structure. |
| * @param member Name of avltree attribute in the outer structure. |
| */ |
| #define avltree_get_instance(node, type, member) \ |
| ((type *)(((uint8_t *)(node)) - ((uint8_t *) &(((type *) NULL)->member)))) |
| typedef struct avltree_node avltree_node_t; |
| typedef struct avltree avltree_t; |
| typedef uint64_t avltree_key_t; |
| typedef bool (* avltree_walker_t)(avltree_node_t *, void *); |
| /** AVL tree node structure. */ |
| struct avltree_node |
| { |
| /** |
| * Pointer to the left descendant of this node. |
| * |
| * All keys of nodes in the left subtree are less than the key of this |
| * node. |
| */ |
| struct avltree_node *lft; |
| /** |
| * Pointer to the right descendant of this node. |
| * |
| * All keys of nodes in the right subtree are greater than the key of |
| * this node. |
| */ |
| struct avltree_node *rgt; |
| /** Pointer to the parent node. Root node has NULL parent. */ |
| struct avltree_node *par; |
| /** Node's key. */ |
| avltree_key_t key; |
| /** |
| * Difference between the heights of the left and the right subtree of |
| * this node. |
| */ |
| int8_t balance; |
| }; |
| /** AVL tree structure. */ |
| struct avltree |
| { |
| /** AVL root node pointer */ |
| struct avltree_node *root; |
| /** |
| * Base of the tree is a value that is smaller or equal than every value |
| * in the tree (valid for positive keys otherwise ignore this atribute). |
| * |
| * The base is added to the current key when a new node is inserted into |
| * the tree. The base is changed to the key of the node which is deleted |
| * with avltree_delete_min(). |
| */ |
| avltree_key_t base; |
| }; |
| /** Create empty AVL tree. |
| * |
| * @param t AVL tree. |
| */ |
| static inline void avltree_create(avltree_t *t) |
| { |
| t->root = NULL; |
| t->base = 0; |
| } |
| /** Initialize node. |
| * |
| * @param node Node which is initialized. |
| */ |
| static inline void avltree_node_initialize(avltree_node_t *node) |
| { |
| node->key = 0; |
| node->lft = NULL; |
| node->rgt = NULL; |
| node->par = NULL; |
| node->balance = 0; |
| } |
| extern avltree_node_t *avltree_find_min(avltree_t *t); |
| extern avltree_node_t *avltree_search(avltree_t *t, avltree_key_t key); |
| extern void avltree_insert(avltree_t *t, avltree_node_t *newnode); |
| extern void avltree_delete(avltree_t *t, avltree_node_t *node); |
| extern bool avltree_delete_min(avltree_t *t); |
| extern void avltree_walk(avltree_t *t, avltree_walker_t walker, void *arg); |
| #endif |
| /** @} |
| */ |
| /branches/dd/kernel/generic/include/adt/list.h |
|---|
| 0,0 → 1,192 |
| /* |
| * Copyright (c) 2001-2004 Jakub Jermar |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * - Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * - Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * - The name of the author may not be used to endorse or promote products |
| * derived from this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** @addtogroup genericadt |
| * @{ |
| */ |
| /** @file |
| */ |
| #ifndef KERN_LIST_H_ |
| #define KERN_LIST_H_ |
| #include <arch/types.h> |
| /** Doubly linked list head and link type. */ |
| typedef struct link { |
| struct link *prev; /**< Pointer to the previous item in the list. */ |
| struct link *next; /**< Pointer to the next item in the list. */ |
| } link_t; |
| /** Declare and initialize statically allocated list. |
| * |
| * @param name Name of the new statically allocated list. |
| */ |
| #define LIST_INITIALIZE(name) \ |
| link_t name = { .prev = &name, .next = &name } |
| /** Initialize doubly-linked circular list link |
| * |
| * Initialize doubly-linked list link. |
| * |
| * @param link Pointer to link_t structure to be initialized. |
| */ |
| static inline void link_initialize(link_t *link) |
| { |
| link->prev = NULL; |
| link->next = NULL; |
| } |
| /** Initialize doubly-linked circular list |
| * |
| * Initialize doubly-linked circular list. |
| * |
| * @param head Pointer to link_t structure representing head of the list. |
| */ |
| static inline void list_initialize(link_t *head) |
| { |
| head->prev = head; |
| head->next = head; |
| } |
| /** Add item to the beginning of doubly-linked circular list |
| * |
| * Add item to the beginning of doubly-linked circular list. |
| * |
| * @param link Pointer to link_t structure to be added. |
| * @param head Pointer to link_t structure representing head of the list. |
| */ |
| static inline void list_prepend(link_t *link, link_t *head) |
| { |
| link->next = head->next; |
| link->prev = head; |
| head->next->prev = link; |
| head->next = link; |
| } |
| /** Add item to the end of doubly-linked circular list |
| * |
| * Add item to the end of doubly-linked circular list. |
| * |
| * @param link Pointer to link_t structure to be added. |
| * @param head Pointer to link_t structure representing head of the list. |
| */ |
| static inline void list_append(link_t *link, link_t *head) |
| { |
| link->prev = head->prev; |
| link->next = head; |
| head->prev->next = link; |
| head->prev = link; |
| } |
| /** Remove item from doubly-linked circular list |
| * |
| * Remove item from doubly-linked circular list. |
| * |
| * @param link Pointer to link_t structure to be removed from the list it is |
| * contained in. |
| */ |
| static inline void list_remove(link_t *link) |
| { |
| link->next->prev = link->prev; |
| link->prev->next = link->next; |
| link_initialize(link); |
| } |
| /** Query emptiness of doubly-linked circular list |
| * |
| * Query emptiness of doubly-linked circular list. |
| * |
| * @param head Pointer to link_t structure representing head of the list. |
| */ |
| static inline bool list_empty(link_t *head) |
| { |
| return head->next == head ? true : false; |
| } |
| /** Split or concatenate headless doubly-linked circular list |
| * |
| * Split or concatenate headless doubly-linked circular list. |
| * |
| * Note that the algorithm works both directions: |
| * concatenates splitted lists and splits concatenated lists. |
| * |
| * @param part1 Pointer to link_t structure leading the first (half of the |
| * headless) list. |
| * @param part2 Pointer to link_t structure leading the second (half of the |
| * headless) list. |
| */ |
| static inline void headless_list_split_or_concat(link_t *part1, link_t *part2) |
| { |
| link_t *hlp; |
| part1->prev->next = part2; |
| part2->prev->next = part1; |
| hlp = part1->prev; |
| part1->prev = part2->prev; |
| part2->prev = hlp; |
| } |
| /** Split headless doubly-linked circular list |
| * |
| * Split headless doubly-linked circular list. |
| * |
| * @param part1 Pointer to link_t structure leading the first half of the |
| * headless list. |
| * @param part2 Pointer to link_t structure leading the second half of the |
| * headless list. |
| */ |
| static inline void headless_list_split(link_t *part1, link_t *part2) |
| { |
| headless_list_split_or_concat(part1, part2); |
| } |
| /** Concatenate two headless doubly-linked circular lists |
| * |
| * Concatenate two headless doubly-linked circular lists. |
| * |
| * @param part1 Pointer to link_t structure leading the first headless list. |
| * @param part2 Pointer to link_t structure leading the second headless list. |
| */ |
| static inline void headless_list_concat(link_t *part1, link_t *part2) |
| { |
| headless_list_split_or_concat(part1, part2); |
| } |
| #define list_get_instance(link, type, member) \ |
| ((type *)(((uint8_t *)(link)) - ((uint8_t *)&(((type *)NULL)->member)))) |
| extern bool list_member(const link_t *link, const link_t *head); |
| extern void list_concat(link_t *head1, link_t *head2); |
| #endif |
| /** @} |
| */ |
| /branches/dd/kernel/generic/include/adt/hash_table.h |
|---|
| 0,0 → 1,88 |
| /* |
| * Copyright (c) 2006 Jakub Jermar |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * - Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * - Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * - The name of the author may not be used to endorse or promote products |
| * derived from this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** @addtogroup genericadt |
| * @{ |
| */ |
| /** @file |
| */ |
| #ifndef KERN_HASH_TABLE_H_ |
| #define KERN_HASH_TABLE_H_ |
| #include <adt/list.h> |
| #include <arch/types.h> |
| /** Set of operations for hash table. */ |
| typedef struct { |
| /** Hash function. |
| * |
| * @param key Array of keys needed to compute hash index. All keys must |
| * be passed. |
| * |
| * @return Index into hash table. |
| */ |
| index_t (* hash)(unative_t key[]); |
| /** Hash table item comparison function. |
| * |
| * @param key Array of keys that will be compared with item. It is not |
| * necessary to pass all keys. |
| * |
| * @return true if the keys match, false otherwise. |
| */ |
| bool (*compare)(unative_t key[], count_t keys, link_t *item); |
| /** Hash table item removal callback. |
| * |
| * @param item Item that was removed from the hash table. |
| */ |
| void (*remove_callback)(link_t *item); |
| } hash_table_operations_t; |
| /** Hash table structure. */ |
| typedef struct { |
| link_t *entry; |
| count_t entries; |
| count_t max_keys; |
| hash_table_operations_t *op; |
| } hash_table_t; |
| #define hash_table_get_instance(item, type, member) \ |
| list_get_instance((item), type, member) |
| extern void hash_table_create(hash_table_t *h, count_t m, count_t max_keys, |
| hash_table_operations_t *op); |
| extern void hash_table_insert(hash_table_t *h, unative_t key[], link_t *item); |
| extern link_t *hash_table_find(hash_table_t *h, unative_t key[]); |
| extern void hash_table_remove(hash_table_t *h, unative_t key[], count_t keys); |
| #endif |
| /** @} |
| */ |
| /branches/dd/kernel/generic/include/adt/btree.h |
|---|
| 0,0 → 1,113 |
| /* |
| * Copyright (c) 2006 Jakub Jermar |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * - Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * - Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * - The name of the author may not be used to endorse or promote products |
| * derived from this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** @addtogroup genericadt |
| * @{ |
| */ |
| /** @file |
| */ |
| #ifndef KERN_BTREE_H_ |
| #define KERN_BTREE_H_ |
| #include <arch/types.h> |
| #include <adt/list.h> |
| #define BTREE_M 5 |
| #define BTREE_MAX_KEYS (BTREE_M - 1) |
| typedef uint64_t btree_key_t; |
| /** B-tree node structure. */ |
| typedef struct btree_node { |
| /** Number of keys. */ |
| count_t keys; |
| /** |
| * Keys. We currently support only single keys. Additional room for one |
| * extra key is provided. |
| */ |
| btree_key_t key[BTREE_MAX_KEYS + 1]; |
| /** |
| * Pointers to values. Sorted according to the key array. Defined only in |
| * leaf-level. There is room for storing value for the extra key. |
| */ |
| void *value[BTREE_MAX_KEYS + 1]; |
| /** |
| * Pointers to descendants of this node sorted according to the key |
| * array. |
| * |
| * subtree[0] points to subtree with keys lesser than to key[0]. |
| * subtree[1] points to subtree with keys greater than or equal to |
| * key[0] and lesser than key[1]. |
| * ... |
| * There is room for storing a subtree pointer for the extra key. |
| */ |
| struct btree_node *subtree[BTREE_M + 1]; |
| /** Pointer to parent node. Root node has NULL parent. */ |
| struct btree_node *parent; |
| /** |
| * Link connecting leaf-level nodes. Defined only when this node is a |
| * leaf. */ |
| link_t leaf_link; |
| /* Variables needed by btree_print(). */ |
| link_t bfs_link; |
| int depth; |
| } btree_node_t; |
| /** B-tree structure. */ |
| typedef struct { |
| btree_node_t *root; /**< B-tree root node pointer. */ |
| link_t leaf_head; /**< Leaf-level list head. */ |
| } btree_t; |
| extern void btree_init(void); |
| extern void btree_create(btree_t *t); |
| extern void btree_destroy(btree_t *t); |
| extern void btree_insert(btree_t *t, btree_key_t key, void *value, |
| btree_node_t *leaf_node); |
| extern void btree_remove(btree_t *t, btree_key_t key, btree_node_t *leaf_node); |
| extern void *btree_search(btree_t *t, btree_key_t key, btree_node_t **leaf_node); |
| extern btree_node_t *btree_leaf_node_left_neighbour(btree_t *t, |
| btree_node_t *node); |
| extern btree_node_t *btree_leaf_node_right_neighbour(btree_t *t, |
| btree_node_t *node); |
| extern void btree_print(btree_t *t); |
| #endif |
| /** @} |
| */ |
| /branches/dd/kernel/generic/include/adt/fifo.h |
|---|
| 0,0 → 1,122 |
| /* |
| * Copyright (c) 2006 Jakub Jermar |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * - Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * - Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * - The name of the author may not be used to endorse or promote products |
| * derived from this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** @addtogroup genericadt |
| * @{ |
| */ |
| /** @file |
| */ |
| /* |
| * This implementation of FIFO stores values in an array |
| * (static or dynamic). As such, these FIFOs have upper bound |
| * on number of values they can store. Push and pop operations |
| * are done via accessing the array through head and tail indices. |
| * Because of better operation ordering in fifo_pop(), the access |
| * policy for these two indices is to 'increment (mod size of FIFO) |
| * and use'. |
| */ |
| #ifndef KERN_FIFO_H_ |
| #define KERN_FIFO_H_ |
| #include <mm/slab.h> |
| /** Create and initialize static FIFO. |
| * |
| * FIFO is allocated statically. |
| * This macro is suitable for creating smaller FIFOs. |
| * |
| * @param name Name of FIFO. |
| * @param t Type of values stored in FIFO. |
| * @param itms Number of items that can be stored in FIFO. |
| */ |
| #define FIFO_INITIALIZE_STATIC(name, t, itms) \ |
| struct { \ |
| t fifo[(itms)]; \ |
| count_t items; \ |
| index_t head; \ |
| index_t tail; \ |
| } name = { \ |
| .items = (itms), \ |
| .head = 0, \ |
| .tail = 0 \ |
| } |
| /** Create and prepare dynamic FIFO. |
| * |
| * FIFO is allocated dynamically. |
| * This macro is suitable for creating larger FIFOs. |
| * |
| * @param name Name of FIFO. |
| * @param t Type of values stored in FIFO. |
| * @param itms Number of items that can be stored in FIFO. |
| */ |
| #define FIFO_INITIALIZE_DYNAMIC(name, t, itms) \ |
| struct { \ |
| t *fifo; \ |
| count_t items; \ |
| index_t head; \ |
| index_t tail; \ |
| } name = { \ |
| .fifo = NULL, \ |
| .items = (itms), \ |
| .head = 0, \ |
| .tail = 0 \ |
| } |
| /** Pop value from head of FIFO. |
| * |
| * @param name FIFO name. |
| * |
| * @return Leading value in FIFO. |
| */ |
| #define fifo_pop(name) \ |
| name.fifo[name.head = (name.head + 1) < name.items ? (name.head + 1) : 0] |
| /** Push value to tail of FIFO. |
| * |
| * @param name FIFO name. |
| * @param value Value to be appended to FIFO. |
| * |
| */ |
| #define fifo_push(name, value) \ |
| name.fifo[name.tail = \ |
| (name.tail + 1) < name.items ? (name.tail + 1) : 0] = (value) |
| /** Allocate memory for dynamic FIFO. |
| * |
| * @param name FIFO name. |
| */ |
| #define fifo_create(name) \ |
| name.fifo = malloc(sizeof(*name.fifo) * name.items, 0) |
| #endif |
| /** @} |
| */ |
| /branches/dd/kernel/generic/include/adt/bitmap.h |
|---|
| 0,0 → 1,55 |
| /* |
| * Copyright (c) 2006 Jakub Jermar |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * - Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * - Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * - The name of the author may not be used to endorse or promote products |
| * derived from this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** @addtogroup genericadt |
| * @{ |
| */ |
| /** @file |
| */ |
| #ifndef KERN_BITMAP_H_ |
| #define KERN_BITMAP_H_ |
| #include <arch/types.h> |
| #define BITS2BYTES(bits) (bits ? ((((bits)-1)>>3)+1) : 0) |
| typedef struct { |
| uint8_t *map; |
| count_t bits; |
| } bitmap_t; |
| extern void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, count_t bits); |
| extern void bitmap_set_range(bitmap_t *bitmap, index_t start, count_t bits); |
| extern void bitmap_clear_range(bitmap_t *bitmap, index_t start, count_t bits); |
| extern void bitmap_copy(bitmap_t *dst, bitmap_t *src, count_t bits); |
| #endif |
| /** @} |
| */ |