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 14:07:57 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-16 22:20:36 +00:00
|
|
|
#ifndef __ASM_SH_IO_H
|
|
|
|
#define __ASM_SH_IO_H
|
2010-11-01 13:49:04 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Convention:
|
2008-10-03 20:25:52 +00:00
|
|
|
* read{b,w,l,q}/write{b,w,l,q} are for PCI,
|
2005-04-16 22:20:36 +00:00
|
|
|
* while in{b,w,l}/out{b,w,l} are for ISA
|
2008-10-03 20:25:52 +00:00
|
|
|
*
|
2005-04-16 22:20:36 +00:00
|
|
|
* In addition we have 'pausing' versions: in{b,w,l}_p/out{b,w,l}_p
|
|
|
|
* and 'string' versions: ins{b,w,l}/outs{b,w,l}
|
|
|
|
*
|
2008-10-03 20:25:52 +00:00
|
|
|
* While read{b,w,l,q} and write{b,w,l,q} contain memory barriers
|
|
|
|
* automatically, there are also __raw versions, which do not.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2010-01-18 12:30:29 +00:00
|
|
|
#include <linux/errno.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <asm/cache.h>
|
|
|
|
#include <asm/addrspace.h>
|
|
|
|
#include <asm/machvec.h>
|
2006-01-17 06:14:15 +00:00
|
|
|
#include <asm/pgtable.h>
|
|
|
|
#include <asm-generic/iomap.h>
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
2010-11-01 13:49:04 +00:00
|
|
|
#define __IO_PREFIX generic
|
2006-01-17 06:14:15 +00:00
|
|
|
#include <asm/io_generic.h>
|
2008-02-07 11:18:21 +00:00
|
|
|
#include <asm/io_trapped.h>
|
2012-03-29 07:05:10 +00:00
|
|
|
#include <mach/mangle-port.h>
|
2006-01-17 06:14:15 +00:00
|
|
|
|
2008-10-03 20:25:52 +00:00
|
|
|
#define __raw_writeb(v,a) (__chk_io_ptr(a), *(volatile u8 __force *)(a) = (v))
|
|
|
|
#define __raw_writew(v,a) (__chk_io_ptr(a), *(volatile u16 __force *)(a) = (v))
|
|
|
|
#define __raw_writel(v,a) (__chk_io_ptr(a), *(volatile u32 __force *)(a) = (v))
|
|
|
|
#define __raw_writeq(v,a) (__chk_io_ptr(a), *(volatile u64 __force *)(a) = (v))
|
|
|
|
|
|
|
|
#define __raw_readb(a) (__chk_io_ptr(a), *(volatile u8 __force *)(a))
|
|
|
|
#define __raw_readw(a) (__chk_io_ptr(a), *(volatile u16 __force *)(a))
|
|
|
|
#define __raw_readl(a) (__chk_io_ptr(a), *(volatile u32 __force *)(a))
|
|
|
|
#define __raw_readq(a) (__chk_io_ptr(a), *(volatile u64 __force *)(a))
|
|
|
|
|
2012-03-29 07:05:10 +00:00
|
|
|
#define readb_relaxed(c) ({ u8 __v = ioswabb(__raw_readb(c)); __v; })
|
|
|
|
#define readw_relaxed(c) ({ u16 __v = ioswabw(__raw_readw(c)); __v; })
|
|
|
|
#define readl_relaxed(c) ({ u32 __v = ioswabl(__raw_readl(c)); __v; })
|
|
|
|
#define readq_relaxed(c) ({ u64 __v = ioswabq(__raw_readq(c)); __v; })
|
|
|
|
|
|
|
|
#define writeb_relaxed(v,c) ((void)__raw_writeb((__force u8)ioswabb(v),c))
|
|
|
|
#define writew_relaxed(v,c) ((void)__raw_writew((__force u16)ioswabw(v),c))
|
|
|
|
#define writel_relaxed(v,c) ((void)__raw_writel((__force u32)ioswabl(v),c))
|
|
|
|
#define writeq_relaxed(v,c) ((void)__raw_writeq((__force u64)ioswabq(v),c))
|
2010-11-01 13:49:04 +00:00
|
|
|
|
|
|
|
#define readb(a) ({ u8 r_ = readb_relaxed(a); rmb(); r_; })
|
|
|
|
#define readw(a) ({ u16 r_ = readw_relaxed(a); rmb(); r_; })
|
|
|
|
#define readl(a) ({ u32 r_ = readl_relaxed(a); rmb(); r_; })
|
|
|
|
#define readq(a) ({ u64 r_ = readq_relaxed(a); rmb(); r_; })
|
|
|
|
|
|
|
|
#define writeb(v,a) ({ wmb(); writeb_relaxed((v),(a)); })
|
|
|
|
#define writew(v,a) ({ wmb(); writew_relaxed((v),(a)); })
|
|
|
|
#define writel(v,a) ({ wmb(); writel_relaxed((v),(a)); })
|
|
|
|
#define writeq(v,a) ({ wmb(); writeq_relaxed((v),(a)); })
|
|
|
|
|
|
|
|
#define readsb(p,d,l) __raw_readsb(p,d,l)
|
|
|
|
#define readsw(p,d,l) __raw_readsw(p,d,l)
|
|
|
|
#define readsl(p,d,l) __raw_readsl(p,d,l)
|
|
|
|
|
|
|
|
#define writesb(p,d,l) __raw_writesb(p,d,l)
|
|
|
|
#define writesw(p,d,l) __raw_writesw(p,d,l)
|
|
|
|
#define writesl(p,d,l) __raw_writesl(p,d,l)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-02-18 04:23:30 +00:00
|
|
|
#define __BUILD_UNCACHED_IO(bwlq, type) \
|
|
|
|
static inline type read##bwlq##_uncached(unsigned long addr) \
|
|
|
|
{ \
|
|
|
|
type ret; \
|
|
|
|
jump_to_uncached(); \
|
|
|
|
ret = __raw_read##bwlq(addr); \
|
|
|
|
back_to_cached(); \
|
|
|
|
return ret; \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
static inline void write##bwlq##_uncached(type v, unsigned long addr) \
|
|
|
|
{ \
|
|
|
|
jump_to_uncached(); \
|
|
|
|
__raw_write##bwlq(v, addr); \
|
|
|
|
back_to_cached(); \
|
|
|
|
}
|
|
|
|
|
|
|
|
__BUILD_UNCACHED_IO(b, u8)
|
|
|
|
__BUILD_UNCACHED_IO(w, u16)
|
|
|
|
__BUILD_UNCACHED_IO(l, u32)
|
|
|
|
__BUILD_UNCACHED_IO(q, u64)
|
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
#define __BUILD_MEMORY_STRING(pfx, bwlq, type) \
|
2007-09-10 03:08:42 +00:00
|
|
|
\
|
2010-11-01 13:49:04 +00:00
|
|
|
static inline void \
|
|
|
|
pfx##writes##bwlq(volatile void __iomem *mem, const void *addr, \
|
|
|
|
unsigned int count) \
|
2007-09-10 03:08:42 +00:00
|
|
|
{ \
|
|
|
|
const volatile type *__addr = addr; \
|
|
|
|
\
|
|
|
|
while (count--) { \
|
|
|
|
__raw_write##bwlq(*__addr, mem); \
|
|
|
|
__addr++; \
|
|
|
|
} \
|
|
|
|
} \
|
|
|
|
\
|
2010-11-01 13:49:04 +00:00
|
|
|
static inline void pfx##reads##bwlq(volatile void __iomem *mem, \
|
|
|
|
void *addr, unsigned int count) \
|
2007-09-10 03:08:42 +00:00
|
|
|
{ \
|
|
|
|
volatile type *__addr = addr; \
|
|
|
|
\
|
|
|
|
while (count--) { \
|
|
|
|
*__addr = __raw_read##bwlq(mem); \
|
|
|
|
__addr++; \
|
|
|
|
} \
|
|
|
|
}
|
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
__BUILD_MEMORY_STRING(__raw_, b, u8)
|
|
|
|
__BUILD_MEMORY_STRING(__raw_, w, u16)
|
2008-10-03 20:25:52 +00:00
|
|
|
|
2009-05-09 05:44:30 +00:00
|
|
|
#ifdef CONFIG_SUPERH32
|
2008-10-03 20:25:52 +00:00
|
|
|
void __raw_writesl(void __iomem *addr, const void *data, int longlen);
|
|
|
|
void __raw_readsl(const void __iomem *addr, void *data, int longlen);
|
2009-05-09 05:44:30 +00:00
|
|
|
#else
|
2010-11-01 13:49:04 +00:00
|
|
|
__BUILD_MEMORY_STRING(__raw_, l, u32)
|
2009-05-09 05:44:30 +00:00
|
|
|
#endif
|
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
__BUILD_MEMORY_STRING(__raw_, q, u64)
|
|
|
|
|
2014-04-07 22:39:19 +00:00
|
|
|
#ifdef CONFIG_HAS_IOPORT_MAP
|
2010-11-01 13:49:04 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Slowdown I/O port space accesses for antique hardware.
|
|
|
|
*/
|
|
|
|
#undef CONF_SLOWDOWN_IO
|
|
|
|
|
|
|
|
/*
|
|
|
|
* On SuperH I/O ports are memory mapped, so we access them using normal
|
|
|
|
* load/store instructions. sh_io_port_base is the virtual address to
|
|
|
|
* which all ports are being mapped.
|
|
|
|
*/
|
2012-10-05 00:11:41 +00:00
|
|
|
extern unsigned long sh_io_port_base;
|
2010-11-01 13:49:04 +00:00
|
|
|
|
|
|
|
static inline void __set_io_port_base(unsigned long pbase)
|
|
|
|
{
|
|
|
|
*(unsigned long *)&sh_io_port_base = pbase;
|
|
|
|
barrier();
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_GENERIC_IOMAP
|
|
|
|
#define __ioport_map ioport_map
|
|
|
|
#else
|
|
|
|
extern void __iomem *__ioport_map(unsigned long addr, unsigned int size);
|
2009-08-24 07:10:40 +00:00
|
|
|
#endif
|
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
#ifdef CONF_SLOWDOWN_IO
|
|
|
|
#define SLOW_DOWN_IO __raw_readw(sh_io_port_base)
|
|
|
|
#else
|
|
|
|
#define SLOW_DOWN_IO
|
|
|
|
#endif
|
2009-08-24 07:10:40 +00:00
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
#define __BUILD_IOPORT_SINGLE(pfx, bwlq, type, p, slow) \
|
|
|
|
\
|
|
|
|
static inline void pfx##out##bwlq##p(type val, unsigned long port) \
|
|
|
|
{ \
|
|
|
|
volatile type *__addr; \
|
|
|
|
\
|
|
|
|
__addr = __ioport_map(port, sizeof(type)); \
|
|
|
|
*__addr = val; \
|
|
|
|
slow; \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
static inline type pfx##in##bwlq##p(unsigned long port) \
|
|
|
|
{ \
|
|
|
|
volatile type *__addr; \
|
|
|
|
type __val; \
|
|
|
|
\
|
|
|
|
__addr = __ioport_map(port, sizeof(type)); \
|
|
|
|
__val = *__addr; \
|
|
|
|
slow; \
|
|
|
|
\
|
|
|
|
return __val; \
|
|
|
|
}
|
2006-01-17 06:14:15 +00:00
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
#define __BUILD_IOPORT_PFX(bus, bwlq, type) \
|
|
|
|
__BUILD_IOPORT_SINGLE(bus, bwlq, type, ,) \
|
|
|
|
__BUILD_IOPORT_SINGLE(bus, bwlq, type, _p, SLOW_DOWN_IO)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
#define BUILDIO_IOPORT(bwlq, type) \
|
|
|
|
__BUILD_IOPORT_PFX(, bwlq, type)
|
2007-11-21 09:06:34 +00:00
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
BUILDIO_IOPORT(b, u8)
|
|
|
|
BUILDIO_IOPORT(w, u16)
|
|
|
|
BUILDIO_IOPORT(l, u32)
|
|
|
|
BUILDIO_IOPORT(q, u64)
|
|
|
|
|
|
|
|
#define __BUILD_IOPORT_STRING(bwlq, type) \
|
|
|
|
\
|
|
|
|
static inline void outs##bwlq(unsigned long port, const void *addr, \
|
|
|
|
unsigned int count) \
|
|
|
|
{ \
|
|
|
|
const volatile type *__addr = addr; \
|
|
|
|
\
|
|
|
|
while (count--) { \
|
|
|
|
out##bwlq(*__addr, port); \
|
|
|
|
__addr++; \
|
|
|
|
} \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
static inline void ins##bwlq(unsigned long port, void *addr, \
|
|
|
|
unsigned int count) \
|
|
|
|
{ \
|
|
|
|
volatile type *__addr = addr; \
|
|
|
|
\
|
|
|
|
while (count--) { \
|
|
|
|
*__addr = in##bwlq(port); \
|
|
|
|
__addr++; \
|
|
|
|
} \
|
|
|
|
}
|
|
|
|
|
|
|
|
__BUILD_IOPORT_STRING(b, u8)
|
|
|
|
__BUILD_IOPORT_STRING(w, u16)
|
|
|
|
__BUILD_IOPORT_STRING(l, u32)
|
|
|
|
__BUILD_IOPORT_STRING(q, u64)
|
|
|
|
|
2014-04-07 22:39:19 +00:00
|
|
|
#else /* !CONFIG_HAS_IOPORT_MAP */
|
2012-05-10 04:07:55 +00:00
|
|
|
|
|
|
|
#include <asm/io_noioport.h>
|
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
#endif
|
2010-05-25 11:06:13 +00:00
|
|
|
|
2012-05-10 04:07:55 +00:00
|
|
|
|
2010-11-01 13:49:04 +00:00
|
|
|
#define IO_SPACE_LIMIT 0xffffffff
|
|
|
|
|
|
|
|
/* synco on SH-4A, otherwise a nop */
|
|
|
|
#define mmiowb() wmb()
|
2010-05-25 11:06:13 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/* We really want to try and get these to memcpy etc */
|
2008-10-03 20:25:52 +00:00
|
|
|
void memcpy_fromio(void *, const volatile void __iomem *, unsigned long);
|
|
|
|
void memcpy_toio(volatile void __iomem *, const void *, unsigned long);
|
|
|
|
void memset_io(volatile void __iomem *, int, unsigned long);
|
2006-09-27 07:43:28 +00:00
|
|
|
|
2007-11-20 09:26:28 +00:00
|
|
|
/* Quad-word real-mode I/O, don't ask.. */
|
|
|
|
unsigned long long peek_real_address_q(unsigned long long addr);
|
|
|
|
unsigned long long poke_real_address_q(unsigned long long addr,
|
|
|
|
unsigned long long val);
|
|
|
|
|
2007-11-09 03:58:12 +00:00
|
|
|
#if !defined(CONFIG_MMU)
|
|
|
|
#define virt_to_phys(address) ((unsigned long)(address))
|
|
|
|
#define phys_to_virt(address) ((void *)(address))
|
2007-11-30 08:52:53 +00:00
|
|
|
#else
|
2007-11-09 03:58:12 +00:00
|
|
|
#define virt_to_phys(address) (__pa(address))
|
|
|
|
#define phys_to_virt(address) (__va(address))
|
2006-09-27 08:25:07 +00:00
|
|
|
#endif
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
2007-11-09 03:58:12 +00:00
|
|
|
* On 32-bit SH, we traditionally have the whole physical address space
|
|
|
|
* mapped at all times (as MIPS does), so "ioremap()" and "iounmap()" do
|
|
|
|
* not need to do anything but place the address in the proper segment.
|
|
|
|
* This is true for P1 and P2 addresses, as well as some P3 ones.
|
|
|
|
* However, most of the P3 addresses and newer cores using extended
|
|
|
|
* addressing need to map through page tables, so the ioremap()
|
|
|
|
* implementation becomes a bit more complicated.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
2007-11-09 03:58:12 +00:00
|
|
|
* See arch/sh/mm/ioremap.c for additional notes on this.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* We cheat a bit and always return uncachable areas until we've fixed
|
2006-01-17 06:14:15 +00:00
|
|
|
* the drivers to handle caching properly.
|
2007-11-09 03:58:12 +00:00
|
|
|
*
|
|
|
|
* On the SH-5 the concept of segmentation in the 1:1 PXSEG sense simply
|
|
|
|
* doesn't exist, so everything must go through page tables.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2006-01-17 06:14:15 +00:00
|
|
|
#ifdef CONFIG_MMU
|
2010-02-23 07:20:53 +00:00
|
|
|
void __iomem *__ioremap_caller(phys_addr_t offset, unsigned long size,
|
2010-01-19 04:34:38 +00:00
|
|
|
pgprot_t prot, void *caller);
|
2006-01-17 06:14:15 +00:00
|
|
|
void __iounmap(void __iomem *addr);
|
2008-04-25 03:58:40 +00:00
|
|
|
|
2009-12-14 05:23:41 +00:00
|
|
|
static inline void __iomem *
|
2010-02-23 07:20:53 +00:00
|
|
|
__ioremap(phys_addr_t offset, unsigned long size, pgprot_t prot)
|
2009-12-14 05:23:41 +00:00
|
|
|
{
|
2010-01-19 04:34:38 +00:00
|
|
|
return __ioremap_caller(offset, size, prot, __builtin_return_address(0));
|
2009-12-14 05:23:41 +00:00
|
|
|
}
|
|
|
|
|
2006-01-17 06:14:15 +00:00
|
|
|
static inline void __iomem *
|
2010-02-23 07:20:53 +00:00
|
|
|
__ioremap_29bit(phys_addr_t offset, unsigned long size, pgprot_t prot)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2010-01-13 09:31:48 +00:00
|
|
|
#ifdef CONFIG_29BIT
|
2010-02-23 07:20:53 +00:00
|
|
|
phys_addr_t last_addr = offset + size - 1;
|
2006-01-17 06:14:15 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* For P1 and P2 space this is trivial, as everything is already
|
|
|
|
* mapped. Uncached access for P1 addresses are done through P2.
|
|
|
|
* In the P3 case or for addresses outside of the 29-bit space,
|
|
|
|
* mapping must be done by the PMB or by using page tables.
|
|
|
|
*/
|
|
|
|
if (likely(PXSEG(offset) < P3SEG && PXSEG(last_addr) < P3SEG)) {
|
2011-01-11 06:02:59 +00:00
|
|
|
u64 flags = pgprot_val(prot);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Anything using the legacy PTEA space attributes needs
|
|
|
|
* to be kicked down to page table mappings.
|
|
|
|
*/
|
|
|
|
if (unlikely(flags & _PAGE_PCC_MASK))
|
|
|
|
return NULL;
|
|
|
|
if (unlikely(flags & _PAGE_CACHABLE))
|
2006-01-17 06:14:15 +00:00
|
|
|
return (void __iomem *)P1SEGADDR(offset);
|
|
|
|
|
|
|
|
return (void __iomem *)P2SEGADDR(offset);
|
|
|
|
}
|
2008-11-25 12:57:29 +00:00
|
|
|
|
|
|
|
/* P4 above the store queues are always mapped. */
|
|
|
|
if (unlikely(offset >= P3_ADDR_MAX))
|
|
|
|
return (void __iomem *)P4SEGADDR(offset);
|
2007-11-09 03:58:12 +00:00
|
|
|
#endif
|
2006-01-17 06:14:15 +00:00
|
|
|
|
2010-01-13 09:31:48 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void __iomem *
|
2010-02-23 07:20:53 +00:00
|
|
|
__ioremap_mode(phys_addr_t offset, unsigned long size, pgprot_t prot)
|
2010-01-13 09:31:48 +00:00
|
|
|
{
|
|
|
|
void __iomem *ret;
|
|
|
|
|
|
|
|
ret = __ioremap_trapped(offset, size);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
2010-01-19 04:34:38 +00:00
|
|
|
ret = __ioremap_29bit(offset, size, prot);
|
2010-01-13 09:31:48 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
2010-01-19 04:34:38 +00:00
|
|
|
return __ioremap(offset, size, prot);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2009-04-30 03:56:37 +00:00
|
|
|
#else
|
2010-01-19 04:34:38 +00:00
|
|
|
#define __ioremap(offset, size, prot) ((void __iomem *)(offset))
|
|
|
|
#define __ioremap_mode(offset, size, prot) ((void __iomem *)(offset))
|
2009-04-30 03:56:37 +00:00
|
|
|
#define __iounmap(addr) do { } while (0)
|
|
|
|
#endif /* CONFIG_MMU */
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-02-23 07:20:53 +00:00
|
|
|
static inline void __iomem *ioremap(phys_addr_t offset, unsigned long size)
|
2010-01-19 04:34:38 +00:00
|
|
|
{
|
|
|
|
return __ioremap_mode(offset, size, PAGE_KERNEL_NOCACHE);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void __iomem *
|
2010-02-23 07:20:53 +00:00
|
|
|
ioremap_cache(phys_addr_t offset, unsigned long size)
|
2010-01-19 04:34:38 +00:00
|
|
|
{
|
|
|
|
return __ioremap_mode(offset, size, PAGE_KERNEL);
|
|
|
|
}
|
2015-08-11 03:07:06 +00:00
|
|
|
#define ioremap_cache ioremap_cache
|
2010-01-19 04:34:38 +00:00
|
|
|
|
2010-01-19 05:00:14 +00:00
|
|
|
#ifdef CONFIG_HAVE_IOREMAP_PROT
|
2010-01-19 04:34:38 +00:00
|
|
|
static inline void __iomem *
|
2010-02-23 07:20:53 +00:00
|
|
|
ioremap_prot(phys_addr_t offset, unsigned long size, unsigned long flags)
|
2010-01-19 04:34:38 +00:00
|
|
|
{
|
|
|
|
return __ioremap_mode(offset, size, __pgprot(flags));
|
|
|
|
}
|
2010-01-19 05:00:14 +00:00
|
|
|
#endif
|
2010-01-19 04:34:38 +00:00
|
|
|
|
2010-01-28 09:17:29 +00:00
|
|
|
#ifdef CONFIG_IOREMAP_FIXED
|
2010-02-23 07:20:53 +00:00
|
|
|
extern void __iomem *ioremap_fixed(phys_addr_t, unsigned long, pgprot_t);
|
2010-01-28 09:17:29 +00:00
|
|
|
extern int iounmap_fixed(void __iomem *);
|
|
|
|
extern void ioremap_fixed_init(void);
|
|
|
|
#else
|
|
|
|
static inline void __iomem *
|
2010-02-23 07:20:53 +00:00
|
|
|
ioremap_fixed(phys_addr_t phys_addr, unsigned long size, pgprot_t prot)
|
2010-01-28 09:17:29 +00:00
|
|
|
{
|
|
|
|
BUG();
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void ioremap_fixed_init(void) { }
|
|
|
|
static inline int iounmap_fixed(void __iomem *addr) { return -EINVAL; }
|
|
|
|
#endif
|
|
|
|
|
2010-01-19 04:34:38 +00:00
|
|
|
#define ioremap_nocache ioremap
|
2015-07-28 18:17:13 +00:00
|
|
|
#define ioremap_uc ioremap
|
2010-01-19 04:34:38 +00:00
|
|
|
#define iounmap __iounmap
|
2006-01-17 06:14:15 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Convert a physical pointer to a virtual kernel pointer for /dev/mem
|
|
|
|
* access
|
|
|
|
*/
|
|
|
|
#define xlate_dev_mem_ptr(p) __va(p)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert a virtual cached pointer to an uncached pointer
|
|
|
|
*/
|
|
|
|
#define xlate_dev_kmem_ptr(p) p
|
|
|
|
|
2008-11-12 03:53:48 +00:00
|
|
|
#define ARCH_HAS_VALID_PHYS_ADDR_RANGE
|
2012-09-12 18:05:58 +00:00
|
|
|
int valid_phys_addr_range(phys_addr_t addr, size_t size);
|
2008-11-12 03:53:48 +00:00
|
|
|
int valid_mmap_phys_addr_range(unsigned long pfn, size_t size);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
|
|
|
|
#endif /* __ASM_SH_IO_H */
|