1 /* Optimized version of the standard strcpy() function.
2 This file is part of the GNU C Library.
3 Copyright (C) 2000-2018 Free Software Foundation, Inc.
4 Contributed by Dan Pop <Dan.Pop@cern.ch>.
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, see
18 <http://www.gnu.org/licenses/>. */
26 In this form, it assumes little endian mode. For big endian mode,
27 the two shifts in .l2 must be inverted:
29 shl value = r[1], sh1 // value = w0 << sh1
30 shr.u tmp = r[0], sh2 // tmp = w1 >> sh2
55 alloc r2 = ar.pfs, 2, 0, 30, 32
61 mov ret0 = in0 // return value = dest
63 mov saved_pr = pr // save the predicate registers
65 mov saved_lc = ar.lc // save the loop counter
67 sub tmp = r0, in0 ;; // tmp = -dest
68 mov dest = in0 // dest
70 and loopcnt = 7, tmp ;; // loopcnt = -dest % 8
71 cmp.eq p6, p0 = loopcnt, r0
72 adds loopcnt = -1, loopcnt // --loopcnt
73 (p6) br.cond.sptk .dest_aligned ;;
75 .l1: // copy -dest % 8 bytes
76 ld1 c = [src], 1 // c = *src++
78 st1 [dest] = c, 1 // *dest++ = c
80 (p6) br.cond.dpnt .restore_and_exit
83 and sh1 = 7, src // sh1 = src % 8
84 mov ar.lc = -1 // "infinite" loop
85 and asrc = -8, src ;; // asrc = src & -OPSIZ -- align src
87 mov pr.rot = 1 << 16 // set rotating predicates
88 cmp.ne p7, p0 = r0, r0 // clear p7
89 shl sh1 = sh1, 3 ;; // sh1 = 8 * (src % 8)
90 sub sh2 = 64, sh1 // sh2 = 64 - sh1
91 cmp.eq p6, p0 = sh1, r0 // is the src aligned?
92 (p6) br.cond.sptk .src_aligned ;;
93 ld8 r[1] = [asrc],8 ;;
97 ld8.s r[0] = [asrc], 8
98 shr.u value = r[1], sh1 ;; // value = w0 >> sh1
99 czx1.r pos = value ;; // do we have an "early" zero
100 cmp.lt p7, p0 = pos, thresh // in w0 >> sh1?
101 (p7) br.cond.dpnt .found0
102 chk.s r[0], .recovery2 // it is safe to do that only
103 .back2: // after the previous test
104 shl tmp = r[0], sh2 // tmp = w1 << sh2
106 or value = value, tmp ;; // value |= tmp
107 czx1.r pos = value ;;
108 cmp.ne p7, p0 = 8, pos
109 (p7) br.cond.dpnt .found0
110 st8 [dest] = value, 8 // store val to dest
114 (p[0]) ld8.s r[0] = [src], 8
115 (p[MEMLAT]) chk.s r[MEMLAT], .recovery3
117 (p[MEMLAT]) mov value = r[MEMLAT]
118 (p[MEMLAT]) czx1.r pos = r[MEMLAT] ;;
119 (p[MEMLAT]) cmp.ne p7, p0 = 8, pos
120 (p7) br.cond.dpnt .found0
121 (p[MEMLAT]) st8 [dest] = r[MEMLAT], 8
126 extr.u c = value, 0, 8 // c = value & 0xff
127 shr.u value = value, 8
132 mov ar.lc = saved_lc // restore the loop counter
133 mov pr = saved_pr, -1 // restore the predicate registers
136 add tmp = -8, asrc ;;
140 add tmp = -(MEMLAT + 1) * 8, src ;;
141 ld8 r[MEMLAT] = [tmp]
144 libc_hidden_builtin_def (strcpy)