Searched refs:one (Results 276 - 300 of 523) sorted by relevance

<<11121314151617181920>>

/illumos-gate/usr/src/cmd/dtrace/test/tst/common/usdt/
H A Dtst.user.ksh29 echo expected one argument: '<'dtrace-path'>'
/illumos-gate/usr/src/cmd/dtrace/test/tst/i86xpv/xdt/
H A Dtst.schedargs.ksh32 echo expected one argument: '<'dtrace-path'>'
H A Dtst.schedenable.ksh34 echo expected one argument: '<'dtrace-path'>'
/illumos-gate/usr/src/lib/libast/common/uwin/
H A Dlog.c87 #define endian (((*(int *) &one)) ? 1 : 0)
382 double F, f, g, q, u, u2, v, zero = 0.0, one = 1.0; local
388 return (-one/zero);
459 double F, f, g, q, u, v, u2, one = 1.0; local
/illumos-gate/usr/src/lib/libm/common/C/
H A Dscalbn.c34 one = 1.0, variable
85 return (x * one);
H A Dj0.c52 one = 1.0, variable
117 * to compute the worse one.
146 return (one-x);
148 return (one-x*x*0.25);
154 return (one + z*(r/s));
196 /* d= -one/(x-x); */
217 * to compute the worse one.
277 return (one);
/illumos-gate/usr/src/lib/libm/common/Q/
H A Datan2l.c67 one = 1.0L, variable
84 if (x == one)
H A Djnl.c68 one = 1.0L; variable
135 for (a = one, i = 1; i <= n; i++) a *= (GENERIC)i;
180 for (t = zero, i = 2*(n+k); i >= m; i -= 2) t = one/(i/x-t);
182 b = one;
232 return (-one/zero);
H A Dlog1pl.c71 * For x>=1, compute 1+x will lost one bit (OK).
74 * in 1+x. Therefore, to recover the lost bits, one need to compute
120 one = 1.0L, variable
170 y = one + x;
200 z = two * (one - g);
/illumos-gate/usr/src/lib/libmvec/common/
H A D__vsincosf.c79 #define one C[3] macro
97 c[cindex] = one; \
122 g##N = (float)(one + z##N * (mhalf + z##N * (C0 + \
147 g##N = (float)(one + z##N * (mhalf + z##N * (C0 + z##N * \
235 g0 = (float)(one + z0 * (mhalf + z0 * (C0 + z0 *
237 g1 = (float)(one + z1 * (mhalf + z1 * (C0 + z1 *
239 g2 = (float)(one + z2 * (mhalf + z2 * (C0 + z2 *
241 g3 = (float)(one + z3 * (mhalf + z3 * (C0 + z3 *
H A D__vcos.c63 one = 1.0, variable
225 w0 = x0 * (one + z0 * (pp1 + z0 * pp2));
226 w1 = x1 * (one + z1 * (pp1 + z1 * pp2));
227 w2 = x2 * (one + z2 * (pp1 + z2 * pp2));
263 w1 = x1 * (one + z1 * (pp1 + z1 * pp2));
264 w2 = x2 * (one + z2 * (pp1 + z2 * pp2));
273 *py0 = one + t0;
293 w0 = x0 * (one + z0 * (pp1 + z0 * pp2));
295 w2 = x2 * (one + z2 * (pp1 + z2 * pp2));
305 *py1 = one
[all...]
H A D__vatan2f.c45 one = 1.0f, variable
73 sign0 = one;
133 *z = (sign0 == one) ? ah0 : -ah0;
187 sign1 = one;
247 *z = (sign1 == one)? ah1 : -ah1;
299 sign2 = one;
359 *z = (sign2 == one)? ah2 : -ah2;
H A D__vsincosbig.c51 one = 1.0, variable
126 c = one + t;
137 w = ty[0] * (one + z * (pp1 + z * pp2));
H A D__vsincosbigf.c51 one = 1.0, variable
122 c = one + t;
134 w = ty[0] * (one + z * (pp1 + z * pp2));
/illumos-gate/usr/src/grub/grub-0.97/util/
H A Dgrub-set-default.in62 echo "More than one entries?" 1>&2
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/uctf/
H A Dtst.printtype.ksh23 echo expected one argument: '<'dtrace-path'>'
H A Dtst.userstrings.ksh24 echo expected one argument: '<'dtrace-path'>'
/illumos-gate/usr/src/lib/libm/common/R/
H A Dpowf.c123 static const float zero = 0.0F, one = 1.0F, huge = 1.0e25f, tiny = 1.0e-25f; variable
138 return (one); /* x**+-0 = 1 */
140 return (one); /* C99: 1**anything = 1 */
142 return (fx * fy); /* at least one of x or y is NaN */
169 fz = one;
189 fx = one / fx; /* y is -1 */
205 fz = one / fz;
/illumos-gate/usr/src/lib/libm/common/m9x/
H A Dtgamma.c39 * Less that one ulp for both positive and negative arguments.
519 * By checking whether lgamma(x) >= 2**{128,1024,16384}, one can
600 * in [1, 2]. Let z(j) be the closest one to y, then
791 #define one c[0] macro
1255 r = one / t1;
1278 z = one / x;
1310 zz.l = S_trail[j] * (one + t3) + S[j] * t3;
1433 r1 = one / x;
1444 z = x + one; /* may not be exact */
1447 rr.l = z * yy.l + (x - (zh - one)) * y
[all...]
/illumos-gate/usr/src/uts/common/sys/nxge/
H A Dnxge_sr_hw.h180 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
203 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
281 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
325 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
368 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
412 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
435 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
478 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
511 #error one of _BIT_FIELDS_HTOL or _BIT_FIELDS_LTOH must be defined
532 #error one o
[all...]
/illumos-gate/usr/src/lib/libm/common/LD/
H A Djnl.c68 one = 1.0L; variable
132 for (a = one, i = 1; i <= n; i++) a *= (GENERIC)i;
177 for (t = zero, i = 2*(n+k); i >= m; i -= 2) t = one/(i/x-t);
179 b = one;
229 return -one/zero;
/illumos-gate/usr/src/lib/libm/common/complex/
H A Dk_cexpl.c226 one = 1.0L, variable
251 return (-one / x); /* NaN or -inf */
253 return (one + x); /* |x|<2^-60 */
257 return (one);
263 return (one);
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/mech/
H A Dutil_validate.c57 static const int one = 1; variable
58 static const DBT dbtone = { (void *) &one, sizeof(one) };
171 return((value.size == sizeof(one)) &&
172 (*((int *) value.data) == one));
/illumos-gate/usr/src/lib/krb5/kadm5/srv/
H A Dserver_kdb.c363 int one; local
391 one = 1;
393 ret = krb5_db_put_principal(handle->context, kdb, &one);
403 int one = 1; local
406 ret = krb5_db_delete_principal(handle->context, name, &one);
/illumos-gate/usr/src/lib/libast/common/vmalloc/
H A Dvmprofile.c256 reg Pfobj_t *one, *two, *next; local
263 one = two = NIL(Pfobj_t*);
266 pf->next = one;
267 one = pf;
278 one = pfsort(one);
282 if(PFLINE(one) == 0 && PFLINE(two) == 0)
283 cmp = PFVM(one) > PFVM(two) ? 1 : -1;
284 else if(PFLINE(one) == 0)
288 else if((cmp = strcmp(PFFILE(one),PFFIL
[all...]

Completed in 194 milliseconds

<<11121314151617181920>>