| /lib/ |
| D | asn1_encoder.c | 53 int byte = integer >> (8 * (i - 1)); in asn1_encode_integer() local
55 if (!found && byte == 0) in asn1_encode_integer()
64 if (!found && (byte & 0x80)) { in asn1_encode_integer()
77 *d++ = byte; in asn1_encode_integer()
109 u8 byte; in asn1_encode_oid_digit() local
111 byte = oid >> start; in asn1_encode_oid_digit()
112 oid = oid - (byte << start); in asn1_encode_oid_digit()
114 byte |= 0x80; in asn1_encode_oid_digit()
115 *data++ = byte; in asn1_encode_oid_digit()
|
| D | sbitmap.c | 348 static inline void emit_byte(struct seq_file *m, unsigned int offset, u8 byte) in emit_byte() argument
357 seq_printf(m, "%02x", byte); in emit_byte()
362 u8 byte = 0; in sbitmap_bitmap_show() local
377 byte |= (word & (BIT(bits) - 1)) << byte_bits; in sbitmap_bitmap_show()
380 emit_byte(m, offset, byte); in sbitmap_bitmap_show()
381 byte = 0; in sbitmap_bitmap_show()
390 emit_byte(m, offset, byte); in sbitmap_bitmap_show()
|
| D | Kconfig | 35 - The most significant bit of a byte is at its right (bit 0 of a
178 and crc32_be over byte strings with random alignment and length
211 bool "Sarwate's Algorithm (one byte at a time)"
213 Calculate checksum a byte at a time using Sarwate's algorithm. This
214 is not particularly fast, but has a small 256 byte lookup table.
|
| D | Kconfig.kasan | 102 comparison, as it embeds a tag into the top byte of each pointer.
121 comparison, as it embeds a tag into the top byte of each pointer.
|
| D | decompress_unlzma.c | 316 static inline int INIT write_byte(struct writer *wr, uint8_t byte) in write_byte() argument
318 wr->buffer[wr->buffer_pos++] = wr->previous_byte = byte; in write_byte()
|
| /lib/raid6/ |
| D | altivec.uc | 47 * The SHLBYTE() operation shifts each byte left by 1, *not*
48 * rolling over into the next byte
56 * The MASK() operation returns 0xFF in any byte for which the high
57 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| D | int.uc | 57 * The SHLBYTE() operation shifts each byte left by 1, *not*
58 * rolling over into the next byte
69 * The MASK() operation returns 0xFF in any byte for which the high
70 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| D | neon.uc | 34 * The SHLBYTE() operation shifts each byte left by 1, *not*
35 * rolling over into the next byte
43 * The MASK() operation returns 0xFF in any byte for which the high
44 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| D | s390vx.uc | 39 * operation returns 0xFF if the high bit of the byte is 1,
|
| /lib/xz/ |
| D | Kconfig | 46 MicroLZMA is a header format variant where the first byte
49 properties byte. MicroLZMA was created to be used in EROFS
|
| D | xz_dec_stream.c | 178 uint8_t byte; in dec_vli() local
184 byte = in[*in_pos]; in dec_vli()
187 s->vli |= (vli_type)(byte & 0x7F) << s->pos; in dec_vli()
189 if ((byte & 0x80) == 0) { in dec_vli()
191 if (byte == 0 && s->pos != 0) in dec_vli()
|
| D | xz_dec_lzma2.c | 337 static inline void dict_put(struct dictionary *dict, uint8_t byte) in dict_put() argument
339 dict->buf[dict->pos++] = byte; in dict_put()
|
| /lib/zstd/ |
| D | huf_compress.c | 286 BYTE byte; member
410 huffNode[pos].byte = (BYTE)n; in HUF_sort()
493 tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */ in HUF_buildCTable_wksp()
|
| D | huf_decompress.c | 86 BYTE byte; member
147 D.byte = (BYTE)n; in HUF_readDTableX2_wksp()
161 BYTE const c = dt[val].byte; in HUF_decodeSymbolX2()
|
| D | decompress.c | 1497 size_t ZSTD_generateNxBytes(void *dst, size_t dstCapacity, BYTE byte, size_t length) in ZSTD_generateNxBytes() argument
1501 memset(dst, byte, length); in ZSTD_generateNxBytes()
|
| /lib/crypto/ |
| D | Kconfig | 115 tristate "ChaCha20-Poly1305 AEAD support (8-byte nonce library version)"
|
| D | curve25519-hacl64.c | 584 u8 byte = n1[i]; in ladder_bigloop_cmult_big_loop() local
586 byte, 4); in ladder_bigloop_cmult_big_loop()
|