| /src/sys/arch/m68k/include/ |
| asm_single.h | 31 * Provide bit manipulation macro's that resolve to a single instruction.
38 #define single_inst_bset_b(var, bit) \
41 : "di" ((u_char)bit))
43 #define single_inst_bclr_b(var, bit) \
46 : "di" ((u_char)~(bit)))
49 #define single_inst_bset_w(var, bit) \
52 : "di" ((u_short)bit))
54 #define single_inst_bclr_w(var, bit) \
57 : "di" ((u_short)~(bit)))
60 #define single_inst_bset_l(var, bit) \
[all...] |
| /src/sys/external/gpl2/dts/dist/include/dt-bindings/mfd/ |
| stm32f4-rcc.h | 36 #define STM32F4_AHB1_RESET(bit) (STM32F4_RCC_AHB1_##bit + (0x10 * 8))
37 #define STM32F4_AHB1_CLOCK(bit) (STM32F4_RCC_AHB1_##bit)
47 #define STM32F4_AHB2_RESET(bit) (STM32F4_RCC_AHB2_##bit + (0x14 * 8))
48 #define STM32F4_AHB2_CLOCK(bit) (STM32F4_RCC_AHB2_##bit + 0x20)
54 #define STM32F4_AHB3_RESET(bit) (STM32F4_RCC_AHB3_##bit + (0x18 * 8)
[all...] |
| stm32f7-rcc.h | 36 #define STM32F7_AHB1_RESET(bit) (STM32F7_RCC_AHB1_##bit + (0x10 * 8))
37 #define STM32F7_AHB1_CLOCK(bit) (STM32F7_RCC_AHB1_##bit)
47 #define STM32F7_AHB2_RESET(bit) (STM32F7_RCC_AHB2_##bit + (0x14 * 8))
48 #define STM32F7_AHB2_CLOCK(bit) (STM32F7_RCC_AHB2_##bit + 0x20)
54 #define STM32F7_AHB3_RESET(bit) (STM32F7_RCC_AHB3_##bit + (0x18 * 8)
[all...] |
| stm32h7-rcc.h | 19 #define STM32H7_AHB3_RESET(bit) (STM32H7_RCC_AHB3_##bit + (0x7C * 8))
30 #define STM32H7_AHB1_RESET(bit) (STM32H7_RCC_AHB1_##bit + (0x80 * 8))
39 #define STM32H7_AHB2_RESET(bit) (STM32H7_RCC_AHB2_##bit + (0x84 * 8))
58 #define STM32H7_AHB4_RESET(bit) (STM32H7_RCC_AHB4_##bit + (0x88 * 8))
64 #define STM32H7_APB3_RESET(bit) (STM32H7_RCC_APB3_##bit + (0x8C * 8)
[all...] |
| /src/sys/arch/arm/at91/ |
| at91piovar.h | 51 int at91pio_read(struct at91pio_softc *, int bit);
52 void at91pio_set(struct at91pio_softc *, int bit);
53 void at91pio_clear(struct at91pio_softc *, int bit);
54 void at91pio_in(struct at91pio_softc *, int bit);
55 void at91pio_out(struct at91pio_softc *, int bit);
56 void at91pio_per(struct at91pio_softc *, int bit, int perab);
58 void *at91pio_intr_establish(struct at91pio_softc *,int bit,
60 void at91pio_intr_disestablish(struct at91pio_softc *,int bit,
|
| at91pio.c | 239 aprint_normal(" bit %d", paa->paa_bit);
245 at91pio_read(struct at91pio_softc *sc, int bit)
248 sc->pins[bit].pin_caps = 0;
250 return (PIO_READ(sc, PIO_PDSR) >> bit) & 1;
254 at91pio_set(struct at91pio_softc *sc, int bit)
257 sc->pins[bit].pin_caps = 0;
259 PIO_WRITE(sc, PIO_SODR, (1U << bit));
263 at91pio_clear(struct at91pio_softc *sc, int bit)
266 sc->pins[bit].pin_caps = 0;
268 PIO_WRITE(sc, PIO_CODR, (1U << bit));
405 int bit; local in function:at91pio_intr
[all...] |
| /src/sys/arch/arm/ep93xx/ |
| epgpiovar.h | 44 int epgpio_read(struct epgpio_softc *,epgpio_port, int bit);
45 void epgpio_set(struct epgpio_softc *,epgpio_port, int bit);
46 void epgpio_clear(struct epgpio_softc *,epgpio_port, int bit);
47 void epgpio_in(struct epgpio_softc *,epgpio_port, int bit);
48 void epgpio_out(struct epgpio_softc *,epgpio_port, int bit);
50 void *epgpio_intr_establish(struct epgpio_softc *,epgpio_port, int bit,
52 void epgpio_intr_disestablish(struct epgpio_softc *,epgpio_port, int bit);
|
| /src/include/ |
| bitstring.h | 57 /* byte of the bitstring bit is in */
58 #define _bit_byte(bit) \
59 (uint32_t)((bit) >> 3)
61 /* mask for the bit within its byte */
62 #define _bit_mask(bit) \
63 (uint32_t)((1 << (uint32_t)((bit)&0x7)))
78 /* is bit N of bitstring name set? */
79 #define bit_test(name, bit) \
80 /*LINTED bitwise on signed*/((name)[_bit_byte(bit)] & _bit_mask(bit))
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/bios/ |
| nouveau_nvkm_subdev_bios_bit.c | 30 #include <subdev/bios/bit.h>
33 bit_entry(struct nvkm_bios *bios, u8 id, struct bit_entry *bit)
40 bit->id = nvbios_rd08(bios, entry + 0);
41 bit->version = nvbios_rd08(bios, entry + 1);
42 bit->length = nvbios_rd16(bios, entry + 2);
43 bit->offset = nvbios_rd16(bios, entry + 4);
|
| /src/tests/usr.bin/indent/ |
| lsym_typedef.c | 71 bool bit:1; member in struct:__anona7d358560708
76 bool bit:1; member in struct:__anona7d358560808
83 bool bit:1; member in struct:__anona7d358560908
88 bool bit:1; member in struct:__anona7d358560a08
|
| /src/sys/arch/m68k/fpe/ |
| fpu_sqrt.c | 126 * zero bit at the top of x. Doing so means that q is not going to acquire
127 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
162 * bit at a time, from the top down, and is not used itself in the loop
164 * in an integer, one word at a time, which saves a bit of work. Also,
165 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
177 * Furthermore, we can prove with a bit of work that x never exceeds y by
184 * In fact, we want even one more bit (for a carry, to avoid compares), or
192 uint32_t bit, q, tt; local in function:fpu_sqrt
253 * set the top bit in q, so we can do that manually and start
254 * the loop at the next bit down instead. We must be sure t
[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 in function:fpu_mul
[all...] |
| /src/sys/arch/evbmips/loongson/ |
| isa_machdep.c | 70 loongson_isa_specific_eoi(int bit)
72 KASSERT((bit < 16) && (bit >= 0));
73 loongson_isaimr &= ~(1 << bit);
74 if (bit & 8) {
80 OCW2_SELECT | OCW2_EOI | OCW2_SL | OCW2_ILS(bit & 7);
81 bit = 2;
89 OCW2_SELECT | OCW2_EOI | OCW2_SL | OCW2_ILS(bit);
|
| /src/sys/arch/powerpc/fpu/ |
| fpu_sqrt.c | 130 * zero bit at the top of x. Doing so means that q is not going to acquire
131 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
166 * bit at a time, from the top down, and is not used itself in the loop
168 * in an integer, one word at a time, which saves a bit of work. Also,
169 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
181 * Furthermore, we can prove with a bit of work that x never exceeds y by
188 * In fact, we want even one more bit (for a carry, to avoid compares), or
196 u_int bit, q, tt; local in function:fpu_sqrt
273 * set the top bit in q, so we can do that manually and start
274 * the loop at the next bit down instead. We must be sure t
[all...] |
| /src/sys/arch/sparc/fpu/ |
| fpu_sqrt.c | 126 * zero bit at the top of x. Doing so means that q is not going to acquire
127 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
162 * bit at a time, from the top down, and is not used itself in the loop
164 * in an integer, one word at a time, which saves a bit of work. Also,
165 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
177 * Furthermore, we can prove with a bit of work that x never exceeds y by
184 * In fact, we want even one more bit (for a carry, to avoid compares), or
192 u_int bit, q, tt; local in function:fpu_sqrt
253 * set the top bit in q, so we can do that manually and start
254 * the loop at the next bit down instead. We must be sure t
[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.
92 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
96 * run 32 times without adding X to A. We can do a 32-bit shift faste
105 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m; local in function:fpu_mul
[all...] |
| /src/sys/external/bsd/common/include/linux/ |
| bitops.h | 116 #define BIT(n) ((unsigned long)__BIT(n))
154 __test_and_set_bit(unsigned int bit, volatile unsigned long *ptr)
157 volatile unsigned long *const p = &ptr[bit / units];
158 const unsigned long mask = (1UL << (bit % units));
168 __test_and_clear_bit(unsigned int bit, volatile unsigned long *ptr)
171 volatile unsigned long *const p = &ptr[bit / units];
172 const unsigned long mask = (1UL << (bit % units));
182 __test_and_change_bit(unsigned int bit, volatile unsigned long *ptr)
185 volatile unsigned long *const p = &ptr[bit / units];
186 const unsigned long mask = (1UL << (bit % units))
[all...] |
| /src/sys/external/bsd/drm2/linux/ |
| linux_wait_bit.c | 81 wait_bit_hash(const volatile unsigned long *bitmap, unsigned bit)
84 const volatile unsigned long *word = bitmap + bit/(NBBY*sizeof(*word));
91 wait_bit_enter(const volatile unsigned long *bitmap, unsigned bit)
93 struct waitbitentry *wbe = &waitbittab[wait_bit_hash(bitmap, bit)].ent;
108 * clear_and_wake_up_bit(bit, bitmap)
110 * Clear the specified bit in the bitmap and wake any waiters in
115 clear_and_wake_up_bit(int bit, volatile unsigned long *bitmap)
119 wbe = wait_bit_enter(bitmap, bit);
120 clear_bit(bit, bitmap);
126 * wait_on_bit(bitmap, bit, flags
[all...] |
| /src/sys/arch/ia64/stand/common/ |
| bitstring.h | 41 /* byte of the bitstring bit is in */
42 #define _bit_byte(bit) \
43 ((bit) >> 3)
45 /* mask for the bit within its byte */
46 #define _bit_mask(bit) \
47 (1 << ((bit)&0x7))
62 /* is bit N of bitstring name set? */
63 #define bit_test(name, bit) \
64 ((name)[_bit_byte(bit)] & _bit_mask(bit))
[all...] |
| /src/sys/arch/playstation2/ee/ |
| intc.c | 107 if (dispatcher->bit & dispatch) {
110 dispatch &= ~dispatcher->bit;
116 int i, bit; local in function:intc_intr
117 for (i = 0, bit = 1; i < _INTC_NINTR; i++, bit <<= 1) {
118 if (bit & dispatch) {
164 u_int32_t bit; local in function:intc_intr_establish
174 dispatcher->bit = bit = (1 << ch);
178 __intc_ipl_holder[i].mask &= ~bit;
210 u_int32_t bit; local in function:intc_intr_disestablish
[all...] |
| /src/sys/dev/tprof/ |
| tprof_x86_amd.c | 95 /* bit 21 reserved */
100 /* bit 36-39 reserved */
103 /* bit 42-63 reserved */
164 int bit; local in function:tprof_amd_start
166 while ((bit = ffs(runmask)) != 0) {
167 bit--;
168 CLR(runmask, __BIT(bit));
169 wrmsr(PERFEVTSEL(bit), rdmsr(PERFEVTSEL(bit)) | PESR_EN);
176 int bit; local in function:tprof_amd_stop
190 int bit; local in function:tprof_amd_nmi
[all...] |
| tprof_x86_intel.c | 155 int bit; local in function:tprof_intel_start
157 while ((bit = ffs(runmask)) != 0) {
158 bit--;
159 CLR(runmask, __BIT(bit));
160 wrmsr(PERFEVTSEL(bit), rdmsr(PERFEVTSEL(bit)) | PERFEVTSEL_EN);
167 int bit; local in function:tprof_intel_stop
169 while ((bit = ffs(stopmask)) != 0) {
170 bit--;
171 CLR(stopmask, __BIT(bit));
183 int bit; local in function:tprof_intel_nmi
[all...] |
| /src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/ |
| omap36xx-clocks.dtsi | 19 ti,bit-shift = <0x1e>;
22 ti,set-bit-to-disable;
29 ti,bit-shift = <0x1b>;
31 ti,set-bit-to-disable;
38 ti,bit-shift = <0xc>;
40 ti,set-bit-to-disable;
47 ti,bit-shift = <0x1c>;
49 ti,set-bit-to-disable;
56 ti,bit-shift = <0x1f>;
58 ti,set-bit-to-disable
[all...] |
| omap24xx-clocks.dtsi | 12 ti,bit-shift = <2>;
26 ti,bit-shift = <6>;
78 ti,bit-shift = <23>;
94 ti,bit-shift = <6>;
103 ti,bit-shift = <6>;
132 ti,bit-shift = <2>;
142 ti,bit-shift = <6>;
152 ti,bit-shift = <5>;
180 ti,bit-shift = <3>;
196 ti,bit-shift = <7>
[all...] |
| am35xx-clocks.dtsi | 13 ti,bit-shift = <1>;
21 ti,bit-shift = <9>;
29 ti,bit-shift = <2>;
37 ti,bit-shift = <10>;
45 ti,bit-shift = <0>;
53 ti,bit-shift = <8>;
61 ti,bit-shift = <3>;
70 ti,bit-shift = <4>;
90 ti,bit-shift = <23>;
98 ti,bit-shift = <23>
[all...] |
