| /lib/ |
| D | kfifo.c | 104 unsigned int len, unsigned int off) in kfifo_copy_in() argument
114 len *= esize; in kfifo_copy_in()
116 l = min(len, size - off); in kfifo_copy_in()
119 memcpy(fifo->data, src + l, len - l); in kfifo_copy_in()
128 const void *buf, unsigned int len) in __kfifo_in() argument
133 if (len > l) in __kfifo_in()
134 len = l; in __kfifo_in()
136 kfifo_copy_in(fifo, buf, len, fifo->in); in __kfifo_in()
137 fifo->in += len; in __kfifo_in()
138 return len; in __kfifo_in()
[all …]
|
| D | seq_buf.c | 27 static bool seq_buf_can_fit(struct seq_buf *s, size_t len) in seq_buf_can_fit() argument
29 return s->len + len <= s->size; in seq_buf_can_fit()
41 unsigned int len = seq_buf_used(s); in seq_buf_print_seq() local
43 return seq_write(m, s->buffer, len); in seq_buf_print_seq()
58 int len; in seq_buf_vprintf() local
62 if (s->len < s->size) { in seq_buf_vprintf()
63 len = vsnprintf(s->buffer + s->len, s->size - s->len, fmt, args); in seq_buf_vprintf()
64 if (s->len + len < s->size) { in seq_buf_vprintf()
65 s->len += len; in seq_buf_vprintf()
114 unsigned int len = seq_buf_buffer_left(s); in seq_buf_bprintf() local
[all …]
|
| D | checksum.c | 50 static unsigned int do_csum(const unsigned char *buff, int len) in do_csum() argument
55 if (len <= 0) in do_csum()
64 len--; in do_csum()
67 if (len >= 2) { in do_csum()
70 len -= 2; in do_csum()
73 if (len >= 4) { in do_csum()
74 const unsigned char *end = buff + ((unsigned)len & ~3); in do_csum()
86 if (len & 2) { in do_csum()
91 if (len & 1) in do_csum()
129 __wsum csum_partial(const void *buff, int len, __wsum wsum) in csum_partial() argument
[all …]
|
| D | asn1_decoder.c | 65 size_t dp = *_dp, len, n; in asn1_find_indefinite_length() local
98 len = data[dp++]; in asn1_find_indefinite_length()
99 if (len <= 0x7f) in asn1_find_indefinite_length()
102 if (unlikely(len == ASN1_INDEFINITE_LENGTH)) { in asn1_find_indefinite_length()
110 n = len - 0x80; in asn1_find_indefinite_length()
111 if (unlikely(n > sizeof(len) - 1)) in asn1_find_indefinite_length()
115 len = 0; in asn1_find_indefinite_length()
117 len <<= 8; in asn1_find_indefinite_length()
118 len |= data[dp++]; in asn1_find_indefinite_length()
121 if (len > datalen - dp) in asn1_find_indefinite_length()
[all …]
|
| D | pci_iomap.c | 33 resource_size_t len = pci_resource_len(dev, bar); in pci_iomap_range() local
36 if (len <= offset || !start) in pci_iomap_range()
38 len -= offset; in pci_iomap_range()
40 if (maxlen && len > maxlen) in pci_iomap_range()
41 len = maxlen; in pci_iomap_range()
43 return __pci_ioport_map(dev, start, len); in pci_iomap_range()
45 return ioremap(start, len); in pci_iomap_range()
73 resource_size_t len = pci_resource_len(dev, bar); in pci_iomap_wc_range() local
80 if (len <= offset || !start) in pci_iomap_wc_range()
83 len -= offset; in pci_iomap_wc_range()
[all …]
|
| D | crc32.c | 57 crc32_body(u32 crc, unsigned char const *buf, size_t len, const u32 (*tab)[256]) argument
84 if (unlikely((long)buf & 3 && len)) {
87 } while ((--len) && ((long)buf)&3);
91 rem_len = len & 3;
92 len = len >> 2;
94 rem_len = len & 7;
95 len = len >> 3;
101 for (i = 0; i < len; i++) {
103 for (--b; len; --len) {
114 len = rem_len;
[all …]
|
| D | nlattr.c | 50 if (pt->len) in validate_nla()
51 minlen = min_t(int, attrlen, pt->len + 1); in validate_nla()
63 if (pt->len) { in validate_nla()
69 if (attrlen > pt->len) in validate_nla()
75 if (pt->len && attrlen > pt->len) in validate_nla()
80 if (attrlen < pt->len) in validate_nla()
82 if (attrlen < NLA_ALIGN(pt->len)) in validate_nla()
84 if (attrlen < NLA_ALIGN(pt->len) + NLA_HDRLEN) in validate_nla()
86 nla = nla_data(nla) + NLA_ALIGN(pt->len); in validate_nla()
87 if (attrlen < NLA_ALIGN(pt->len) + NLA_HDRLEN + nla_len(nla)) in validate_nla()
[all …]
|
| D | decompress_inflate.c | 31 static long INIT nofill(void *buffer, unsigned long len) in nofill() argument
37 STATIC int INIT __gunzip(unsigned char *buf, long len, in __gunzip() argument
64 len = 0; in __gunzip()
87 if (len == 0) in __gunzip()
88 len = fill(zbuf, GZIP_IOBUF_SIZE); in __gunzip()
91 if (len < 10 || in __gunzip()
103 strm->avail_in = len - 10; in __gunzip()
133 len = fill(zbuf, GZIP_IOBUF_SIZE); in __gunzip()
134 if (len < 0) { in __gunzip()
140 strm->avail_in = len; in __gunzip()
[all …]
|
| D | siphash.c | 29 #define PREAMBLE(len) \ argument
34 u64 b = ((u64)(len)) << 56; \
53 u64 __siphash_aligned(const void *data, size_t len, const siphash_key_t *key) in __siphash_aligned() argument
55 const u8 *end = data + len - (len % sizeof(u64)); in __siphash_aligned()
56 const u8 left = len & (sizeof(u64) - 1); in __siphash_aligned()
58 PREAMBLE(len) in __siphash_aligned()
86 u64 __siphash_unaligned(const void *data, size_t len, const siphash_key_t *key) in __siphash_unaligned() argument
88 const u8 *end = data + len - (len % sizeof(u64)); in __siphash_unaligned()
89 const u8 left = len & (sizeof(u64) - 1); in __siphash_unaligned()
91 PREAMBLE(len) in __siphash_unaligned()
[all …]
|
| D | parser.c | 35 int len = -1; in match_one() local
47 len = simple_strtoul(p, (char **) &p, 10); in match_one()
65 if (len == -1 || len > str_len) in match_one()
66 len = str_len; in match_one()
67 args[argc].to = s + len; in match_one()
134 size_t len = s->to - s->from; in match_number() local
136 buf = kmalloc(len + 1, GFP_KERNEL); in match_number()
139 memcpy(buf, s->from, len); in match_number()
140 buf[len] = '\0'; in match_number()
265 size_t len = ret >= size ? size - 1 : ret; in match_strlcpy() local
[all …]
|
| D | hexdump.c | 108 int hex_dump_to_buffer(const void *buf, size_t len, int rowsize, int groupsize, in hex_dump_to_buffer() argument
121 if (len > rowsize) /* limit to one line at a time */ in hex_dump_to_buffer()
122 len = rowsize; in hex_dump_to_buffer()
125 if ((len % groupsize) != 0) /* no mixed size output */ in hex_dump_to_buffer()
128 ngroups = len / groupsize; in hex_dump_to_buffer()
134 if (!len) in hex_dump_to_buffer()
171 for (j = 0; j < len; j++) { in hex_dump_to_buffer()
194 for (j = 0; j < len; j++) { in hex_dump_to_buffer()
206 return ascii ? ascii_column + len : (groupsize * 2 + 1) * ngroups - 1; in hex_dump_to_buffer()
244 const void *buf, size_t len, bool ascii) in print_hex_dump() argument
[all …]
|
| D | nmi_backtrace.c | 101 int len, last_i = 0; in nmi_trigger_all_cpu_backtrace() local
104 len = seq_buf_used(&s->seq); in nmi_trigger_all_cpu_backtrace()
105 if (!len) in nmi_trigger_all_cpu_backtrace()
109 for (i = 0; i < len; i++) { in nmi_trigger_all_cpu_backtrace()
116 if (last_i < len) { in nmi_trigger_all_cpu_backtrace()
117 print_seq_line(s, last_i, len - 1); in nmi_trigger_all_cpu_backtrace()
142 unsigned int len = seq_buf_used(&s->seq); in nmi_vprintk() local
145 return seq_buf_used(&s->seq) - len; in nmi_vprintk()
|
| D | textsearch.c | 198 unsigned int len; member
208 if (likely(consumed < st->len)) { in get_linear_data()
210 return st->len - consumed; in get_linear_data()
231 const void *data, unsigned int len) in textsearch_find_continuous() argument
237 st->len = len; in textsearch_find_continuous()
262 unsigned int len, gfp_t gfp_mask, int flags) in textsearch_prepare() argument
268 if (len == 0) in textsearch_prepare()
287 conf = ops->init(pattern, len, gfp_mask, flags); in textsearch_prepare()
|
| D | ts_kmp.c | 78 static inline void compute_prefix_tbl(const u8 *pattern, unsigned int len, in compute_prefix_tbl() argument
84 for (k = 0, q = 1; q < len; q++) { in compute_prefix_tbl()
95 static struct ts_config *kmp_init(const void *pattern, unsigned int len, in kmp_init() argument
101 unsigned int prefix_tbl_len = len * sizeof(unsigned int); in kmp_init()
102 size_t priv_size = sizeof(*kmp) + len + prefix_tbl_len; in kmp_init()
110 kmp->pattern_len = len; in kmp_init()
111 compute_prefix_tbl(pattern, len, kmp->prefix_tbl, flags); in kmp_init()
114 for (i = 0; i < len; i++) in kmp_init()
117 memcpy(kmp->pattern, pattern, len); in kmp_init()
|
| D | test-hexdump.c | 45 static void __init test_hexdump(size_t len, int rowsize, int groupsize, in test_hexdump() argument
52 size_t l = len; in test_hexdump()
64 if (!is_power_of_2(gs) || gs > 8 || (len % gs != 0)) in test_hexdump()
100 pr_err("Len: %zu row: %d group: %d\n", len, rowsize, groupsize); in test_hexdump()
109 size_t len = get_random_int() % d + 1; in test_hexdump_set() local
111 test_hexdump(len, rowsize, 4, ascii); in test_hexdump_set()
112 test_hexdump(len, rowsize, 2, ascii); in test_hexdump_set()
113 test_hexdump(len, rowsize, 8, ascii); in test_hexdump_set()
114 test_hexdump(len, rowsize, 1, ascii); in test_hexdump_set()
|
| D | crc-t10dif.c | 22 __u16 crc_t10dif_update(__u16 crc, const unsigned char *buffer, size_t len) in crc_t10dif_update() argument
31 return crc_t10dif_generic(crc, buffer, len); in crc_t10dif_update()
37 err = crypto_shash_update(&desc.shash, buffer, len); in crc_t10dif_update()
44 __u16 crc_t10dif(const unsigned char *buffer, size_t len) in crc_t10dif() argument
46 return crc_t10dif_update(0, buffer, len); in crc_t10dif()
|
| D | earlycpio.c | 68 size_t len, long *nextoff) in find_cpio_data() argument
80 while (len > cpio_header_len) { in find_cpio_data()
84 len -= 4; in find_cpio_data()
117 len -= cpio_header_len; in find_cpio_data()
122 if (nptr > p + len || dptr < p || nptr < dptr) in find_cpio_data()
140 len -= (nptr - p); in find_cpio_data()
|
| D | oid_registry.c | 35 size_t len; in look_up_OID() local
65 len = oid_index[oid + 1] - oid_index[oid]; in look_up_OID()
66 if (len > datasize) { in look_up_OID()
70 if (len < datasize) { in look_up_OID()
78 while (len > 0) { in look_up_OID()
79 unsigned char a = oid_data[oid_index[oid] + --len]; in look_up_OID()
80 unsigned char b = octets[len]; in look_up_OID()
|
| D | kobject_uevent.c | 132 int len; in init_uevent_argv() local
134 len = strlcpy(&env->buf[env->buflen], subsystem, buffer_size); in init_uevent_argv()
135 if (len >= buffer_size) { in init_uevent_argv()
137 buffer_size, len); in init_uevent_argv()
145 env->buflen += len + 1; in init_uevent_argv()
294 size_t len; in kobject_uevent_env() local
300 len = strlen(action_string) + strlen(devpath) + 2; in kobject_uevent_env()
301 skb = alloc_skb(len + env->buflen, GFP_KERNEL); in kobject_uevent_env()
306 scratch = skb_put(skb, len); in kobject_uevent_env()
311 len = strlen(env->envp[i]) + 1; in kobject_uevent_env()
[all …]
|
| D | sg_split.c | 28 size_t size = sizes[0], len; in sg_calculate_split() local
44 len = min_t(size_t, size, sglen - skip); in sg_calculate_split()
49 size -= len; in sg_calculate_split()
51 curr->length_last_sg = len; in sg_calculate_split()
53 while (!size && (skip + len < sglen) && (--nb_splits > 0)) { in sg_calculate_split()
56 skip += len; in sg_calculate_split()
57 len = min_t(size_t, size, sglen - skip); in sg_calculate_split()
62 curr->length_last_sg = len; in sg_calculate_split()
63 size -= len; in sg_calculate_split()
|
| D | test-string_helpers.c | 77 int len = strlen(strings[i].in); in test_string_unescape() local
80 memcpy(&in[p], s, len); in test_string_unescape()
81 p += len; in test_string_unescape()
86 len = strlen(strings[i].out); in test_string_unescape()
88 memcpy(&out_test[q_test], s, len); in test_string_unescape()
89 q_test += len; in test_string_unescape()
291 int len; in test_string_escape() local
306 len = strlen(s2->in); in test_string_escape()
307 memcpy(&in[p], s2->in, len); in test_string_escape()
308 p += len; in test_string_escape()
[all …]
|
| D | kasprintf.c | 16 unsigned int len; in kvasprintf() local
21 len = vsnprintf(NULL, 0, fmt, aq); in kvasprintf()
24 p = kmalloc_track_caller(len+1, gfp); in kvasprintf()
28 vsnprintf(p, len+1, fmt, ap); in kvasprintf()
|
| /lib/zlib_inflate/ |
| D | inftrees.c | 26 unsigned len; /* a code's length in bits */ in zlib_inflate_table() local
93 for (len = 0; len <= MAXBITS; len++) in zlib_inflate_table()
94 count[len] = 0; in zlib_inflate_table()
118 for (len = 1; len <= MAXBITS; len++) { in zlib_inflate_table()
120 left -= count[len]; in zlib_inflate_table()
128 for (len = 1; len < MAXBITS; len++) in zlib_inflate_table()
129 offs[len + 1] = offs[len] + count[len]; in zlib_inflate_table()
189 len = min; /* starting code length */ in zlib_inflate_table()
204 this.bits = (unsigned char)(len - drop); in zlib_inflate_table()
219 incr = 1U << (len - drop); in zlib_inflate_table()
[all …]
|
| D | inffast.c | 91 unsigned len; /* match length, unused bytes */ in inflate_fast() local
135 len = (unsigned)(this.val); in inflate_fast()
142 len += (unsigned)hold & ((1U << op) - 1); in inflate_fast()
190 if (op < len) { /* some from window */ in inflate_fast()
191 len -= op; in inflate_fast()
201 if (op < len) { /* some from end of window */ in inflate_fast()
202 len -= op; in inflate_fast()
207 if (write < len) { /* some from start of window */ in inflate_fast()
209 len -= op; in inflate_fast()
219 if (op < len) { /* some from window */ in inflate_fast()
[all …]
|
| /lib/lz4/ |
| D | lz4_compress.c | 126 int len; in lz4_compressctx() local
128 len = length - RUN_MASK; in lz4_compressctx()
129 for (; len > 254 ; len -= 255) in lz4_compressctx()
131 *op++ = (u8)len; in lz4_compressctx()
254 int len, length; in lz4_compress64kctx() local
307 len = length - RUN_MASK; in lz4_compress64kctx()
308 for (; len > 254 ; len -= 255) in lz4_compress64kctx()
310 *op++ = (u8)len; in lz4_compress64kctx()
357 len = (int)(ip - anchor); in lz4_compress64kctx()
359 if (unlikely(op + (1 + LASTLITERALS) + (len >> 8) > oend)) in lz4_compress64kctx()
[all …]
|