diff options
-rw-r--r-- | lib/idr.c | 8 |
1 files changed, 5 insertions, 3 deletions
@@ -595,8 +595,10 @@ EXPORT_SYMBOL(idr_for_each); | |||
595 | * Returns pointer to registered object with id, which is next number to | 595 | * Returns pointer to registered object with id, which is next number to |
596 | * given id. After being looked up, *@nextidp will be updated for the next | 596 | * given id. After being looked up, *@nextidp will be updated for the next |
597 | * iteration. | 597 | * iteration. |
598 | * | ||
599 | * This function can be called under rcu_read_lock(), given that the leaf | ||
600 | * pointers lifetimes are correctly managed. | ||
598 | */ | 601 | */ |
599 | |||
600 | void *idr_get_next(struct idr *idp, int *nextidp) | 602 | void *idr_get_next(struct idr *idp, int *nextidp) |
601 | { | 603 | { |
602 | struct idr_layer *p, *pa[MAX_LEVEL]; | 604 | struct idr_layer *p, *pa[MAX_LEVEL]; |
@@ -605,11 +607,11 @@ void *idr_get_next(struct idr *idp, int *nextidp) | |||
605 | int n, max; | 607 | int n, max; |
606 | 608 | ||
607 | /* find first ent */ | 609 | /* find first ent */ |
608 | n = idp->layers * IDR_BITS; | ||
609 | max = 1 << n; | ||
610 | p = rcu_dereference_raw(idp->top); | 610 | p = rcu_dereference_raw(idp->top); |
611 | if (!p) | 611 | if (!p) |
612 | return NULL; | 612 | return NULL; |
613 | n = (p->layer + 1) * IDR_BITS; | ||
614 | max = 1 << n; | ||
613 | 615 | ||
614 | while (id < max) { | 616 | while (id < max) { |
615 | while (n > 0 && p) { | 617 | while (n > 0 && p) { |