/linux-master/arch/powerpc/include/asm/ |
H A D | word-at-a-time.h | 60 static inline unsigned long has_zero(unsigned long a, unsigned long *bits, const struct word_at_a_time *c) argument 66 *bits = ret; 71 static inline unsigned long prep_zero_mask(unsigned long a, unsigned long bits, const struct word_at_a_time *c) argument 73 return bits; 77 static inline unsigned long create_zero_mask(unsigned long bits) argument 86 : "b" (bits)); 127 static inline unsigned long create_zero_mask(unsigned long bits) argument 129 bits = (bits - 1) & ~bits; 139 has_zero(unsigned long a, unsigned long *bits, const struct word_at_a_time *c) argument 146 prep_zero_mask(unsigned long a, unsigned long bits, const struct word_at_a_time *c) argument [all...] |
/linux-master/tools/testing/selftests/powerpc/primitives/ |
H A D | word-at-a-time.h | 60 static inline unsigned long has_zero(unsigned long a, unsigned long *bits, const struct word_at_a_time *c) argument 66 *bits = ret; 71 static inline unsigned long prep_zero_mask(unsigned long a, unsigned long bits, const struct word_at_a_time *c) argument 73 return bits; 77 static inline unsigned long create_zero_mask(unsigned long bits) argument 86 : "b" (bits)); 127 static inline unsigned long create_zero_mask(unsigned long bits) argument 129 bits = (bits - 1) & ~bits; 139 has_zero(unsigned long a, unsigned long *bits, const struct word_at_a_time *c) argument 146 prep_zero_mask(unsigned long a, unsigned long bits, const struct word_at_a_time *c) argument [all...] |
/linux-master/arch/arm64/kvm/ |
H A D | trng.c | 26 DECLARE_BITMAP(bits, TRNG_MAX_BITS64); 35 /* get as many bits as we need to fulfil the request */ 37 bits[i] = get_random_long(); 39 bitmap_clear(bits, num_bits, TRNG_MAX_BITS64 - num_bits); 42 smccc_set_retval(vcpu, TRNG_SUCCESS, lower_32_bits(bits[1]), 43 upper_32_bits(bits[0]), lower_32_bits(bits[0])); 45 smccc_set_retval(vcpu, TRNG_SUCCESS, bits[2], bits[1], bits[ [all...] |
/linux-master/lib/zlib_inflate/ |
H A D | inffast.c | 44 state->bits < 8 54 - The maximum input bits used by a length/distance pair is 15 bits for the 55 length code, 5 bits for the length extra, 15 bits for the distance code, 56 and 13 bits for the distance extra. This totals 48 bits, or six bytes. 83 unsigned bits; /* local strm->bits */ local 89 unsigned op; /* code bits, operatio [all...] |
H A D | inftrees.h | 17 table that indexes more bits of the code. op indicates whether 20 pointer, the low four bits of op is the number of index bits of 21 that table. For a length or distance, the low four bits of op 22 is the number of extra bits to get after the code. bits is 23 the number of bits in this code or part of the code to drop off 28 unsigned char op; /* operation, extra bits, table bits */ 29 unsigned char bits; /* bit member in struct:__anon14845 [all...] |
/linux-master/drivers/cpufreq/ |
H A D | powernow-k7.h | 21 } bits; member in union:msr_fidvidctl 39 } bits; member in union:msr_fidvidstatus
|
/linux-master/arch/arc/include/asm/ |
H A D | pgtable.h | 9 #include <linux/bits.h> 12 #include <asm/pgtable-bits-arcv2.h>
|
/linux-master/drivers/video/fbdev/core/ |
H A D | syscopyarea.c | 29 const unsigned long *src, unsigned src_idx, int bits, unsigned n) 36 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); 40 if (dst_idx+n <= bits) { 47 /* Leading bits */ 52 n -= bits - dst_idx; 56 n /= bits; 71 /* Trailing bits */ 80 right = shift & (bits - 1); 81 left = -shift & (bits - 1); 83 if (dst_idx+n <= bits) { 28 bitcpy(struct fb_info *p, unsigned long *dst, unsigned dst_idx, const unsigned long *src, unsigned src_idx, int bits, unsigned n) argument 170 bitcpy_rev(struct fb_info *p, unsigned long *dst, unsigned dst_idx, const unsigned long *src, unsigned src_idx, unsigned bits, unsigned n) argument 321 int bits = BITS_PER_LONG, bytes = bits >> 3; local [all...] |
H A D | cfbcopyarea.c | 47 const unsigned long __iomem *src, unsigned src_idx, int bits, 58 memmove((char *)dst + ((dst_idx & (bits - 1))) / 8, 59 (char *)src + ((src_idx & (bits - 1))) / 8, n / 8); 64 last = ~fb_shifted_pixels_mask_long(p, (dst_idx+n) % bits, bswapmask); 69 if (dst_idx+n <= bits) { 77 // Leading bits 82 n -= bits - dst_idx; 86 n /= bits; 101 // Trailing bits 110 int const left = shift & (bits 46 bitcpy(struct fb_info *p, unsigned long __iomem *dst, unsigned dst_idx, const unsigned long __iomem *src, unsigned src_idx, int bits, unsigned n, u32 bswapmask) argument 212 bitcpy_rev(struct fb_info *p, unsigned long __iomem *dst, unsigned dst_idx, const unsigned long __iomem *src, unsigned src_idx, int bits, unsigned n, u32 bswapmask) argument 387 int bits = BITS_PER_LONG, bytes = bits >> 3; local [all...] |
/linux-master/drivers/comedi/drivers/ |
H A D | c6xdigio.c | 70 unsigned int *bits, 80 *bits = val; 89 unsigned int bits; local 96 bits = (val >> 0) & 0x03; 97 c6xdigio_write_data(dev, cmd | bits | (0 << 2), 0x00); 98 bits = (val >> 2) & 0x03; 99 c6xdigio_write_data(dev, cmd | bits | (1 << 2), 0x80); 100 bits = (val >> 4) & 0x03; 101 c6xdigio_write_data(dev, cmd | bits | (0 << 2), 0x00); 102 bits 69 c6xdigio_get_encoder_bits(struct comedi_device *dev, unsigned int *bits, unsigned int cmd, unsigned int status) argument 115 unsigned int bits; local [all...] |
/linux-master/fs/jffs2/ |
H A D | compr_rubin.c | 44 int bits[8]; member in struct:rubin_state 88 static void init_rubin(struct rubin_state *rs, int div, int *bits) argument 98 rs->bits[c] = bits[c]; 151 static void init_decode(struct rubin_state *rs, int div, int *bits) argument 153 init_rubin(rs, div, bits); 168 int c, bits = 0; local 171 * First, work out how many bits we need from the input stream. 176 bits++; 185 rs->bit_number += bits; 262 rubin_do_compress(int bit_divider, int *bits, unsigned char *data_in, unsigned char *cpage_out, uint32_t *sourcelen, uint32_t *dstlen) argument 308 int bits[8]; local 368 rubin_do_decompress(int bit_divider, int *bits, unsigned char *cdata_in, unsigned char *page_out, uint32_t srclen, uint32_t destlen) argument 397 int bits[8]; local [all...] |
/linux-master/include/linux/ |
H A D | nodemask.h | 24 * void nodes_setall(mask) set all bits 25 * void nodes_clear(mask) clear all bits 38 * int nodes_empty(mask) Is mask empty (no bits sets)? 39 * int nodes_full(mask) Is mask full (all bits sets)? 40 * int nodes_weight(mask) Hamming weight - number of set bits 53 * NODE_MASK_ALL Initializer - all bits set 54 * NODE_MASK_NONE Initializer - no bits set 62 * void nodes_fold(dst, orig, sz) dst bits = orig bits mod sz 116 return m ? m->bits [all...] |
/linux-master/arch/parisc/include/asm/ |
H A D | hash.h | 21 * Only one instruction in a pair may be a shift (by more than 3 bits), 23 * to 3 bits) may be paired arbitrarily. 68 * you can see the non-zero bits are divided into several well-separated 76 * Using just two large blocks, 0xC3910C8D << 31 in the high bits, 77 * and 0xB583EB in the low bits, produces as good an algorithm as any, 80 * The high bits are a larger number and more work to compute, as well 81 * as needing one extra cycle to shift left 31 bits before the final 82 * addition, so they are the critical path for scheduling. The low bits 118 hash_64(u64 a, unsigned int bits) argument 126 if (!__builtin_constant_p(bits)) [all...] |
/linux-master/drivers/gpu/drm/amd/display/dc/inc/hw/ |
H A D | cursor_reg_cache.h | 19 } bits; member in union:reg_cursor_control_cfg 28 } bits; member in union:cursor_position_cache_hubp::reg_position_cfg 35 } bits; member in union:cursor_position_cache_hubp::reg_hot_spot_cfg 42 } bits; member in union:cursor_position_cache_hubp::reg_dst_offset_cfg 55 } bits; member in union:cursor_attribute_cache_hubp::reg_cursor_size_cfg 63 } bits; member in union:cursor_attribute_cache_hubp::reg_cursor_settings_cfg 83 } bits; member in union:reg_cur0_control_cfg
|
/linux-master/drivers/gpu/drm/nouveau/include/nvkm/core/ |
H A D | event.h | 50 typedef int (*nvkm_event_func)(struct nvkm_event_ntfy *, u32 bits); 55 u32 bits; member in struct:nvkm_event_ntfy 65 void nvkm_event_ntfy(struct nvkm_event *, int id, u32 bits); 66 bool nvkm_event_ntfy_valid(struct nvkm_event *, int id, u32 bits); 67 void nvkm_event_ntfy_add(struct nvkm_event *, int id, u32 bits, bool wait, nvkm_event_func, 73 typedef int (*nvkm_uevent_func)(struct nvkm_object *, u64 token, u32 bits); 76 int nvkm_uevent_add(struct nvkm_uevent *, struct nvkm_event *, int id, u32 bits, nvkm_uevent_func);
|
/linux-master/arch/s390/tools/ |
H A D | gen_facilities.c | 18 int *bits; member in struct:facility_def 29 .bits = (int[]){ 65 * with the non-hypervisor managed bits, is the maximum list of 69 .bits = (int[]){ 107 .bits = (int[]){ 130 for (i = 0; def->bits[i] != -1; i++) { 131 bit = 63 - (def->bits[i] & 63); 132 dword = def->bits[i] / 64;
|
/linux-master/fs/btrfs/ |
H A D | accessors.c | 59 #define DEFINE_BTRFS_SETGET_BITS(bits) \ 60 u##bits btrfs_get_token_##bits(struct btrfs_map_token *token, \ 69 const int size = sizeof(u##bits); \ 70 u8 lebytes[sizeof(u##bits)]; \ 78 return get_unaligned_le##bits(token->kaddr + oil); \ 83 return get_unaligned_le##bits(token->kaddr + oil); \ 89 return get_unaligned_le##bits(lebytes); \ 91 u##bits btrfs_get_##bits(cons [all...] |
/linux-master/drivers/xen/ |
H A D | acpi.c | 42 unsigned int bits = extended ? 8 : 16; local 55 if (WARN((val_a & (~0 << bits)) || (val_b & (~0 << bits)), 56 "Using more than %u bits of sleep control values %#x/%#x!" 58 bits, val_a, val_b))
|
/linux-master/include/trace/events/ |
H A D | fsi_master_gpio.h | 12 TP_PROTO(const struct fsi_master_gpio *master, int bits, uint64_t msg), 13 TP_ARGS(master, bits, msg), 16 __field(int, bits) 21 __entry->bits = bits; 22 __entry->msg = msg & ((1ull<<bits) - 1); 26 (__entry->bits + 3) / 4, 28 __entry->bits 33 TP_PROTO(const struct fsi_master_gpio *master, int bits, uint64_t msg), 34 TP_ARGS(master, bits, ms [all...] |
/linux-master/arch/mips/kernel/ |
H A D | early_printk_8250.c | 37 int status, bits; local 43 bits = UART_LSR_TEMT | UART_LSR_THRE; 50 } while ((status & bits) != bits);
|
/linux-master/drivers/phy/mediatek/ |
H A D | phy-mtk-io.h | 14 static inline void mtk_phy_clear_bits(void __iomem *reg, u32 bits) argument 18 tmp &= ~bits; 22 static inline void mtk_phy_set_bits(void __iomem *reg, u32 bits) argument 26 tmp |= bits;
|
/linux-master/arch/m68k/include/asm/ |
H A D | nettel.h | 47 * PPIO bits used for DTR/DCD. 56 static __inline__ void mcf_setppdata(unsigned int mask, unsigned int bits) argument 60 ppdata = (ppdata & ~mask) | bits; 86 * PPIO bits used for DTR/DCD. 93 static __inline__ void mcf_setppdata(unsigned int mask, unsigned int bits) argument 95 writew((readw(MCFSIM_PBDAT) & ~mask) | bits, MCFSIM_PBDAT);
|
/linux-master/arch/s390/include/asm/ |
H A D | word-at-a-time.h | 11 const unsigned long bits; member in struct:word_at_a_time 33 unsigned long mask = (val & c->bits) + c->bits; 35 *data = ~(mask | val | c->bits);
|
/linux-master/drivers/infiniband/hw/qib/ |
H A D | qib_wc_x86_64.c | 57 unsigned bits; local 69 * register has both offsets, 2K in low 32 bits, 4K in high 32 bits. 94 for (bits = 0; !(piolen & (1ULL << bits)); bits++) 97 if (piolen != (1ULL << bits)) { 98 piolen >>= bits; local 100 bits++; 101 piolen = 1ULL << (bits [all...] |
/linux-master/arch/mips/generic/ |
H A D | vmlinux.its.S | 16 load = /bits/ ADDR_BITS <VMLINUX_LOAD_ADDRESS>; 17 entry = /bits/ ADDR_BITS <VMLINUX_ENTRY_ADDRESS>;
|