irqdesc.c 21.4 KB
Newer Older
1 2 3 4 5 6
/*
 * 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
 *
7
 * Detailed information is available in Documentation/core-api/genericirq.rst
8 9 10 11
 *
 */
#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
#include <linux/irqdomain.h>
18
#include <linux/sysfs.h>
19 20 21 22 23 24

#include "internals.h"

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

27
#if defined(CONFIG_SMP)
28 29
static int __init irq_affinity_setup(char *str)
{
30
	alloc_bootmem_cpumask_var(&irq_default_affinity);
31 32 33 34 35 36 37 38 39 40
	cpulist_parse(str, irq_default_affinity);
	/*
	 * Set at least the boot cpu. We don't want to end up with
	 * bugreports caused by random comandline masks
	 */
	cpumask_set_cpu(smp_processor_id(), irq_default_affinity);
	return 1;
}
__setup("irqaffinity=", irq_affinity_setup);

41 42
static void __init init_irq_default_affinity(void)
{
43
	if (!cpumask_available(irq_default_affinity))
44 45 46
		zalloc_cpumask_var(&irq_default_affinity, GFP_NOWAIT);
	if (cpumask_empty(irq_default_affinity))
		cpumask_setall(irq_default_affinity);
47 48 49 50 51 52 53
}
#else
static void __init init_irq_default_affinity(void)
{
}
#endif

54
#ifdef CONFIG_SMP
55
static int alloc_masks(struct irq_desc *desc, int node)
56
{
57
	if (!zalloc_cpumask_var_node(&desc->irq_common_data.affinity,
58
				     GFP_KERNEL, node))
59 60
		return -ENOMEM;

61 62 63 64 65 66 67 68
#ifdef CONFIG_GENERIC_IRQ_EFFECTIVE_AFF_MASK
	if (!zalloc_cpumask_var_node(&desc->irq_common_data.effective_affinity,
				     GFP_KERNEL, node)) {
		free_cpumask_var(desc->irq_common_data.affinity);
		return -ENOMEM;
	}
#endif

69
#ifdef CONFIG_GENERIC_PENDING_IRQ
70
	if (!zalloc_cpumask_var_node(&desc->pending_mask, GFP_KERNEL, node)) {
71 72 73
#ifdef CONFIG_GENERIC_IRQ_EFFECTIVE_AFF_MASK
		free_cpumask_var(desc->irq_common_data.effective_affinity);
#endif
74
		free_cpumask_var(desc->irq_common_data.affinity);
75 76 77 78 79 80
		return -ENOMEM;
	}
#endif
	return 0;
}

81 82
static void desc_smp_init(struct irq_desc *desc, int node,
			  const struct cpumask *affinity)
83
{
84 85 86 87
	if (!affinity)
		affinity = irq_default_affinity;
	cpumask_copy(desc->irq_common_data.affinity, affinity);

88 89 90
#ifdef CONFIG_GENERIC_PENDING_IRQ
	cpumask_clear(desc->pending_mask);
#endif
91 92 93
#ifdef CONFIG_NUMA
	desc->irq_common_data.node = node;
#endif
94 95
}

96 97
#else
static inline int
98
alloc_masks(struct irq_desc *desc, int node) { return 0; }
99 100
static inline void
desc_smp_init(struct irq_desc *desc, int node, const struct cpumask *affinity) { }
101 102
#endif

103
static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node,
104
			      const struct cpumask *affinity, struct module *owner)
105
{
E
Eric Dumazet 已提交
106 107
	int cpu;

108
	desc->irq_common_data.handler_data = NULL;
109
	desc->irq_common_data.msi_desc = NULL;
110

111
	desc->irq_data.common = &desc->irq_common_data;
112 113 114
	desc->irq_data.irq = irq;
	desc->irq_data.chip = &no_irq_chip;
	desc->irq_data.chip_data = NULL;
115
	irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
116
	irqd_set(&desc->irq_data, IRQD_IRQ_DISABLED);
117
	irqd_set(&desc->irq_data, IRQD_IRQ_MASKED);
118 119
	desc->handle_irq = handle_bad_irq;
	desc->depth = 1;
120 121
	desc->irq_count = 0;
	desc->irqs_unhandled = 0;
122
	desc->name = NULL;
123
	desc->owner = owner;
E
Eric Dumazet 已提交
124 125
	for_each_possible_cpu(cpu)
		*per_cpu_ptr(desc->kstat_irqs, cpu) = 0;
126
	desc_smp_init(desc, node, affinity);
127 128
}

129 130 131
int nr_irqs = NR_IRQS;
EXPORT_SYMBOL_GPL(nr_irqs);

T
Thomas Gleixner 已提交
132
static DEFINE_MUTEX(sparse_irq_lock);
133
static DECLARE_BITMAP(allocated_irqs, IRQ_BITMAP_BITS);
134

135 136
#ifdef CONFIG_SPARSE_IRQ

137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311
static void irq_kobj_release(struct kobject *kobj);

#ifdef CONFIG_SYSFS
static struct kobject *irq_kobj_base;

#define IRQ_ATTR_RO(_name) \
static struct kobj_attribute _name##_attr = __ATTR_RO(_name)

static ssize_t per_cpu_count_show(struct kobject *kobj,
				  struct kobj_attribute *attr, char *buf)
{
	struct irq_desc *desc = container_of(kobj, struct irq_desc, kobj);
	int cpu, irq = desc->irq_data.irq;
	ssize_t ret = 0;
	char *p = "";

	for_each_possible_cpu(cpu) {
		unsigned int c = kstat_irqs_cpu(irq, cpu);

		ret += scnprintf(buf + ret, PAGE_SIZE - ret, "%s%u", p, c);
		p = ",";
	}

	ret += scnprintf(buf + ret, PAGE_SIZE - ret, "\n");
	return ret;
}
IRQ_ATTR_RO(per_cpu_count);

static ssize_t chip_name_show(struct kobject *kobj,
			      struct kobj_attribute *attr, char *buf)
{
	struct irq_desc *desc = container_of(kobj, struct irq_desc, kobj);
	ssize_t ret = 0;

	raw_spin_lock_irq(&desc->lock);
	if (desc->irq_data.chip && desc->irq_data.chip->name) {
		ret = scnprintf(buf, PAGE_SIZE, "%s\n",
				desc->irq_data.chip->name);
	}
	raw_spin_unlock_irq(&desc->lock);

	return ret;
}
IRQ_ATTR_RO(chip_name);

static ssize_t hwirq_show(struct kobject *kobj,
			  struct kobj_attribute *attr, char *buf)
{
	struct irq_desc *desc = container_of(kobj, struct irq_desc, kobj);
	ssize_t ret = 0;

	raw_spin_lock_irq(&desc->lock);
	if (desc->irq_data.domain)
		ret = sprintf(buf, "%d\n", (int)desc->irq_data.hwirq);
	raw_spin_unlock_irq(&desc->lock);

	return ret;
}
IRQ_ATTR_RO(hwirq);

static ssize_t type_show(struct kobject *kobj,
			 struct kobj_attribute *attr, char *buf)
{
	struct irq_desc *desc = container_of(kobj, struct irq_desc, kobj);
	ssize_t ret = 0;

	raw_spin_lock_irq(&desc->lock);
	ret = sprintf(buf, "%s\n",
		      irqd_is_level_type(&desc->irq_data) ? "level" : "edge");
	raw_spin_unlock_irq(&desc->lock);

	return ret;

}
IRQ_ATTR_RO(type);

static ssize_t name_show(struct kobject *kobj,
			 struct kobj_attribute *attr, char *buf)
{
	struct irq_desc *desc = container_of(kobj, struct irq_desc, kobj);
	ssize_t ret = 0;

	raw_spin_lock_irq(&desc->lock);
	if (desc->name)
		ret = scnprintf(buf, PAGE_SIZE, "%s\n", desc->name);
	raw_spin_unlock_irq(&desc->lock);

	return ret;
}
IRQ_ATTR_RO(name);

static ssize_t actions_show(struct kobject *kobj,
			    struct kobj_attribute *attr, char *buf)
{
	struct irq_desc *desc = container_of(kobj, struct irq_desc, kobj);
	struct irqaction *action;
	ssize_t ret = 0;
	char *p = "";

	raw_spin_lock_irq(&desc->lock);
	for (action = desc->action; action != NULL; action = action->next) {
		ret += scnprintf(buf + ret, PAGE_SIZE - ret, "%s%s",
				 p, action->name);
		p = ",";
	}
	raw_spin_unlock_irq(&desc->lock);

	if (ret)
		ret += scnprintf(buf + ret, PAGE_SIZE - ret, "\n");

	return ret;
}
IRQ_ATTR_RO(actions);

static struct attribute *irq_attrs[] = {
	&per_cpu_count_attr.attr,
	&chip_name_attr.attr,
	&hwirq_attr.attr,
	&type_attr.attr,
	&name_attr.attr,
	&actions_attr.attr,
	NULL
};

static struct kobj_type irq_kobj_type = {
	.release	= irq_kobj_release,
	.sysfs_ops	= &kobj_sysfs_ops,
	.default_attrs	= irq_attrs,
};

static void irq_sysfs_add(int irq, struct irq_desc *desc)
{
	if (irq_kobj_base) {
		/*
		 * Continue even in case of failure as this is nothing
		 * crucial.
		 */
		if (kobject_add(&desc->kobj, irq_kobj_base, "%d", irq))
			pr_warn("Failed to add kobject for irq %d\n", irq);
	}
}

static int __init irq_sysfs_init(void)
{
	struct irq_desc *desc;
	int irq;

	/* Prevent concurrent irq alloc/free */
	irq_lock_sparse();

	irq_kobj_base = kobject_create_and_add("irq", kernel_kobj);
	if (!irq_kobj_base) {
		irq_unlock_sparse();
		return -ENOMEM;
	}

	/* Add the already allocated interrupts */
	for_each_irq_desc(irq, desc)
		irq_sysfs_add(irq, desc);
	irq_unlock_sparse();

	return 0;
}
postcore_initcall(irq_sysfs_init);

#else /* !CONFIG_SYSFS */

static struct kobj_type irq_kobj_type = {
	.release	= irq_kobj_release,
};

static void irq_sysfs_add(int irq, struct irq_desc *desc) {}

#endif /* CONFIG_SYSFS */

312
static RADIX_TREE(irq_desc_tree, GFP_KERNEL);
313

314
static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
315 316 317 318 319 320 321 322
{
	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);
}
323
EXPORT_SYMBOL(irq_to_desc);
324

325 326 327 328 329 330 331 332 333 334 335
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
336
	free_cpumask_var(desc->irq_common_data.affinity);
337 338 339
#ifdef CONFIG_GENERIC_IRQ_EFFECTIVE_AFF_MASK
	free_cpumask_var(desc->irq_common_data.effective_affinity);
#endif
340 341 342 343 344
}
#else
static inline void free_masks(struct irq_desc *desc) { }
#endif

345 346 347 348 349 350 351 352 353 354
void irq_lock_sparse(void)
{
	mutex_lock(&sparse_irq_lock);
}

void irq_unlock_sparse(void)
{
	mutex_unlock(&sparse_irq_lock);
}

355 356 357
static struct irq_desc *alloc_desc(int irq, int node, unsigned int flags,
				   const struct cpumask *affinity,
				   struct module *owner)
358 359 360
{
	struct irq_desc *desc;

361
	desc = kzalloc_node(sizeof(*desc), GFP_KERNEL, node);
362 363 364
	if (!desc)
		return NULL;
	/* allocate based on nr_cpu_ids */
E
Eric Dumazet 已提交
365
	desc->kstat_irqs = alloc_percpu(unsigned int);
366 367 368
	if (!desc->kstat_irqs)
		goto err_desc;

369
	if (alloc_masks(desc, node))
370 371 372 373
		goto err_kstat;

	raw_spin_lock_init(&desc->lock);
	lockdep_set_class(&desc->lock, &irq_desc_lock_class);
374
	mutex_init(&desc->request_mutex);
T
Thomas Gleixner 已提交
375
	init_rcu_head(&desc->rcu);
376

377 378
	desc_set_defaults(irq, desc, node, affinity, owner);
	irqd_set(&desc->irq_data, flags);
379
	kobject_init(&desc->kobj, &irq_kobj_type);
380 381 382 383

	return desc;

err_kstat:
E
Eric Dumazet 已提交
384
	free_percpu(desc->kstat_irqs);
385 386 387 388 389
err_desc:
	kfree(desc);
	return NULL;
}

390
static void irq_kobj_release(struct kobject *kobj)
T
Thomas Gleixner 已提交
391
{
392
	struct irq_desc *desc = container_of(kobj, struct irq_desc, kobj);
T
Thomas Gleixner 已提交
393 394 395 396 397 398

	free_masks(desc);
	free_percpu(desc->kstat_irqs);
	kfree(desc);
}

399 400 401 402 403 404 405
static void delayed_free_desc(struct rcu_head *rhp)
{
	struct irq_desc *desc = container_of(rhp, struct irq_desc, rcu);

	kobject_put(&desc->kobj);
}

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

410
	irq_remove_debugfs_entry(desc);
411 412
	unregister_irq_proc(irq, desc);

413 414 415 416 417
	/*
	 * sparse_irq_lock protects also show_interrupts() and
	 * kstat_irq_usr(). Once we deleted the descriptor from the
	 * sparse tree we can free it. Access in proc will fail to
	 * lookup the descriptor.
418 419 420
	 *
	 * The sysfs entry must be serialized against a concurrent
	 * irq_sysfs_init() as well.
421
	 */
422
	kobject_del(&desc->kobj);
423 424
	delete_irq_desc(irq);

T
Thomas Gleixner 已提交
425 426 427 428 429 430
	/*
	 * We free the descriptor, masks and stat fields via RCU. That
	 * allows demultiplex interrupts to do rcu based management of
	 * the child interrupts.
	 */
	call_rcu(&desc->rcu, delayed_free_desc);
431 432
}

433
static int alloc_descs(unsigned int start, unsigned int cnt, int node,
434
		       const struct cpumask *affinity, struct module *owner)
435
{
436
	const struct cpumask *mask = NULL;
437
	struct irq_desc *desc;
438
	unsigned int flags;
439
	int i;
440

441 442 443 444 445 446 447
	/* Validate affinity mask(s) */
	if (affinity) {
		for (i = 0, mask = affinity; i < cnt; i++, mask++) {
			if (cpumask_empty(mask))
				return -EINVAL;
		}
	}
448

449
	flags = affinity ? IRQD_AFFINITY_MANAGED | IRQD_MANAGED_SHUTDOWN : 0;
450
	mask = NULL;
451 452

	for (i = 0; i < cnt; i++) {
453
		if (affinity) {
454 455 456
			node = cpu_to_node(cpumask_first(affinity));
			mask = affinity;
			affinity++;
457 458
		}
		desc = alloc_desc(start + i, node, flags, mask, owner);
459 460 461
		if (!desc)
			goto err;
		irq_insert_desc(start + i, desc);
462
		irq_sysfs_add(start + i, desc);
463
		irq_add_debugfs_entry(start + i, desc);
464
	}
465
	bitmap_set(allocated_irqs, start, cnt);
466 467 468 469 470 471 472 473
	return start;

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

474
static int irq_expand_nr_irqs(unsigned int nr)
475
{
476
	if (nr > IRQ_BITMAP_BITS)
477
		return -ENOMEM;
478
	nr_irqs = nr;
479 480 481
	return 0;
}

482 483
int __init early_irq_init(void)
{
484
	int i, initcnt, node = first_online_node;
485 486 487 488
	struct irq_desc *desc;

	init_irq_default_affinity();

489 490
	/* Let arch update nr_irqs and return the nr of preallocated irqs */
	initcnt = arch_probe_nr_irqs();
491 492
	printk(KERN_INFO "NR_IRQS: %d, nr_irqs: %d, preallocated irqs: %d\n",
	       NR_IRQS, nr_irqs, initcnt);
493

494 495 496 497 498 499 500 501 502
	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;

503
	for (i = 0; i < initcnt; i++) {
504
		desc = alloc_desc(i, node, 0, NULL, NULL);
505 506
		set_bit(i, allocated_irqs);
		irq_insert_desc(i, desc);
507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522
	}
	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)
{
523
	int count, i, node = first_online_node;
524 525 526 527
	struct irq_desc *desc;

	init_irq_default_affinity();

528
	printk(KERN_INFO "NR_IRQS: %d\n", NR_IRQS);
529 530 531 532 533

	desc = irq_desc;
	count = ARRAY_SIZE(irq_desc);

	for (i = 0; i < count; i++) {
E
Eric Dumazet 已提交
534
		desc[i].kstat_irqs = alloc_percpu(unsigned int);
535
		alloc_masks(&desc[i], node);
536
		raw_spin_lock_init(&desc[i].lock);
537
		lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
538
		desc_set_defaults(i, &desc[i], node, NULL, NULL);
539 540 541 542 543 544 545 546
	}
	return arch_early_irq_init();
}

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

549 550
static void free_desc(unsigned int irq)
{
551 552 553 554
	struct irq_desc *desc = irq_to_desc(irq);
	unsigned long flags;

	raw_spin_lock_irqsave(&desc->lock, flags);
555
	desc_set_defaults(irq, desc, irq_desc_get_node(desc), NULL, NULL);
556
	raw_spin_unlock_irqrestore(&desc->lock, flags);
557 558
}

559
static inline int alloc_descs(unsigned int start, unsigned int cnt, int node,
560
			      const struct cpumask *affinity,
561
			      struct module *owner)
562
{
563 564 565 566 567 568 569
	u32 i;

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

		desc->owner = owner;
	}
570
	bitmap_set(allocated_irqs, start, cnt);
571 572
	return start;
}
573

574
static int irq_expand_nr_irqs(unsigned int nr)
575 576 577 578
{
	return -ENOMEM;
}

579 580 581 582 583 584 585
void irq_mark_irq(unsigned int irq)
{
	mutex_lock(&sparse_irq_lock);
	bitmap_set(allocated_irqs, irq, 1);
	mutex_unlock(&sparse_irq_lock);
}

586 587 588
#ifdef CONFIG_GENERIC_IRQ_LEGACY
void irq_init_desc(unsigned int irq)
{
589
	free_desc(irq);
590 591 592
}
#endif

593 594
#endif /* !CONFIG_SPARSE_IRQ */

595 596 597 598 599 600 601 602 603 604 605
/**
 * 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;
606
	generic_handle_irq_desc(desc);
607 608
	return 0;
}
609
EXPORT_SYMBOL_GPL(generic_handle_irq);
610

611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651
#ifdef CONFIG_HANDLE_DOMAIN_IRQ
/**
 * __handle_domain_irq - Invoke the handler for a HW irq belonging to a domain
 * @domain:	The domain where to perform the lookup
 * @hwirq:	The HW irq number to convert to a logical one
 * @lookup:	Whether to perform the domain lookup or not
 * @regs:	Register file coming from the low-level handling code
 *
 * Returns:	0 on success, or -EINVAL if conversion has failed
 */
int __handle_domain_irq(struct irq_domain *domain, unsigned int hwirq,
			bool lookup, struct pt_regs *regs)
{
	struct pt_regs *old_regs = set_irq_regs(regs);
	unsigned int irq = hwirq;
	int ret = 0;

	irq_enter();

#ifdef CONFIG_IRQ_DOMAIN
	if (lookup)
		irq = irq_find_mapping(domain, hwirq);
#endif

	/*
	 * Some hardware gives randomly wrong interrupts.  Rather
	 * than crashing, do something sensible.
	 */
	if (unlikely(!irq || irq >= nr_irqs)) {
		ack_bad_irq(irq);
		ret = -EINVAL;
	} else {
		generic_handle_irq(irq);
	}

	irq_exit();
	set_irq_regs(old_regs);
	return ret;
}
#endif

652 653 654 655 656 657 658 659 660 661 662 663 664 665
/* 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;

666
	mutex_lock(&sparse_irq_lock);
667 668 669 670
	for (i = 0; i < cnt; i++)
		free_desc(from + i);

	bitmap_clear(allocated_irqs, from, cnt);
T
Thomas Gleixner 已提交
671
	mutex_unlock(&sparse_irq_lock);
672
}
673
EXPORT_SYMBOL_GPL(irq_free_descs);
674 675 676 677 678 679 680

/**
 * 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
681
 * @owner:	Owning module (can be NULL)
682 683 684
 * @affinity:	Optional pointer to an affinity mask array of size @cnt which
 *		hints where the irq descriptors should be allocated and which
 *		default affinities to use
685 686 687 688
 *
 * Returns the first irq number or error code
 */
int __ref
689
__irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node,
690
		  struct module *owner, const struct cpumask *affinity)
691 692 693 694 695 696
{
	int start, ret;

	if (!cnt)
		return -EINVAL;

697 698 699 700
	if (irq >= 0) {
		if (from > irq)
			return -EINVAL;
		from = irq;
701 702 703 704 705 706 707
	} 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);
708 709
	}

T
Thomas Gleixner 已提交
710
	mutex_lock(&sparse_irq_lock);
711

712 713
	start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
					   from, cnt, 0);
714 715
	ret = -EEXIST;
	if (irq >=0 && start != irq)
716
		goto unlock;
717

718 719
	if (start + cnt > nr_irqs) {
		ret = irq_expand_nr_irqs(start + cnt);
720
		if (ret)
721
			goto unlock;
722
	}
723 724
	ret = alloc_descs(start, cnt, node, affinity, owner);
unlock:
T
Thomas Gleixner 已提交
725
	mutex_unlock(&sparse_irq_lock);
726 727
	return ret;
}
728
EXPORT_SYMBOL_GPL(__irq_alloc_descs);
729

730 731 732 733 734 735 736 737 738 739
#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)
{
740
	int i, irq = __irq_alloc_descs(-1, 0, cnt, node, NULL, NULL);
741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769

	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)
{
770
	int i, j;
771

772
	for (i = from, j = cnt; j > 0; i++, j--) {
773 774 775 776 777 778 779 780
		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

781 782 783 784 785 786 787 788 789 790 791
/**
 * 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);
}

792
struct irq_desc *
793 794
__irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus,
		    unsigned int check)
795 796 797 798
{
	struct irq_desc *desc = irq_to_desc(irq);

	if (desc) {
799 800 801 802 803 804 805 806 807 808
		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;
		}

809 810 811 812 813 814 815 816 817 818 819 820 821 822
		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);
}

823 824
int irq_set_percpu_devid_partition(unsigned int irq,
				   const struct cpumask *affinity)
825 826 827 828 829 830 831 832 833 834 835 836 837 838
{
	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;

839 840 841 842 843
	if (affinity)
		desc->percpu_affinity = affinity;
	else
		desc->percpu_affinity = cpu_possible_mask;

844 845 846 847
	irq_set_percpu_devid_flags(irq);
	return 0;
}

848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864
int irq_set_percpu_devid(unsigned int irq)
{
	return irq_set_percpu_devid_partition(irq, NULL);
}

int irq_get_percpu_devid_partition(unsigned int irq, struct cpumask *affinity)
{
	struct irq_desc *desc = irq_to_desc(irq);

	if (!desc || !desc->percpu_enabled)
		return -EINVAL;

	if (affinity)
		cpumask_copy(affinity, desc->percpu_affinity);

	return 0;
}
865
EXPORT_SYMBOL_GPL(irq_get_percpu_devid_partition);
866

867 868
void kstat_incr_irq_this_cpu(unsigned int irq)
{
869
	kstat_incr_irqs_this_cpu(irq_to_desc(irq));
870 871
}

872 873 874 875 876 877 878 879 880
/**
 * kstat_irqs_cpu - Get the statistics for an interrupt on a cpu
 * @irq:	The interrupt number
 * @cpu:	The cpu number
 *
 * Returns the sum of interrupt counts on @cpu since boot for
 * @irq. The caller must ensure that the interrupt is not removed
 * concurrently.
 */
881 882 883
unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
{
	struct irq_desc *desc = irq_to_desc(irq);
E
Eric Dumazet 已提交
884 885 886

	return desc && desc->kstat_irqs ?
			*per_cpu_ptr(desc->kstat_irqs, cpu) : 0;
887
}
888

889 890 891 892 893 894 895 896
/**
 * kstat_irqs - Get the statistics for an interrupt
 * @irq:	The interrupt number
 *
 * Returns the sum of interrupt counts on all cpus since boot for
 * @irq. The caller must ensure that the interrupt is not removed
 * concurrently.
 */
897 898 899 900
unsigned int kstat_irqs(unsigned int irq)
{
	struct irq_desc *desc = irq_to_desc(irq);
	int cpu;
901
	unsigned int sum = 0;
902

E
Eric Dumazet 已提交
903
	if (!desc || !desc->kstat_irqs)
904 905
		return 0;
	for_each_possible_cpu(cpu)
E
Eric Dumazet 已提交
906
		sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
907 908
	return sum;
}
909 910 911 912 913 914 915 916 917 918 919 920

/**
 * kstat_irqs_usr - Get the statistics for an interrupt
 * @irq:	The interrupt number
 *
 * Returns the sum of interrupt counts on all cpus since boot for
 * @irq. Contrary to kstat_irqs() this can be called from any
 * preemptible context. It's protected against concurrent removal of
 * an interrupt descriptor when sparse irqs are enabled.
 */
unsigned int kstat_irqs_usr(unsigned int irq)
{
921
	unsigned int sum;
922 923 924 925 926 927

	irq_lock_sparse();
	sum = kstat_irqs(irq);
	irq_unlock_sparse();
	return sum;
}