irqdesc.c 12.0 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
/*
 * Copyright (C) 1992, 1998-2006 Linus Torvalds, Ingo Molnar
 * Copyright (C) 2005-2006, Thomas Gleixner, Russell King
 *
 * This file contains the interrupt descriptor management code
 *
 * Detailed information is available in Documentation/DocBook/genericirq
 *
 */
#include <linux/irq.h>
#include <linux/slab.h>
12
#include <linux/export.h>
13 14 15
#include <linux/interrupt.h>
#include <linux/kernel_stat.h>
#include <linux/radix-tree.h>
16
#include <linux/bitmap.h>
17 18 19 20 21 22

#include "internals.h"

/*
 * lockdep: we want to handle all irq_desc locks as a single lock-class:
 */
23
static struct lock_class_key irq_desc_lock_class;
24

25
#if defined(CONFIG_SMP)
26 27 28 29 30 31 32 33 34 35 36
static void __init init_irq_default_affinity(void)
{
	alloc_cpumask_var(&irq_default_affinity, GFP_NOWAIT);
	cpumask_setall(irq_default_affinity);
}
#else
static void __init init_irq_default_affinity(void)
{
}
#endif

37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
#ifdef CONFIG_SMP
static int alloc_masks(struct irq_desc *desc, gfp_t gfp, int node)
{
	if (!zalloc_cpumask_var_node(&desc->irq_data.affinity, gfp, node))
		return -ENOMEM;

#ifdef CONFIG_GENERIC_PENDING_IRQ
	if (!zalloc_cpumask_var_node(&desc->pending_mask, gfp, node)) {
		free_cpumask_var(desc->irq_data.affinity);
		return -ENOMEM;
	}
#endif
	return 0;
}

static void desc_smp_init(struct irq_desc *desc, int node)
{
54
	desc->irq_data.node = node;
55
	cpumask_copy(desc->irq_data.affinity, irq_default_affinity);
56 57 58 59 60 61 62 63
#ifdef CONFIG_GENERIC_PENDING_IRQ
	cpumask_clear(desc->pending_mask);
#endif
}

static inline int desc_node(struct irq_desc *desc)
{
	return desc->irq_data.node;
64 65 66 67 68 69
}

#else
static inline int
alloc_masks(struct irq_desc *desc, gfp_t gfp, int node) { return 0; }
static inline void desc_smp_init(struct irq_desc *desc, int node) { }
70
static inline int desc_node(struct irq_desc *desc) { return 0; }
71 72
#endif

73 74
static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node,
		struct module *owner)
75
{
E
Eric Dumazet 已提交
76 77
	int cpu;

78 79 80 81 82
	desc->irq_data.irq = irq;
	desc->irq_data.chip = &no_irq_chip;
	desc->irq_data.chip_data = NULL;
	desc->irq_data.handler_data = NULL;
	desc->irq_data.msi_desc = NULL;
83
	irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
84
	irqd_set(&desc->irq_data, IRQD_IRQ_DISABLED);
85 86
	desc->handle_irq = handle_bad_irq;
	desc->depth = 1;
87 88
	desc->irq_count = 0;
	desc->irqs_unhandled = 0;
89
	desc->name = NULL;
90
	desc->owner = owner;
E
Eric Dumazet 已提交
91 92
	for_each_possible_cpu(cpu)
		*per_cpu_ptr(desc->kstat_irqs, cpu) = 0;
93 94 95
	desc_smp_init(desc, node);
}

96 97 98
int nr_irqs = NR_IRQS;
EXPORT_SYMBOL_GPL(nr_irqs);

T
Thomas Gleixner 已提交
99
static DEFINE_MUTEX(sparse_irq_lock);
100
static DECLARE_BITMAP(allocated_irqs, IRQ_BITMAP_BITS);
101

102 103
#ifdef CONFIG_SPARSE_IRQ

104
static RADIX_TREE(irq_desc_tree, GFP_KERNEL);
105

106
static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
107 108 109 110 111 112 113 114
{
	radix_tree_insert(&irq_desc_tree, irq, desc);
}

struct irq_desc *irq_to_desc(unsigned int irq)
{
	return radix_tree_lookup(&irq_desc_tree, irq);
}
115
EXPORT_SYMBOL(irq_to_desc);
116

117 118 119 120 121 122 123 124 125 126 127
static void delete_irq_desc(unsigned int irq)
{
	radix_tree_delete(&irq_desc_tree, irq);
}

#ifdef CONFIG_SMP
static void free_masks(struct irq_desc *desc)
{
#ifdef CONFIG_GENERIC_PENDING_IRQ
	free_cpumask_var(desc->pending_mask);
#endif
128
	free_cpumask_var(desc->irq_data.affinity);
129 130 131 132 133
}
#else
static inline void free_masks(struct irq_desc *desc) { }
#endif

134
static struct irq_desc *alloc_desc(int irq, int node, struct module *owner)
135 136
{
	struct irq_desc *desc;
137
	gfp_t gfp = GFP_KERNEL;
138 139 140 141 142

	desc = kzalloc_node(sizeof(*desc), gfp, node);
	if (!desc)
		return NULL;
	/* allocate based on nr_cpu_ids */
E
Eric Dumazet 已提交
143
	desc->kstat_irqs = alloc_percpu(unsigned int);
144 145 146 147 148 149 150 151 152
	if (!desc->kstat_irqs)
		goto err_desc;

	if (alloc_masks(desc, gfp, node))
		goto err_kstat;

	raw_spin_lock_init(&desc->lock);
	lockdep_set_class(&desc->lock, &irq_desc_lock_class);

153
	desc_set_defaults(irq, desc, node, owner);
154 155 156 157

	return desc;

err_kstat:
E
Eric Dumazet 已提交
158
	free_percpu(desc->kstat_irqs);
159 160 161 162 163 164 165 166 167
err_desc:
	kfree(desc);
	return NULL;
}

static void free_desc(unsigned int irq)
{
	struct irq_desc *desc = irq_to_desc(irq);

168 169
	unregister_irq_proc(irq, desc);

T
Thomas Gleixner 已提交
170
	mutex_lock(&sparse_irq_lock);
171
	delete_irq_desc(irq);
T
Thomas Gleixner 已提交
172
	mutex_unlock(&sparse_irq_lock);
173 174

	free_masks(desc);
E
Eric Dumazet 已提交
175
	free_percpu(desc->kstat_irqs);
176 177 178
	kfree(desc);
}

179 180
static int alloc_descs(unsigned int start, unsigned int cnt, int node,
		       struct module *owner)
181 182 183 184 185
{
	struct irq_desc *desc;
	int i;

	for (i = 0; i < cnt; i++) {
186
		desc = alloc_desc(start + i, node, owner);
187 188
		if (!desc)
			goto err;
T
Thomas Gleixner 已提交
189
		mutex_lock(&sparse_irq_lock);
190
		irq_insert_desc(start + i, desc);
T
Thomas Gleixner 已提交
191
		mutex_unlock(&sparse_irq_lock);
192 193 194 195 196 197 198
	}
	return start;

err:
	for (i--; i >= 0; i--)
		free_desc(start + i);

T
Thomas Gleixner 已提交
199
	mutex_lock(&sparse_irq_lock);
200
	bitmap_clear(allocated_irqs, start, cnt);
T
Thomas Gleixner 已提交
201
	mutex_unlock(&sparse_irq_lock);
202 203 204
	return -ENOMEM;
}

205
static int irq_expand_nr_irqs(unsigned int nr)
206
{
207
	if (nr > IRQ_BITMAP_BITS)
208
		return -ENOMEM;
209
	nr_irqs = nr;
210 211 212
	return 0;
}

213 214
int __init early_irq_init(void)
{
215
	int i, initcnt, node = first_online_node;
216 217 218 219
	struct irq_desc *desc;

	init_irq_default_affinity();

220 221 222
	/* Let arch update nr_irqs and return the nr of preallocated irqs */
	initcnt = arch_probe_nr_irqs();
	printk(KERN_INFO "NR_IRQS:%d nr_irqs:%d %d\n", NR_IRQS, nr_irqs, initcnt);
223

224 225 226 227 228 229 230 231 232
	if (WARN_ON(nr_irqs > IRQ_BITMAP_BITS))
		nr_irqs = IRQ_BITMAP_BITS;

	if (WARN_ON(initcnt > IRQ_BITMAP_BITS))
		initcnt = IRQ_BITMAP_BITS;

	if (initcnt > nr_irqs)
		nr_irqs = initcnt;

233
	for (i = 0; i < initcnt; i++) {
234
		desc = alloc_desc(i, node, NULL);
235 236
		set_bit(i, allocated_irqs);
		irq_insert_desc(i, desc);
237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252
	}
	return arch_early_irq_init();
}

#else /* !CONFIG_SPARSE_IRQ */

struct irq_desc irq_desc[NR_IRQS] __cacheline_aligned_in_smp = {
	[0 ... NR_IRQS-1] = {
		.handle_irq	= handle_bad_irq,
		.depth		= 1,
		.lock		= __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
	}
};

int __init early_irq_init(void)
{
253
	int count, i, node = first_online_node;
254 255 256 257 258 259 260 261 262 263
	struct irq_desc *desc;

	init_irq_default_affinity();

	printk(KERN_INFO "NR_IRQS:%d\n", NR_IRQS);

	desc = irq_desc;
	count = ARRAY_SIZE(irq_desc);

	for (i = 0; i < count; i++) {
E
Eric Dumazet 已提交
264
		desc[i].kstat_irqs = alloc_percpu(unsigned int);
265 266
		alloc_masks(&desc[i], GFP_KERNEL, node);
		raw_spin_lock_init(&desc[i].lock);
267
		lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
268
		desc_set_defaults(i, &desc[i], node, NULL);
269 270 271 272 273 274 275 276
	}
	return arch_early_irq_init();
}

struct irq_desc *irq_to_desc(unsigned int irq)
{
	return (irq < NR_IRQS) ? irq_desc + irq : NULL;
}
277
EXPORT_SYMBOL(irq_to_desc);
278

279 280
static void free_desc(unsigned int irq)
{
281 282 283 284 285 286
	struct irq_desc *desc = irq_to_desc(irq);
	unsigned long flags;

	raw_spin_lock_irqsave(&desc->lock, flags);
	desc_set_defaults(irq, desc, desc_node(desc), NULL);
	raw_spin_unlock_irqrestore(&desc->lock, flags);
287 288
}

289 290
static inline int alloc_descs(unsigned int start, unsigned int cnt, int node,
			      struct module *owner)
291
{
292 293 294 295 296 297 298
	u32 i;

	for (i = 0; i < cnt; i++) {
		struct irq_desc *desc = irq_to_desc(start + i);

		desc->owner = owner;
	}
299 300
	return start;
}
301

302
static int irq_expand_nr_irqs(unsigned int nr)
303 304 305 306
{
	return -ENOMEM;
}

307 308 309 310 311 312 313
void irq_mark_irq(unsigned int irq)
{
	mutex_lock(&sparse_irq_lock);
	bitmap_set(allocated_irqs, irq, 1);
	mutex_unlock(&sparse_irq_lock);
}

314 315 316
#ifdef CONFIG_GENERIC_IRQ_LEGACY
void irq_init_desc(unsigned int irq)
{
317
	free_desc(irq);
318 319 320
}
#endif

321 322
#endif /* !CONFIG_SPARSE_IRQ */

323 324 325 326 327 328 329 330 331 332 333 334 335 336
/**
 * generic_handle_irq - Invoke the handler for a particular irq
 * @irq:	The irq number to handle
 *
 */
int generic_handle_irq(unsigned int irq)
{
	struct irq_desc *desc = irq_to_desc(irq);

	if (!desc)
		return -EINVAL;
	generic_handle_irq_desc(irq, desc);
	return 0;
}
337
EXPORT_SYMBOL_GPL(generic_handle_irq);
338

339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355
/* Dynamic interrupt handling */

/**
 * irq_free_descs - free irq descriptors
 * @from:	Start of descriptor range
 * @cnt:	Number of consecutive irqs to free
 */
void irq_free_descs(unsigned int from, unsigned int cnt)
{
	int i;

	if (from >= nr_irqs || (from + cnt) > nr_irqs)
		return;

	for (i = 0; i < cnt; i++)
		free_desc(from + i);

T
Thomas Gleixner 已提交
356
	mutex_lock(&sparse_irq_lock);
357
	bitmap_clear(allocated_irqs, from, cnt);
T
Thomas Gleixner 已提交
358
	mutex_unlock(&sparse_irq_lock);
359
}
360
EXPORT_SYMBOL_GPL(irq_free_descs);
361 362 363 364 365 366 367

/**
 * irq_alloc_descs - allocate and initialize a range of irq descriptors
 * @irq:	Allocate for specific irq number if irq >= 0
 * @from:	Start the search from this irq number
 * @cnt:	Number of consecutive irqs to allocate.
 * @node:	Preferred node on which the irq descriptor should be allocated
368
 * @owner:	Owning module (can be NULL)
369 370 371 372
 *
 * Returns the first irq number or error code
 */
int __ref
373 374
__irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node,
		  struct module *owner)
375 376 377 378 379 380
{
	int start, ret;

	if (!cnt)
		return -EINVAL;

381 382 383 384
	if (irq >= 0) {
		if (from > irq)
			return -EINVAL;
		from = irq;
385 386 387 388 389 390 391
	} else {
		/*
		 * For interrupts which are freely allocated the
		 * architecture can force a lower bound to the @from
		 * argument. x86 uses this to exclude the GSI space.
		 */
		from = arch_dynirq_lower_bound(from);
392 393
	}

T
Thomas Gleixner 已提交
394
	mutex_lock(&sparse_irq_lock);
395

396 397
	start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
					   from, cnt, 0);
398 399 400 401
	ret = -EEXIST;
	if (irq >=0 && start != irq)
		goto err;

402 403
	if (start + cnt > nr_irqs) {
		ret = irq_expand_nr_irqs(start + cnt);
404 405 406
		if (ret)
			goto err;
	}
407 408

	bitmap_set(allocated_irqs, start, cnt);
T
Thomas Gleixner 已提交
409
	mutex_unlock(&sparse_irq_lock);
410
	return alloc_descs(start, cnt, node, owner);
411 412

err:
T
Thomas Gleixner 已提交
413
	mutex_unlock(&sparse_irq_lock);
414 415
	return ret;
}
416
EXPORT_SYMBOL_GPL(__irq_alloc_descs);
417

418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457
#ifdef CONFIG_GENERIC_IRQ_LEGACY_ALLOC_HWIRQ
/**
 * irq_alloc_hwirqs - Allocate an irq descriptor and initialize the hardware
 * @cnt:	number of interrupts to allocate
 * @node:	node on which to allocate
 *
 * Returns an interrupt number > 0 or 0, if the allocation fails.
 */
unsigned int irq_alloc_hwirqs(int cnt, int node)
{
	int i, irq = __irq_alloc_descs(-1, 0, cnt, node, NULL);

	if (irq < 0)
		return 0;

	for (i = irq; cnt > 0; i++, cnt--) {
		if (arch_setup_hwirq(i, node))
			goto err;
		irq_clear_status_flags(i, _IRQ_NOREQUEST);
	}
	return irq;

err:
	for (i--; i >= irq; i--) {
		irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
		arch_teardown_hwirq(i);
	}
	irq_free_descs(irq, cnt);
	return 0;
}
EXPORT_SYMBOL_GPL(irq_alloc_hwirqs);

/**
 * irq_free_hwirqs - Free irq descriptor and cleanup the hardware
 * @from:	Free from irq number
 * @cnt:	number of interrupts to free
 *
 */
void irq_free_hwirqs(unsigned int from, int cnt)
{
458
	int i, j;
459

460
	for (i = from, j = cnt; j > 0; i++, j--) {
461 462 463 464 465 466 467 468
		irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
		arch_teardown_hwirq(i);
	}
	irq_free_descs(from, cnt);
}
EXPORT_SYMBOL_GPL(irq_free_hwirqs);
#endif

469 470 471 472 473 474 475 476 477 478 479
/**
 * irq_get_next_irq - get next allocated irq number
 * @offset:	where to start the search
 *
 * Returns next irq number after offset or nr_irqs if none is found.
 */
unsigned int irq_get_next_irq(unsigned int offset)
{
	return find_next_bit(allocated_irqs, nr_irqs, offset);
}

480
struct irq_desc *
481 482
__irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus,
		    unsigned int check)
483 484 485 486
{
	struct irq_desc *desc = irq_to_desc(irq);

	if (desc) {
487 488 489 490 491 492 493 494 495 496
		if (check & _IRQ_DESC_CHECK) {
			if ((check & _IRQ_DESC_PERCPU) &&
			    !irq_settings_is_per_cpu_devid(desc))
				return NULL;

			if (!(check & _IRQ_DESC_PERCPU) &&
			    irq_settings_is_per_cpu_devid(desc))
				return NULL;
		}

497 498 499 500 501 502 503 504 505 506 507 508 509 510
		if (bus)
			chip_bus_lock(desc);
		raw_spin_lock_irqsave(&desc->lock, *flags);
	}
	return desc;
}

void __irq_put_desc_unlock(struct irq_desc *desc, unsigned long flags, bool bus)
{
	raw_spin_unlock_irqrestore(&desc->lock, flags);
	if (bus)
		chip_bus_sync_unlock(desc);
}

511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529
int irq_set_percpu_devid(unsigned int irq)
{
	struct irq_desc *desc = irq_to_desc(irq);

	if (!desc)
		return -EINVAL;

	if (desc->percpu_enabled)
		return -EINVAL;

	desc->percpu_enabled = kzalloc(sizeof(*desc->percpu_enabled), GFP_KERNEL);

	if (!desc->percpu_enabled)
		return -ENOMEM;

	irq_set_percpu_devid_flags(irq);
	return 0;
}

530 531 532 533 534
void kstat_incr_irq_this_cpu(unsigned int irq)
{
	kstat_incr_irqs_this_cpu(irq, irq_to_desc(irq));
}

535 536 537
unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
{
	struct irq_desc *desc = irq_to_desc(irq);
E
Eric Dumazet 已提交
538 539 540

	return desc && desc->kstat_irqs ?
			*per_cpu_ptr(desc->kstat_irqs, cpu) : 0;
541
}
542 543 544 545 546 547 548

unsigned int kstat_irqs(unsigned int irq)
{
	struct irq_desc *desc = irq_to_desc(irq);
	int cpu;
	int sum = 0;

E
Eric Dumazet 已提交
549
	if (!desc || !desc->kstat_irqs)
550 551
		return 0;
	for_each_possible_cpu(cpu)
E
Eric Dumazet 已提交
552
		sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
553 554
	return sum;
}