| /src/lib/libc/gdtoa/ |
| Makefile.inc | 43 ulp.c
|
| ulp.c | 1 /* $NetBSD: ulp.c,v 1.3 2011/03/20 23:15:35 christos Exp $ */
37 ulp function
|
| strtodI.c | 46 u = ulp(d);
110 dval(&u[1]) += ulp(&u[1]);
119 dval(&u[1]) = dval(&u[0]) + ulp(&u[0]);
|
| makefile | 55 strtorx.c strtorxL.c sum.c ulp.c
76 sum.c ulp.c
|
| strtod.c | 84 rv = ulp(x);
689 /* Error is less than an ulp */
731 dval(&rv) += adj*ulp(&rv);
737 dval(&rv) += adj.d*ulp(&rv);
760 dval(&adj) *= ulp(&rv);
770 dval(&adj) *= ulp(&rv);
783 /* Error is less than half an ulp -- check for
898 dval(&rv) += ulp(&rv);
905 dval(&rv) -= ulp(&rv);
966 dval(&adj) = dval(&aadj1) * ulp(&rv)
[all...] |
| gdtoaimp.h | 584 #define ulp __ulp_D2A macro
632 extern double ulp ANSI((U*));
|
| /src/external/lgpl3/mpfr/dist/src/ |
| set_z_2exp.c | 96 mp_limb_t rb, sb, ulp; local
117 ulp = 2*mask;
118 fp[0] = limb & ~(ulp-1);
131 ulp = MPFR_LIMB_ONE;
147 if (rb == 0 || MPFR_UNLIKELY (sb == 0 && (fp[0] & ulp) == 0))
167 if (MPFR_UNLIKELY (mpn_add_1 (fp, fp, fn, ulp)))
|
| /src/crypto/dist/ipsec-tools/src/racoon/ |
| policy.h | 118 #define KEY_SETSECSPIDX(_dir, s, d, ps, pd, ulp, _priority, _created, idx) \
124 (idx)->ul_proto = (ulp); \
131 #define KEY_SETSECSPIDX(_dir, s, d, ps, pd, ulp, _created, idx) \
137 (idx)->ul_proto = (ulp); \
|
| /src/external/ibm-public/postfix/dist/src/util/ |
| name_mask.c | 457 static int hex_to_ulong(char *value, unsigned long mask, unsigned long *ulp)
475 *ulp = (result & mask);
476 return (*ulp == result);
|
| /src/crypto/dist/ipsec-tools/src/libipsec/ |
| pfkey_dump.c | 702 str_prefport(u_int family, u_int pref, u_int port, u_int ulp)
725 switch (ulp) {
746 str_upperspec(u_int ulp, u_int p1, u_int p2)
750 ent = getprotobynumber((int)ulp);
752 printf("%u(%s)", ulp, ent->p_name);
754 printf("%u", ulp);
759 switch (ulp) {
|
| /src/sys/dev/pci/cxgb/ |
| cxgb_toedev.h | 113 void *ulp; /* ulp stuff */ member in struct:toedev
|
| cxgb_adapter.h | 52 #include <ulp/toecore/toedev.h>
|
| /src/common/lib/libc/rpc/ |
| xdr.c | 233 xdr_u_long(XDR *xdrs, u_long *ulp)
237 _DIAGASSERT(ulp != NULL);
241 return (XDR_PUTLONG(xdrs, (long *)ulp));
243 return (XDR_GETLONG(xdrs, (long *)ulp));
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/ |
| funcargs.c | 48 unsigned long *ulp = &ul; variable
196 void call3b (unsigned char *ucp, unsigned short *usp, unsigned int *uip, unsigned long *ulp)
198 ucp = 0; usp = 0; uip = 0; ulp = 0;
562 call3b (ucp, usp, uip, ulp);
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/ |
| funcargs.c | 48 unsigned long *ulp = &ul; variable
196 void call3b (unsigned char *ucp, unsigned short *usp, unsigned int *uip, unsigned long *ulp)
198 ucp = 0; usp = 0; uip = 0; ulp = 0;
562 call3b (ucp, usp, uip, ulp);
|
| /src/external/lgpl3/mpfr/dist/tests/ |
| mpfr-test.h | 210 int ulp (double, double);
212 double Ulp (double);
|
| tests.c | 536 /* returns ulp(x) for x a 'normal' double-precision number */
538 Ulp (double x)
546 /* as ulp(x) <= y = x/2^52 < 2*ulp(x),
547 we have x + ulp(x) <= x + y <= x + 2*ulp(x),
548 therefore o(x + y) = x + ulp(x) or x + 2*ulp(x) */
551 eps = eps - x; /* ulp(x) or 2*ulp(x) *
560 ulp (double a, double b) function
[all...] |
| /src/external/bsd/ipf/dist/tools/ |
| ipfcomp.c | 68 u_long *ulp; local
147 if (i & -(1 - sizeof(*ulp)))
149 for (i /= sizeof(u_long), ulp = (u_long *)fr; i > 0; i--) {
150 fprintf(fp, "%s%#lx", and, *ulp++);
171 u_long *ulp; local
214 ulp = fr->fr_data;
216 fprintf(fp, "%s%#lx", and, *ulp++);
|
| /src/lib/libm/arch/vax/ |
| n_cabs.S | 143 rsb # error < 0.86 ulp
|
| /src/external/gpl3/gcc/dist/libgfortran/ |
| libgfortran.h | 174 #define sym_rename1(old, ulp, new) sym_rename2(old, ulp, new)
175 #define sym_rename2(old, ulp, new) extern __typeof(old) old __asm__(#ulp #new)
|
| /src/external/gpl3/gcc.old/dist/libgfortran/ |
| libgfortran.h | 174 #define sym_rename1(old, ulp, new) sym_rename2(old, ulp, new)
175 #define sym_rename2(old, ulp, new) extern __typeof(old) old __asm__(#ulp #new)
|
| /src/sys/arch/m68k/060sp/dist/ |
| fplsp.s | 4922 # The returned result is within 1 ulp in 64 significant bit, i.e. #
4923 # within 0.5001 ulp to 53 bits if the result is subsequently #
5581 #--we want P+p = W+w but |p| <= half ulp of P
5593 #--|r| <= half ulp of R.
5627 # The returned result is within 3 ulp in 64 significant bit, i.e. #
5628 # within 0.5001 ulp to 53 bits if the result is subsequently #
6012 #--we want P+p = W+w but |p| <= half ulp of P
6024 #--|r| <= half ulp of R.
6058 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
6508 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently
[all...] |
| fpsp.s | 5028 # The returned result is within 1 ulp in 64 significant bit, i.e. #
5029 # within 0.5001 ulp to 53 bits if the result is subsequently #
5687 #--we want P+p = W+w but |p| <= half ulp of P
5699 #--|r| <= half ulp of R.
5733 # The returned result is within 3 ulp in 64 significant bit, i.e. #
5734 # within 0.5001 ulp to 53 bits if the result is subsequently #
6118 #--we want P+p = W+w but |p| <= half ulp of P
6130 #--|r| <= half ulp of R.
6164 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
6614 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently
[all...] |
