Home
last modified time | relevance | path

Searched refs:sheaf (Results 1 – 5 of 5) sorted by relevance

/linux/mm/
H A Dslub.c136 * or spare sheaf can handle the allocation or free, there is no other
142 * serve an empty or full sheaf if available, and avoid more expensive refill
341 FREE_RCU_SHEAF, /* Free to rcu_free sheaf */
342 FREE_RCU_SHEAF_FAIL, /* Failed to free to a rcu_free sheaf */
348 ALLOC_NODE_MISMATCH, /* Requested node different from cpu sheaf */
352 SHEAF_FLUSH, /* Objects flushed from a sheaf */
353 SHEAF_REFILL, /* Objects refilled to a sheaf */
354 SHEAF_ALLOC, /* Allocation of an empty sheaf */
355 SHEAF_FREE, /* Freeing of an empty sheaf */
356 BARN_GET, /* Got full sheaf fro
2754 struct slab_sheaf *sheaf; __alloc_empty_sheaf() local
2789 free_empty_sheaf(struct kmem_cache * s,struct slab_sheaf * sheaf) free_empty_sheaf() argument
2809 refill_sheaf(struct kmem_cache * s,struct slab_sheaf * sheaf,gfp_t gfp) refill_sheaf() argument
2834 struct slab_sheaf *sheaf = alloc_empty_sheaf(s, gfp); alloc_full_sheaf() local
2871 struct slab_sheaf *sheaf; __sheaf_flush_main_batch() local
2932 sheaf_flush_unused(struct kmem_cache * s,struct slab_sheaf * sheaf) sheaf_flush_unused() argument
2945 __rcu_free_sheaf_prepare(struct kmem_cache * s,struct slab_sheaf * sheaf) __rcu_free_sheaf_prepare() argument
2974 struct slab_sheaf *sheaf; rcu_free_sheaf_nobarn() local
3122 barn_put_empty_sheaf(struct node_barn * barn,struct slab_sheaf * sheaf) barn_put_empty_sheaf() argument
3134 barn_put_full_sheaf(struct node_barn * barn,struct slab_sheaf * sheaf) barn_put_full_sheaf() argument
3148 struct slab_sheaf *sheaf = NULL; barn_get_full_or_empty_sheaf() local
3258 struct slab_sheaf *sheaf, *sheaf2; barn_shrink() local
4930 __prefill_sheaf_pfmemalloc(struct kmem_cache * s,struct slab_sheaf * sheaf,gfp_t gfp) __prefill_sheaf_pfmemalloc() argument
4967 struct slab_sheaf *sheaf = NULL; kmem_cache_prefill_sheaf() local
5049 kmem_cache_return_sheaf(struct kmem_cache * s,gfp_t gfp,struct slab_sheaf * sheaf) kmem_cache_return_sheaf() argument
5106 struct slab_sheaf *sheaf; kmem_cache_refill_sheaf() local
5160 kmem_cache_alloc_from_sheaf_noprof(struct kmem_cache * s,gfp_t gfp,struct slab_sheaf * sheaf) kmem_cache_alloc_from_sheaf_noprof() argument
5183 kmem_cache_sheaf_size(struct slab_sheaf * sheaf) kmem_cache_sheaf_size() argument
5795 struct slab_sheaf *sheaf; rcu_free_sheaf() local
[all...]
/linux/tools/include/linux/
H A Dslab.h193 struct slab_sheaf *sheaf);
196 struct slab_sheaf *sheaf);
200 static inline unsigned int kmem_cache_sheaf_size(struct slab_sheaf *sheaf) in kmem_cache_sheaf_size() argument
202 return sheaf->size; in kmem_cache_sheaf_size()
/linux/include/linux/
H A Dslab.h837 struct slab_sheaf *sheaf);
840 struct slab_sheaf *sheaf) __assume_slab_alignment __malloc;
844 unsigned int kmem_cache_sheaf_size(struct slab_sheaf *sheaf);
/linux/lib/
H A Dmaple_tree.c182 static void mt_return_sheaf(struct slab_sheaf *sheaf) in mt_return_sheaf() argument
184 kmem_cache_return_sheaf(maple_node_cache, GFP_NOWAIT, sheaf); in mt_return_sheaf()
192 static int mt_refill_sheaf(gfp_t gfp, struct slab_sheaf **sheaf, in mt_refill_sheaf() argument
195 return kmem_cache_refill_sheaf(maple_node_cache, gfp, sheaf, size); in mt_refill_sheaf()
1083 if (WARN_ON_ONCE(!mas->sheaf)) in mas_pop_node()
1086 ret = kmem_cache_alloc_from_sheaf(maple_node_cache, GFP_NOWAIT, mas->sheaf); in mas_pop_node()
1104 if (mas->sheaf) in mas_alloc_nodes()
1124 if (mas->sheaf) { in mas_alloc_nodes()
1128 if (kmem_cache_sheaf_size(mas->sheaf) >= refill) { in mas_alloc_nodes()
1133 if (mt_refill_sheaf(gfp, &mas->sheaf, refill)) in mas_alloc_nodes()
[all …]
/linux/tools/testing/radix-tree/
H A Dmaple.c35093 if (mas->sheaf) in mas_allocated()
35094 total += kmem_cache_sheaf_size(mas->sheaf); in mas_allocated()