blob: f8347ce9c5a124b58cfb311a68021eaf5437c7a2 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * include/asm-s390/pgtable.h
3 *
4 * S390 version
5 * Copyright (C) 1999,2000 IBM Deutschland Entwicklung GmbH, IBM Corporation
6 * Author(s): Hartmut Penner (hp@de.ibm.com)
7 * Ulrich Weigand (weigand@de.ibm.com)
8 * Martin Schwidefsky (schwidefsky@de.ibm.com)
9 *
10 * Derived from "include/asm-i386/pgtable.h"
11 */
12
13#ifndef _ASM_S390_PGTABLE_H
14#define _ASM_S390_PGTABLE_H
15
Linus Torvalds1da177e2005-04-16 15:20:36 -070016/*
17 * The Linux memory management assumes a three-level page table setup. For
18 * s390 31 bit we "fold" the mid level into the top-level page table, so
19 * that we physically have the same two-level page table as the s390 mmu
20 * expects in 31 bit mode. For s390 64 bit we use three of the five levels
21 * the hardware provides (region first and region second tables are not
22 * used).
23 *
24 * The "pgd_xxx()" functions are trivial for a folded two-level
25 * setup: the pgd is never bad, and a pmd always exists (as it's folded
26 * into the pgd entry)
27 *
28 * This file contains the functions and defines necessary to modify and use
29 * the S390 page table tree.
30 */
31#ifndef __ASSEMBLY__
Heiko Carstens2dcea572006-09-29 01:58:41 -070032#include <linux/mm_types.h>
Christian Borntraeger5b7baf02008-03-25 18:47:12 +010033#include <asm/bitops.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070034#include <asm/bug.h>
35#include <asm/processor.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070036
Linus Torvalds1da177e2005-04-16 15:20:36 -070037extern pgd_t swapper_pg_dir[] __attribute__ ((aligned (4096)));
38extern void paging_init(void);
Heiko Carstens2b67fc42007-02-05 21:16:47 +010039extern void vmem_map_init(void);
Linus Torvalds1da177e2005-04-16 15:20:36 -070040
41/*
42 * The S390 doesn't have any external MMU info: the kernel page
43 * tables contain all the necessary information.
44 */
45#define update_mmu_cache(vma, address, pte) do { } while (0)
46
47/*
48 * ZERO_PAGE is a global shared page that is always zero: used
49 * for zero-mapped memory areas etc..
50 */
51extern char empty_zero_page[PAGE_SIZE];
52#define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
53#endif /* !__ASSEMBLY__ */
54
55/*
56 * PMD_SHIFT determines the size of the area a second-level page
57 * table can map
58 * PGDIR_SHIFT determines what a third-level page table entry can map
59 */
60#ifndef __s390x__
Martin Schwidefsky146e4b32008-02-09 18:24:35 +010061# define PMD_SHIFT 20
62# define PUD_SHIFT 20
63# define PGDIR_SHIFT 20
Linus Torvalds1da177e2005-04-16 15:20:36 -070064#else /* __s390x__ */
Martin Schwidefsky146e4b32008-02-09 18:24:35 +010065# define PMD_SHIFT 20
Martin Schwidefsky190a1d72007-10-22 12:52:48 +020066# define PUD_SHIFT 31
Martin Schwidefsky5a216a22008-02-09 18:24:36 +010067# define PGDIR_SHIFT 42
Linus Torvalds1da177e2005-04-16 15:20:36 -070068#endif /* __s390x__ */
69
70#define PMD_SIZE (1UL << PMD_SHIFT)
71#define PMD_MASK (~(PMD_SIZE-1))
Martin Schwidefsky190a1d72007-10-22 12:52:48 +020072#define PUD_SIZE (1UL << PUD_SHIFT)
73#define PUD_MASK (~(PUD_SIZE-1))
Martin Schwidefsky5a216a22008-02-09 18:24:36 +010074#define PGDIR_SIZE (1UL << PGDIR_SHIFT)
75#define PGDIR_MASK (~(PGDIR_SIZE-1))
Linus Torvalds1da177e2005-04-16 15:20:36 -070076
77/*
78 * entries per page directory level: the S390 is two-level, so
79 * we don't really have any PMD directory physically.
80 * for S390 segment-table entries are combined to one PGD
81 * that leads to 1024 pte per pgd
82 */
Martin Schwidefsky146e4b32008-02-09 18:24:35 +010083#define PTRS_PER_PTE 256
Linus Torvalds1da177e2005-04-16 15:20:36 -070084#ifndef __s390x__
Martin Schwidefsky146e4b32008-02-09 18:24:35 +010085#define PTRS_PER_PMD 1
Martin Schwidefsky5a216a22008-02-09 18:24:36 +010086#define PTRS_PER_PUD 1
Linus Torvalds1da177e2005-04-16 15:20:36 -070087#else /* __s390x__ */
Martin Schwidefsky146e4b32008-02-09 18:24:35 +010088#define PTRS_PER_PMD 2048
Martin Schwidefsky5a216a22008-02-09 18:24:36 +010089#define PTRS_PER_PUD 2048
Linus Torvalds1da177e2005-04-16 15:20:36 -070090#endif /* __s390x__ */
Martin Schwidefsky146e4b32008-02-09 18:24:35 +010091#define PTRS_PER_PGD 2048
Linus Torvalds1da177e2005-04-16 15:20:36 -070092
Hugh Dickinsd455a362005-04-19 13:29:23 -070093#define FIRST_USER_ADDRESS 0
94
Linus Torvalds1da177e2005-04-16 15:20:36 -070095#define pte_ERROR(e) \
96 printk("%s:%d: bad pte %p.\n", __FILE__, __LINE__, (void *) pte_val(e))
97#define pmd_ERROR(e) \
98 printk("%s:%d: bad pmd %p.\n", __FILE__, __LINE__, (void *) pmd_val(e))
Martin Schwidefsky190a1d72007-10-22 12:52:48 +020099#define pud_ERROR(e) \
100 printk("%s:%d: bad pud %p.\n", __FILE__, __LINE__, (void *) pud_val(e))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101#define pgd_ERROR(e) \
102 printk("%s:%d: bad pgd %p.\n", __FILE__, __LINE__, (void *) pgd_val(e))
103
104#ifndef __ASSEMBLY__
105/*
Christian Borntraeger5fd9c6e2008-01-26 14:11:00 +0100106 * The vmalloc area will always be on the topmost area of the kernel
107 * mapping. We reserve 96MB (31bit) / 1GB (64bit) for vmalloc,
108 * which should be enough for any sane case.
109 * By putting vmalloc at the top, we maximise the gap between physical
110 * memory and vmalloc to catch misplaced memory accesses. As a side
111 * effect, this also makes sure that 64 bit module code cannot be used
112 * as system call address.
Heiko Carstens8b62bc92006-12-04 15:40:56 +0100113 */
114#ifndef __s390x__
Christian Borntraeger5fd9c6e2008-01-26 14:11:00 +0100115#define VMALLOC_START 0x78000000UL
116#define VMALLOC_END 0x7e000000UL
Heiko Carstens01891032008-02-05 16:50:49 +0100117#define VMEM_MAP_END 0x80000000UL
Heiko Carstens8b62bc92006-12-04 15:40:56 +0100118#else /* __s390x__ */
Christian Borntraeger5fd9c6e2008-01-26 14:11:00 +0100119#define VMALLOC_START 0x3e000000000UL
120#define VMALLOC_END 0x3e040000000UL
Heiko Carstens01891032008-02-05 16:50:49 +0100121#define VMEM_MAP_END 0x40000000000UL
Heiko Carstens8b62bc92006-12-04 15:40:56 +0100122#endif /* __s390x__ */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123
Heiko Carstens01891032008-02-05 16:50:49 +0100124/*
125 * VMEM_MAX_PHYS is the highest physical address that can be added to the 1:1
126 * mapping. This needs to be calculated at compile time since the size of the
127 * VMEM_MAP is static but the size of struct page can change.
128 */
Martin Schwidefsky522d8dc2008-02-09 18:24:31 +0100129#define VMEM_MAX_PAGES ((VMEM_MAP_END - VMALLOC_END) / sizeof(struct page))
130#define VMEM_MAX_PFN min(VMALLOC_START >> PAGE_SHIFT, VMEM_MAX_PAGES)
131#define VMEM_MAX_PHYS ((VMEM_MAX_PFN << PAGE_SHIFT) & ~((16 << 20) - 1))
Christian Borntraeger5fd9c6e2008-01-26 14:11:00 +0100132#define VMEM_MAP ((struct page *) VMALLOC_END)
Christian Borntraeger5fd9c6e2008-01-26 14:11:00 +0100133
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134/*
135 * A 31 bit pagetable entry of S390 has following format:
136 * | PFRA | | OS |
137 * 0 0IP0
138 * 00000000001111111111222222222233
139 * 01234567890123456789012345678901
140 *
141 * I Page-Invalid Bit: Page is not available for address-translation
142 * P Page-Protection Bit: Store access not possible for page
143 *
144 * A 31 bit segmenttable entry of S390 has following format:
145 * | P-table origin | |PTL
146 * 0 IC
147 * 00000000001111111111222222222233
148 * 01234567890123456789012345678901
149 *
150 * I Segment-Invalid Bit: Segment is not available for address-translation
151 * C Common-Segment Bit: Segment is not private (PoP 3-30)
152 * PTL Page-Table-Length: Page-table length (PTL+1*16 entries -> up to 256)
153 *
154 * The 31 bit segmenttable origin of S390 has following format:
155 *
156 * |S-table origin | | STL |
157 * X **GPS
158 * 00000000001111111111222222222233
159 * 01234567890123456789012345678901
160 *
161 * X Space-Switch event:
162 * G Segment-Invalid Bit: *
163 * P Private-Space Bit: Segment is not private (PoP 3-30)
164 * S Storage-Alteration:
165 * STL Segment-Table-Length: Segment-table length (STL+1*16 entries -> up to 2048)
166 *
167 * A 64 bit pagetable entry of S390 has following format:
168 * | PFRA |0IP0| OS |
169 * 0000000000111111111122222222223333333333444444444455555555556666
170 * 0123456789012345678901234567890123456789012345678901234567890123
171 *
172 * I Page-Invalid Bit: Page is not available for address-translation
173 * P Page-Protection Bit: Store access not possible for page
174 *
175 * A 64 bit segmenttable entry of S390 has following format:
176 * | P-table origin | TT
177 * 0000000000111111111122222222223333333333444444444455555555556666
178 * 0123456789012345678901234567890123456789012345678901234567890123
179 *
180 * I Segment-Invalid Bit: Segment is not available for address-translation
181 * C Common-Segment Bit: Segment is not private (PoP 3-30)
182 * P Page-Protection Bit: Store access not possible for page
183 * TT Type 00
184 *
185 * A 64 bit region table entry of S390 has following format:
186 * | S-table origin | TF TTTL
187 * 0000000000111111111122222222223333333333444444444455555555556666
188 * 0123456789012345678901234567890123456789012345678901234567890123
189 *
190 * I Segment-Invalid Bit: Segment is not available for address-translation
191 * TT Type 01
192 * TF
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200193 * TL Table length
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194 *
195 * The 64 bit regiontable origin of S390 has following format:
196 * | region table origon | DTTL
197 * 0000000000111111111122222222223333333333444444444455555555556666
198 * 0123456789012345678901234567890123456789012345678901234567890123
199 *
200 * X Space-Switch event:
201 * G Segment-Invalid Bit:
202 * P Private-Space Bit:
203 * S Storage-Alteration:
204 * R Real space
205 * TL Table-Length:
206 *
207 * A storage key has the following format:
208 * | ACC |F|R|C|0|
209 * 0 3 4 5 6 7
210 * ACC: access key
211 * F : fetch protection bit
212 * R : referenced bit
213 * C : changed bit
214 */
215
216/* Hardware bits in the page table entry */
Martin Schwidefsky83377482006-10-18 18:30:51 +0200217#define _PAGE_RO 0x200 /* HW read-only bit */
218#define _PAGE_INVALID 0x400 /* HW invalid bit */
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200219
220/* Software bits in the page table entry */
Martin Schwidefsky83377482006-10-18 18:30:51 +0200221#define _PAGE_SWT 0x001 /* SW pte type bit t */
222#define _PAGE_SWX 0x002 /* SW pte type bit x */
Nick Piggina08cb622008-04-28 02:13:03 -0700223#define _PAGE_SPECIAL 0x004 /* SW associated with special page */
224#define __HAVE_ARCH_PTE_SPECIAL
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225
Martin Schwidefsky83377482006-10-18 18:30:51 +0200226/* Six different types of pages. */
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200227#define _PAGE_TYPE_EMPTY 0x400
228#define _PAGE_TYPE_NONE 0x401
Martin Schwidefsky83377482006-10-18 18:30:51 +0200229#define _PAGE_TYPE_SWAP 0x403
230#define _PAGE_TYPE_FILE 0x601 /* bit 0x002 is used for offset !! */
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200231#define _PAGE_TYPE_RO 0x200
232#define _PAGE_TYPE_RW 0x000
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100233#define _PAGE_TYPE_EX_RO 0x202
234#define _PAGE_TYPE_EX_RW 0x002
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235
Martin Schwidefsky83377482006-10-18 18:30:51 +0200236/*
237 * PTE type bits are rather complicated. handle_pte_fault uses pte_present,
238 * pte_none and pte_file to find out the pte type WITHOUT holding the page
239 * table lock. ptep_clear_flush on the other hand uses ptep_clear_flush to
240 * invalidate a given pte. ipte sets the hw invalid bit and clears all tlbs
241 * for the page. The page table entry is set to _PAGE_TYPE_EMPTY afterwards.
242 * This change is done while holding the lock, but the intermediate step
243 * of a previously valid pte with the hw invalid bit set can be observed by
244 * handle_pte_fault. That makes it necessary that all valid pte types with
245 * the hw invalid bit set must be distinguishable from the four pte types
246 * empty, none, swap and file.
247 *
248 * irxt ipte irxt
249 * _PAGE_TYPE_EMPTY 1000 -> 1000
250 * _PAGE_TYPE_NONE 1001 -> 1001
251 * _PAGE_TYPE_SWAP 1011 -> 1011
252 * _PAGE_TYPE_FILE 11?1 -> 11?1
253 * _PAGE_TYPE_RO 0100 -> 1100
254 * _PAGE_TYPE_RW 0000 -> 1000
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100255 * _PAGE_TYPE_EX_RO 0110 -> 1110
256 * _PAGE_TYPE_EX_RW 0010 -> 1010
Martin Schwidefsky83377482006-10-18 18:30:51 +0200257 *
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100258 * pte_none is true for bits combinations 1000, 1010, 1100, 1110
Martin Schwidefsky83377482006-10-18 18:30:51 +0200259 * pte_present is true for bits combinations 0000, 0010, 0100, 0110, 1001
260 * pte_file is true for bits combinations 1101, 1111
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100261 * swap pte is 1011 and 0001, 0011, 0101, 0111 are invalid.
Martin Schwidefsky83377482006-10-18 18:30:51 +0200262 */
263
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100264/* Page status table bits for virtualization */
265#define RCP_PCL_BIT 55
266#define RCP_HR_BIT 54
267#define RCP_HC_BIT 53
268#define RCP_GR_BIT 50
269#define RCP_GC_BIT 49
270
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271#ifndef __s390x__
272
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200273/* Bits in the segment table address-space-control-element */
274#define _ASCE_SPACE_SWITCH 0x80000000UL /* space switch event */
275#define _ASCE_ORIGIN_MASK 0x7ffff000UL /* segment table origin */
276#define _ASCE_PRIVATE_SPACE 0x100 /* private space control */
277#define _ASCE_ALT_EVENT 0x80 /* storage alteration event control */
278#define _ASCE_TABLE_LENGTH 0x7f /* 128 x 64 entries = 8k */
279
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280/* Bits in the segment table entry */
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200281#define _SEGMENT_ENTRY_ORIGIN 0x7fffffc0UL /* page table origin */
282#define _SEGMENT_ENTRY_INV 0x20 /* invalid segment table entry */
283#define _SEGMENT_ENTRY_COMMON 0x10 /* common segment bit */
284#define _SEGMENT_ENTRY_PTL 0x0f /* page table length */
285
286#define _SEGMENT_ENTRY (_SEGMENT_ENTRY_PTL)
287#define _SEGMENT_ENTRY_EMPTY (_SEGMENT_ENTRY_INV)
288
289#else /* __s390x__ */
290
291/* Bits in the segment/region table address-space-control-element */
292#define _ASCE_ORIGIN ~0xfffUL/* segment table origin */
293#define _ASCE_PRIVATE_SPACE 0x100 /* private space control */
294#define _ASCE_ALT_EVENT 0x80 /* storage alteration event control */
295#define _ASCE_SPACE_SWITCH 0x40 /* space switch event */
296#define _ASCE_REAL_SPACE 0x20 /* real space control */
297#define _ASCE_TYPE_MASK 0x0c /* asce table type mask */
298#define _ASCE_TYPE_REGION1 0x0c /* region first table type */
299#define _ASCE_TYPE_REGION2 0x08 /* region second table type */
300#define _ASCE_TYPE_REGION3 0x04 /* region third table type */
301#define _ASCE_TYPE_SEGMENT 0x00 /* segment table type */
302#define _ASCE_TABLE_LENGTH 0x03 /* region table length */
303
304/* Bits in the region table entry */
305#define _REGION_ENTRY_ORIGIN ~0xfffUL/* region/segment table origin */
306#define _REGION_ENTRY_INV 0x20 /* invalid region table entry */
307#define _REGION_ENTRY_TYPE_MASK 0x0c /* region/segment table type mask */
308#define _REGION_ENTRY_TYPE_R1 0x0c /* region first table type */
309#define _REGION_ENTRY_TYPE_R2 0x08 /* region second table type */
310#define _REGION_ENTRY_TYPE_R3 0x04 /* region third table type */
311#define _REGION_ENTRY_LENGTH 0x03 /* region third length */
312
313#define _REGION1_ENTRY (_REGION_ENTRY_TYPE_R1 | _REGION_ENTRY_LENGTH)
314#define _REGION1_ENTRY_EMPTY (_REGION_ENTRY_TYPE_R1 | _REGION_ENTRY_INV)
315#define _REGION2_ENTRY (_REGION_ENTRY_TYPE_R2 | _REGION_ENTRY_LENGTH)
316#define _REGION2_ENTRY_EMPTY (_REGION_ENTRY_TYPE_R2 | _REGION_ENTRY_INV)
317#define _REGION3_ENTRY (_REGION_ENTRY_TYPE_R3 | _REGION_ENTRY_LENGTH)
318#define _REGION3_ENTRY_EMPTY (_REGION_ENTRY_TYPE_R3 | _REGION_ENTRY_INV)
319
320/* Bits in the segment table entry */
321#define _SEGMENT_ENTRY_ORIGIN ~0x7ffUL/* segment table origin */
322#define _SEGMENT_ENTRY_RO 0x200 /* page protection bit */
323#define _SEGMENT_ENTRY_INV 0x20 /* invalid segment table entry */
324
325#define _SEGMENT_ENTRY (0)
326#define _SEGMENT_ENTRY_EMPTY (_SEGMENT_ENTRY_INV)
327
328#endif /* __s390x__ */
329
330/*
331 * A user page table pointer has the space-switch-event bit, the
332 * private-space-control bit and the storage-alteration-event-control
333 * bit set. A kernel page table pointer doesn't need them.
334 */
335#define _ASCE_USER_BITS (_ASCE_SPACE_SWITCH | _ASCE_PRIVATE_SPACE | \
336 _ASCE_ALT_EVENT)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337
338/* Bits int the storage key */
339#define _PAGE_CHANGED 0x02 /* HW changed bit */
340#define _PAGE_REFERENCED 0x04 /* HW referenced bit */
341
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342/*
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200343 * Page protection definitions.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344 */
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200345#define PAGE_NONE __pgprot(_PAGE_TYPE_NONE)
346#define PAGE_RO __pgprot(_PAGE_TYPE_RO)
347#define PAGE_RW __pgprot(_PAGE_TYPE_RW)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100348#define PAGE_EX_RO __pgprot(_PAGE_TYPE_EX_RO)
349#define PAGE_EX_RW __pgprot(_PAGE_TYPE_EX_RW)
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200350
351#define PAGE_KERNEL PAGE_RW
352#define PAGE_COPY PAGE_RO
Linus Torvalds1da177e2005-04-16 15:20:36 -0700353
354/*
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100355 * Dependent on the EXEC_PROTECT option s390 can do execute protection.
356 * Write permission always implies read permission. In theory with a
357 * primary/secondary page table execute only can be implemented but
358 * it would cost an additional bit in the pte to distinguish all the
359 * different pte types. To avoid that execute permission currently
360 * implies read permission as well.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361 */
362 /*xwr*/
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200363#define __P000 PAGE_NONE
364#define __P001 PAGE_RO
365#define __P010 PAGE_RO
366#define __P011 PAGE_RO
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100367#define __P100 PAGE_EX_RO
368#define __P101 PAGE_EX_RO
369#define __P110 PAGE_EX_RO
370#define __P111 PAGE_EX_RO
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200372#define __S000 PAGE_NONE
373#define __S001 PAGE_RO
374#define __S010 PAGE_RW
375#define __S011 PAGE_RW
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100376#define __S100 PAGE_EX_RO
377#define __S101 PAGE_EX_RO
378#define __S110 PAGE_EX_RW
379#define __S111 PAGE_EX_RW
380
381#ifndef __s390x__
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200382# define PxD_SHADOW_SHIFT 1
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100383#else /* __s390x__ */
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200384# define PxD_SHADOW_SHIFT 2
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100385#endif /* __s390x__ */
386
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200387static inline void *get_shadow_table(void *table)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100388{
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200389 unsigned long addr, offset;
390 struct page *page;
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100391
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200392 addr = (unsigned long) table;
393 offset = addr & ((PAGE_SIZE << PxD_SHADOW_SHIFT) - 1);
394 page = virt_to_page((void *)(addr ^ offset));
395 return (void *)(addr_t)(page->index ? (page->index | offset) : 0UL);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100396}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397
398/*
399 * Certain architectures need to do special things when PTEs
400 * within a page table are directly modified. Thus, the following
401 * hook is made available.
402 */
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200403static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100404 pte_t *ptep, pte_t entry)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405{
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100406 *ptep = entry;
407 if (mm->context.noexec) {
408 if (!(pte_val(entry) & _PAGE_INVALID) &&
409 (pte_val(entry) & _PAGE_SWX))
410 pte_val(entry) |= _PAGE_RO;
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100411 else
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100412 pte_val(entry) = _PAGE_TYPE_EMPTY;
413 ptep[PTRS_PER_PTE] = entry;
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100414 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416
417/*
418 * pgd/pmd/pte query functions
419 */
420#ifndef __s390x__
421
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800422static inline int pgd_present(pgd_t pgd) { return 1; }
423static inline int pgd_none(pgd_t pgd) { return 0; }
424static inline int pgd_bad(pgd_t pgd) { return 0; }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200426static inline int pud_present(pud_t pud) { return 1; }
427static inline int pud_none(pud_t pud) { return 0; }
428static inline int pud_bad(pud_t pud) { return 0; }
429
Linus Torvalds1da177e2005-04-16 15:20:36 -0700430#else /* __s390x__ */
431
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100432static inline int pgd_present(pgd_t pgd)
433{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100434 if ((pgd_val(pgd) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R2)
435 return 1;
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100436 return (pgd_val(pgd) & _REGION_ENTRY_ORIGIN) != 0UL;
437}
438
439static inline int pgd_none(pgd_t pgd)
440{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100441 if ((pgd_val(pgd) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R2)
442 return 0;
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100443 return (pgd_val(pgd) & _REGION_ENTRY_INV) != 0UL;
444}
445
446static inline int pgd_bad(pgd_t pgd)
447{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100448 /*
449 * With dynamic page table levels the pgd can be a region table
450 * entry or a segment table entry. Check for the bit that are
451 * invalid for either table entry.
452 */
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100453 unsigned long mask =
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100454 ~_SEGMENT_ENTRY_ORIGIN & ~_REGION_ENTRY_INV &
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100455 ~_REGION_ENTRY_TYPE_MASK & ~_REGION_ENTRY_LENGTH;
456 return (pgd_val(pgd) & mask) != 0;
457}
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200458
459static inline int pud_present(pud_t pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100461 if ((pud_val(pud) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R3)
462 return 1;
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100463 return (pud_val(pud) & _REGION_ENTRY_ORIGIN) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464}
465
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200466static inline int pud_none(pud_t pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700467{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100468 if ((pud_val(pud) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R3)
469 return 0;
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100470 return (pud_val(pud) & _REGION_ENTRY_INV) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471}
472
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200473static inline int pud_bad(pud_t pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100475 /*
476 * With dynamic page table levels the pud can be a region table
477 * entry or a segment table entry. Check for the bit that are
478 * invalid for either table entry.
479 */
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100480 unsigned long mask =
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100481 ~_SEGMENT_ENTRY_ORIGIN & ~_REGION_ENTRY_INV &
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100482 ~_REGION_ENTRY_TYPE_MASK & ~_REGION_ENTRY_LENGTH;
483 return (pud_val(pud) & mask) != 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484}
485
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200486#endif /* __s390x__ */
487
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800488static inline int pmd_present(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489{
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100490 return (pmd_val(pmd) & _SEGMENT_ENTRY_ORIGIN) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491}
492
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800493static inline int pmd_none(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700494{
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100495 return (pmd_val(pmd) & _SEGMENT_ENTRY_INV) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496}
497
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800498static inline int pmd_bad(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499{
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200500 unsigned long mask = ~_SEGMENT_ENTRY_ORIGIN & ~_SEGMENT_ENTRY_INV;
501 return (pmd_val(pmd) & mask) != _SEGMENT_ENTRY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502}
503
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800504static inline int pte_none(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505{
Martin Schwidefsky83377482006-10-18 18:30:51 +0200506 return (pte_val(pte) & _PAGE_INVALID) && !(pte_val(pte) & _PAGE_SWT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507}
508
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800509static inline int pte_present(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510{
Martin Schwidefsky83377482006-10-18 18:30:51 +0200511 unsigned long mask = _PAGE_RO | _PAGE_INVALID | _PAGE_SWT | _PAGE_SWX;
512 return (pte_val(pte) & mask) == _PAGE_TYPE_NONE ||
513 (!(pte_val(pte) & _PAGE_INVALID) &&
514 !(pte_val(pte) & _PAGE_SWT));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515}
516
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800517static inline int pte_file(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518{
Martin Schwidefsky83377482006-10-18 18:30:51 +0200519 unsigned long mask = _PAGE_RO | _PAGE_INVALID | _PAGE_SWT;
520 return (pte_val(pte) & mask) == _PAGE_TYPE_FILE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700521}
522
Nick Piggin7e675132008-04-28 02:13:00 -0700523static inline int pte_special(pte_t pte)
524{
Nick Piggina08cb622008-04-28 02:13:03 -0700525 return (pte_val(pte) & _PAGE_SPECIAL);
Nick Piggin7e675132008-04-28 02:13:00 -0700526}
527
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200528#define __HAVE_ARCH_PTE_SAME
529#define pte_same(a,b) (pte_val(a) == pte_val(b))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100531static inline void rcp_lock(pte_t *ptep)
532{
533#ifdef CONFIG_PGSTE
534 unsigned long *pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
535 preempt_disable();
536 while (test_and_set_bit(RCP_PCL_BIT, pgste))
537 ;
538#endif
539}
540
541static inline void rcp_unlock(pte_t *ptep)
542{
543#ifdef CONFIG_PGSTE
544 unsigned long *pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
545 clear_bit(RCP_PCL_BIT, pgste);
546 preempt_enable();
547#endif
548}
549
550/* forward declaration for SetPageUptodate in page-flags.h*/
551static inline void page_clear_dirty(struct page *page);
552#include <linux/page-flags.h>
553
554static inline void ptep_rcp_copy(pte_t *ptep)
555{
556#ifdef CONFIG_PGSTE
557 struct page *page = virt_to_page(pte_val(*ptep));
558 unsigned int skey;
559 unsigned long *pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
560
561 skey = page_get_storage_key(page_to_phys(page));
562 if (skey & _PAGE_CHANGED)
Heiko Carstensc71799c2008-04-04 16:03:34 +0200563 set_bit_simple(RCP_GC_BIT, pgste);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100564 if (skey & _PAGE_REFERENCED)
Heiko Carstensc71799c2008-04-04 16:03:34 +0200565 set_bit_simple(RCP_GR_BIT, pgste);
566 if (test_and_clear_bit_simple(RCP_HC_BIT, pgste))
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100567 SetPageDirty(page);
Heiko Carstensc71799c2008-04-04 16:03:34 +0200568 if (test_and_clear_bit_simple(RCP_HR_BIT, pgste))
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100569 SetPageReferenced(page);
570#endif
571}
572
Linus Torvalds1da177e2005-04-16 15:20:36 -0700573/*
574 * query functions pte_write/pte_dirty/pte_young only work if
575 * pte_present() is true. Undefined behaviour if not..
576 */
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800577static inline int pte_write(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578{
579 return (pte_val(pte) & _PAGE_RO) == 0;
580}
581
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800582static inline int pte_dirty(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583{
584 /* A pte is neither clean nor dirty on s/390. The dirty bit
585 * is in the storage key. See page_test_and_clear_dirty for
586 * details.
587 */
588 return 0;
589}
590
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800591static inline int pte_young(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592{
593 /* A pte is neither young nor old on s/390. The young bit
594 * is in the storage key. See page_test_and_clear_young for
595 * details.
596 */
597 return 0;
598}
599
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600/*
601 * pgd/pmd/pte modification functions
602 */
603
604#ifndef __s390x__
605
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200606#define pgd_clear(pgd) do { } while (0)
607#define pud_clear(pud) do { } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609#else /* __s390x__ */
610
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100611static inline void pgd_clear_kernel(pgd_t * pgd)
612{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100613 if ((pgd_val(*pgd) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R2)
614 pgd_val(*pgd) = _REGION2_ENTRY_EMPTY;
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100615}
616
617static inline void pgd_clear(pgd_t * pgd)
618{
619 pgd_t *shadow = get_shadow_table(pgd);
620
621 pgd_clear_kernel(pgd);
622 if (shadow)
623 pgd_clear_kernel(shadow);
624}
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200625
626static inline void pud_clear_kernel(pud_t *pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700627{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100628 if ((pud_val(*pud) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3)
629 pud_val(*pud) = _REGION3_ENTRY_EMPTY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700630}
631
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100632static inline void pud_clear(pud_t *pud)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100633{
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200634 pud_t *shadow = get_shadow_table(pud);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100635
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200636 pud_clear_kernel(pud);
637 if (shadow)
638 pud_clear_kernel(shadow);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100639}
640
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100641#endif /* __s390x__ */
642
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100643static inline void pmd_clear_kernel(pmd_t * pmdp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700644{
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200645 pmd_val(*pmdp) = _SEGMENT_ENTRY_EMPTY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646}
647
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100648static inline void pmd_clear(pmd_t *pmd)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100649{
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100650 pmd_t *shadow = get_shadow_table(pmd);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100651
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100652 pmd_clear_kernel(pmd);
653 if (shadow)
654 pmd_clear_kernel(shadow);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100655}
656
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800657static inline void pte_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700658{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100659 if (mm->context.pgstes)
660 ptep_rcp_copy(ptep);
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200661 pte_val(*ptep) = _PAGE_TYPE_EMPTY;
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100662 if (mm->context.noexec)
663 pte_val(ptep[PTRS_PER_PTE]) = _PAGE_TYPE_EMPTY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664}
665
666/*
667 * The following pte modification functions only work if
668 * pte_present() is true. Undefined behaviour if not..
669 */
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800670static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700671{
672 pte_val(pte) &= PAGE_MASK;
673 pte_val(pte) |= pgprot_val(newprot);
674 return pte;
675}
676
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800677static inline pte_t pte_wrprotect(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700678{
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200679 /* Do not clobber _PAGE_TYPE_NONE pages! */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700680 if (!(pte_val(pte) & _PAGE_INVALID))
681 pte_val(pte) |= _PAGE_RO;
682 return pte;
683}
684
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800685static inline pte_t pte_mkwrite(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700686{
687 pte_val(pte) &= ~_PAGE_RO;
688 return pte;
689}
690
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800691static inline pte_t pte_mkclean(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700692{
693 /* The only user of pte_mkclean is the fork() code.
694 We must *not* clear the *physical* page dirty bit
695 just because fork() wants to clear the dirty bit in
696 *one* of the page's mappings. So we just do nothing. */
697 return pte;
698}
699
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800700static inline pte_t pte_mkdirty(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700701{
702 /* We do not explicitly set the dirty bit because the
703 * sske instruction is slow. It is faster to let the
704 * next instruction set the dirty bit.
705 */
706 return pte;
707}
708
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800709static inline pte_t pte_mkold(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700710{
711 /* S/390 doesn't keep its dirty/referenced bit in the pte.
712 * There is no point in clearing the real referenced bit.
713 */
714 return pte;
715}
716
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800717static inline pte_t pte_mkyoung(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700718{
719 /* S/390 doesn't keep its dirty/referenced bit in the pte.
720 * There is no point in setting the real referenced bit.
721 */
722 return pte;
723}
724
Nick Piggin7e675132008-04-28 02:13:00 -0700725static inline pte_t pte_mkspecial(pte_t pte)
726{
Nick Piggina08cb622008-04-28 02:13:03 -0700727 pte_val(pte) |= _PAGE_SPECIAL;
Nick Piggin7e675132008-04-28 02:13:00 -0700728 return pte;
729}
730
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200731#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
732static inline int ptep_test_and_clear_young(struct vm_area_struct *vma,
733 unsigned long addr, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700734{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100735#ifdef CONFIG_PGSTE
736 unsigned long physpage;
737 int young;
738 unsigned long *pgste;
739
740 if (!vma->vm_mm->context.pgstes)
741 return 0;
742 physpage = pte_val(*ptep) & PAGE_MASK;
743 pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
744
745 young = ((page_get_storage_key(physpage) & _PAGE_REFERENCED) != 0);
746 rcp_lock(ptep);
747 if (young)
Heiko Carstensc71799c2008-04-04 16:03:34 +0200748 set_bit_simple(RCP_GR_BIT, pgste);
749 young |= test_and_clear_bit_simple(RCP_HR_BIT, pgste);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100750 rcp_unlock(ptep);
751 return young;
752#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700753 return 0;
754}
755
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200756#define __HAVE_ARCH_PTEP_CLEAR_YOUNG_FLUSH
757static inline int ptep_clear_flush_young(struct vm_area_struct *vma,
758 unsigned long address, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700759{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100760 /* No need to flush TLB
761 * On s390 reference bits are in storage key and never in TLB
762 * With virtualization we handle the reference bit, without we
763 * we can simply return */
764#ifdef CONFIG_PGSTE
765 return ptep_test_and_clear_young(vma, address, ptep);
766#endif
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200767 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700768}
769
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200770static inline void __ptep_ipte(unsigned long address, pte_t *ptep)
771{
772 if (!(pte_val(*ptep) & _PAGE_INVALID)) {
773#ifndef __s390x__
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100774 /* pto must point to the start of the segment table */
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200775 pte_t *pto = (pte_t *) (((unsigned long) ptep) & 0x7ffffc00);
776#else
777 /* ipte in zarch mode can do the math */
778 pte_t *pto = ptep;
779#endif
Martin Schwidefsky94c12cc2006-09-28 16:56:43 +0200780 asm volatile(
781 " ipte %2,%3"
782 : "=m" (*ptep) : "m" (*ptep),
783 "a" (pto), "a" (address));
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200784 }
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200785}
786
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100787static inline void ptep_invalidate(struct mm_struct *mm,
788 unsigned long address, pte_t *ptep)
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700789{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100790 if (mm->context.pgstes) {
791 rcp_lock(ptep);
792 __ptep_ipte(address, ptep);
793 ptep_rcp_copy(ptep);
794 pte_val(*ptep) = _PAGE_TYPE_EMPTY;
795 rcp_unlock(ptep);
796 return;
797 }
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700798 __ptep_ipte(address, ptep);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100799 pte_val(*ptep) = _PAGE_TYPE_EMPTY;
800 if (mm->context.noexec) {
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100801 __ptep_ipte(address, ptep + PTRS_PER_PTE);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100802 pte_val(*(ptep + PTRS_PER_PTE)) = _PAGE_TYPE_EMPTY;
803 }
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700804}
805
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200806/*
807 * This is hard to understand. ptep_get_and_clear and ptep_clear_flush
808 * both clear the TLB for the unmapped pte. The reason is that
809 * ptep_get_and_clear is used in common code (e.g. change_pte_range)
810 * to modify an active pte. The sequence is
811 * 1) ptep_get_and_clear
812 * 2) set_pte_at
813 * 3) flush_tlb_range
814 * On s390 the tlb needs to get flushed with the modification of the pte
815 * if the pte is active. The only way how this can be implemented is to
816 * have ptep_get_and_clear do the tlb flush. In exchange flush_tlb_range
817 * is a nop.
818 */
819#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
820#define ptep_get_and_clear(__mm, __address, __ptep) \
821({ \
822 pte_t __pte = *(__ptep); \
823 if (atomic_read(&(__mm)->mm_users) > 1 || \
824 (__mm) != current->active_mm) \
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100825 ptep_invalidate(__mm, __address, __ptep); \
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200826 else \
827 pte_clear((__mm), (__address), (__ptep)); \
828 __pte; \
829})
830
831#define __HAVE_ARCH_PTEP_CLEAR_FLUSH
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700832static inline pte_t ptep_clear_flush(struct vm_area_struct *vma,
833 unsigned long address, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700834{
835 pte_t pte = *ptep;
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100836 ptep_invalidate(vma->vm_mm, address, ptep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700837 return pte;
838}
839
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200840/*
841 * The batched pte unmap code uses ptep_get_and_clear_full to clear the
842 * ptes. Here an optimization is possible. tlb_gather_mmu flushes all
843 * tlbs of an mm if it can guarantee that the ptes of the mm_struct
844 * cannot be accessed while the batched unmap is running. In this case
845 * full==1 and a simple pte_clear is enough. See tlb.h.
846 */
847#define __HAVE_ARCH_PTEP_GET_AND_CLEAR_FULL
848static inline pte_t ptep_get_and_clear_full(struct mm_struct *mm,
849 unsigned long addr,
850 pte_t *ptep, int full)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700851{
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200852 pte_t pte = *ptep;
853
854 if (full)
855 pte_clear(mm, addr, ptep);
856 else
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100857 ptep_invalidate(mm, addr, ptep);
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200858 return pte;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700859}
860
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200861#define __HAVE_ARCH_PTEP_SET_WRPROTECT
862#define ptep_set_wrprotect(__mm, __addr, __ptep) \
863({ \
864 pte_t __pte = *(__ptep); \
865 if (pte_write(__pte)) { \
866 if (atomic_read(&(__mm)->mm_users) > 1 || \
867 (__mm) != current->active_mm) \
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100868 ptep_invalidate(__mm, __addr, __ptep); \
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200869 set_pte_at(__mm, __addr, __ptep, pte_wrprotect(__pte)); \
870 } \
871})
872
873#define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700874#define ptep_set_access_flags(__vma, __addr, __ptep, __entry, __dirty) \
875({ \
876 int __changed = !pte_same(*(__ptep), __entry); \
877 if (__changed) { \
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100878 ptep_invalidate((__vma)->vm_mm, __addr, __ptep); \
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700879 set_pte_at((__vma)->vm_mm, __addr, __ptep, __entry); \
880 } \
881 __changed; \
Benjamin Herrenschmidt8dab5242007-06-16 10:16:12 -0700882})
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883
884/*
885 * Test and clear dirty bit in storage key.
886 * We can't clear the changed bit atomically. This is a potential
887 * race against modification of the referenced bit. This function
888 * should therefore only be called if it is not mapped in any
889 * address space.
890 */
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200891#define __HAVE_ARCH_PAGE_TEST_DIRTY
Martin Schwidefsky6c210482007-04-27 16:01:57 +0200892static inline int page_test_dirty(struct page *page)
Heiko Carstens2dcea572006-09-29 01:58:41 -0700893{
Martin Schwidefsky6c210482007-04-27 16:01:57 +0200894 return (page_get_storage_key(page_to_phys(page)) & _PAGE_CHANGED) != 0;
895}
Heiko Carstens2dcea572006-09-29 01:58:41 -0700896
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200897#define __HAVE_ARCH_PAGE_CLEAR_DIRTY
Martin Schwidefsky6c210482007-04-27 16:01:57 +0200898static inline void page_clear_dirty(struct page *page)
899{
900 page_set_storage_key(page_to_phys(page), PAGE_DEFAULT_KEY);
Heiko Carstens2dcea572006-09-29 01:58:41 -0700901}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700902
903/*
904 * Test and clear referenced bit in storage key.
905 */
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200906#define __HAVE_ARCH_PAGE_TEST_AND_CLEAR_YOUNG
Heiko Carstens2dcea572006-09-29 01:58:41 -0700907static inline int page_test_and_clear_young(struct page *page)
908{
Heiko Carstens0b2b6e12006-10-04 20:02:23 +0200909 unsigned long physpage = page_to_phys(page);
Heiko Carstens2dcea572006-09-29 01:58:41 -0700910 int ccode;
911
Heiko Carstens0b2b6e12006-10-04 20:02:23 +0200912 asm volatile(
913 " rrbe 0,%1\n"
914 " ipm %0\n"
915 " srl %0,28\n"
Heiko Carstens2dcea572006-09-29 01:58:41 -0700916 : "=d" (ccode) : "a" (physpage) : "cc" );
917 return ccode & 2;
918}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700919
920/*
921 * Conversion functions: convert a page and protection to a page entry,
922 * and a page entry and page directory to the page they refer to.
923 */
924static inline pte_t mk_pte_phys(unsigned long physpage, pgprot_t pgprot)
925{
926 pte_t __pte;
927 pte_val(__pte) = physpage + pgprot_val(pgprot);
928 return __pte;
929}
930
Heiko Carstens2dcea572006-09-29 01:58:41 -0700931static inline pte_t mk_pte(struct page *page, pgprot_t pgprot)
932{
Heiko Carstens0b2b6e12006-10-04 20:02:23 +0200933 unsigned long physpage = page_to_phys(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700934
Heiko Carstens2dcea572006-09-29 01:58:41 -0700935 return mk_pte_phys(physpage, pgprot);
936}
937
Linus Torvalds1da177e2005-04-16 15:20:36 -0700938#define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD-1))
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200939#define pud_index(address) (((address) >> PUD_SHIFT) & (PTRS_PER_PUD-1))
940#define pmd_index(address) (((address) >> PMD_SHIFT) & (PTRS_PER_PMD-1))
941#define pte_index(address) (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE-1))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700942
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200943#define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700944#define pgd_offset_k(address) pgd_offset(&init_mm, address)
945
946#ifndef __s390x__
947
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200948#define pmd_deref(pmd) (pmd_val(pmd) & _SEGMENT_ENTRY_ORIGIN)
949#define pud_deref(pmd) ({ BUG(); 0UL; })
950#define pgd_deref(pmd) ({ BUG(); 0UL; })
951
952#define pud_offset(pgd, address) ((pud_t *) pgd)
953#define pmd_offset(pud, address) ((pmd_t *) pud + pmd_index(address))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700954
955#else /* __s390x__ */
956
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200957#define pmd_deref(pmd) (pmd_val(pmd) & _SEGMENT_ENTRY_ORIGIN)
958#define pud_deref(pud) (pud_val(pud) & _REGION_ENTRY_ORIGIN)
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100959#define pgd_deref(pgd) (pgd_val(pgd) & _REGION_ENTRY_ORIGIN)
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200960
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100961static inline pud_t *pud_offset(pgd_t *pgd, unsigned long address)
962{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100963 pud_t *pud = (pud_t *) pgd;
964 if ((pgd_val(*pgd) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R2)
965 pud = (pud_t *) pgd_deref(*pgd);
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100966 return pud + pud_index(address);
967}
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200968
969static inline pmd_t *pmd_offset(pud_t *pud, unsigned long address)
970{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100971 pmd_t *pmd = (pmd_t *) pud;
972 if ((pud_val(*pud) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3)
973 pmd = (pmd_t *) pud_deref(*pud);
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200974 return pmd + pmd_index(address);
975}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700976
977#endif /* __s390x__ */
978
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200979#define pfn_pte(pfn,pgprot) mk_pte_phys(__pa((pfn) << PAGE_SHIFT),(pgprot))
980#define pte_pfn(x) (pte_val(x) >> PAGE_SHIFT)
981#define pte_page(x) pfn_to_page(pte_pfn(x))
982
983#define pmd_page(pmd) pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT)
984
985/* Find an entry in the lowest level page table.. */
986#define pte_offset(pmd, addr) ((pte_t *) pmd_deref(*(pmd)) + pte_index(addr))
987#define pte_offset_kernel(pmd, address) pte_offset(pmd,address)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700988#define pte_offset_map(pmd, address) pte_offset_kernel(pmd, address)
989#define pte_offset_map_nested(pmd, address) pte_offset_kernel(pmd, address)
990#define pte_unmap(pte) do { } while (0)
991#define pte_unmap_nested(pte) do { } while (0)
992
993/*
994 * 31 bit swap entry format:
995 * A page-table entry has some bits we have to treat in a special way.
996 * Bits 0, 20 and bit 23 have to be zero, otherwise an specification
997 * exception will occur instead of a page translation exception. The
998 * specifiation exception has the bad habit not to store necessary
999 * information in the lowcore.
1000 * Bit 21 and bit 22 are the page invalid bit and the page protection
1001 * bit. We set both to indicate a swapped page.
1002 * Bit 30 and 31 are used to distinguish the different page types. For
1003 * a swapped page these bits need to be zero.
1004 * This leaves the bits 1-19 and bits 24-29 to store type and offset.
1005 * We use the 5 bits from 25-29 for the type and the 20 bits from 1-19
1006 * plus 24 for the offset.
1007 * 0| offset |0110|o|type |00|
1008 * 0 0000000001111111111 2222 2 22222 33
1009 * 0 1234567890123456789 0123 4 56789 01
1010 *
1011 * 64 bit swap entry format:
1012 * A page-table entry has some bits we have to treat in a special way.
1013 * Bits 52 and bit 55 have to be zero, otherwise an specification
1014 * exception will occur instead of a page translation exception. The
1015 * specifiation exception has the bad habit not to store necessary
1016 * information in the lowcore.
1017 * Bit 53 and bit 54 are the page invalid bit and the page protection
1018 * bit. We set both to indicate a swapped page.
1019 * Bit 62 and 63 are used to distinguish the different page types. For
1020 * a swapped page these bits need to be zero.
1021 * This leaves the bits 0-51 and bits 56-61 to store type and offset.
1022 * We use the 5 bits from 57-61 for the type and the 53 bits from 0-51
1023 * plus 56 for the offset.
1024 * | offset |0110|o|type |00|
1025 * 0000000000111111111122222222223333333333444444444455 5555 5 55566 66
1026 * 0123456789012345678901234567890123456789012345678901 2345 6 78901 23
1027 */
1028#ifndef __s390x__
1029#define __SWP_OFFSET_MASK (~0UL >> 12)
1030#else
1031#define __SWP_OFFSET_MASK (~0UL >> 11)
1032#endif
Adrian Bunk4448aaf2005-11-08 21:34:42 -08001033static inline pte_t mk_swap_pte(unsigned long type, unsigned long offset)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001034{
1035 pte_t pte;
1036 offset &= __SWP_OFFSET_MASK;
Gerald Schaefer9282ed92006-09-20 15:59:37 +02001037 pte_val(pte) = _PAGE_TYPE_SWAP | ((type & 0x1f) << 2) |
Linus Torvalds1da177e2005-04-16 15:20:36 -07001038 ((offset & 1UL) << 7) | ((offset & ~1UL) << 11);
1039 return pte;
1040}
1041
1042#define __swp_type(entry) (((entry).val >> 2) & 0x1f)
1043#define __swp_offset(entry) (((entry).val >> 11) | (((entry).val >> 7) & 1))
1044#define __swp_entry(type,offset) ((swp_entry_t) { pte_val(mk_swap_pte((type),(offset))) })
1045
1046#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
1047#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
1048
1049#ifndef __s390x__
1050# define PTE_FILE_MAX_BITS 26
1051#else /* __s390x__ */
1052# define PTE_FILE_MAX_BITS 59
1053#endif /* __s390x__ */
1054
1055#define pte_to_pgoff(__pte) \
1056 ((((__pte).pte >> 12) << 7) + (((__pte).pte >> 1) & 0x7f))
1057
1058#define pgoff_to_pte(__off) \
1059 ((pte_t) { ((((__off) & 0x7f) << 1) + (((__off) >> 7) << 12)) \
Gerald Schaefer9282ed92006-09-20 15:59:37 +02001060 | _PAGE_TYPE_FILE })
Linus Torvalds1da177e2005-04-16 15:20:36 -07001061
1062#endif /* !__ASSEMBLY__ */
1063
1064#define kern_addr_valid(addr) (1)
1065
Heiko Carstensf4eb07c2006-12-08 15:56:07 +01001066extern int add_shared_memory(unsigned long start, unsigned long size);
1067extern int remove_shared_memory(unsigned long start, unsigned long size);
Carsten Otte402b0862008-03-25 18:47:10 +01001068extern int s390_enable_sie(void);
Heiko Carstensf4eb07c2006-12-08 15:56:07 +01001069
Linus Torvalds1da177e2005-04-16 15:20:36 -07001070/*
1071 * No page table caches to initialise
1072 */
1073#define pgtable_cache_init() do { } while (0)
1074
Heiko Carstensf4eb07c2006-12-08 15:56:07 +01001075#define __HAVE_ARCH_MEMMAP_INIT
1076extern void memmap_init(unsigned long, int, unsigned long, unsigned long);
1077
Linus Torvalds1da177e2005-04-16 15:20:36 -07001078#include <asm-generic/pgtable.h>
1079
1080#endif /* _S390_PAGE_H */