Home
last modified time | relevance | path

Searched refs:one (Results 1 – 25 of 1171) sorted by relevance

12345678910>>...47

/titanic_51/usr/src/lib/libm/common/complex/
H A Dcatanl.c111 one = 1.0L, variable
174 t = one - ay; in catanl()
175 if (ay == one) { in catanl()
179 } else if (ay > one) { /* y>1 */ in catanl()
186 } else if (ay < E * (one + ax)) { in catanl()
210 t1 = ay - one; in catanl()
217 LD_IM(ans) = t * (one - two * t); in catanl()
222 LD_RE(ans) = half * atan2l(two, (one - ax) * (one + in catanl()
223 one / a in catanl()
[all...]
H A Dcatan.c88 one = 1.0; variable
143 t = one - ay; in catan()
175 D_RE(ans) = half * atan2(two, (one - ax) * (one + in catan()
176 one / ax)); in catan()
181 t = ay / ((ay - one) * (ay - one)); in catan()
185 t = ay / (ax * ax + (ay - one) * (ay - one)); in catan()
186 D_IM(ans) = t * (one in catan()
[all...]
H A Dcasin.c169 * imag part = log(y+sqrt(y*y-one))
202 one = 1.0, variable
299 D_IM(ans) = log(x + sqrt((x - one) * (x + in casin()
300 one))); in casin()
302 xm1 = x - one; in casin()
303 D_IM(ans) = log1p(xm1 + sqrt(xm1 * (x + one))); in casin()
306 } else if (y <= E * fabs(x - one)) { /* region 2: y < tiny*|x-1| */ in casin()
309 D_IM(ans) = y / sqrt((one + x) * (one - x)); in casin()
315 D_IM(ans) = log(x + sqrt((x - one) * ( in casin()
[all...]
H A Dcasinl.c39 one = 1.0L, variable
152 LD_IM(ans) = logl(x + sqrtl((x - one) * (x + in casinl()
153 one))); in casinl()
155 xm1 = x - one; in casinl()
157 one))); in casinl()
160 } else if (y <= E * fabsl(x - one)) { /* region 2: y < tiny*|x-1| */ in casinl()
163 LD_IM(ans) = y / sqrtl((one + x) * (one - x)); in casinl()
169 LD_IM(ans) = logl(x + sqrtl((x - one) * (x + in casinl()
170 one))); in casinl()
[all...]
H A Dcacos.c169 * imag part = log(y+sqrt(y*y-one))
201 one = 1.0, variable
327 D_IM(ans) = log(x + sqrt((x - one) * (x + in cacos()
328 one))); in cacos()
330 xm1 = x - one; in cacos()
331 D_IM(ans) = log1p(xm1 + sqrt(xm1 * (x + one))); in cacos()
334 } else if (y <= E * fabs(x - one)) { /* region 2: y < tiny*|x-1| */ in cacos()
337 D_IM(ans) = y / sqrt((one + x) * (one - x)); in cacos()
342 t = sqrt((x - one) * ( in cacos()
[all...]
H A Dcacosl.c39 one = 1.0L, variable
180 LD_IM(ans) = logl(x + sqrtl((x - one) * (x + in cacosl()
181 one))); in cacosl()
183 xm1 = x - one; in cacosl()
185 one))); in cacosl()
188 } else if (y <= E * fabsl(fabsl(x) - one)) { in cacosl()
193 LD_IM(ans) = y / sqrtl((one + x) * (one - x)); in cacosl()
208 t = sqrtl((x - one) * (x + one)); in cacosl()
[all...]
/titanic_51/usr/src/uts/common/ipp/ipgpc/
H A Dtrie.c62 buf->one = NULL; in create_node()
77 * 2 the insert key specifies a shorter key than the one at the node
78 * 3 the insert key specifies a longer key than the one at the node
80 * when t_split returns, c_node->one and c_node->zero must != NULL
132 ASSERT(nodep->one == NULL); in t_split()
134 nodep->one = create_node(KM_SLEEP); in t_split()
143 if ((nodep->one == NULL) && (nodep->zero == NULL)) { in t_split()
144 nodep->one = create_node(KM_SLEEP); in t_split()
148 tnodep->one = nodep->one; in t_split()
[all...]
/titanic_51/usr/src/cmd/sendmail/libsm/
H A Dt-strl.c32 int one, two, k; variable
97 one = sm_strlcpyn(dst1, sizeof dst1, 3, src1[0], "/", src1[1]);
99 SM_TEST(one == two);
101 one = sm_strlcpyn(dst1, 10, 3, src1[0], "/", src1[1]);
103 SM_TEST(one == two);
105 one = sm_strlcpyn(dst1, 5, 3, src1[0], "/", src1[1]);
107 SM_TEST(one == two);
109 one = sm_strlcpyn(dst1, 0, 3, src1[0], "/", src1[1]);
111 SM_TEST(one == two);
113 one
[all...]
/titanic_51/usr/src/lib/fm/libdiagcode/common/tests/
H A DSAMPLE0.dict35 # here's a worked by hand example for key: "fault.one fault.two"
58 fault.one fault.three fault.two=2 "this is all three faults"
59 fault.one fault.three=1
60 fault.one=7
62 fault.one fault.two=5
72 #TEST:key2code:0:fault.two fault.one:SAMPLE0-8000-5V
73 #TEST:key2code:0:fault.one fault.two:SAMPLE0-8000-5V
74 #TEST:key2code:0:fault.one fault.two fault.one:SAMPLE0-8000-5V
75 #TEST:key2code:0:fault.one faul
[all...]
/titanic_51/usr/src/lib/libm/common/LD/
H A Derfl.c48 * guarantee the error less than one ulp where x is not too far
105 one = 1.0L, variable
284 return copysignl(one,x); /* return +-1.0 is x=Inf */
295 s = y-one;
296 t = C1+__poly_libmq(s,12,P1)/(one+s*__poly_libmq(s,12,Q1));
300 t = C2+__poly_libmq(s,12,P2)/(one+s*__poly_libmq(s,13,Q2));
304 return (signbitl(x))? t-one: one-t;
320 if (x<=0.25) return one-erfl(x);
327 s = x-one;
[all...]
/titanic_51/usr/src/lib/libm/common/Q/
H A Derfl.c49 * guarantee the error less than one ulp where x is not too far
106 one = 1.0L, variable
285 return copysignl(one,x); /* return +-1.0 is x=Inf */
296 s = y-one;
297 t = C1+__poly_libmq(s,12,P1)/(one+s*__poly_libmq(s,12,Q1));
301 t = C2+__poly_libmq(s,12,P2)/(one+s*__poly_libmq(s,13,Q2));
305 return (signbitl(x))? t-one: one-t;
320 if (x<=0.25) return one-erfl(x);
327 s = x-one;
[all...]
H A Dacosl.c51 static const long double zero = 0.0L, one = 1.0L; variable
57 else if (fabsl(x) < one) in acosl()
58 x = atanl(sqrtl((one - x) / (one + x))); in acosl()
59 else if (x == -one) in acosl()
60 x = atan2l(one, zero); /* x <- PI */ in acosl()
61 else if (x == one) in acosl()
H A Dpowl.c42 static const long double zero = 0.0L, one = 1.0L, two = 2.0L; variable
76 f = x - one; in logl_x()
82 qn = one / (two + f); in logl_x()
106 qn = one / (x + z); in logl_x()
151 return (one); /* x**+-0 = 1 */ in powl()
154 return (one); /* C99: 1**anything = 1 */ in powl()
199 return (one); in powl()
211 return (one / x); in powl()
229 z = one / z; /* z = 1/|x| if y is negative */ in powl()
262 return (one / in powl()
[all...]
H A Datanl.c84 one = 1.0L, variable
125 s = one; in atanl()
150 r = one / x; in atanl()
155 y = r * (one + z * (p1 + z * (p2 + z * (p3 + in atanl()
161 r = one / x; in atanl()
166 y = r * (one + z * (q1 + z * (q2 + z * (q3 + z * (q4 + in atanl()
170 y = one / x - pio2lo; in atanl()
193 s = (x - y) / (one + x * y); in atanl()
195 s = (y - x) / (one + x * y); in atanl()
198 p = s * (one in atanl()
[all...]
/titanic_51/usr/src/lib/libm/common/C/
H A Derf.c63 * is close to one. The interval is chosen because the fix
66 * guarantee the error is less than one ulp for erf.
136 /* one */ 1.00000000000000000000e+00, /* 3FF00000, 00000000 */
210 #define one xxx[2] macro
294 return ((double) (1 - i) + one / x); /* erf(+-inf)=+-1 */ in erf()
305 s = one + in erf()
311 s = fabs(x) - one; in erf()
314 Q = one + s * (qa1 + s * (qa2 + s * (qa3 + s * (qa4 + in erf()
323 return (one - tiny); in erf()
325 return (tiny - one); in erf()
[all...]
/titanic_51/usr/src/lib/libmvec/common/
H A D__vcosf.c79 #define one C[3] macro
96 y[index] = one; \
116 f##N = (float)(one + z##N * (mhalf + z##N * \
135 f##N = (float)(one + z##N * (mhalf + z##N * (C0 + \
218 f0 = (float)(one + z0 * (mhalf + z0 * (C0 + in __vcosf()
227 f1 = (float)(one + z1 * (mhalf + z1 * (C0 + in __vcosf()
234 f0 = (float)(one + z0 * (mhalf + z0 * (C0 + in __vcosf()
236 f1 = (float)(one + z1 * (mhalf + z1 * (C0 + in __vcosf()
245 f2 = (float)(one + z2 * (mhalf + z2 * (C0 + in __vcosf()
251 f0 = (float)(one in __vcosf()
[all...]
H A D__vsinf.c79 #define one C[3] macro
120 f##N = (float)(one + z##N * (mhalf + z##N * \
139 f##N = (float)(one + z##N * (mhalf + z##N * (C0 + \
222 f0 = (float)(one + z0 * (mhalf + z0 * (C0 + in __vsinf()
231 f1 = (float)(one + z1 * (mhalf + z1 * (C0 + in __vsinf()
238 f0 = (float)(one + z0 * (mhalf + z0 * (C0 + in __vsinf()
240 f1 = (float)(one + z1 * (mhalf + z1 * (C0 + in __vsinf()
249 f2 = (float)(one + z2 * (mhalf + z2 * (C0 + in __vsinf()
255 f0 = (float)(one + z0 * (mhalf + z0 * (C0 + in __vsinf()
258 f2 = (float)(one in __vsinf()
[all...]
/titanic_51/usr/src/lib/libast/common/uwin/
H A Derf.c170 one = 1.0, variable
276 return (x > 0 ? one : -one); /* erf(+/-inf)= +/-1 */
292 s = fabs(x)-one;
294 Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6)))));
302 return (one-tiny);
304 return (tiny-one);
308 s = -one/z;
312 S = one+s*(sc1+s*(sc2+s*sc3));
316 S = one+s*(sb1+s*(sb2+s*sb3));
322 return (one-z);
[all …]
H A Dexpm1.c115 const static double one=1.0, half=1.0/2.0; variable
147 { x=one-scalb(one,-k); z += __exp__E(z,c);}
149 { x = __exp__E(z,c)-scalb(one,-k); x+=z; z=one;}
151 { x = __exp__E(z,c)+z; z=one;}
161 { ln2hi+ln2lo; return(-one);}
164 else return(-one);
170 return( finite(x) ? scalb(one,5000) : x);
H A Dgamma.c131 static const double zero = 0., one = 1.0, tiny = 1e-300; variable
150 endian = (*(int *) &one) ? 1 : 0;
154 return(one/zero);
164 else return (one/x);
165 one+1e-20; /* Raise inexact flag. */
166 return (one/x);
185 z = one/(x*x);
190 u.a -= one;
213 y = x - one;
214 ym1 = y - one;
[all …]
/titanic_51/usr/src/contrib/ast/src/lib/libast/uwin/
H A Derf.c87 * is close to one. The interval is chosen because the fixed
90 * guarantee the error is less than one ulp for erf.
170 one = 1.0, variable
276 return (x > 0 ? one : -one); /* erf(+/-inf)= +/-1 */
292 s = fabs(x)-one;
294 Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6)))));
302 return (one-tiny);
304 return (tiny-one);
308 s = -one/
[all...]
H A Dexpm1.c115 const static double one=1.0, half=1.0/2.0; variable
147 { x=one-scalb(one,-k); z += __exp__E(z,c);}
149 { x = __exp__E(z,c)-scalb(one,-k); x+=z; z=one;}
151 { x = __exp__E(z,c)+z; z=one;}
161 { ln2hi+ln2lo; return(-one);}
164 else return(-one);
170 return( finite(x) ? scalb(one,5000) : x);
/titanic_51/usr/src/cmd/dtrace/test/tst/common/types/
H A Dtst.relenum.d41 one, enumerator
52 /zero >= one || second <= first || zero == second/
55 printf("zero = %d; one = %d; two = %d", zero, one, two);
61 /second < one || two > second || null == first/
64 printf("zero = %d; one = %d; two = %d", zero, one, two);
70 /first < two && second > one && one != two && zero != first/
/titanic_51/usr/src/cmd/svc/shell/
H A Dnet_include.sh245 done < "$file" | while read one two; do
247 [ "$one" = "$keyword" ] && echo "$one $two"
267 # The last setting of the group is the one that counts, which is
318 # true if one should enable the use of DHCP client-side host name
376 while read one rest; do
391 [ "$one" = ipmp ] && one=
392 ifcmds="$one $rest"
403 # The traditional one
[all...]
/titanic_51/usr/src/lib/libm/common/R/
H A Datanf.c91 one = 1.0F, variable
138 r = one / x; in atanf()
140 y = r * (one + z * (p1 + z * p2)); /* poly1 */ in atanf()
143 r = one / x; in atanf()
145 y = r * (one + z * q1); /* poly2 */ in atanf()
148 y = one / x - pio2lo; in atanf()
182 s = (x - y) / (one + x * y); in atanf()
184 s = (y - x) / (one + x * y); in atanf()
186 p = s * (one + z * q1); in atanf()

12345678910>>...47