diff options
-rw-r--r-- | lib/idr.c | 7 |
1 files changed, 4 insertions, 3 deletions
@@ -140,7 +140,8 @@ static int sub_alloc(struct idr *idp, int *starting_id, struct idr_layer **pa) | |||
140 | id = *starting_id; | 140 | id = *starting_id; |
141 | restart: | 141 | restart: |
142 | p = idp->top; | 142 | p = idp->top; |
143 | l = p->layer; | 143 | l = idp->layers; |
144 | pa[l--] = NULL; | ||
144 | while (1) { | 145 | while (1) { |
145 | /* | 146 | /* |
146 | * We run around this while until we reach the leaf node... | 147 | * We run around this while until we reach the leaf node... |
@@ -154,8 +155,8 @@ static int sub_alloc(struct idr *idp, int *starting_id, struct idr_layer **pa) | |||
154 | oid = id; | 155 | oid = id; |
155 | id = (id | ((1 << (IDR_BITS * l)) - 1)) + 1; | 156 | id = (id | ((1 << (IDR_BITS * l)) - 1)) + 1; |
156 | 157 | ||
157 | /* did id go over the limit? */ | 158 | /* if already at the top layer, we need to grow */ |
158 | if (id >= (1 << (idp->layers * IDR_BITS))) { | 159 | if (!(p = pa[l])) { |
159 | *starting_id = id; | 160 | *starting_id = id; |
160 | return IDR_NEED_TO_GROW; | 161 | return IDR_NEED_TO_GROW; |
161 | } | 162 | } |