1 | /* |
---|
2 | (C) Copyright IBM Corp. 2007, 2008 |
---|
3 | |
---|
4 | All rights reserved. |
---|
5 | |
---|
6 | Redistribution and use in source and binary forms, with or without |
---|
7 | modification, are permitted provided that the following conditions are met: |
---|
8 | |
---|
9 | * Redistributions of source code must retain the above copyright notice, |
---|
10 | this list of conditions and the following disclaimer. |
---|
11 | * Redistributions in binary form must reproduce the above copyright |
---|
12 | notice, this list of conditions and the following disclaimer in the |
---|
13 | documentation and/or other materials provided with the distribution. |
---|
14 | * Neither the name of IBM nor the names of its contributors may be |
---|
15 | used to endorse or promote products derived from this software without |
---|
16 | specific prior written permission. |
---|
17 | |
---|
18 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
---|
19 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
20 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
21 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
---|
22 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
---|
23 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
---|
24 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
---|
25 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
---|
26 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
---|
27 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
---|
28 | POSSIBILITY OF SUCH DAMAGE. |
---|
29 | |
---|
30 | */ |
---|
31 | |
---|
32 | #include <stddef.h> |
---|
33 | #include "ea_internal.h" |
---|
34 | #include <ea.h> |
---|
35 | #include <string.h> |
---|
36 | #include <spu_cache.h> |
---|
37 | |
---|
38 | COMPAT_EA_ALIAS (memchr_ea); |
---|
39 | |
---|
40 | __ea void * |
---|
41 | memchr_ea (__ea const void *s, int c, size_ea_t n) |
---|
42 | { |
---|
43 | __ea void *curr_s = (__ea void *) s; |
---|
44 | void *local_s; |
---|
45 | size_ea_t left_in_cacheline; |
---|
46 | size_ea_t search_size; |
---|
47 | void *where; |
---|
48 | size_ea_t ret; |
---|
49 | |
---|
50 | while (n) |
---|
51 | { |
---|
52 | left_in_cacheline = ROUND_UP_NEXT_128 ((size_ea_t) curr_s) - |
---|
53 | (size_ea_t) curr_s; |
---|
54 | search_size = left_in_cacheline < n ? left_in_cacheline : n; |
---|
55 | |
---|
56 | local_s = __cache_fetch (curr_s); |
---|
57 | where = memchr (local_s, c, search_size); |
---|
58 | |
---|
59 | if (where) |
---|
60 | { |
---|
61 | ret = (size_ea_t) curr_s + |
---|
62 | ((size_ea_t) (int) where - (size_ea_t) (int) local_s); |
---|
63 | return (__ea void *) ret; |
---|
64 | } |
---|
65 | |
---|
66 | /* update values to take into account what we copied */ |
---|
67 | curr_s += search_size; |
---|
68 | n -= search_size; |
---|
69 | } |
---|
70 | |
---|
71 | /* if we got here n was initially 0 */ |
---|
72 | return NULL; |
---|
73 | } |
---|