1 /* Optimized memchr implementation for PowerPC32/POWER7 using cmpb insn.
2 Copyright (C) 2010 Free Software Foundation, Inc.
3 Contributed by Luis Machado <luisgpm@br.ibm.com>.
4 This file is part of the GNU C Library.
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, write to the Free
18 Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA
25 /* int [r3] memchr (char *s [r3], int byte [r4], int size [r5]) */
27 ENTRY (BP_SYM (__memchr))
33 add r7,r3,r5 /* Calculate the last acceptable address. */
37 cmplw cr7,r3,r7 /* Is the address equal or less than r3? If
38 it's equal or less, it means size is either 0
39 or a negative number. */
42 li r7,-1 /* Make r11 the biggest if r4 <= 0. */
44 rlwinm r6,r3,3,27,28 /* Calculate padding. */
45 lwz r12,0(r8) /* Load word from memory. */
46 cmpb r10,r12,r4 /* Check for BYTE's in WORD1. */
49 cmplwi cr7,r10,0 /* If r10 == 0, no BYTE's have been found. */
52 /* Are we done already? */
58 /* Are we now aligned to a doubleword boundary? If so, skip to
59 the main loop. Otherwise, go through the alignment code. */
63 /* Handle WORD2 of pair. */
69 /* Are we done already? */
76 srwi r6,r5,3 /* Number of loop iterations. */
77 mtctr r6 /* Setup the counter. */
79 /* Main loop to look for BYTE backwards in the string. Since
80 it's a small loop (< 8 instructions), align it to 32-bytes. */
83 /* Load two words, compare and merge in a
84 single register for speed. This is an attempt
85 to speed up the byte-checking process for bigger strings. */
91 or r5,r9,r10 /* Merge everything in one word. */
95 /* We're here because the counter reached 0, and that means we
96 didn't have any matches for BYTE in the whole range. Just
97 return the original range. */
100 blt cr6,L(loop_small)
103 /* OK, one (or both) of the words contains BYTE. Check
104 the first word and decrement the address in case the first
105 word really contains BYTE. */
112 /* BYTE must be in the second word. Adjust the address
113 again and move the result of cmpb to r10 so we can calculate the
119 /* r10 has the output of the cmpb instruction, that is, it contains
120 0xff in the same position as BYTE in the original
121 word from the string. Use that to calculate the pointer.
122 We need to make sure BYTE is *before* the end of the
125 cntlzw r0,r10 /* Count leading zeroes before the match. */
126 srwi r0,r0,3 /* Convert leading zeroes to bytes. */
137 /* Deals with size <= 16. */
143 rlwinm r6,r3,3,27,28 /* Calculate padding. */
144 lwz r12,0(r8) /* Load word from memory. */
145 cmpb r10,r12,r4 /* Check for BYTE in DWORD1. */
151 /* Are we done already? */
168 END (BP_SYM (__memchr))
169 weak_alias (BP_SYM (__memchr), BP_SYM(memchr))
170 libc_hidden_builtin_def (memchr)