Subversion Repositories HelenOS-historic

Rev

Rev 198 | Blame | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2001-2004 Jakub Jermar
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. #include <mm/vm.h>
  30. #include <mm/page.h>
  31. #include <mm/frame.h>
  32. #include <mm/tlb.h>
  33. #include <mm/heap.h>
  34. #include <arch/mm/page.h>
  35. #include <arch/types.h>
  36. #include <typedefs.h>
  37. #include <synch/spinlock.h>
  38. #include <config.h>
  39. #include <list.h>
  40. #include <panic.h>
  41. #include <arch/asm.h>
  42. #include <debug.h>
  43. #include <memstr.h>
  44. #include <arch.h>
  45.  
  46. #define KAS_START_INDEX     PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)
  47. #define KAS_END_INDEX       PTL0_INDEX(KERNEL_ADDRESS_SPACE_END)
  48. #define KAS_INDICES     (1+(KAS_END_INDEX-KAS_START_INDEX))
  49.  
  50. vm_t *vm_create(pte_t *ptl0)
  51. {
  52.     vm_t *m;
  53.  
  54.     m = (vm_t *) malloc(sizeof(vm_t));
  55.     if (m) {
  56.         spinlock_initialize(&m->lock);
  57.         list_initialize(&m->vm_area_head);
  58.  
  59.         /*
  60.          * Each vm_t is supposed to have its own page table.
  61.          * It is either passed one or it has to allocate and set one up.
  62.          */
  63.         m->ptl0 = ptl0;
  64.         if (!m->ptl0) {
  65.             pte_t *src_ptl0, *dst_ptl0;
  66.        
  67.             src_ptl0 = (pte_t *) PA2KA((__address) GET_PTL0_ADDRESS());
  68.             dst_ptl0 = (pte_t *) frame_alloc(FRAME_KA | FRAME_PANIC);
  69.             memcpy((void *)PA2KA((__address) dst_ptl0), (void *)GET_PTL0_ADDRESS() , PAGE_SIZE);
  70.             m->ptl0 = (pte_t *) KA2PA((__address) dst_ptl0);
  71.         }
  72.     }
  73.  
  74.     return m;
  75. }
  76.  
  77. void vm_destroy(vm_t *m)
  78. {
  79. }
  80.  
  81. vm_area_t *vm_area_create(vm_t *m, vm_type_t type, size_t size, __address addr)
  82. {
  83.     pri_t pri;
  84.     vm_area_t *a;
  85.    
  86.     if (addr % PAGE_SIZE)
  87.         panic("addr not aligned to a page boundary");
  88.    
  89.     pri = cpu_priority_high();
  90.     spinlock_lock(&m->lock);
  91.    
  92.     /*
  93.      * TODO: test vm_area which is to be created doesn't overlap with an existing one.
  94.      */
  95.    
  96.     a = (vm_area_t *) malloc(sizeof(vm_area_t));
  97.     if (a) {
  98.         int i;
  99.    
  100.         a->mapping = (__address *) malloc(size * sizeof(__address));
  101.         if (!a->mapping) {
  102.             free(a);
  103.             spinlock_unlock(&m->lock);
  104.             cpu_priority_restore(pri);
  105.             return NULL;
  106.         }
  107.        
  108.         for (i=0; i<size; i++)
  109.             a->mapping[i] = frame_alloc(0);
  110.        
  111.         spinlock_initialize(&a->lock);
  112.            
  113.         link_initialize(&a->link);         
  114.         a->type = type;
  115.         a->size = size;
  116.         a->address = addr;
  117.        
  118.         list_append(&a->link, &m->vm_area_head);
  119.  
  120.     }
  121.  
  122.     spinlock_unlock(&m->lock);
  123.     cpu_priority_restore(pri);
  124.    
  125.     return a;
  126. }
  127.  
  128. void vm_area_destroy(vm_area_t *a)
  129. {
  130. }
  131.  
  132. void vm_area_map(vm_area_t *a, vm_t *m)
  133. {
  134.     int i, flags;
  135.     pri_t pri;
  136.    
  137.     pri = cpu_priority_high();
  138.     spinlock_lock(&m->lock);
  139.     spinlock_lock(&a->lock);
  140.  
  141.     switch (a->type) {
  142.         case VMA_TEXT:
  143.             flags = PAGE_EXEC | PAGE_READ | PAGE_USER | PAGE_PRESENT | PAGE_CACHEABLE;
  144.             break;
  145.         case VMA_DATA:
  146.         case VMA_STACK:
  147.             flags = PAGE_READ | PAGE_WRITE | PAGE_USER | PAGE_PRESENT | PAGE_CACHEABLE;
  148.             break;
  149.         default:
  150.             panic("unexpected vm_type_t %d", a->type);
  151.     }
  152.  
  153.     ASSERT(m->ptl0);
  154.     for (i=0; i<a->size; i++)
  155.         map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, (__address) m->ptl0);
  156.        
  157.     spinlock_unlock(&a->lock);
  158.     spinlock_unlock(&m->lock);
  159.     cpu_priority_restore(pri);
  160. }
  161.  
  162. void vm_area_unmap(vm_area_t *a, vm_t *m)
  163. {
  164.     int i;
  165.     pri_t pri;
  166.    
  167.     pri = cpu_priority_high();
  168.     spinlock_lock(&m->lock);
  169.     spinlock_lock(&a->lock);
  170.  
  171.     ASSERT(m->ptl0);
  172.     for (i=0; i<a->size; i++)      
  173.         map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, (__address) m->ptl0);
  174.    
  175.     spinlock_unlock(&a->lock);
  176.     spinlock_unlock(&m->lock);
  177.     cpu_priority_restore(pri);
  178. }
  179.  
  180. void vm_install(vm_t *m)
  181. {
  182.     link_t *l;
  183.     pri_t pri;
  184.    
  185.     pri = cpu_priority_high();
  186.  
  187.     tlb_shootdown_start();
  188.     spinlock_lock(&m->lock);
  189.  
  190.     ASSERT(m->ptl0);
  191.     SET_PTL0_ADDRESS(m->ptl0);
  192.  
  193.     spinlock_unlock(&m->lock);
  194.     tlb_shootdown_finalize();
  195.  
  196.     cpu_priority_restore(pri);
  197. }
  198.