2 * Copyright (C) 2013 Regents of the University of California
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation, version 2.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
15 #include <linux/linkage.h>
18 /* void *memset(void *, int, size_t) */
20 move t0, a0 /* Preserve return value */
22 /* Defer to byte-oriented fill for small sizes */
27 * Round to nearest XLEN-aligned address
28 * greater than or equal to start address
31 andi a3, a3, ~(SZREG-1)
32 beq a3, t0, 2f /* Skip if already aligned */
33 /* Handle initial misalignment */
39 sub a2, a2, a4 /* Update count */
41 2: /* Duff's device with 32 XLEN stores per iteration */
42 /* Broadcast value into all bytes */
53 /* Calculate end address */
54 andi a4, a2, ~(SZREG-1)
57 andi a4, a4, 31*SZREG /* Calculate remainder */
58 beqz a4, 3f /* Shortcut if no remainder */
60 addi a4, a4, 32*SZREG /* Calculate initial offset */
62 /* Adjust start address with offset */
65 /* Jump into loop body */
66 /* Assumes 32-bit instruction lengths */
84 REG_S a1, 10*SZREG(t0)
85 REG_S a1, 11*SZREG(t0)
86 REG_S a1, 12*SZREG(t0)
87 REG_S a1, 13*SZREG(t0)
88 REG_S a1, 14*SZREG(t0)
89 REG_S a1, 15*SZREG(t0)
90 REG_S a1, 16*SZREG(t0)
91 REG_S a1, 17*SZREG(t0)
92 REG_S a1, 18*SZREG(t0)
93 REG_S a1, 19*SZREG(t0)
94 REG_S a1, 20*SZREG(t0)
95 REG_S a1, 21*SZREG(t0)
96 REG_S a1, 22*SZREG(t0)
97 REG_S a1, 23*SZREG(t0)
98 REG_S a1, 24*SZREG(t0)
99 REG_S a1, 25*SZREG(t0)
100 REG_S a1, 26*SZREG(t0)
101 REG_S a1, 27*SZREG(t0)
102 REG_S a1, 28*SZREG(t0)
103 REG_S a1, 29*SZREG(t0)
104 REG_S a1, 30*SZREG(t0)
105 REG_S a1, 31*SZREG(t0)
106 addi t0, t0, 32*SZREG
108 andi a2, a2, SZREG-1 /* Update count */
111 /* Handle trailing misalignment */