aboutsummaryrefslogtreecommitdiffstats
path: root/net/ceph/osdmap.c
diff options
context:
space:
mode:
authorXi Wang <xi.wang@gmail.com>2012-06-06 20:35:55 -0400
committerAlex Elder <elder@dreamhost.com>2012-06-07 09:28:04 -0400
commitad3b904c07dfa88603689bf9a67bffbb9b99beb5 (patch)
tree20a5127aaa57f0b727c45ce780993b850ae6b36d /net/ceph/osdmap.c
parent43643528cce60ca184fe8197efa8e8da7c89a037 (diff)
libceph: fix overflow in __decode_pool_names()
`len' is read from network and thus needs validation. Otherwise a large `len' would cause out-of-bounds access via the memcpy() call. In addition, len = 0xffffffff would overflow the kmalloc() size, leading to out-of-bounds write. This patch adds a check of `len' via ceph_decode_need(). Also use kstrndup rather than kmalloc/memcpy. [elder@inktank.com: added -ENOMEM return for null kstrndup() result] Signed-off-by: Xi Wang <xi.wang@gmail.com> Reviewed-by: Alex Elder <elder@inktank.com>
Diffstat (limited to 'net/ceph/osdmap.c')
-rw-r--r--net/ceph/osdmap.c13
1 files changed, 7 insertions, 6 deletions
diff --git a/net/ceph/osdmap.c b/net/ceph/osdmap.c
index 1892c523c43c..df47871b8389 100644
--- a/net/ceph/osdmap.c
+++ b/net/ceph/osdmap.c
@@ -488,15 +488,16 @@ static int __decode_pool_names(void **p, void *end, struct ceph_osdmap *map)
488 ceph_decode_32_safe(p, end, pool, bad); 488 ceph_decode_32_safe(p, end, pool, bad);
489 ceph_decode_32_safe(p, end, len, bad); 489 ceph_decode_32_safe(p, end, len, bad);
490 dout(" pool %d len %d\n", pool, len); 490 dout(" pool %d len %d\n", pool, len);
491 ceph_decode_need(p, end, len, bad);
491 pi = __lookup_pg_pool(&map->pg_pools, pool); 492 pi = __lookup_pg_pool(&map->pg_pools, pool);
492 if (pi) { 493 if (pi) {
494 char *name = kstrndup(*p, len, GFP_NOFS);
495
496 if (!name)
497 return -ENOMEM;
493 kfree(pi->name); 498 kfree(pi->name);
494 pi->name = kmalloc(len + 1, GFP_NOFS); 499 pi->name = name;
495 if (pi->name) { 500 dout(" name is %s\n", pi->name);
496 memcpy(pi->name, *p, len);
497 pi->name[len] = '\0';
498 dout(" name is %s\n", pi->name);
499 }
500 } 501 }
501 *p += len; 502 *p += len;
502 } 503 }