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 (strstr_ea); |
---|
39 | |
---|
40 | __ea char *strstr_ea (__ea const char *s1, __ea const char *s2) |
---|
41 | { |
---|
42 | __ea char *ret; |
---|
43 | __ea char *curr; |
---|
44 | size_ea_t s2_length; |
---|
45 | size_ea_t s1_length; |
---|
46 | int i; |
---|
47 | int found; |
---|
48 | |
---|
49 | ret = (__ea char *) s1; |
---|
50 | s2_length = strlen_ea (s2); |
---|
51 | s1_length = strlen_ea (s1); |
---|
52 | while (ret < (s1 + s1_length)) { |
---|
53 | /* search for first letter */ |
---|
54 | //temporary hack for broken 64 bit compiler |
---|
55 | ret = strchr_ea (ret, s2[0]); |
---|
56 | /*if we find it search for the rest */ |
---|
57 | if (ret) { |
---|
58 | found = 1; |
---|
59 | for (i = 1; i < s2_length; i++) { |
---|
60 | //temporary hack for broken 64 bit compiler |
---|
61 | curr = strchr_ea (ret, s2[i]); |
---|
62 | /* if the letter doesn't exist or isn't in the right spot we unfind */ |
---|
63 | if (!curr || (curr != (ret + i))) |
---|
64 | found = 0; |
---|
65 | } |
---|
66 | } |
---|
67 | if (found) { |
---|
68 | return ret; |
---|
69 | } else { |
---|
70 | ret++; |
---|
71 | } |
---|
72 | /*go back and try again with the rest of it */ |
---|
73 | } |
---|
74 | return NULL; |
---|
75 | } |
---|