65 lines
2.1 KiB
C
65 lines
2.1 KiB
C
|
/*
|
||
|
|
(C) Copyright IBM Corp. 2007, 2008
|
||
|
|
|
||
|
|
All rights reserved.
|
||
|
|
|
||
|
|
Redistribution and use in source and binary forms, with or without
|
||
|
|
modification, are permitted provided that the following conditions are met:
|
||
|
|
|
||
|
|
* Redistributions of source code must retain the above copyright notice,
|
||
|
|
this list of conditions and the following disclaimer.
|
||
|
|
* Redistributions in binary form must reproduce the above copyright
|
||
|
|
notice, this list of conditions and the following disclaimer in the
|
||
|
|
documentation and/or other materials provided with the distribution.
|
||
|
|
* Neither the name of IBM nor the names of its contributors may be
|
||
|
|
used to endorse or promote products derived from this software without
|
||
|
|
specific prior written permission.
|
||
|
|
|
||
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
||
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||
|
|
POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <string.h>
|
||
|
|
#include <stddef.h>
|
||
|
|
#include <spu_cache.h>
|
||
|
|
#include "ea_internal.h"
|
||
|
|
#include <ea.h>
|
||
|
|
|
||
|
|
COMPAT_EA_ALIAS (memset_ea);
|
||
|
|
|
||
|
|
__ea void *
|
||
|
|
memset_ea (__ea void *dest, int c, size_ea_t n)
|
||
|
|
{
|
||
|
|
__ea void *curr_dest = dest;
|
||
|
|
void *l_dest;
|
||
|
|
size_ea_t local_n;
|
||
|
|
size_ea_t dst_n;
|
||
|
|
|
||
|
|
while (n)
|
||
|
|
{
|
||
|
|
dst_n =
|
||
|
|
ROUND_UP_NEXT_128 ((size_ea_t) curr_dest) - (size_ea_t) curr_dest;
|
||
|
|
local_n = dst_n < n ? dst_n : n;
|
||
|
|
|
||
|
|
l_dest = __cache_fetch_dirty (curr_dest, local_n);
|
||
|
|
|
||
|
|
memset (l_dest, c, local_n);
|
||
|
|
|
||
|
|
/* update values to take into account what we copied */
|
||
|
|
curr_dest += local_n;
|
||
|
|
n -= local_n;
|
||
|
|
}
|
||
|
|
|
||
|
|
return dest;
|
||
|
|
}
|