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