pgtable_32.h 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  1. /*
  2. * Copyright 2010 Tilera Corporation. All Rights Reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License
  6. * as published by the Free Software Foundation, version 2.
  7. *
  8. * This program is distributed in the hope that it will be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
  11. * NON INFRINGEMENT. See the GNU General Public License for
  12. * more details.
  13. *
  14. */
  15. #ifndef _ASM_TILE_PGTABLE_32_H
  16. #define _ASM_TILE_PGTABLE_32_H
  17. /*
  18. * The level-1 index is defined by the huge page size. A PGD is composed
  19. * of PTRS_PER_PGD pgd_t's and is the top level of the page table.
  20. */
  21. #define PGDIR_SHIFT HPAGE_SHIFT
  22. #define PGDIR_SIZE HPAGE_SIZE
  23. #define PGDIR_MASK (~(PGDIR_SIZE-1))
  24. #define PTRS_PER_PGD _HV_L1_ENTRIES(HPAGE_SHIFT)
  25. #define PGD_INDEX(va) _HV_L1_INDEX(va, HPAGE_SHIFT)
  26. #define SIZEOF_PGD _HV_L1_SIZE(HPAGE_SHIFT)
  27. /*
  28. * The level-2 index is defined by the difference between the huge
  29. * page size and the normal page size. A PTE is composed of
  30. * PTRS_PER_PTE pte_t's and is the bottom level of the page table.
  31. * Note that the hypervisor docs use PTE for what we call pte_t, so
  32. * this nomenclature is somewhat confusing.
  33. */
  34. #define PTRS_PER_PTE _HV_L2_ENTRIES(HPAGE_SHIFT, PAGE_SHIFT)
  35. #define PTE_INDEX(va) _HV_L2_INDEX(va, HPAGE_SHIFT, PAGE_SHIFT)
  36. #define SIZEOF_PTE _HV_L2_SIZE(HPAGE_SHIFT, PAGE_SHIFT)
  37. #ifndef __ASSEMBLY__
  38. /*
  39. * Right now we initialize only a single pte table. It can be extended
  40. * easily, subsequent pte tables have to be allocated in one physical
  41. * chunk of RAM.
  42. *
  43. * HOWEVER, if we are using an allocation scheme with slop after the
  44. * end of the page table (e.g. where our L2 page tables are 2KB but
  45. * our pages are 64KB and we are allocating via the page allocator)
  46. * we can't extend it easily.
  47. */
  48. #define LAST_PKMAP PTRS_PER_PTE
  49. #define PKMAP_BASE ((FIXADDR_BOOT_START - PAGE_SIZE*LAST_PKMAP) & PGDIR_MASK)
  50. #ifdef CONFIG_HIGHMEM
  51. # define _VMALLOC_END (PKMAP_BASE & ~(HPAGE_SIZE-1))
  52. #else
  53. # define _VMALLOC_END (FIXADDR_START & ~(HPAGE_SIZE-1))
  54. #endif
  55. /*
  56. * Align the vmalloc area to an L2 page table, and leave a guard page
  57. * at the beginning and end. The vmalloc code also puts in an internal
  58. * guard page between each allocation.
  59. */
  60. #define VMALLOC_END (_VMALLOC_END - PAGE_SIZE)
  61. extern unsigned long VMALLOC_RESERVE /* = CONFIG_VMALLOC_RESERVE */;
  62. #define _VMALLOC_START (_VMALLOC_END - VMALLOC_RESERVE)
  63. #define VMALLOC_START (_VMALLOC_START + PAGE_SIZE)
  64. /* This is the maximum possible amount of lowmem. */
  65. #define MAXMEM (_VMALLOC_START - PAGE_OFFSET)
  66. /* We have no pmd or pud since we are strictly a two-level page table */
  67. #include <asm-generic/pgtable-nopmd.h>
  68. static inline int pud_huge_page(pud_t pud) { return 0; }
  69. /* We don't define any pgds for these addresses. */
  70. static inline int pgd_addr_invalid(unsigned long addr)
  71. {
  72. return addr >= MEM_HV_START;
  73. }
  74. /*
  75. * Provide versions of these routines that can be used safely when
  76. * the hypervisor may be asynchronously modifying dirty/accessed bits.
  77. * ptep_get_and_clear() matches the generic one but we provide it to
  78. * be parallel with the 64-bit code.
  79. */
  80. #define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
  81. #define __HAVE_ARCH_PTEP_SET_WRPROTECT
  82. extern int ptep_test_and_clear_young(struct vm_area_struct *,
  83. unsigned long addr, pte_t *);
  84. extern void ptep_set_wrprotect(struct mm_struct *,
  85. unsigned long addr, pte_t *);
  86. #define __HAVE_ARCH_PTEP_GET_AND_CLEAR
  87. static inline pte_t ptep_get_and_clear(struct mm_struct *mm,
  88. unsigned long addr, pte_t *ptep)
  89. {
  90. pte_t pte = *ptep;
  91. pte_clear(_mm, addr, ptep);
  92. return pte;
  93. }
  94. /*
  95. * pmds are wrappers around pgds, which are the same as ptes.
  96. * It's often convenient to "cast" back and forth and use the pte methods,
  97. * which are the methods supplied by the hypervisor.
  98. */
  99. #define pmd_pte(pmd) ((pmd).pud.pgd)
  100. #define pmdp_ptep(pmdp) (&(pmdp)->pud.pgd)
  101. #define pte_pmd(pte) ((pmd_t){ { (pte) } })
  102. #endif /* __ASSEMBLY__ */
  103. #endif /* _ASM_TILE_PGTABLE_32_H */