Rev 2106 | Rev 3211 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
377 | jermar | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2005 Jakub Jermar |
377 | 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 | |||
1888 | jermar | 29 | /** @addtogroup genericmm |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
1888 | jermar | 35 | #ifndef KERN_BUDDY_H_ |
36 | #define KERN_BUDDY_H_ |
||
377 | jermar | 37 | |
38 | #include <arch/types.h> |
||
2089 | decky | 39 | #include <adt/list.h> |
377 | jermar | 40 | |
378 | jermar | 41 | #define BUDDY_SYSTEM_INNER_BLOCK 0xff |
42 | |||
2083 | decky | 43 | struct buddy_system; |
44 | |||
1139 | jermar | 45 | /** Buddy system operations to be implemented by each implementation. */ |
2083 | decky | 46 | typedef struct { |
2106 | jermar | 47 | /** |
48 | * Return pointer to left-side or right-side buddy for block passed as |
||
49 | * argument. |
||
50 | */ |
||
2083 | decky | 51 | link_t *(* find_buddy)(struct buddy_system *, link_t *); |
2106 | jermar | 52 | /** |
53 | * Bisect the block passed as argument and return pointer to the new |
||
54 | * right-side buddy. |
||
55 | */ |
||
2083 | decky | 56 | link_t *(* bisect)(struct buddy_system *, link_t *); |
2059 | jermar | 57 | /** Coalesce two buddies into a bigger block. */ |
2083 | decky | 58 | link_t *(* coalesce)(struct buddy_system *, link_t *, link_t *); |
2059 | jermar | 59 | /** Set order of block passed as argument. */ |
2083 | decky | 60 | void (*set_order)(struct buddy_system *, link_t *, uint8_t); |
2059 | jermar | 61 | /** Return order of block passed as argument. */ |
2083 | decky | 62 | uint8_t (*get_order)(struct buddy_system *, link_t *); |
2059 | jermar | 63 | /** Mark block as busy. */ |
2083 | decky | 64 | void (*mark_busy)(struct buddy_system *, link_t *); |
2059 | jermar | 65 | /** Mark block as available. */ |
2083 | decky | 66 | void (*mark_available)(struct buddy_system *, link_t *); |
814 | palkovsky | 67 | /** Find parent of block that has given order */ |
2083 | decky | 68 | link_t *(* find_block)(struct buddy_system *, link_t *, uint8_t); |
69 | void (* print_id)(struct buddy_system *, link_t *); |
||
70 | } buddy_system_operations_t; |
||
377 | jermar | 71 | |
2083 | decky | 72 | typedef struct buddy_system { |
2059 | jermar | 73 | /** Maximal order of block which can be stored by buddy system. */ |
74 | uint8_t max_order; |
||
377 | jermar | 75 | link_t *order; |
381 | jermar | 76 | buddy_system_operations_t *op; |
2059 | jermar | 77 | /** Pointer to be used by the implementation. */ |
78 | void *data; |
||
2083 | decky | 79 | } buddy_system_t; |
377 | jermar | 80 | |
2059 | jermar | 81 | extern void buddy_system_create(buddy_system_t *b, uint8_t max_order, |
2106 | jermar | 82 | buddy_system_operations_t *op, void *data); |
1780 | jermar | 83 | extern link_t *buddy_system_alloc(buddy_system_t *b, uint8_t i); |
84 | extern bool buddy_system_can_alloc(buddy_system_t *b, uint8_t order); |
||
377 | jermar | 85 | extern void buddy_system_free(buddy_system_t *b, link_t *block); |
686 | bondari | 86 | extern void buddy_system_structure_print(buddy_system_t *b, size_t elem_size); |
814 | palkovsky | 87 | extern size_t buddy_conf_size(int max_order); |
88 | extern link_t *buddy_system_alloc_block(buddy_system_t *b, link_t *block); |
||
377 | jermar | 89 | |
90 | #endif |
||
1702 | cejka | 91 | |
1888 | jermar | 92 | /** @} |
1702 | cejka | 93 | */ |