| /src/sys/arch/mips/mips/ |
| mips_fputrap.c | 84 unsigned int bit; member in struct:__anon1679
99 if (fpustat & fpecodes[i].bit)
|
| mips_fputrap.c | 84 unsigned int bit; member in struct:__anon1679
99 if (fpustat & fpecodes[i].bit)
|
| /src/sys/external/bsd/gnu-efi/dist/lib/ia32/ |
| math.c | 45 // Left shift 64bit by 32bit and get a 64bit result
80 // Right shift 64bit by 32bit and get a 64bit result
116 // Multiple 64bit by 32bit and get a 64bit result
142 // divide 64bit by 32bit and get a 64bit resul
151 UINT32 bit; local
[all...] |
| math.c | 45 // Left shift 64bit by 32bit and get a 64bit result
80 // Right shift 64bit by 32bit and get a 64bit result
116 // Multiple 64bit by 32bit and get a 64bit result
142 // divide 64bit by 32bit and get a 64bit resul
151 UINT32 bit; local
[all...] |
| /src/games/bcd/ |
| bcd.c | 57 * the patterns were that the old bcd was using for each possible 8-bit
59 * holes. (A 1 bit is a hole.) These may be wrong, but they match the old
123 * i'th bit of w.
125 #define bit(w,i) ((w)&(1<<(i))) macro
196 * like a hole, if the appropriate bit is set in the holes[] table.
203 if (bit(holes[(unsigned char)*p], 11 - row))
|
| bcd.c | 57 * the patterns were that the old bcd was using for each possible 8-bit
59 * holes. (A 1 bit is a hole.) These may be wrong, but they match the old
123 * i'th bit of w.
125 #define bit(w,i) ((w)&(1<<(i))) macro
196 * like a hole, if the appropriate bit is set in the holes[] table.
203 if (bit(holes[(unsigned char)*p], 11 - row))
|
| /src/lib/libc/quad/ |
| floatunditf_ieee754.c | 74 unsigned int bit = 0; local
87 bit += width;
91 x <<= (bit + 1);
93 extu.extu_exp = EXT_EXP_BIAS + (64 - (bit + 1));
|
| floatunditf_ieee754.c | 74 unsigned int bit = 0; local
87 bit += width;
91 x <<= (bit + 1);
93 extu.extu_exp = EXT_EXP_BIAS + (64 - (bit + 1));
|
| /src/sys/arch/mips/rmi/ |
| rmixl_mainbus.c | 112 uint64_t bit; local
116 bit = 1 << node;
117 if ((sc->sc_node_mask & bit) == 0) {
118 sc->sc_node_mask |= bit;
129 bit = 1 << node;
130 if ((sc->sc_node_mask & bit) == 0) {
131 sc->sc_node_mask |= bit;
|
| rmixl_mainbus.c | 112 uint64_t bit; local
116 bit = 1 << node;
117 if ((sc->sc_node_mask & bit) == 0) {
118 sc->sc_node_mask |= bit;
129 bit = 1 << node;
130 if ((sc->sc_node_mask & bit) == 0) {
131 sc->sc_node_mask |= bit;
|
| /src/sys/dev/wscons/ |
| wscons_rinit.c | 72 int ch, i, n, bit; local
85 for (bit = 0; bit < 32; bit++)
86 if (pix[i] & (1 << bit))
87 npix |= (1 << (31 - bit));
|
| wscons_rinit.c | 72 int ch, i, n, bit; local
85 for (bit = 0; bit < 32; bit++)
86 if (pix[i] & (1 << bit))
87 npix |= (1 << (31 - bit));
|
| /src/sys/arch/arm/arm/ |
| cpu_subr.c | 98 const u_long bit = __BIT(cpuno % CPUINDEX_DIVISOR); local
101 while (atomic_load_acquire(&arm_cpu_mbox[off]) & bit) {
115 const u_int bit = cpuindex % CPUINDEX_DIVISOR; local
118 return (atomic_load_acquire(&arm_cpu_hatched[off]) & __BIT(bit)) != 0;
126 const u_long bit = __BIT(cpuindex % CPUINDEX_DIVISOR); local
129 atomic_or_ulong(&arm_cpu_hatched[off], bit);
139 const u_long bit = __BIT(cpuindex % CPUINDEX_DIVISOR); local
143 atomic_and_ulong(&arm_cpu_mbox[off], ~bit);
|
| cpu_subr.c | 98 const u_long bit = __BIT(cpuno % CPUINDEX_DIVISOR); local
101 while (atomic_load_acquire(&arm_cpu_mbox[off]) & bit) {
115 const u_int bit = cpuindex % CPUINDEX_DIVISOR; local
118 return (atomic_load_acquire(&arm_cpu_hatched[off]) & __BIT(bit)) != 0;
126 const u_long bit = __BIT(cpuindex % CPUINDEX_DIVISOR); local
129 atomic_or_ulong(&arm_cpu_hatched[off], bit);
139 const u_long bit = __BIT(cpuindex % CPUINDEX_DIVISOR); local
143 atomic_and_ulong(&arm_cpu_mbox[off], ~bit);
|
| /src/sys/arch/evbsh3/ap_ms104_sh4/ |
| rs5c316_mainbus.c | 159 int bit; local
163 bit = (_reg_read_2(SH4_PDTRA) & (1 << GPIO_PIN_RTC_SIO)) ? 1 : 0;
169 return bit;
173 rtc_write(struct rs5c313_softc *sc, int bit)
178 if (bit)
|
| rs5c316_mainbus.c | 159 int bit; local
163 bit = (_reg_read_2(SH4_PDTRA) & (1 << GPIO_PIN_RTC_SIO)) ? 1 : 0;
169 return bit;
173 rtc_write(struct rs5c313_softc *sc, int bit)
178 if (bit)
|
| /src/sys/arch/landisk/dev/ |
| rs5c313_landisk.c | 160 * Read bit from SPB1DT pin.
165 int bit; local
169 bit = (SHREG_SCSPTR & SCSPTR_SPB1DT) ? 1 : 0;
175 return bit;
180 * Write bit via SPB1DT pin.
183 rtc_write(struct rs5c313_softc *sc, int bit)
187 if (bit)
|
| rs5c313_landisk.c | 160 * Read bit from SPB1DT pin.
165 int bit; local
169 bit = (SHREG_SCSPTR & SCSPTR_SPB1DT) ? 1 : 0;
175 return bit;
180 * Write bit via SPB1DT pin.
183 rtc_write(struct rs5c313_softc *sc, int bit)
187 if (bit)
|
| /src/sys/arch/m68k/fpe/ |
| fpu_mul.c | 61 * Each step consists of shifting the accumulator right one bit
62 * (maintaining any guard bits) and, if the next bit in y is set,
64 * we advance one bit leftward in y. Algorithmically:
67 * for (bit = 0; bit < FP_NMANT; bit++) {
69 * if (Y & (1 << bit))
76 * shifted right, but at most one bit.
90 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
94 * run 32 times without adding X to A. We can do a 32-bit shift faste
103 uint32_t a2, a1, a0, x2, x1, x0, bit, m; local
[all...] |
| fpu_mul.c | 61 * Each step consists of shifting the accumulator right one bit
62 * (maintaining any guard bits) and, if the next bit in y is set,
64 * we advance one bit leftward in y. Algorithmically:
67 * for (bit = 0; bit < FP_NMANT; bit++) {
69 * if (Y & (1 << bit))
76 * shifted right, but at most one bit.
90 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
94 * run 32 times without adding X to A. We can do a 32-bit shift faste
103 uint32_t a2, a1, a0, x2, x1, x0, bit, m; local
[all...] |
| /src/sys/arch/playstation2/playstation2/ |
| interrupt.h | 41 int bit; member in struct:_ipl_dispatcher
|
| interrupt.h | 41 int bit; member in struct:_ipl_dispatcher
|
| /src/sys/arch/powerpc/pic/ |
| pic_prepivr.c | 106 int icu, bit; local
109 bit = irq % 8;
114 elcr[icu] |= 1 << bit;
116 elcr[icu] &= ~(1 << bit);
|
| /src/sys/dev/nand/ |
| hamming.c | 37 * Calculates the 22-bit hamming code for a 256-bytes block of data.
65 * index bit to 0 (even) or 1 (odd).
77 * - P4 -> bit 2 of index is 0 --------------------'
78 * - P4' -> bit 2 of index is 1.
79 * - P2 -> bit 1 of index if 0.
81 * We deduce that a bit position has an impact on all
82 * even Px if the log2(x)nth bit of its index is 0
85 * and on all odd Px' if the log2(x)nth bit
202 /* If there is a single bit error, there are 11 bits set to 1 */
204 /* Get byte and bit indexes *
215 uint8_t bit = (correction_code[2] >> 5) & 0x04; local
[all...] |
| /src/tests/usr.bin/indent/ |
| lsym_typedef.c | 71 bool bit:1; member in struct:__anon7961
76 bool bit:1; member in struct:__anon7962
83 bool bit:1; member in struct:__anon7963
88 bool bit:1; member in struct:__anon7964
|
