source: trunk/kernel/mm/ppm.c @ 168

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

style

File size: 7.3 KB
RevLine 
[1]1/*
2 * ppm.c - Per-cluster Physical Pages Manager implementation
3 *
4 * Authors  Ghassan Almaless (2008,2009,2010,2011,2012)
[50]5 *          Alain Greiner    (2016,2017)
[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>
[1]26#include <hal_types.h>
27#include <hal_special.h>
28#include <printk.h>
29#include <list.h>
30#include <bits.h>
31#include <page.h>
32#include <spinlock.h>
33#include <thread.h>
34#include <cluster.h>
35#include <kmem.h>
36#include <process.h>
37#include <dqdt.h>
38#include <ppm.h>
39
40////////////////////////////////////////////////
41inline bool_t ppm_page_is_valid( page_t * page )
42{
[160]43        ppm_t    * ppm  = &LOCAL_CLUSTER->ppm;
[1]44        uint32_t   pgnr = (uint32_t)( page - ppm->pages_tbl );
45        return (pgnr <= ppm->pages_nr);
46}
47
[50]48
49/////////////////////////////////////////////
50inline void * ppm_page2vaddr( page_t * page )
[1]51{
52        ppm_t * ppm = &LOCAL_CLUSTER->ppm;
[50]53        return ppm->vaddr_base + ((page - ppm->pages_tbl) << CONFIG_PPM_PAGE_SHIFT);
[1]54}
55
[50]56//////////////////////////////////////////////
57inline page_t * ppm_vaddr2page( void * vaddr )
[1]58{
59        ppm_t * ppm = &LOCAL_CLUSTER->ppm;
[50]60        return ppm->pages_tbl + (vaddr - ppm->vaddr_base);
[1]61}
62
63//////////////////////////////////////////
64inline ppn_t ppm_page2ppn( page_t * page )
65{
[160]66        ppm_t  * ppm = &LOCAL_CLUSTER->ppm;
[1]67        return (ppn_t)( page - ppm->pages_tbl );
68}
69
70/////////////////////////////////////////
71inline page_t * ppm_ppn2page( ppn_t ppn )
72{
[160]73        ppm_t  * ppm = &LOCAL_CLUSTER->ppm;
[1]74        return &ppm->pages_tbl[ppn];
75}
76
77///////////////////////////////////////
[50]78inline void * ppm_ppn2vaddr( ppn_t ppn )
[1]79{
[50]80        ppm_t  * ppm  = &LOCAL_CLUSTER->ppm;
81        return ppm->vaddr_base + (ppn << CONFIG_PPM_PAGE_SHIFT);
[1]82}
83
[50]84//////////////////////////////////////////
85inline ppn_t ppm_vaddr2ppn( void * vaddr )
[1]86{
[50]87        ppm_t  * ppm  = &LOCAL_CLUSTER->ppm;
[160]88        return ( (ppm->vaddr_base - vaddr) >> CONFIG_PPM_PAGE_SHIFT );
[1]89}
90
[50]91
92///////////////////////////////////////////
93void ppm_free_pages_nolock( page_t * page )
[1]94{
[7]95        page_t   * buddy;            // searched buddy page descriptor
96        uint32_t   buddy_index;      // buddy page index
97        page_t   * current;          // current (merged) page descriptor
98        uint32_t   current_index;    // current (merged) page index
[50]99        uint32_t   current_order;    // current (merged) page order
[7]100
[160]101        ppm_t    * ppm         = &LOCAL_CLUSTER->ppm;
102        page_t   * pages_tbl   = ppm->pages_tbl;
[1]103
[160]104        // update released page descriptor flags
[1]105        page_set_flag( page , PG_FREE );
106
[160]107        // search the buddy page descriptor
108        // - merge with current page descriptor if found
109        // - exit to release the current page descriptor if not found
110        current       = page ,
111        current_index = (uint32_t)(page - ppm->pages_tbl);
[18]112        for( current_order = page->order ;
[160]113             current_order < CONFIG_PPM_MAX_ORDER ;
114             current_order++ )
115        {
[7]116                buddy_index = current_index ^ (1 << current_order);
117                buddy       = pages_tbl + buddy_index;
[18]118
[7]119                if( !page_is_flag( buddy , PG_FREE ) || (buddy->order != current_order) ) break;
[1]120
[160]121                // remove buddy from free list
[7]122                list_unlink( &buddy->list );
[1]123                ppm->free_pages_nr[current_order] --;
[18]124
[160]125                // merge buddy with current
[7]126                buddy->order = 0;
127                current_index &= buddy_index;
[1]128        }
[18]129
[160]130        // update merged page descriptor order
[7]131        current        = pages_tbl + current_index;
132        current->order = current_order;
[1]133
[160]134        // insert current in free list
[7]135        list_add_first( &ppm->free_pages_root[current_order] , &current->list );
[1]136        ppm->free_pages_nr[current_order] ++;
[160]137}
[1]138
139////////////////////////////////////////////
140page_t * ppm_alloc_pages( uint32_t   order )
141{
[160]142        uint32_t   current_order;
[1]143        page_t   * remaining_block;
144        uint32_t   current_size;
145
[160]146        ppm_t    * ppm = &LOCAL_CLUSTER->ppm;
[1]147
[7]148        assert( (order < CONFIG_PPM_MAX_ORDER) , __FUNCTION__ , "illegal order argument" );
[1]149
150        page_t * block = NULL;
151
[160]152        ppm_dmsg("\n[INFO] %s : enters / order = %d\n",
153                 __FUNCTION__ , order );
[7]154
[160]155        // take lock protecting free lists
[1]156        spinlock_lock( &ppm->free_lock );
157
[160]158        // find a free block equal or larger to requested size
[1]159        for( current_order = order ; current_order < CONFIG_PPM_MAX_ORDER ; current_order ++ )
160        {
161                if( !list_is_empty( &ppm->free_pages_root[current_order] ) )
162                {
163                        block = LIST_FIRST( &ppm->free_pages_root[current_order] , page_t , list );
164                        list_unlink( &block->list );
165                        break;
166                }
167        }
168
169        if( block == NULL ) // return failure
170        {
[160]171                // release lock protecting free lists
172                spinlock_unlock( &ppm->free_lock );
[1]173
[160]174                return NULL;
175        }
[18]176
[160]177        // update free-lists after removing a block
[18]178        ppm->free_pages_nr[current_order] --;
[1]179        current_size = (1 << current_order);
180
[160]181        // split the removed block in smaller sub-blocks if required
182        // and update the free-lists accordingly
[1]183        while( current_order > order )
184        {
185                current_order --;
186                current_size >>= 1;
[18]187
[1]188                remaining_block = block + current_size;
189                remaining_block->order = current_order;
190
191                list_add_first( &ppm->free_pages_root[current_order] , &remaining_block->list );
192                ppm->free_pages_nr[current_order] ++;
193        }
[18]194
[160]195        // update page descriptor
196        page_clear_flag( block , PG_FREE );
[1]197        page_refcount_up( block );
198        block->order = order;
199
[160]200        // release lock protecting free lists
[1]201        spinlock_unlock( &ppm->free_lock );
[18]202
[160]203        ppm_dmsg("\n[INFO] %s : base = %x / order = %d\n",
204                 __FUNCTION__ , (uint32_t)ppm_page2base( block ) , order );
[7]205
[1]206        return block;
[160]207}
[1]208
209
210////////////////////////////////////
211void ppm_free_pages( page_t * page )
212{
213        ppm_t * ppm = &LOCAL_CLUSTER->ppm;
[18]214
[160]215        // get lock protecting free_pages[] array
[1]216        spinlock_lock( &ppm->free_lock );
217
[18]218        ppm_free_pages_nolock( page );
[1]219
[160]220        // release lock protecting free_pages[] array
[1]221        spinlock_unlock( &ppm->free_lock );
222}
223
[7]224////////////////////////////
225void ppm_print( ppm_t * ppm,
226                char  * string )
[1]227{
228        uint32_t       order;
229        list_entry_t * iter;
230        page_t       * page;
231
[160]232        // get lock protecting free lists
[1]233        spinlock_lock( &ppm->free_lock );
234
[50]235        printk("\n***  PPM in cluster %x : %d pages / &pages_tbl = %x / vaddr_base = %x ***\n",
236               local_cxy , ppm->pages_nr , (intptr_t)ppm->pages_tbl , (intptr_t)ppm->vaddr_base );
[18]237
[1]238        for( order = 0 ; order < CONFIG_PPM_MAX_ORDER ; order++ )
239        {
[7]240                printk("- order = %d / free_pages = %d  [",
[160]241                       order , ppm->free_pages_nr[order] );
[18]242
[1]243                LIST_FOREACH( &ppm->free_pages_root[order] , iter )
244                {
245                        page = LIST_ELEMENT( iter , page_t , list );
246                        printk("%d," , page - ppm->pages_tbl );
247                }
[18]248
[1]249                printk("]\n", NULL );
250        }
251
[160]252        // release lock protecting free lists
[1]253        spinlock_unlock( &ppm->free_lock );
[160]254}
[1]255
[53]256///////////////////////////////////////
257error_t ppm_assert_order( ppm_t * ppm )
[1]258{
259        uint32_t       order;
260        list_entry_t * iter;
261        page_t       * page;
[18]262
[1]263        for(order=0; order < CONFIG_PPM_MAX_ORDER; order++)
264        {
265                if( list_is_empty( &ppm->free_pages_root[order] ) ) continue;
[18]266
[1]267                LIST_FOREACH( &ppm->free_pages_root[order] , iter )
268                {
269                        page = LIST_ELEMENT( iter , page_t , list );
270
[160]271                        if( page->order != order )  return -1;
[1]272                }
273        }
274
[160]275        return 0;
276}
[53]277
Note: See TracBrowser for help on using the repository browser.