License cleanup: add SPDX GPL-2.0 license identifier to files with no license
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>
2017-11-01 15:07:57 +01:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-16 15:20:36 -07:00
|
|
|
#ifndef _MOTOROLA_PGTABLE_H
|
|
|
|
|
#define _MOTOROLA_PGTABLE_H
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Definitions for MMU descriptors
|
|
|
|
|
*/
|
|
|
|
|
#define _PAGE_PRESENT 0x001
|
|
|
|
|
#define _PAGE_SHORT 0x002
|
|
|
|
|
#define _PAGE_RONLY 0x004
|
2011-10-18 16:16:43 +10:00
|
|
|
#define _PAGE_READWRITE 0x000
|
2005-04-16 15:20:36 -07:00
|
|
|
#define _PAGE_ACCESSED 0x008
|
|
|
|
|
#define _PAGE_DIRTY 0x010
|
|
|
|
|
#define _PAGE_SUPER 0x080 /* 68040 supervisor only */
|
|
|
|
|
#define _PAGE_GLOBAL040 0x400 /* 68040 global bit, used for kva descs */
|
|
|
|
|
#define _PAGE_NOCACHE030 0x040 /* 68030 no-cache mode */
|
|
|
|
|
#define _PAGE_NOCACHE 0x060 /* 68040 cache mode, non-serialized */
|
|
|
|
|
#define _PAGE_NOCACHE_S 0x040 /* 68040 no-cache mode, serialized */
|
|
|
|
|
#define _PAGE_CACHE040 0x020 /* 68040 cache mode, cachable, copyback */
|
|
|
|
|
#define _PAGE_CACHE040W 0x000 /* 68040 cache mode, cachable, write-through */
|
|
|
|
|
|
|
|
|
|
#define _DESCTYPE_MASK 0x003
|
|
|
|
|
|
|
|
|
|
#define _CACHEMASK040 (~0x060)
|
2020-01-31 13:45:37 +01:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Currently set to the minimum alignment of table pointers (256 bytes).
|
|
|
|
|
* The hardware only uses the low 4 bits for state:
|
|
|
|
|
*
|
|
|
|
|
* 3 - Used
|
|
|
|
|
* 2 - Write Protected
|
|
|
|
|
* 0,1 - Descriptor Type
|
|
|
|
|
*
|
|
|
|
|
* and has the rest of the bits reserved.
|
|
|
|
|
*/
|
|
|
|
|
#define _TABLE_MASK (0xffffff00)
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
#define _PAGE_TABLE (_PAGE_SHORT)
|
|
|
|
|
#define _PAGE_CHG_MASK (PAGE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY | _PAGE_NOCACHE)
|
|
|
|
|
|
|
|
|
|
#define _PAGE_PROTNONE 0x004
|
|
|
|
|
|
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
|
|
|
|
|
|
/* This is the cache mode to be used for pages containing page descriptors for
|
|
|
|
|
* processors >= '040. It is in pte_mknocache(), and the variable is defined
|
|
|
|
|
* and initialized in head.S */
|
|
|
|
|
extern int m68k_pgtable_cachemode;
|
|
|
|
|
|
|
|
|
|
/* This is the cache mode for normal pages, for supervisor access on
|
|
|
|
|
* processors >= '040. It is used in pte_mkcache(), and the variable is
|
|
|
|
|
* defined and initialized in head.S */
|
|
|
|
|
|
|
|
|
|
#if defined(CPU_M68060_ONLY) && defined(CONFIG_060_WRITETHROUGH)
|
|
|
|
|
#define m68k_supervisor_cachemode _PAGE_CACHE040W
|
|
|
|
|
#elif defined(CPU_M68040_OR_M68060_ONLY)
|
|
|
|
|
#define m68k_supervisor_cachemode _PAGE_CACHE040
|
|
|
|
|
#elif defined(CPU_M68020_OR_M68030_ONLY)
|
|
|
|
|
#define m68k_supervisor_cachemode 0
|
|
|
|
|
#else
|
|
|
|
|
extern int m68k_supervisor_cachemode;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined(CPU_M68040_OR_M68060_ONLY)
|
|
|
|
|
#define mm_cachebits _PAGE_CACHE040
|
|
|
|
|
#elif defined(CPU_M68020_OR_M68030_ONLY)
|
|
|
|
|
#define mm_cachebits 0
|
|
|
|
|
#else
|
|
|
|
|
extern unsigned long mm_cachebits;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define PAGE_NONE __pgprot(_PAGE_PROTNONE | _PAGE_ACCESSED | mm_cachebits)
|
|
|
|
|
#define PAGE_SHARED __pgprot(_PAGE_PRESENT | _PAGE_ACCESSED | mm_cachebits)
|
|
|
|
|
#define PAGE_COPY __pgprot(_PAGE_PRESENT | _PAGE_RONLY | _PAGE_ACCESSED | mm_cachebits)
|
|
|
|
|
#define PAGE_READONLY __pgprot(_PAGE_PRESENT | _PAGE_RONLY | _PAGE_ACCESSED | mm_cachebits)
|
|
|
|
|
#define PAGE_KERNEL __pgprot(_PAGE_PRESENT | _PAGE_DIRTY | _PAGE_ACCESSED | mm_cachebits)
|
|
|
|
|
|
|
|
|
|
/* Alternate definitions that are compile time constants, for
|
|
|
|
|
initializing protection_map. The cachebits are fixed later. */
|
|
|
|
|
#define PAGE_NONE_C __pgprot(_PAGE_PROTNONE | _PAGE_ACCESSED)
|
|
|
|
|
#define PAGE_SHARED_C __pgprot(_PAGE_PRESENT | _PAGE_ACCESSED)
|
|
|
|
|
#define PAGE_COPY_C __pgprot(_PAGE_PRESENT | _PAGE_RONLY | _PAGE_ACCESSED)
|
|
|
|
|
#define PAGE_READONLY_C __pgprot(_PAGE_PRESENT | _PAGE_RONLY | _PAGE_ACCESSED)
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The m68k can't do page protection for execute, and considers that the same are read.
|
|
|
|
|
* Also, write permissions imply read permissions. This is the closest we can get..
|
|
|
|
|
*/
|
|
|
|
|
#define __P000 PAGE_NONE_C
|
|
|
|
|
#define __P001 PAGE_READONLY_C
|
|
|
|
|
#define __P010 PAGE_COPY_C
|
|
|
|
|
#define __P011 PAGE_COPY_C
|
|
|
|
|
#define __P100 PAGE_READONLY_C
|
|
|
|
|
#define __P101 PAGE_READONLY_C
|
|
|
|
|
#define __P110 PAGE_COPY_C
|
|
|
|
|
#define __P111 PAGE_COPY_C
|
|
|
|
|
|
|
|
|
|
#define __S000 PAGE_NONE_C
|
|
|
|
|
#define __S001 PAGE_READONLY_C
|
|
|
|
|
#define __S010 PAGE_SHARED_C
|
|
|
|
|
#define __S011 PAGE_SHARED_C
|
|
|
|
|
#define __S100 PAGE_READONLY_C
|
|
|
|
|
#define __S101 PAGE_READONLY_C
|
|
|
|
|
#define __S110 PAGE_SHARED_C
|
|
|
|
|
#define __S111 PAGE_SHARED_C
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Conversion functions: convert a page and protection to a page entry,
|
|
|
|
|
* and a page entry and page directory to the page they refer to.
|
|
|
|
|
*/
|
|
|
|
|
#define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
|
|
|
|
|
{
|
|
|
|
|
pte_val(pte) = (pte_val(pte) & _PAGE_CHG_MASK) | pgprot_val(newprot);
|
|
|
|
|
return pte;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline void pmd_set(pmd_t *pmdp, pte_t *ptep)
|
|
|
|
|
{
|
m68k: mm: Restructure Motorola MMU page-table layout
The Motorola 68xxx MMUs, 040 (and later) have a fixed 7,7,{5,6}
page-table setup, where the last depends on the page-size selected (8k
vs 4k resp.), and head.S selects 4K pages. For 030 (and earlier) we
explicitly program 7,7,6 and 4K pages in %tc.
However, the current code implements this mightily weird. What it does
is group 16 of those (6 bit) pte tables into one 4k page to not waste
space. The down-side is that that forces pmd_t to be a 16-tuple
pointing to consecutive pte tables.
This breaks the generic code which assumes READ_ONCE(*pmd) will be
word sized.
Therefore implement a straight forward 7,7,6 3 level page-table setup,
with the addition (for 020/030) of (partial) large-page support. For
now this increases the memory footprint for pte-tables 15 fold.
Tested with ARAnyM/68040 emulation.
Suggested-by: Will Deacon <will@kernel.org>
Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Acked-by: Will Deacon <will@kernel.org>
Acked-by: Greg Ungerer <gerg@linux-m68k.org>
Tested-by: Michael Schmitz <schmitzmic@gmail.com>
Tested-by: Greg Ungerer <gerg@linux-m68k.org>
Link: https://lore.kernel.org/r/20200131125403.711478295@infradead.org
Signed-off-by: Geert Uytterhoeven <geert@linux-m68k.org>
2020-01-31 13:45:36 +01:00
|
|
|
pmd_val(*pmdp) = virt_to_phys(ptep) | _PAGE_TABLE | _PAGE_ACCESSED;
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
|
|
|
|
|
2019-12-04 16:53:59 -08:00
|
|
|
static inline void pud_set(pud_t *pudp, pmd_t *pmdp)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
2019-12-04 16:53:59 -08:00
|
|
|
pud_val(*pudp) = _PAGE_TABLE | _PAGE_ACCESSED | __pa(pmdp);
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define __pte_page(pte) ((unsigned long)__va(pte_val(pte) & PAGE_MASK))
|
2020-06-08 21:33:10 -07:00
|
|
|
#define pmd_page_vaddr(pmd) ((unsigned long)__va(pmd_val(pmd) & _TABLE_MASK))
|
2019-12-04 16:53:59 -08:00
|
|
|
#define pud_page_vaddr(pud) ((unsigned long)__va(pud_val(pud) & _TABLE_MASK))
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
#define pte_none(pte) (!pte_val(pte))
|
|
|
|
|
#define pte_present(pte) (pte_val(pte) & (_PAGE_PRESENT | _PAGE_PROTNONE))
|
|
|
|
|
#define pte_clear(mm,addr,ptep) ({ pte_val(*(ptep)) = 0; })
|
|
|
|
|
|
2007-05-31 00:40:54 -07:00
|
|
|
#define pte_page(pte) virt_to_page(__va(pte_val(pte)))
|
2005-04-16 15:20:36 -07:00
|
|
|
#define pte_pfn(pte) (pte_val(pte) >> PAGE_SHIFT)
|
|
|
|
|
#define pfn_pte(pfn, prot) __pte(((pfn) << PAGE_SHIFT) | pgprot_val(prot))
|
|
|
|
|
|
|
|
|
|
#define pmd_none(pmd) (!pmd_val(pmd))
|
|
|
|
|
#define pmd_bad(pmd) ((pmd_val(pmd) & _DESCTYPE_MASK) != _PAGE_TABLE)
|
|
|
|
|
#define pmd_present(pmd) (pmd_val(pmd) & _PAGE_TABLE)
|
m68k: mm: Restructure Motorola MMU page-table layout
The Motorola 68xxx MMUs, 040 (and later) have a fixed 7,7,{5,6}
page-table setup, where the last depends on the page-size selected (8k
vs 4k resp.), and head.S selects 4K pages. For 030 (and earlier) we
explicitly program 7,7,6 and 4K pages in %tc.
However, the current code implements this mightily weird. What it does
is group 16 of those (6 bit) pte tables into one 4k page to not waste
space. The down-side is that that forces pmd_t to be a 16-tuple
pointing to consecutive pte tables.
This breaks the generic code which assumes READ_ONCE(*pmd) will be
word sized.
Therefore implement a straight forward 7,7,6 3 level page-table setup,
with the addition (for 020/030) of (partial) large-page support. For
now this increases the memory footprint for pte-tables 15 fold.
Tested with ARAnyM/68040 emulation.
Suggested-by: Will Deacon <will@kernel.org>
Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Acked-by: Will Deacon <will@kernel.org>
Acked-by: Greg Ungerer <gerg@linux-m68k.org>
Tested-by: Michael Schmitz <schmitzmic@gmail.com>
Tested-by: Greg Ungerer <gerg@linux-m68k.org>
Link: https://lore.kernel.org/r/20200131125403.711478295@infradead.org
Signed-off-by: Geert Uytterhoeven <geert@linux-m68k.org>
2020-01-31 13:45:36 +01:00
|
|
|
#define pmd_clear(pmdp) ({ pmd_val(*pmdp) = 0; })
|
2020-01-31 13:45:38 +01:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* m68k does not have huge pages (020/030 actually could), but generic code
|
|
|
|
|
* expects pmd_page() to exists, only to then DCE it all. Provide a dummy to
|
|
|
|
|
* make the compiler happy.
|
|
|
|
|
*/
|
|
|
|
|
#define pmd_page(pmd) NULL
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2019-12-04 16:53:59 -08:00
|
|
|
#define pud_none(pud) (!pud_val(pud))
|
|
|
|
|
#define pud_bad(pud) ((pud_val(pud) & _DESCTYPE_MASK) != _PAGE_TABLE)
|
|
|
|
|
#define pud_present(pud) (pud_val(pud) & _PAGE_TABLE)
|
|
|
|
|
#define pud_clear(pudp) ({ pud_val(*pudp) = 0; })
|
|
|
|
|
#define pud_page(pud) (mem_map + ((unsigned long)(__va(pud_val(pud)) - PAGE_OFFSET) >> PAGE_SHIFT))
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
#define pte_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, pte_val(e))
|
|
|
|
|
#define pmd_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pmd %08lx.\n", __FILE__, __LINE__, pmd_val(e))
|
|
|
|
|
#define pgd_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, pgd_val(e))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* 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) & _PAGE_RONLY); }
|
|
|
|
|
static inline int pte_dirty(pte_t pte) { return pte_val(pte) & _PAGE_DIRTY; }
|
|
|
|
|
static inline int pte_young(pte_t pte) { return pte_val(pte) & _PAGE_ACCESSED; }
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_wrprotect(pte_t pte) { pte_val(pte) |= _PAGE_RONLY; return pte; }
|
|
|
|
|
static inline pte_t pte_mkclean(pte_t pte) { pte_val(pte) &= ~_PAGE_DIRTY; return pte; }
|
|
|
|
|
static inline pte_t pte_mkold(pte_t pte) { pte_val(pte) &= ~_PAGE_ACCESSED; return pte; }
|
|
|
|
|
static inline pte_t pte_mkwrite(pte_t pte) { pte_val(pte) &= ~_PAGE_RONLY; return pte; }
|
|
|
|
|
static inline pte_t pte_mkdirty(pte_t pte) { pte_val(pte) |= _PAGE_DIRTY; return pte; }
|
|
|
|
|
static inline pte_t pte_mkyoung(pte_t pte) { pte_val(pte) |= _PAGE_ACCESSED; return pte; }
|
|
|
|
|
static inline pte_t pte_mknocache(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
pte_val(pte) = (pte_val(pte) & _CACHEMASK040) | m68k_pgtable_cachemode;
|
|
|
|
|
return pte;
|
|
|
|
|
}
|
|
|
|
|
static inline pte_t pte_mkcache(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
pte_val(pte) = (pte_val(pte) & _CACHEMASK040) | m68k_supervisor_cachemode;
|
|
|
|
|
return pte;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define swapper_pg_dir kernel_pg_dir
|
|
|
|
|
extern pgd_t kernel_pg_dir[128];
|
|
|
|
|
|
|
|
|
|
/* Encode and de-code a swap entry (must be !pte_none(e) && !pte_present(e)) */
|
|
|
|
|
#define __swp_type(x) (((x).val >> 4) & 0xff)
|
|
|
|
|
#define __swp_offset(x) ((x).val >> 12)
|
|
|
|
|
#define __swp_entry(type, offset) ((swp_entry_t) { ((type) << 4) | ((offset) << 12) })
|
|
|
|
|
#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
|
|
|
|
|
#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
|
|
|
|
|
|
|
|
|
|
#endif /* !__ASSEMBLY__ */
|
|
|
|
|
#endif /* _MOTOROLA_PGTABLE_H */
|