| 1 |
207 |
jeremybenn |
/* -------------------------------------------------------------- */
|
| 2 |
|
|
/* (C)Copyright 2006,2008, */
|
| 3 |
|
|
/* International Business Machines Corporation */
|
| 4 |
|
|
/* All Rights Reserved. */
|
| 5 |
|
|
/* */
|
| 6 |
|
|
/* Redistribution and use in source and binary forms, with or */
|
| 7 |
|
|
/* without modification, are permitted provided that the */
|
| 8 |
|
|
/* following conditions are met: */
|
| 9 |
|
|
/* */
|
| 10 |
|
|
/* - Redistributions of source code must retain the above copyright*/
|
| 11 |
|
|
/* notice, this list of conditions and the following disclaimer. */
|
| 12 |
|
|
/* */
|
| 13 |
|
|
/* - Redistributions in binary form must reproduce the above */
|
| 14 |
|
|
/* copyright notice, this list of conditions and the following */
|
| 15 |
|
|
/* disclaimer in the documentation and/or other materials */
|
| 16 |
|
|
/* provided with the distribution. */
|
| 17 |
|
|
/* */
|
| 18 |
|
|
/* - Neither the name of IBM Corporation nor the names of its */
|
| 19 |
|
|
/* contributors may be used to endorse or promote products */
|
| 20 |
|
|
/* derived from this software without specific prior written */
|
| 21 |
|
|
/* permission. */
|
| 22 |
|
|
/* */
|
| 23 |
|
|
/* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND */
|
| 24 |
|
|
/* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, */
|
| 25 |
|
|
/* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
|
| 26 |
|
|
/* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
|
| 27 |
|
|
/* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR */
|
| 28 |
|
|
/* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, */
|
| 29 |
|
|
/* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT */
|
| 30 |
|
|
/* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; */
|
| 31 |
|
|
/* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) */
|
| 32 |
|
|
/* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
|
| 33 |
|
|
/* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR */
|
| 34 |
|
|
/* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, */
|
| 35 |
|
|
/* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
|
| 36 |
|
|
/* -------------------------------------------------------------- */
|
| 37 |
|
|
/* PROLOG END TAG zYx */
|
| 38 |
|
|
#ifdef __SPU__
|
| 39 |
|
|
#ifndef _SIGNBITD2_H_
|
| 40 |
|
|
#define _SIGNBITD2_H_ 1
|
| 41 |
|
|
|
| 42 |
|
|
#include <spu_intrinsics.h>
|
| 43 |
|
|
|
| 44 |
|
|
/*
|
| 45 |
|
|
* FUNCTION
|
| 46 |
|
|
* vector unsigned long long _signbitd2(vector double x)
|
| 47 |
|
|
*
|
| 48 |
|
|
* DESCRIPTION
|
| 49 |
|
|
* The signbitd2 function returns a vector which contains either all ones
|
| 50 |
|
|
* or all zeros, depending on the sign of the corresponding input vector
|
| 51 |
|
|
* element.
|
| 52 |
|
|
*
|
| 53 |
|
|
* Note that the signbit functions are not logically equivalent to
|
| 54 |
|
|
* x < 0.0. IEEE 754 floating point rules include a signed zero, so if
|
| 55 |
|
|
* the input value is –0.0, signbit will return non-zero, but the naive
|
| 56 |
|
|
* implementation will not.
|
| 57 |
|
|
*
|
| 58 |
|
|
* RETURNS
|
| 59 |
|
|
* The function signbitf4 returns an unsigned int vector in which each
|
| 60 |
|
|
* element is defined as:
|
| 61 |
|
|
*
|
| 62 |
|
|
* - ULLONG_MAX (0xFFFFFFFFFFFFFFFF) if the sign bit is set for the
|
| 63 |
|
|
* corresponding element of x
|
| 64 |
|
|
* - 0 (0x0000000000000000) otherwise.
|
| 65 |
|
|
*
|
| 66 |
|
|
*/
|
| 67 |
|
|
static __inline vector unsigned long long _signbitd2(vector double x)
|
| 68 |
|
|
{
|
| 69 |
|
|
vec_uchar16 shuf = ((vec_uchar16){0, 1, 2, 3, 0, 1, 2, 3, 8, 9, 10, 11, 8, 9, 10, 11});
|
| 70 |
|
|
vec_uint4 r = spu_rlmaska((vec_uint4)x,-31);
|
| 71 |
|
|
return (vec_ullong2)spu_shuffle(r,r,shuf);
|
| 72 |
|
|
}
|
| 73 |
|
|
#endif /* _SIGNBITD2_H_ */
|
| 74 |
|
|
#endif /* __SPU__ */
|
