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 | static __ea char * |
---|
39 | similie_ls_to_ea (char *l1, __ea char *ea1, char *l2) |
---|
40 | { |
---|
41 | return (__ea char *) ((size_ea_t) ea1 + |
---|
42 | ((size_ea_t) (int) l2 - (size_ea_t) (int) l1)); |
---|
43 | } |
---|
44 | |
---|
45 | COMPAT_EA_ALIAS (strrchr_ea); |
---|
46 | |
---|
47 | __ea char * |
---|
48 | strrchr_ea (__ea const char *s, int c) |
---|
49 | { |
---|
50 | size_ea_t string_length; |
---|
51 | char *curr_ptr; |
---|
52 | __ea char *string_start_local; |
---|
53 | __ea char *end_of_string_ea; |
---|
54 | __ea char *start_of_cacheline_ea; |
---|
55 | char *start_of_cachline_local; |
---|
56 | |
---|
57 | string_start_local = __cache_fetch ((__ea char *) s); |
---|
58 | string_length = strlen_ea (s); |
---|
59 | end_of_string_ea = (__ea char *) s + string_length; |
---|
60 | |
---|
61 | start_of_cacheline_ea = round_down_128_ea (end_of_string_ea - 1); |
---|
62 | start_of_cachline_local = __cache_fetch (start_of_cacheline_ea); |
---|
63 | /*this next line should be the same cacheline, just the end of the string */ |
---|
64 | curr_ptr = __cache_fetch (end_of_string_ea - 1); |
---|
65 | |
---|
66 | while (1) |
---|
67 | { |
---|
68 | /*search backwards through this cachline */ |
---|
69 | while (curr_ptr >= start_of_cachline_local) |
---|
70 | { |
---|
71 | if (*curr_ptr == (char) c) |
---|
72 | return similie_ls_to_ea (start_of_cachline_local, |
---|
73 | start_of_cacheline_ea, curr_ptr); |
---|
74 | curr_ptr--; |
---|
75 | if (curr_ptr < string_start_local) |
---|
76 | return NULL; |
---|
77 | } |
---|
78 | |
---|
79 | /* iterate cacheline backwards */ |
---|
80 | start_of_cacheline_ea -= 128; |
---|
81 | start_of_cachline_local = __cache_fetch (start_of_cacheline_ea); |
---|
82 | curr_ptr = __cache_fetch (start_of_cacheline_ea + 128); |
---|
83 | } |
---|
84 | } |
---|