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_cache.h> |
---|
35 | #include "ea_internal.h" |
---|
36 | #include <ea.h> |
---|
37 | |
---|
38 | COMPAT_EA_ALIAS (memset_ea); |
---|
39 | |
---|
40 | __ea void * |
---|
41 | memset_ea (__ea void *dest, int c, size_ea_t n) |
---|
42 | { |
---|
43 | __ea void *curr_dest = dest; |
---|
44 | void *l_dest; |
---|
45 | size_ea_t local_n; |
---|
46 | size_ea_t dst_n; |
---|
47 | |
---|
48 | while (n) |
---|
49 | { |
---|
50 | dst_n = |
---|
51 | ROUND_UP_NEXT_128 ((size_ea_t) curr_dest) - (size_ea_t) curr_dest; |
---|
52 | local_n = dst_n < n ? dst_n : n; |
---|
53 | |
---|
54 | l_dest = __cache_fetch_dirty (curr_dest, local_n); |
---|
55 | |
---|
56 | memset (l_dest, c, local_n); |
---|
57 | |
---|
58 | /* update values to take into account what we copied */ |
---|
59 | curr_dest += local_n; |
---|
60 | n -= local_n; |
---|
61 | } |
---|
62 | |
---|
63 | return dest; |
---|
64 | } |
---|