| /lib/ |
| D | kstrtox.c | 154 unsigned long long tmp; in kstrtoll() local
158 rv = _kstrtoull(s + 1, base, &tmp); in kstrtoll()
161 if ((long long)-tmp > 0) in kstrtoll()
163 *res = -tmp; in kstrtoll()
165 rv = kstrtoull(s, base, &tmp); in kstrtoll()
168 if ((long long)tmp < 0) in kstrtoll()
170 *res = tmp; in kstrtoll()
179 unsigned long long tmp; in _kstrtoul() local
182 rv = kstrtoull(s, base, &tmp); in _kstrtoul()
185 if (tmp != (unsigned long)tmp) in _kstrtoul()
[all …]
|
| D | find_bit.c | 34 unsigned long tmp; in _find_next_bit() local
39 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit()
41 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit()
42 tmp ^= invert; in _find_next_bit()
45 tmp &= BITMAP_FIRST_WORD_MASK(start); in _find_next_bit()
48 while (!tmp) { in _find_next_bit()
53 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit()
55 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit()
56 tmp ^= invert; in _find_next_bit()
59 return min(start + __ffs(tmp), nbits); in _find_next_bit()
[all …]
|
| D | rbtree.c | 88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert() local
115 tmp = gparent->rb_right; in __rb_insert()
116 if (parent != tmp) { /* parent == gparent->rb_left */ in __rb_insert()
117 if (tmp && rb_is_red(tmp)) { in __rb_insert()
131 rb_set_parent_color(tmp, gparent, RB_BLACK); in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
140 if (node == tmp) { in __rb_insert()
154 tmp = node->rb_left; in __rb_insert()
155 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
157 if (tmp) in __rb_insert()
[all …]
|
| D | build_OID_registry | 61 my $tmp = ($c == 0) ? 0 : int(log($c)/log(2));
62 $tmp = int($tmp / 7);
63 $size += $tmp;
101 my $tmp = ($c == 0) ? 0 : int(log($c)/log(2));
102 $tmp = int($tmp / 7);
104 for (; $tmp > 0; $tmp--) {
105 push @octets, (($c >> $tmp * 7) & 0x7f) | 0x80;
|
| D | extable.c | 30 struct exception_table_entry *x = a, *y = b, tmp; in swap_ex() local
33 tmp = *x; in swap_ex()
35 y->insn = tmp.insn - delta; in swap_ex()
38 swap_ex_entry_fixup(x, y, tmp, delta); in swap_ex()
41 y->fixup = tmp.fixup - delta; in swap_ex()
|
| D | string.c | 91 char *tmp = dest; in strcpy() local
95 return tmp; in strcpy()
116 char *tmp = dest; in strncpy() local
119 if ((*tmp = *src) != 0) in strncpy()
121 tmp++; in strncpy()
308 char *tmp = dest; in strcat() local
314 return tmp; in strcat()
331 char *tmp = dest; in strncat() local
343 return tmp; in strncat()
853 char *tmp = dest; in memcpy() local
[all …]
|
| D | asn1_decoder.c | 61 unsigned char tag, tmp; in asn1_find_indefinite_length() local
90 tmp = data[dp++]; in asn1_find_indefinite_length()
91 } while (tmp & 0x80); in asn1_find_indefinite_length()
213 unsigned char tmp; in asn1_ber_decoder() local
245 tmp = optag ^ tag; in asn1_ber_decoder()
246 tmp &= ~(optag & ASN1_CONS_BIT); in asn1_ber_decoder()
247 pr_debug("- match? %02x %02x %02x\n", tag, optag, tmp); in asn1_ber_decoder()
248 if (tmp != 0) { in asn1_ber_decoder()
329 size_t tmp = dp; in asn1_ber_decoder() local
332 data, datalen, &tmp, &len, &errmsg); in asn1_ber_decoder()
|
| D | llist.c | 84 struct llist_node *tmp = head; in llist_reverse_order() local
86 tmp->next = new_head; in llist_reverse_order()
87 new_head = tmp; in llist_reverse_order()
|
| D | bch.c | 391 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial() local
411 tmp = a_log(bch, d)+n-a_log(bch, pd); in compute_error_locator_polynomial()
415 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
419 tmp = pelp->deg+k; in compute_error_locator_polynomial()
420 if (tmp > elp->deg) { in compute_error_locator_polynomial()
421 elp->deg = tmp; in compute_error_locator_polynomial()
446 unsigned int tmp, mask; in solve_linear_system() local
460 tmp = rows[r]; in solve_linear_system()
462 rows[p] = tmp; in solve_linear_system()
470 tmp = rows[p]; in solve_linear_system()
[all …]
|
| D | decompress_unlzo.c | 107 size_t tmp; in unlzo() local
227 tmp = dst_len; in unlzo()
236 out_buf, &tmp); in unlzo()
238 if (r != LZO_E_OK || dst_len != tmp) { in unlzo()
|
| D | string_helpers.c | 54 char tmp[8]; in string_get_size() local
57 tmp[0] = '\0'; in string_get_size()
118 snprintf(tmp, sizeof(tmp), ".%03u", remainder); in string_get_size()
119 tmp[j+1] = '\0'; in string_get_size()
129 tmp, unit); in string_get_size()
|
| 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 | test_vmalloc.c | 225 void **ptr, **junk_ptr, *tmp; in full_fit_alloc_test() local
252 tmp = vmalloc(1 * PAGE_SIZE); in full_fit_alloc_test()
254 if (!tmp) in full_fit_alloc_test()
257 *((__u8 *)tmp) = 1; in full_fit_alloc_test()
258 vfree(tmp); in full_fit_alloc_test()
|
| D | idr.c | 403 unsigned long tmp = xa_to_value(bitmap); in ida_alloc_range() local
406 bit = find_next_zero_bit(&tmp, BITS_PER_XA_VALUE, bit); in ida_alloc_range()
410 tmp |= 1UL << bit; in ida_alloc_range()
411 xas_store(&xas, xa_mk_value(tmp)); in ida_alloc_range()
420 bitmap->bitmap[0] = tmp; in ida_alloc_range()
|
| D | debugobjects.c | 289 struct hlist_node *tmp; in free_obj_work() local
331 hlist_for_each_entry_safe(obj, tmp, &tofree, node) { in free_obj_work()
439 struct hlist_node *tmp; in debug_objects_oom() local
453 hlist_for_each_entry_safe(obj, tmp, &freelist, node) { in debug_objects_oom()
970 struct hlist_node *tmp; in __debug_check_no_obj_freed() local
986 hlist_for_each_entry_safe(obj, tmp, &db->list, node) { in __debug_check_no_obj_freed()
1328 struct hlist_node *tmp; in debug_objects_replace_static_objects() local
1347 hlist_for_each_entry_safe(obj, tmp, &obj_pool, node) in debug_objects_replace_static_objects()
1370 hlist_for_each_entry_safe(obj, tmp, &objects, node) { in debug_objects_replace_static_objects()
|
| D | radix-tree.c | 195 unsigned long tmp; in radix_tree_find_next_bit() local
198 tmp = *addr >> (offset % BITS_PER_LONG); in radix_tree_find_next_bit()
199 if (tmp) in radix_tree_find_next_bit()
200 return __ffs(tmp) + offset; in radix_tree_find_next_bit()
203 tmp = *++addr; in radix_tree_find_next_bit()
204 if (tmp) in radix_tree_find_next_bit()
205 return __ffs(tmp) + offset; in radix_tree_find_next_bit()
|
| D | klist.c | 185 struct klist_waiter *waiter, *tmp; in klist_release() local
191 list_for_each_entry_safe(waiter, tmp, &klist_remove_waiters, list) { in klist_release()
|
| D | vsprintf.c | 371 char tmp[sizeof(num) * 3] __aligned(2); in num_to_str() local
376 tmp[0] = '0' + num; in num_to_str()
379 len = put_dec(tmp, num) - tmp; in num_to_str()
394 buf[idx + width] = tmp[len - idx - 1]; in num_to_str()
446 char tmp[3 * sizeof(num)] __aligned(2); in number() local
484 tmp[i++] = hex_asc_upper[num] | locase; in number()
492 tmp[i++] = (hex_asc_upper[((unsigned char)num) & mask] | locase); in number()
496 i = put_dec(tmp, num) - tmp; in number()
549 *buf = tmp[i]; in number()
|
| /lib/raid6/ |
| D | unroll.awk | 14 tmp = $0
15 gsub(/\$\$/, i, tmp)
17 gsub(/\$\*/, "$", tmp)
18 print tmp
|
| D | recov.c | 111 int tmp = faila; in raid6_dual_recov() local
113 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 | 23 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)];
238 tmp = 0;
241 tmp ^=
244 omega[i] = index_of[tmp];
290 tmp = 0;
296 tmp ^= alpha_to[rs_modnn(rs, index_of[b[j]] + k)];
299 if (tmp != alpha_to[s[i]])
|
| D | reed_solomon.c | 217 struct list_head *tmp; in init_rs_internal() local
244 list_for_each(tmp, &codec_list) { in init_rs_internal()
245 struct rs_codec *cd = list_entry(tmp, struct rs_codec, list); in init_rs_internal()
|
| /lib/842/ |
| D | 842_decompress.c | 69 u64 tmp = 0; in __split_next_bits() local
77 ret = next_bits(p, &tmp, n - s); in __split_next_bits()
83 *d |= tmp << s; in __split_next_bits()
282 u64 op, rep, tmp, bytes, total; in sw842_decompress() local
349 ret = next_bits(&p, &tmp, 8); in sw842_decompress()
352 *p.out = (u8)tmp; in sw842_decompress()
|
| /lib/mpi/ |
| D | mpi-pow.c | 218 mpi_limb_t tmp; in mpi_powm() local
221 &tmp) < 0) in mpi_powm()
|