/linux-master/arch/m68k/fpsp040/ |
H A D | bindec.S | 44 | LEN is the number of digits to be displayed. The 45 | k-factor can dictate either the total number of digits, 46 | if it is a positive number, or the number of digits 54 | of decimal places needed to insure LEN integer digits 69 | significant digits. The excess digits are collected 85 | A13. Check for LEN digits. 86 | If the int operation results in more than LEN digits, 87 | or less than LEN -1 digits, adjust ILOG and repeat from 97 | The bcd digits ar [all...] |
H A D | binstr.S | 12 | Output: LEN bcd digits representing the 64-bit integer. 19 | LEN digits are formed. 121 clrw %d7 |set d7a to signal no digits done
|
H A D | decbin.S | 27 | digits, rather than 1 integer and 16 fraction digits. 32 | The mantissa digits will be converted with the decimal point 127 | 4. Subtract 16 to compensate for interpreting the mant as all integer digits. 128 | (i.e., all digits assumed left of the decimal point.) 144 movel #EDIGITS,%d2 |# of nibbles (digits) in fraction part 145 moveql #ESTRT,%d3 |counter to pick up digits 157 dbf %d2,e_gd |if we have used all 3 digits, exit loop 174 | (i.e., all digits assumed left of the decimal point.) 207 moveql #FSTRT,%d3 |counter to pick up digits [all...] |
/linux-master/arch/m68k/ifpsp060/src/ |
H A D | fpsp.S | 2099 # OPERR : if ((k_factor > +17) || (dec. exp exceeds 3 digits)) 23011 # digits, rather than 1 integer and 16 fraction digits. # 23016 # The mantissa digits will be converted with the decimal point # 23085 # 4. Subtract 16 to compensate for interpreting the mant as all integer digits. 23086 # (i.e., all digits assumed left of the decimal point.) 23102 mov.l &EDIGITS,%d2 # # of nibbles (digits) in fraction part 23103 mov.l &ESTRT,%d3 # counter to pick up digits 23111 dbf.w %d2,e_gd # if we have used all 3 digits, exit loop 23128 # (i.e., all digits assume [all...] |
H A D | ilsp.S | 328 clr.b DDSECOND(%a6) # clear flag for quotient digits 402 # need to add back divisor longword to current ms 3 digits of dividend
|
H A D | pfpsp.S | 2098 # OPERR : if ((k_factor > +17) || (dec. exp exceeds 3 digits)) 12971 # digits, rather than 1 integer and 16 fraction digits. # 12976 # The mantissa digits will be converted with the decimal point # 13045 # 4. Subtract 16 to compensate for interpreting the mant as all integer digits. 13046 # (i.e., all digits assumed left of the decimal point.) 13062 mov.l &EDIGITS,%d2 # # of nibbles (digits) in fraction part 13063 mov.l &ESTRT,%d3 # counter to pick up digits 13071 dbf.w %d2,e_gd # if we have used all 3 digits, exit loop 13088 # (i.e., all digits assume [all...] |
/linux-master/arch/powerpc/boot/ |
H A D | stdio.c | 82 const char *digits="0123456789abcdefghijklmnopqrstuvwxyz"; local 86 digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; 116 tmp[i++] = digits[do_div(num, base)]; 131 *str++ = digits[33]; 157 int precision; /* min. # of digits for integers; max
|
/linux-master/arch/x86/boot/ |
H A D | printf.c | 45 static const char digits[16] = "0123456789ABCDEF"; /* "GHIJKLMNOPQRSTUVWXYZ"; */ local 51 /* locase = 0 or 0x20. ORing digits or letters with 'locase' 52 * produces same digits or (maybe lowercased) letters */ 84 tmp[i++] = (digits[__do_div(num, base)] | locase); 124 int precision; /* min. # of digits for integers; max
|
/linux-master/drivers/isdn/mISDN/ |
H A D | dsp_dtmf.c | 130 dsp->dtmf.digits[0] = '\0'; 155 return dsp->dtmf.digits; 179 return dsp->dtmf.digits; 298 if ((strlen(dsp->dtmf.digits) + 1) 299 < sizeof(dsp->dtmf.digits)) { 300 dsp->dtmf.digits[strlen( 301 dsp->dtmf.digits) + 1] = '\0'; 302 dsp->dtmf.digits[strlen( 303 dsp->dtmf.digits)] = what;
|
H A D | dsp.h | 130 u8 digits[16]; /* dtmf result */ member in struct:dsp_dtmf
|
H A D | dsp_core.c | 669 u8 *digits = NULL; local 726 digits = dsp_dtmf_goertzel_decode(dsp, skb->data, 738 if (digits) { 739 while (*digits) { 745 __func__, *digits, dsp->name); 746 k = *digits | DTMF_TONE_VAL; 758 digits++; 783 digits = dsp_dtmf_goertzel_decode(dsp, skb->data, 785 while (*digits) { 791 __func__, *digits, ds [all...] |
/linux-master/arch/alpha/boot/ |
H A D | stdio.c | 46 const char *digits = "0123456789abcdefghijklmnopqrstuvwxyz"; local 50 digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; 80 tmp[i++] = digits[do_div(num, base)]; 95 *str++ = digits[33]; 121 int precision; /* min. # of digits for integers; max
|
/linux-master/arch/powerpc/kernel/ |
H A D | prom_init.c | 480 /* max number of decimal digits in an unsigned long */ 683 static const char digits[] __initconst = "0123456789abcdef"; 691 result[i] = digits[x & 0xf];
|
/linux-master/crypto/ |
H A D | ecdsa.c | 226 const u64 *digits = (const u64 *)&d[1]; local 245 ecc_swap_digits(digits, ctx->pub_key.x, ndigits); 246 ecc_swap_digits(&digits[ndigits], ctx->pub_key.y, ndigits);
|
/linux-master/drivers/acpi/acpica/ |
H A D | utprint.c | 95 * upper - Whether or not using upper cased digits 106 const char *digits; local 111 digits = upper ? acpi_gbl_upper_hex_digits : acpi_gbl_lower_hex_digits; 119 *(pos++) = digits[digit_index];
|
/linux-master/drivers/firmware/efi/libstub/ |
H A D | vsprintf.c | 116 * locase = 0 or 0x20. ORing digits or letters with 'locase' 117 * produces same digits or (maybe lowercased) letters 121 static const char digits[16] = "0123456789ABCDEF"; /* "GHIJKLMNOPQRSTUVWXYZ"; */ local 134 *--end = digits[num & 0xf] | locase; 315 int precision; /* min. # of digits for integers; max 458 /* precision is minimum number of digits to print */
|
/linux-master/drivers/watchdog/ |
H A D | octeon-wdt-main.c | 172 * @digits: Number of digits to print (1 to 16) 174 static void octeon_wdt_write_hex(u64 value, int digits) argument 179 for (d = 0; d < digits; d++) { 180 v = (value >> ((digits - d - 1) * 4)) & 0xf;
|
/linux-master/lib/ |
H A D | vsprintf.c | 181 * the digits one at a time. Implementation strongly inspired by the 449 signed int precision:16; /* # of digits/chars */ 470 /* locase = 0 or 0x20. ORing digits or letters with 'locase' 471 * produces same digits or (maybe lowercased) letters */ 561 /* actual digits of result */ 1340 int digits = put_dec_trunc8(temp, addr[index]) - temp; local 1342 if (digits < 3) 1344 if (digits < 2) 1347 /* reverse the digits in the quad */ 1348 while (digits [all...] |
/linux-master/net/wireless/ |
H A D | core.c | 96 int wiphy_idx, taken = -1, digits; local 107 digits = 1; 109 digits++; 114 if (taken == strlen(PHY_NAME) + digits)
|
/linux-master/tools/include/nolibc/ |
H A D | stdlib.h | 205 int digits = 0; local 212 if (dig || digits || pos < 0) { 215 buffer[digits++] = '0' + dig; 219 buffer[digits] = 0; 220 return digits; 245 int digits = 0; local 253 if (digits || in >= lim || !pos) { 256 buffer[digits++] = '0' + dig; 260 buffer[digits] = 0; 261 return digits; 337 int digits = 0; local 381 int digits = 0; local [all...] |
/linux-master/tools/testing/selftests/kvm/lib/ |
H A D | guest_sprintf.c | 47 static const char digits[16] = "0123456789ABCDEF"; /* "GHIJKLMNOPQRSTUVWXYZ"; */ local 54 * locase = 0 or 0x20. ORing digits or letters with 'locase' 55 * produces same digits or (maybe lowercased) letters 88 tmp[i++] = (digits[__do_div(num, base)] | locase); 130 * min. # of digits for integers; max
|
/linux-master/tools/testing/selftests/net/openvswitch/ |
H A D | ovs-dpctl.py | 116 digits = flag_str[:idx] 119 bitResult = int(digits, 0) 120 maskResult = int(digits, 0)
|