diff options
author | Tejun Heo <tj@kernel.org> | 2013-02-27 20:05:04 -0500 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2013-02-27 22:10:20 -0500 |
commit | e8c8d1bc063bc88cfa1356266027b5075d3a82d7 (patch) | |
tree | b657e3a3aa9eb8499690bb2fc0cbd908cdd2a334 /lib | |
parent | 326cf0f0f308933c10236280a322031f0097205d (diff) |
idr: remove MAX_IDR_MASK and move left MAX_IDR_* into idr.c
MAX_IDR_MASK is another weirdness in the idr interface. As idr covers
whole positive integer range, it's defined as 0x7fffffff or INT_MAX.
Its usage in idr_find(), idr_replace() and idr_remove() is bizarre.
They basically mask off the sign bit and operate on the rest, so if
the caller, by accident, passes in a negative number, the sign bit
will be masked off and the remaining part will be used as if that was
the input, which is worse than crashing.
The constant is visible in idr.h and there are several users in the
kernel.
* drivers/i2c/i2c-core.c:i2c_add_numbered_adapter()
Basically used to test if adap->nr is a negative number which isn't
-1 and returns -EINVAL if so. idr_alloc() already has negative
@start checking (w/ WARN_ON_ONCE), so this can go away.
* drivers/infiniband/core/cm.c:cm_alloc_id()
drivers/infiniband/hw/mlx4/cm.c:id_map_alloc()
Used to wrap cyclic @start. Can be replaced with max(next, 0).
Note that this type of cyclic allocation using idr is buggy. These
are prone to spurious -ENOSPC failure after the first wraparound.
* fs/super.c:get_anon_bdev()
The ID allocated from ida is masked off before being tested whether
it's inside valid range. ida allocated ID can never be a negative
number and the masking is unnecessary.
Update idr_*() functions to fail with -EINVAL when negative @id is
specified and update other MAX_IDR_MASK users as described above.
This leaves MAX_IDR_MASK without any user, remove it and relocate
other MAX_IDR_* constants to lib/idr.c.
Signed-off-by: Tejun Heo <tj@kernel.org>
Cc: Jean Delvare <khali@linux-fr.org>
Cc: Roland Dreier <roland@kernel.org>
Cc: Sean Hefty <sean.hefty@intel.com>
Cc: Hal Rosenstock <hal.rosenstock@gmail.com>
Cc: "Marciniszyn, Mike" <mike.marciniszyn@intel.com>
Cc: Jack Morgenstein <jackm@dev.mellanox.co.il>
Cc: Or Gerlitz <ogerlitz@mellanox.com>
Cc: Al Viro <viro@zeniv.linux.org.uk>
Acked-by: Wolfram Sang <wolfram@the-dreams.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib')
-rw-r--r-- | lib/idr.c | 24 |
1 files changed, 17 insertions, 7 deletions
@@ -38,6 +38,15 @@ | |||
38 | #include <linux/percpu.h> | 38 | #include <linux/percpu.h> |
39 | #include <linux/hardirq.h> | 39 | #include <linux/hardirq.h> |
40 | 40 | ||
41 | #define MAX_IDR_SHIFT (sizeof(int) * 8 - 1) | ||
42 | #define MAX_IDR_BIT (1U << MAX_IDR_SHIFT) | ||
43 | |||
44 | /* Leave the possibility of an incomplete final layer */ | ||
45 | #define MAX_IDR_LEVEL ((MAX_IDR_SHIFT + IDR_BITS - 1) / IDR_BITS) | ||
46 | |||
47 | /* Number of id_layer structs to leave in free list */ | ||
48 | #define MAX_IDR_FREE (MAX_IDR_LEVEL * 2) | ||
49 | |||
41 | static struct kmem_cache *idr_layer_cache; | 50 | static struct kmem_cache *idr_layer_cache; |
42 | static DEFINE_PER_CPU(struct idr_layer *, idr_preload_head); | 51 | static DEFINE_PER_CPU(struct idr_layer *, idr_preload_head); |
43 | static DEFINE_PER_CPU(int, idr_preload_cnt); | 52 | static DEFINE_PER_CPU(int, idr_preload_cnt); |
@@ -542,8 +551,8 @@ void idr_remove(struct idr *idp, int id) | |||
542 | struct idr_layer *p; | 551 | struct idr_layer *p; |
543 | struct idr_layer *to_free; | 552 | struct idr_layer *to_free; |
544 | 553 | ||
545 | /* Mask off upper bits we don't use for the search. */ | 554 | if (WARN_ON_ONCE(id < 0)) |
546 | id &= MAX_IDR_MASK; | 555 | return; |
547 | 556 | ||
548 | sub_remove(idp, (idp->layers - 1) * IDR_BITS, id); | 557 | sub_remove(idp, (idp->layers - 1) * IDR_BITS, id); |
549 | if (idp->top && idp->top->count == 1 && (idp->layers > 1) && | 558 | if (idp->top && idp->top->count == 1 && (idp->layers > 1) && |
@@ -650,14 +659,14 @@ void *idr_find(struct idr *idp, int id) | |||
650 | int n; | 659 | int n; |
651 | struct idr_layer *p; | 660 | struct idr_layer *p; |
652 | 661 | ||
662 | if (WARN_ON_ONCE(id < 0)) | ||
663 | return NULL; | ||
664 | |||
653 | p = rcu_dereference_raw(idp->top); | 665 | p = rcu_dereference_raw(idp->top); |
654 | if (!p) | 666 | if (!p) |
655 | return NULL; | 667 | return NULL; |
656 | n = (p->layer+1) * IDR_BITS; | 668 | n = (p->layer+1) * IDR_BITS; |
657 | 669 | ||
658 | /* Mask off upper bits we don't use for the search. */ | ||
659 | id &= MAX_IDR_MASK; | ||
660 | |||
661 | if (id > idr_max(p->layer + 1)) | 670 | if (id > idr_max(p->layer + 1)) |
662 | return NULL; | 671 | return NULL; |
663 | BUG_ON(n == 0); | 672 | BUG_ON(n == 0); |
@@ -799,14 +808,15 @@ void *idr_replace(struct idr *idp, void *ptr, int id) | |||
799 | int n; | 808 | int n; |
800 | struct idr_layer *p, *old_p; | 809 | struct idr_layer *p, *old_p; |
801 | 810 | ||
811 | if (WARN_ON_ONCE(id < 0)) | ||
812 | return ERR_PTR(-EINVAL); | ||
813 | |||
802 | p = idp->top; | 814 | p = idp->top; |
803 | if (!p) | 815 | if (!p) |
804 | return ERR_PTR(-EINVAL); | 816 | return ERR_PTR(-EINVAL); |
805 | 817 | ||
806 | n = (p->layer+1) * IDR_BITS; | 818 | n = (p->layer+1) * IDR_BITS; |
807 | 819 | ||
808 | id &= MAX_IDR_MASK; | ||
809 | |||
810 | if (id >= (1 << n)) | 820 | if (id >= (1 << n)) |
811 | return ERR_PTR(-EINVAL); | 821 | return ERR_PTR(-EINVAL); |
812 | 822 | ||