125 	struct airq_iv *iv;  in airq_iv_create()  local
128 	iv = kzalloc(sizeof(*iv), GFP_KERNEL);  in airq_iv_create()
129 	if (!iv)  in airq_iv_create()
131 	iv->bits = bits;  in airq_iv_create()
133 	iv->vector = kzalloc(size, GFP_KERNEL);  in airq_iv_create()
134 	if (!iv->vector)  in airq_iv_create()
137 		iv->avail = kmalloc(size, GFP_KERNEL);  in airq_iv_create()
138 		if (!iv->avail)  in airq_iv_create()
140 		memset(iv->avail, 0xff, size);  in airq_iv_create()
141 		iv->end = 0;  in airq_iv_create()
143 		iv->end = bits;  in airq_iv_create()
145 		iv->bitlock = kzalloc(size, GFP_KERNEL);  in airq_iv_create()
146 		if (!iv->bitlock)  in airq_iv_create()
151 		iv->ptr = kzalloc(size, GFP_KERNEL);  in airq_iv_create()
152 		if (!iv->ptr)  in airq_iv_create()
157 		iv->data = kzalloc(size, GFP_KERNEL);  in airq_iv_create()
158 		if (!iv->data)  in airq_iv_create()
161 	spin_lock_init(&iv->lock);  in airq_iv_create()
162 	return iv;  in airq_iv_create()
165 	kfree(iv->ptr);  in airq_iv_create()
166 	kfree(iv->bitlock);  in airq_iv_create()
167 	kfree(iv->avail);  in airq_iv_create()
168 	kfree(iv->vector);  in airq_iv_create()
169 	kfree(iv);  in airq_iv_create()
179 void airq_iv_release(struct airq_iv *iv)  in airq_iv_release()  argument
181 	kfree(iv->data);  in airq_iv_release()
182 	kfree(iv->ptr);  in airq_iv_release()
183 	kfree(iv->bitlock);  in airq_iv_release()
184 	kfree(iv->vector);  in airq_iv_release()
185 	kfree(iv->avail);  in airq_iv_release()
186 	kfree(iv);  in airq_iv_release()
199 unsigned long airq_iv_alloc(struct airq_iv *iv, unsigned long num)  in airq_iv_alloc()  argument
203 	if (!iv->avail || num == 0)  in airq_iv_alloc()
205 	spin_lock_irqsave(&iv->lock, flags);  in airq_iv_alloc()
206 	bit = find_first_bit_inv(iv->avail, iv->bits);  in airq_iv_alloc()
207 	while (bit + num <= iv->bits) {  in airq_iv_alloc()
209 			if (!test_bit_inv(bit + i, iv->avail))  in airq_iv_alloc()
214 				clear_bit_inv(bit + i, iv->avail);  in airq_iv_alloc()
215 			if (bit + num >= iv->end)  in airq_iv_alloc()
216 				iv->end = bit + num + 1;  in airq_iv_alloc()
219 		bit = find_next_bit_inv(iv->avail, iv->bits, bit + i + 1);  in airq_iv_alloc()
221 	if (bit + num > iv->bits)  in airq_iv_alloc()
223 	spin_unlock_irqrestore(&iv->lock, flags);  in airq_iv_alloc()
234 void airq_iv_free(struct airq_iv *iv, unsigned long bit, unsigned long num)  in airq_iv_free()  argument
238 	if (!iv->avail || num == 0)  in airq_iv_free()
240 	spin_lock_irqsave(&iv->lock, flags);  in airq_iv_free()
243 		clear_bit_inv(bit + i, iv->vector);  in airq_iv_free()
245 		set_bit_inv(bit + i, iv->avail);  in airq_iv_free()
247 	if (bit + num >= iv->end) {  in airq_iv_free()
249 		while (iv->end > 0 && !test_bit_inv(iv->end - 1, iv->avail))  in airq_iv_free()
250 			iv->end--;  in airq_iv_free()
252 	spin_unlock_irqrestore(&iv->lock, flags);  in airq_iv_free()
265 unsigned long airq_iv_scan(struct airq_iv *iv, unsigned long start,  in airq_iv_scan()  argument
271 	bit = find_next_bit_inv(iv->vector, end, start);  in airq_iv_scan()
274 	clear_bit_inv(bit, iv->vector);  in airq_iv_scan()