Lines Matching refs:iv
130 struct airq_iv *iv; in airq_iv_create() local
133 iv = kzalloc(sizeof(*iv), GFP_KERNEL); in airq_iv_create()
134 if (!iv) in airq_iv_create()
136 iv->bits = bits; in airq_iv_create()
137 iv->flags = flags; in airq_iv_create()
145 iv->vector = dma_pool_zalloc(airq_iv_cache, GFP_KERNEL, in airq_iv_create()
146 &iv->vector_dma); in airq_iv_create()
147 if (!iv->vector) in airq_iv_create()
150 iv->vector = vec; in airq_iv_create()
152 iv->vector = cio_dma_zalloc(size); in airq_iv_create()
153 if (!iv->vector) in airq_iv_create()
157 iv->avail = kmalloc(size, GFP_KERNEL); in airq_iv_create()
158 if (!iv->avail) in airq_iv_create()
160 memset(iv->avail, 0xff, size); in airq_iv_create()
161 iv->end = 0; in airq_iv_create()
163 iv->end = bits; in airq_iv_create()
165 iv->bitlock = kzalloc(size, GFP_KERNEL); in airq_iv_create()
166 if (!iv->bitlock) in airq_iv_create()
171 iv->ptr = kzalloc(size, GFP_KERNEL); in airq_iv_create()
172 if (!iv->ptr) in airq_iv_create()
177 iv->data = kzalloc(size, GFP_KERNEL); in airq_iv_create()
178 if (!iv->data) in airq_iv_create()
181 spin_lock_init(&iv->lock); in airq_iv_create()
182 return iv; in airq_iv_create()
185 kfree(iv->ptr); in airq_iv_create()
186 kfree(iv->bitlock); in airq_iv_create()
187 kfree(iv->avail); in airq_iv_create()
188 if (iv->flags & AIRQ_IV_CACHELINE && iv->vector) in airq_iv_create()
189 dma_pool_free(airq_iv_cache, iv->vector, iv->vector_dma); in airq_iv_create()
190 else if (!(iv->flags & AIRQ_IV_GUESTVEC)) in airq_iv_create()
191 cio_dma_free(iv->vector, size); in airq_iv_create()
192 kfree(iv); in airq_iv_create()
202 void airq_iv_release(struct airq_iv *iv) in airq_iv_release() argument
204 kfree(iv->data); in airq_iv_release()
205 kfree(iv->ptr); in airq_iv_release()
206 kfree(iv->bitlock); in airq_iv_release()
207 if (iv->flags & AIRQ_IV_CACHELINE) in airq_iv_release()
208 dma_pool_free(airq_iv_cache, iv->vector, iv->vector_dma); in airq_iv_release()
209 else if (!(iv->flags & AIRQ_IV_GUESTVEC)) in airq_iv_release()
210 cio_dma_free(iv->vector, iv_size(iv->bits)); in airq_iv_release()
211 kfree(iv->avail); in airq_iv_release()
212 kfree(iv); in airq_iv_release()
225 unsigned long airq_iv_alloc(struct airq_iv *iv, unsigned long num) in airq_iv_alloc() argument
229 if (!iv->avail || num == 0) in airq_iv_alloc()
231 spin_lock_irqsave(&iv->lock, flags); in airq_iv_alloc()
232 bit = find_first_bit_inv(iv->avail, iv->bits); in airq_iv_alloc()
233 while (bit + num <= iv->bits) { in airq_iv_alloc()
235 if (!test_bit_inv(bit + i, iv->avail)) in airq_iv_alloc()
240 clear_bit_inv(bit + i, iv->avail); in airq_iv_alloc()
241 if (bit + num >= iv->end) in airq_iv_alloc()
242 iv->end = bit + num + 1; in airq_iv_alloc()
245 bit = find_next_bit_inv(iv->avail, iv->bits, bit + i + 1); in airq_iv_alloc()
247 if (bit + num > iv->bits) in airq_iv_alloc()
249 spin_unlock_irqrestore(&iv->lock, flags); in airq_iv_alloc()
260 void airq_iv_free(struct airq_iv *iv, unsigned long bit, unsigned long num) in airq_iv_free() argument
264 if (!iv->avail || num == 0) in airq_iv_free()
266 spin_lock_irqsave(&iv->lock, flags); in airq_iv_free()
269 clear_bit_inv(bit + i, iv->vector); in airq_iv_free()
271 set_bit_inv(bit + i, iv->avail); in airq_iv_free()
273 if (bit + num >= iv->end) { in airq_iv_free()
275 while (iv->end > 0 && !test_bit_inv(iv->end - 1, iv->avail)) in airq_iv_free()
276 iv->end--; in airq_iv_free()
278 spin_unlock_irqrestore(&iv->lock, flags); in airq_iv_free()
291 unsigned long airq_iv_scan(struct airq_iv *iv, unsigned long start, in airq_iv_scan() argument
297 bit = find_next_bit_inv(iv->vector, end, start); in airq_iv_scan()
300 clear_bit_inv(bit, iv->vector); in airq_iv_scan()