Subversion Repositories HelenOS-historic

Rev

Rev 977 | Rev 1064 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2005 Ondrej Palkovsky
  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. /** Paging on AMD64
  30.  *
  31.  * The space is divided in positive numbers - userspace and
  32.  * negative numbers - kernel space. The 'negative' space starting
  33.  * with 0xffff800000000000 and ending with 0xffffffff80000000
  34.  * (-2GB) is identically mapped physical memory. The area
  35.  * (0xffffffff80000000 ... 0xffffffffffffffff is again identically
  36.  * mapped first 2GB.
  37.  *
  38.  * ATTENTION - PA2KA(KA2PA(x)) != x if 'x' is in kernel
  39.  */
  40.  
  41. #ifndef __amd64_PAGE_H__
  42. #define __amd64_PAGE_H__
  43.  
  44. #include <arch/mm/frame.h>
  45.  
  46. #define PAGE_WIDTH  FRAME_WIDTH
  47. #define PAGE_SIZE   FRAME_SIZE
  48.  
  49. #ifdef KERNEL
  50.  
  51. #ifndef __ASM__
  52. #  include <mm/page.h>
  53. #  include <arch/types.h>
  54. #endif
  55.  
  56. #ifndef __ASM__
  57. static inline __address ka2pa(__address x)
  58. {
  59.     if (x > 0xffffffff80000000)
  60.         return x - 0xffffffff80000000;
  61.     else
  62.         return x - 0xffff800000000000;
  63. }
  64. /* Linker symbol */
  65. extern int ktext_start;
  66. extern int kdata_end;
  67. static inline __address pa2ka(__address x)
  68. {
  69.     if (x >= ka2pa((__address)(&kdata_end)) || \
  70.         x <= ka2pa((__address)&ktext_start))
  71.         return x + 0xffff800000000000;
  72.     else
  73.         return x + 0xffffffff80000000;
  74. }
  75. # define KA2PA(x)      ka2pa((__address)x)
  76. # define PA2KA(x)      pa2ka((__address)x)
  77. # define PA2KA_IDENT(x)      (((__address) (x)) + 0xffff800000000000)
  78. # define PA2KA_CODE(x)      (((__address) (x)) + 0xffffffff80000000)
  79. #else
  80. # define KA2PA(x)      ((x) - 0xffffffff80000000)
  81. # define PA2KA(x)      ((x) + 0xffffffff80000000)
  82. # define PA2KA_DATA(x)      ((x) + 0xffff800000000000)
  83. #endif
  84.  
  85. #define PTL0_ENTRIES_ARCH   512
  86. #define PTL1_ENTRIES_ARCH   512
  87. #define PTL2_ENTRIES_ARCH   512
  88. #define PTL3_ENTRIES_ARCH   512
  89.  
  90. #define PTL0_INDEX_ARCH(vaddr)  (((vaddr)>>39)&0x1ff)
  91. #define PTL1_INDEX_ARCH(vaddr)  (((vaddr)>>30)&0x1ff)
  92. #define PTL2_INDEX_ARCH(vaddr)  (((vaddr)>>21)&0x1ff)
  93. #define PTL3_INDEX_ARCH(vaddr)  (((vaddr)>>12)&0x1ff)
  94.  
  95. #define GET_PTL1_ADDRESS_ARCH(ptl0, i)      ((pte_t *) ((((__u64) ((pte_t *)(ptl0))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl0))[(i)].addr_32_51)<<32 )))
  96. #define GET_PTL2_ADDRESS_ARCH(ptl1, i)      ((pte_t *) ((((__u64) ((pte_t *)(ptl1))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl1))[(i)].addr_32_51)<<32 )))
  97. #define GET_PTL3_ADDRESS_ARCH(ptl2, i)      ((pte_t *) ((((__u64) ((pte_t *)(ptl2))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl2))[(i)].addr_32_51)<<32 )))
  98. #define GET_FRAME_ADDRESS_ARCH(ptl3, i)     ((__address *) ((((__u64) ((pte_t *)(ptl3))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl3))[(i)].addr_32_51)<<32 )))
  99.  
  100. #define SET_PTL0_ADDRESS_ARCH(ptl0)     (write_cr3((__address) (ptl0)))
  101. #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a)   set_pt_addr((pte_t *)(ptl0), (index_t)(i), a)
  102. #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)       set_pt_addr((pte_t *)(ptl1), (index_t)(i), a)
  103. #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)       set_pt_addr((pte_t *)(ptl2), (index_t)(i), a)
  104. #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a)  set_pt_addr((pte_t *)(ptl3), (index_t)(i), a)
  105.  
  106. #define GET_PTL1_FLAGS_ARCH(ptl0, i)        get_pt_flags((pte_t *)(ptl0), (index_t)(i))
  107. #define GET_PTL2_FLAGS_ARCH(ptl1, i)        get_pt_flags((pte_t *)(ptl1), (index_t)(i))
  108. #define GET_PTL3_FLAGS_ARCH(ptl2, i)        get_pt_flags((pte_t *)(ptl2), (index_t)(i))
  109. #define GET_FRAME_FLAGS_ARCH(ptl3, i)       get_pt_flags((pte_t *)(ptl3), (index_t)(i))
  110.  
  111. #define SET_PTL1_FLAGS_ARCH(ptl0, i, x)     set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x))
  112. #define SET_PTL2_FLAGS_ARCH(ptl1, i, x)         set_pt_flags((pte_t *)(ptl1), (index_t)(i), (x))
  113. #define SET_PTL3_FLAGS_ARCH(ptl2, i, x)         set_pt_flags((pte_t *)(ptl2), (index_t)(i), (x))
  114. #define SET_FRAME_FLAGS_ARCH(ptl3, i, x)    set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x))
  115.  
  116. #define PTE_VALID_ARCH(p)           (*((__u64 *) (p)) != 0)
  117. #define PTE_PRESENT_ARCH(p)         ((p)->present != 0)
  118. #define PTE_GET_FRAME_ARCH(p)           ((((__address)(p)->addr_12_31)<<12) | ((__address)(p)->addr_32_51<<32))
  119.  
  120. #ifndef __ASM__
  121.  
  122. /** Page Table Entry. */
  123. struct page_specifier {
  124.     unsigned present : 1;
  125.     unsigned writeable : 1;
  126.     unsigned uaccessible : 1;
  127.     unsigned page_write_through : 1;
  128.     unsigned page_cache_disable : 1;
  129.     unsigned accessed : 1;
  130.     unsigned dirty : 1;
  131.     unsigned unused: 1;
  132.     unsigned global : 1;
  133.     unsigned soft_valid : 1;        /**< Valid content even if present bit is cleared. */
  134.     unsigned avl : 2;
  135.     unsigned addr_12_31 : 30;
  136.     unsigned addr_32_51 : 21;
  137.     unsigned no_execute : 1;
  138. } __attribute__ ((packed));
  139.  
  140. static inline int get_pt_flags(pte_t *pt, index_t i)
  141. {
  142.     pte_t *p = &pt[i];
  143.    
  144.     return (
  145.         (!p->page_cache_disable)<<PAGE_CACHEABLE_SHIFT |
  146.         (!p->present)<<PAGE_PRESENT_SHIFT |
  147.         p->uaccessible<<PAGE_USER_SHIFT |
  148.         1<<PAGE_READ_SHIFT |
  149.         p->writeable<<PAGE_WRITE_SHIFT |
  150.         (!p->no_execute)<<PAGE_EXEC_SHIFT |
  151.         p->global<<PAGE_GLOBAL_SHIFT
  152.     );
  153. }
  154.  
  155. static inline void set_pt_addr(pte_t *pt, index_t i, __address a)
  156. {
  157.     pte_t *p = &pt[i];
  158.  
  159.     p->addr_12_31 = (a >> 12) & 0xfffff;
  160.     p->addr_32_51 = a >> 32;
  161. }
  162.  
  163. static inline void set_pt_flags(pte_t *pt, index_t i, int flags)
  164. {
  165.     pte_t *p = &pt[i];
  166.    
  167.     p->page_cache_disable = !(flags & PAGE_CACHEABLE);
  168.     p->present = !(flags & PAGE_NOT_PRESENT);
  169.     p->uaccessible = (flags & PAGE_USER) != 0;
  170.     p->writeable = (flags & PAGE_WRITE) != 0;
  171.     p->no_execute = (flags & PAGE_EXEC) == 0;
  172.     p->global = (flags & PAGE_GLOBAL) != 0;
  173.    
  174.     /*
  175.      * Ensure that there is at least one bit set even if the present bit is cleared.
  176.      */
  177.     p->soft_valid = 1;
  178. }
  179.  
  180. extern void page_arch_init(void);
  181.  
  182. #endif /* __ASM__ */
  183.  
  184. #endif /* KERNEL */
  185.  
  186. #endif
  187.