1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
|
/* memchr (str, ch, n) -- Return pointer to first occurrence of CH in STR less
than N.
For SPARC v9.
Copyright (C) 1998,1999, 2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Jan Vondrak <jvon4518@ss1000.ms.mff.cuni.cz> and
Jakub Jelinek <jj@ultra.linux.cz>.
This version is developed using the same algorithm as the fast C
version which carries the following introduction:
Based on strlen implementation by Torbjorn Granlund (tege@sics.se),
with help from Dan Sahlin (dan@sics.se) and
commentary by Jim Blandy (jimb@ai.mit.edu);
adaptation to memchr suggested by Dick Karpinski (dick@cca.ucsf.edu),
and implemented by Roland McGrath (roland@ai.mit.edu).
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
The GNU C Library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with the GNU C Library; see the file COPYING.LIB. If not,
write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#include <sysdep.h>
#include <asm/asi.h>
#ifndef XCC
#define XCC xcc
#define USE_BPR
.register %g2, #scratch
.register %g3, #scratch
#endif
/* Normally, this uses
((xword - 0x0101010101010101) & 0x8080808080808080) test
to find out if any byte in xword could be zero. This is fast, but
also gives false alarm for any byte in range 0x81-0xff. It does
not matter for correctness, as if this test tells us there could
be some zero byte, we check it byte by byte, but if bytes with
high bits set are common in the strings, then this will give poor
performance. You can #define EIGHTBIT_NOT_RARE and the algorithm
will use one tick slower, but more precise test
((xword - 0x0101010101010101) & (~xword) & 0x8080808080808080),
which does not give any false alarms (but if some bits are set,
one cannot assume from it which bytes are zero and which are not).
It is yet to be measured, what is the correct default for glibc
in these days for an average user.
*/
.text
.align 32
ENTRY(__memchr)
and %o1, 0xff, %o1 /* IEU0 Group */
#ifdef USE_BPR
brz,pn %o2, 12f /* CTI+IEU1 */
#else
tst %o2 /* IEU1 */
be,pn %XCC, 12f /* CTI */
#endif
sll %o1, 8, %g3 /* IEU0 Group */
add %o0, %o2, %o2 /* IEU1 */
sethi %hi(0x01010101), %g1 /* IEU0 Group */
or %g3, %o1, %g3 /* IEU1 */
ldub [%o0], %o3 /* Load */
sllx %g3, 16, %g5 /* IEU0 Group */
or %g1, %lo(0x01010101), %g1 /* IEU1 */
sllx %g1, 32, %g2 /* IEU0 Group */
or %g3, %g5, %g3 /* IEU1 */
sllx %g3, 32, %g5 /* IEU0 Group */
cmp %o3, %o1 /* IEU1 */
be,pn %xcc, 13f /* CTI */
or %g1, %g2, %g1 /* IEU0 Group */
andcc %o0, 7, %g0 /* IEU1 */
bne,a,pn %icc, 21f /* CTI */
add %o0, 1, %o0 /* IEU0 Group */
ldx [%o0], %o3 /* Load Group */
sllx %g1, 7, %g2 /* IEU0 */
or %g3, %g5, %g3 /* IEU1 */
1: add %o0, 8, %o0 /* IEU0 Group */
xor %o3, %g3, %o4 /* IEU1 */
/* %g1 = 0101010101010101 *
* %g2 = 8080088080808080 *
* %g3 = c c c c c c c c *
* %o3 = value *
* %o4 = value XOR c */
2: cmp %o0, %o2 /* IEU1 Group */
bg,pn %XCC, 11f /* CTI */
ldxa [%o0] ASI_PNF, %o3 /* Load */
sub %o4, %g1, %o5 /* IEU0 Group */
add %o0, 8, %o0 /* IEU1 */
#ifdef EIGHTBIT_NOT_RARE
andn %o5, %o4, %o5 /* IEU0 Group */
#endif
andcc %o5, %g2, %g0 /* IEU1 Group */
be,a,pt %xcc, 2b /* CTI */
xor %o3, %g3, %o4 /* IEU0 */
srlx %o4, 56, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 3f /* CTI */
srlx %o4, 48, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 4f /* CTI */
srlx %o4, 40, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 5f /* CTI */
srlx %o4, 32, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 6f /* CTI */
srlx %o4, 24, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 7f /* CTI */
srlx %o4, 16, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 8f /* CTI */
srlx %o4, 8, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 9f /* CTI */
andcc %o4, 0xff, %g0 /* IEU1 Group */
bne,pt %icc, 2b /* CTI */
xor %o3, %g3, %o4 /* IEU0 */
retl /* CTI+IEU1 Group */
add %o0, -9, %o0 /* IEU0 */
.align 16
3: retl /* CTI+IEU1 Group */
add %o0, -16, %o0 /* IEU0 */
4: retl /* CTI+IEU1 Group */
add %o0, -15, %o0 /* IEU0 */
5: retl /* CTI+IEU1 Group */
add %o0, -14, %o0 /* IEU0 */
6: retl /* CTI+IEU1 Group */
add %o0, -13, %o0 /* IEU0 */
7: retl /* CTI+IEU1 Group */
add %o0, -12, %o0 /* IEU0 */
8: retl /* CTI+IEU1 Group */
add %o0, -11, %o0 /* IEU0 */
9: retl /* CTI+IEU1 Group */
add %o0, -10, %o0 /* IEU0 */
11: sub %o4, %g1, %o5 /* IEU0 Group */
sub %o0, 8, %o0 /* IEU1 */
andcc %o5, %g2, %g0 /* IEU1 Group */
be,pt %xcc, 12f /* CTI */
sub %o2, %o0, %o2 /* IEU0 */
tst %o2 /* IEU1 Group */
be,pn %XCC, 12f /* CTI */
srlx %o4, 56, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 13f /* CTI */
cmp %o2, 1 /* IEU0 */
be,pn %XCC, 12f /* CTI Group */
srlx %o4, 48, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 14f /* CTI */
cmp %o2, 2 /* IEU1 Group */
be,pn %XCC, 12f /* CTI */
srlx %o4, 40, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 15f /* CTI */
cmp %o2, 3 /* IEU1 Group */
be,pn %XCC, 12f /* CTI */
srlx %o4, 32, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 16f /* CTI */
cmp %o2, 4 /* IEU1 Group */
be,pn %XCC, 12f /* CTI */
srlx %o4, 24, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 17f /* CTI */
cmp %o2, 5 /* IEU1 Group */
be,pn %XCC, 12f /* CTI */
srlx %o4, 16, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 18f /* CTI */
cmp %o2, 6 /* IEU1 Group */
be,pn %XCC, 12f /* CTI */
srlx %o4, 8, %g5 /* IEU0 */
andcc %g5, 0xff, %g0 /* IEU1 Group */
be,pn %icc, 19f /* CTI */
nop /* IEU0 */
12: retl /* CTI+IEU1 Group */
clr %o0 /* IEU0 */
nop /* Stub */
13: retl /* CTI+IEU1 Group */
nop /* IEU0 */
14: retl /* CTI+IEU1 Group */
add %o0, 1, %o0 /* IEU0 */
15: retl /* CTI+IEU1 Group */
add %o0, 2, %o0 /* IEU0 */
16: retl /* CTI+IEU1 Group */
add %o0, 3, %o0 /* IEU0 */
17: retl /* CTI+IEU1 Group */
add %o0, 4, %o0 /* IEU0 */
18: retl /* CTI+IEU1 Group */
add %o0, 5, %o0 /* IEU0 */
19: retl /* CTI+IEU1 Group */
add %o0, 6, %o0 /* IEU0 */
21: cmp %o0, %o2 /* IEU1 */
be,pn %XCC, 12b /* CTI */
sllx %g1, 7, %g2 /* IEU0 Group */
ldub [%o0], %o3 /* Load */
or %g3, %g5, %g3 /* IEU1 */
22: andcc %o0, 7, %g0 /* IEU1 Group */
be,a,pn %icc, 1b /* CTI */
ldx [%o0], %o3 /* Load */
cmp %o3, %o1 /* IEU1 Group */
be,pn %xcc, 23f /* CTI */
add %o0, 1, %o0 /* IEU0 */
cmp %o0, %o2 /* IEU1 Group */
bne,a,pt %XCC, 22b /* CTI */
ldub [%o0], %o3 /* Load */
retl /* CTI+IEU1 Group */
clr %o0 /* IEU0 */
23: retl /* CTI+IEU1 Group */
add %o0, -1, %o0 /* IEU0 */
END(__memchr)
weak_alias (__memchr, memchr)
#if !__BOUNDED_POINTERS__
weak_alias (__memchr, __ubp_memchr)
#endif
|
