| /lib/ |
| D | test_kasan.c | 35 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_oob_right()
51 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_oob_left()
87 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_pagealloc_oob_right()
106 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_large_oob_right()
123 ptr1 = kmalloc(size1, GFP_KERNEL); in kmalloc_oob_krealloc_more()
143 ptr1 = kmalloc(size1, GFP_KERNEL); in kmalloc_oob_krealloc_less()
161 ptr1 = kmalloc(sizeof(*ptr1) - 3, GFP_KERNEL); in kmalloc_oob_16()
162 ptr2 = kmalloc(sizeof(*ptr2), GFP_KERNEL); in kmalloc_oob_16()
180 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_oob_memset_2()
196 ptr = kmalloc(size, GFP_KERNEL); in kmalloc_oob_memset_4()
[all …]
|
| D | test-string_helpers.c | 67 char *in = kmalloc(q_real, GFP_KERNEL); in test_string_unescape()
68 char *out_test = kmalloc(q_real, GFP_KERNEL); in test_string_unescape()
69 char *out_real = kmalloc(q_real, GFP_KERNEL); in test_string_unescape()
280 char *out_test = kmalloc(out_size, GFP_KERNEL); in test_string_escape()
281 char *out_real = kmalloc(out_size, GFP_KERNEL); in test_string_escape()
282 char *in = kmalloc(256, GFP_KERNEL); in test_string_escape()
|
| D | interval_tree_test.c | 67 nodes = kmalloc(nnodes * sizeof(struct interval_tree_node), GFP_KERNEL); in interval_tree_test_init()
71 queries = kmalloc(nsearches * sizeof(int), GFP_KERNEL); in interval_tree_test_init()
|
| D | parser.c | 136 buf = kmalloc(len + 1, GFP_KERNEL); in match_number()
284 char *p = kmalloc(sz, GFP_KERNEL); in match_strdup()
|
| D | argv_split.c | 71 argv = kmalloc(sizeof(*argv) * (argc + 2), gfp); in argv_split()
|
| D | once.c | 25 w = kmalloc(sizeof(*w), GFP_ATOMIC); in once_disable_jump()
|
| D | decompress_unxz.c | 153 #undef kmalloc
157 #define kmalloc(size, flags) malloc(size) macro
|
| D | test_user_copy.c | 45 kmem = kmalloc(PAGE_SIZE * 2, GFP_KERNEL); in test_user_copy_init()
|
| D | sort.c | 118 a = kmalloc(1000 * sizeof(int), GFP_KERNEL);
|
| D | flex_array.c | 170 part = kmalloc(sizeof(struct flex_array_part), flags); in __fa_get_part()
|
| D | test_printf.c | 340 test_buffer = kmalloc(BUF_SIZE, GFP_KERNEL); in test_printf_init()
|
| D | list_sort.c | 228 el = kmalloc(sizeof(*el), GFP_KERNEL); in list_sort_test()
|
| D | rbtree_test.c | 187 nodes = kmalloc(nnodes * sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
|
| D | kobject.c | 472 devpath_string = kmalloc(strlen(devpath) + 15, GFP_KERNEL); in kobject_rename()
538 devpath_string = kmalloc(strlen(devpath) + 15, GFP_KERNEL); in kobject_move()
|
| D | scatterlist.c | 180 return kmalloc(nents * sizeof(struct scatterlist), gfp_mask); in sg_kmalloc()
|
| D | kfifo.c | 57 fifo->data = kmalloc(size * esize, gfp_mask); in __kfifo_alloc()
|
| D | rhashtable.c | 523 iter->walker = kmalloc(sizeof(*iter->walker), GFP_KERNEL); in rhashtable_walk_init()
|
| D | inflate.c | 272 #define malloc(a) kmalloc(a, GFP_KERNEL)
|
| D | dynamic_debug.c | 663 tmpbuf = kmalloc(len + 1, GFP_KERNEL); in ddebug_proc_write()
|
| /lib/mpi/ |
| D | mpiutil.c | 34 a = kmalloc(sizeof *a, GFP_KERNEL); in mpi_alloc()
64 return kmalloc(len, GFP_KERNEL); in mpi_alloc_limb_space()
94 p = kmalloc(nlimbs * sizeof(mpi_limb_t), GFP_KERNEL); in mpi_resize()
|
| D | mpicoder.c | 242 buf = kmalloc(n, GFP_KERNEL); in mpi_get_buffer()
|
| /lib/zlib_inflate/ |
| D | infutil.c | 17 strm = kmalloc(sizeof(*strm), GFP_KERNEL); in zlib_inflate_blob()
20 strm->workspace = kmalloc(zlib_inflate_workspacesize(), GFP_KERNEL); in zlib_inflate_blob()
|
| /lib/reed_solomon/ |
| D | reed_solomon.c | 73 rs = kmalloc(sizeof (struct rs_control), GFP_KERNEL); in rs_init()
88 rs->alpha_to = kmalloc(sizeof(uint16_t) * (rs->nn + 1), GFP_KERNEL); in rs_init()
92 rs->index_of = kmalloc(sizeof(uint16_t) * (rs->nn + 1), GFP_KERNEL); in rs_init()
96 rs->genpoly = kmalloc(sizeof(uint16_t) * (rs->nroots + 1), GFP_KERNEL); in rs_init()
|
| /lib/xz/ |
| D | xz_dec_bcj.c | 529 struct xz_dec_bcj *s = kmalloc(sizeof(*s), GFP_KERNEL); in xz_dec_bcj_create()
|
| D | xz_dec_stream.c | 772 struct xz_dec *s = kmalloc(sizeof(*s), GFP_KERNEL); in xz_dec_init()
|