| 1 |
207 |
jeremybenn |
/*
|
| 2 |
|
|
(C) Copyright 2001,2006,
|
| 3 |
|
|
International Business Machines Corporation,
|
| 4 |
|
|
Sony Computer Entertainment, Incorporated,
|
| 5 |
|
|
Toshiba Corporation,
|
| 6 |
|
|
|
| 7 |
|
|
All rights reserved.
|
| 8 |
|
|
|
| 9 |
|
|
Redistribution and use in source and binary forms, with or without
|
| 10 |
|
|
modification, are permitted provided that the following conditions are met:
|
| 11 |
|
|
|
| 12 |
|
|
* Redistributions of source code must retain the above copyright notice,
|
| 13 |
|
|
this list of conditions and the following disclaimer.
|
| 14 |
|
|
* Redistributions in binary form must reproduce the above copyright
|
| 15 |
|
|
notice, this list of conditions and the following disclaimer in the
|
| 16 |
|
|
documentation and/or other materials provided with the distribution.
|
| 17 |
|
|
* Neither the names of the copyright holders nor the names of their
|
| 18 |
|
|
contributors may be used to endorse or promote products derived from this
|
| 19 |
|
|
software without specific prior written permission.
|
| 20 |
|
|
|
| 21 |
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 22 |
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 23 |
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 24 |
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 25 |
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 26 |
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 27 |
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
| 28 |
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
| 29 |
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
| 30 |
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 31 |
|
|
POSSIBILITY OF SUCH DAMAGE.
|
| 32 |
|
|
*/
|
| 33 |
|
|
#include <spu_intrinsics.h>
|
| 34 |
|
|
#include <stddef.h>
|
| 35 |
|
|
|
| 36 |
|
|
/* Fills the first n bytes of the memory area pointed to by s
|
| 37 |
|
|
* with the constant byte c. Returns a pointer to the memory area s.
|
| 38 |
|
|
*/
|
| 39 |
|
|
void * memset(void *s, int c, size_t n)
|
| 40 |
|
|
{
|
| 41 |
|
|
int skip, cnt, i;
|
| 42 |
|
|
vec_uchar16 *vs;
|
| 43 |
|
|
vec_uchar16 vc, mask, one = spu_splats((unsigned char)-1);
|
| 44 |
|
|
|
| 45 |
|
|
vs = (vec_uchar16 *)(s);
|
| 46 |
|
|
vc = spu_splats((unsigned char)c);
|
| 47 |
|
|
cnt = (int)(n);
|
| 48 |
|
|
|
| 49 |
|
|
/* Handle any leading partial quadwords as well a
|
| 50 |
|
|
* very short settings (ie, such that the n characters
|
| 51 |
|
|
* all reside in a single quadword.
|
| 52 |
|
|
*/
|
| 53 |
|
|
skip = (int)(s) & 15;
|
| 54 |
|
|
if (skip) {
|
| 55 |
|
|
mask = spu_rlmaskqwbyte(one, -skip);
|
| 56 |
|
|
cnt -= 16 - skip;
|
| 57 |
|
|
if (cnt < 0) {
|
| 58 |
|
|
mask = spu_and(mask, spu_slqwbyte(one, (unsigned int)(-cnt)));
|
| 59 |
|
|
}
|
| 60 |
|
|
*vs = spu_sel(*vs, vc, mask);
|
| 61 |
|
|
vs++;
|
| 62 |
|
|
}
|
| 63 |
|
|
|
| 64 |
|
|
/* Handle 8 quadwords at a time
|
| 65 |
|
|
*/
|
| 66 |
|
|
for (i=127; i<cnt; cnt-=8*16) {
|
| 67 |
|
|
vs[0] = vc;
|
| 68 |
|
|
vs[1] = vc;
|
| 69 |
|
|
vs[2] = vc;
|
| 70 |
|
|
vs[3] = vc;
|
| 71 |
|
|
vs[4] = vc;
|
| 72 |
|
|
vs[5] = vc;
|
| 73 |
|
|
vs[6] = vc;
|
| 74 |
|
|
vs[7] = vc;
|
| 75 |
|
|
vs += 8;
|
| 76 |
|
|
}
|
| 77 |
|
|
|
| 78 |
|
|
/* Finish all remaining complete quadwords
|
| 79 |
|
|
*/
|
| 80 |
|
|
for (i=15; i<cnt; cnt-=16) *vs++ = vc;
|
| 81 |
|
|
|
| 82 |
|
|
/* Handle any trailing partial quadwords
|
| 83 |
|
|
*/
|
| 84 |
|
|
if (cnt > 0) {
|
| 85 |
|
|
mask = spu_slqwbyte(one, (unsigned int)(16-cnt));
|
| 86 |
|
|
*vs = spu_sel(*vs, vc, mask);
|
| 87 |
|
|
}
|
| 88 |
|
|
|
| 89 |
|
|
return (s);
|
| 90 |
|
|
}
|
