2 * Copyright 2010 Tilera Corporation. All Rights Reserved.
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, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
11 * NON INFRINGEMENT. See the GNU General Public License for
15 #include <linux/types.h>
16 #include <linux/string.h>
17 #include <linux/module.h>
19 void *memchr(const void *s
, int c
, size_t n
)
21 const uint32_t *last_word_ptr
;
23 const char *last_byte_ptr
;
25 uint32_t goal
, before_mask
, v
, bits
;
28 if (__builtin_expect(n
== 0, 0)) {
29 /* Don't dereference any memory if the array is empty. */
33 /* Get an aligned pointer. */
34 s_int
= (uintptr_t) s
;
35 p
= (const uint32_t *)(s_int
& -4);
37 /* Create four copies of the byte for which we are looking. */
38 goal
= 0x01010101 * (uint8_t) c
;
40 /* Read the first word, but munge it so that bytes before the array
41 * will not match goal.
43 * Note that this shift count expression works because we know
44 * shift counts are taken mod 32.
46 before_mask
= (1 << (s_int
<< 3)) - 1;
47 v
= (*p
| before_mask
) ^ (goal
& before_mask
);
49 /* Compute the address of the last byte. */
50 last_byte_ptr
= (const char *)s
+ n
- 1;
52 /* Compute the address of the word containing the last byte. */
53 last_word_ptr
= (const uint32_t *)((uintptr_t) last_byte_ptr
& -4);
55 while ((bits
= __insn_seqb(v
, goal
)) == 0) {
56 if (__builtin_expect(p
== last_word_ptr
, 0)) {
57 /* We already read the last word in the array,
65 /* We found a match, but it might be in a byte past the end
68 ret
= ((char *)p
) + (__insn_ctz(bits
) >> 3);
69 return (ret
<= last_byte_ptr
) ? ret
: NULL
;
71 EXPORT_SYMBOL(memchr
);