Searched refs:tmp (Results 1 – 11 of 11) sorted by relevance
/lib/ |
D | find_next_bit.c | 28 unsigned long tmp; in find_next_bit() local 35 tmp = *(p++); in find_next_bit() 36 tmp &= (~0UL << offset); in find_next_bit() 39 if (tmp) in find_next_bit() 45 if ((tmp = *(p++))) in find_next_bit() 52 tmp = *p; in find_next_bit() 55 tmp &= (~0UL >> (BITS_PER_LONG - size)); in find_next_bit() 56 if (tmp == 0UL) /* Are any bits set? */ in find_next_bit() 59 return result + __ffs(tmp); in find_next_bit() 72 unsigned long tmp; in find_next_zero_bit() local [all …]
|
D | find_last_bit.c | 21 unsigned long tmp; in find_last_bit() local 28 tmp = (addr[words] & (~0UL >> (BITS_PER_LONG in find_last_bit() 30 if (tmp) in find_last_bit() 35 tmp = addr[--words]; in find_last_bit() 36 if (tmp) { in find_last_bit() 38 return words * BITS_PER_LONG + __fls(tmp); in find_last_bit()
|
D | string_helpers.c | 40 char tmp[8]; in string_get_size() local 42 tmp[0] = '\0'; in string_get_size() 57 snprintf(tmp, sizeof(tmp), ".%03lld", in string_get_size() 59 tmp[j+1] = '\0'; in string_get_size() 64 tmp, units_str[units][i]); in string_get_size()
|
D | string.c | 100 char *tmp = dest; in strcpy() local 104 return tmp; in strcpy() 125 char *tmp = dest; in strncpy() local 128 if ((*tmp = *src) != 0) in strncpy() 130 tmp++; in strncpy() 173 char *tmp = dest; in strcat() local 179 return tmp; in strcat() 196 char *tmp = dest; in strncat() local 208 return tmp; in strncat() 555 char *tmp = dest; in memcpy() local [all …]
|
D | rbtree.c | 96 register struct rb_node *tmp; in rb_insert_color() local 98 tmp = parent; in rb_insert_color() 100 node = tmp; in rb_insert_color() 121 register struct rb_node *tmp; in rb_insert_color() local 123 tmp = parent; in rb_insert_color() 125 node = tmp; in rb_insert_color()
|
D | debugobjects.c | 177 struct hlist_node *node, *tmp; in debug_objects_oom() local 191 hlist_for_each_entry_safe(obj, node, tmp, &freelist, node) { in debug_objects_oom() 521 struct hlist_node *node, *tmp; in __debug_check_no_obj_freed() local 541 hlist_for_each_entry_safe(obj, node, tmp, &db->list, node) { in __debug_check_no_obj_freed() 565 hlist_for_each_entry_safe(obj, node, tmp, &freelist, node) { in __debug_check_no_obj_freed()
|
D | vsprintf.c | 404 char tmp[66]; in number() local 438 tmp[i++] = '0'; in number() 449 tmp[i++] = (digits[((unsigned char)num) & mask] | locase); in number() 453 i = put_dec(tmp, num) - tmp; in number() 503 *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()
|
D | prio_tree.c | 212 struct prio_tree_node *tmp = node; in prio_tree_insert() local 214 cur = tmp; in prio_tree_insert()
|
/lib/reed_solomon/ |
D | decode_rs.c | 29 uint16_t u, q, tmp, num1, num2, den, discr_r, syn_error; variable 106 tmp = index_of[lambda[j - 1]]; 107 if (tmp != nn) { 109 alpha_to[rs_modnn(rs, u + tmp)]; 214 tmp = 0; 217 tmp ^= 220 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()
|