| /lib/ |
| D | kstrtox.c | 148 unsigned long long tmp; in kstrtoll() local
152 rv = _kstrtoull(s + 1, base, &tmp); in kstrtoll()
155 if ((long long)-tmp > 0) in kstrtoll()
157 *res = -tmp; in kstrtoll()
159 rv = kstrtoull(s, base, &tmp); in kstrtoll()
162 if ((long long)tmp < 0) in kstrtoll()
164 *res = tmp; in kstrtoll()
173 unsigned long long tmp; in _kstrtoul() local
176 rv = kstrtoull(s, base, &tmp); in _kstrtoul()
179 if (tmp != (unsigned long long)(unsigned long)tmp) in _kstrtoul()
[all …]
|
| D | find_bit.c | 34 unsigned long tmp; in _find_next_bit() local
39 tmp = addr[start / BITS_PER_LONG] ^ invert; in _find_next_bit()
42 tmp &= BITMAP_FIRST_WORD_MASK(start); in _find_next_bit()
45 while (!tmp) { in _find_next_bit()
50 tmp = addr[start / BITS_PER_LONG] ^ invert; in _find_next_bit()
53 return min(start + __ffs(tmp), nbits); in _find_next_bit()
152 unsigned long tmp; in _find_next_bit_le() local
157 tmp = addr[start / BITS_PER_LONG] ^ invert; in _find_next_bit_le()
160 tmp &= ext2_swab(BITMAP_FIRST_WORD_MASK(start)); in _find_next_bit_le()
163 while (!tmp) { in _find_next_bit_le()
[all …]
|
| D | rbtree.c | 100 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert() local
118 tmp = gparent->rb_right; in __rb_insert()
119 if (parent != tmp) { /* parent == gparent->rb_left */ in __rb_insert()
120 if (tmp && rb_is_red(tmp)) { in __rb_insert()
134 rb_set_parent_color(tmp, gparent, RB_BLACK); in __rb_insert()
142 tmp = parent->rb_right; in __rb_insert()
143 if (node == tmp) { in __rb_insert()
156 tmp = node->rb_left; in __rb_insert()
157 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
159 if (tmp) in __rb_insert()
[all …]
|
| D | build_OID_registry | 65 my $tmp = ($c == 0) ? 0 : int(log($c)/log(2));
66 $tmp = int($tmp / 7);
67 $size += $tmp;
105 my $tmp = ($c == 0) ? 0 : int(log($c)/log(2));
106 $tmp = int($tmp / 7);
108 for (; $tmp > 0; $tmp--) {
109 push @octets, (($c >> $tmp * 7) & 0x7f) | 0x80;
|
| D | extable.c | 32 struct exception_table_entry *x = a, *y = b, tmp; in swap_ex() local
35 tmp = *x; in swap_ex()
37 y->insn = tmp.insn - delta; in swap_ex()
40 swap_ex_entry_fixup(x, y, tmp, delta); in swap_ex()
43 y->fixup = tmp.fixup - delta; in swap_ex()
|
| D | string.c | 89 char *tmp = dest; in strcpy() local
93 return tmp; in strcpy()
114 char *tmp = dest; in strncpy() local
117 if ((*tmp = *src) != 0) in strncpy()
119 tmp++; in strncpy()
304 char *tmp = dest; in strcat() local
310 return tmp; in strcat()
327 char *tmp = dest; in strncat() local
339 return tmp; in strncat()
809 char *tmp = dest; in memcpy() local
[all …]
|
| D | llist.c | 96 struct llist_node *tmp = head; in llist_reverse_order() local
98 tmp->next = new_head; in llist_reverse_order()
99 new_head = tmp; in llist_reverse_order()
|
| D | asn1_decoder.c | 64 unsigned char tag, tmp; in asn1_find_indefinite_length() local
93 tmp = data[dp++]; in asn1_find_indefinite_length()
94 } while (tmp & 0x80); in asn1_find_indefinite_length()
216 unsigned char tmp; in asn1_ber_decoder() local
248 tmp = optag ^ tag; in asn1_ber_decoder()
249 tmp &= ~(optag & ASN1_CONS_BIT); in asn1_ber_decoder()
250 pr_debug("- match? %02x %02x %02x\n", tag, optag, tmp); in asn1_ber_decoder()
251 if (tmp != 0) { in asn1_ber_decoder()
332 size_t tmp = dp; in asn1_ber_decoder() local
335 data, datalen, &tmp, &len, &errmsg); in asn1_ber_decoder()
|
| D | string_helpers.c | 49 char tmp[8]; in string_get_size() local
52 tmp[0] = '\0'; in string_get_size()
113 snprintf(tmp, sizeof(tmp), ".%03u", remainder); in string_get_size()
114 tmp[j+1] = '\0'; in string_get_size()
124 tmp, unit); in string_get_size()
|
| D | bch.c | 381 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial() local
401 tmp = a_log(bch, d)+n-a_log(bch, pd); in compute_error_locator_polynomial()
405 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
409 tmp = pelp->deg+k; in compute_error_locator_polynomial()
410 if (tmp > elp->deg) { in compute_error_locator_polynomial()
411 elp->deg = tmp; in compute_error_locator_polynomial()
436 unsigned int tmp, mask; in solve_linear_system() local
450 tmp = rows[r]; in solve_linear_system()
452 rows[p] = tmp; in solve_linear_system()
460 tmp = rows[p]; in solve_linear_system()
[all …]
|
| D | decompress_unlzo.c | 121 size_t tmp; in unlzo() local
241 tmp = dst_len; in unlzo()
250 out_buf, &tmp); in unlzo()
252 if (r != LZO_E_OK || dst_len != tmp) { in unlzo()
|
| D | test-kstrtox.c | 32 type tmp; \
35 tmp = 0; \
36 rv = fn(t->str, t->base, &tmp); \
39 t->str, t->base, rv, tmp); \
|
| D | flex_array.c | 347 void **tmp; in flex_array_get_ptr() local
349 tmp = flex_array_get(fa, element_nr); in flex_array_get_ptr()
350 if (!tmp) in flex_array_get_ptr()
353 return *tmp; in flex_array_get_ptr()
|
| D | debugobjects.c | 218 struct hlist_node *tmp; in debug_objects_oom() local
232 hlist_for_each_entry_safe(obj, tmp, &freelist, node) { in debug_objects_oom()
672 struct hlist_node *tmp; in __debug_check_no_obj_freed() local
692 hlist_for_each_entry_safe(obj, tmp, &db->list, node) { in __debug_check_no_obj_freed()
716 hlist_for_each_entry_safe(obj, tmp, &freelist, node) { in __debug_check_no_obj_freed()
1027 struct hlist_node *tmp; in debug_objects_replace_static_objects() local
1047 hlist_for_each_entry_safe(obj, tmp, &obj_pool, node) in debug_objects_replace_static_objects()
1071 hlist_for_each_entry_safe(obj, tmp, &objects, node) { in debug_objects_replace_static_objects()
|
| D | radix-tree.c | 159 unsigned long tmp; in radix_tree_find_next_bit() local
162 tmp = *addr >> (offset % BITS_PER_LONG); in radix_tree_find_next_bit()
163 if (tmp) in radix_tree_find_next_bit()
164 return __ffs(tmp) + offset; in radix_tree_find_next_bit()
167 tmp = *++addr; in radix_tree_find_next_bit()
168 if (tmp) in radix_tree_find_next_bit()
169 return __ffs(tmp) + offset; in radix_tree_find_next_bit()
|
| D | vsprintf.c | 334 char tmp[sizeof(num) * 3] __aligned(2); in num_to_str() local
339 tmp[0] = '0' + num; in num_to_str()
342 len = put_dec(tmp, num) - tmp; in num_to_str()
348 buf[idx] = tmp[len - idx - 1]; in num_to_str()
396 char tmp[3 * sizeof(num)] __aligned(2); in number() local
432 tmp[i++] = hex_asc_upper[num] | locase; in number()
440 tmp[i++] = (hex_asc_upper[((unsigned char)num) & mask] | locase); in number()
444 i = put_dec(tmp, num) - tmp; in number()
497 *buf = tmp[i]; in number()
|
| D | klist.c | 186 struct klist_waiter *waiter, *tmp; in klist_release() local
192 list_for_each_entry_safe(waiter, tmp, &klist_remove_waiters, list) { in klist_release()
|
| /lib/raid6/ |
| D | unroll.awk | 14 tmp = $0
15 gsub(/\$\$/, i, tmp)
17 gsub(/\$\*/, "$", tmp)
18 print tmp
|
| D | recov.c | 116 int tmp = faila; in raid6_dual_recov() local
118 failb = tmp; in raid6_dual_recov()
|
| /lib/xz/ |
| D | xz_dec_lzma2.c | 707 uint32_t tmp; in lzma_rep_match() local
718 tmp = s->lzma.rep1; in lzma_rep_match()
721 tmp = s->lzma.rep2; in lzma_rep_match()
723 tmp = s->lzma.rep3; in lzma_rep_match()
731 s->lzma.rep0 = tmp; in lzma_rep_match()
866 uint32_t tmp; in lzma2_lzma() local
870 tmp = 2 * LZMA_IN_REQUIRED - s->temp.size; in lzma2_lzma()
871 if (tmp > s->lzma2.compressed - s->temp.size) in lzma2_lzma()
872 tmp = s->lzma2.compressed - s->temp.size; in lzma2_lzma()
873 if (tmp > in_avail) in lzma2_lzma()
[all …]
|
| /lib/reed_solomon/ |
| D | decode_rs.c | 29 uint16_t u, q, tmp, num1, num2, den, discr_r, syn_error; variable
116 tmp = index_of[lambda[j - 1]];
117 if (tmp != nn) {
119 alpha_to[rs_modnn(rs, u + tmp)];
224 tmp = 0;
227 tmp ^=
230 omega[i] = index_of[tmp];
|
| D | reed_solomon.c | 203 struct list_head *tmp; in init_rs_internal() local
219 list_for_each(tmp, &rslist) { in init_rs_internal()
220 rs = list_entry(tmp, struct rs_control, list); in init_rs_internal()
|
| /lib/842/ |
| D | 842_decompress.c | 78 u64 tmp = 0; in __split_next_bits() local
86 ret = next_bits(p, &tmp, n - s); in __split_next_bits()
92 *d |= tmp << s; in __split_next_bits()
287 u64 op, rep, tmp, bytes, total; in sw842_decompress() local
354 ret = next_bits(&p, &tmp, 8); in sw842_decompress()
357 *p.out = (u8)tmp; in sw842_decompress()
|
| /lib/mpi/ |
| D | mpi-pow.c | 232 mpi_limb_t tmp; in mpi_powm() local
235 &tmp) < 0) in mpi_powm()
|
| D | mpih-mul.c | 382 mpi_limb_t tmp; in mpihelp_mul_karatsuba_case() local
383 if (mpihelp_mul(ctx->tspace, vp, vsize, up, usize, &tmp) in mpihelp_mul_karatsuba_case()
|