litmus-rt.git - The LITMUS^RT kernel.

diff options

author	Linus Torvalds <torvalds@linux-foundation.org>	2010-10-17 12:38:08 -0400
committer	Linus Torvalds <torvalds@linux-foundation.org>	2010-10-17 12:38:08 -0400
commit	2b666ca4a68cbc22483b0f2e1ba3c0e59b01ae9e (patch)
tree	6f5747156465192ba724f79c12f3e06b3bddf4a0 /net/unix/garbage.c
parent	2d019713b7acbc01d769a1e512ca1f9a04c30bd0 (diff)
parent	aa73aec6c385e2c797ac25cc7ccf0318031de7c8 (diff)

Merge branch 'fix/misc' of git://git.kernel.org/pub/scm/linux/kernel/git/tiwai/sound-2.6

* 'fix/misc' of git://git.kernel.org/pub/scm/linux/kernel/git/tiwai/sound-2.6: ALSA: rawmidi: fix oops (use after free) when unloading a driver module

Diffstat (limited to 'net/unix/garbage.c')

0 files changed, 0 insertions, 0 deletions

/* * Register cache access API - LZO caching support * * Copyright 2011 Wolfson Microelectronics plc * * Author: Dimitris Papastamos <dp@opensource.wolfsonmicro.com> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. */ #include <linux/slab.h> #include <linux/device.h> #include <linux/lzo.h> #include "internal.h" static int regcache_lzo_exit(struct regmap *map); struct regcache_lzo_ctx { void *wmem; void *dst; const void *src; size_t src_len; size_t dst_len; size_t decompressed_size; unsigned long *sync_bmp; int sync_bmp_nbits; }; #define LZO_BLOCK_NUM 8 static int regcache_lzo_block_count(struct regmap *map) { return LZO_BLOCK_NUM; } static int regcache_lzo_prepare(struct regcache_lzo_ctx *lzo_ctx) { lzo_ctx->wmem = kmalloc(LZO1X_MEM_COMPRESS, GFP_KERNEL); if (!lzo_ctx->wmem) return -ENOMEM; return 0; } static int regcache_lzo_compress(struct regcache_lzo_ctx *lzo_ctx) { size_t compress_size; int ret; ret = lzo1x_1_compress(lzo_ctx->src, lzo_ctx->src_len, lzo_ctx->dst, &compress_size, lzo_ctx->wmem); if (ret != LZO_E_OK || compress_size > lzo_ctx->dst_len) return -EINVAL; lzo_ctx->dst_len = compress_size; return 0; } static int regcache_lzo_decompress(struct regcache_lzo_ctx *lzo_ctx) { size_t dst_len; int ret; dst_len = lzo_ctx->dst_len; ret = lzo1x_decompress_safe(lzo_ctx->src, lzo_ctx->src_len, lzo_ctx->dst, &dst_len); if (ret != LZO_E_OK || dst_len != lzo_ctx->dst_len) return -EINVAL; return 0; } static int regcache_lzo_compress_cache_block(struct regmap *map, struct regcache_lzo_ctx *lzo_ctx) { int ret; lzo_ctx->dst_len = lzo1x_worst_compress(PAGE_SIZE); lzo_ctx->dst = kmalloc(lzo_ctx->dst_len, GFP_KERNEL); if (!lzo_ctx->dst) { lzo_ctx->dst_len = 0; return -ENOMEM; } ret = regcache_lzo_compress(lzo_ctx); if (ret < 0) return ret; return 0; } static int regcache_lzo_decompress_cache_block(struct regmap *map, struct regcache_lzo_ctx *lzo_ctx) { int ret; lzo_ctx->dst_len = lzo_ctx->decompressed_size; lzo_ctx->dst = kmalloc(lzo_ctx->dst_len, GFP_KERNEL); if (!lzo_ctx->dst) { lzo_ctx->dst_len = 0; return -ENOMEM; } ret = regcache_lzo_decompress(lzo_ctx); if (ret < 0) return ret; return 0; } static inline int regcache_lzo_get_blkindex(struct regmap *map, unsigned int reg) { return ((reg / map->reg_stride) * map->cache_word_size) / DIV_ROUND_UP(map->cache_size_raw, regcache_lzo_block_count(map)); } static inline int regcache_lzo_get_blkpos(struct regmap *map, unsigned int reg) { return (reg / map->reg_stride) % (DIV_ROUND_UP(map->cache_size_raw, regcache_lzo_block_count(map)) / map->cache_word_size); } static inline int regcache_lzo_get_blksize(struct regmap *map) { return DIV_ROUND_UP(map->cache_size_raw, regcache_lzo_block_count(map)); } static int regcache_lzo_init(struct regmap *map) { struct regcache_lzo_ctx **lzo_blocks; size_t bmp_size; int ret, i, blksize, blkcount; const char *p, *end; unsigned long *sync_bmp; ret = 0; blkcount = regcache_lzo_block_count(map); map->cache = kzalloc(blkcount * sizeof *lzo_blocks, GFP_KERNEL); if (!map->cache) return -ENOMEM; lzo_blocks = map->cache; /* * allocate a bitmap to be used when syncing the cache with * the hardware. Each time a register is modified, the corresponding * bit is set in the bitmap, so we know that we have to sync * that register. */ bmp_size = map->num_reg_defaults_raw; sync_bmp = kmalloc(BITS_TO_LONGS(bmp_size) * sizeof(long), GFP_KERNEL); if (!sync_bmp) { ret = -ENOMEM; goto err; } bitmap_zero(sync_bmp, bmp_size); /* allocate the lzo blocks and initialize them */ for (i = 0; i < blkcount; i++) { lzo_blocks[i] = kzalloc(sizeof **lzo_blocks, GFP_KERNEL); if (!lzo_blocks[i]) { kfree(sync_bmp); ret = -ENOMEM; goto err; } lzo_blocks[i]->sync_bmp = sync_bmp; lzo_blocks[i]->sync_bmp_nbits = bmp_size; /* alloc the working space for the compressed block */ ret = regcache_lzo_prepare(lzo_blocks[i]); if (ret < 0) goto err; } blksize = regcache_lzo_get_blksize(map); p = map->reg_defaults_raw; end = map->reg_defaults_raw + map->cache_size_raw; /* compress the register map and fill the lzo blocks */ for (i = 0; i < blkcount; i++, p += blksize) { lzo_blocks[i]->src = p; if (p + blksize > end) lzo_blocks[i]->src_len = end - p; else lzo_blocks[i]->src_len = blksize; ret = regcache_lzo_compress_cache_block(map, lzo_blocks[i]); if (ret < 0) goto err; lzo_blocks[i]->decompressed_size = lzo_blocks[i]->src_len; } return 0; err: regcache_lzo_exit(map); return ret; } static int regcache_lzo_exit(struct regmap *map) { struct regcache_lzo_ctx **lzo_blocks; int i, blkcount; lzo_blocks = map->cache; if (!lzo_blocks) return 0; blkcount = regcache_lzo_block_count(map); /* * the pointer to the bitmap used for syncing the cache * is shared amongst all lzo_blocks. Ensure it is freed * only once. */


context:
space:
mode: