Subversion Repositories HelenOS

Rev

Rev 1702 | Rev 1787 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 1702 Rev 1780
1
/*
1
/*
2
 * Copyright (C) 2005 Jakub Jermar
2
 * Copyright (C) 2005 Jakub Jermar
3
 * All rights reserved.
3
 * All rights reserved.
4
 *
4
 *
5
 * Redistribution and use in source and binary forms, with or without
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
6
 * modification, are permitted provided that the following conditions
7
 * are met:
7
 * are met:
8
 *
8
 *
9
 * - Redistributions of source code must retain the above copyright
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
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
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.
15
 *   derived from this software without specific prior written permission.
16
 *
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
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
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
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
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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
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.
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
27
 */
28
 
28
 
29
 /** @addtogroup genericmm
29
 /** @addtogroup genericmm
30
 * @{
30
 * @{
31
 */
31
 */
32
/** @file
32
/** @file
33
 */
33
 */
34
 
34
 
35
#ifndef __BUDDY_H__
35
#ifndef __BUDDY_H__
36
#define __BUDDY_H__
36
#define __BUDDY_H__
37
 
37
 
38
#include <arch/types.h>
38
#include <arch/types.h>
39
#include <typedefs.h>
39
#include <typedefs.h>
40
 
40
 
41
#define BUDDY_SYSTEM_INNER_BLOCK    0xff
41
#define BUDDY_SYSTEM_INNER_BLOCK    0xff
42
 
42
 
43
/** Buddy system operations to be implemented by each implementation. */
43
/** Buddy system operations to be implemented by each implementation. */
44
struct buddy_system_operations {
44
struct buddy_system_operations {
45
    link_t *(* find_buddy)(buddy_system_t *, link_t *);     /**< Return pointer to left-side or right-side buddy for block passed as argument. */
45
    link_t *(* find_buddy)(buddy_system_t *, link_t *);     /**< Return pointer to left-side or right-side buddy for block passed as argument. */
46
    link_t *(* bisect)(buddy_system_t *, link_t *);         /**< Bisect the block passed as argument and return pointer to the new right-side buddy. */
46
    link_t *(* bisect)(buddy_system_t *, link_t *);         /**< Bisect the block passed as argument and return pointer to the new right-side buddy. */
47
    link_t *(* coalesce)(buddy_system_t *, link_t *, link_t *); /**< Coalesce two buddies into a bigger block. */
47
    link_t *(* coalesce)(buddy_system_t *, link_t *, link_t *); /**< Coalesce two buddies into a bigger block. */
48
    void (*set_order)(buddy_system_t *, link_t *, __u8);        /**< Set order of block passed as argument. */
48
    void (*set_order)(buddy_system_t *, link_t *, uint8_t);     /**< Set order of block passed as argument. */
49
    __u8 (*get_order)(buddy_system_t *, link_t *);          /**< Return order of block passed as argument. */
49
    uint8_t (*get_order)(buddy_system_t *, link_t *);           /**< Return order of block passed as argument. */
50
    void (*mark_busy)(buddy_system_t *, link_t *);          /**< Mark block as busy. */
50
    void (*mark_busy)(buddy_system_t *, link_t *);          /**< Mark block as busy. */
51
    void (*mark_available)(buddy_system_t *, link_t *);     /**< Mark block as available. */
51
    void (*mark_available)(buddy_system_t *, link_t *);     /**< Mark block as available. */
52
    /** Find parent of block that has given order  */
52
    /** Find parent of block that has given order  */
53
    link_t *(* find_block)(buddy_system_t *, link_t *, __u8);
53
    link_t *(* find_block)(buddy_system_t *, link_t *, uint8_t);
54
    void (* print_id)(buddy_system_t *, link_t *);
54
    void (* print_id)(buddy_system_t *, link_t *);
55
};
55
};
56
 
56
 
57
struct buddy_system {
57
struct buddy_system {
58
    __u8 max_order;             /**< Maximal order of block which can be stored by buddy system. */
58
    uint8_t max_order;              /**< Maximal order of block which can be stored by buddy system. */
59
    link_t *order;
59
    link_t *order;
60
    buddy_system_operations_t *op;
60
    buddy_system_operations_t *op;
61
    void *data;             /**< Pointer to be used by the implementation. */
61
    void *data;             /**< Pointer to be used by the implementation. */
62
};
62
};
63
 
63
 
64
extern void buddy_system_create(buddy_system_t *b,
64
extern void buddy_system_create(buddy_system_t *b,
65
                __u8 max_order,
65
                uint8_t max_order,
66
                buddy_system_operations_t *op, void *data);
66
                buddy_system_operations_t *op, void *data);
67
extern link_t *buddy_system_alloc(buddy_system_t *b, __u8 i);
67
extern link_t *buddy_system_alloc(buddy_system_t *b, uint8_t i);
68
extern bool buddy_system_can_alloc(buddy_system_t *b, __u8 order);
68
extern bool buddy_system_can_alloc(buddy_system_t *b, uint8_t order);
69
extern void buddy_system_free(buddy_system_t *b, link_t *block);
69
extern void buddy_system_free(buddy_system_t *b, link_t *block);
70
extern void buddy_system_structure_print(buddy_system_t *b, size_t elem_size);
70
extern void buddy_system_structure_print(buddy_system_t *b, size_t elem_size);
71
extern size_t buddy_conf_size(int max_order);
71
extern size_t buddy_conf_size(int max_order);
72
extern link_t *buddy_system_alloc_block(buddy_system_t *b, link_t *block);
72
extern link_t *buddy_system_alloc_block(buddy_system_t *b, link_t *block);
73
 
73
 
74
#endif
74
#endif
75
 
75
 
76
 /** @}
76
 /** @}
77
 */
77
 */
78
 
78
 
79
 
79