Home
last modified time | relevance | path

Searched refs:bits (Results 1 - 25 of 3486) sorted by relevance

12345678910>>...140

/kernel/linux/linux-5.10/include/sound/
H A Dcs8403.h24 SND_CS8403_DECL void SND_CS8403_DECODE(struct snd_aes_iec958 *diga, unsigned char bits) in SND_CS8403_DECODE() argument
26 if (bits & 0x01) { /* consumer */ in SND_CS8403_DECODE()
27 if (!(bits & 0x02)) in SND_CS8403_DECODE()
29 if (!(bits & 0x08)) in SND_CS8403_DECODE()
31 switch (bits & 0x10) { in SND_CS8403_DECODE()
35 if (!(bits & 0x80)) in SND_CS8403_DECODE()
37 switch (bits & 0x60) { in SND_CS8403_DECODE()
43 switch (bits & 0x06) { in SND_CS8403_DECODE()
50 switch (bits & 0x18) { in SND_CS8403_DECODE()
56 switch (bits in SND_CS8403_DECODE()
69 unsigned char bits; SND_CS8403_ENCODE() local
154 SND_CS8404_DECODE(struct snd_aes_iec958 *diga, unsigned char bits) SND_CS8404_DECODE() argument
195 unsigned char bits; SND_CS8404_ENCODE() local
[all...]
/kernel/linux/linux-6.6/include/sound/
H A Dcs8403.h24 SND_CS8403_DECL void SND_CS8403_DECODE(struct snd_aes_iec958 *diga, unsigned char bits) in SND_CS8403_DECODE() argument
26 if (bits & 0x01) { /* consumer */ in SND_CS8403_DECODE()
27 if (!(bits & 0x02)) in SND_CS8403_DECODE()
29 if (!(bits & 0x08)) in SND_CS8403_DECODE()
31 switch (bits & 0x10) { in SND_CS8403_DECODE()
35 if (!(bits & 0x80)) in SND_CS8403_DECODE()
37 switch (bits & 0x60) { in SND_CS8403_DECODE()
43 switch (bits & 0x06) { in SND_CS8403_DECODE()
50 switch (bits & 0x18) { in SND_CS8403_DECODE()
56 switch (bits in SND_CS8403_DECODE()
69 unsigned char bits; SND_CS8403_ENCODE() local
154 SND_CS8404_DECODE(struct snd_aes_iec958 *diga, unsigned char bits) SND_CS8404_DECODE() argument
195 unsigned char bits; SND_CS8404_ENCODE() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dbase64.c35 int bits = 0; in base64_encode() local
41 bits += 8; in base64_encode()
43 bits -= 6; in base64_encode()
44 *cp++ = base64_table[(ac >> bits) & 0x3f]; in base64_encode()
45 } while (bits >= 6); in base64_encode()
47 if (bits) { in base64_encode()
48 *cp++ = base64_table[(ac << (6 - bits)) & 0x3f]; in base64_encode()
49 bits -= 6; in base64_encode()
51 while (bits < 0) { in base64_encode()
53 bits in base64_encode()
76 int bits = 0; base64_decode() local
[all...]
/kernel/linux/linux-5.10/drivers/net/wireless/zydas/zd1211rw/
H A Dzd_rf_rf2959.c32 static int bits(u32 rw, int from, int to)
41 return bits(rw, bit, bit);
46 int reg = bits(rw, 18, 22);
47 int rw_flag = bits(rw, 23, 23);
54 bits(rw, 14, 15), bit(rw, 3), bit(rw, 2), bit(rw, 1),
63 bits(rw, 7, 9), bits(rw, 4, 6), bits(rw, 0, 3));
67 bits(rw, 6, 17), bits(r
[all...]
/kernel/linux/linux-6.6/drivers/net/wireless/zydas/zd1211rw/
H A Dzd_rf_rf2959.c32 static int bits(u32 rw, int from, int to)
41 return bits(rw, bit, bit);
46 int reg = bits(rw, 18, 22);
47 int rw_flag = bits(rw, 23, 23);
54 bits(rw, 14, 15), bit(rw, 3), bit(rw, 2), bit(rw, 1),
63 bits(rw, 7, 9), bits(rw, 4, 6), bits(rw, 0, 3));
67 bits(rw, 6, 17), bits(r
[all...]
/kernel/linux/linux-5.10/lib/zlib_inflate/
H A Dinffast.c44 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 */ in inflate_fast() local
89 unsigned op; /* code bits, operatio in inflate_fast()
[all...]
/kernel/linux/linux-6.6/lib/zlib_inflate/
H A Dinffast.c44 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 */ in inflate_fast() local
89 unsigned op; /* code bits, operatio in inflate_fast()
[all...]
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/runtime/isys/src/
H A Drx.c26 hrt_data bits = receiver_port_reg_load(RX0_ID, in ia_css_isys_rx_enable_all_interrupts() local
30 bits |= (1U << _HRT_CSS_RECEIVER_IRQ_OVERRUN_BIT) | in ia_css_isys_rx_enable_all_interrupts()
50 _HRT_CSS_RECEIVER_IRQ_ENABLE_REG_IDX, bits); in ia_css_isys_rx_enable_all_interrupts()
104 unsigned int bits; in ia_css_isys_rx_get_irq_info() local
107 bits = ia_css_isys_rx_get_interrupt_reg(port); in ia_css_isys_rx_get_irq_info()
108 *irq_infos = ia_css_isys_rx_translate_irq_infos(bits); in ia_css_isys_rx_get_irq_info()
111 /* Translate register bits to CSS API enum mask */
112 unsigned int ia_css_isys_rx_translate_irq_infos(unsigned int bits) in ia_css_isys_rx_translate_irq_infos() argument
116 if (bits & (1U << _HRT_CSS_RECEIVER_IRQ_OVERRUN_BIT)) in ia_css_isys_rx_translate_irq_infos()
118 if (bits in ia_css_isys_rx_translate_irq_infos()
168 hrt_data bits = receiver_port_reg_load(RX0_ID, ia_css_isys_rx_clear_irq_info() local
[all...]
/kernel/linux/linux-5.10/drivers/video/fbdev/core/
H A Dsyscopyarea.c29 const unsigned long *src, unsigned src_idx, int bits, unsigned n) in bitcpy()
36 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitcpy()
40 if (dst_idx+n <= bits) { in bitcpy()
47 /* Leading bits */ in bitcpy()
52 n -= bits - dst_idx; in bitcpy()
56 n /= bits; in bitcpy()
71 /* Trailing bits */ in bitcpy()
80 right = shift & (bits - 1); in bitcpy()
81 left = -shift & (bits - 1); in bitcpy()
83 if (dst_idx+n <= bits) { in bitcpy()
28 bitcpy(struct fb_info *p, unsigned long *dst, unsigned dst_idx, const unsigned long *src, unsigned src_idx, int bits, unsigned n) bitcpy() 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) bitcpy_rev() argument
321 int bits = BITS_PER_LONG, bytes = bits >> 3; sys_copyarea() local
[all...]
H A Dcfbcopyarea.c47 const unsigned long __iomem *src, unsigned src_idx, int bits, in bitcpy()
58 memmove((char *)dst + ((dst_idx & (bits - 1))) / 8, in bitcpy()
59 (char *)src + ((src_idx & (bits - 1))) / 8, n / 8); in bitcpy()
64 last = ~fb_shifted_pixels_mask_long(p, (dst_idx+n) % bits, bswapmask); in bitcpy()
69 if (dst_idx+n <= bits) { in bitcpy()
77 // Leading bits in bitcpy()
82 n -= bits - dst_idx; in bitcpy()
86 n /= bits; in bitcpy()
101 // Trailing bits in bitcpy()
110 int const left = shift & (bits in bitcpy()
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) bitcpy() 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) bitcpy_rev() argument
387 int bits = BITS_PER_LONG, bytes = bits >> 3; cfb_copyarea() local
[all...]
H A Dsysfillrect.c26 unsigned long pat, unsigned n, int bits) in bitfill_aligned()
34 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitfill_aligned()
36 if (dst_idx+n <= bits) { in bitfill_aligned()
44 /* Leading bits */ in bitfill_aligned()
48 n -= bits - dst_idx; in bitfill_aligned()
52 n /= bits; in bitfill_aligned()
66 /* Trailing bits */ in bitfill_aligned()
82 unsigned long pat, int left, int right, unsigned n, int bits) in bitfill_unaligned()
90 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitfill_unaligned()
92 if (dst_idx+n <= bits) { in bitfill_unaligned()
25 bitfill_aligned(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, unsigned n, int bits) bitfill_aligned() argument
81 bitfill_unaligned(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned() argument
135 bitfill_aligned_rev(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, unsigned n, int bits) bitfill_aligned_rev() argument
191 bitfill_unaligned_rev(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned_rev() argument
247 int bits = BITS_PER_LONG, bytes = bits >> 3; sys_fillrect() local
[all...]
/kernel/linux/linux-6.6/drivers/video/fbdev/core/
H A Dsyscopyarea.c29 const unsigned long *src, unsigned src_idx, int bits, unsigned n) in bitcpy()
36 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitcpy()
40 if (dst_idx+n <= bits) { in bitcpy()
47 /* Leading bits */ in bitcpy()
52 n -= bits - dst_idx; in bitcpy()
56 n /= bits; in bitcpy()
71 /* Trailing bits */ in bitcpy()
80 right = shift & (bits - 1); in bitcpy()
81 left = -shift & (bits - 1); in bitcpy()
83 if (dst_idx+n <= bits) { in bitcpy()
28 bitcpy(struct fb_info *p, unsigned long *dst, unsigned dst_idx, const unsigned long *src, unsigned src_idx, int bits, unsigned n) bitcpy() 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) bitcpy_rev() argument
321 int bits = BITS_PER_LONG, bytes = bits >> 3; sys_copyarea() local
[all...]
H A Dcfbcopyarea.c47 const unsigned long __iomem *src, unsigned src_idx, int bits, in bitcpy()
58 memmove((char *)dst + ((dst_idx & (bits - 1))) / 8, in bitcpy()
59 (char *)src + ((src_idx & (bits - 1))) / 8, n / 8); in bitcpy()
64 last = ~fb_shifted_pixels_mask_long(p, (dst_idx+n) % bits, bswapmask); in bitcpy()
69 if (dst_idx+n <= bits) { in bitcpy()
77 // Leading bits in bitcpy()
82 n -= bits - dst_idx; in bitcpy()
86 n /= bits; in bitcpy()
101 // Trailing bits in bitcpy()
110 int const left = shift & (bits in bitcpy()
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) bitcpy() 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) bitcpy_rev() argument
387 int bits = BITS_PER_LONG, bytes = bits >> 3; cfb_copyarea() local
[all...]
/kernel/linux/linux-5.10/fs/jffs2/
H A Dcompr_rubin.c44 int bits[8]; member
88 static void init_rubin(struct rubin_state *rs, int div, int *bits) in init_rubin() argument
98 rs->bits[c] = bits[c]; in init_rubin()
151 static void init_decode(struct rubin_state *rs, int div, int *bits) in init_decode() argument
153 init_rubin(rs, div, bits); in init_decode()
168 int c, bits = 0; in __do_decode() local
171 * First, work out how many bits we need from the input stream. in __do_decode()
176 bits++; in __do_decode()
185 rs->bit_number += bits; in __do_decode()
262 rubin_do_compress(int bit_divider, int *bits, unsigned char *data_in, unsigned char *cpage_out, uint32_t *sourcelen, uint32_t *dstlen) rubin_do_compress() argument
308 int bits[8]; jffs2_dynrubin_compress() local
368 rubin_do_decompress(int bit_divider, int *bits, unsigned char *cdata_in, unsigned char *page_out, uint32_t srclen, uint32_t destlen) rubin_do_decompress() argument
397 int bits[8]; jffs2_dynrubin_decompress() local
[all...]
/kernel/linux/linux-6.6/fs/jffs2/
H A Dcompr_rubin.c44 int bits[8]; member
88 static void init_rubin(struct rubin_state *rs, int div, int *bits) in init_rubin() argument
98 rs->bits[c] = bits[c]; in init_rubin()
151 static void init_decode(struct rubin_state *rs, int div, int *bits) in init_decode() argument
153 init_rubin(rs, div, bits); in init_decode()
168 int c, bits = 0; in __do_decode() local
171 * First, work out how many bits we need from the input stream. in __do_decode()
176 bits++; in __do_decode()
185 rs->bit_number += bits; in __do_decode()
262 rubin_do_compress(int bit_divider, int *bits, unsigned char *data_in, unsigned char *cpage_out, uint32_t *sourcelen, uint32_t *dstlen) rubin_do_compress() argument
308 int bits[8]; jffs2_dynrubin_compress() local
368 rubin_do_decompress(int bit_divider, int *bits, unsigned char *cdata_in, unsigned char *page_out, uint32_t srclen, uint32_t destlen) rubin_do_decompress() argument
397 int bits[8]; jffs2_dynrubin_decompress() local
[all...]
/kernel/linux/linux-5.10/drivers/block/drbd/
H A Ddrbd_vli.h29 * gives the number of set or unset bits.
35 * Still, there may be areas where the polarity flips every few bits,
44 * For some cases, we produce more code bits than plaintext input.
76 * Number of data bits follow fibonacci sequence, with the exception of the
78 * encoding bit polarity runlength is 1 plain bits => 2 code bits.
79 prefix data bits max val Nº data bits
107 #................. s ........................... plain bits ..........
112 /* LEVEL: (total bits, prefi
207 bitstream_cursor_advance(struct bitstream_cursor *cur, unsigned int bits) bitstream_cursor_advance() argument
248 bitstream_put_bits(struct bitstream *bs, u64 val, const unsigned int bits) bitstream_put_bits() argument
281 bitstream_get_bits(struct bitstream *bs, u64 *out, int bits) bitstream_get_bits() argument
331 int bits = __vli_encode_bits(&code, in); vli_encode_bits() local
[all...]
/kernel/linux/linux-6.6/drivers/block/drbd/
H A Ddrbd_vli.h29 * gives the number of set or unset bits.
35 * Still, there may be areas where the polarity flips every few bits,
44 * For some cases, we produce more code bits than plaintext input.
76 * Number of data bits follow fibonacci sequence, with the exception of the
78 * encoding bit polarity runlength is 1 plain bits => 2 code bits.
79 prefix data bits max val Nº data bits
107 #................. s ........................... plain bits ..........
112 /* LEVEL: (total bits, prefi
207 bitstream_cursor_advance(struct bitstream_cursor *cur, unsigned int bits) bitstream_cursor_advance() argument
248 bitstream_put_bits(struct bitstream *bs, u64 val, const unsigned int bits) bitstream_put_bits() argument
281 bitstream_get_bits(struct bitstream *bs, u64 *out, int bits) bitstream_get_bits() argument
331 int bits = __vli_encode_bits(&code, in); vli_encode_bits() local
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dnodemask.h24 * 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
99 typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODE
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dnodemask.h24 * 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
98 typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODE
[all...]
/kernel/linux/linux-5.10/arch/alpha/include/asm/
H A Dword-at-a-time.h22 static inline unsigned long has_zero(unsigned long val, unsigned long *bits, const struct word_at_a_time *c) in has_zero() argument
25 *bits = zero_locations; in has_zero()
29 static inline unsigned long prep_zero_mask(unsigned long val, unsigned long bits, const struct word_at_a_time *c) in prep_zero_mask() argument
31 return bits; in prep_zero_mask()
34 #define create_zero_mask(bits) (bits)
36 static inline unsigned long find_zero(unsigned long bits) in find_zero() argument
40 return __kernel_cttz(bits); in find_zero()
44 bits &= -bits; in find_zero()
[all...]
/kernel/linux/linux-6.6/arch/alpha/include/asm/
H A Dword-at-a-time.h22 static inline unsigned long has_zero(unsigned long val, unsigned long *bits, const struct word_at_a_time *c) in has_zero() argument
25 *bits = zero_locations; in has_zero()
29 static inline unsigned long prep_zero_mask(unsigned long val, unsigned long bits, const struct word_at_a_time *c) in prep_zero_mask() argument
31 return bits; in prep_zero_mask()
34 #define create_zero_mask(bits) (bits)
36 static inline unsigned long find_zero(unsigned long bits) in find_zero() argument
40 return __kernel_cttz(bits); in find_zero()
44 bits &= -bits; in find_zero()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dstruct-funcs.c55 #define DEFINE_BTRFS_SETGET_BITS(bits) \
56 u##bits btrfs_get_token_##bits(struct btrfs_map_token *token, \
62 const int size = sizeof(u##bits); \
63 u8 lebytes[sizeof(u##bits)]; \
71 return get_unaligned_le##bits(token->kaddr + oip); \
76 return get_unaligned_le##bits(token->kaddr + oip); \
82 return get_unaligned_le##bits(lebytes); \
84 u##bits btrfs_get_##bits(cons
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Daccessors.c58 #define DEFINE_BTRFS_SETGET_BITS(bits) \
59 u##bits btrfs_get_token_##bits(struct btrfs_map_token *token, \
66 const int size = sizeof(u##bits); \
67 u8 lebytes[sizeof(u##bits)]; \
75 return get_unaligned_le##bits(token->kaddr + oip); \
80 return get_unaligned_le##bits(token->kaddr + oip); \
86 return get_unaligned_le##bits(lebytes); \
88 u##bits btrfs_get_##bits(cons
[all...]
/kernel/linux/linux-6.6/drivers/spi/
H A Dspi-bitbang-txrx.h51 u32 word, u8 bits) in bitbang_txrx_be_cpha0()
55 u32 oldbit = (!(word & (1<<(bits-1)))) << 31; in bitbang_txrx_be_cpha0()
57 for (word <<= (32 - bits); likely(bits); bits--) { in bitbang_txrx_be_cpha0()
83 u32 word, u8 bits) in bitbang_txrx_be_cpha1()
87 u32 oldbit = (!(word & (1<<(bits-1)))) << 31; in bitbang_txrx_be_cpha1()
89 for (word <<= (32 - bits); likely(bits); bits in bitbang_txrx_be_cpha1()
49 bitbang_txrx_be_cpha0(struct spi_device *spi, unsigned nsecs, unsigned cpol, unsigned flags, u32 word, u8 bits) bitbang_txrx_be_cpha0() argument
81 bitbang_txrx_be_cpha1(struct spi_device *spi, unsigned nsecs, unsigned cpol, unsigned flags, u32 word, u8 bits) bitbang_txrx_be_cpha1() argument
113 bitbang_txrx_le_cpha0(struct spi_device *spi, unsigned int nsecs, unsigned int cpol, unsigned int flags, u32 word, u8 bits) bitbang_txrx_le_cpha0() argument
146 bitbang_txrx_le_cpha1(struct spi_device *spi, unsigned int nsecs, unsigned int cpol, unsigned int flags, u32 word, u8 bits) bitbang_txrx_le_cpha1() argument
[all...]
/kernel/linux/linux-6.6/tools/lib/
H A Dbitmap.c8 unsigned int __bitmap_weight(const unsigned long *bitmap, int bits) in __bitmap_weight() argument
10 unsigned int k, w = 0, lim = bits/BITS_PER_LONG; in __bitmap_weight()
15 if (bits % BITS_PER_LONG) in __bitmap_weight()
16 w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits)); in __bitmap_weight()
22 const unsigned long *bitmap2, int bits) in __bitmap_or()
25 int nr = BITS_TO_LONGS(bits); in __bitmap_or()
61 const unsigned long *bitmap2, unsigned int bits) in __bitmap_and()
64 unsigned int lim = bits/BITS_PER_LONG; in __bitmap_and()
69 if (bits % BITS_PER_LONG) in __bitmap_and()
71 BITMAP_LAST_WORD_MASK(bits)); in __bitmap_and()
21 __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, const unsigned long *bitmap2, int bits) __bitmap_or() argument
60 __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) __bitmap_and() argument
75 __bitmap_equal(const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) __bitmap_equal() argument
90 __bitmap_intersects(const unsigned long *bitmap1, const unsigned long *bitmap2, unsigned int bits) __bitmap_intersects() argument
[all...]

Completed in 10 milliseconds

12345678910>>...140