| 1 | /*
|
|---|
| 2 | * Copyright (c) 2005 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 genericmm
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 | /** @file
|
|---|
| 33 | */
|
|---|
| 34 |
|
|---|
| 35 | #ifndef KERN_BUDDY_H_
|
|---|
| 36 | #define KERN_BUDDY_H_
|
|---|
| 37 |
|
|---|
| 38 | #include <arch/types.h>
|
|---|
| 39 | #include <typedefs.h>
|
|---|
| 40 |
|
|---|
| 41 | #define BUDDY_SYSTEM_INNER_BLOCK 0xff
|
|---|
| 42 |
|
|---|
| 43 | struct buddy_system;
|
|---|
| 44 |
|
|---|
| 45 | /** Buddy system operations to be implemented by each implementation. */
|
|---|
| 46 | typedef struct {
|
|---|
| 47 | /** Return pointer to left-side or right-side buddy for block passed as
|
|---|
| 48 | * argument. */
|
|---|
| 49 | link_t *(* find_buddy)(struct buddy_system *, link_t *);
|
|---|
| 50 | /** Bisect the block passed as argument and return pointer to the new
|
|---|
| 51 | * right-side buddy. */
|
|---|
| 52 | link_t *(* bisect)(struct buddy_system *, link_t *);
|
|---|
| 53 | /** Coalesce two buddies into a bigger block. */
|
|---|
| 54 | link_t *(* coalesce)(struct buddy_system *, link_t *, link_t *);
|
|---|
| 55 | /** Set order of block passed as argument. */
|
|---|
| 56 | void (*set_order)(struct buddy_system *, link_t *, uint8_t);
|
|---|
| 57 | /** Return order of block passed as argument. */
|
|---|
| 58 | uint8_t (*get_order)(struct buddy_system *, link_t *);
|
|---|
| 59 | /** Mark block as busy. */
|
|---|
| 60 | void (*mark_busy)(struct buddy_system *, link_t *);
|
|---|
| 61 | /** Mark block as available. */
|
|---|
| 62 | void (*mark_available)(struct buddy_system *, link_t *);
|
|---|
| 63 | /** Find parent of block that has given order */
|
|---|
| 64 | link_t *(* find_block)(struct buddy_system *, link_t *, uint8_t);
|
|---|
| 65 | void (* print_id)(struct buddy_system *, link_t *);
|
|---|
| 66 | } buddy_system_operations_t;
|
|---|
| 67 |
|
|---|
| 68 | typedef struct buddy_system {
|
|---|
| 69 | /** Maximal order of block which can be stored by buddy system. */
|
|---|
| 70 | uint8_t max_order;
|
|---|
| 71 | link_t *order;
|
|---|
| 72 | buddy_system_operations_t *op;
|
|---|
| 73 | /** Pointer to be used by the implementation. */
|
|---|
| 74 | void *data;
|
|---|
| 75 | } buddy_system_t;
|
|---|
| 76 |
|
|---|
| 77 | extern void buddy_system_create(buddy_system_t *b, uint8_t max_order,
|
|---|
| 78 | buddy_system_operations_t *op, void *data);
|
|---|
| 79 | extern link_t *buddy_system_alloc(buddy_system_t *b, uint8_t i);
|
|---|
| 80 | extern bool buddy_system_can_alloc(buddy_system_t *b, uint8_t order);
|
|---|
| 81 | extern void buddy_system_free(buddy_system_t *b, link_t *block);
|
|---|
| 82 | extern void buddy_system_structure_print(buddy_system_t *b, size_t elem_size);
|
|---|
| 83 | extern size_t buddy_conf_size(int max_order);
|
|---|
| 84 | extern link_t *buddy_system_alloc_block(buddy_system_t *b, link_t *block);
|
|---|
| 85 |
|
|---|
| 86 | #endif
|
|---|
| 87 |
|
|---|
| 88 | /** @}
|
|---|
| 89 | */
|
|---|
