1 /* Copyright (C) 2002, 2003 Free Software Foundation, Inc.
2 This file is part of the GNU C Library.
3 Contributed by Hartvig Ekner <hartvige@mips.com>, 2002.
4 Ported to mips3 n32/n64 by Alexandre Oliva <aoliva@redhat.com>
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Lesser General Public
8 License as published by the Free Software Foundation; either
9 version 2.1 of the License, or (at your option) any later version.
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public
17 License along with the GNU C Library; if not, write to the Free
18 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
26 /* void *memcpy(void *s1, const void *s2, size_t n);
28 This could probably be optimized further. */
30 #if __BYTE_ORDER == __BIG_ENDIAN
31 # define LDHI ldl /* high part is left in big-endian */
32 # define SDHI sdl /* high part is left in big-endian */
33 # define LDLO ldr /* low part is right in big-endian */
34 # define SDLO sdr /* low part is right in big-endian */
36 # define LDHI ldr /* high part is right in little-endian */
37 # define SDHI sdr /* high part is right in little-endian */
38 # define LDLO ldl /* low part is left in little-endian */
39 # define SDLO sdl /* low part is left in little-endian */
45 slti t0, a2, 16 # Less than 16?
46 bne t0, zero, L(last16)
47 move v0, a0 # Setup exit value before too late
49 xor t0, a1, a0 # Find a0/a1 displacement
51 bne t0, zero, L(shift) # Go handle the unaligned case
53 andi t1, 0x7 # a0/a1 are aligned, but are we
54 beq t1, zero, L(chk8w) # starting in the middle of a word?
56 LDHI t0, 0(a1) # Yes we are... take care of that
62 andi t0, a2, 0x3f # 64 or more bytes left?
64 PTR_SUBU a3, a2, t0 # Yes
65 PTR_ADDU a3, a1 # a3 = end address of loop
66 move a2, t0 # a2 = what will be left after loop
68 ld t0, 0(a1) # Loop taking 8 words at a time
89 andi t0, a2, 0x7 # 8 or more bytes left?
91 PTR_SUBU a3, a2, t0 # Yes, handle them one dword at a time
92 PTR_ADDU a3, a1 # a3 again end address
102 blez a2, L(lst16e) # Handle last 16 bytes, one at a time
108 bne a1, a3, L(lst16l)
115 PTR_SUBU a3, zero, a0 # Src and Dest unaligned
116 andi a3, 0x7 # (unoptimized case...)
117 beq a3, zero, L(shft1)
118 PTR_SUBU a2, a3 # a2 = bytes left
119 LDHI t0, 0(a1) # Take care of first odd part
129 LDHI t1, 0(a1) # Limp through, dword by dword
135 b L(last16) # Handle anything which may be left
140 libc_hidden_builtin_def (memcpy)