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.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, see
17 <http://www.gnu.org/licenses/>. */
23 /* void *memset(void *s, int c, size_t n). */
29 #if __BYTE_ORDER == __BIG_ENDIAN
30 # define SDHI sdl /* high part is left in big-endian */
32 # define SDHI sdr /* high part is right in little-endian */
38 slti ta1, a2, 16 # Less than 16?
39 bne ta1, zero, L(last16)
40 move v0, a0 # Setup exit value before too late
42 beq a1, zero, L(ueven) # If zero pattern, no need to extend
43 andi a1, 0xff # Avoid problems with bogus arguments
47 or a1, ta0 # a1 is now pattern in full word
49 or a1, ta0 # a1 is now pattern in double word
52 PTR_SUBU ta0, zero, a0 # Unaligned address?
54 beq ta0, zero, L(chkw)
56 SDHI a1, 0(a0) # Yes, handle first unaligned part
57 PTR_ADDU a0, ta0 # Now both a0 and a2 are updated
60 andi ta0, a2, 0xf # Enough left for one loop iteration?
63 PTR_ADDU a3, a0 # a3 is last loop address +1
64 move a2, ta0 # a2 is now # of bytes left after loop
66 PTR_ADDIU a0, 16 # Handle 2 dwords pr. iteration
72 andi ta0, a2, 0x8 # Check if there is at least a double
73 beq ta0, zero, L(last16) # word remaining after the loop
79 blez a2, L(exit) # Handle last 16 bytes (if cnt>0)
80 PTR_ADDU a3, a2, a0 # a3 is last address +1
94 #if __BYTE_ORDER == __BIG_ENDIAN
95 # define SWHI swl /* high part is left in big-endian */
97 # define SWHI swr /* high part is right in little-endian */
103 slti t1, a2, 8 # Less than 8?
104 bne t1, zero, L(last8)
105 move v0, a0 # Setup exit value before too late
107 beq a1, zero, L(ueven) # If zero pattern, no need to extend
108 andi a1, 0xff # Avoid problems with bogus arguments
112 or a1, t0 # a1 is now pattern in full word
115 subu t0, zero, a0 # Unaligned address?
117 beq t0, zero, L(chkw)
119 SWHI a1, 0(a0) # Yes, handle first unaligned part
120 addu a0, t0 # Now both a0 and a2 are updated
123 andi t0, a2, 0x7 # Enough left for one loop iteration?
126 addu a3, a0 # a3 is last loop address +1
127 move a2, t0 # a2 is now # of bytes left after loop
129 addiu a0, 8 # Handle 2 words pr. iteration
135 andi t0, a2, 0x4 # Check if there is at least a full
136 beq t0, zero, L(last8) # word remaining after the loop
138 sw a1, 0(a0) # Yes...
142 blez a2, L(exit) # Handle last 8 bytes (if cnt>0)
143 addu a3, a2, a0 # a3 is last address +1
155 #endif /* !__mips64 */
157 libc_hidden_def(memset)