1 /* 2 * S390 version 3 * Copyright IBM Corp. 1999, 2000 4 * Author(s): Hartmut Penner (hp@de.ibm.com) 5 * Martin Schwidefsky (schwidefsky@de.ibm.com) 6 * 7 * Derived from "include/asm-i386/pgalloc.h" 8 * Copyright (C) 1994 Linus Torvalds 9 */ 10 11 #ifndef _S390_PGALLOC_H 12 #define _S390_PGALLOC_H 13 14 #include <linux/threads.h> 15 #include <linux/gfp.h> 16 #include <linux/mm.h> 17 18 unsigned long *crst_table_alloc(struct mm_struct *); 19 void crst_table_free(struct mm_struct *, unsigned long *); 20 21 unsigned long *page_table_alloc(struct mm_struct *); 22 void page_table_free(struct mm_struct *, unsigned long *); 23 void page_table_free_rcu(struct mmu_gather *, unsigned long *, unsigned long); 24 25 int set_guest_storage_key(struct mm_struct *mm, unsigned long addr, 26 unsigned long key, bool nq); 27 unsigned long get_guest_storage_key(struct mm_struct *mm, unsigned long addr); 28 29 static inline void clear_table(unsigned long *s, unsigned long val, size_t n) 30 { 31 typedef struct { char _[n]; } addrtype; 32 33 *s = val; 34 n = (n / 256) - 1; 35 asm volatile( 36 " mvc 8(248,%0),0(%0)\n" 37 "0: mvc 256(256,%0),0(%0)\n" 38 " la %0,256(%0)\n" 39 " brct %1,0b\n" 40 : "+a" (s), "+d" (n), "=m" (*(addrtype *) s) 41 : "m" (*(addrtype *) s)); 42 } 43 44 static inline void crst_table_init(unsigned long *crst, unsigned long entry) 45 { 46 clear_table(crst, entry, sizeof(unsigned long)*2048); 47 } 48 49 static inline unsigned long pgd_entry_type(struct mm_struct *mm) 50 { 51 if (mm->context.asce_limit <= (1UL << 31)) 52 return _SEGMENT_ENTRY_EMPTY; 53 if (mm->context.asce_limit <= (1UL << 42)) 54 return _REGION3_ENTRY_EMPTY; 55 return _REGION2_ENTRY_EMPTY; 56 } 57 58 int crst_table_upgrade(struct mm_struct *, unsigned long limit); 59 void crst_table_downgrade(struct mm_struct *, unsigned long limit); 60 61 static inline pud_t *pud_alloc_one(struct mm_struct *mm, unsigned long address) 62 { 63 unsigned long *table = crst_table_alloc(mm); 64 if (table) 65 crst_table_init(table, _REGION3_ENTRY_EMPTY); 66 return (pud_t *) table; 67 } 68 #define pud_free(mm, pud) crst_table_free(mm, (unsigned long *) pud) 69 70 static inline pmd_t *pmd_alloc_one(struct mm_struct *mm, unsigned long vmaddr) 71 { 72 unsigned long *table = crst_table_alloc(mm); 73 74 if (!table) 75 return NULL; 76 crst_table_init(table, _SEGMENT_ENTRY_EMPTY); 77 if (!pgtable_pmd_page_ctor(virt_to_page(table))) { 78 crst_table_free(mm, table); 79 return NULL; 80 } 81 return (pmd_t *) table; 82 } 83 84 static inline void pmd_free(struct mm_struct *mm, pmd_t *pmd) 85 { 86 pgtable_pmd_page_dtor(virt_to_page(pmd)); 87 crst_table_free(mm, (unsigned long *) pmd); 88 } 89 90 static inline void pgd_populate(struct mm_struct *mm, pgd_t *pgd, pud_t *pud) 91 { 92 pgd_val(*pgd) = _REGION2_ENTRY | __pa(pud); 93 } 94 95 static inline void pud_populate(struct mm_struct *mm, pud_t *pud, pmd_t *pmd) 96 { 97 pud_val(*pud) = _REGION3_ENTRY | __pa(pmd); 98 } 99 100 static inline pgd_t *pgd_alloc(struct mm_struct *mm) 101 { 102 spin_lock_init(&mm->context.list_lock); 103 INIT_LIST_HEAD(&mm->context.pgtable_list); 104 INIT_LIST_HEAD(&mm->context.gmap_list); 105 return (pgd_t *) crst_table_alloc(mm); 106 } 107 #define pgd_free(mm, pgd) crst_table_free(mm, (unsigned long *) pgd) 108 109 static inline void pmd_populate(struct mm_struct *mm, 110 pmd_t *pmd, pgtable_t pte) 111 { 112 pmd_val(*pmd) = _SEGMENT_ENTRY + __pa(pte); 113 } 114 115 #define pmd_populate_kernel(mm, pmd, pte) pmd_populate(mm, pmd, pte) 116 117 #define pmd_pgtable(pmd) \ 118 (pgtable_t)(pmd_val(pmd) & -sizeof(pte_t)*PTRS_PER_PTE) 119 120 /* 121 * page table entry allocation/free routines. 122 */ 123 #define pte_alloc_one_kernel(mm, vmaddr) ((pte_t *) page_table_alloc(mm)) 124 #define pte_alloc_one(mm, vmaddr) ((pte_t *) page_table_alloc(mm)) 125 126 #define pte_free_kernel(mm, pte) page_table_free(mm, (unsigned long *) pte) 127 #define pte_free(mm, pte) page_table_free(mm, (unsigned long *) pte) 128 129 extern void rcu_table_freelist_finish(void); 130 131 #endif /* _S390_PGALLOC_H */ 132