source: svn/newcon3bcm2_21bu/toolchain/mips-linux-uclibc/include/asm/pgtable-64.h

Last change on this file was 76, checked in by megakiss, 10 years ago

1W 대기전력을 만족시키기 위하여 POWEROFF시 튜너를 Standby 상태로 함

  • Property svn:executable set to *
File size: 7.4 KB
Line 
1/*
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_64_H
10#define _ASM_PGTABLE_64_H
11
12#include <linux/linkage.h>
13
14#include <asm/addrspace.h>
15#include <asm/page.h>
16#include <asm/cachectl.h>
17
18/*
19 * Each address space has 2 4K pages as its page directory, giving 1024
20 * (== PTRS_PER_PGD) 8 byte pointers to pmd tables. Each pmd table is a
21 * pair of 4K pages, giving 1024 (== PTRS_PER_PMD) 8 byte pointers to
22 * page tables. Each page table is a single 4K page, giving 512 (==
23 * PTRS_PER_PTE) 8 byte ptes. Each pgde is initialized to point to
24 * invalid_pmd_table, each pmde is initialized to point to
25 * invalid_pte_table, each pte is initialized to 0. When memory is low,
26 * and a pmd table or a page table allocation fails, empty_bad_pmd_table
27 * and empty_bad_page_table is returned back to higher layer code, so
28 * that the failure is recognized later on. Linux does not seem to
29 * handle these failures very well though. The empty_bad_page_table has
30 * invalid pte entries in it, to force page faults.
31 *
32 * Kernel mappings: kernel mappings are held in the swapper_pg_table.
33 * The layout is identical to userspace except it's indexed with the
34 * fault address - VMALLOC_START.
35 */
36
37/* PMD_SHIFT determines the size of the area a second-level page table can map */
38#define PMD_SHIFT       (PAGE_SHIFT + (PAGE_SHIFT - 3))
39#define PMD_SIZE        (1UL << PMD_SHIFT)
40#define PMD_MASK        (~(PMD_SIZE-1))
41
42/* PGDIR_SHIFT determines what a third-level page table entry can map */
43#define PGDIR_SHIFT     (PMD_SHIFT + (PAGE_SHIFT + 1 - 3))
44#define PGDIR_SIZE      (1UL << PGDIR_SHIFT)
45#define PGDIR_MASK      (~(PGDIR_SIZE-1))
46
47/*
48 * For 4kB page size we use a 3 level page tree and a 8kB pmd and pgds which
49 * permits us mapping 40 bits of virtual address space.
50 *
51 * We used to implement 41 bits by having an order 1 pmd level but that seemed
52 * rather pointless.
53 *
54 * For 8kB page size we use a 3 level page tree which permits a total of
55 * 8TB of address space.  Alternatively a 33-bit / 8GB organization using
56 * two levels would be easy to implement.
57 *
58 * For 16kB page size we use a 2 level page tree which permits a total of
59 * 36 bits of virtual address space.  We could add a third leve. but it seems
60 * like at the moment there's no need for this.
61 *
62 * For 64kB page size we use a 2 level page table tree for a total of 42 bits
63 * of virtual address space.
64 */
65#ifdef CONFIG_PAGE_SIZE_4KB
66#define PGD_ORDER               1
67#define PMD_ORDER               0
68#define PTE_ORDER               0
69#endif
70#ifdef CONFIG_PAGE_SIZE_8KB
71#define PGD_ORDER               0
72#define PMD_ORDER               0
73#define PTE_ORDER               0
74#endif
75#ifdef CONFIG_PAGE_SIZE_16KB
76#define PGD_ORDER               0
77#define PMD_ORDER               0
78#define PTE_ORDER               0
79#endif
80#ifdef CONFIG_PAGE_SIZE_64KB
81#define PGD_ORDER               0
82#define PMD_ORDER               0
83#define PTE_ORDER               0
84#endif
85
86#define PTRS_PER_PGD    ((PAGE_SIZE << PGD_ORDER) / sizeof(pgd_t))
87#define PTRS_PER_PMD    ((PAGE_SIZE << PMD_ORDER) / sizeof(pmd_t))
88#define PTRS_PER_PTE    ((PAGE_SIZE << PTE_ORDER) / sizeof(pte_t))
89
90#define USER_PTRS_PER_PGD       (TASK_SIZE / PGDIR_SIZE)
91#define FIRST_USER_ADDRESS      0
92
93#define VMALLOC_START           XKSEG
94#define VMALLOC_END     \
95        (VMALLOC_START + PTRS_PER_PGD * PTRS_PER_PMD * PTRS_PER_PTE * PAGE_SIZE)
96
97#define pte_ERROR(e) \
98        printk("%s:%d: bad pte %016lx.\n", __FILE__, __LINE__, pte_val(e))
99#define pmd_ERROR(e) \
100        printk("%s:%d: bad pmd %016lx.\n", __FILE__, __LINE__, pmd_val(e))
101#define pgd_ERROR(e) \
102        printk("%s:%d: bad pgd %016lx.\n", __FILE__, __LINE__, pgd_val(e))
103
104extern pte_t invalid_pte_table[PAGE_SIZE/sizeof(pte_t)];
105extern pte_t empty_bad_page_table[PAGE_SIZE/sizeof(pte_t)];
106extern pmd_t invalid_pmd_table[2*PAGE_SIZE/sizeof(pmd_t)];
107extern pmd_t empty_bad_pmd_table[2*PAGE_SIZE/sizeof(pmd_t)];
108
109/*
110 * Empty pmd entries point to the invalid_pte_table.
111 */
112static inline int pmd_none(pmd_t pmd)
113{
114        return pmd_val(pmd) == (unsigned long) invalid_pte_table;
115}
116
117#define pmd_bad(pmd)            (pmd_val(pmd) & ~PAGE_MASK)
118
119static inline int pmd_present(pmd_t pmd)
120{
121        return pmd_val(pmd) != (unsigned long) invalid_pte_table;
122}
123
124static inline void pmd_clear(pmd_t *pmdp)
125{
126        pmd_val(*pmdp) = ((unsigned long) invalid_pte_table);
127}
128
129/*
130 * Empty pgd entries point to the invalid_pmd_table.
131 */
132static inline int pgd_none(pgd_t pgd)
133{
134        return pgd_val(pgd) == (unsigned long) invalid_pmd_table;
135}
136
137#define pgd_bad(pgd)            (pgd_val(pgd) &~ PAGE_MASK)
138
139static inline int pgd_present(pgd_t pgd)
140{
141        return pgd_val(pgd) != (unsigned long) invalid_pmd_table;
142}
143
144static inline void pgd_clear(pgd_t *pgdp)
145{
146        pgd_val(*pgdp) = ((unsigned long) invalid_pmd_table);
147}
148
149#define pte_page(x)             pfn_to_page((unsigned long)((pte_val(x) >> PAGE_SHIFT)))
150#ifdef CONFIG_CPU_VR41XX
151#define pte_pfn(x)              ((unsigned long)((x).pte >> (PAGE_SHIFT + 2)))
152#define pfn_pte(pfn, prot)      __pte(((pfn) << (PAGE_SHIFT + 2)) | pgprot_val(prot))
153#else
154#define pte_pfn(x)              ((unsigned long)((x).pte >> PAGE_SHIFT))
155#define pfn_pte(pfn, prot)      __pte(((pfn) << PAGE_SHIFT) | pgprot_val(prot))
156#endif
157
158#define __pgd_offset(address)   pgd_index(address)
159#define page_pte(page) page_pte_prot(page, __pgprot(0))
160
161/* to find an entry in a kernel page-table-directory */
162#define pgd_offset_k(address) pgd_offset(&init_mm, 0)
163
164#define pgd_index(address)              ((address) >> PGDIR_SHIFT)
165
166/* to find an entry in a page-table-directory */
167#define pgd_offset(mm,addr)     ((mm)->pgd + pgd_index(addr))
168
169static inline unsigned long pgd_page(pgd_t pgd)
170{
171        return pgd_val(pgd);
172}
173
174/* Find an entry in the second-level page table.. */
175static inline pmd_t *pmd_offset(pgd_t * dir, unsigned long address)
176{
177        return (pmd_t *) pgd_page(*dir) +
178               ((address >> PMD_SHIFT) & (PTRS_PER_PMD - 1));
179}
180
181/* Find an entry in the third-level page table.. */
182#define __pte_offset(address)                                           \
183        (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
184#define pte_offset(dir, address)                                        \
185        ((pte_t *) (pmd_page_kernel(*dir)) + __pte_offset(address))
186#define pte_offset_kernel(dir, address)                                 \
187        ((pte_t *) pmd_page_kernel(*(dir)) +  __pte_offset(address))
188#define pte_offset_map(dir, address)                                    \
189        ((pte_t *)page_address(pmd_page(*(dir))) + __pte_offset(address))
190#define pte_offset_map_nested(dir, address)                             \
191        ((pte_t *)page_address(pmd_page(*(dir))) + __pte_offset(address))
192#define pte_unmap(pte) ((void)(pte))
193#define pte_unmap_nested(pte) ((void)(pte))
194
195/*
196 * Initialize a new pgd / pmd table with invalid pointers.
197 */
198extern void pgd_init(unsigned long page);
199extern void pmd_init(unsigned long page, unsigned long pagetable);
200
201/*
202 * Non-present pages:  high 24 bits are offset, next 8 bits type,
203 * low 32 bits zero.
204 */
205static inline pte_t mk_swap_pte(unsigned long type, unsigned long offset)
206{ pte_t pte; pte_val(pte) = (type << 32) | (offset << 40); return pte; }
207
208#define __swp_type(x)           (((x).val >> 32) & 0xff)
209#define __swp_offset(x)         ((x).val >> 40)
210#define __swp_entry(type,offset) ((swp_entry_t) { pte_val(mk_swap_pte((type),(offset))) })
211#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
212#define __swp_entry_to_pte(x)   ((pte_t) { (x).val })
213
214/*
215 * Bits 0, 1, 2, 7 and 8 are taken, split up the 32 bits of offset
216 * into this range:
217 */
218#define PTE_FILE_MAX_BITS       32
219
220#define pte_to_pgoff(_pte) \
221        ((((_pte).pte >> 3) & 0x1f ) + (((_pte).pte >> 9) << 6 ))
222
223#define pgoff_to_pte(off) \
224        ((pte_t) { (((off) & 0x1f) << 3) + (((off) >> 6) << 9) + _PAGE_FILE })
225
226#endif /* _ASM_PGTABLE_64_H */
Note: See TracBrowser for help on using the repository browser.