/linux-master/arch/mips/math-emu/ |
H A D | sp_fint.c | 14 unsigned int xm; local 30 xm = ((unsigned) 1 << 31); /* max neg can't be safely negated */ 32 xm = -x; 34 xm = x; 38 if (xm >> (SP_FBITS + 1 + 3)) { 41 while (xm >> (SP_FBITS + 1 + 3)) { 47 while ((xm >> (SP_FBITS + 3)) == 0) { 48 xm <<= 1; 52 return ieee754sp_format(xs, xe, xm);
|
H A D | dp_fint.c | 14 u64 xm; local 30 xm = ((unsigned) 1 << 31); /* max neg can't be safely negated */ 32 xm = -x; 34 xm = x; 39 while ((xm >> DP_FBITS) == 0) { 40 xm <<= 1; 43 return builddp(xs, xe + DP_EBIAS, xm & ~DP_HIDDEN_BIT);
|
H A D | dp_flong.c | 14 u64 xm; local 30 xm = (1ULL << 63); /* max neg can't be safely negated */ 32 xm = -x; 34 xm = x; 39 if (xm >> (DP_FBITS + 1 + 3)) { 41 while (xm >> (DP_FBITS + 1 + 3)) { 46 while ((xm >> (DP_FBITS + 3)) == 0) { 47 xm <<= 1; 52 return ieee754dp_format(xs, xe, xm);
|
H A D | sp_flong.c | 14 u64 xm; /* <--- need 64-bit mantissa temp */ local 30 xm = (1ULL << 63); /* max neg can't be safely negated */ 32 xm = -x; 34 xm = x; 38 if (xm >> (SP_FBITS + 1 + 3)) { 41 while (xm >> (SP_FBITS + 1 + 3)) { 46 while ((xm >> (SP_FBITS + 3)) == 0) { 47 xm <<= 1; 51 return ieee754sp_format(xs, xe, xm);
|
H A D | dp_fsp.c | 13 static inline union ieee754dp ieee754dp_nan_fsp(int xs, u64 xm) argument 16 xm << (DP_FBITS - SP_FBITS)); 31 return ieee754dp_nanxcpt(ieee754dp_nan_fsp(xs, xm)); 34 return ieee754dp_nan_fsp(xs, xm); 44 while ((xm >> SP_FBITS) == 0) { 45 xm <<= 1; 59 xm &= ~SP_HIDDEN_BIT; 62 (u64) xm << (DP_FBITS - SP_FBITS));
|
H A D | ieee754sp.c | 56 static unsigned int ieee754sp_get_rounding(int sn, unsigned int xm) argument 60 if (xm & (SP_MBIT(3) - 1)) { 65 xm += 0x3 + ((xm >> 3) & 1); 66 /* xm += (xm&0x8)?0x4:0x3 */ 70 xm += 0x8; 74 xm += 0x8; 78 return xm; 85 * xm i 87 ieee754sp_format(int sn, int xe, unsigned int xm) argument [all...] |
H A D | ieee754dp.c | 56 static u64 ieee754dp_get_rounding(int sn, u64 xm) argument 60 if (xm & (DP_MBIT(3) - 1)) { 65 xm += 0x3 + ((xm >> 3) & 1); 66 /* xm += (xm&0x8)?0x4:0x3 */ 70 xm += 0x8; 74 xm += 0x8; 78 return xm; 85 * xm i 87 ieee754dp_format(int sn, int xe, u64 xm) argument [all...] |
H A D | dp_rint.c | 41 residue = xm; 44 xm = 0; 46 residue = xm << (64 - DP_FBITS + xe); 49 xm >>= DP_FBITS - xe; 52 odd = (xm & 0x1) != 0x0; 57 xm++; 63 xm++; 67 xm++; 74 ret = ieee754dp_flong(xm);
|
H A D | sp_rint.c | 41 residue = xm; 44 xm = 0; 46 residue = xm << (xe + 1); 50 xm >>= SP_FBITS - xe; 53 odd = (xm & 0x1) != 0x0; 58 xm++; 64 xm++; 68 xm++; 75 ret = ieee754sp_flong(xm);
|
H A D | dp_tlong.c | 45 if (xe == 63 && xs && xm == DP_HIDDEN_BIT) 54 xm <<= xe - DP_FBITS; 57 residue = xm; 60 xm = 0; 65 residue = xm << (xe + 1); 69 xm >>= DP_FBITS - xe; 71 odd = (xm & 0x1) != 0x0; 75 xm++; 81 xm++; 85 xm [all...] |
H A D | dp_tint.c | 51 xm <<= xe - DP_FBITS; 54 residue = xm; 57 xm = 0; 59 residue = xm << (64 - DP_FBITS + xe); 62 xm >>= DP_FBITS - xe; 64 /* Note: At this point upper 32 bits of xm are guaranteed 66 odd = (xm & 0x1) != 0x0; 70 xm++; 76 xm++; 80 xm [all...] |
H A D | sp_tlong.c | 45 if (xe == 63 && xs && xm == SP_HIDDEN_BIT) 54 xm <<= xe - SP_FBITS; 57 residue = xm; 60 xm = 0; 62 residue = xm << (32 - SP_FBITS + xe); 65 xm >>= SP_FBITS - xe; 67 odd = (xm & 0x1) != 0x0; 71 xm++; 77 xm++; 81 xm [all...] |
H A D | sp_tint.c | 45 if (xe == 31 && xs && xm == SP_HIDDEN_BIT) 54 xm <<= xe - SP_FBITS; 57 residue = xm; 60 xm = 0; 65 residue = xm << (xe + 1); 69 xm >>= SP_FBITS - xe; 71 odd = (xm & 0x1) != 0x0; 75 xm++; 81 xm++; 85 xm [all...] |
H A D | dp_sub.c | 104 /* normalize xm,xe */ 114 assert(xm & DP_HIDDEN_BIT); 119 xm <<= 3; 134 xm = XDPSRS(xm, s); 143 xm = xm + ym; 145 if (xm >> (DP_FBITS + 1 + 3)) { /* carry out */ 146 xm = XDPSRS1(xm); /* shif [all...] |
H A D | dp_add.c | 107 assert(xm & DP_HIDDEN_BIT); 113 xm <<= 3; 128 xm = XDPSRS(xm, s); 137 * leaving result in xm, xs and xe. 139 xm = xm + ym; 141 if (xm >> (DP_FBITS + 1 + 3)) { /* carry out */ 142 xm = XDPSRS1(xm); [all...] |
H A D | sp_sub.c | 112 assert(xm & SP_HIDDEN_BIT); 117 xm <<= 3; 132 xm = XSPSRS(xm, s); 141 xm = xm + ym; 143 if (xm >> (SP_FBITS + 1 + 3)) { /* carry out */ 147 if (xm >= ym) { 148 xm = xm [all...] |
H A D | sp_add.c | 107 assert(xm & SP_HIDDEN_BIT); 113 xm <<= 3; 128 xm = XSPSRS(xm, s); 137 * leaving result in xm, xs and xe. 139 xm = xm + ym; 141 if (xm >> (SP_FBITS + 1 + 3)) { /* carry out */ 145 if (xm >= ym) { 146 xm [all...] |
H A D | sp_fdp.c | 13 static inline union ieee754sp ieee754sp_nan_fdp(int xs, u64 xm) argument 16 xm >> (DP_FBITS - SP_FBITS)); 39 y = ieee754sp_nan_fdp(xs, xm); 69 rm = (xm >> (DP_FBITS - (SP_FBITS + 3))) | 70 ((xm << (64 - (DP_FBITS - (SP_FBITS + 3)))) != 0);
|
H A D | ieee754dp.h | 41 (xe++, (xm = (xm >> 1) | (xm & 1))) 52 #define DPDNORMX DPDNORMx(xm, xe)
|
H A D | sp_div.c | 106 assert(xm & SP_HIDDEN_BIT); 110 xm <<= 3; 119 if (xm >= ym) { 120 xm -= ym; 122 if (xm == 0) 125 xm <<= 1; 129 if (xm)
|
H A D | dp_div.c | 106 assert(xm & DP_HIDDEN_BIT); 110 xm <<= 3; 119 if (xm >= ym) { 120 xm -= ym; 122 if (xm == 0) 125 xm <<= 1; 129 if (xm)
|
H A D | ieee754sp.h | 48 (xe++, (xm = XSPSRS1(xm))) 56 #define SPDNORMX SPDNORMx(xm, xe)
|
H A D | ieee754int.h | 46 unsigned int xm; int xe; int xs __maybe_unused; int xc 78 #define EXPLODEXSP EXPLODESP(x, xc, xs, xe, xm) 84 u64 xm; int xe; int xs __maybe_unused; int xc 116 #define EXPLODEXDP EXPLODEDP(x, xc, xs, xe, xm) 142 #define FLUSHXDP FLUSHDP(x, xc, xs, xe, xm) 145 #define FLUSHXSP FLUSHSP(x, xc, xs, xe, xm)
|
H A D | sp_mul.c | 104 /* rm = xm * ym, re = xe+ye basically */ 105 assert(xm & SP_HIDDEN_BIT); 112 xm <<= 32 - (SP_FBITS + 1); 116 * Multiply 32 bits xm, ym to give high 32 bits rm with stickness. 118 lxm = xm & 0xffff; 119 hxm = xm >> 16;
|
/linux-master/tools/perf/arch/x86/util/ |
H A D | machine.c | 91 struct extra_kernel_map *xm = &mi.maps[i]; local 93 xm->pgoff = mi.entry_trampoline; 94 ret = machine__create_extra_kernel_map(machine, kernel, xm);
|