source: trunk/kernel/mm/khm.c @ 243

Last change on this file since 243 was 175, checked in by max@…, 7 years ago

detect use-after-frees

File size: 4.3 KB
RevLine 
[1]1/*
2 * khm.c - kernel heap manager implementation.
[18]3 *
[1]4 * Authors  Ghassan Almaless (2008,2009,2010,2011,2012)
5 *          Alain Greiner (2016)
6 *
7 * Copyright (c)  UPMC Sorbonne Universites
8 *
9 * This file is part of ALMOS-MKH.
10 *
11 * ALMOS-MKH is free software; you can redistribute it and/or modify it
12 * under the terms of the GNU General Public License as published by
13 * the Free Software Foundation; version 2.0 of the License.
14 *
15 * ALMOS-MKH is distributed in the hope that it will be useful, but
16 * WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
18 * General Public License for more details.
19 *
20 * You should have received a copy of the GNU General Public License
21 * along with ALMOS-MKH; if not, write to the Free Software Foundation,
22 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
23 */
24
[14]25#include <kernel_config.h>
[1]26#include <hal_types.h>
27#include <hal_special.h>
28#include <spinlock.h>
29#include <bits.h>
30#include <printk.h>
31#include <thread.h>
32#include <cluster.h>
33#include <page.h>
34#include <ppm.h>
35#include <khm.h>
36
37
38////////////////////////////
39void khm_init( khm_t * khm )
40{
[20]41        // check config parameters
42        assert( ((CONFIG_PPM_PAGE_SHIFT + CONFIG_PPM_HEAP_ORDER) < 32 ) , __FUNCTION__ ,
43                 "CONFIG_PPM_HEAP_ORDER too large" );
[1]44
[20]45        // initialize lock
[18]46        spinlock_init( &khm->lock );
47
[20]48        // compute kernel heap size
49        intptr_t heap_size = (1 << CONFIG_PPM_HEAP_ORDER) << CONFIG_PPM_PAGE_SHIFT;
[1]50
[20]51        // get kernel heap base from PPM
52        page_t * page      = ppm_alloc_pages( CONFIG_PPM_HEAP_ORDER );
[53]53        void   * heap_base = ppm_page2vaddr( page );
[1]54
[20]55        // initialize first block (complete heap)
[1]56        khm_block_t * block = (khm_block_t *)heap_base;
57        block->size = heap_size;
58        block->busy = 0;
59
[20]60        // initialize KHM fields
[1]61        khm->base    = (intptr_t)heap_base;
62        khm->size    = heap_size;
63        khm->next    = (intptr_t)heap_base;
64}
65
66/////////////////////////////////
[18]67void * khm_alloc( khm_t    * khm,
[1]68                  uint32_t   size )
69{
[18]70        khm_block_t  * current;
[1]71        khm_block_t  * next;
72        uint32_t       effective_size;
73
[20]74        // compute actual block size
[1]75        effective_size = size + sizeof(khm_block_t);
76        effective_size = ARROUND_UP( effective_size, CONFIG_CACHE_LINE_SIZE );
77
[20]78        // get lock protecting heap
[1]79        spinlock_lock( &khm->lock );
[18]80
[20]81        // define a starting block to scan existing blocks
82        if( ((khm_block_t*)khm->next)->size < effective_size ) current = (khm_block_t*)khm->base;
83        else                                                   current = (khm_block_t*)khm->next;
[1]84
[20]85        // scan all existing blocks to find a free block large enough
[18]86        while( current->busy || (current->size < effective_size))
[1]87        {
[20]88                // get next block pointer
[1]89                current = (khm_block_t*)((char*)current + current->size);
[18]90
[1]91                if( (intptr_t)current >= (khm->base + khm->size) )  // heap full
92                {
93                        spinlock_unlock(&khm->lock);
94
[18]95                        printk("\n[ERROR] in %s : failed to allocate block of size %d\n",
[1]96                               __FUNCTION__ , effective_size );
97                        return NULL;
98                }
99        }
100
[20]101        // split the current block if it is too large
[1]102        if( (current->size - effective_size) >= CONFIG_CACHE_LINE_SIZE )
103        {
[20]104                // update new free block features
[1]105                next           = (khm_block_t *)((char*)current + effective_size);
106                next->size     = current->size - effective_size;
107                next->busy     = 0;
108
[20]109                // register new free block
[1]110                khm->next = (intptr_t)next;
111
[20]112                // update allocated block features
[1]113                current->size  = effective_size;
114                current->busy  = 1;
115        }
116        else
[20]117        {
118                // change block state
[1]119                current->busy  = 1;
[20]120        }
[1]121
[20]122        // release lock protecting heap
[1]123        spinlock_unlock( &khm->lock );
124
125        return (char*)current + sizeof(khm_block_t);
126}
127
128///////////////////////////
129void khm_free( void * ptr )
130{
131        khm_t * khm = &LOCAL_CLUSTER->khm;
132
133        khm_block_t * current;
134        khm_block_t * next;
[18]135
[1]136        if(ptr == NULL) return;
[18]137
[1]138        current = (khm_block_t *)((char*)ptr - sizeof(khm_block_t));
[18]139
[20]140        // get lock protecting heap
[1]141        spinlock_lock(&khm->lock);
142
[175]143        assert( (current->busy == 1) , __FUNCTION__ , "page already freed" );
144
[20]145        // release block
[1]146        current->busy = 0;
[18]147
[20]148        // try to merge released block with the next
[1]149        while ( 1 )
[18]150        {
[20]151                next = (khm_block_t*)((char*)current + current->size);
[1]152                if ( ((intptr_t)next >= (khm->base + khm->size)) || (next->busy == 1) ) break;
153                current->size += next->size;
154        }
155
156        if( (intptr_t)current < khm->next ) khm->next = (intptr_t)current;
[18]157
[20]158        // release lock protecting heap
[1]159        spinlock_unlock( &khm->lock );
160}
161
Note: See TracBrowser for help on using the repository browser.