pgtable.h 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814
  1. /*
  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. #ifndef _ASM_S390_PGTABLE_H
  13. #define _ASM_S390_PGTABLE_H
  14. #include <asm-generic/4level-fixup.h>
  15. /*
  16. * The Linux memory management assumes a three-level page table setup. For
  17. * s390 31 bit we "fold" the mid level into the top-level page table, so
  18. * that we physically have the same two-level page table as the s390 mmu
  19. * expects in 31 bit mode. For s390 64 bit we use three of the five levels
  20. * the hardware provides (region first and region second tables are not
  21. * used).
  22. *
  23. * The "pgd_xxx()" functions are trivial for a folded two-level
  24. * setup: the pgd is never bad, and a pmd always exists (as it's folded
  25. * into the pgd entry)
  26. *
  27. * This file contains the functions and defines necessary to modify and use
  28. * the S390 page table tree.
  29. */
  30. #ifndef __ASSEMBLY__
  31. #include <asm/bug.h>
  32. #include <asm/processor.h>
  33. #include <linux/threads.h>
  34. struct vm_area_struct; /* forward declaration (include/linux/mm.h) */
  35. struct mm_struct;
  36. extern pgd_t swapper_pg_dir[] __attribute__ ((aligned (4096)));
  37. extern void paging_init(void);
  38. /*
  39. * The S390 doesn't have any external MMU info: the kernel page
  40. * tables contain all the necessary information.
  41. */
  42. #define update_mmu_cache(vma, address, pte) do { } while (0)
  43. /*
  44. * ZERO_PAGE is a global shared page that is always zero: used
  45. * for zero-mapped memory areas etc..
  46. */
  47. extern char empty_zero_page[PAGE_SIZE];
  48. #define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
  49. #endif /* !__ASSEMBLY__ */
  50. /*
  51. * PMD_SHIFT determines the size of the area a second-level page
  52. * table can map
  53. * PGDIR_SHIFT determines what a third-level page table entry can map
  54. */
  55. #ifndef __s390x__
  56. # define PMD_SHIFT 22
  57. # define PGDIR_SHIFT 22
  58. #else /* __s390x__ */
  59. # define PMD_SHIFT 21
  60. # define PGDIR_SHIFT 31
  61. #endif /* __s390x__ */
  62. #define PMD_SIZE (1UL << PMD_SHIFT)
  63. #define PMD_MASK (~(PMD_SIZE-1))
  64. #define PGDIR_SIZE (1UL << PGDIR_SHIFT)
  65. #define PGDIR_MASK (~(PGDIR_SIZE-1))
  66. /*
  67. * entries per page directory level: the S390 is two-level, so
  68. * we don't really have any PMD directory physically.
  69. * for S390 segment-table entries are combined to one PGD
  70. * that leads to 1024 pte per pgd
  71. */
  72. #ifndef __s390x__
  73. # define PTRS_PER_PTE 1024
  74. # define PTRS_PER_PMD 1
  75. # define PTRS_PER_PGD 512
  76. #else /* __s390x__ */
  77. # define PTRS_PER_PTE 512
  78. # define PTRS_PER_PMD 1024
  79. # define PTRS_PER_PGD 2048
  80. #endif /* __s390x__ */
  81. /*
  82. * pgd entries used up by user/kernel:
  83. */
  84. #ifndef __s390x__
  85. # define USER_PTRS_PER_PGD 512
  86. # define USER_PGD_PTRS 512
  87. # define KERNEL_PGD_PTRS 512
  88. #else /* __s390x__ */
  89. # define USER_PTRS_PER_PGD 2048
  90. # define USER_PGD_PTRS 2048
  91. # define KERNEL_PGD_PTRS 2048
  92. #endif /* __s390x__ */
  93. #define FIRST_USER_ADDRESS 0
  94. #define pte_ERROR(e) \
  95. printk("%s:%d: bad pte %p.\n", __FILE__, __LINE__, (void *) pte_val(e))
  96. #define pmd_ERROR(e) \
  97. printk("%s:%d: bad pmd %p.\n", __FILE__, __LINE__, (void *) pmd_val(e))
  98. #define pgd_ERROR(e) \
  99. printk("%s:%d: bad pgd %p.\n", __FILE__, __LINE__, (void *) pgd_val(e))
  100. #ifndef __ASSEMBLY__
  101. /*
  102. * Just any arbitrary offset to the start of the vmalloc VM area: the
  103. * current 8MB value just means that there will be a 8MB "hole" after the
  104. * physical memory until the kernel virtual memory starts. That means that
  105. * any out-of-bounds memory accesses will hopefully be caught.
  106. * The vmalloc() routines leaves a hole of 4kB between each vmalloced
  107. * area for the same reason. ;)
  108. */
  109. #define VMALLOC_OFFSET (8*1024*1024)
  110. #define VMALLOC_START (((unsigned long) high_memory + VMALLOC_OFFSET) \
  111. & ~(VMALLOC_OFFSET-1))
  112. #ifndef __s390x__
  113. # define VMALLOC_END (0x7fffffffL)
  114. #else /* __s390x__ */
  115. # define VMALLOC_END (0x40000000000L)
  116. #endif /* __s390x__ */
  117. /*
  118. * A 31 bit pagetable entry of S390 has following format:
  119. * | PFRA | | OS |
  120. * 0 0IP0
  121. * 00000000001111111111222222222233
  122. * 01234567890123456789012345678901
  123. *
  124. * I Page-Invalid Bit: Page is not available for address-translation
  125. * P Page-Protection Bit: Store access not possible for page
  126. *
  127. * A 31 bit segmenttable entry of S390 has following format:
  128. * | P-table origin | |PTL
  129. * 0 IC
  130. * 00000000001111111111222222222233
  131. * 01234567890123456789012345678901
  132. *
  133. * I Segment-Invalid Bit: Segment is not available for address-translation
  134. * C Common-Segment Bit: Segment is not private (PoP 3-30)
  135. * PTL Page-Table-Length: Page-table length (PTL+1*16 entries -> up to 256)
  136. *
  137. * The 31 bit segmenttable origin of S390 has following format:
  138. *
  139. * |S-table origin | | STL |
  140. * X **GPS
  141. * 00000000001111111111222222222233
  142. * 01234567890123456789012345678901
  143. *
  144. * X Space-Switch event:
  145. * G Segment-Invalid Bit: *
  146. * P Private-Space Bit: Segment is not private (PoP 3-30)
  147. * S Storage-Alteration:
  148. * STL Segment-Table-Length: Segment-table length (STL+1*16 entries -> up to 2048)
  149. *
  150. * A 64 bit pagetable entry of S390 has following format:
  151. * | PFRA |0IP0| OS |
  152. * 0000000000111111111122222222223333333333444444444455555555556666
  153. * 0123456789012345678901234567890123456789012345678901234567890123
  154. *
  155. * I Page-Invalid Bit: Page is not available for address-translation
  156. * P Page-Protection Bit: Store access not possible for page
  157. *
  158. * A 64 bit segmenttable entry of S390 has following format:
  159. * | P-table origin | TT
  160. * 0000000000111111111122222222223333333333444444444455555555556666
  161. * 0123456789012345678901234567890123456789012345678901234567890123
  162. *
  163. * I Segment-Invalid Bit: Segment is not available for address-translation
  164. * C Common-Segment Bit: Segment is not private (PoP 3-30)
  165. * P Page-Protection Bit: Store access not possible for page
  166. * TT Type 00
  167. *
  168. * A 64 bit region table entry of S390 has following format:
  169. * | S-table origin | TF TTTL
  170. * 0000000000111111111122222222223333333333444444444455555555556666
  171. * 0123456789012345678901234567890123456789012345678901234567890123
  172. *
  173. * I Segment-Invalid Bit: Segment is not available for address-translation
  174. * TT Type 01
  175. * TF
  176. * TL Table lenght
  177. *
  178. * The 64 bit regiontable origin of S390 has following format:
  179. * | region table origon | DTTL
  180. * 0000000000111111111122222222223333333333444444444455555555556666
  181. * 0123456789012345678901234567890123456789012345678901234567890123
  182. *
  183. * X Space-Switch event:
  184. * G Segment-Invalid Bit:
  185. * P Private-Space Bit:
  186. * S Storage-Alteration:
  187. * R Real space
  188. * TL Table-Length:
  189. *
  190. * A storage key has the following format:
  191. * | ACC |F|R|C|0|
  192. * 0 3 4 5 6 7
  193. * ACC: access key
  194. * F : fetch protection bit
  195. * R : referenced bit
  196. * C : changed bit
  197. */
  198. /* Hardware bits in the page table entry */
  199. #define _PAGE_RO 0x200 /* HW read-only */
  200. #define _PAGE_INVALID 0x400 /* HW invalid */
  201. /* Mask and four different kinds of invalid pages. */
  202. #define _PAGE_INVALID_MASK 0x601
  203. #define _PAGE_INVALID_EMPTY 0x400
  204. #define _PAGE_INVALID_NONE 0x401
  205. #define _PAGE_INVALID_SWAP 0x600
  206. #define _PAGE_INVALID_FILE 0x601
  207. #ifndef __s390x__
  208. /* Bits in the segment table entry */
  209. #define _PAGE_TABLE_LEN 0xf /* only full page-tables */
  210. #define _PAGE_TABLE_COM 0x10 /* common page-table */
  211. #define _PAGE_TABLE_INV 0x20 /* invalid page-table */
  212. #define _SEG_PRESENT 0x001 /* Software (overlap with PTL) */
  213. /* Bits int the storage key */
  214. #define _PAGE_CHANGED 0x02 /* HW changed bit */
  215. #define _PAGE_REFERENCED 0x04 /* HW referenced bit */
  216. #define _USER_SEG_TABLE_LEN 0x7f /* user-segment-table up to 2 GB */
  217. #define _KERNEL_SEG_TABLE_LEN 0x7f /* kernel-segment-table up to 2 GB */
  218. /*
  219. * User and Kernel pagetables are identical
  220. */
  221. #define _PAGE_TABLE _PAGE_TABLE_LEN
  222. #define _KERNPG_TABLE _PAGE_TABLE_LEN
  223. /*
  224. * The Kernel segment-tables includes the User segment-table
  225. */
  226. #define _SEGMENT_TABLE (_USER_SEG_TABLE_LEN|0x80000000|0x100)
  227. #define _KERNSEG_TABLE _KERNEL_SEG_TABLE_LEN
  228. #define USER_STD_MASK 0x00000080UL
  229. #else /* __s390x__ */
  230. /* Bits in the segment table entry */
  231. #define _PMD_ENTRY_INV 0x20 /* invalid segment table entry */
  232. #define _PMD_ENTRY 0x00
  233. /* Bits in the region third table entry */
  234. #define _PGD_ENTRY_INV 0x20 /* invalid region table entry */
  235. #define _PGD_ENTRY 0x07
  236. /*
  237. * User and kernel page directory
  238. */
  239. #define _REGION_THIRD 0x4
  240. #define _REGION_THIRD_LEN 0x3
  241. #define _REGION_TABLE (_REGION_THIRD|_REGION_THIRD_LEN|0x40|0x100)
  242. #define _KERN_REGION_TABLE (_REGION_THIRD|_REGION_THIRD_LEN)
  243. #define USER_STD_MASK 0x0000000000000080UL
  244. /* Bits in the storage key */
  245. #define _PAGE_CHANGED 0x02 /* HW changed bit */
  246. #define _PAGE_REFERENCED 0x04 /* HW referenced bit */
  247. #endif /* __s390x__ */
  248. /*
  249. * No mapping available
  250. */
  251. #define PAGE_NONE_SHARED __pgprot(_PAGE_INVALID_NONE)
  252. #define PAGE_NONE_PRIVATE __pgprot(_PAGE_INVALID_NONE)
  253. #define PAGE_RO_SHARED __pgprot(_PAGE_RO)
  254. #define PAGE_RO_PRIVATE __pgprot(_PAGE_RO)
  255. #define PAGE_COPY __pgprot(_PAGE_RO)
  256. #define PAGE_SHARED __pgprot(0)
  257. #define PAGE_KERNEL __pgprot(0)
  258. /*
  259. * The S390 can't do page protection for execute, and considers that the
  260. * same are read. Also, write permissions imply read permissions. This is
  261. * the closest we can get..
  262. */
  263. /*xwr*/
  264. #define __P000 PAGE_NONE_PRIVATE
  265. #define __P001 PAGE_RO_PRIVATE
  266. #define __P010 PAGE_COPY
  267. #define __P011 PAGE_COPY
  268. #define __P100 PAGE_RO_PRIVATE
  269. #define __P101 PAGE_RO_PRIVATE
  270. #define __P110 PAGE_COPY
  271. #define __P111 PAGE_COPY
  272. #define __S000 PAGE_NONE_SHARED
  273. #define __S001 PAGE_RO_SHARED
  274. #define __S010 PAGE_SHARED
  275. #define __S011 PAGE_SHARED
  276. #define __S100 PAGE_RO_SHARED
  277. #define __S101 PAGE_RO_SHARED
  278. #define __S110 PAGE_SHARED
  279. #define __S111 PAGE_SHARED
  280. /*
  281. * Certain architectures need to do special things when PTEs
  282. * within a page table are directly modified. Thus, the following
  283. * hook is made available.
  284. */
  285. static inline void set_pte(pte_t *pteptr, pte_t pteval)
  286. {
  287. *pteptr = pteval;
  288. }
  289. #define set_pte_at(mm,addr,ptep,pteval) set_pte(ptep,pteval)
  290. /*
  291. * pgd/pmd/pte query functions
  292. */
  293. #ifndef __s390x__
  294. static inline int pgd_present(pgd_t pgd) { return 1; }
  295. static inline int pgd_none(pgd_t pgd) { return 0; }
  296. static inline int pgd_bad(pgd_t pgd) { return 0; }
  297. static inline int pmd_present(pmd_t pmd) { return pmd_val(pmd) & _SEG_PRESENT; }
  298. static inline int pmd_none(pmd_t pmd) { return pmd_val(pmd) & _PAGE_TABLE_INV; }
  299. static inline int pmd_bad(pmd_t pmd)
  300. {
  301. return (pmd_val(pmd) & (~PAGE_MASK & ~_PAGE_TABLE_INV)) != _PAGE_TABLE;
  302. }
  303. #else /* __s390x__ */
  304. static inline int pgd_present(pgd_t pgd)
  305. {
  306. return (pgd_val(pgd) & ~PAGE_MASK) == _PGD_ENTRY;
  307. }
  308. static inline int pgd_none(pgd_t pgd)
  309. {
  310. return pgd_val(pgd) & _PGD_ENTRY_INV;
  311. }
  312. static inline int pgd_bad(pgd_t pgd)
  313. {
  314. return (pgd_val(pgd) & (~PAGE_MASK & ~_PGD_ENTRY_INV)) != _PGD_ENTRY;
  315. }
  316. static inline int pmd_present(pmd_t pmd)
  317. {
  318. return (pmd_val(pmd) & ~PAGE_MASK) == _PMD_ENTRY;
  319. }
  320. static inline int pmd_none(pmd_t pmd)
  321. {
  322. return pmd_val(pmd) & _PMD_ENTRY_INV;
  323. }
  324. static inline int pmd_bad(pmd_t pmd)
  325. {
  326. return (pmd_val(pmd) & (~PAGE_MASK & ~_PMD_ENTRY_INV)) != _PMD_ENTRY;
  327. }
  328. #endif /* __s390x__ */
  329. static inline int pte_none(pte_t pte)
  330. {
  331. return (pte_val(pte) & _PAGE_INVALID_MASK) == _PAGE_INVALID_EMPTY;
  332. }
  333. static inline int pte_present(pte_t pte)
  334. {
  335. return !(pte_val(pte) & _PAGE_INVALID) ||
  336. (pte_val(pte) & _PAGE_INVALID_MASK) == _PAGE_INVALID_NONE;
  337. }
  338. static inline int pte_file(pte_t pte)
  339. {
  340. return (pte_val(pte) & _PAGE_INVALID_MASK) == _PAGE_INVALID_FILE;
  341. }
  342. #define pte_same(a,b) (pte_val(a) == pte_val(b))
  343. /*
  344. * query functions pte_write/pte_dirty/pte_young only work if
  345. * pte_present() is true. Undefined behaviour if not..
  346. */
  347. static inline int pte_write(pte_t pte)
  348. {
  349. return (pte_val(pte) & _PAGE_RO) == 0;
  350. }
  351. static inline int pte_dirty(pte_t pte)
  352. {
  353. /* A pte is neither clean nor dirty on s/390. The dirty bit
  354. * is in the storage key. See page_test_and_clear_dirty for
  355. * details.
  356. */
  357. return 0;
  358. }
  359. static inline int pte_young(pte_t pte)
  360. {
  361. /* A pte is neither young nor old on s/390. The young bit
  362. * is in the storage key. See page_test_and_clear_young for
  363. * details.
  364. */
  365. return 0;
  366. }
  367. static inline int pte_read(pte_t pte)
  368. {
  369. /* All pages are readable since we don't use the fetch
  370. * protection bit in the storage key.
  371. */
  372. return 1;
  373. }
  374. /*
  375. * pgd/pmd/pte modification functions
  376. */
  377. #ifndef __s390x__
  378. static inline void pgd_clear(pgd_t * pgdp) { }
  379. static inline void pmd_clear(pmd_t * pmdp)
  380. {
  381. pmd_val(pmdp[0]) = _PAGE_TABLE_INV;
  382. pmd_val(pmdp[1]) = _PAGE_TABLE_INV;
  383. pmd_val(pmdp[2]) = _PAGE_TABLE_INV;
  384. pmd_val(pmdp[3]) = _PAGE_TABLE_INV;
  385. }
  386. #else /* __s390x__ */
  387. static inline void pgd_clear(pgd_t * pgdp)
  388. {
  389. pgd_val(*pgdp) = _PGD_ENTRY_INV | _PGD_ENTRY;
  390. }
  391. static inline void pmd_clear(pmd_t * pmdp)
  392. {
  393. pmd_val(*pmdp) = _PMD_ENTRY_INV | _PMD_ENTRY;
  394. pmd_val1(*pmdp) = _PMD_ENTRY_INV | _PMD_ENTRY;
  395. }
  396. #endif /* __s390x__ */
  397. static inline void pte_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  398. {
  399. pte_val(*ptep) = _PAGE_INVALID_EMPTY;
  400. }
  401. /*
  402. * The following pte modification functions only work if
  403. * pte_present() is true. Undefined behaviour if not..
  404. */
  405. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  406. {
  407. pte_val(pte) &= PAGE_MASK;
  408. pte_val(pte) |= pgprot_val(newprot);
  409. return pte;
  410. }
  411. static inline pte_t pte_wrprotect(pte_t pte)
  412. {
  413. /* Do not clobber _PAGE_INVALID_NONE pages! */
  414. if (!(pte_val(pte) & _PAGE_INVALID))
  415. pte_val(pte) |= _PAGE_RO;
  416. return pte;
  417. }
  418. static inline pte_t pte_mkwrite(pte_t pte)
  419. {
  420. pte_val(pte) &= ~_PAGE_RO;
  421. return pte;
  422. }
  423. static inline pte_t pte_mkclean(pte_t pte)
  424. {
  425. /* The only user of pte_mkclean is the fork() code.
  426. We must *not* clear the *physical* page dirty bit
  427. just because fork() wants to clear the dirty bit in
  428. *one* of the page's mappings. So we just do nothing. */
  429. return pte;
  430. }
  431. static inline pte_t pte_mkdirty(pte_t pte)
  432. {
  433. /* We do not explicitly set the dirty bit because the
  434. * sske instruction is slow. It is faster to let the
  435. * next instruction set the dirty bit.
  436. */
  437. return pte;
  438. }
  439. static inline pte_t pte_mkold(pte_t pte)
  440. {
  441. /* S/390 doesn't keep its dirty/referenced bit in the pte.
  442. * There is no point in clearing the real referenced bit.
  443. */
  444. return pte;
  445. }
  446. static inline pte_t pte_mkyoung(pte_t pte)
  447. {
  448. /* S/390 doesn't keep its dirty/referenced bit in the pte.
  449. * There is no point in setting the real referenced bit.
  450. */
  451. return pte;
  452. }
  453. static inline int ptep_test_and_clear_young(struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
  454. {
  455. return 0;
  456. }
  457. static inline int
  458. ptep_clear_flush_young(struct vm_area_struct *vma,
  459. unsigned long address, pte_t *ptep)
  460. {
  461. /* No need to flush TLB; bits are in storage key */
  462. return ptep_test_and_clear_young(vma, address, ptep);
  463. }
  464. static inline int ptep_test_and_clear_dirty(struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
  465. {
  466. return 0;
  467. }
  468. static inline int
  469. ptep_clear_flush_dirty(struct vm_area_struct *vma,
  470. unsigned long address, pte_t *ptep)
  471. {
  472. /* No need to flush TLB; bits are in storage key */
  473. return ptep_test_and_clear_dirty(vma, address, ptep);
  474. }
  475. static inline pte_t ptep_get_and_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  476. {
  477. pte_t pte = *ptep;
  478. pte_clear(mm, addr, ptep);
  479. return pte;
  480. }
  481. static inline pte_t
  482. ptep_clear_flush(struct vm_area_struct *vma,
  483. unsigned long address, pte_t *ptep)
  484. {
  485. pte_t pte = *ptep;
  486. #ifndef __s390x__
  487. if (!(pte_val(pte) & _PAGE_INVALID)) {
  488. /* S390 has 1mb segments, we are emulating 4MB segments */
  489. pte_t *pto = (pte_t *) (((unsigned long) ptep) & 0x7ffffc00);
  490. __asm__ __volatile__ ("ipte %2,%3"
  491. : "=m" (*ptep) : "m" (*ptep),
  492. "a" (pto), "a" (address) );
  493. }
  494. #else /* __s390x__ */
  495. if (!(pte_val(pte) & _PAGE_INVALID))
  496. __asm__ __volatile__ ("ipte %2,%3"
  497. : "=m" (*ptep) : "m" (*ptep),
  498. "a" (ptep), "a" (address) );
  499. #endif /* __s390x__ */
  500. pte_val(*ptep) = _PAGE_INVALID_EMPTY;
  501. return pte;
  502. }
  503. static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  504. {
  505. pte_t old_pte = *ptep;
  506. set_pte_at(mm, addr, ptep, pte_wrprotect(old_pte));
  507. }
  508. static inline void
  509. ptep_establish(struct vm_area_struct *vma,
  510. unsigned long address, pte_t *ptep,
  511. pte_t entry)
  512. {
  513. ptep_clear_flush(vma, address, ptep);
  514. set_pte(ptep, entry);
  515. }
  516. #define ptep_set_access_flags(__vma, __address, __ptep, __entry, __dirty) \
  517. ptep_establish(__vma, __address, __ptep, __entry)
  518. /*
  519. * Test and clear dirty bit in storage key.
  520. * We can't clear the changed bit atomically. This is a potential
  521. * race against modification of the referenced bit. This function
  522. * should therefore only be called if it is not mapped in any
  523. * address space.
  524. */
  525. #define page_test_and_clear_dirty(_page) \
  526. ({ \
  527. struct page *__page = (_page); \
  528. unsigned long __physpage = __pa((__page-mem_map) << PAGE_SHIFT); \
  529. int __skey = page_get_storage_key(__physpage); \
  530. if (__skey & _PAGE_CHANGED) \
  531. page_set_storage_key(__physpage, __skey & ~_PAGE_CHANGED);\
  532. (__skey & _PAGE_CHANGED); \
  533. })
  534. /*
  535. * Test and clear referenced bit in storage key.
  536. */
  537. #define page_test_and_clear_young(page) \
  538. ({ \
  539. struct page *__page = (page); \
  540. unsigned long __physpage = __pa((__page-mem_map) << PAGE_SHIFT); \
  541. int __ccode; \
  542. asm volatile ("rrbe 0,%1\n\t" \
  543. "ipm %0\n\t" \
  544. "srl %0,28\n\t" \
  545. : "=d" (__ccode) : "a" (__physpage) : "cc" ); \
  546. (__ccode & 2); \
  547. })
  548. /*
  549. * Conversion functions: convert a page and protection to a page entry,
  550. * and a page entry and page directory to the page they refer to.
  551. */
  552. static inline pte_t mk_pte_phys(unsigned long physpage, pgprot_t pgprot)
  553. {
  554. pte_t __pte;
  555. pte_val(__pte) = physpage + pgprot_val(pgprot);
  556. return __pte;
  557. }
  558. #define mk_pte(pg, pgprot) \
  559. ({ \
  560. struct page *__page = (pg); \
  561. pgprot_t __pgprot = (pgprot); \
  562. unsigned long __physpage = __pa((__page-mem_map) << PAGE_SHIFT); \
  563. pte_t __pte = mk_pte_phys(__physpage, __pgprot); \
  564. __pte; \
  565. })
  566. #define pfn_pte(pfn, pgprot) \
  567. ({ \
  568. pgprot_t __pgprot = (pgprot); \
  569. unsigned long __physpage = __pa((pfn) << PAGE_SHIFT); \
  570. pte_t __pte = mk_pte_phys(__physpage, __pgprot); \
  571. __pte; \
  572. })
  573. #define SetPageUptodate(_page) \
  574. do { \
  575. struct page *__page = (_page); \
  576. if (!test_and_set_bit(PG_uptodate, &__page->flags)) \
  577. page_test_and_clear_dirty(_page); \
  578. } while (0)
  579. #ifdef __s390x__
  580. #define pfn_pmd(pfn, pgprot) \
  581. ({ \
  582. pgprot_t __pgprot = (pgprot); \
  583. unsigned long __physpage = __pa((pfn) << PAGE_SHIFT); \
  584. pmd_t __pmd = __pmd(__physpage + pgprot_val(__pgprot)); \
  585. __pmd; \
  586. })
  587. #endif /* __s390x__ */
  588. #define pte_pfn(x) (pte_val(x) >> PAGE_SHIFT)
  589. #define pte_page(x) pfn_to_page(pte_pfn(x))
  590. #define pmd_page_kernel(pmd) (pmd_val(pmd) & PAGE_MASK)
  591. #define pmd_page(pmd) (mem_map+(pmd_val(pmd) >> PAGE_SHIFT))
  592. #define pgd_page_kernel(pgd) (pgd_val(pgd) & PAGE_MASK)
  593. /* to find an entry in a page-table-directory */
  594. #define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD-1))
  595. #define pgd_offset(mm, address) ((mm)->pgd+pgd_index(address))
  596. /* to find an entry in a kernel page-table-directory */
  597. #define pgd_offset_k(address) pgd_offset(&init_mm, address)
  598. #ifndef __s390x__
  599. /* Find an entry in the second-level page table.. */
  600. static inline pmd_t * pmd_offset(pgd_t * dir, unsigned long address)
  601. {
  602. return (pmd_t *) dir;
  603. }
  604. #else /* __s390x__ */
  605. /* Find an entry in the second-level page table.. */
  606. #define pmd_index(address) (((address) >> PMD_SHIFT) & (PTRS_PER_PMD-1))
  607. #define pmd_offset(dir,addr) \
  608. ((pmd_t *) pgd_page_kernel(*(dir)) + pmd_index(addr))
  609. #endif /* __s390x__ */
  610. /* Find an entry in the third-level page table.. */
  611. #define pte_index(address) (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE-1))
  612. #define pte_offset_kernel(pmd, address) \
  613. ((pte_t *) pmd_page_kernel(*(pmd)) + pte_index(address))
  614. #define pte_offset_map(pmd, address) pte_offset_kernel(pmd, address)
  615. #define pte_offset_map_nested(pmd, address) pte_offset_kernel(pmd, address)
  616. #define pte_unmap(pte) do { } while (0)
  617. #define pte_unmap_nested(pte) do { } while (0)
  618. /*
  619. * 31 bit swap entry format:
  620. * A page-table entry has some bits we have to treat in a special way.
  621. * Bits 0, 20 and bit 23 have to be zero, otherwise an specification
  622. * exception will occur instead of a page translation exception. The
  623. * specifiation exception has the bad habit not to store necessary
  624. * information in the lowcore.
  625. * Bit 21 and bit 22 are the page invalid bit and the page protection
  626. * bit. We set both to indicate a swapped page.
  627. * Bit 30 and 31 are used to distinguish the different page types. For
  628. * a swapped page these bits need to be zero.
  629. * This leaves the bits 1-19 and bits 24-29 to store type and offset.
  630. * We use the 5 bits from 25-29 for the type and the 20 bits from 1-19
  631. * plus 24 for the offset.
  632. * 0| offset |0110|o|type |00|
  633. * 0 0000000001111111111 2222 2 22222 33
  634. * 0 1234567890123456789 0123 4 56789 01
  635. *
  636. * 64 bit swap entry format:
  637. * A page-table entry has some bits we have to treat in a special way.
  638. * Bits 52 and bit 55 have to be zero, otherwise an specification
  639. * exception will occur instead of a page translation exception. The
  640. * specifiation exception has the bad habit not to store necessary
  641. * information in the lowcore.
  642. * Bit 53 and bit 54 are the page invalid bit and the page protection
  643. * bit. We set both to indicate a swapped page.
  644. * Bit 62 and 63 are used to distinguish the different page types. For
  645. * a swapped page these bits need to be zero.
  646. * This leaves the bits 0-51 and bits 56-61 to store type and offset.
  647. * We use the 5 bits from 57-61 for the type and the 53 bits from 0-51
  648. * plus 56 for the offset.
  649. * | offset |0110|o|type |00|
  650. * 0000000000111111111122222222223333333333444444444455 5555 5 55566 66
  651. * 0123456789012345678901234567890123456789012345678901 2345 6 78901 23
  652. */
  653. #ifndef __s390x__
  654. #define __SWP_OFFSET_MASK (~0UL >> 12)
  655. #else
  656. #define __SWP_OFFSET_MASK (~0UL >> 11)
  657. #endif
  658. static inline pte_t mk_swap_pte(unsigned long type, unsigned long offset)
  659. {
  660. pte_t pte;
  661. offset &= __SWP_OFFSET_MASK;
  662. pte_val(pte) = _PAGE_INVALID_SWAP | ((type & 0x1f) << 2) |
  663. ((offset & 1UL) << 7) | ((offset & ~1UL) << 11);
  664. return pte;
  665. }
  666. #define __swp_type(entry) (((entry).val >> 2) & 0x1f)
  667. #define __swp_offset(entry) (((entry).val >> 11) | (((entry).val >> 7) & 1))
  668. #define __swp_entry(type,offset) ((swp_entry_t) { pte_val(mk_swap_pte((type),(offset))) })
  669. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
  670. #define __swp_entry_to_pte(x) ((pte_t) { (x).val })
  671. #ifndef __s390x__
  672. # define PTE_FILE_MAX_BITS 26
  673. #else /* __s390x__ */
  674. # define PTE_FILE_MAX_BITS 59
  675. #endif /* __s390x__ */
  676. #define pte_to_pgoff(__pte) \
  677. ((((__pte).pte >> 12) << 7) + (((__pte).pte >> 1) & 0x7f))
  678. #define pgoff_to_pte(__off) \
  679. ((pte_t) { ((((__off) & 0x7f) << 1) + (((__off) >> 7) << 12)) \
  680. | _PAGE_INVALID_FILE })
  681. #endif /* !__ASSEMBLY__ */
  682. #define kern_addr_valid(addr) (1)
  683. /*
  684. * No page table caches to initialise
  685. */
  686. #define pgtable_cache_init() do { } while (0)
  687. #define __HAVE_ARCH_PTEP_ESTABLISH
  688. #define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
  689. #define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
  690. #define __HAVE_ARCH_PTEP_CLEAR_YOUNG_FLUSH
  691. #define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_DIRTY
  692. #define __HAVE_ARCH_PTEP_CLEAR_DIRTY_FLUSH
  693. #define __HAVE_ARCH_PTEP_GET_AND_CLEAR
  694. #define __HAVE_ARCH_PTEP_CLEAR_FLUSH
  695. #define __HAVE_ARCH_PTEP_SET_WRPROTECT
  696. #define __HAVE_ARCH_PTE_SAME
  697. #define __HAVE_ARCH_PAGE_TEST_AND_CLEAR_DIRTY
  698. #define __HAVE_ARCH_PAGE_TEST_AND_CLEAR_YOUNG
  699. #include <asm-generic/pgtable.h>
  700. #endif /* _S390_PAGE_H */