Home
last modified time | relevance | path

Searched refs:gfp (Results 1 – 4 of 4) sorted by relevance

/lib/
Dkasprintf.c14 char *kvasprintf(gfp_t gfp, const char *fmt, va_list ap) in kvasprintf() argument
24 p = kmalloc_track_caller(len+1, gfp); in kvasprintf()
34 char *kasprintf(gfp_t gfp, const char *fmt, ...) in kasprintf() argument
40 p = kvasprintf(gfp, fmt, ap); in kasprintf()
Dargv_split.c59 char **argv_split(gfp_t gfp, const char *str, int *argcp) in argv_split() argument
66 argv_str = kstrndup(str, KMALLOC_MAX_SIZE - 1, gfp); in argv_split()
71 argv = kmalloc(sizeof(*argv) * (argc + 2), gfp); in argv_split()
Dbtree.c93 static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) in btree_node_alloc() argument
97 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
413 gfp_t gfp) in btree_grow() argument
418 node = btree_node_alloc(head, gfp); in btree_grow()
449 gfp_t gfp) in btree_insert_level() argument
456 err = btree_grow(head, geo, gfp); in btree_insert_level()
472 new = btree_node_alloc(head, gfp); in btree_insert_level()
477 new, level + 1, gfp); in btree_insert_level()
510 unsigned long *key, void *val, gfp_t gfp) in btree_insert() argument
513 return btree_insert_level(head, geo, key, val, 1, gfp); in btree_insert()
[all …]
Ddebugobjects.c84 gfp_t gfp = GFP_ATOMIC | __GFP_NORETRY | __GFP_NOWARN; in fill_pool() local
96 new = kmem_cache_zalloc(obj_cache, gfp); in fill_pool()