radix_tree_node_cachep (reference) in projects: kernel - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:radix_tree_node_cachep (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/lib/
H A D	radix-tree.c	33 struct kmem_cache *radix_tree_node_cachep; variable 251 ret = kmem_cache_alloc(radix_tree_node_cachep, in radix_tree_node_alloc() 274 ret = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); in radix_tree_node_alloc() 302 kmem_cache_free(radix_tree_node_cachep, node); in radix_tree_node_rcu_free() 336 node = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); in __radix_tree_preload() 346 kmem_cache_free(radix_tree_node_cachep, node); in __radix_tree_preload() 1585 kmem_cache_free(radix_tree_node_cachep, node); in radix_tree_cpu_dead() 1598 radix_tree_node_cachep = kmem_cache_create("radix_tree_node", in radix_tree_init()
H A D	xarray.c	`249 extern struct kmem_cache *radix_tree_node_cachep; 305 xas->xa_alloc = kmem_cache_alloc(radix_tree_node_cachep, gfp); in xas_nomem() 337 xas->xa_alloc = kmem_cache_alloc(radix_tree_node_cachep, gfp); 340 xas->xa_alloc = kmem_cache_alloc(radix_tree_node_cachep, gfp); 374 node = kmem_cache_alloc(radix_tree_node_cachep, gfp); in xas_alloc() 1019 node = kmem_cache_alloc(radix_tree_node_cachep, gfp); in xas_split_alloc()`
/kernel/linux/linux-6.6/lib/
H A D	radix-tree.c	35 struct kmem_cache *radix_tree_node_cachep; variable 253 ret = kmem_cache_alloc(radix_tree_node_cachep, in radix_tree_node_alloc() 276 ret = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); in radix_tree_node_alloc() 304 kmem_cache_free(radix_tree_node_cachep, node); in radix_tree_node_rcu_free() 338 node = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); in __radix_tree_preload() 348 kmem_cache_free(radix_tree_node_cachep, node); in __radix_tree_preload() 1588 kmem_cache_free(radix_tree_node_cachep, node); in radix_tree_cpu_dead() 1601 radix_tree_node_cachep = kmem_cache_create("radix_tree_node", in radix_tree_init()
H A D	xarray.c	`306 xas->xa_alloc = kmem_cache_alloc_lru(radix_tree_node_cachep, xas->xa_lru, gfp); in xas_nomem() 338 xas->xa_alloc = kmem_cache_alloc_lru(radix_tree_node_cachep, xas->xa_lru, gfp); 341 xas->xa_alloc = kmem_cache_alloc_lru(radix_tree_node_cachep, xas->xa_lru, gfp); 375 node = kmem_cache_alloc_lru(radix_tree_node_cachep, xas->xa_lru, gfp); in xas_alloc() 1020 node = kmem_cache_alloc_lru(radix_tree_node_cachep, xas->xa_lru, gfp); in xas_split_alloc()`

Completed in 11 milliseconds