mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-25 02:45:51 +07:00
b24413180f
Many source files in the tree are missing licensing information, which makes it harder for compliance tools to determine the correct license. By default all files without license information are under the default license of the kernel, which is GPL version 2. Update the files which contain no license information with the 'GPL-2.0' SPDX license identifier. The SPDX identifier is a legally binding shorthand, which can be used instead of the full boiler plate text. This patch is based on work done by Thomas Gleixner and Kate Stewart and Philippe Ombredanne. How this work was done: Patches were generated and checked against linux-4.14-rc6 for a subset of the use cases: - file had no licensing information it it. - file was a */uapi/* one with no licensing information in it, - file was a */uapi/* one with existing licensing information, Further patches will be generated in subsequent months to fix up cases where non-standard license headers were used, and references to license had to be inferred by heuristics based on keywords. The analysis to determine which SPDX License Identifier to be applied to a file was done in a spreadsheet of side by side results from of the output of two independent scanners (ScanCode & Windriver) producing SPDX tag:value files created by Philippe Ombredanne. Philippe prepared the base worksheet, and did an initial spot review of a few 1000 files. The 4.13 kernel was the starting point of the analysis with 60,537 files assessed. Kate Stewart did a file by file comparison of the scanner results in the spreadsheet to determine which SPDX license identifier(s) to be applied to the file. She confirmed any determination that was not immediately clear with lawyers working with the Linux Foundation. Criteria used to select files for SPDX license identifier tagging was: - Files considered eligible had to be source code files. - Make and config files were included as candidates if they contained >5 lines of source - File already had some variant of a license header in it (even if <5 lines). All documentation files were explicitly excluded. The following heuristics were used to determine which SPDX license identifiers to apply. - when both scanners couldn't find any license traces, file was considered to have no license information in it, and the top level COPYING file license applied. For non */uapi/* files that summary was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 11139 and resulted in the first patch in this series. If that file was a */uapi/* path one, it was "GPL-2.0 WITH Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 WITH Linux-syscall-note 930 and resulted in the second patch in this series. - if a file had some form of licensing information in it, and was one of the */uapi/* ones, it was denoted with the Linux-syscall-note if any GPL family license was found in the file or had no licensing in it (per prior point). Results summary: SPDX license identifier # files ---------------------------------------------------|------ GPL-2.0 WITH Linux-syscall-note 270 GPL-2.0+ WITH Linux-syscall-note 169 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17 LGPL-2.1+ WITH Linux-syscall-note 15 GPL-1.0+ WITH Linux-syscall-note 14 ((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5 LGPL-2.0+ WITH Linux-syscall-note 4 LGPL-2.1 WITH Linux-syscall-note 3 ((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3 ((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1 and that resulted in the third patch in this series. - when the two scanners agreed on the detected license(s), that became the concluded license(s). - when there was disagreement between the two scanners (one detected a license but the other didn't, or they both detected different licenses) a manual inspection of the file occurred. - In most cases a manual inspection of the information in the file resulted in a clear resolution of the license that should apply (and which scanner probably needed to revisit its heuristics). - When it was not immediately clear, the license identifier was confirmed with lawyers working with the Linux Foundation. - If there was any question as to the appropriate license identifier, the file was flagged for further research and to be revisited later in time. In total, over 70 hours of logged manual review was done on the spreadsheet to determine the SPDX license identifiers to apply to the source files by Kate, Philippe, Thomas and, in some cases, confirmation by lawyers working with the Linux Foundation. Kate also obtained a third independent scan of the 4.13 code base from FOSSology, and compared selected files where the other two scanners disagreed against that SPDX file, to see if there was new insights. The Windriver scanner is based on an older version of FOSSology in part, so they are related. Thomas did random spot checks in about 500 files from the spreadsheets for the uapi headers and agreed with SPDX license identifier in the files he inspected. For the non-uapi files Thomas did random spot checks in about 15000 files. In initial set of patches against 4.14-rc6, 3 files were found to have copy/paste license identifier errors, and have been fixed to reflect the correct identifier. Additionally Philippe spent 10 hours this week doing a detailed manual inspection and review of the 12,461 patched files from the initial patch version early this week with: - a full scancode scan run, collecting the matched texts, detected license ids and scores - reviewing anything where there was a license detected (about 500+ files) to ensure that the applied SPDX license was correct - reviewing anything where there was no detection but the patch license was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied SPDX license was correct This produced a worksheet with 20 files needing minor correction. This worksheet was then exported into 3 different .csv files for the different types of files to be modified. These .csv files were then reviewed by Greg. Thomas wrote a script to parse the csv files and add the proper SPDX tag to the file, in the format that the file expected. This script was further refined by Greg based on the output to detect more types of files automatically and to distinguish between header and source .c files (which need different comment types.) Finally Greg ran the script using the .csv files to generate the patches. Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com> Reviewed-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
454 lines
11 KiB
C
454 lines
11 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _SPARC_PGTABLE_H
|
|
#define _SPARC_PGTABLE_H
|
|
|
|
/* asm/pgtable.h: Defines and functions used to work
|
|
* with Sparc page tables.
|
|
*
|
|
* Copyright (C) 1995 David S. Miller (davem@caip.rutgers.edu)
|
|
* Copyright (C) 1998 Jakub Jelinek (jj@sunsite.mff.cuni.cz)
|
|
*/
|
|
|
|
#include <linux/const.h>
|
|
|
|
#ifndef __ASSEMBLY__
|
|
#include <asm-generic/4level-fixup.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
#include <linux/mm_types.h>
|
|
#include <asm/types.h>
|
|
#include <asm/pgtsrmmu.h>
|
|
#include <asm/vaddrs.h>
|
|
#include <asm/oplib.h>
|
|
#include <asm/cpu_type.h>
|
|
|
|
|
|
struct vm_area_struct;
|
|
struct page;
|
|
|
|
void load_mmu(void);
|
|
unsigned long calc_highpages(void);
|
|
unsigned long __init bootmem_init(unsigned long *pages_avail);
|
|
|
|
#define pte_ERROR(e) __builtin_trap()
|
|
#define pmd_ERROR(e) __builtin_trap()
|
|
#define pgd_ERROR(e) __builtin_trap()
|
|
|
|
#define PMD_SHIFT 22
|
|
#define PMD_SIZE (1UL << PMD_SHIFT)
|
|
#define PMD_MASK (~(PMD_SIZE-1))
|
|
#define PMD_ALIGN(__addr) (((__addr) + ~PMD_MASK) & PMD_MASK)
|
|
#define PGDIR_SHIFT SRMMU_PGDIR_SHIFT
|
|
#define PGDIR_SIZE SRMMU_PGDIR_SIZE
|
|
#define PGDIR_MASK SRMMU_PGDIR_MASK
|
|
#define PTRS_PER_PTE 1024
|
|
#define PTRS_PER_PMD SRMMU_PTRS_PER_PMD
|
|
#define PTRS_PER_PGD SRMMU_PTRS_PER_PGD
|
|
#define USER_PTRS_PER_PGD PAGE_OFFSET / SRMMU_PGDIR_SIZE
|
|
#define FIRST_USER_ADDRESS 0UL
|
|
#define PTE_SIZE (PTRS_PER_PTE*4)
|
|
|
|
#define PAGE_NONE SRMMU_PAGE_NONE
|
|
#define PAGE_SHARED SRMMU_PAGE_SHARED
|
|
#define PAGE_COPY SRMMU_PAGE_COPY
|
|
#define PAGE_READONLY SRMMU_PAGE_RDONLY
|
|
#define PAGE_KERNEL SRMMU_PAGE_KERNEL
|
|
|
|
/* Top-level page directory - dummy used by init-mm.
|
|
* srmmu.c will assign the real one (which is dynamically sized) */
|
|
#define swapper_pg_dir NULL
|
|
|
|
void paging_init(void);
|
|
|
|
extern unsigned long ptr_in_current_pgd;
|
|
|
|
/* xwr */
|
|
#define __P000 PAGE_NONE
|
|
#define __P001 PAGE_READONLY
|
|
#define __P010 PAGE_COPY
|
|
#define __P011 PAGE_COPY
|
|
#define __P100 PAGE_READONLY
|
|
#define __P101 PAGE_READONLY
|
|
#define __P110 PAGE_COPY
|
|
#define __P111 PAGE_COPY
|
|
|
|
#define __S000 PAGE_NONE
|
|
#define __S001 PAGE_READONLY
|
|
#define __S010 PAGE_SHARED
|
|
#define __S011 PAGE_SHARED
|
|
#define __S100 PAGE_READONLY
|
|
#define __S101 PAGE_READONLY
|
|
#define __S110 PAGE_SHARED
|
|
#define __S111 PAGE_SHARED
|
|
|
|
/* First physical page can be anywhere, the following is needed so that
|
|
* va-->pa and vice versa conversions work properly without performance
|
|
* hit for all __pa()/__va() operations.
|
|
*/
|
|
extern unsigned long phys_base;
|
|
extern unsigned long pfn_base;
|
|
|
|
/*
|
|
* ZERO_PAGE is a global shared page that is always zero: used
|
|
* for zero-mapped memory areas etc..
|
|
*/
|
|
extern unsigned long empty_zero_page[PAGE_SIZE / sizeof(unsigned long)];
|
|
|
|
#define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
|
|
|
|
/*
|
|
* In general all page table modifications should use the V8 atomic
|
|
* swap instruction. This insures the mmu and the cpu are in sync
|
|
* with respect to ref/mod bits in the page tables.
|
|
*/
|
|
static inline unsigned long srmmu_swap(unsigned long *addr, unsigned long value)
|
|
{
|
|
__asm__ __volatile__("swap [%2], %0" :
|
|
"=&r" (value) : "0" (value), "r" (addr) : "memory");
|
|
return value;
|
|
}
|
|
|
|
/* Certain architectures need to do special things when pte's
|
|
* within a page table are directly modified. Thus, the following
|
|
* hook is made available.
|
|
*/
|
|
|
|
static inline void set_pte(pte_t *ptep, pte_t pteval)
|
|
{
|
|
srmmu_swap((unsigned long *)ptep, pte_val(pteval));
|
|
}
|
|
|
|
#define set_pte_at(mm,addr,ptep,pteval) set_pte(ptep,pteval)
|
|
|
|
static inline int srmmu_device_memory(unsigned long x)
|
|
{
|
|
return ((x & 0xF0000000) != 0);
|
|
}
|
|
|
|
static inline struct page *pmd_page(pmd_t pmd)
|
|
{
|
|
if (srmmu_device_memory(pmd_val(pmd)))
|
|
BUG();
|
|
return pfn_to_page((pmd_val(pmd) & SRMMU_PTD_PMASK) >> (PAGE_SHIFT-4));
|
|
}
|
|
|
|
static inline unsigned long pgd_page_vaddr(pgd_t pgd)
|
|
{
|
|
if (srmmu_device_memory(pgd_val(pgd))) {
|
|
return ~0;
|
|
} else {
|
|
unsigned long v = pgd_val(pgd) & SRMMU_PTD_PMASK;
|
|
return (unsigned long)__nocache_va(v << 4);
|
|
}
|
|
}
|
|
|
|
static inline int pte_present(pte_t pte)
|
|
{
|
|
return ((pte_val(pte) & SRMMU_ET_MASK) == SRMMU_ET_PTE);
|
|
}
|
|
|
|
static inline int pte_none(pte_t pte)
|
|
{
|
|
return !pte_val(pte);
|
|
}
|
|
|
|
static inline void __pte_clear(pte_t *ptep)
|
|
{
|
|
set_pte(ptep, __pte(0));
|
|
}
|
|
|
|
static inline void pte_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
|
|
{
|
|
__pte_clear(ptep);
|
|
}
|
|
|
|
static inline int pmd_bad(pmd_t pmd)
|
|
{
|
|
return (pmd_val(pmd) & SRMMU_ET_MASK) != SRMMU_ET_PTD;
|
|
}
|
|
|
|
static inline int pmd_present(pmd_t pmd)
|
|
{
|
|
return ((pmd_val(pmd) & SRMMU_ET_MASK) == SRMMU_ET_PTD);
|
|
}
|
|
|
|
static inline int pmd_none(pmd_t pmd)
|
|
{
|
|
return !pmd_val(pmd);
|
|
}
|
|
|
|
static inline void pmd_clear(pmd_t *pmdp)
|
|
{
|
|
int i;
|
|
for (i = 0; i < PTRS_PER_PTE/SRMMU_REAL_PTRS_PER_PTE; i++)
|
|
set_pte((pte_t *)&pmdp->pmdv[i], __pte(0));
|
|
}
|
|
|
|
static inline int pgd_none(pgd_t pgd)
|
|
{
|
|
return !(pgd_val(pgd) & 0xFFFFFFF);
|
|
}
|
|
|
|
static inline int pgd_bad(pgd_t pgd)
|
|
{
|
|
return (pgd_val(pgd) & SRMMU_ET_MASK) != SRMMU_ET_PTD;
|
|
}
|
|
|
|
static inline int pgd_present(pgd_t pgd)
|
|
{
|
|
return ((pgd_val(pgd) & SRMMU_ET_MASK) == SRMMU_ET_PTD);
|
|
}
|
|
|
|
static inline void pgd_clear(pgd_t *pgdp)
|
|
{
|
|
set_pte((pte_t *)pgdp, __pte(0));
|
|
}
|
|
|
|
/*
|
|
* The following only work if pte_present() is true.
|
|
* Undefined behaviour if not..
|
|
*/
|
|
static inline int pte_write(pte_t pte)
|
|
{
|
|
return pte_val(pte) & SRMMU_WRITE;
|
|
}
|
|
|
|
static inline int pte_dirty(pte_t pte)
|
|
{
|
|
return pte_val(pte) & SRMMU_DIRTY;
|
|
}
|
|
|
|
static inline int pte_young(pte_t pte)
|
|
{
|
|
return pte_val(pte) & SRMMU_REF;
|
|
}
|
|
|
|
static inline int pte_special(pte_t pte)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static inline pte_t pte_wrprotect(pte_t pte)
|
|
{
|
|
return __pte(pte_val(pte) & ~SRMMU_WRITE);
|
|
}
|
|
|
|
static inline pte_t pte_mkclean(pte_t pte)
|
|
{
|
|
return __pte(pte_val(pte) & ~SRMMU_DIRTY);
|
|
}
|
|
|
|
static inline pte_t pte_mkold(pte_t pte)
|
|
{
|
|
return __pte(pte_val(pte) & ~SRMMU_REF);
|
|
}
|
|
|
|
static inline pte_t pte_mkwrite(pte_t pte)
|
|
{
|
|
return __pte(pte_val(pte) | SRMMU_WRITE);
|
|
}
|
|
|
|
static inline pte_t pte_mkdirty(pte_t pte)
|
|
{
|
|
return __pte(pte_val(pte) | SRMMU_DIRTY);
|
|
}
|
|
|
|
static inline pte_t pte_mkyoung(pte_t pte)
|
|
{
|
|
return __pte(pte_val(pte) | SRMMU_REF);
|
|
}
|
|
|
|
#define pte_mkspecial(pte) (pte)
|
|
|
|
#define pfn_pte(pfn, prot) mk_pte(pfn_to_page(pfn), prot)
|
|
|
|
static inline unsigned long pte_pfn(pte_t pte)
|
|
{
|
|
if (srmmu_device_memory(pte_val(pte))) {
|
|
/* Just return something that will cause
|
|
* pfn_valid() to return false. This makes
|
|
* copy_one_pte() to just directly copy to
|
|
* PTE over.
|
|
*/
|
|
return ~0UL;
|
|
}
|
|
return (pte_val(pte) & SRMMU_PTE_PMASK) >> (PAGE_SHIFT-4);
|
|
}
|
|
|
|
#define pte_page(pte) pfn_to_page(pte_pfn(pte))
|
|
|
|
/*
|
|
* Conversion functions: convert a page and protection to a page entry,
|
|
* and a page entry and page directory to the page they refer to.
|
|
*/
|
|
static inline pte_t mk_pte(struct page *page, pgprot_t pgprot)
|
|
{
|
|
return __pte((page_to_pfn(page) << (PAGE_SHIFT-4)) | pgprot_val(pgprot));
|
|
}
|
|
|
|
static inline pte_t mk_pte_phys(unsigned long page, pgprot_t pgprot)
|
|
{
|
|
return __pte(((page) >> 4) | pgprot_val(pgprot));
|
|
}
|
|
|
|
static inline pte_t mk_pte_io(unsigned long page, pgprot_t pgprot, int space)
|
|
{
|
|
return __pte(((page) >> 4) | (space << 28) | pgprot_val(pgprot));
|
|
}
|
|
|
|
#define pgprot_noncached pgprot_noncached
|
|
static inline pgprot_t pgprot_noncached(pgprot_t prot)
|
|
{
|
|
pgprot_val(prot) &= ~pgprot_val(__pgprot(SRMMU_CACHE));
|
|
return prot;
|
|
}
|
|
|
|
static pte_t pte_modify(pte_t pte, pgprot_t newprot) __attribute_const__;
|
|
static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
|
|
{
|
|
return __pte((pte_val(pte) & SRMMU_CHG_MASK) |
|
|
pgprot_val(newprot));
|
|
}
|
|
|
|
#define pgd_index(address) ((address) >> PGDIR_SHIFT)
|
|
|
|
/* to find an entry in a page-table-directory */
|
|
#define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
|
|
|
|
/* to find an entry in a kernel page-table-directory */
|
|
#define pgd_offset_k(address) pgd_offset(&init_mm, address)
|
|
|
|
/* Find an entry in the second-level page table.. */
|
|
static inline pmd_t *pmd_offset(pgd_t * dir, unsigned long address)
|
|
{
|
|
return (pmd_t *) pgd_page_vaddr(*dir) +
|
|
((address >> PMD_SHIFT) & (PTRS_PER_PMD - 1));
|
|
}
|
|
|
|
/* Find an entry in the third-level page table.. */
|
|
pte_t *pte_offset_kernel(pmd_t * dir, unsigned long address);
|
|
|
|
/*
|
|
* This shortcut works on sun4m (and sun4d) because the nocache area is static.
|
|
*/
|
|
#define pte_offset_map(d, a) pte_offset_kernel(d,a)
|
|
#define pte_unmap(pte) do{}while(0)
|
|
|
|
struct seq_file;
|
|
void mmu_info(struct seq_file *m);
|
|
|
|
/* Fault handler stuff... */
|
|
#define FAULT_CODE_PROT 0x1
|
|
#define FAULT_CODE_WRITE 0x2
|
|
#define FAULT_CODE_USER 0x4
|
|
|
|
#define update_mmu_cache(vma, address, ptep) do { } while (0)
|
|
|
|
void srmmu_mapiorange(unsigned int bus, unsigned long xpa,
|
|
unsigned long xva, unsigned int len);
|
|
void srmmu_unmapiorange(unsigned long virt_addr, unsigned int len);
|
|
|
|
/* Encode and de-code a swap entry */
|
|
static inline unsigned long __swp_type(swp_entry_t entry)
|
|
{
|
|
return (entry.val >> SRMMU_SWP_TYPE_SHIFT) & SRMMU_SWP_TYPE_MASK;
|
|
}
|
|
|
|
static inline unsigned long __swp_offset(swp_entry_t entry)
|
|
{
|
|
return (entry.val >> SRMMU_SWP_OFF_SHIFT) & SRMMU_SWP_OFF_MASK;
|
|
}
|
|
|
|
static inline swp_entry_t __swp_entry(unsigned long type, unsigned long offset)
|
|
{
|
|
return (swp_entry_t) {
|
|
(type & SRMMU_SWP_TYPE_MASK) << SRMMU_SWP_TYPE_SHIFT
|
|
| (offset & SRMMU_SWP_OFF_MASK) << SRMMU_SWP_OFF_SHIFT };
|
|
}
|
|
|
|
#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
|
|
#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
|
|
|
|
static inline unsigned long
|
|
__get_phys (unsigned long addr)
|
|
{
|
|
switch (sparc_cpu_model){
|
|
case sun4m:
|
|
case sun4d:
|
|
return ((srmmu_get_pte (addr) & 0xffffff00) << 4);
|
|
default:
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static inline int
|
|
__get_iospace (unsigned long addr)
|
|
{
|
|
switch (sparc_cpu_model){
|
|
case sun4m:
|
|
case sun4d:
|
|
return (srmmu_get_pte (addr) >> 28);
|
|
default:
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
extern unsigned long *sparc_valid_addr_bitmap;
|
|
|
|
/* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
|
|
#define kern_addr_valid(addr) \
|
|
(test_bit(__pa((unsigned long)(addr))>>20, sparc_valid_addr_bitmap))
|
|
|
|
/*
|
|
* For sparc32&64, the pfn in io_remap_pfn_range() carries <iospace> in
|
|
* its high 4 bits. These macros/functions put it there or get it from there.
|
|
*/
|
|
#define MK_IOSPACE_PFN(space, pfn) (pfn | (space << (BITS_PER_LONG - 4)))
|
|
#define GET_IOSPACE(pfn) (pfn >> (BITS_PER_LONG - 4))
|
|
#define GET_PFN(pfn) (pfn & 0x0fffffffUL)
|
|
|
|
int remap_pfn_range(struct vm_area_struct *, unsigned long, unsigned long,
|
|
unsigned long, pgprot_t);
|
|
|
|
static inline int io_remap_pfn_range(struct vm_area_struct *vma,
|
|
unsigned long from, unsigned long pfn,
|
|
unsigned long size, pgprot_t prot)
|
|
{
|
|
unsigned long long offset, space, phys_base;
|
|
|
|
offset = ((unsigned long long) GET_PFN(pfn)) << PAGE_SHIFT;
|
|
space = GET_IOSPACE(pfn);
|
|
phys_base = offset | (space << 32ULL);
|
|
|
|
return remap_pfn_range(vma, from, phys_base >> PAGE_SHIFT, size, prot);
|
|
}
|
|
#define io_remap_pfn_range io_remap_pfn_range
|
|
|
|
#define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
|
|
#define ptep_set_access_flags(__vma, __address, __ptep, __entry, __dirty) \
|
|
({ \
|
|
int __changed = !pte_same(*(__ptep), __entry); \
|
|
if (__changed) { \
|
|
set_pte_at((__vma)->vm_mm, (__address), __ptep, __entry); \
|
|
flush_tlb_page(__vma, __address); \
|
|
} \
|
|
__changed; \
|
|
})
|
|
|
|
#include <asm-generic/pgtable.h>
|
|
|
|
#endif /* !(__ASSEMBLY__) */
|
|
|
|
#define VMALLOC_START _AC(0xfe600000,UL)
|
|
#define VMALLOC_END _AC(0xffc00000,UL)
|
|
|
|
/* We provide our own get_unmapped_area to cope with VA holes for userland */
|
|
#define HAVE_ARCH_UNMAPPED_AREA
|
|
|
|
/*
|
|
* No page table caches to initialise
|
|
*/
|
|
#define pgtable_cache_init() do { } while (0)
|
|
|
|
#endif /* !(_SPARC_PGTABLE_H) */
|