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

Last change on this file since 662 was 567, checked in by alain, 6 years ago

Complete restructuration of kernel locks.

File size: 4.4 KB
RevLine 
[1]1/*
[567]2 * khm.c - Kernel Heap Manager implementation.
[18]3 *
[1]4 * Authors  Ghassan Almaless (2008,2009,2010,2011,2012)
[567]5 *          Alain Greiner (2016,2017,2018)
[1]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>
[457]26#include <hal_kernel_types.h>
[1]27#include <hal_special.h>
[567]28#include <busylock.h>
[1]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
[492]42        assert( ((CONFIG_PPM_PAGE_SHIFT + CONFIG_PPM_HEAP_ORDER) < 32 ) ,
[20]43                 "CONFIG_PPM_HEAP_ORDER too large" );
[1]44
[20]45        // initialize lock
[567]46        busylock_init( &khm->lock , LOCK_KHM_STATE );
[18]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 );
[315]53        xptr_t   base_xp   = ppm_page2base( XPTR( local_cxy, page ) );
54        void   * heap_base = GET_PTR( base_xp );
[1]55
[20]56        // initialize first block (complete heap)
[1]57        khm_block_t * block = (khm_block_t *)heap_base;
58        block->size = heap_size;
59        block->busy = 0;
60
[20]61        // initialize KHM fields
[1]62        khm->base    = (intptr_t)heap_base;
63        khm->size    = heap_size;
64        khm->next    = (intptr_t)heap_base;
65}
66
67/////////////////////////////////
[18]68void * khm_alloc( khm_t    * khm,
[1]69                  uint32_t   size )
70{
[18]71        khm_block_t  * current;
[1]72        khm_block_t  * next;
73        uint32_t       effective_size;
74
[20]75        // compute actual block size
[1]76        effective_size = size + sizeof(khm_block_t);
77        effective_size = ARROUND_UP( effective_size, CONFIG_CACHE_LINE_SIZE );
78
[20]79        // get lock protecting heap
[567]80        busylock_acquire( &khm->lock );
[18]81
[20]82        // define a starting block to scan existing blocks
83        if( ((khm_block_t*)khm->next)->size < effective_size ) current = (khm_block_t*)khm->base;
84        else                                                   current = (khm_block_t*)khm->next;
[1]85
[20]86        // scan all existing blocks to find a free block large enough
[18]87        while( current->busy || (current->size < effective_size))
[1]88        {
[20]89                // get next block pointer
[1]90                current = (khm_block_t*)((char*)current + current->size);
[18]91
[1]92                if( (intptr_t)current >= (khm->base + khm->size) )  // heap full
93                {
[567]94                        busylock_release(&khm->lock);
[1]95
[18]96                        printk("\n[ERROR] in %s : failed to allocate block of size %d\n",
[1]97                               __FUNCTION__ , effective_size );
98                        return NULL;
99                }
100        }
101
[20]102        // split the current block if it is too large
[1]103        if( (current->size - effective_size) >= CONFIG_CACHE_LINE_SIZE )
104        {
[20]105                // update new free block features
[1]106                next           = (khm_block_t *)((char*)current + effective_size);
107                next->size     = current->size - effective_size;
108                next->busy     = 0;
109
[20]110                // register new free block
[1]111                khm->next = (intptr_t)next;
112
[20]113                // update allocated block features
[1]114                current->size  = effective_size;
115                current->busy  = 1;
116        }
117        else
[20]118        {
119                // change block state
[1]120                current->busy  = 1;
[20]121        }
[1]122
[20]123        // release lock protecting heap
[567]124        busylock_release( &khm->lock );
[1]125
126        return (char*)current + sizeof(khm_block_t);
127}
128
129///////////////////////////
130void khm_free( void * ptr )
131{
132        khm_t * khm = &LOCAL_CLUSTER->khm;
133
134        khm_block_t * current;
135        khm_block_t * next;
[18]136
[1]137        if(ptr == NULL) return;
[18]138
[1]139        current = (khm_block_t *)((char*)ptr - sizeof(khm_block_t));
[18]140
[20]141        // get lock protecting heap
[567]142        busylock_acquire(&khm->lock);
[1]143
[492]144        assert( (current->busy == 1) , "page already freed" );
[175]145
[20]146        // release block
[1]147        current->busy = 0;
[18]148
[20]149        // try to merge released block with the next
[1]150        while ( 1 )
[18]151        {
[20]152                next = (khm_block_t*)((char*)current + current->size);
[1]153                if ( ((intptr_t)next >= (khm->base + khm->size)) || (next->busy == 1) ) break;
154                current->size += next->size;
155        }
156
157        if( (intptr_t)current < khm->next ) khm->next = (intptr_t)current;
[18]158
[20]159        // release lock protecting heap
[567]160        busylock_release( &khm->lock );
[1]161}
162
Note: See TracBrowser for help on using the repository browser.