#include #include #include #include #include #include #include #include #include #include #include int nr_allocated; int preempt_count; struct kmem_cache { pthread_mutex_t lock; int size; int nr_objs; void *objs; void (*ctor)(void *); }; void *mempool_alloc(mempool_t *pool, int gfp_mask) { return pool->alloc(gfp_mask, pool->data); } void mempool_free(void *element, mempool_t *pool) { pool->free(element, pool->data); } mempool_t *mempool_create(int min_nr, mempool_alloc_t *alloc_fn, mempool_free_t *free_fn, void *pool_data) { mempool_t *ret = malloc(sizeof(*ret)); ret->alloc = alloc_fn; ret->free = free_fn; ret->data = pool_data; return ret; } void *kmem_cache_alloc(struct kmem_cache *cachep, int flags) { struct radix_tree_node *node; if (flags & __GFP_NOWARN) return NULL; pthread_mutex_lock(&cachep->lock); if (cachep->nr_objs) { cachep->nr_objs--; node = cachep->objs; cachep->objs = node->private_data; pthread_mutex_unlock(&cachep->lock); node->private_data = NULL; } else { pthread_mutex_unlock(&cachep->lock); node = malloc(cachep->size); if (cachep->ctor) cachep->ctor(node); } uatomic_inc(&nr_allocated); return node; } void kmem_cache_free(struct kmem_cache *cachep, void *objp) { assert(objp); uatomic_dec(&nr_allocated); pthread_mutex_lock(&cachep->lock); if (cachep->nr_objs > 10) { memset(objp, POISON_FREE, cachep->size); free(objp); } else { struct radix_tree_node *node = objp; cachep->nr_objs++; node->private_data = cachep->objs; cachep->objs = node; } pthread_mutex_unlock(&cachep->lock); } void *kmalloc(size_t size, gfp_t gfp) { void *ret = malloc(size); uatomic_inc(&nr_allocated); return ret; } void kfree(void *p) { if (!p) return; uatomic_dec(&nr_allocated); free(p); } struct kmem_cache * kmem_cache_create(const char *name, size_t size, size_t offset, unsigned long flags, void (*ctor)(void *)) { struct kmem_cache *ret = malloc(sizeof(*ret)); pthread_mutex_init(&ret->lock, NULL); ret->size = size; ret->nr_objs = 0; ret->objs = NULL; ret->ctor = ctor; return ret; } d/soc'>

path: root/sound/soc

Age	Commit message (Expand)	Author	Files	Lines