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 <spu_intrinsics.h> |
---|
35 | #include <spu_cache.h> |
---|
36 | #include "ea_internal.h" |
---|
37 | #include "strncmp.h" |
---|
38 | #include <ea.h> |
---|
39 | |
---|
40 | COMPAT_EA_ALIAS (strncmp_ea); |
---|
41 | |
---|
42 | int |
---|
43 | strncmp_ea (__ea void *s1, __ea const void *s2, size_ea_t n3) |
---|
44 | { |
---|
45 | __ea void *curr_s1 = (__ea void *) s1; |
---|
46 | __ea void *curr_s2 = (__ea void *) s2; |
---|
47 | void *l_s1; |
---|
48 | void *l_s2; |
---|
49 | int min; |
---|
50 | size_ea_t s2_n; |
---|
51 | size_ea_t s1_n; |
---|
52 | int ret; |
---|
53 | vec_uint4 end_v; |
---|
54 | |
---|
55 | ret = 0; /* in case n3 is 0 */ |
---|
56 | while (n3) |
---|
57 | { |
---|
58 | l_s2 = __cache_fetch (curr_s2); |
---|
59 | l_s1 = __cache_fetch (curr_s1); |
---|
60 | |
---|
61 | /* |
---|
62 | * Use the smaller of the size left to compare (n3), the space left in |
---|
63 | * s2 cacheline (s2_n), or the space left in the s1 cacheline (s1_n) |
---|
64 | */ |
---|
65 | s2_n = ROUND_UP_NEXT_128 ((size_ea_t) curr_s2) - (size_ea_t) curr_s2; |
---|
66 | s1_n = ROUND_UP_NEXT_128 ((size_ea_t) curr_s1) - (size_ea_t) curr_s1; |
---|
67 | min = three_way_min (s2_n, s1_n, n3); |
---|
68 | |
---|
69 | ret = _strncmp_internal (l_s1, l_s2, min, &end_v, 1); |
---|
70 | /* |
---|
71 | * Only the first slot of end_v is set. |
---|
72 | */ |
---|
73 | /* if (ret || spu_extract(spu_cmpeq(end_v, 0), 0)) { */ |
---|
74 | /* if (ret || spu_extract(spu_gather(spu_cmpeq(end_v, 0)), 0)) { */ |
---|
75 | if (ret || spu_extract (end_v, 0)) |
---|
76 | /* |
---|
77 | * If any NUL values were seen (end_v values of zero) we still have |
---|
78 | * to return ret, as it might not be zero. |
---|
79 | */ |
---|
80 | return ret; |
---|
81 | |
---|
82 | curr_s2 += min; |
---|
83 | curr_s1 += min; |
---|
84 | n3 -= min; |
---|
85 | } |
---|
86 | return ret; |
---|
87 | } |
---|