| /* |
| (C) Copyright IBM Corp. 2007, 2008 |
| |
| All rights reserved. |
| |
| Redistribution and use in source and binary forms, with or without |
| modification, are permitted provided that the following conditions are met: |
| |
| * Redistributions of source code must retain the above copyright notice, |
| this list of conditions and the following disclaimer. |
| * Redistributions in binary form must reproduce the above copyright |
| notice, this list of conditions and the following disclaimer in the |
| documentation and/or other materials provided with the distribution. |
| * Neither the name of IBM nor the names of its contributors may be |
| used to endorse or promote products derived from this software without |
| specific prior written permission. |
| |
| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| POSSIBILITY OF SUCH DAMAGE. |
| |
| */ |
| |
| #include <stddef.h> |
| #include "ea_internal.h" |
| #include <ea.h> |
| #include <string.h> |
| #include <spu_cache.h> |
| |
| COMPAT_EA_ALIAS (memchr_ea); |
| |
| __ea void * |
| memchr_ea (__ea const void *s, int c, size_ea_t n) |
| { |
| __ea void *curr_s = (__ea void *) s; |
| void *local_s; |
| size_ea_t left_in_cacheline; |
| size_ea_t search_size; |
| void *where; |
| size_ea_t ret; |
| |
| while (n) |
| { |
| left_in_cacheline = ROUND_UP_NEXT_128 ((size_ea_t) curr_s) - |
| (size_ea_t) curr_s; |
| search_size = left_in_cacheline < n ? left_in_cacheline : n; |
| |
| local_s = __cache_fetch (curr_s); |
| where = memchr (local_s, c, search_size); |
| |
| if (where) |
| { |
| ret = (size_ea_t) curr_s + |
| ((size_ea_t) (int) where - (size_ea_t) (int) local_s); |
| return (__ea void *) ret; |
| } |
| |
| /* update values to take into account what we copied */ |
| curr_s += search_size; |
| n -= search_size; |
| } |
| |
| /* if we got here n was initially 0 */ |
| return NULL; |
| } |