blob: fd336f2e2a7a7cece82e728f59238d74e74e0c7a [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/*
Gerald Schaefer53492b12008-04-30 13:38:46 +0200237 * Only four types for huge pages, using the invalid bit and protection bit
238 * of a segment table entry.
239 */
240#define _HPAGE_TYPE_EMPTY 0x020 /* _SEGMENT_ENTRY_INV */
241#define _HPAGE_TYPE_NONE 0x220
242#define _HPAGE_TYPE_RO 0x200 /* _SEGMENT_ENTRY_RO */
243#define _HPAGE_TYPE_RW 0x000
244
245/*
Martin Schwidefsky83377482006-10-18 18:30:51 +0200246 * PTE type bits are rather complicated. handle_pte_fault uses pte_present,
247 * pte_none and pte_file to find out the pte type WITHOUT holding the page
248 * table lock. ptep_clear_flush on the other hand uses ptep_clear_flush to
249 * invalidate a given pte. ipte sets the hw invalid bit and clears all tlbs
250 * for the page. The page table entry is set to _PAGE_TYPE_EMPTY afterwards.
251 * This change is done while holding the lock, but the intermediate step
252 * of a previously valid pte with the hw invalid bit set can be observed by
253 * handle_pte_fault. That makes it necessary that all valid pte types with
254 * the hw invalid bit set must be distinguishable from the four pte types
255 * empty, none, swap and file.
256 *
257 * irxt ipte irxt
258 * _PAGE_TYPE_EMPTY 1000 -> 1000
259 * _PAGE_TYPE_NONE 1001 -> 1001
260 * _PAGE_TYPE_SWAP 1011 -> 1011
261 * _PAGE_TYPE_FILE 11?1 -> 11?1
262 * _PAGE_TYPE_RO 0100 -> 1100
263 * _PAGE_TYPE_RW 0000 -> 1000
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100264 * _PAGE_TYPE_EX_RO 0110 -> 1110
265 * _PAGE_TYPE_EX_RW 0010 -> 1010
Martin Schwidefsky83377482006-10-18 18:30:51 +0200266 *
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100267 * pte_none is true for bits combinations 1000, 1010, 1100, 1110
Martin Schwidefsky83377482006-10-18 18:30:51 +0200268 * pte_present is true for bits combinations 0000, 0010, 0100, 0110, 1001
269 * pte_file is true for bits combinations 1101, 1111
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100270 * swap pte is 1011 and 0001, 0011, 0101, 0111 are invalid.
Martin Schwidefsky83377482006-10-18 18:30:51 +0200271 */
272
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100273/* Page status table bits for virtualization */
274#define RCP_PCL_BIT 55
275#define RCP_HR_BIT 54
276#define RCP_HC_BIT 53
277#define RCP_GR_BIT 50
278#define RCP_GC_BIT 49
279
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280#ifndef __s390x__
281
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200282/* Bits in the segment table address-space-control-element */
283#define _ASCE_SPACE_SWITCH 0x80000000UL /* space switch event */
284#define _ASCE_ORIGIN_MASK 0x7ffff000UL /* segment table origin */
285#define _ASCE_PRIVATE_SPACE 0x100 /* private space control */
286#define _ASCE_ALT_EVENT 0x80 /* storage alteration event control */
287#define _ASCE_TABLE_LENGTH 0x7f /* 128 x 64 entries = 8k */
288
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289/* Bits in the segment table entry */
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200290#define _SEGMENT_ENTRY_ORIGIN 0x7fffffc0UL /* page table origin */
291#define _SEGMENT_ENTRY_INV 0x20 /* invalid segment table entry */
292#define _SEGMENT_ENTRY_COMMON 0x10 /* common segment bit */
293#define _SEGMENT_ENTRY_PTL 0x0f /* page table length */
294
295#define _SEGMENT_ENTRY (_SEGMENT_ENTRY_PTL)
296#define _SEGMENT_ENTRY_EMPTY (_SEGMENT_ENTRY_INV)
297
298#else /* __s390x__ */
299
300/* Bits in the segment/region table address-space-control-element */
301#define _ASCE_ORIGIN ~0xfffUL/* segment table origin */
302#define _ASCE_PRIVATE_SPACE 0x100 /* private space control */
303#define _ASCE_ALT_EVENT 0x80 /* storage alteration event control */
304#define _ASCE_SPACE_SWITCH 0x40 /* space switch event */
305#define _ASCE_REAL_SPACE 0x20 /* real space control */
306#define _ASCE_TYPE_MASK 0x0c /* asce table type mask */
307#define _ASCE_TYPE_REGION1 0x0c /* region first table type */
308#define _ASCE_TYPE_REGION2 0x08 /* region second table type */
309#define _ASCE_TYPE_REGION3 0x04 /* region third table type */
310#define _ASCE_TYPE_SEGMENT 0x00 /* segment table type */
311#define _ASCE_TABLE_LENGTH 0x03 /* region table length */
312
313/* Bits in the region table entry */
314#define _REGION_ENTRY_ORIGIN ~0xfffUL/* region/segment table origin */
315#define _REGION_ENTRY_INV 0x20 /* invalid region table entry */
316#define _REGION_ENTRY_TYPE_MASK 0x0c /* region/segment table type mask */
317#define _REGION_ENTRY_TYPE_R1 0x0c /* region first table type */
318#define _REGION_ENTRY_TYPE_R2 0x08 /* region second table type */
319#define _REGION_ENTRY_TYPE_R3 0x04 /* region third table type */
320#define _REGION_ENTRY_LENGTH 0x03 /* region third length */
321
322#define _REGION1_ENTRY (_REGION_ENTRY_TYPE_R1 | _REGION_ENTRY_LENGTH)
323#define _REGION1_ENTRY_EMPTY (_REGION_ENTRY_TYPE_R1 | _REGION_ENTRY_INV)
324#define _REGION2_ENTRY (_REGION_ENTRY_TYPE_R2 | _REGION_ENTRY_LENGTH)
325#define _REGION2_ENTRY_EMPTY (_REGION_ENTRY_TYPE_R2 | _REGION_ENTRY_INV)
326#define _REGION3_ENTRY (_REGION_ENTRY_TYPE_R3 | _REGION_ENTRY_LENGTH)
327#define _REGION3_ENTRY_EMPTY (_REGION_ENTRY_TYPE_R3 | _REGION_ENTRY_INV)
328
329/* Bits in the segment table entry */
330#define _SEGMENT_ENTRY_ORIGIN ~0x7ffUL/* segment table origin */
331#define _SEGMENT_ENTRY_RO 0x200 /* page protection bit */
332#define _SEGMENT_ENTRY_INV 0x20 /* invalid segment table entry */
333
334#define _SEGMENT_ENTRY (0)
335#define _SEGMENT_ENTRY_EMPTY (_SEGMENT_ENTRY_INV)
336
Gerald Schaefer53492b12008-04-30 13:38:46 +0200337#define _SEGMENT_ENTRY_LARGE 0x400 /* STE-format control, large page */
338#define _SEGMENT_ENTRY_CO 0x100 /* change-recording override */
339
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200340#endif /* __s390x__ */
341
342/*
343 * A user page table pointer has the space-switch-event bit, the
344 * private-space-control bit and the storage-alteration-event-control
345 * bit set. A kernel page table pointer doesn't need them.
346 */
347#define _ASCE_USER_BITS (_ASCE_SPACE_SWITCH | _ASCE_PRIVATE_SPACE | \
348 _ASCE_ALT_EVENT)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349
350/* Bits int the storage key */
351#define _PAGE_CHANGED 0x02 /* HW changed bit */
352#define _PAGE_REFERENCED 0x04 /* HW referenced bit */
353
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354/*
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200355 * Page protection definitions.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356 */
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200357#define PAGE_NONE __pgprot(_PAGE_TYPE_NONE)
358#define PAGE_RO __pgprot(_PAGE_TYPE_RO)
359#define PAGE_RW __pgprot(_PAGE_TYPE_RW)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100360#define PAGE_EX_RO __pgprot(_PAGE_TYPE_EX_RO)
361#define PAGE_EX_RW __pgprot(_PAGE_TYPE_EX_RW)
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200362
363#define PAGE_KERNEL PAGE_RW
364#define PAGE_COPY PAGE_RO
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365
366/*
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100367 * Dependent on the EXEC_PROTECT option s390 can do execute protection.
368 * Write permission always implies read permission. In theory with a
369 * primary/secondary page table execute only can be implemented but
370 * it would cost an additional bit in the pte to distinguish all the
371 * different pte types. To avoid that execute permission currently
372 * implies read permission as well.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700373 */
374 /*xwr*/
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200375#define __P000 PAGE_NONE
376#define __P001 PAGE_RO
377#define __P010 PAGE_RO
378#define __P011 PAGE_RO
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100379#define __P100 PAGE_EX_RO
380#define __P101 PAGE_EX_RO
381#define __P110 PAGE_EX_RO
382#define __P111 PAGE_EX_RO
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200384#define __S000 PAGE_NONE
385#define __S001 PAGE_RO
386#define __S010 PAGE_RW
387#define __S011 PAGE_RW
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100388#define __S100 PAGE_EX_RO
389#define __S101 PAGE_EX_RO
390#define __S110 PAGE_EX_RW
391#define __S111 PAGE_EX_RW
392
393#ifndef __s390x__
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200394# define PxD_SHADOW_SHIFT 1
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100395#else /* __s390x__ */
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200396# define PxD_SHADOW_SHIFT 2
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100397#endif /* __s390x__ */
398
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200399static inline void *get_shadow_table(void *table)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100400{
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200401 unsigned long addr, offset;
402 struct page *page;
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100403
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200404 addr = (unsigned long) table;
405 offset = addr & ((PAGE_SIZE << PxD_SHADOW_SHIFT) - 1);
406 page = virt_to_page((void *)(addr ^ offset));
407 return (void *)(addr_t)(page->index ? (page->index | offset) : 0UL);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100408}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409
410/*
411 * Certain architectures need to do special things when PTEs
412 * within a page table are directly modified. Thus, the following
413 * hook is made available.
414 */
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200415static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100416 pte_t *ptep, pte_t entry)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417{
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100418 *ptep = entry;
419 if (mm->context.noexec) {
420 if (!(pte_val(entry) & _PAGE_INVALID) &&
421 (pte_val(entry) & _PAGE_SWX))
422 pte_val(entry) |= _PAGE_RO;
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100423 else
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100424 pte_val(entry) = _PAGE_TYPE_EMPTY;
425 ptep[PTRS_PER_PTE] = entry;
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100426 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700427}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428
429/*
430 * pgd/pmd/pte query functions
431 */
432#ifndef __s390x__
433
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800434static inline int pgd_present(pgd_t pgd) { return 1; }
435static inline int pgd_none(pgd_t pgd) { return 0; }
436static inline int pgd_bad(pgd_t pgd) { return 0; }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200438static inline int pud_present(pud_t pud) { return 1; }
439static inline int pud_none(pud_t pud) { return 0; }
440static inline int pud_bad(pud_t pud) { return 0; }
441
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442#else /* __s390x__ */
443
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100444static inline int pgd_present(pgd_t pgd)
445{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100446 if ((pgd_val(pgd) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R2)
447 return 1;
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100448 return (pgd_val(pgd) & _REGION_ENTRY_ORIGIN) != 0UL;
449}
450
451static inline int pgd_none(pgd_t pgd)
452{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100453 if ((pgd_val(pgd) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R2)
454 return 0;
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100455 return (pgd_val(pgd) & _REGION_ENTRY_INV) != 0UL;
456}
457
458static inline int pgd_bad(pgd_t pgd)
459{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100460 /*
461 * With dynamic page table levels the pgd can be a region table
462 * entry or a segment table entry. Check for the bit that are
463 * invalid for either table entry.
464 */
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100465 unsigned long mask =
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100466 ~_SEGMENT_ENTRY_ORIGIN & ~_REGION_ENTRY_INV &
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100467 ~_REGION_ENTRY_TYPE_MASK & ~_REGION_ENTRY_LENGTH;
468 return (pgd_val(pgd) & mask) != 0;
469}
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200470
471static inline int pud_present(pud_t pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700472{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100473 if ((pud_val(pud) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R3)
474 return 1;
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100475 return (pud_val(pud) & _REGION_ENTRY_ORIGIN) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476}
477
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200478static inline int pud_none(pud_t pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100480 if ((pud_val(pud) & _REGION_ENTRY_TYPE_MASK) < _REGION_ENTRY_TYPE_R3)
481 return 0;
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100482 return (pud_val(pud) & _REGION_ENTRY_INV) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483}
484
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200485static inline int pud_bad(pud_t pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100487 /*
488 * With dynamic page table levels the pud can be a region table
489 * entry or a segment table entry. Check for the bit that are
490 * invalid for either table entry.
491 */
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100492 unsigned long mask =
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100493 ~_SEGMENT_ENTRY_ORIGIN & ~_REGION_ENTRY_INV &
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100494 ~_REGION_ENTRY_TYPE_MASK & ~_REGION_ENTRY_LENGTH;
495 return (pud_val(pud) & mask) != 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496}
497
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200498#endif /* __s390x__ */
499
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800500static inline int pmd_present(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501{
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100502 return (pmd_val(pmd) & _SEGMENT_ENTRY_ORIGIN) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503}
504
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800505static inline int pmd_none(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700506{
Martin Schwidefsky0d017922007-12-17 16:25:48 +0100507 return (pmd_val(pmd) & _SEGMENT_ENTRY_INV) != 0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508}
509
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800510static inline int pmd_bad(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511{
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200512 unsigned long mask = ~_SEGMENT_ENTRY_ORIGIN & ~_SEGMENT_ENTRY_INV;
513 return (pmd_val(pmd) & mask) != _SEGMENT_ENTRY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514}
515
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800516static inline int pte_none(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700517{
Martin Schwidefsky83377482006-10-18 18:30:51 +0200518 return (pte_val(pte) & _PAGE_INVALID) && !(pte_val(pte) & _PAGE_SWT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519}
520
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800521static inline int pte_present(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522{
Martin Schwidefsky83377482006-10-18 18:30:51 +0200523 unsigned long mask = _PAGE_RO | _PAGE_INVALID | _PAGE_SWT | _PAGE_SWX;
524 return (pte_val(pte) & mask) == _PAGE_TYPE_NONE ||
525 (!(pte_val(pte) & _PAGE_INVALID) &&
526 !(pte_val(pte) & _PAGE_SWT));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527}
528
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800529static inline int pte_file(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530{
Martin Schwidefsky83377482006-10-18 18:30:51 +0200531 unsigned long mask = _PAGE_RO | _PAGE_INVALID | _PAGE_SWT;
532 return (pte_val(pte) & mask) == _PAGE_TYPE_FILE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700533}
534
Nick Piggin7e675132008-04-28 02:13:00 -0700535static inline int pte_special(pte_t pte)
536{
Nick Piggina08cb622008-04-28 02:13:03 -0700537 return (pte_val(pte) & _PAGE_SPECIAL);
Nick Piggin7e675132008-04-28 02:13:00 -0700538}
539
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200540#define __HAVE_ARCH_PTE_SAME
541#define pte_same(a,b) (pte_val(a) == pte_val(b))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700542
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100543static inline void rcp_lock(pte_t *ptep)
544{
545#ifdef CONFIG_PGSTE
546 unsigned long *pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
547 preempt_disable();
548 while (test_and_set_bit(RCP_PCL_BIT, pgste))
549 ;
550#endif
551}
552
553static inline void rcp_unlock(pte_t *ptep)
554{
555#ifdef CONFIG_PGSTE
556 unsigned long *pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
557 clear_bit(RCP_PCL_BIT, pgste);
558 preempt_enable();
559#endif
560}
561
562/* forward declaration for SetPageUptodate in page-flags.h*/
563static inline void page_clear_dirty(struct page *page);
564#include <linux/page-flags.h>
565
566static inline void ptep_rcp_copy(pte_t *ptep)
567{
568#ifdef CONFIG_PGSTE
569 struct page *page = virt_to_page(pte_val(*ptep));
570 unsigned int skey;
571 unsigned long *pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
572
573 skey = page_get_storage_key(page_to_phys(page));
574 if (skey & _PAGE_CHANGED)
Heiko Carstensc71799c2008-04-04 16:03:34 +0200575 set_bit_simple(RCP_GC_BIT, pgste);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100576 if (skey & _PAGE_REFERENCED)
Heiko Carstensc71799c2008-04-04 16:03:34 +0200577 set_bit_simple(RCP_GR_BIT, pgste);
578 if (test_and_clear_bit_simple(RCP_HC_BIT, pgste))
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100579 SetPageDirty(page);
Heiko Carstensc71799c2008-04-04 16:03:34 +0200580 if (test_and_clear_bit_simple(RCP_HR_BIT, pgste))
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100581 SetPageReferenced(page);
582#endif
583}
584
Linus Torvalds1da177e2005-04-16 15:20:36 -0700585/*
586 * query functions pte_write/pte_dirty/pte_young only work if
587 * pte_present() is true. Undefined behaviour if not..
588 */
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800589static inline int pte_write(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700590{
591 return (pte_val(pte) & _PAGE_RO) == 0;
592}
593
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800594static inline int pte_dirty(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595{
596 /* A pte is neither clean nor dirty on s/390. The dirty bit
597 * is in the storage key. See page_test_and_clear_dirty for
598 * details.
599 */
600 return 0;
601}
602
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800603static inline int pte_young(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604{
605 /* A pte is neither young nor old on s/390. The young bit
606 * is in the storage key. See page_test_and_clear_young for
607 * details.
608 */
609 return 0;
610}
611
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612/*
613 * pgd/pmd/pte modification functions
614 */
615
616#ifndef __s390x__
617
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200618#define pgd_clear(pgd) do { } while (0)
619#define pud_clear(pud) do { } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620
Linus Torvalds1da177e2005-04-16 15:20:36 -0700621#else /* __s390x__ */
622
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100623static inline void pgd_clear_kernel(pgd_t * pgd)
624{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100625 if ((pgd_val(*pgd) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R2)
626 pgd_val(*pgd) = _REGION2_ENTRY_EMPTY;
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100627}
628
629static inline void pgd_clear(pgd_t * pgd)
630{
631 pgd_t *shadow = get_shadow_table(pgd);
632
633 pgd_clear_kernel(pgd);
634 if (shadow)
635 pgd_clear_kernel(shadow);
636}
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200637
638static inline void pud_clear_kernel(pud_t *pud)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100640 if ((pud_val(*pud) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3)
641 pud_val(*pud) = _REGION3_ENTRY_EMPTY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642}
643
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100644static inline void pud_clear(pud_t *pud)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100645{
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200646 pud_t *shadow = get_shadow_table(pud);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100647
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200648 pud_clear_kernel(pud);
649 if (shadow)
650 pud_clear_kernel(shadow);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100651}
652
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100653#endif /* __s390x__ */
654
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100655static inline void pmd_clear_kernel(pmd_t * pmdp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656{
Martin Schwidefsky3610cce2007-10-22 12:52:47 +0200657 pmd_val(*pmdp) = _SEGMENT_ENTRY_EMPTY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700658}
659
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100660static inline void pmd_clear(pmd_t *pmd)
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100661{
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100662 pmd_t *shadow = get_shadow_table(pmd);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100663
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100664 pmd_clear_kernel(pmd);
665 if (shadow)
666 pmd_clear_kernel(shadow);
Gerald Schaeferc1821c22007-02-05 21:18:17 +0100667}
668
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800669static inline void pte_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100671 if (mm->context.pgstes)
672 ptep_rcp_copy(ptep);
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200673 pte_val(*ptep) = _PAGE_TYPE_EMPTY;
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100674 if (mm->context.noexec)
675 pte_val(ptep[PTRS_PER_PTE]) = _PAGE_TYPE_EMPTY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700676}
677
678/*
679 * The following pte modification functions only work if
680 * pte_present() is true. Undefined behaviour if not..
681 */
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800682static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683{
684 pte_val(pte) &= PAGE_MASK;
685 pte_val(pte) |= pgprot_val(newprot);
686 return pte;
687}
688
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800689static inline pte_t pte_wrprotect(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700690{
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200691 /* Do not clobber _PAGE_TYPE_NONE pages! */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700692 if (!(pte_val(pte) & _PAGE_INVALID))
693 pte_val(pte) |= _PAGE_RO;
694 return pte;
695}
696
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800697static inline pte_t pte_mkwrite(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698{
699 pte_val(pte) &= ~_PAGE_RO;
700 return pte;
701}
702
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800703static inline pte_t pte_mkclean(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700704{
705 /* The only user of pte_mkclean is the fork() code.
706 We must *not* clear the *physical* page dirty bit
707 just because fork() wants to clear the dirty bit in
708 *one* of the page's mappings. So we just do nothing. */
709 return pte;
710}
711
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800712static inline pte_t pte_mkdirty(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700713{
714 /* We do not explicitly set the dirty bit because the
715 * sske instruction is slow. It is faster to let the
716 * next instruction set the dirty bit.
717 */
718 return pte;
719}
720
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800721static inline pte_t pte_mkold(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722{
723 /* S/390 doesn't keep its dirty/referenced bit in the pte.
724 * There is no point in clearing the real referenced bit.
725 */
726 return pte;
727}
728
Adrian Bunk4448aaf2005-11-08 21:34:42 -0800729static inline pte_t pte_mkyoung(pte_t pte)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730{
731 /* S/390 doesn't keep its dirty/referenced bit in the pte.
732 * There is no point in setting the real referenced bit.
733 */
734 return pte;
735}
736
Nick Piggin7e675132008-04-28 02:13:00 -0700737static inline pte_t pte_mkspecial(pte_t pte)
738{
Nick Piggina08cb622008-04-28 02:13:03 -0700739 pte_val(pte) |= _PAGE_SPECIAL;
Nick Piggin7e675132008-04-28 02:13:00 -0700740 return pte;
741}
742
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200743#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
744static inline int ptep_test_and_clear_young(struct vm_area_struct *vma,
745 unsigned long addr, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700746{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100747#ifdef CONFIG_PGSTE
748 unsigned long physpage;
749 int young;
750 unsigned long *pgste;
751
752 if (!vma->vm_mm->context.pgstes)
753 return 0;
754 physpage = pte_val(*ptep) & PAGE_MASK;
755 pgste = (unsigned long *) (ptep + PTRS_PER_PTE);
756
757 young = ((page_get_storage_key(physpage) & _PAGE_REFERENCED) != 0);
758 rcp_lock(ptep);
759 if (young)
Heiko Carstensc71799c2008-04-04 16:03:34 +0200760 set_bit_simple(RCP_GR_BIT, pgste);
761 young |= test_and_clear_bit_simple(RCP_HR_BIT, pgste);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100762 rcp_unlock(ptep);
763 return young;
764#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700765 return 0;
766}
767
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200768#define __HAVE_ARCH_PTEP_CLEAR_YOUNG_FLUSH
769static inline int ptep_clear_flush_young(struct vm_area_struct *vma,
770 unsigned long address, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700771{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100772 /* No need to flush TLB
773 * On s390 reference bits are in storage key and never in TLB
774 * With virtualization we handle the reference bit, without we
775 * we can simply return */
776#ifdef CONFIG_PGSTE
777 return ptep_test_and_clear_young(vma, address, ptep);
778#endif
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200779 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700780}
781
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200782static inline void __ptep_ipte(unsigned long address, pte_t *ptep)
783{
784 if (!(pte_val(*ptep) & _PAGE_INVALID)) {
785#ifndef __s390x__
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100786 /* pto must point to the start of the segment table */
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200787 pte_t *pto = (pte_t *) (((unsigned long) ptep) & 0x7ffffc00);
788#else
789 /* ipte in zarch mode can do the math */
790 pte_t *pto = ptep;
791#endif
Martin Schwidefsky94c12cc2006-09-28 16:56:43 +0200792 asm volatile(
793 " ipte %2,%3"
794 : "=m" (*ptep) : "m" (*ptep),
795 "a" (pto), "a" (address));
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200796 }
Gerald Schaefer9282ed92006-09-20 15:59:37 +0200797}
798
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100799static inline void ptep_invalidate(struct mm_struct *mm,
800 unsigned long address, pte_t *ptep)
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700801{
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100802 if (mm->context.pgstes) {
803 rcp_lock(ptep);
804 __ptep_ipte(address, ptep);
805 ptep_rcp_copy(ptep);
806 pte_val(*ptep) = _PAGE_TYPE_EMPTY;
807 rcp_unlock(ptep);
808 return;
809 }
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700810 __ptep_ipte(address, ptep);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100811 pte_val(*ptep) = _PAGE_TYPE_EMPTY;
812 if (mm->context.noexec) {
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100813 __ptep_ipte(address, ptep + PTRS_PER_PTE);
Christian Borntraeger5b7baf02008-03-25 18:47:12 +0100814 pte_val(*(ptep + PTRS_PER_PTE)) = _PAGE_TYPE_EMPTY;
815 }
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700816}
817
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200818/*
819 * This is hard to understand. ptep_get_and_clear and ptep_clear_flush
820 * both clear the TLB for the unmapped pte. The reason is that
821 * ptep_get_and_clear is used in common code (e.g. change_pte_range)
822 * to modify an active pte. The sequence is
823 * 1) ptep_get_and_clear
824 * 2) set_pte_at
825 * 3) flush_tlb_range
826 * On s390 the tlb needs to get flushed with the modification of the pte
827 * if the pte is active. The only way how this can be implemented is to
828 * have ptep_get_and_clear do the tlb flush. In exchange flush_tlb_range
829 * is a nop.
830 */
831#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
832#define ptep_get_and_clear(__mm, __address, __ptep) \
833({ \
834 pte_t __pte = *(__ptep); \
835 if (atomic_read(&(__mm)->mm_users) > 1 || \
836 (__mm) != current->active_mm) \
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100837 ptep_invalidate(__mm, __address, __ptep); \
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200838 else \
839 pte_clear((__mm), (__address), (__ptep)); \
840 __pte; \
841})
842
843#define __HAVE_ARCH_PTEP_CLEAR_FLUSH
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700844static inline pte_t ptep_clear_flush(struct vm_area_struct *vma,
845 unsigned long address, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700846{
847 pte_t pte = *ptep;
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100848 ptep_invalidate(vma->vm_mm, address, ptep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700849 return pte;
850}
851
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200852/*
853 * The batched pte unmap code uses ptep_get_and_clear_full to clear the
854 * ptes. Here an optimization is possible. tlb_gather_mmu flushes all
855 * tlbs of an mm if it can guarantee that the ptes of the mm_struct
856 * cannot be accessed while the batched unmap is running. In this case
857 * full==1 and a simple pte_clear is enough. See tlb.h.
858 */
859#define __HAVE_ARCH_PTEP_GET_AND_CLEAR_FULL
860static inline pte_t ptep_get_and_clear_full(struct mm_struct *mm,
861 unsigned long addr,
862 pte_t *ptep, int full)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700863{
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200864 pte_t pte = *ptep;
865
866 if (full)
867 pte_clear(mm, addr, ptep);
868 else
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100869 ptep_invalidate(mm, addr, ptep);
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200870 return pte;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700871}
872
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200873#define __HAVE_ARCH_PTEP_SET_WRPROTECT
874#define ptep_set_wrprotect(__mm, __addr, __ptep) \
875({ \
876 pte_t __pte = *(__ptep); \
877 if (pte_write(__pte)) { \
878 if (atomic_read(&(__mm)->mm_users) > 1 || \
879 (__mm) != current->active_mm) \
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100880 ptep_invalidate(__mm, __addr, __ptep); \
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200881 set_pte_at(__mm, __addr, __ptep, pte_wrprotect(__pte)); \
882 } \
883})
884
885#define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700886#define ptep_set_access_flags(__vma, __addr, __ptep, __entry, __dirty) \
887({ \
888 int __changed = !pte_same(*(__ptep), __entry); \
889 if (__changed) { \
Martin Schwidefsky146e4b32008-02-09 18:24:35 +0100890 ptep_invalidate((__vma)->vm_mm, __addr, __ptep); \
Martin Schwidefskyf0e47c22007-07-17 04:03:03 -0700891 set_pte_at((__vma)->vm_mm, __addr, __ptep, __entry); \
892 } \
893 __changed; \
Benjamin Herrenschmidt8dab5242007-06-16 10:16:12 -0700894})
Linus Torvalds1da177e2005-04-16 15:20:36 -0700895
896/*
897 * Test and clear dirty bit in storage key.
898 * We can't clear the changed bit atomically. This is a potential
899 * race against modification of the referenced bit. This function
900 * should therefore only be called if it is not mapped in any
901 * address space.
902 */
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200903#define __HAVE_ARCH_PAGE_TEST_DIRTY
Martin Schwidefsky6c210482007-04-27 16:01:57 +0200904static inline int page_test_dirty(struct page *page)
Heiko Carstens2dcea572006-09-29 01:58:41 -0700905{
Martin Schwidefsky6c210482007-04-27 16:01:57 +0200906 return (page_get_storage_key(page_to_phys(page)) & _PAGE_CHANGED) != 0;
907}
Heiko Carstens2dcea572006-09-29 01:58:41 -0700908
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200909#define __HAVE_ARCH_PAGE_CLEAR_DIRTY
Martin Schwidefsky6c210482007-04-27 16:01:57 +0200910static inline void page_clear_dirty(struct page *page)
911{
912 page_set_storage_key(page_to_phys(page), PAGE_DEFAULT_KEY);
Heiko Carstens2dcea572006-09-29 01:58:41 -0700913}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700914
915/*
916 * Test and clear referenced bit in storage key.
917 */
Martin Schwidefskyba8a9222007-10-22 12:52:44 +0200918#define __HAVE_ARCH_PAGE_TEST_AND_CLEAR_YOUNG
Heiko Carstens2dcea572006-09-29 01:58:41 -0700919static inline int page_test_and_clear_young(struct page *page)
920{
Heiko Carstens0b2b6e12006-10-04 20:02:23 +0200921 unsigned long physpage = page_to_phys(page);
Heiko Carstens2dcea572006-09-29 01:58:41 -0700922 int ccode;
923
Heiko Carstens0b2b6e12006-10-04 20:02:23 +0200924 asm volatile(
925 " rrbe 0,%1\n"
926 " ipm %0\n"
927 " srl %0,28\n"
Heiko Carstens2dcea572006-09-29 01:58:41 -0700928 : "=d" (ccode) : "a" (physpage) : "cc" );
929 return ccode & 2;
930}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700931
932/*
933 * Conversion functions: convert a page and protection to a page entry,
934 * and a page entry and page directory to the page they refer to.
935 */
936static inline pte_t mk_pte_phys(unsigned long physpage, pgprot_t pgprot)
937{
938 pte_t __pte;
939 pte_val(__pte) = physpage + pgprot_val(pgprot);
940 return __pte;
941}
942
Heiko Carstens2dcea572006-09-29 01:58:41 -0700943static inline pte_t mk_pte(struct page *page, pgprot_t pgprot)
944{
Heiko Carstens0b2b6e12006-10-04 20:02:23 +0200945 unsigned long physpage = page_to_phys(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700946
Heiko Carstens2dcea572006-09-29 01:58:41 -0700947 return mk_pte_phys(physpage, pgprot);
948}
949
Linus Torvalds1da177e2005-04-16 15:20:36 -0700950#define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD-1))
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200951#define pud_index(address) (((address) >> PUD_SHIFT) & (PTRS_PER_PUD-1))
952#define pmd_index(address) (((address) >> PMD_SHIFT) & (PTRS_PER_PMD-1))
953#define pte_index(address) (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE-1))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700954
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200955#define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700956#define pgd_offset_k(address) pgd_offset(&init_mm, address)
957
958#ifndef __s390x__
959
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200960#define pmd_deref(pmd) (pmd_val(pmd) & _SEGMENT_ENTRY_ORIGIN)
961#define pud_deref(pmd) ({ BUG(); 0UL; })
962#define pgd_deref(pmd) ({ BUG(); 0UL; })
963
964#define pud_offset(pgd, address) ((pud_t *) pgd)
965#define pmd_offset(pud, address) ((pmd_t *) pud + pmd_index(address))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700966
967#else /* __s390x__ */
968
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200969#define pmd_deref(pmd) (pmd_val(pmd) & _SEGMENT_ENTRY_ORIGIN)
970#define pud_deref(pud) (pud_val(pud) & _REGION_ENTRY_ORIGIN)
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100971#define pgd_deref(pgd) (pgd_val(pgd) & _REGION_ENTRY_ORIGIN)
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200972
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100973static inline pud_t *pud_offset(pgd_t *pgd, unsigned long address)
974{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100975 pud_t *pud = (pud_t *) pgd;
976 if ((pgd_val(*pgd) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R2)
977 pud = (pud_t *) pgd_deref(*pgd);
Martin Schwidefsky5a216a22008-02-09 18:24:36 +0100978 return pud + pud_index(address);
979}
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200980
981static inline pmd_t *pmd_offset(pud_t *pud, unsigned long address)
982{
Martin Schwidefsky6252d702008-02-09 18:24:37 +0100983 pmd_t *pmd = (pmd_t *) pud;
984 if ((pud_val(*pud) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3)
985 pmd = (pmd_t *) pud_deref(*pud);
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200986 return pmd + pmd_index(address);
987}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700988
989#endif /* __s390x__ */
990
Martin Schwidefsky190a1d72007-10-22 12:52:48 +0200991#define pfn_pte(pfn,pgprot) mk_pte_phys(__pa((pfn) << PAGE_SHIFT),(pgprot))
992#define pte_pfn(x) (pte_val(x) >> PAGE_SHIFT)
993#define pte_page(x) pfn_to_page(pte_pfn(x))
994
995#define pmd_page(pmd) pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT)
996
997/* Find an entry in the lowest level page table.. */
998#define pte_offset(pmd, addr) ((pte_t *) pmd_deref(*(pmd)) + pte_index(addr))
999#define pte_offset_kernel(pmd, address) pte_offset(pmd,address)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001000#define pte_offset_map(pmd, address) pte_offset_kernel(pmd, address)
1001#define pte_offset_map_nested(pmd, address) pte_offset_kernel(pmd, address)
1002#define pte_unmap(pte) do { } while (0)
1003#define pte_unmap_nested(pte) do { } while (0)
1004
1005/*
1006 * 31 bit swap entry format:
1007 * A page-table entry has some bits we have to treat in a special way.
1008 * Bits 0, 20 and bit 23 have to be zero, otherwise an specification
1009 * exception will occur instead of a page translation exception. The
1010 * specifiation exception has the bad habit not to store necessary
1011 * information in the lowcore.
1012 * Bit 21 and bit 22 are the page invalid bit and the page protection
1013 * bit. We set both to indicate a swapped page.
1014 * Bit 30 and 31 are used to distinguish the different page types. For
1015 * a swapped page these bits need to be zero.
1016 * This leaves the bits 1-19 and bits 24-29 to store type and offset.
1017 * We use the 5 bits from 25-29 for the type and the 20 bits from 1-19
1018 * plus 24 for the offset.
1019 * 0| offset |0110|o|type |00|
1020 * 0 0000000001111111111 2222 2 22222 33
1021 * 0 1234567890123456789 0123 4 56789 01
1022 *
1023 * 64 bit swap entry format:
1024 * A page-table entry has some bits we have to treat in a special way.
1025 * Bits 52 and bit 55 have to be zero, otherwise an specification
1026 * exception will occur instead of a page translation exception. The
1027 * specifiation exception has the bad habit not to store necessary
1028 * information in the lowcore.
1029 * Bit 53 and bit 54 are the page invalid bit and the page protection
1030 * bit. We set both to indicate a swapped page.
1031 * Bit 62 and 63 are used to distinguish the different page types. For
1032 * a swapped page these bits need to be zero.
1033 * This leaves the bits 0-51 and bits 56-61 to store type and offset.
1034 * We use the 5 bits from 57-61 for the type and the 53 bits from 0-51
1035 * plus 56 for the offset.
1036 * | offset |0110|o|type |00|
1037 * 0000000000111111111122222222223333333333444444444455 5555 5 55566 66
1038 * 0123456789012345678901234567890123456789012345678901 2345 6 78901 23
1039 */
1040#ifndef __s390x__
1041#define __SWP_OFFSET_MASK (~0UL >> 12)
1042#else
1043#define __SWP_OFFSET_MASK (~0UL >> 11)
1044#endif
Adrian Bunk4448aaf2005-11-08 21:34:42 -08001045static inline pte_t mk_swap_pte(unsigned long type, unsigned long offset)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046{
1047 pte_t pte;
1048 offset &= __SWP_OFFSET_MASK;
Gerald Schaefer9282ed92006-09-20 15:59:37 +02001049 pte_val(pte) = _PAGE_TYPE_SWAP | ((type & 0x1f) << 2) |
Linus Torvalds1da177e2005-04-16 15:20:36 -07001050 ((offset & 1UL) << 7) | ((offset & ~1UL) << 11);
1051 return pte;
1052}
1053
1054#define __swp_type(entry) (((entry).val >> 2) & 0x1f)
1055#define __swp_offset(entry) (((entry).val >> 11) | (((entry).val >> 7) & 1))
1056#define __swp_entry(type,offset) ((swp_entry_t) { pte_val(mk_swap_pte((type),(offset))) })
1057
1058#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
1059#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
1060
1061#ifndef __s390x__
1062# define PTE_FILE_MAX_BITS 26
1063#else /* __s390x__ */
1064# define PTE_FILE_MAX_BITS 59
1065#endif /* __s390x__ */
1066
1067#define pte_to_pgoff(__pte) \
1068 ((((__pte).pte >> 12) << 7) + (((__pte).pte >> 1) & 0x7f))
1069
1070#define pgoff_to_pte(__off) \
1071 ((pte_t) { ((((__off) & 0x7f) << 1) + (((__off) >> 7) << 12)) \
Gerald Schaefer9282ed92006-09-20 15:59:37 +02001072 | _PAGE_TYPE_FILE })
Linus Torvalds1da177e2005-04-16 15:20:36 -07001073
1074#endif /* !__ASSEMBLY__ */
1075
1076#define kern_addr_valid(addr) (1)
1077
Heiko Carstensf4eb07c2006-12-08 15:56:07 +01001078extern int add_shared_memory(unsigned long start, unsigned long size);
1079extern int remove_shared_memory(unsigned long start, unsigned long size);
Carsten Otte402b0862008-03-25 18:47:10 +01001080extern int s390_enable_sie(void);
Heiko Carstensf4eb07c2006-12-08 15:56:07 +01001081
Linus Torvalds1da177e2005-04-16 15:20:36 -07001082/*
1083 * No page table caches to initialise
1084 */
1085#define pgtable_cache_init() do { } while (0)
1086
Heiko Carstensf4eb07c2006-12-08 15:56:07 +01001087#define __HAVE_ARCH_MEMMAP_INIT
1088extern void memmap_init(unsigned long, int, unsigned long, unsigned long);
1089
Linus Torvalds1da177e2005-04-16 15:20:36 -07001090#include <asm-generic/pgtable.h>
1091
1092#endif /* _S390_PAGE_H */