p71924506
/
linux_old1
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
linux_old1/drivers/video/fbdev/atafb_utils.h

402 lines
11 KiB
C
Raw Normal View History

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 22:07:57 +08:00
/* SPDX-License-Identifier: GPL-2.0 */
m68k: Atari fb revival Update the atari fb to 2.6 by Michael Schmitz, Reformatting and rewrite of bit plane functions by Roman Zippel, A few more fixes by Geert Uytterhoeven. Signed-off-by: Michael Schmitz <schmitz@debian.org> Signed-off-by: Roman Zippel <zippel@linux-m68k.org> Signed-off-by: Geert Uytterhoeven <geert@linux-m68k.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-05-02 04:32:39 +08:00
#ifndef _VIDEO_ATAFB_UTILS_H
#define _VIDEO_ATAFB_UTILS_H
/* ================================================================= */
/* Utility Assembler Functions */
/* ================================================================= */
/* ====================================================================== */
/* Those of a delicate disposition might like to skip the next couple of
* pages.
*
* These functions are drop in replacements for memmove and
* memset(_, 0, _). However their five instances add at least a kilobyte
* to the object file. You have been warned.
*
* Not a great fan of assembler for the sake of it, but I think
* that these routines are at least 10 times faster than their C
* equivalents for large blits, and that's important to the lowest level of
* a graphics driver. Question is whether some scheme with the blitter
* would be faster. I suspect not for simple text system - not much
* asynchrony.
*
* Code is very simple, just gruesome expansion. Basic strategy is to
* increase data moved/cleared at each step to 16 bytes to reduce
* instruction per data move overhead. movem might be faster still
* For more than 15 bytes, we try to align the write direction on a
* longword boundary to get maximum speed. This is even more gruesome.
* Unaligned read/write used requires 68020+ - think this is a problem?
*
* Sorry!
*/
/* ++roman: I've optimized Robert's original versions in some minor
* aspects, e.g. moveq instead of movel, let gcc choose the registers,
* use movem in some places...
* For other modes than 1 plane, lots of more such assembler functions
* were needed (e.g. the ones using movep or expanding color values).
*/
/* ++andreas: more optimizations:
subl #65536,d0 replaced by clrw d0; subql #1,d0 for dbcc
addal is faster than addaw
movep is rather expensive compared to ordinary move's
some functions rewritten in C for clarity, no speed loss */
static inline void *fb_memclear_small(void *s, size_t count)
{
if (!count)
return 0;
asm volatile ("\n"
" lsr.l #1,%1 ; jcc 1f ; move.b %2,-(%0)\n"
"1: lsr.l #1,%1 ; jcc 1f ; move.w %2,-(%0)\n"
"1: lsr.l #1,%1 ; jcc 1f ; move.l %2,-(%0)\n"
"1: lsr.l #1,%1 ; jcc 1f ; move.l %2,-(%0) ; move.l %2,-(%0)\n"
"1:"
: "=a" (s), "=d" (count)
: "d" (0), "0" ((char *)s + count), "1" (count));
asm volatile ("\n"
" subq.l #1,%1\n"
" jcs 3f\n"
" move.l %2,%%d4; move.l %2,%%d5; move.l %2,%%d6\n"
"2: movem.l %2/%%d4/%%d5/%%d6,-(%0)\n"
" dbra %1,2b\n"
"3:"
: "=a" (s), "=d" (count)
: "d" (0), "0" (s), "1" (count)
: "d4", "d5", "d6"
);
return 0;
}
static inline void *fb_memclear(void *s, size_t count)
{
if (!count)
return 0;
if (count < 16) {
asm volatile ("\n"
" lsr.l #1,%1 ; jcc 1f ; clr.b (%0)+\n"
"1: lsr.l #1,%1 ; jcc 1f ; clr.w (%0)+\n"
"1: lsr.l #1,%1 ; jcc 1f ; clr.l (%0)+\n"
"1: lsr.l #1,%1 ; jcc 1f ; clr.l (%0)+ ; clr.l (%0)+\n"
"1:"
: "=a" (s), "=d" (count)
: "0" (s), "1" (count));
} else {
long tmp;
asm volatile ("\n"
" move.l %1,%2\n"
" lsr.l #1,%2 ; jcc 1f ; clr.b (%0)+ ; subq.w #1,%1\n"
" lsr.l #1,%2 ; jcs 2f\n" /* %0 increased=>bit 2 switched*/
" clr.w (%0)+ ; subq.w #2,%1 ; jra 2f\n"
"1: lsr.l #1,%2 ; jcc 2f\n"
" clr.w (%0)+ ; subq.w #2,%1\n"
"2: move.w %1,%2; lsr.l #2,%1 ; jeq 6f\n"
" lsr.l #1,%1 ; jcc 3f ; clr.l (%0)+\n"
"3: lsr.l #1,%1 ; jcc 4f ; clr.l (%0)+ ; clr.l (%0)+\n"
"4: subq.l #1,%1 ; jcs 6f\n"
"5: clr.l (%0)+; clr.l (%0)+ ; clr.l (%0)+ ; clr.l (%0)+\n"
" dbra %1,5b ; clr.w %1; subq.l #1,%1; jcc 5b\n"
"6: move.w %2,%1; btst #1,%1 ; jeq 7f ; clr.w (%0)+\n"
"7: btst #0,%1 ; jeq 8f ; clr.b (%0)+\n"
"8:"
: "=a" (s), "=d" (count), "=d" (tmp)
: "0" (s), "1" (count));
}
return 0;
}
static inline void *fb_memset255(void *s, size_t count)
{
if (!count)
return 0;
asm volatile ("\n"
" lsr.l #1,%1 ; jcc 1f ; move.b %2,-(%0)\n"
"1: lsr.l #1,%1 ; jcc 1f ; move.w %2,-(%0)\n"
"1: lsr.l #1,%1 ; jcc 1f ; move.l %2,-(%0)\n"
"1: lsr.l #1,%1 ; jcc 1f ; move.l %2,-(%0) ; move.l %2,-(%0)\n"
"1:"
: "=a" (s), "=d" (count)
: "d" (-1), "0" ((char *)s+count), "1" (count));
asm volatile ("\n"
" subq.l #1,%1 ; jcs 3f\n"
" move.l %2,%%d4; move.l %2,%%d5; move.l %2,%%d6\n"
"2: movem.l %2/%%d4/%%d5/%%d6,-(%0)\n"
" dbra %1,2b\n"
"3:"
: "=a" (s), "=d" (count)
: "d" (-1), "0" (s), "1" (count)
: "d4", "d5", "d6");
return 0;
}
static inline void *fb_memmove(void *d, const void *s, size_t count)
{
if (d < s) {
if (count < 16) {
asm volatile ("\n"
" lsr.l #1,%2 ; jcc 1f ; move.b (%1)+,(%0)+\n"
"1: lsr.l #1,%2 ; jcc 1f ; move.w (%1)+,(%0)+\n"
"1: lsr.l #1,%2 ; jcc 1f ; move.l (%1)+,(%0)+\n"
"1: lsr.l #1,%2 ; jcc 1f ; move.l (%1)+,(%0)+ ; move.l (%1)+,(%0)+\n"
"1:"
: "=a" (d), "=a" (s), "=d" (count)
: "0" (d), "1" (s), "2" (count));
} else {
long tmp;
asm volatile ("\n"
" move.l %0,%3\n"
" lsr.l #1,%3 ; jcc 1f ; move.b (%1)+,(%0)+ ; subqw #1,%2\n"
" lsr.l #1,%3 ; jcs 2f\n" /* %0 increased=>bit 2 switched*/
" move.w (%1)+,(%0)+ ; subqw #2,%2 ; jra 2f\n"
"1: lsr.l #1,%3 ; jcc 2f\n"
" move.w (%1)+,(%0)+ ; subqw #2,%2\n"
"2: move.w %2,%-; lsr.l #2,%2 ; jeq 6f\n"
" lsr.l #1,%2 ; jcc 3f ; move.l (%1)+,(%0)+\n"
"3: lsr.l #1,%2 ; jcc 4f ; move.l (%1)+,(%0)+ ; move.l (%1)+,(%0)+\n"
"4: subq.l #1,%2 ; jcs 6f\n"
"5: move.l (%1)+,(%0)+; move.l (%1)+,(%0)+\n"
" move.l (%1)+,(%0)+; move.l (%1)+,(%0)+\n"
" dbra %2,5b ; clr.w %2; subq.l #1,%2; jcc 5b\n"
"6: move.w %+,%2; btst #1,%2 ; jeq 7f ; move.w (%1)+,(%0)+\n"
"7: btst #0,%2 ; jeq 8f ; move.b (%1)+,(%0)+\n"
"8:"
: "=a" (d), "=a" (s), "=d" (count), "=d" (tmp)
: "0" (d), "1" (s), "2" (count));
}
} else {
if (count < 16) {
asm volatile ("\n"
" lsr.l #1,%2 ; jcc 1f ; move.b -(%1),-(%0)\n"
"1: lsr.l #1,%2 ; jcc 1f ; move.w -(%1),-(%0)\n"
"1: lsr.l #1,%2 ; jcc 1f ; move.l -(%1),-(%0)\n"
"1: lsr.l #1,%2 ; jcc 1f ; move.l -(%1),-(%0) ; move.l -(%1),-(%0)\n"
"1:"
: "=a" (d), "=a" (s), "=d" (count)
: "0" ((char *) d + count), "1" ((char *) s + count), "2" (count));
} else {
long tmp;
asm volatile ("\n"
" move.l %0,%3\n"
" lsr.l #1,%3 ; jcc 1f ; move.b -(%1),-(%0) ; subqw #1,%2\n"
" lsr.l #1,%3 ; jcs 2f\n" /* %0 increased=>bit 2 switched*/
" move.w -(%1),-(%0) ; subqw #2,%2 ; jra 2f\n"
"1: lsr.l #1,%3 ; jcc 2f\n"
" move.w -(%1),-(%0) ; subqw #2,%2\n"
"2: move.w %2,%-; lsr.l #2,%2 ; jeq 6f\n"
" lsr.l #1,%2 ; jcc 3f ; move.l -(%1),-(%0)\n"
"3: lsr.l #1,%2 ; jcc 4f ; move.l -(%1),-(%0) ; move.l -(%1),-(%0)\n"
"4: subq.l #1,%2 ; jcs 6f\n"
"5: move.l -(%1),-(%0); move.l -(%1),-(%0)\n"
" move.l -(%1),-(%0); move.l -(%1),-(%0)\n"
" dbra %2,5b ; clr.w %2; subq.l #1,%2; jcc 5b\n"
"6: move.w %+,%2; btst #1,%2 ; jeq 7f ; move.w -(%1),-(%0)\n"
"7: btst #0,%2 ; jeq 8f ; move.b -(%1),-(%0)\n"
"8:"
: "=a" (d), "=a" (s), "=d" (count), "=d" (tmp)
: "0" ((char *) d + count), "1" ((char *) s + count), "2" (count));
}
}
return 0;
}
/* ++andreas: Simple and fast version of memmove, assumes size is
divisible by 16, suitable for moving the whole screen bitplane */
static inline void fast_memmove(char *dst, const char *src, size_t size)
{
if (!size)
return;
if (dst < src)
asm volatile ("\n"
"1: movem.l (%0)+,%%d0/%%d1/%%a0/%%a1\n"
" movem.l %%d0/%%d1/%%a0/%%a1,%1@\n"
" addq.l #8,%1; addq.l #8,%1\n"
" dbra %2,1b\n"
" clr.w %2; subq.l #1,%2\n"
" jcc 1b"
: "=a" (src), "=a" (dst), "=d" (size)
: "0" (src), "1" (dst), "2" (size / 16 - 1)
: "d0", "d1", "a0", "a1", "memory");
else
asm volatile ("\n"
"1: subq.l #8,%0; subq.l #8,%0\n"
" movem.l %0@,%%d0/%%d1/%%a0/%%a1\n"
" movem.l %%d0/%%d1/%%a0/%%a1,-(%1)\n"
" dbra %2,1b\n"
" clr.w %2; subq.l #1,%2\n"
" jcc 1b"
: "=a" (src), "=a" (dst), "=d" (size)
: "0" (src + size), "1" (dst + size), "2" (size / 16 - 1)
: "d0", "d1", "a0", "a1", "memory");
}
#ifdef BPL
/*
* This expands a up to 8 bit color into two longs
* for movel operations.
*/
static const u32 four2long[] = {
0x00000000, 0x000000ff, 0x0000ff00, 0x0000ffff,
0x00ff0000, 0x00ff00ff, 0x00ffff00, 0x00ffffff,
0xff000000, 0xff0000ff, 0xff00ff00, 0xff00ffff,
0xffff0000, 0xffff00ff, 0xffffff00, 0xffffffff,
};
static inline void expand8_col2mask(u8 c, u32 m[])
{
m[0] = four2long[c & 15];
#if BPL > 4
m[1] = four2long[c >> 4];
#endif
}
static inline void expand8_2col2mask(u8 fg, u8 bg, u32 fgm[], u32 bgm[])
{
fgm[0] = four2long[fg & 15] ^ (bgm[0] = four2long[bg & 15]);
#if BPL > 4
fgm[1] = four2long[fg >> 4] ^ (bgm[1] = four2long[bg >> 4]);
#endif
}
/*
* set an 8bit value to a color
*/
static inline void fill8_col(u8 *dst, u32 m[])
{
u32 tmp = m[0];
dst[0] = tmp;
dst[2] = (tmp >>= 8);
#if BPL > 2
dst[4] = (tmp >>= 8);
dst[6] = tmp >> 8;
#endif
#if BPL > 4
tmp = m[1];
dst[8] = tmp;
dst[10] = (tmp >>= 8);
dst[12] = (tmp >>= 8);
dst[14] = tmp >> 8;
#endif
}
/*
* set an 8bit value according to foreground/background color
*/
static inline void fill8_2col(u8 *dst, u8 fg, u8 bg, u32 mask)
{
u32 fgm[2], bgm[2], tmp;
expand8_2col2mask(fg, bg, fgm, bgm);
mask |= mask << 8;
#if BPL > 2
mask |= mask << 16;
#endif
tmp = (mask & fgm[0]) ^ bgm[0];
dst[0] = tmp;
dst[2] = (tmp >>= 8);
#if BPL > 2
dst[4] = (tmp >>= 8);
dst[6] = tmp >> 8;
#endif
#if BPL > 4
tmp = (mask & fgm[1]) ^ bgm[1];
dst[8] = tmp;
dst[10] = (tmp >>= 8);
dst[12] = (tmp >>= 8);
dst[14] = tmp >> 8;
#endif
}
static const u32 two2word[] = {
0x00000000, 0xffff0000, 0x0000ffff, 0xffffffff
};
static inline void expand16_col2mask(u8 c, u32 m[])
{
m[0] = two2word[c & 3];
#if BPL > 2
m[1] = two2word[(c >> 2) & 3];
#endif
#if BPL > 4
m[2] = two2word[(c >> 4) & 3];
m[3] = two2word[c >> 6];
#endif
}
static inline void expand16_2col2mask(u8 fg, u8 bg, u32 fgm[], u32 bgm[])
{
bgm[0] = two2word[bg & 3];
fgm[0] = two2word[fg & 3] ^ bgm[0];
#if BPL > 2
bgm[1] = two2word[(bg >> 2) & 3];
fgm[1] = two2word[(fg >> 2) & 3] ^ bgm[1];
#endif
#if BPL > 4
bgm[2] = two2word[(bg >> 4) & 3];
fgm[2] = two2word[(fg >> 4) & 3] ^ bgm[2];
bgm[3] = two2word[bg >> 6];
fgm[3] = two2word[fg >> 6] ^ bgm[3];
#endif
}
static inline u32 *fill16_col(u32 *dst, int rows, u32 m[])
{
while (rows) {
*dst++ = m[0];
#if BPL > 2
*dst++ = m[1];
#endif
#if BPL > 4
*dst++ = m[2];
*dst++ = m[3];
#endif
rows--;
}
return dst;
}
static inline void memmove32_col(void *dst, void *src, u32 mask, u32 h, u32 bytes)
{
u32 *s, *d, v;
s = src;
d = dst;
do {
v = (*s++ & mask) | (*d & ~mask);
*d++ = v;
#if BPL > 2
v = (*s++ & mask) | (*d & ~mask);
*d++ = v;
#endif
#if BPL > 4
v = (*s++ & mask) | (*d & ~mask);
*d++ = v;
v = (*s++ & mask) | (*d & ~mask);
*d++ = v;
#endif
d = (u32 *)((u8 *)d + bytes);
s = (u32 *)((u8 *)s + bytes);
} while (--h);
}
#endif
#endif /* _VIDEO_ATAFB_UTILS_H */