Searched refs:lx (Results 1 - 25 of 67) sorted by relevance

123

/haiku-fatelf/src/system/libroot/posix/glibc/arch/generic/
H A Ds_isinf.c22 int32_t hx,lx; local
23 EXTRACT_WORDS(hx,lx,x);
24 lx |= (hx & 0x7fffffff) ^ 0x7ff00000;
25 lx |= -lx;
26 return ~(lx >> 31) & (hx >> 30);
H A Ds_fpclassify.c29 u_int32_t hx, lx; local
32 EXTRACT_WORDS (hx, lx, x);
33 lx |= hx & 0xfffff;
35 if ((hx | lx) == 0)
40 retval = lx != 0 ? FP_NAN : FP_INFINITE;
H A Ds_isnan.c32 int32_t hx,lx; local
33 EXTRACT_WORDS(hx,lx,x);
35 hx |= (u_int32_t)(lx|(-lx))>>31;
H A Ds_nextafter.c40 u_int32_t lx,ly; local
42 EXTRACT_WORDS(hx,lx,x);
47 if(((ix>=0x7ff00000)&&((ix-0x7ff00000)|lx)!=0) || /* x is nan */
51 if((ix|lx)==0) { /* x == 0 */
57 if(hx>hy||((hx==hy)&&(lx>ly))) { /* x > y, x -= ulp */
58 if(lx==0) hx -= 1;
59 lx -= 1;
61 lx += 1;
62 if(lx==0) hx += 1;
65 if(hy>=0||hx>hy||((hx==hy)&&(lx>l
[all...]
H A De_fmod.c40 u_int32_t lx,ly,lz; local
42 EXTRACT_WORDS(hx,lx,x);
53 if((hx<hy)||(lx<ly)) return x; /* |x|<|y| return x */
54 if(lx==ly)
61 for (ix = -1043, i=lx; i>0; i<<=1) ix -=1;
76 /* set up {hx,lx}, {hy,ly} and align y to x */
82 hx = (hx<<n)|(lx>>(32-n));
83 lx <<= n;
85 hx = lx<<(n-32);
86 lx
[all...]
H A De_gammal_r.c31 u_int32_t es, hx, lx; local
33 GET_LDOUBLE_WORDS (es, hx, lx, x);
35 if (((es & 0x7fff) | hx | lx) == 0)
41 if (es == 0xffffffff && ((hx & 0x7fffffff) | lx) == 0)
47 if ((es & 0x7fff) == 0x7fff && ((hx & 0x7fffffff) | lx) != 0)
H A Ds_ilogb.c35 int32_t hx,lx,ix; local
40 GET_LOW_WORD(lx,x);
41 if((hx|lx)==0)
45 for (ix = -1043; lx>0; lx<<=1) ix -=1;
54 GET_LOW_WORD(lx,x);
55 if(((hx^0x7ff00000)|lx) == 0)
H A Ds_logb.c33 int32_t lx,ix; local
34 EXTRACT_WORDS(ix,lx,x);
36 if((ix|lx)==0) return -1.0/fabs(x);
H A De_gamma_r.c32 u_int32_t lx; local
34 EXTRACT_WORDS (hx, lx, x);
36 if (((hx & 0x7fffffff) | lx) == 0)
48 if ((unsigned int) hx == 0xfff00000 && lx==0)
H A De_atanh.c59 u_int32_t lx; local
60 EXTRACT_WORDS(hx,lx,x);
62 if ((ix|((lx|(-lx))>>31))>0x3ff00000) /* |x|>1 */
H A De_atan2l.c72 u_int32_t sx,sy,lx,ly; local
74 GET_LDOUBLE_WORDS(sx,hx,lx,x);
76 lx |= hx & 0x7fffffff;
80 if(((2*ix|((lx|-lx)>>31))>0xfffe)||
83 if(((sx-0x3fff)|lx)==0) return __atanl(y); /* x=1.0 */
96 if((ix|lx)==0) return (sy>=0x8000)? -pi_o_2-tiny: pi_o_2+tiny;
/haiku-fatelf/src/system/libroot/posix/glibc/arch/x86/
H A Ds_isinfl.c27 int32_t se,hx,lx; local
28 GET_LDOUBLE_WORDS(se,hx,lx,x);
31 lx |= (hx ^ 0x80000000) | ((se & 0x7fff) ^ 0x7fff);
32 lx |= -lx;
34 return ~(lx >> 31) & (1 - (se >> 14));
H A Ds_isnanl.c36 int32_t se,hx,lx; local
37 GET_LDOUBLE_WORDS(se,hx,lx,x);
42 lx |= hx & 0x7fffffff;
43 se |= (u_int32_t)(lx|(-lx))>>31;
H A Ds_nexttoward.c41 u_int32_t lx,hy,ly,esy; local
43 EXTRACT_WORDS(hx,lx,x);
50 if(((ix>=0x7ff00000)&&((ix-0x7ff00000)|lx)!=0) || /* x is nan */
54 if((ix|lx)==0) { /* x == 0 */
63 && (((hx<<11)|(lx>>21))>(hy&0x7fffffff)
64 || (((hx<<11)|(lx>>21))==(hy&0x7fffffff)
65 && (lx<<11)>ly)))) { /* x > y, x -= ulp */
66 if(lx==0) hx -= 1;
67 lx -= 1;
69 lx
[all...]
H A Ds_fpclassifyl.c29 u_int32_t ex, hx, lx; local
32 GET_LDOUBLE_WORDS (ex, hx, lx, x);
34 if ((ex | lx | hx) == 0)
39 retval = ((hx & 0x7fffffff) | lx) != 0 ? FP_NAN : FP_INFINITE;
H A Ds_nextafterl.c40 u_int32_t lx,ly; local
43 GET_LDOUBLE_WORDS(esx,hx,lx,x);
50 if(((ix==0x7fff)&&(((hx&0x7fffffff)|lx)!=0)) || /* x is nan */
54 if((ix|hx|lx)==0) { /* x == 0 */
60 if(esx>esy||((esx==esy) && (hx>hy||((hx==hy)&&(lx>ly))))) {
62 if(lx==0) {
75 lx -= 1;
77 lx += 1;
78 if(lx==0) {
87 if(esy>=0||(esx>esy||((esx==esy)&&(hx>hy||((hx==hy)&&(lx>l
[all...]
/haiku-fatelf/src/system/libroot/posix/glibc/arch/x86_64/
H A Ds_isinfl.c27 int32_t se,hx,lx; local
28 GET_LDOUBLE_WORDS(se,hx,lx,x);
31 lx |= (hx ^ 0x80000000) | ((se & 0x7fff) ^ 0x7fff);
32 lx |= -lx;
34 return ~(lx >> 31) & (1 - (se >> 14));
H A Ds_isnanl.c36 int32_t se,hx,lx; local
37 GET_LDOUBLE_WORDS(se,hx,lx,x);
42 lx |= hx & 0x7fffffff;
43 se |= (u_int32_t)(lx|(-lx))>>31;
H A Ds_nexttoward.c42 u_int32_t lx,hy,ly,esy; local
44 EXTRACT_WORDS(hx,lx,x);
51 if(((ix>=0x7ff00000)&&((ix-0x7ff00000)|lx)!=0) || /* x is nan */
55 if((ix|lx)==0) { /* x == 0 */
66 && (((hx<<11)|(lx>>21))>(hy&0x7fffffff)
67 || (((hx<<11)|(lx>>21))==(hy&0x7fffffff)
68 && (lx<<11)>ly)))) { /* x > y, x -= ulp */
69 if(lx==0) hx -= 1;
70 lx -= 1;
72 lx
[all...]
H A Ds_fpclassifyl.c29 u_int32_t ex, hx, lx; local
32 GET_LDOUBLE_WORDS (ex, hx, lx, x);
34 if ((ex | lx | hx) == 0)
39 retval = ((hx & 0x7fffffff) | lx) != 0 ? FP_NAN : FP_INFINITE;
H A Ds_nextafterl.c40 u_int32_t lx,ly; local
43 GET_LDOUBLE_WORDS(esx,hx,lx,x);
50 if(((ix==0x7fff)&&(((hx&0x7fffffff)|lx)!=0)) || /* x is nan */
54 if((ix|hx|lx)==0) { /* x == 0 */
63 if(esx>esy||((esx==esy) && (hx>hy||((hx==hy)&&(lx>ly))))) {
65 if(lx==0) {
78 lx -= 1;
80 lx += 1;
81 if(lx==0) {
90 if(esy>=0||(esx>esy||((esx==esy)&&(hx>hy||((hx==hy)&&(lx>l
[all...]
/haiku-fatelf/src/system/libroot/posix/glibc/arch/m68k/
H A Ds_fpclassifyl.c30 u_int32_t ex, hx, lx; local
33 GET_LDOUBLE_WORDS (ex, hx, lx, x);
35 if ((ex | hx | lx) == 0)
40 retval = ((hx & 0x7fffffff) | lx) != 0 ? FP_NAN : FP_INFINITE;
H A Ds_nextafterl.c40 u_int32_t hx,hy,lx,ly; local
42 GET_LDOUBLE_WORDS(esx,hx,lx,x);
47 if(((ix==0x7fff)&&((hx&0x7fffffff)|lx)!=0) || /* x is nan */
51 if((ix|hx|lx)==0) { /* x == 0 */
57 if(esx>esy||((esx==esy) && (hx>hy||((hx==hy)&&(lx>ly))))) {
59 if(lx==0) {
64 lx -= 1;
66 lx += 1;
67 if(lx==0) {
76 if(esy>=0||esx>esy||((esx==esy) && (hx>hy||((hx==hy)&&(lx>l
[all...]
/haiku-fatelf/src/add-ons/translators/exr/openexr/ilmimf/
H A DImfTiledInputFile.h199 // isValidLevel(lx, ly) returns true if the file contains
200 // a level with level number (lx, ly), false if not.
207 bool isValidLevel (int lx, int ly) const;
213 // levelWidth(lx) returns the width of a level with level
214 // number (lx, *), where * is any number.
217 // max (1, rfunc (w / pow (2, lx)))
228 int levelWidth (int lx) const;
235 // numXTiles(lx) returns the number of tiles in x direction
236 // that cover a level with level number (lx, *), where * is
240 // (levelWidth(lx)
[all...]
H A DImfTiledOutputFile.h200 // isValidLevel(lx, ly) returns true if the file contains
201 // a level with level number (lx, ly), false if not.
208 bool isValidLevel (int lx, int ly) const;
214 // levelWidth(lx) returns the width of a level with level
215 // number (lx, *), where * is any number.
218 // max (1, rfunc (w / pow (2, lx)))
229 int levelWidth (int lx) const;
236 // numXTiles(lx) returns the number of tiles in x direction
237 // that cover a level with level number (lx, *), where * is
241 // (levelWidth(lx)
[all...]

Completed in 108 milliseconds

123