WebSVN – HelenOS – Diff – /trunk/kernel/generic/include/mm/buddy.h


/*
 * Copyright (C) 2005 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.
 */
 
#ifndef __BUDDY_H__
#define __BUDDY_H__
 
#include <arch/types.h>
#include <typedefs.h>
 
#define BUDDY_SYSTEM_INNER_BLOCK    0xff
 
/** Buddy system operations to be implemented by each implementations. */
struct buddy_system_operations {
    link_t *(* find_buddy)(buddy_system_t *, link_t *);     /**< Return pointer to left-side or right-side buddy for block passed as argument. */
    link_t *(* bisect)(buddy_system_t *, link_t *);         /**< Bisect the block passed as argument and return pointer to the new right-side buddy. */
    link_t *(* coalesce)(buddy_system_t *, link_t *, link_t *); /**< Coalesce two buddies into a bigger block. */
    void (*set_order)(buddy_system_t *, link_t *, __u8);        /**< Set order of block passed as argument. */
    __u8 (*get_order)(buddy_system_t *, link_t *);          /**< Return order of block passed as argument. */
    void (*mark_busy)(buddy_system_t *, link_t *);          /**< Mark block as busy */
    void (*mark_available)(buddy_system_t *, link_t *);         /**< Mark block as busy */
    /** Find parent of block that has given order  */
    link_t *(* find_block)(buddy_system_t *, link_t *, __u8);
};
 
struct buddy_system {
    __u8 max_order;             /**< Maximal order of block which can be stored by buddy system. */
    link_t *order;
    buddy_system_operations_t *op;
    void *data;             /**< Pointer to be used by the implementation. */
};
 
extern void buddy_system_create(buddy_system_t *b,
                __u8 max_order,
                buddy_system_operations_t *op, void *data);
extern link_t *buddy_system_alloc(buddy_system_t *b, __u8 i);
extern bool buddy_system_can_alloc(buddy_system_t *b, __u8 order);
extern void buddy_system_free(buddy_system_t *b, link_t *block);
extern void buddy_system_structure_print(buddy_system_t *b, size_t elem_size);
extern size_t buddy_conf_size(int max_order);
extern link_t *buddy_system_alloc_block(buddy_system_t *b, link_t *block);
 
#endif
 

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/include/mm/buddy.h @ 2267 – Rev 756 → 814

Rev 756		Rev 814
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	#ifndef __BUDDY_H__	29	#ifndef __BUDDY_H__
30	#define __BUDDY_H__	30	#define __BUDDY_H__
31		31
32	#include <arch/types.h>	32	#include <arch/types.h>
33	#include <typedefs.h>	33	#include <typedefs.h>
34		34
35	#define BUDDY_SYSTEM_INNER_BLOCK 0xff	35	#define BUDDY_SYSTEM_INNER_BLOCK 0xff
36		36
37	/** Buddy system operations to be implemented by each implementations. */	37	/** Buddy system operations to be implemented by each implementations. */
38	struct buddy_system_operations {	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. /	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. /	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. /	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. /	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. /	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 /	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);
45	};	48	};
46		49
47	struct buddy_system {	50	struct buddy_system {
48	__u8 max_order; /*< Maximal order of block which can be stored by buddy system. /	51	__u8 max_order; /*< Maximal order of block which can be stored by buddy system. /
49	link_t *order;	52	link_t *order;
50	buddy_system_operations_t *op;	53	buddy_system_operations_t *op;
51	void data; /< Pointer to be used by the implementation. /	54	void data; /< Pointer to be used by the implementation. /
52	};	55	};
53		56
54	extern buddy_system_t buddy_system_create(__u8 max_order, buddy_system_operations_t op, void *data);	57	extern void buddy_system_create(buddy_system_t *b,
-		58	__u8 max_order,
-		59	buddy_system_operations_t op, void data);
55	extern link_t buddy_system_alloc(buddy_system_t b, __u8 i);	60	extern link_t buddy_system_alloc(buddy_system_t b, __u8 i);
56	extern bool buddy_system_can_alloc(buddy_system_t *b, __u8 order);	61	extern bool buddy_system_can_alloc(buddy_system_t *b, __u8 order);
57	extern void buddy_system_free(buddy_system_t b, link_t block);	62	extern void buddy_system_free(buddy_system_t b, link_t block);
58	extern void buddy_system_structure_print(buddy_system_t *b, size_t elem_size);	63	extern void buddy_system_structure_print(buddy_system_t *b, size_t elem_size);
-		64	extern size_t buddy_conf_size(int max_order);
-		65	extern link_t buddy_system_alloc_block(buddy_system_t b, link_t *block);
59		66
60	#endif	67	#endif
61		68