blackfin architecture

This adds support for the Analog Devices Blackfin processor architecture, and
currently supports the BF533, BF532, BF531, BF537, BF536, BF534, and BF561
(Dual Core) devices, with a variety of development platforms including those
avaliable from Analog Devices (BF533-EZKit, BF533-STAMP, BF537-STAMP,
BF561-EZKIT), and Bluetechnix!  Tinyboards.

The Blackfin architecture was jointly developed by Intel and Analog Devices
Inc.  (ADI) as the Micro Signal Architecture (MSA) core and introduced it in
December of 2000.  Since then ADI has put this core into its Blackfin
processor family of devices.  The Blackfin core has the advantages of a clean,
orthogonal,RISC-like microprocessor instruction set.  It combines a dual-MAC
(Multiply/Accumulate), state-of-the-art signal processing engine and
single-instruction, multiple-data (SIMD) multimedia capabilities into a single
instruction-set architecture.

The Blackfin architecture, including the instruction set, is described by the
ADSP-BF53x/BF56x Blackfin Processor Programming Reference
http://blackfin.uclinux.org/gf/download/frsrelease/29/2549/Blackfin_PRM.pdf

The Blackfin processor is already supported by major releases of gcc, and
there are binary and source rpms/tarballs for many architectures at:
http://blackfin.uclinux.org/gf/project/toolchain/frs There is complete
documentation, including "getting started" guides available at:
http://docs.blackfin.uclinux.org/ which provides links to the sources and
patches you will need in order to set up a cross-compiling environment for
bfin-linux-uclibc

This patch, as well as the other patches (toolchain, distribution,
uClibc) are actively supported by Analog Devices Inc, at:
http://blackfin.uclinux.org/

We have tested this on LTP, and our test plan (including pass/fails) can
be found at:
http://docs.blackfin.uclinux.org/doku.php?id=testing_the_linux_kernel

[m.kozlowski@tuxland.pl: balance parenthesis in blackfin header files]
Signed-off-by: Bryan Wu <bryan.wu@analog.com>
Signed-off-by: Mariusz Kozlowski <m.kozlowski@tuxland.pl>
Signed-off-by: Aubrey Li <aubrey.li@analog.com>
Signed-off-by: Jie Zhang <jie.zhang@analog.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>

1 files changed, 142 insertions, 0 deletions

diff --git a/arch/blackfin/lib/memcpy.S b/arch/blackfin/lib/memcpy.S
new file mode 100644
index 000000000000..c1e00eff541c
--- /dev/null
+++ b/arch/blackfin/lib/memcpy.S
@@ -0,0 +1,142 @@
+/*
+ * File:         arch/blackfin/lib/memcpy.S
+ * Based on:
+ * Author:
+ *
+ * Created:
+ * Description:  internal version of memcpy(), issued by the compiler
+ *               to copy blocks of data around.
+ *               This is really memmove() - it has to be able to deal with
+ *               possible overlaps, because that ambiguity is when the compiler
+ *               gives up and calls a function. We have our own, internal version
+ *               so that we get something we trust, even if the user has redefined
+ *               the normal symbol.
+ *
+ * Modified:
+ *               Copyright 2004-2006 Analog Devices Inc.
+ *
+ * Bugs:         Enter bugs at http://blackfin.uclinux.org/
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see the file COPYING, or write
+ * to the Free Software Foundation, Inc.,
+ * 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+ */
+
+#include <linux/linkage.h>
+
+/* void *memcpy(void *dest, const void *src, size_t n);
+ * R0 = To Address (dest) (leave unchanged to form result)
+ * R1 = From Address (src)
+ * R2 = count
+ *
+ * Note: Favours word alignment
+ */
+
+#ifdef CONFIG_MEMCPY_L1
+.section .l1.text
+#else
+.text
+#endif
+
+.align 2
+
+ENTRY(_memcpy)
+        CC = R2 <=  0;  /* length not positive? */
+        IF CC JUMP .L_P1L2147483647;    /* Nothing to do */
+
+        P0 = R0 ;       /* dst*/
+        P1 = R1 ;       /* src*/
+        P2 = R2 ;       /* length */
+
+        /* check for overlapping data */
+        CC = R1 < R0;   /* src < dst */
+        IF !CC JUMP .Lno_overlap;
+        R3 = R1 + R2;
+        CC = R0 < R3;   /* and dst < src+len */
+        IF CC JUMP .Lhas_overlap;
+
+.Lno_overlap:
+        /* Check for aligned data.*/
+
+        R3 = R1 | R0;
+        R0 = 0x3;
+        R3 = R3 & R0;
+        CC = R3;        /* low bits set on either address? */
+        IF CC JUMP .Lnot_aligned;
+
+        /* Both addresses are word-aligned, so we can copy
+        at least part of the data using word copies.*/
+        P2 = P2 >> 2;
+        CC = P2 <= 2;
+        IF !CC JUMP .Lmore_than_seven;
+        /* less than eight bytes... */
+        P2 = R2;
+        LSETUP(.Lthree_start, .Lthree_end) LC0=P2;
+        R0 = R1;        /* setup src address for return */
+.Lthree_start:
+        R3 = B[P1++] (X);
+.Lthree_end:
+        B[P0++] = R3;
+
+        RTS;
+
+.Lmore_than_seven:
+        /* There's at least eight bytes to copy. */
+        P2 += -1;       /* because we unroll one iteration */
+        LSETUP(.Lword_loop, .Lword_loop) LC0=P2;
+        R0 = R1;
+        I1 = P1;
+        R3 = [I1++];
+.Lword_loop:
+        MNOP || [P0++] = R3 || R3 = [I1++];
+
+        [P0++] = R3;
+        /* Any remaining bytes to copy? */
+        R3 = 0x3;
+        R3 = R2 & R3;
+        CC = R3 == 0;
+        P1 = I1;        /* in case there's something left, */
+        IF !CC JUMP .Lbytes_left;
+        RTS;
+.Lbytes_left:   P2 = R3;
+.Lnot_aligned:
+        /* From here, we're copying byte-by-byte. */
+        LSETUP (.Lbyte_start, .Lbyte_end) LC0=P2;
+        R0 = R1;        /* Save src address for return */
+.Lbyte_start:
+        R1 = B[P1++] (X);
+.Lbyte_end:
+        B[P0++] = R1;
+
+.L_P1L2147483647:
+        RTS;
+
+.Lhas_overlap:
+        /* Need to reverse the copying, because the
+         * dst would clobber the src.
+         * Don't bother to work out alignment for
+         * the reverse case.
+         */
+        R0 = R1;        /* save src for later. */
+        P0 = P0 + P2;
+        P0 += -1;
+        P1 = P1 + P2;
+        P1 += -1;
+        LSETUP(.Lover_start, .Lover_end) LC0=P2;
+.Lover_start:
+        R1 = B[P1--] (X);
+.Lover_end:
+        B[P0--] = R1;
+
+        RTS;