| 1 |
148 |
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
|
| 22 |
|
|
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
| 23 |
|
|
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
| 24 |
|
|
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
|
| 25 |
|
|
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
| 26 |
|
|
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
| 27 |
|
|
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
| 28 |
|
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
| 29 |
|
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
| 30 |
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
| 31 |
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 32 |
|
|
*/
|
| 33 |
|
|
#ifndef _LLRINTF_H_
|
| 34 |
|
|
#define _LLRINTF_H_ 1
|
| 35 |
|
|
|
| 36 |
|
|
#include <spu_intrinsics.h>
|
| 37 |
|
|
#include "headers/vec_literal.h"
|
| 38 |
|
|
|
| 39 |
|
|
static __inline long long int _llrintf(float x)
|
| 40 |
|
|
{
|
| 41 |
|
|
int shift;
|
| 42 |
|
|
vec_int4 exp;
|
| 43 |
|
|
vec_uint4 mant, sign, borrow;
|
| 44 |
|
|
vec_float4 in;
|
| 45 |
|
|
|
| 46 |
|
|
in = spu_promote(x, 0);
|
| 47 |
|
|
|
| 48 |
|
|
/* Place mantissa bits (including implied most signficant
|
| 49 |
|
|
* bit) into the most significant bits of element 3. Elements
|
| 50 |
|
|
* 0, 1, and 2 are zeroed.
|
| 51 |
|
|
*/
|
| 52 |
|
|
mant = spu_sel(spu_rlmaskqwbyte((vec_uint4)in, -11),
|
| 53 |
|
|
VEC_SPLAT_U32(0x80000000),
|
| 54 |
|
|
VEC_LITERAL(vec_uint4, 0,0,0xFF,0x800000FF));
|
| 55 |
|
|
|
| 56 |
|
|
/* Determine how many bits to shift the mantissa to correctly
|
| 57 |
|
|
* align it into long long element 0.
|
| 58 |
|
|
*/
|
| 59 |
|
|
exp = spu_and(spu_rlmask((vec_int4)in, -23), 0xFF);
|
| 60 |
|
|
shift = spu_extract(spu_add(exp, -94), 0);
|
| 61 |
|
|
|
| 62 |
|
|
/* Algn mantissa bits
|
| 63 |
|
|
*/
|
| 64 |
|
|
mant = spu_slqwbytebc(spu_slqw(mant, shift), shift);
|
| 65 |
|
|
|
| 66 |
|
|
/* Compute the two's complement of the mantissa if the
|
| 67 |
|
|
* input is negative.
|
| 68 |
|
|
*/
|
| 69 |
|
|
sign = spu_maskw(spu_extract(spu_rlmaska((vec_int4)in, -31), 0));
|
| 70 |
|
|
|
| 71 |
|
|
mant = spu_xor(mant, sign);
|
| 72 |
|
|
borrow = spu_genb(mant, sign);
|
| 73 |
|
|
borrow = spu_shuffle(borrow, borrow,
|
| 74 |
|
|
VEC_LITERAL(vec_uchar16, 4,5,6,7, 192,192,192,192,
|
| 75 |
|
|
4,5,6,7, 192,192,192,192));
|
| 76 |
|
|
mant = spu_subx(mant, sign, borrow);
|
| 77 |
|
|
|
| 78 |
|
|
return (spu_extract((vec_llong2)(mant), 0));
|
| 79 |
|
|
}
|
| 80 |
|
|
#endif /* _LLRINTF_H_ */
|
