blob: 6c0532d7b21191a8c0e4eccc1d2ada2acb71f8ad [file] [log] [blame]
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001/*
2 * This file is subject to the terms and conditions of the GNU General Public
3 * License. See the file "COPYING" in the main directory of this archive
4 * for more details.
5 *
6 * Copyright (C) 1994, 95, 96, 97, 98, 99, 2000, 2003 Ralf Baechle
7 * Copyright (C) 1999, 2000, 2001 Silicon Graphics, Inc.
8 */
9#ifndef _ASM_PGTABLE_32_H
10#define _ASM_PGTABLE_32_H
11
12#include <asm/addrspace.h>
13#include <asm/page.h>
14
15#include <linux/linkage.h>
16#include <asm/cachectl.h>
17#include <asm/fixmap.h>
18
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000019#include <asm-generic/pgtable-nopmd.h>
20
21#ifdef CONFIG_HIGHMEM
22#include <asm/highmem.h>
23#endif
24
David Brazdil0f672f62019-12-10 10:32:29 +000025/*
26 * Regarding 32-bit MIPS huge page support (and the tradeoff it entails):
27 *
28 * We use the same huge page sizes as 64-bit MIPS. Assuming a 4KB page size,
29 * our 2-level table layout would normally have a PGD entry cover a contiguous
30 * 4MB virtual address region (pointing to a 4KB PTE page of 1,024 32-bit pte_t
31 * pointers, each pointing to a 4KB physical page). The problem is that 4MB,
32 * spanning both halves of a TLB EntryLo0,1 pair, requires 2MB hardware page
33 * support, not one of the standard supported sizes (1MB,4MB,16MB,...).
34 * To correct for this, when huge pages are enabled, we halve the number of
35 * pointers a PTE page holds, making its last half go to waste. Correspondingly,
36 * we double the number of PGD pages. Overall, page table memory overhead
37 * increases to match 64-bit MIPS, but PTE lookups remain CPU cache-friendly.
38 *
39 * NOTE: We don't yet support huge pages if extended-addressing is enabled
40 * (i.e. EVA, XPA, 36-bit Alchemy/Netlogic).
41 */
42
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000043extern int temp_tlb_entry;
44
45/*
46 * - add_temporary_entry() add a temporary TLB entry. We use TLB entries
47 * starting at the top and working down. This is for populating the
48 * TLB before trap_init() puts the TLB miss handler in place. It
49 * should be used only for entries matching the actual page tables,
50 * to prevent inconsistencies.
51 */
52extern int add_temporary_entry(unsigned long entrylo0, unsigned long entrylo1,
53 unsigned long entryhi, unsigned long pagemask);
54
55/*
56 * Basically we have the same two-level (which is the logical three level
57 * Linux page table layout folded) page tables as the i386. Some day
58 * when we have proper page coloring support we can have a 1% quicker
59 * tlb refill handling mechanism, but for now it is a bit slower but
60 * works even with the cache aliasing problem the R4k and above have.
61 */
62
63/* PGDIR_SHIFT determines what a third-level page table entry can map */
David Brazdil0f672f62019-12-10 10:32:29 +000064#if defined(CONFIG_MIPS_HUGE_TLB_SUPPORT) && !defined(CONFIG_PHYS_ADDR_T_64BIT)
65# define PGDIR_SHIFT (2 * PAGE_SHIFT + PTE_ORDER - PTE_T_LOG2 - 1)
66#else
67# define PGDIR_SHIFT (2 * PAGE_SHIFT + PTE_ORDER - PTE_T_LOG2)
68#endif
69
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000070#define PGDIR_SIZE (1UL << PGDIR_SHIFT)
71#define PGDIR_MASK (~(PGDIR_SIZE-1))
72
73/*
74 * Entries per page directory level: we use two-level, so
75 * we don't really have any PUD/PMD directory physically.
76 */
David Brazdil0f672f62019-12-10 10:32:29 +000077#if defined(CONFIG_MIPS_HUGE_TLB_SUPPORT) && !defined(CONFIG_PHYS_ADDR_T_64BIT)
78# define __PGD_ORDER (32 - 3 * PAGE_SHIFT + PGD_T_LOG2 + PTE_T_LOG2 + 1)
79#else
80# define __PGD_ORDER (32 - 3 * PAGE_SHIFT + PGD_T_LOG2 + PTE_T_LOG2)
81#endif
82
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000083#define PGD_ORDER (__PGD_ORDER >= 0 ? __PGD_ORDER : 0)
84#define PUD_ORDER aieeee_attempt_to_allocate_pud
David Brazdil0f672f62019-12-10 10:32:29 +000085#define PMD_ORDER aieeee_attempt_to_allocate_pmd
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000086#define PTE_ORDER 0
87
88#define PTRS_PER_PGD (USER_PTRS_PER_PGD * 2)
David Brazdil0f672f62019-12-10 10:32:29 +000089#if defined(CONFIG_MIPS_HUGE_TLB_SUPPORT) && !defined(CONFIG_PHYS_ADDR_T_64BIT)
90# define PTRS_PER_PTE ((PAGE_SIZE << PTE_ORDER) / sizeof(pte_t) / 2)
91#else
92# define PTRS_PER_PTE ((PAGE_SIZE << PTE_ORDER) / sizeof(pte_t))
93#endif
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000094
95#define USER_PTRS_PER_PGD (0x80000000UL/PGDIR_SIZE)
96#define FIRST_USER_ADDRESS 0UL
97
98#define VMALLOC_START MAP_BASE
99
100#define PKMAP_END ((FIXADDR_START) & ~((LAST_PKMAP << PAGE_SHIFT)-1))
101#define PKMAP_BASE (PKMAP_END - PAGE_SIZE * LAST_PKMAP)
102
103#ifdef CONFIG_HIGHMEM
104# define VMALLOC_END (PKMAP_BASE-2*PAGE_SIZE)
105#else
106# define VMALLOC_END (FIXADDR_START-2*PAGE_SIZE)
107#endif
108
109#ifdef CONFIG_PHYS_ADDR_T_64BIT
110#define pte_ERROR(e) \
111 printk("%s:%d: bad pte %016Lx.\n", __FILE__, __LINE__, pte_val(e))
112#else
113#define pte_ERROR(e) \
114 printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, pte_val(e))
115#endif
116#define pgd_ERROR(e) \
117 printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, pgd_val(e))
118
119extern void load_pgd(unsigned long pg_dir);
120
David Brazdil0f672f62019-12-10 10:32:29 +0000121extern pte_t invalid_pte_table[PTRS_PER_PTE];
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000122
123/*
124 * Empty pgd/pmd entries point to the invalid_pte_table.
125 */
126static inline int pmd_none(pmd_t pmd)
127{
128 return pmd_val(pmd) == (unsigned long) invalid_pte_table;
129}
130
David Brazdil0f672f62019-12-10 10:32:29 +0000131static inline int pmd_bad(pmd_t pmd)
132{
133#ifdef CONFIG_MIPS_HUGE_TLB_SUPPORT
134 /* pmd_huge(pmd) but inline */
135 if (unlikely(pmd_val(pmd) & _PAGE_HUGE))
136 return 0;
137#endif
138
139 if (unlikely(pmd_val(pmd) & ~PAGE_MASK))
140 return 1;
141
142 return 0;
143}
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000144
145static inline int pmd_present(pmd_t pmd)
146{
147 return pmd_val(pmd) != (unsigned long) invalid_pte_table;
148}
149
150static inline void pmd_clear(pmd_t *pmdp)
151{
152 pmd_val(*pmdp) = ((unsigned long) invalid_pte_table);
153}
154
155#if defined(CONFIG_XPA)
156
Olivier Deprez0e641232021-09-23 10:07:05 +0200157#define MAX_POSSIBLE_PHYSMEM_BITS 40
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000158#define pte_pfn(x) (((unsigned long)((x).pte_high >> _PFN_SHIFT)) | (unsigned long)((x).pte_low << _PAGE_PRESENT_SHIFT))
159static inline pte_t
160pfn_pte(unsigned long pfn, pgprot_t prot)
161{
162 pte_t pte;
163
164 pte.pte_low = (pfn >> _PAGE_PRESENT_SHIFT) |
165 (pgprot_val(prot) & ~_PFNX_MASK);
166 pte.pte_high = (pfn << _PFN_SHIFT) |
167 (pgprot_val(prot) & ~_PFN_MASK);
168 return pte;
169}
170
171#elif defined(CONFIG_PHYS_ADDR_T_64BIT) && defined(CONFIG_CPU_MIPS32)
172
Olivier Deprez0e641232021-09-23 10:07:05 +0200173#define MAX_POSSIBLE_PHYSMEM_BITS 36
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000174#define pte_pfn(x) ((unsigned long)((x).pte_high >> 6))
175
176static inline pte_t pfn_pte(unsigned long pfn, pgprot_t prot)
177{
178 pte_t pte;
179
180 pte.pte_high = (pfn << 6) | (pgprot_val(prot) & 0x3f);
181 pte.pte_low = pgprot_val(prot);
182
183 return pte;
184}
185
186#else
187
Olivier Deprez0e641232021-09-23 10:07:05 +0200188#define MAX_POSSIBLE_PHYSMEM_BITS 32
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000189#ifdef CONFIG_CPU_VR41XX
190#define pte_pfn(x) ((unsigned long)((x).pte >> (PAGE_SHIFT + 2)))
191#define pfn_pte(pfn, prot) __pte(((pfn) << (PAGE_SHIFT + 2)) | pgprot_val(prot))
192#else
193#define pte_pfn(x) ((unsigned long)((x).pte >> _PFN_SHIFT))
194#define pfn_pte(pfn, prot) __pte(((unsigned long long)(pfn) << _PFN_SHIFT) | pgprot_val(prot))
David Brazdil0f672f62019-12-10 10:32:29 +0000195#define pfn_pmd(pfn, prot) __pmd(((unsigned long long)(pfn) << _PFN_SHIFT) | pgprot_val(prot))
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000196#endif
197#endif /* defined(CONFIG_PHYS_ADDR_T_64BIT) && defined(CONFIG_CPU_MIPS32) */
198
199#define pte_page(x) pfn_to_page(pte_pfn(x))
200
David Brazdil0f672f62019-12-10 10:32:29 +0000201#if defined(CONFIG_CPU_R3K_TLB)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000202
203/* Swap entries must have VALID bit cleared. */
204#define __swp_type(x) (((x).val >> 10) & 0x1f)
205#define __swp_offset(x) ((x).val >> 15)
206#define __swp_entry(type,offset) ((swp_entry_t) { ((type) << 10) | ((offset) << 15) })
207#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
208#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
209
210#else
211
212#if defined(CONFIG_XPA)
213
214/* Swap entries must have VALID and GLOBAL bits cleared. */
215#define __swp_type(x) (((x).val >> 4) & 0x1f)
216#define __swp_offset(x) ((x).val >> 9)
217#define __swp_entry(type,offset) ((swp_entry_t) { ((type) << 4) | ((offset) << 9) })
218#define __pte_to_swp_entry(pte) ((swp_entry_t) { (pte).pte_high })
219#define __swp_entry_to_pte(x) ((pte_t) { 0, (x).val })
220
221#elif defined(CONFIG_PHYS_ADDR_T_64BIT) && defined(CONFIG_CPU_MIPS32)
222
223/* Swap entries must have VALID and GLOBAL bits cleared. */
224#define __swp_type(x) (((x).val >> 2) & 0x1f)
225#define __swp_offset(x) ((x).val >> 7)
226#define __swp_entry(type, offset) ((swp_entry_t) { ((type) << 2) | ((offset) << 7) })
227#define __pte_to_swp_entry(pte) ((swp_entry_t) { (pte).pte_high })
228#define __swp_entry_to_pte(x) ((pte_t) { 0, (x).val })
229
230#else
231/*
232 * Constraints:
233 * _PAGE_PRESENT at bit 0
234 * _PAGE_MODIFIED at bit 4
235 * _PAGE_GLOBAL at bit 6
236 * _PAGE_VALID at bit 7
237 */
238#define __swp_type(x) (((x).val >> 8) & 0x1f)
239#define __swp_offset(x) ((x).val >> 13)
240#define __swp_entry(type,offset) ((swp_entry_t) { ((type) << 8) | ((offset) << 13) })
241#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
242#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
243
244#endif /* defined(CONFIG_PHYS_ADDR_T_64BIT) && defined(CONFIG_CPU_MIPS32) */
245
David Brazdil0f672f62019-12-10 10:32:29 +0000246#endif /* defined(CONFIG_CPU_R3K_TLB) */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000247
248#endif /* _ASM_PGTABLE_32_H */