[444] | 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 <string.h> |
---|
| 33 | #include <stddef.h> |
---|
| 34 | #include "ea_internal.h" |
---|
| 35 | #include <ea.h> |
---|
| 36 | #include <spu_cache.h> |
---|
| 37 | |
---|
| 38 | COMPAT_EA_ALIAS (memcmp_ea); |
---|
| 39 | |
---|
| 40 | int |
---|
| 41 | memcmp_ea (__ea void *s1, __ea const void *s2, size_ea_t n) |
---|
| 42 | { |
---|
| 43 | __ea void *curr_s1 = s1; |
---|
| 44 | __ea void *curr_s2 = (__ea void *) s2; |
---|
| 45 | void *l_s1; |
---|
| 46 | void *l_s2; |
---|
| 47 | size_ea_t local_n; |
---|
| 48 | size_ea_t s2_n; |
---|
| 49 | size_ea_t s1_n; |
---|
| 50 | int ret; |
---|
| 51 | |
---|
| 52 | ret = 0; |
---|
| 53 | while (n) |
---|
| 54 | { |
---|
| 55 | l_s2 = __cache_fetch (curr_s2); |
---|
| 56 | l_s1 = __cache_fetch (curr_s1); |
---|
| 57 | |
---|
| 58 | /* |
---|
| 59 | * Use the smaller of the size left to compare (n), the space left in |
---|
| 60 | * s2 cacheline (s2_n), or the space left in the s1 cacheline (s1_n). |
---|
| 61 | */ |
---|
| 62 | s2_n = ROUND_UP_NEXT_128 ((size_ea_t) curr_s2) - (size_ea_t) curr_s2; |
---|
| 63 | s1_n = ROUND_UP_NEXT_128 ((size_ea_t) curr_s1) - (size_ea_t) curr_s1; |
---|
| 64 | local_n = three_way_min (s2_n, s1_n, n); |
---|
| 65 | |
---|
| 66 | ret = memcmp (l_s1, l_s2, local_n); |
---|
| 67 | if (ret) |
---|
| 68 | return ret; |
---|
| 69 | |
---|
| 70 | /* update values to take into account what we copied */ |
---|
| 71 | curr_s2 += local_n; |
---|
| 72 | curr_s1 += local_n; |
---|
| 73 | n -= local_n; |
---|
| 74 | |
---|
| 75 | } |
---|
| 76 | |
---|
| 77 | return ret; |
---|
| 78 | } |
---|