WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/mm/buddy.c


/*
 * 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.
 */
 
#include <mm/buddy.h>
#include <mm/frame.h>
#include <mm/heap.h>
#include <arch/types.h>
#include <typedefs.h>
#include <adt/list.h>
#include <debug.h>
#include <print.h>
 
/** Create buddy system
 *
 * Allocate memory for and initialize new buddy system.
 *
 * @param max_order The biggest allocable size will be 2^max_order.
 * @param op Operations for new buddy system.
 * @param data Pointer to be used by implementation.
 *
 * @return New buddy system.
 */
buddy_system_t *buddy_system_create(__u8 max_order, buddy_system_operations_t *op, void *data)
{
    buddy_system_t *b;
    int i;
 
    ASSERT(max_order < BUDDY_SYSTEM_INNER_BLOCK);
 
    ASSERT(op->find_buddy);
    ASSERT(op->set_order);
    ASSERT(op->get_order);
    ASSERT(op->bisect);
    ASSERT(op->coalesce);
    ASSERT(op->mark_busy);
 
    /*
     * Allocate memory for structure describing the whole buddy system.
     */
    b = (buddy_system_t *) early_malloc(sizeof(buddy_system_t));
   
    if (b) {
        /*
         * Allocate memory for all orders this buddy system will work with.
         */
        b->order = (link_t *) early_malloc((max_order + 1) * sizeof(link_t));
        if (!b->order) {
            early_free(b);
            return NULL;
        }
   
        for (i = 0; i <= max_order; i++)
            list_initialize(&b->order[i]);
   
        b->max_order = max_order;
        b->op = op;
        b->data = data;
    }
   
    return b;
}
 
/** Check if buddy system can allocate block
 *
 * @param b Buddy system pointer
 * @param i Size of the block (2^i)
 *
 * @return True if block can be allocated
 */
bool buddy_system_can_alloc(buddy_system_t *b, __u8 i) {
    __u8 k;
   
    /*
     * If requested block is greater then maximal block
     * we know immediatly that we cannot satisfy the request.
     */
    if (i > b->max_order) return false;
 
    /*
     * Check if any bigger or equal order has free elements
     */
    for (k=i; k <= b->max_order; k++) {
        if (!list_empty(&b->order[k])) {
            return true;
        }
    }
   
    return false;
   
}
 
/** Allocate block from buddy system.
 *
 * @param b Buddy system pointer.
 * @param i Returned block will be 2^i big.
 *
 * @return Block of data represented by link_t.
 */
link_t *buddy_system_alloc(buddy_system_t *b, __u8 i)
{
    link_t *res, *hlp;
 
    ASSERT(i <= b->max_order);
 
    /*
     * If the list of order i is not empty,
     * the request can be immediatelly satisfied.
     */
    if (!list_empty(&b->order[i])) {
        res = b->order[i].next;
        list_remove(res);
        b->op->mark_busy(b, res);
        return res;
    }
   
    /*
     * If order i is already the maximal order,
     * the request cannot be satisfied.
     */
    if (i == b->max_order)
        return NULL;
 
    /*
     * Try to recursively satisfy the request from higher order lists.
     */
    hlp = buddy_system_alloc(b, i + 1);
   
    /*
     * The request could not be satisfied
     * from higher order lists.
     */
    if (!hlp)
        return NULL;
       
    res = hlp;
   
    /*
     * Bisect the block and set order of both of its parts to i.
     */
    hlp = b->op->bisect(b, res);
    b->op->set_order(b, res, i);
    b->op->set_order(b, hlp, i);
   
    /*
     * Return the other half to buddy system.
     * PROBLEM!!!! WILL FIND OTHER PART AS BUDDY AND LINK TOGETHER
     */
    b->op->mark_busy(b, res);
    buddy_system_free(b, hlp);
   
    return res;
   
}
 
/** Return block to buddy system.
 *
 * @param b Buddy system pointer.
 * @param block Block to return.
 */
void buddy_system_free(buddy_system_t *b, link_t *block)
{
    link_t *buddy, *hlp;
    __u8 i;
 
    /*
     * Determine block's order.
     */
    i = b->op->get_order(b, block);
 
    ASSERT(i <= b->max_order);
 
    if (i != b->max_order) {
        /*
         * See if there is any buddy in the list of order i.
         */
        buddy = b->op->find_buddy(b, block);
        if (buddy) {
 
            ASSERT(b->op->get_order(b, buddy) == i);
            /*
             * Remove buddy from the list of order i.
             */
            list_remove(buddy);
       
            /*
             * Invalidate order of both block and buddy.
             */
            b->op->set_order(b, block, BUDDY_SYSTEM_INNER_BLOCK);
            b->op->set_order(b, buddy, BUDDY_SYSTEM_INNER_BLOCK);
       
            /*
             * Coalesce block and buddy into one block.
             */
            hlp = b->op->coalesce(b, block, buddy);
 
            /*
             * Set order of the coalesced block to i + 1.
             */
            b->op->set_order(b, hlp, i + 1);
 
            /*
             * Recursively add the coalesced block to the list of order i + 1.
             */
            buddy_system_free(b, hlp);
            return;
        }
    }
 
    /*
     * Insert block into the list of order i.
     */
    list_append(block, &b->order[i]);
 
}
 
/** Prints out structure of buddy system
 *
 * @param b Pointer to buddy system
 * @param es Element size
 */
void buddy_system_structure_print(buddy_system_t *b, size_t elem_size) {
    index_t i;
    count_t cnt, elem_count = 0, block_count = 0;
    link_t * cur;
   
 
    printf("Order\tBlocks\tSize    \tBlock size\tElems per block\n");
    printf("-----\t------\t--------\t----------\t---------------\n");
   
    for (i=0;i <= b->max_order; i++) {
        cnt = 0;
        if (!list_empty(&b->order[i])) {
            for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next)
                cnt++;
        }
   
        printf("#%d\t%d\t%dK\t\t%dK\t\t%d\n", i, cnt, (cnt * (1 << i) * elem_size) >> 10, ((1 << i) * elem_size) >> 10, 1 << i);
       
        block_count += cnt;
        elem_count += (1 << i) * cnt;
    }
    printf("-----\t------\t--------\t----------\t---------------\n");
    printf("Buddy system contains %d free elements (%d blocks)\n" , elem_count, block_count);
 
}
 

Rev 788	Rev 813
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	#include <mm/buddy.h>	29	#include <mm/buddy.h>
30	#include <mm/frame.h>	30	#include <mm/frame.h>
31	#include <mm/heap.h>	31	#include <mm/heap.h>
32	#include <arch/types.h>	32	#include <arch/types.h>
33	#include <typedefs.h>	33	#include <typedefs.h>
34	#include <adt/list.h>	34	#include <adt/list.h>
35	#include <debug.h>	35	#include <debug.h>
36	#include <print.h>	36	#include <print.h>
37		37
38	/** Create buddy system	38	/** Create buddy system
39	*	39	*
40	* Allocate memory for and initialize new buddy system.	40	* Allocate memory for and initialize new buddy system.
41	*	41	*
42	* @param max_order The biggest allocable size will be 2^max_order.	42	* @param max_order The biggest allocable size will be 2^max_order.
43	* @param op Operations for new buddy system.	43	* @param op Operations for new buddy system.
44	* @param data Pointer to be used by implementation.	44	* @param data Pointer to be used by implementation.
45	*	45	*
46	* @return New buddy system.	46	* @return New buddy system.
47	*/	47	*/
48	buddy_system_t buddy_system_create(__u8 max_order, buddy_system_operations_t op, void *data)	48	buddy_system_t buddy_system_create(__u8 max_order, buddy_system_operations_t op, void *data)
49	{	49	{
50	buddy_system_t *b;	50	buddy_system_t *b;
51	int i;	51	int i;
52		52
53	ASSERT(max_order < BUDDY_SYSTEM_INNER_BLOCK);	53	ASSERT(max_order < BUDDY_SYSTEM_INNER_BLOCK);
54		54
55	ASSERT(op->find_buddy);	55	ASSERT(op->find_buddy);
56	ASSERT(op->set_order);	56	ASSERT(op->set_order);
57	ASSERT(op->get_order);	57	ASSERT(op->get_order);
58	ASSERT(op->bisect);	58	ASSERT(op->bisect);
59	ASSERT(op->coalesce);	59	ASSERT(op->coalesce);
60	ASSERT(op->mark_busy);	60	ASSERT(op->mark_busy);
61		61
62	/*	62	/*
63	* Allocate memory for structure describing the whole buddy system.	63	* Allocate memory for structure describing the whole buddy system.
64	*/	64	*/
65	b = (buddy_system_t *) early_malloc(sizeof(buddy_system_t));	65	b = (buddy_system_t *) early_malloc(sizeof(buddy_system_t));
66		66
67	if (b) {	67	if (b) {
68	/*	68	/*
69	* Allocate memory for all orders this buddy system will work with.	69	* Allocate memory for all orders this buddy system will work with.
70	*/	70	*/
71	b->order = (link_t ) early_malloc((max_order + 1) sizeof(link_t));	71	b->order = (link_t ) early_malloc((max_order + 1) sizeof(link_t));
72	if (!b->order) {	72	if (!b->order) {
73	early_free(b);	73	early_free(b);
74	return NULL;	74	return NULL;
75	}	75	}
76		76
77	for (i = 0; i <= max_order; i++)	77	for (i = 0; i <= max_order; i++)
78	list_initialize(&b->order[i]);	78	list_initialize(&b->order[i]);
79		79
80	b->max_order = max_order;	80	b->max_order = max_order;
81	b->op = op;	81	b->op = op;
82	b->data = data;	82	b->data = data;
83	}	83	}
84		84
85	return b;	85	return b;
86	}	86	}
87		87
88	/** Check if buddy system can allocate block	88	/** Check if buddy system can allocate block
89	*	89	*
90	* @param b Buddy system pointer	90	* @param b Buddy system pointer
91	* @param i Size of the block (2^i)	91	* @param i Size of the block (2^i)
92	*	92	*
93	* @return True if block can be allocated	93	* @return True if block can be allocated
94	*/	94	*/
95	bool buddy_system_can_alloc(buddy_system_t *b, __u8 i) {	95	bool buddy_system_can_alloc(buddy_system_t *b, __u8 i) {
96	__u8 k;	96	__u8 k;
97		97
98	/*	98	/*
99	* If requested block is greater then maximal block	99	* If requested block is greater then maximal block
100	* we know immediatly that we cannot satisfy the request.	100	* we know immediatly that we cannot satisfy the request.
101	*/	101	*/
102	if (i > b->max_order) return false;	102	if (i > b->max_order) return false;
103		103
104	/*	104	/*
105	* Check if any bigger or equal order has free elements	105	* Check if any bigger or equal order has free elements
106	*/	106	*/
107	for (k=i; k <= b->max_order; k++) {	107	for (k=i; k <= b->max_order; k++) {
108	if (!list_empty(&b->order[k])) {	108	if (!list_empty(&b->order[k])) {
109	return true;	109	return true;
110	}	110	}
111	}	111	}
112		112
113	return false;	113	return false;
114		114
115	}	115	}
116		116
117	/** Allocate block from buddy system.	117	/** Allocate block from buddy system.
118	*	118	*
119	* @param b Buddy system pointer.	119	* @param b Buddy system pointer.
120	* @param i Returned block will be 2^i big.	120	* @param i Returned block will be 2^i big.
121	*	121	*
122	* @return Block of data represented by link_t.	122	* @return Block of data represented by link_t.
123	*/	123	*/
124	link_t buddy_system_alloc(buddy_system_t b, __u8 i)	124	link_t buddy_system_alloc(buddy_system_t b, __u8 i)
125	{	125	{
126	link_t res, hlp;	126	link_t res, hlp;
127		127
128	ASSERT(i <= b->max_order);	128	ASSERT(i <= b->max_order);
129		129
130	/*	130	/*
131	* If the list of order i is not empty,	131	* If the list of order i is not empty,
132	* the request can be immediatelly satisfied.	132	* the request can be immediatelly satisfied.
133	*/	133	*/
134	if (!list_empty(&b->order[i])) {	134	if (!list_empty(&b->order[i])) {
135	res = b->order[i].next;	135	res = b->order[i].next;
136	list_remove(res);	136	list_remove(res);
137	b->op->mark_busy(b, res);	137	b->op->mark_busy(b, res);
138	return res;	138	return res;
139	}	139	}
140		140
141	/*	141	/*
142	* If order i is already the maximal order,	142	* If order i is already the maximal order,
143	* the request cannot be satisfied.	143	* the request cannot be satisfied.
144	*/	144	*/
145	if (i == b->max_order)	145	if (i == b->max_order)
146	return NULL;	146	return NULL;
147		147
148	/*	148	/*
149	* Try to recursively satisfy the request from higher order lists.	149	* Try to recursively satisfy the request from higher order lists.
150	*/	150	*/
151	hlp = buddy_system_alloc(b, i + 1);	151	hlp = buddy_system_alloc(b, i + 1);
152		152
153	/*	153	/*
154	* The request could not be satisfied	154	* The request could not be satisfied
155	* from higher order lists.	155	* from higher order lists.
156	*/	156	*/
157	if (!hlp)	157	if (!hlp)
158	return NULL;	158	return NULL;
159		159
160	res = hlp;	160	res = hlp;
161		161
162	/*	162	/*
163	* Bisect the block and set order of both of its parts to i.	163	* Bisect the block and set order of both of its parts to i.
164	*/	164	*/
165	hlp = b->op->bisect(b, res);	165	hlp = b->op->bisect(b, res);
166	b->op->set_order(b, res, i);	166	b->op->set_order(b, res, i);
167	b->op->set_order(b, hlp, i);	167	b->op->set_order(b, hlp, i);
168		168
169	/*	169	/*
170	* Return the other half to buddy system.	170	* Return the other half to buddy system.
171	* PROBLEM!!!! FILL FIND OTHER PART AS BUDDY AND LINK TOGETHER	171	* PROBLEM!!!! WILL FIND OTHER PART AS BUDDY AND LINK TOGETHER
172	*/	172	*/
173	b->op->mark_busy(b, res);	173	b->op->mark_busy(b, res);
174	buddy_system_free(b, hlp);	174	buddy_system_free(b, hlp);
175		175
176	return res;	176	return res;
177		177
178	}	178	}
179		179
180	/** Return block to buddy system.	180	/** Return block to buddy system.
181	*	181	*
182	* @param b Buddy system pointer.	182	* @param b Buddy system pointer.
183	* @param block Block to return.	183	* @param block Block to return.
184	*/	184	*/
185	void buddy_system_free(buddy_system_t b, link_t block)	185	void buddy_system_free(buddy_system_t b, link_t block)
186	{	186	{
187	link_t buddy, hlp;	187	link_t buddy, hlp;
188	__u8 i;	188	__u8 i;
189		189
190	/*	190	/*
191	* Determine block's order.	191	* Determine block's order.
192	*/	192	*/
193	i = b->op->get_order(b, block);	193	i = b->op->get_order(b, block);
194		194
195	ASSERT(i <= b->max_order);	195	ASSERT(i <= b->max_order);
196		196
197	if (i != b->max_order) {	197	if (i != b->max_order) {
198	/*	198	/*
199	* See if there is any buddy in the list of order i.	199	* See if there is any buddy in the list of order i.
200	*/	200	*/
201	buddy = b->op->find_buddy(b, block);	201	buddy = b->op->find_buddy(b, block);
202	if (buddy) {	202	if (buddy) {
203		203
204	ASSERT(b->op->get_order(b, buddy) == i);	204	ASSERT(b->op->get_order(b, buddy) == i);
205	/*	205	/*
206	* Remove buddy from the list of order i.	206	* Remove buddy from the list of order i.
207	*/	207	*/
208	list_remove(buddy);	208	list_remove(buddy);
209		209
210	/*	210	/*
211	* Invalidate order of both block and buddy.	211	* Invalidate order of both block and buddy.
212	*/	212	*/
213	b->op->set_order(b, block, BUDDY_SYSTEM_INNER_BLOCK);	213	b->op->set_order(b, block, BUDDY_SYSTEM_INNER_BLOCK);
214	b->op->set_order(b, buddy, BUDDY_SYSTEM_INNER_BLOCK);	214	b->op->set_order(b, buddy, BUDDY_SYSTEM_INNER_BLOCK);
215		215
216	/*	216	/*
217	* Coalesce block and buddy into one block.	217	* Coalesce block and buddy into one block.
218	*/	218	*/
219	hlp = b->op->coalesce(b, block, buddy);	219	hlp = b->op->coalesce(b, block, buddy);
220		220
221	/*	221	/*
222	* Set order of the coalesced block to i + 1.	222	* Set order of the coalesced block to i + 1.
223	*/	223	*/
224	b->op->set_order(b, hlp, i + 1);	224	b->op->set_order(b, hlp, i + 1);
225		225
226	/*	226	/*
227	* Recursively add the coalesced block to the list of order i + 1.	227	* Recursively add the coalesced block to the list of order i + 1.
228	*/	228	*/
229	buddy_system_free(b, hlp);	229	buddy_system_free(b, hlp);
230	return;	230	return;
231	}	231	}
232	}	232	}
233		233
234	/*	234	/*
235	* Insert block into the list of order i.	235	* Insert block into the list of order i.
236	*/	236	*/
237	list_append(block, &b->order[i]);	237	list_append(block, &b->order[i]);
238		238
239	}	239	}
240		240
241	/** Prints out structure of buddy system	241	/** Prints out structure of buddy system
242	*	242	*
243	* @param b Pointer to buddy system	243	* @param b Pointer to buddy system
244	* @param es Element size	244	* @param es Element size
245	*/	245	*/
246	void buddy_system_structure_print(buddy_system_t *b, size_t elem_size) {	246	void buddy_system_structure_print(buddy_system_t *b, size_t elem_size) {
247	index_t i;	247	index_t i;
248	count_t cnt, elem_count = 0, block_count = 0;	248	count_t cnt, elem_count = 0, block_count = 0;
249	link_t * cur;	249	link_t * cur;
250		250
251		251
252	printf("Order\tBlocks\tSize \tBlock size\tElems per block\n");	252	printf("Order\tBlocks\tSize \tBlock size\tElems per block\n");
253	printf("-----\t------\t--------\t----------\t---------------\n");	253	printf("-----\t------\t--------\t----------\t---------------\n");
254		254
255	for (i=0;i <= b->max_order; i++) {	255	for (i=0;i <= b->max_order; i++) {
256	cnt = 0;	256	cnt = 0;
257	if (!list_empty(&b->order[i])) {	257	if (!list_empty(&b->order[i])) {
258	for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next)	258	for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next)
259	cnt++;	259	cnt++;
260	}	260	}
261		261
262	printf("#%d\t%d\t%dK\t\t%dK\t\t%d\n", i, cnt, (cnt * (1 << i) * elem_size) >> 10, ((1 << i) * elem_size) >> 10, 1 << i);	262	printf("#%d\t%d\t%dK\t\t%dK\t\t%d\n", i, cnt, (cnt * (1 << i) * elem_size) >> 10, ((1 << i) * elem_size) >> 10, 1 << i);
263		263
264	block_count += cnt;	264	block_count += cnt;
265	elem_count += (1 << i) * cnt;	265	elem_count += (1 << i) * cnt;
266	}	266	}
267	printf("-----\t------\t--------\t----------\t---------------\n");	267	printf("-----\t------\t--------\t----------\t---------------\n");
268	printf("Buddy system contains %d free elements (%d blocks)\n" , elem_count, block_count);	268	printf("Buddy system contains %d free elements (%d blocks)\n" , elem_count, block_count);
269		269
270	}	270	}
271		271

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/buddy.c – Rev 788 → 813