about summary refs log tree commit diff
path: root/sysdeps/powerpc/powerpc32/power7/memrchr.S
blob: defd832b0ac6d46c9d305627df5ffefbbbaac212 (plain) (blame)
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
/* Optimized memrchr implementation for PowerPC32/POWER7 using cmpb insn.
   Copyright (C) 2010-2013 Free Software Foundation, Inc.
   Contributed by Luis Machado <luisgpm@br.ibm.com>.
   This file is part of the GNU C Library.

   The GNU C Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2.1 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
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with the GNU C Library; if not, see
   <http://www.gnu.org/licenses/>.  */

#include <sysdep.h>

/* int [r3] memrchr (char *s [r3], int byte [r4], int size [r5])  */
	.machine  power7
ENTRY (__memrchr)
	CALL_MCOUNT
	dcbt	0,r3
	mr	r7,r3
	add	r3,r7,r5      /* Calculate the last acceptable address.  */
	cmplw	cr7,r3,r7     /* Is the address equal or less than r3?  */

	/* Replicate BYTE to word.  */
	rlwimi	r4,r4,8,16,23
	rlwimi	r4,r4,16,0,15
	bge	cr7,L(proceed)

	li	r3,-1	      /* Make r11 the biggest if r4 <= 0.  */
L(proceed):
	li	r6,-4
	addi	r9,r3,-1
	clrrwi  r8,r9,2
	addi	r8,r8,4
	neg	r0,r3
	rlwinm	r0,r0,3,27,28 /* Calculate padding.  */

	cmplwi	r5,16
	ble	L(small_range)

	lwbrx	r12,r8,r6     /* Load reversed word from memory.  */
	cmpb	r10,r12,r4    /* Check for BYTE in WORD1.  */
	slw	r10,r10,r0
	srw	r10,r10,r0
	cmplwi	cr7,r10,0     /* If r10 == 0, no BYTEs have been found.  */
	bne	cr7,L(done)

	/* Are we done already?  */
	addi	r9,r8,-4
	cmplw	cr6,r9,r7
	ble	cr6,L(null)

	mtcrf   0x01,r8
	/* Are we now aligned to a doubleword boundary?  If so, skip to
	   the main loop.  Otherwise, go through the alignment code.  */
	mr	r8,r9
	bt	29,L(loop_setup)

	/* Handle WORD2 of pair.  */
	lwbrx	r12,r8,r6
	cmpb	r10,r12,r4
	cmplwi	cr7,r10,0
	bne	cr7,L(done)

	/* Are we done already?  */
	addi	r8,r8,-4
	cmplw	cr6,r8,r7
	ble	cr6,L(null)

L(loop_setup):
	li	r0,-8
	sub	r5,r8,r7
	srwi	r9,r5,3	      /* Number of loop iterations.  */
	mtctr	r9	      /* Setup the counter.  */
	b	L(loop)
	/* Main loop to look for BYTE backwards in the string.  Since it's a
	   small loop (< 8 instructions), align it to 32-bytes.  */
	.p2align  5
L(loop):
	/* Load two words, compare and merge in a
	   single register for speed.  This is an attempt
	   to speed up the byte-checking process for bigger strings.  */

	lwbrx	r12,r8,r6
	lwbrx	r11,r8,r0
	addi	r8,r8,-4
	cmpb	r10,r12,r4
	cmpb	r9,r11,r4
	or	r5,r9,r10     /* Merge everything in one word.  */
	cmplwi	cr7,r5,0
	bne	cr7,L(found)
	addi	r8,r8,-4
	bdnz	L(loop)
	/* We're here because the counter reached 0, and that means we
	   didn't have any matches for BYTE in the whole range.  Just return
	   the original range.  */
	addi	r8,r8,4
	cmplw	cr6,r8,r7
	bgt	cr6,L(loop_small)
	b	L(null)

	/* OK, one (or both) of the words contains BYTE.  Check
	   the first word and decrement the address in case the first
	   word really contains BYTE.  */
	.align	4
L(found):
	cmplwi	cr6,r10,0
	addi	r8,r8,4
	bne	cr6,L(done)

	/* BYTE must be in the second word.  Adjust the address
	   again and move the result of cmpb to r10 so we can calculate the
	   pointer.  */

	mr	r10,r9
	addi	r8,r8,-4

	/* r10 has the output of the cmpb instruction, that is, it contains
	   0xff in the same position as BYTE in the original
	   word from the string.  Use that to calculate the pointer.
	   We need to make sure BYTE is *before* the end of the
	   range.  */
L(done):
	cntlzw	r0,r10	      /* Count leading zeroes before the match.  */
	srwi	r6,r0,3	      /* Convert leading zeroes to bytes.  */
	addi	r0,r6,1
	sub	r3,r8,r0
	cmplw	r3,r7
	blt	L(null)
	blr

	.align	4
L(null):
	li	r3,0
	blr

/* Deals with size <= 16.  */
	.align	4
L(small_range):
	cmplwi	r5,0
	beq	L(null)

	lwbrx	r12,r8,r6     /* Load reversed word from memory.  */
	cmpb	r10,r12,r4    /* Check for null bytes in WORD1.  */
	slw	r10,r10,r0
	srw	r10,r10,r0
	cmplwi	cr7,r10,0
	bne	cr7,L(done)

	addi	r8,r8,-4
	cmplw	r8,r7
	ble	L(null)
	b	L(loop_small)

	.p2align  5
L(loop_small):
	lwbrx	r12,r8,r6
	cmpb	r10,r12,r4
	cmplwi	cr6,r10,0
	bne	cr6,L(done)
	addi	r8,r8,-4
	cmplw	r8,r7
	ble	L(null)
	b	L(loop_small)

END (__memrchr)
weak_alias (__memrchr, memrchr)
libc_hidden_builtin_def (memrchr)