Subversion Repositories shark

Rev

Details | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 pj 1
/*
2
 * Project: S.Ha.R.K.
3
 *
4
 * Coordinators:
5
 *   Giorgio Buttazzo    <giorgio@sssup.it>
6
 *   Paolo Gai           <pj@gandalf.sssup.it>
7
 *
8
 * Authors     :
9
 *   Paolo Gai           <pj@gandalf.sssup.it>
10
 *   (see the web pages for full authors list)
11
 *
12
 * ReTiS Lab (Scuola Superiore S.Anna - Pisa - Italy)
13
 *
14
 * http://www.sssup.it
15
 * http://retis.sssup.it
16
 * http://shark.sssup.it
17
 */
18
 
19
/**
20
 ------------
21
 CVS :        $Id: alloc.c,v 1.1.1.1 2002-03-29 14:12:52 pj Exp $
22
 
23
 File:        $File$
24
 Revision:    $Revision: 1.1.1.1 $
25
 Last update: $Date: 2002-03-29 14:12:52 $
26
 ------------
27
 
28
this code is from:
29
List-based Memory Management, from OsKit.
30
 
31
**/
32
 
33
/*
34
 * Copyright (C) 2000 Paolo Gai
35
 *
36
 * This program is free software; you can redistribute it and/or modify
37
 * it under the terms of the GNU General Public License as published by
38
 * the Free Software Foundation; either version 2 of the License, or
39
 * (at your option) any later version.
40
 *
41
 * This program is distributed in the hope that it will be useful,
42
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
43
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
44
 * GNU General Public License for more details.
45
 *
46
 * You should have received a copy of the GNU General Public License
47
 * along with this program; if not, write to the Free Software
48
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
49
 *
50
 */
51
 
52
/*
53
 * Copyright (c) 1995-1996, 1998-1999 University of Utah and the Flux Group.
54
 * All rights reserved.
55
 *
56
 * This file is part of the Flux OSKit.  The OSKit is free software, also known
57
 * as "open source;" you can redistribute it and/or modify it under the terms
58
 * of the GNU General Public License (GPL), version 2, as published by the Free
59
 * Software Foundation (FSF).  To explore alternate licensing terms, contact
60
 * the University of Utah at csl-dist@cs.utah.edu or +1-801-585-3271.
61
 *
62
 * The OSKit is distributed in the hope that it will be useful, but WITHOUT ANY
63
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
64
 * FOR A PARTICULAR PURPOSE.  See the GPL for more details.  You should have
65
 * received a copy of the GPL along with the OSKit; see the file COPYING.  If
66
 * not, write to the FSF, 59 Temple Place #330, Boston, MA 02111-1307, USA.
67
 */
68
 
69
#include <kernel/lmm.h>
70
#define assert(test) assertk(test)
71
 
72
void *lmm_alloc(lmm_t *lmm, size_t size, lmm_flags_t flags)
73
{
74
        struct lmm_region *reg;
75
 
76
        assert(lmm != 0);
77
        assert(size > 0);
78
 
79
        size = (size + ALIGN_MASK) & ~ALIGN_MASK;
80
 
81
        for (reg = lmm->regions; reg; reg = reg->next)
82
        {
83
                struct lmm_node **nodep, *node;
84
 
85
                CHECKREGPTR(reg);
86
 
87
                if (flags & ~reg->flags)
88
                        continue;
89
 
90
                for (nodep = &reg->nodes;
91
                     (node = *nodep) != 0;
92
                     nodep = &node->next)
93
                {
94
                        assert(((DWORD)node & ALIGN_MASK) == 0);
95
                        assert(((DWORD)node->size & ALIGN_MASK) == 0);
96
                        assert((node->next == 0) || (node->next > node));
97
                        assert((DWORD)node < reg->max);
98
 
99
                        if (node->size >= size)
100
                        {
101
                                if (node->size > size)
102
                                {
103
                                        struct lmm_node *newnode;
104
 
105
                                        /* Split the node and return its head */
106
                                        newnode = (struct lmm_node*)
107
                                                        ((void*)node + size);
108
                                        newnode->next = node->next;
109
                                        newnode->size = node->size - size;
110
                                        *nodep = newnode;
111
                                }
112
                                else
113
                                {
114
                                        /* Remove and return the entire node. */
115
                                        *nodep = node->next;
116
                                }
117
 
118
                                /* Adjust the region's free memory counter.  */
119
                                assert(reg->free >= size);
120
                                reg->free -= size;
121
 
122
                                return (void*)node;
123
                        }
124
                }
125
        }
126
 
127
        return 0;
128
}
129