| /lib/ |
| D | test_kasan.c | 31 char *ptr; in kmalloc_oob_right() local
35 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_oob_right()
36 if (!ptr) { in kmalloc_oob_right()
41 ptr[size] = 'x'; in kmalloc_oob_right()
42 kfree(ptr); in kmalloc_oob_right()
47 char *ptr; in kmalloc_oob_left() local
51 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_oob_left()
52 if (!ptr) { in kmalloc_oob_left()
57 *ptr = *(ptr - 1); in kmalloc_oob_left()
58 kfree(ptr); in kmalloc_oob_left()
[all …]
|
| D | assoc_array.c | 31 const struct assoc_array_ptr *cursor, *ptr, *parent; in assoc_array_subtree_iterate() local
58 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
59 has_meta |= (unsigned long)ptr; in assoc_array_subtree_iterate()
60 if (ptr && assoc_array_ptr_is_leaf(ptr)) { in assoc_array_subtree_iterate()
68 ret = iterator(assoc_array_ptr_to_leaf(ptr), in assoc_array_subtree_iterate()
92 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
93 if (assoc_array_ptr_is_meta(ptr)) { in assoc_array_subtree_iterate()
94 cursor = ptr; in assoc_array_subtree_iterate()
189 struct assoc_array_ptr *cursor, *ptr; in assoc_array_walk() local
223 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_walk()
[all …]
|
| D | devres.c | 28 void __iomem **ptr, *addr; in devm_ioremap() local
30 ptr = devres_alloc(devm_ioremap_release, sizeof(*ptr), GFP_KERNEL); in devm_ioremap()
31 if (!ptr) in devm_ioremap()
36 *ptr = addr; in devm_ioremap()
37 devres_add(dev, ptr); in devm_ioremap()
39 devres_free(ptr); in devm_ioremap()
57 void __iomem **ptr, *addr; in devm_ioremap_nocache() local
59 ptr = devres_alloc(devm_ioremap_release, sizeof(*ptr), GFP_KERNEL); in devm_ioremap_nocache()
60 if (!ptr) in devm_ioremap_nocache()
65 *ptr = addr; in devm_ioremap_nocache()
[all …]
|
| D | ubsan.c | 285 unsigned long ptr) in handle_misaligned_access() argument
296 (void *)ptr, data->type->type_name); in handle_misaligned_access()
303 unsigned long ptr) in handle_object_size_mismatch() argument
313 (void *) ptr); in handle_object_size_mismatch()
319 unsigned long ptr) in ubsan_type_mismatch_common() argument
322 if (!ptr) in ubsan_type_mismatch_common()
324 else if (data->alignment && !IS_ALIGNED(ptr, data->alignment)) in ubsan_type_mismatch_common()
325 handle_misaligned_access(data, ptr); in ubsan_type_mismatch_common()
327 handle_object_size_mismatch(data, ptr); in ubsan_type_mismatch_common()
331 unsigned long ptr) in __ubsan_handle_type_mismatch() argument
[all …]
|
| D | hexdump.c | 111 const u8 *ptr = buf; in hex_dump_to_buffer() local
174 ch = ptr[j]; in hex_dump_to_buffer()
197 ch = ptr[j]; in hex_dump_to_buffer()
246 const u8 *ptr = buf; in print_hex_dump() local
257 hex_dump_to_buffer(ptr + i, linelen, rowsize, groupsize, in print_hex_dump()
263 level, prefix_str, ptr + i, linebuf); in print_hex_dump()
|
| D | timerqueue.c | 43 struct timerqueue_node *ptr; in timerqueue_add() local
50 ptr = rb_entry(parent, struct timerqueue_node, node); in timerqueue_add()
51 if (node->expires.tv64 < ptr->expires.tv64) in timerqueue_add()
|
| D | decompress_unxz.c | 158 #define kfree(ptr) free(ptr) argument
160 #define vfree(ptr) do { if (ptr != NULL) free(ptr); } while (0) argument
|
| D | memweight.c | 10 size_t memweight(const void *ptr, size_t bytes) in memweight() argument
14 const unsigned char *bitmap = ptr; in memweight()
|
| D | decompress_unlzma.c | 42 static long long INIT read_int(unsigned char *ptr, int size) in read_int() argument
48 ret = (ret << 8) | ptr[size-i-1]; in read_int()
69 uint8_t *ptr; member
96 rc->ptr = rc->buffer; in rc_read()
112 rc->ptr = rc->buffer; in rc_init()
123 if (rc->ptr >= rc->buffer_end) in rc_init_code()
125 rc->code = (rc->code << 8) | *rc->ptr++; in rc_init_code()
133 if (rc->ptr >= rc->buffer_end) in rc_do_normalize()
136 rc->code = (rc->code << 8) | *rc->ptr++; in rc_do_normalize()
581 if (rc.ptr >= rc.buffer_end) in unlzma()
[all …]
|
| D | vsprintf.c | 668 char *symbol_string(char *buf, char *end, void *ptr, in symbol_string() argument
677 ptr = __builtin_extract_return_addr(ptr); in symbol_string()
678 value = (unsigned long)ptr; in symbol_string()
1574 char *pointer(const char *fmt, char *buf, char *end, void *ptr, in pointer() argument
1579 if (!ptr && *fmt != 'K') { in pointer()
1592 ptr = dereference_function_descriptor(ptr); in pointer()
1597 return symbol_string(buf, end, ptr, spec, fmt); in pointer()
1600 return resource_string(buf, end, ptr, spec, fmt); in pointer()
1602 return hex_string(buf, end, ptr, spec, fmt); in pointer()
1606 return bitmap_list_string(buf, end, ptr, spec, fmt); in pointer()
[all …]
|
| D | cmdline.c | 127 unsigned long long memparse(const char *ptr, char **retptr) in memparse() argument
131 unsigned long long ret = simple_strtoull(ptr, &endptr, 0); in memparse()
|
| D | random32.c | 102 u8 *ptr = buf; in prandom_bytes_state() local
105 put_unaligned(prandom_u32_state(state), (u32 *) ptr); in prandom_bytes_state()
106 ptr += sizeof(u32); in prandom_bytes_state()
113 *ptr++ = (u8) rem; in prandom_bytes_state()
|
| D | genalloc.c | 703 struct gen_pool **ptr, *pool; in devm_gen_pool_create() local
716 ptr = devres_alloc(devm_gen_pool_release, sizeof(*ptr), GFP_KERNEL); in devm_gen_pool_create()
717 if (!ptr) in devm_gen_pool_create()
724 *ptr = pool; in devm_gen_pool_create()
726 devres_add(dev, ptr); in devm_gen_pool_create()
731 devres_free(ptr); in devm_gen_pool_create()
|
| D | idr.c | 358 static void idr_fill_slot(struct idr *idr, void *ptr, int id, in idr_fill_slot() argument
364 rcu_assign_pointer(pa[0]->ary[id & IDR_MASK], (struct idr_layer *)ptr); in idr_fill_slot()
450 int idr_alloc(struct idr *idr, void *ptr, int start, int end, gfp_t gfp_mask) in idr_alloc() argument
471 idr_fill_slot(idr, ptr, id, pa); in idr_alloc()
488 int idr_alloc_cyclic(struct idr *idr, void *ptr, int start, int end, in idr_alloc_cyclic() argument
493 id = idr_alloc(idr, ptr, max(start, idr->cur), end, gfp_mask); in idr_alloc_cyclic()
495 id = idr_alloc(idr, ptr, start, end, gfp_mask); in idr_alloc_cyclic()
793 void *idr_replace(struct idr *idp, void *ptr, int id) in idr_replace() argument
819 rcu_assign_pointer(p->ary[n], ptr); in idr_replace()
|
| D | test_bpf.c | 77 } ptr; member
105 self->u.ptr.insns = insn; in bpf_fill_maxinsns1()
106 self->u.ptr.len = len; in bpf_fill_maxinsns1()
124 self->u.ptr.insns = insn; in bpf_fill_maxinsns2()
125 self->u.ptr.len = len; in bpf_fill_maxinsns2()
151 self->u.ptr.insns = insn; in bpf_fill_maxinsns3()
152 self->u.ptr.len = len; in bpf_fill_maxinsns3()
170 self->u.ptr.insns = insn; in bpf_fill_maxinsns4()
171 self->u.ptr.len = len; in bpf_fill_maxinsns4()
193 self->u.ptr.insns = insn; in bpf_fill_maxinsns5()
[all …]
|
| D | radix-tree.c | 72 static inline void *node_to_entry(void *ptr) in node_to_entry() argument
74 return (void *)((unsigned long)ptr | RADIX_TREE_INTERNAL_NODE); in node_to_entry()
83 void **ptr = node; in is_sibling_entry() local
84 return (parent->slots <= ptr) && in is_sibling_entry()
85 (ptr < parent->slots + RADIX_TREE_MAP_SIZE); in is_sibling_entry()
1509 void *ptr, unsigned offset) in delete_sibling_entries() argument
1514 if (node->slots[offset + i] != ptr) in delete_sibling_entries()
|
| D | scatterlist.c | 176 void *ptr = (void *) __get_free_page(gfp_mask); in sg_kmalloc() local
177 kmemleak_alloc(ptr, PAGE_SIZE, 1, gfp_mask); in sg_kmalloc()
178 return ptr; in sg_kmalloc()
|
| D | bch.c | 1153 void *ptr; in bch_alloc() local
1155 ptr = kmalloc(size, GFP_KERNEL); in bch_alloc()
1156 if (ptr == NULL) in bch_alloc()
1158 return ptr; in bch_alloc()
|
| D | rhashtable.c | 943 void (*free_fn)(void *ptr, void *arg), in rhashtable_free_one() argument
977 void (*free_fn)(void *ptr, void *arg), in rhashtable_free_and_destroy() argument
|
| /lib/lz4/ |
| D | lz4hc_compress.c | 170 const BYTE *ptr = ip; in lz4hc_insertandfindbestmatch() local
174 while (ptr < end - delta) { in lz4hc_insertandfindbestmatch()
175 chaintable[(size_t)(ptr) & MAXD_MASK] = delta; in lz4hc_insertandfindbestmatch()
176 ptr++; in lz4hc_insertandfindbestmatch()
179 chaintable[(size_t)(ptr) & MAXD_MASK] = delta; in lz4hc_insertandfindbestmatch()
181 hashtable[HASH_VALUE(ptr)] = (ptr) - base; in lz4hc_insertandfindbestmatch()
182 ptr++; in lz4hc_insertandfindbestmatch()
183 } while (ptr < end); in lz4hc_insertandfindbestmatch()
|
| /lib/raid6/ |
| D | s390vx.uc | 57 static inline void LOAD_DATA(int x, int n, u8 *ptr)
60 register addrtype *__ptr asm("1") = (addrtype *) ptr;
66 static inline void STORE_DATA(int x, int n, u8 *ptr)
69 register addrtype *__ptr asm("1") = (addrtype *) ptr;
|