Subversion Repositories HelenOS

Rev

Rev 1965 | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2005 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 <arch/mm/page.h>
  30. #include <arch/mm/tlb.h>
  31. #include <genarch/mm/page_ht.h>
  32. #include <mm/frame.h>
  33. #include <bitops.h>
  34. #include <debug.h>
  35.  
  36. void page_arch_init(void)
  37. {
  38.     page_mapping_operations = &ht_mapping_operations;
  39. }
  40.  
  41. __address hw_map(__address physaddr, size_t size)
  42. {
  43.     unsigned int order;
  44.     int i;
  45.  
  46.     struct {
  47.         int pagesize;
  48.         size_t increment;
  49.         count_t count;
  50.     } sizemap[] = {
  51.         { PAGESIZE_8K, 0, 1 },          /* 8K */
  52.         { PAGESIZE_8K, PAGE_SIZE, 2 },      /* 16K */
  53.         { PAGESIZE_8K, PAGE_SIZE, 4 },      /* 32K */
  54.         { PAGESIZE_64K, 0, 1},          /* 64K */
  55.         { PAGESIZE_64K, 8*PAGE_SIZE, 2 },   /* 128K */
  56.         { PAGESIZE_64K, 8*PAGE_SIZE, 4 },   /* 256K */
  57.         { PAGESIZE_512K, 0, 1 },        /* 512K */
  58.         { PAGESIZE_512K, 64*PAGE_SIZE, 2 }, /* 1M */
  59.         { PAGESIZE_512K, 64*PAGE_SIZE, 4 }, /* 2M */
  60.         { PAGESIZE_4M, 0, 1 }           /* 4M */
  61.     };
  62.    
  63.     ASSERT(size <= 4*1024*1024);
  64.    
  65.     if (size <= FRAME_SIZE)
  66.         order = 0;
  67.     else
  68.         order = (fnzb32(size - 1) + 1) - FRAME_WIDTH;
  69.    
  70.     __address virtaddr = PA2KA(PFN2ADDR(frame_alloc(order, FRAME_KA)));
  71.  
  72.     for (i = 0; i < sizemap[order].count; i++)
  73.         dtlb_insert_mapping(virtaddr + i*sizemap[order].increment,
  74.                     physaddr + i*sizemap[order].increment,
  75.                     sizemap[order].pagesize, true, false);
  76.    
  77.     return virtaddr;
  78. }
  79.