Subversion Repositories shark

Rev

Rev 3 | Details | Compare with Previous | 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: addfree.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, 1998 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_add_free(lmm_t *lmm, void *block, size_t size)
73
{
74
        struct lmm_region *reg;
75
        DWORD min = (DWORD)block;
76
        DWORD max = min + size;
77
 
78
        /* Restrict the min and max further to be properly aligned.
79
           Note that this is the opposite of what lmm_free() does,
80
           because lmm_free() assumes the block was allocated with lmm_alloc()
81
           and thus would be a subset of a larger, already-aligned free block.
82
           Here we can assume no such thing.  */
83
        min = (min + ALIGN_MASK) & ~ALIGN_MASK;
84
        max &= ~ALIGN_MASK;
85
        assert(max >= min);
86
 
87
        /* If after alignment we have nothing left, we're done.  */
88
        if (max == min)
89
                return;
90
 
91
        /* Add the block to the free list(s) of whatever region(s) it overlaps.
92
           If some or all of the block doesn't fall into any existing region,
93
           then that memory is simply dropped on the floor.  */
94
        for (reg = lmm->regions; reg; reg = reg->next)
95
        {
96
                assert(reg->min < reg->max);
97
                assert((reg->min & ALIGN_MASK) == 0);
98
                assert((reg->max & ALIGN_MASK) == 0);
99
 
100
                if ((max > reg->min) && (min < reg->max))
101
                {
102
                        DWORD new_min = min, new_max = max;
103
 
104
                        /* Only add the part of the block
105
                           that actually falls within this region.  */
106
                        if (new_min < reg->min)
107
                                new_min = reg->min;
108
                        if (new_max > reg->max)
109
                                new_max = reg->max;
110
                        assert(new_max > new_min);
111
 
112
                        /* Add the block.  */
113
                        lmm_free(lmm, (void*)new_min, new_max - new_min);
114
                }
115
        }
116
}
117