[mirror_ubuntu-focal-kernel.git] / kernel / irq / irqdesc.c

/*
 * 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>
#include <linux/module.h>
#include <linux/interrupt.h>
#include <linux/kernel_stat.h>
#include <linux/radix-tree.h>
#include <linux/bitmap.h>

#include "internals.h"

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

#if defined(CONFIG_SMP)
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

#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)
{
	desc->irq_data.node = node;
	cpumask_copy(desc->irq_data.affinity, irq_default_affinity);
#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;
}

#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) { }
static inline int desc_node(struct irq_desc *desc) { return 0; }
#endif

static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node,
		struct module *owner)
{
	int cpu;

	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;
	irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
	irqd_set(&desc->irq_data, IRQD_IRQ_DISABLED);
	desc->handle_irq = handle_bad_irq;
	desc->depth = 1;
	desc->irq_count = 0;
	desc->irqs_unhandled = 0;
	desc->name = NULL;
	desc->owner = owner;
	for_each_possible_cpu(cpu)
		*per_cpu_ptr(desc->kstat_irqs, cpu) = 0;
	desc_smp_init(desc, node);
}

int nr_irqs = NR_IRQS;
EXPORT_SYMBOL_GPL(nr_irqs);

static DEFINE_MUTEX(sparse_irq_lock);
static DECLARE_BITMAP(allocated_irqs, IRQ_BITMAP_BITS);

#ifdef CONFIG_SPARSE_IRQ

static RADIX_TREE(irq_desc_tree, GFP_KERNEL);

static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
{
	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);
}

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
	free_cpumask_var(desc->irq_data.affinity);
}
#else
static inline void free_masks(struct irq_desc *desc) { }
#endif

static struct irq_desc *alloc_desc(int irq, int node, struct module *owner)
{
	struct irq_desc *desc;
	gfp_t gfp = GFP_KERNEL;

	desc = kzalloc_node(sizeof(*desc), gfp, node);
	if (!desc)
		return NULL;
	/* allocate based on nr_cpu_ids */
	desc->kstat_irqs = alloc_percpu(unsigned int);
	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);

	desc_set_defaults(irq, desc, node, owner);

	return desc;

err_kstat:
	free_percpu(desc->kstat_irqs);
err_desc:
	kfree(desc);
	return NULL;
}

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

	unregister_irq_proc(irq, desc);

	mutex_lock(&sparse_irq_lock);
	delete_irq_desc(irq);
	mutex_unlock(&sparse_irq_lock);

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

static int alloc_descs(unsigned int start, unsigned int cnt, int node,
		       struct module *owner)
{
	struct irq_desc *desc;
	int i;

	for (i = 0; i < cnt; i++) {
		desc = alloc_desc(start + i, node, owner);
		if (!desc)
			goto err;
		mutex_lock(&sparse_irq_lock);
		irq_insert_desc(start + i, desc);
		mutex_unlock(&sparse_irq_lock);
	}
	return start;

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

	mutex_lock(&sparse_irq_lock);
	bitmap_clear(allocated_irqs, start, cnt);
	mutex_unlock(&sparse_irq_lock);
	return -ENOMEM;
}

static int irq_expand_nr_irqs(unsigned int nr)
{
	if (nr > IRQ_BITMAP_BITS)
		return -ENOMEM;
	nr_irqs = nr;
	return 0;
}

int __init early_irq_init(void)
{
	int i, initcnt, node = first_online_node;
	struct irq_desc *desc;

	init_irq_default_affinity();

	/* 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);

	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;

	for (i = 0; i < initcnt; i++) {
		desc = alloc_desc(i, node, NULL);
		set_bit(i, allocated_irqs);
		irq_insert_desc(i, desc);
	}
	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)
{
	int count, i, node = first_online_node;
	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++) {
		desc[i].kstat_irqs = alloc_percpu(unsigned int);
		alloc_masks(&desc[i], GFP_KERNEL, node);
		raw_spin_lock_init(&desc[i].lock);
		lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
		desc_set_defaults(i, &desc[i], node, NULL);
	}
	return arch_early_irq_init();
}

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

static void free_desc(unsigned int irq)
{
	dynamic_irq_cleanup(irq);
}

static inline int alloc_descs(unsigned int start, unsigned int cnt, int node,
			      struct module *owner)
{
	u32 i;

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

		desc->owner = owner;
	}
	return start;
}

static int irq_expand_nr_irqs(unsigned int nr)
{
	return -ENOMEM;
}

#endif /* !CONFIG_SPARSE_IRQ */

/**
 * 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;
}
EXPORT_SYMBOL_GPL(generic_handle_irq);

/* 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);

	mutex_lock(&sparse_irq_lock);
	bitmap_clear(allocated_irqs, from, cnt);
	mutex_unlock(&sparse_irq_lock);
}
EXPORT_SYMBOL_GPL(irq_free_descs);

/**
 * 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
 *
 * Returns the first irq number or error code
 */
int __ref
__irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node,
		  struct module *owner)
{
	int start, ret;

	if (!cnt)
		return -EINVAL;

	if (irq >= 0) {
		if (from > irq)
			return -EINVAL;
		from = irq;
	}

	mutex_lock(&sparse_irq_lock);

	start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
					   from, cnt, 0);
	ret = -EEXIST;
	if (irq >=0 && start != irq)
		goto err;

	if (start + cnt > nr_irqs) {
		ret = irq_expand_nr_irqs(start + cnt);
		if (ret)
			goto err;
	}

	bitmap_set(allocated_irqs, start, cnt);
	mutex_unlock(&sparse_irq_lock);
	return alloc_descs(start, cnt, node, owner);

err:
	mutex_unlock(&sparse_irq_lock);
	return ret;
}
EXPORT_SYMBOL_GPL(__irq_alloc_descs);

/**
 * irq_reserve_irqs - mark irqs allocated
 * @from:	mark from irq number
 * @cnt:	number of irqs to mark
 *
 * Returns 0 on success or an appropriate error code
 */
int irq_reserve_irqs(unsigned int from, unsigned int cnt)
{
	unsigned int start;
	int ret = 0;

	if (!cnt || (from + cnt) > nr_irqs)
		return -EINVAL;

	mutex_lock(&sparse_irq_lock);
	start = bitmap_find_next_zero_area(allocated_irqs, nr_irqs, from, cnt, 0);
	if (start == from)
		bitmap_set(allocated_irqs, start, cnt);
	else
		ret = -EEXIST;
	mutex_unlock(&sparse_irq_lock);
	return ret;
}

/**
 * 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);
}

struct irq_desc *
__irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus)
{
	struct irq_desc *desc = irq_to_desc(irq);

	if (desc) {
		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);
}

/**
 * dynamic_irq_cleanup - cleanup a dynamically allocated irq
 * @irq:	irq number to initialize
 */
void dynamic_irq_cleanup(unsigned int irq)
{
	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);
}

unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
{
	struct irq_desc *desc = irq_to_desc(irq);

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

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

	if (!desc || !desc->kstat_irqs)
		return 0;
	for_each_possible_cpu(cpu)
		sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
	return sum;
}
Commit	Line	Data
3795de23 TG	1	/*
	2	* Copyright (C) 1992, 1998-2006 Linus Torvalds, Ingo Molnar
	3	* Copyright (C) 2005-2006, Thomas Gleixner, Russell King
	4	*
	5	* This file contains the interrupt descriptor management code
	6	*
	7	* Detailed information is available in Documentation/DocBook/genericirq
	8	*
	9	*/
	10	#include <linux/irq.h>
	11	#include <linux/slab.h>
	12	#include <linux/module.h>
	13	#include <linux/interrupt.h>
	14	#include <linux/kernel_stat.h>
	15	#include <linux/radix-tree.h>
1f5a5b87	16	#include <linux/bitmap.h>
3795de23 TG	17
	18	#include "internals.h"
	19
	20	/*
	21	* lockdep: we want to handle all irq_desc locks as a single lock-class:
	22	*/
78f90d91	23	static struct lock_class_key irq_desc_lock_class;
3795de23	24
fe051434	25	#if defined(CONFIG_SMP)
3795de23 TG	26	static void __init init_irq_default_affinity(void)
	27	{
	28	alloc_cpumask_var(&irq_default_affinity, GFP_NOWAIT);
	29	cpumask_setall(irq_default_affinity);
	30	}
	31	#else
	32	static void __init init_irq_default_affinity(void)
	33	{
	34	}
	35	#endif
	36
1f5a5b87 TG	37	#ifdef CONFIG_SMP
	38	static int alloc_masks(struct irq_desc *desc, gfp_t gfp, int node)
	39	{
	40	if (!zalloc_cpumask_var_node(&desc->irq_data.affinity, gfp, node))
	41	return -ENOMEM;
	42
	43	#ifdef CONFIG_GENERIC_PENDING_IRQ
	44	if (!zalloc_cpumask_var_node(&desc->pending_mask, gfp, node)) {
	45	free_cpumask_var(desc->irq_data.affinity);
	46	return -ENOMEM;
	47	}
	48	#endif
	49	return 0;
	50	}
	51
	52	static void desc_smp_init(struct irq_desc *desc, int node)
	53	{
aa99ec0f	54	desc->irq_data.node = node;
1f5a5b87	55	cpumask_copy(desc->irq_data.affinity, irq_default_affinity);
b7b29338 TG	56	#ifdef CONFIG_GENERIC_PENDING_IRQ
	57	cpumask_clear(desc->pending_mask);
	58	#endif
	59	}
	60
	61	static inline int desc_node(struct irq_desc *desc)
	62	{
	63	return desc->irq_data.node;
1f5a5b87 TG	64	}
	65
	66	#else
	67	static inline int
	68	alloc_masks(struct irq_desc *desc, gfp_t gfp, int node) { return 0; }
	69	static inline void desc_smp_init(struct irq_desc *desc, int node) { }
b7b29338	70	static inline int desc_node(struct irq_desc *desc) { return 0; }
1f5a5b87 TG	71	#endif
1f5a5b87 TG	72
b6873807 SAS	73	static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node,
b6873807 SAS	74	struct module *owner)
1f5a5b87	75	{
6c9ae009 ED	76	int cpu;
6c9ae009 ED	77
1f5a5b87 TG	78	desc->irq_data.irq = irq;
	79	desc->irq_data.chip = &no_irq_chip;
	80	desc->irq_data.chip_data = NULL;
	81	desc->irq_data.handler_data = NULL;
	82	desc->irq_data.msi_desc = NULL;
f9e4989e	83	irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
801a0e9a	84	irqd_set(&desc->irq_data, IRQD_IRQ_DISABLED);
1f5a5b87 TG	85	desc->handle_irq = handle_bad_irq;
1f5a5b87 TG	86	desc->depth = 1;
b7b29338 TG	87	desc->irq_count = 0;
b7b29338 TG	88	desc->irqs_unhandled = 0;
1f5a5b87	89	desc->name = NULL;
b6873807	90	desc->owner = owner;
6c9ae009 ED	91	for_each_possible_cpu(cpu)
6c9ae009 ED	92	*per_cpu_ptr(desc->kstat_irqs, cpu) = 0;
1f5a5b87 TG	93	desc_smp_init(desc, node);
	94	}
	95
3795de23 TG	96	int nr_irqs = NR_IRQS;
	97	EXPORT_SYMBOL_GPL(nr_irqs);
	98
a05a900a	99	static DEFINE_MUTEX(sparse_irq_lock);
c1ee6264	100	static DECLARE_BITMAP(allocated_irqs, IRQ_BITMAP_BITS);
1f5a5b87	101
3795de23 TG	102	#ifdef CONFIG_SPARSE_IRQ
3795de23 TG	103
baa0d233	104	static RADIX_TREE(irq_desc_tree, GFP_KERNEL);
3795de23	105
1f5a5b87	106	static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
3795de23 TG	107	{
	108	radix_tree_insert(&irq_desc_tree, irq, desc);
	109	}
	110
	111	struct irq_desc *irq_to_desc(unsigned int irq)
	112	{
	113	return radix_tree_lookup(&irq_desc_tree, irq);
	114	}
	115
1f5a5b87 TG	116	static void delete_irq_desc(unsigned int irq)
	117	{
	118	radix_tree_delete(&irq_desc_tree, irq);
	119	}
	120
	121	#ifdef CONFIG_SMP
	122	static void free_masks(struct irq_desc *desc)
	123	{
	124	#ifdef CONFIG_GENERIC_PENDING_IRQ
	125	free_cpumask_var(desc->pending_mask);
	126	#endif
c0a19ebc	127	free_cpumask_var(desc->irq_data.affinity);
1f5a5b87 TG	128	}
	129	#else
	130	static inline void free_masks(struct irq_desc *desc) { }
	131	#endif
	132
b6873807	133	static struct irq_desc alloc_desc(int irq, int node, struct module owner)
1f5a5b87 TG	134	{
1f5a5b87 TG	135	struct irq_desc *desc;
baa0d233	136	gfp_t gfp = GFP_KERNEL;
1f5a5b87 TG	137
	138	desc = kzalloc_node(sizeof(*desc), gfp, node);
	139	if (!desc)
	140	return NULL;
	141	/* allocate based on nr_cpu_ids */
6c9ae009	142	desc->kstat_irqs = alloc_percpu(unsigned int);
1f5a5b87 TG	143	if (!desc->kstat_irqs)
	144	goto err_desc;
	145
	146	if (alloc_masks(desc, gfp, node))
	147	goto err_kstat;
	148
	149	raw_spin_lock_init(&desc->lock);
	150	lockdep_set_class(&desc->lock, &irq_desc_lock_class);
	151
b6873807	152	desc_set_defaults(irq, desc, node, owner);
1f5a5b87 TG	153
	154	return desc;
	155
	156	err_kstat:
6c9ae009	157	free_percpu(desc->kstat_irqs);
1f5a5b87 TG	158	err_desc:
	159	kfree(desc);
	160	return NULL;
	161	}
	162
	163	static void free_desc(unsigned int irq)
	164	{
	165	struct irq_desc *desc = irq_to_desc(irq);
1f5a5b87	166
13bfe99e TG	167	unregister_irq_proc(irq, desc);
13bfe99e TG	168
a05a900a	169	mutex_lock(&sparse_irq_lock);
1f5a5b87	170	delete_irq_desc(irq);
a05a900a	171	mutex_unlock(&sparse_irq_lock);
1f5a5b87 TG	172
1f5a5b87 TG	173	free_masks(desc);
6c9ae009	174	free_percpu(desc->kstat_irqs);
1f5a5b87 TG	175	kfree(desc);
	176	}
	177
b6873807 SAS	178	static int alloc_descs(unsigned int start, unsigned int cnt, int node,
b6873807 SAS	179	struct module *owner)
1f5a5b87 TG	180	{
1f5a5b87 TG	181	struct irq_desc *desc;
1f5a5b87 TG	182	int i;
	183
	184	for (i = 0; i < cnt; i++) {
b6873807	185	desc = alloc_desc(start + i, node, owner);
1f5a5b87 TG	186	if (!desc)
1f5a5b87 TG	187	goto err;
a05a900a	188	mutex_lock(&sparse_irq_lock);
1f5a5b87	189	irq_insert_desc(start + i, desc);
a05a900a	190	mutex_unlock(&sparse_irq_lock);
1f5a5b87 TG	191	}
	192	return start;
	193
	194	err:
	195	for (i--; i >= 0; i--)
	196	free_desc(start + i);
	197
a05a900a	198	mutex_lock(&sparse_irq_lock);
1f5a5b87	199	bitmap_clear(allocated_irqs, start, cnt);
a05a900a	200	mutex_unlock(&sparse_irq_lock);
1f5a5b87 TG	201	return -ENOMEM;
	202	}
	203
ed4dea6e	204	static int irq_expand_nr_irqs(unsigned int nr)
e7bcecb7	205	{
ed4dea6e	206	if (nr > IRQ_BITMAP_BITS)
e7bcecb7	207	return -ENOMEM;
ed4dea6e	208	nr_irqs = nr;
e7bcecb7 TG	209	return 0;
	210	}
	211
3795de23 TG	212	int __init early_irq_init(void)
3795de23 TG	213	{
b683de2b	214	int i, initcnt, node = first_online_node;
3795de23	215	struct irq_desc *desc;
3795de23 TG	216
	217	init_irq_default_affinity();
	218
b683de2b TG	219	/* Let arch update nr_irqs and return the nr of preallocated irqs */
	220	initcnt = arch_probe_nr_irqs();
	221	printk(KERN_INFO "NR_IRQS:%d nr_irqs:%d %d\n", NR_IRQS, nr_irqs, initcnt);
3795de23	222
c1ee6264 TG	223	if (WARN_ON(nr_irqs > IRQ_BITMAP_BITS))
	224	nr_irqs = IRQ_BITMAP_BITS;
	225
	226	if (WARN_ON(initcnt > IRQ_BITMAP_BITS))
	227	initcnt = IRQ_BITMAP_BITS;
	228
	229	if (initcnt > nr_irqs)
	230	nr_irqs = initcnt;
	231
b683de2b	232	for (i = 0; i < initcnt; i++) {
b6873807	233	desc = alloc_desc(i, node, NULL);
aa99ec0f TG	234	set_bit(i, allocated_irqs);
aa99ec0f TG	235	irq_insert_desc(i, desc);
3795de23	236	}
3795de23 TG	237	return arch_early_irq_init();
	238	}
	239
3795de23 TG	240	#else /* !CONFIG_SPARSE_IRQ */
	241
	242	struct irq_desc irq_desc[NR_IRQS] __cacheline_aligned_in_smp = {
	243	[0 ... NR_IRQS-1] = {
3795de23 TG	244	.handle_irq = handle_bad_irq,
	245	.depth = 1,
	246	.lock = __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
	247	}
	248	};
	249
3795de23 TG	250	int __init early_irq_init(void)
3795de23 TG	251	{
aa99ec0f	252	int count, i, node = first_online_node;
3795de23	253	struct irq_desc *desc;
3795de23 TG	254
	255	init_irq_default_affinity();
	256
	257	printk(KERN_INFO "NR_IRQS:%d\n", NR_IRQS);
	258
	259	desc = irq_desc;
	260	count = ARRAY_SIZE(irq_desc);
	261
	262	for (i = 0; i < count; i++) {
6c9ae009	263	desc[i].kstat_irqs = alloc_percpu(unsigned int);
e7fbad30 LW	264	alloc_masks(&desc[i], GFP_KERNEL, node);
e7fbad30 LW	265	raw_spin_lock_init(&desc[i].lock);
154cd387	266	lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
b6873807	267	desc_set_defaults(i, &desc[i], node, NULL);
3795de23 TG	268	}
	269	return arch_early_irq_init();
	270	}
	271
	272	struct irq_desc *irq_to_desc(unsigned int irq)
	273	{
	274	return (irq < NR_IRQS) ? irq_desc + irq : NULL;
	275	}
	276
1f5a5b87 TG	277	static void free_desc(unsigned int irq)
1f5a5b87 TG	278	{
b7b29338	279	dynamic_irq_cleanup(irq);
1f5a5b87 TG	280	}
1f5a5b87 TG	281
b6873807 SAS	282	static inline int alloc_descs(unsigned int start, unsigned int cnt, int node,
b6873807 SAS	283	struct module *owner)
1f5a5b87	284	{
b6873807 SAS	285	u32 i;
	286
	287	for (i = 0; i < cnt; i++) {
	288	struct irq_desc *desc = irq_to_desc(start + i);
	289
	290	desc->owner = owner;
	291	}
1f5a5b87 TG	292	return start;
1f5a5b87 TG	293	}
e7bcecb7	294
ed4dea6e	295	static int irq_expand_nr_irqs(unsigned int nr)
e7bcecb7 TG	296	{
	297	return -ENOMEM;
	298	}
	299
3795de23 TG	300	#endif /* !CONFIG_SPARSE_IRQ */
3795de23 TG	301
fe12bc2c TG	302	/**
	303	* generic_handle_irq - Invoke the handler for a particular irq
	304	* @irq: The irq number to handle
	305	*
	306	*/
	307	int generic_handle_irq(unsigned int irq)
	308	{
	309	struct irq_desc *desc = irq_to_desc(irq);
	310
	311	if (!desc)
	312	return -EINVAL;
	313	generic_handle_irq_desc(irq, desc);
	314	return 0;
	315	}
edf76f83	316	EXPORT_SYMBOL_GPL(generic_handle_irq);
fe12bc2c	317
1f5a5b87 TG	318	/* Dynamic interrupt handling */
	319
	320	/**
	321	* irq_free_descs - free irq descriptors
	322	* @from: Start of descriptor range
	323	* @cnt: Number of consecutive irqs to free
	324	*/
	325	void irq_free_descs(unsigned int from, unsigned int cnt)
	326	{
1f5a5b87 TG	327	int i;
	328
	329	if (from >= nr_irqs \|\| (from + cnt) > nr_irqs)
	330	return;
	331
	332	for (i = 0; i < cnt; i++)
	333	free_desc(from + i);
	334
a05a900a	335	mutex_lock(&sparse_irq_lock);
1f5a5b87	336	bitmap_clear(allocated_irqs, from, cnt);
a05a900a	337	mutex_unlock(&sparse_irq_lock);
1f5a5b87	338	}
edf76f83	339	EXPORT_SYMBOL_GPL(irq_free_descs);
1f5a5b87 TG	340
	341	/**
	342	* irq_alloc_descs - allocate and initialize a range of irq descriptors
	343	* @irq: Allocate for specific irq number if irq >= 0
	344	* @from: Start the search from this irq number
	345	* @cnt: Number of consecutive irqs to allocate.
	346	* @node: Preferred node on which the irq descriptor should be allocated
	347	*
	348	* Returns the first irq number or error code
	349	*/
	350	int __ref
b6873807 SAS	351	__irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node,
b6873807 SAS	352	struct module *owner)
1f5a5b87	353	{
1f5a5b87 TG	354	int start, ret;
	355
	356	if (!cnt)
	357	return -EINVAL;
	358
c5182b88 MB	359	if (irq >= 0) {
	360	if (from > irq)
	361	return -EINVAL;
	362	from = irq;
	363	}
	364
a05a900a	365	mutex_lock(&sparse_irq_lock);
1f5a5b87	366
ed4dea6e YL	367	start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
ed4dea6e YL	368	from, cnt, 0);
1f5a5b87 TG	369	ret = -EEXIST;
	370	if (irq >=0 && start != irq)
	371	goto err;
	372
ed4dea6e YL	373	if (start + cnt > nr_irqs) {
ed4dea6e YL	374	ret = irq_expand_nr_irqs(start + cnt);
e7bcecb7 TG	375	if (ret)
	376	goto err;
	377	}
1f5a5b87 TG	378
1f5a5b87 TG	379	bitmap_set(allocated_irqs, start, cnt);
a05a900a	380	mutex_unlock(&sparse_irq_lock);
b6873807	381	return alloc_descs(start, cnt, node, owner);
1f5a5b87 TG	382
1f5a5b87 TG	383	err:
a05a900a	384	mutex_unlock(&sparse_irq_lock);
1f5a5b87 TG	385	return ret;
1f5a5b87 TG	386	}
b6873807	387	EXPORT_SYMBOL_GPL(__irq_alloc_descs);
1f5a5b87	388
06f6c339 TG	389	/**
	390	* irq_reserve_irqs - mark irqs allocated
	391	* @from: mark from irq number
	392	* @cnt: number of irqs to mark
	393	*
	394	* Returns 0 on success or an appropriate error code
	395	*/
	396	int irq_reserve_irqs(unsigned int from, unsigned int cnt)
	397	{
06f6c339 TG	398	unsigned int start;
	399	int ret = 0;
	400
	401	if (!cnt \|\| (from + cnt) > nr_irqs)
	402	return -EINVAL;
	403
a05a900a	404	mutex_lock(&sparse_irq_lock);
06f6c339 TG	405	start = bitmap_find_next_zero_area(allocated_irqs, nr_irqs, from, cnt, 0);
	406	if (start == from)
	407	bitmap_set(allocated_irqs, start, cnt);
	408	else
	409	ret = -EEXIST;
a05a900a	410	mutex_unlock(&sparse_irq_lock);
06f6c339 TG	411	return ret;
	412	}
	413
a98d24b7 TG	414	/**
	415	* irq_get_next_irq - get next allocated irq number
	416	* @offset: where to start the search
	417	*
	418	* Returns next irq number after offset or nr_irqs if none is found.
	419	*/
	420	unsigned int irq_get_next_irq(unsigned int offset)
	421	{
	422	return find_next_bit(allocated_irqs, nr_irqs, offset);
	423	}
	424
d5eb4ad2 TG	425	struct irq_desc *
	426	__irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus)
	427	{
	428	struct irq_desc *desc = irq_to_desc(irq);
	429
	430	if (desc) {
	431	if (bus)
	432	chip_bus_lock(desc);
	433	raw_spin_lock_irqsave(&desc->lock, *flags);
	434	}
	435	return desc;
	436	}
	437
	438	void __irq_put_desc_unlock(struct irq_desc *desc, unsigned long flags, bool bus)
	439	{
	440	raw_spin_unlock_irqrestore(&desc->lock, flags);
	441	if (bus)
	442	chip_bus_sync_unlock(desc);
	443	}
	444
b7b29338 TG	445	/**
	446	* dynamic_irq_cleanup - cleanup a dynamically allocated irq
	447	* @irq: irq number to initialize
	448	*/
	449	void dynamic_irq_cleanup(unsigned int irq)
3795de23	450	{
b7b29338 TG	451	struct irq_desc *desc = irq_to_desc(irq);
	452	unsigned long flags;
	453
	454	raw_spin_lock_irqsave(&desc->lock, flags);
b6873807	455	desc_set_defaults(irq, desc, desc_node(desc), NULL);
b7b29338	456	raw_spin_unlock_irqrestore(&desc->lock, flags);
3795de23 TG	457	}
3795de23 TG	458
3795de23 TG	459	unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
	460	{
	461	struct irq_desc *desc = irq_to_desc(irq);
6c9ae009 ED	462
	463	return desc && desc->kstat_irqs ?
	464	*per_cpu_ptr(desc->kstat_irqs, cpu) : 0;
3795de23	465	}
478735e3	466
478735e3 KH	467	unsigned int kstat_irqs(unsigned int irq)
	468	{
	469	struct irq_desc *desc = irq_to_desc(irq);
	470	int cpu;
	471	int sum = 0;
	472
6c9ae009	473	if (!desc \|\| !desc->kstat_irqs)
478735e3 KH	474	return 0;
478735e3 KH	475	for_each_possible_cpu(cpu)
6c9ae009	476	sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
478735e3 KH	477	return sum;
478735e3 KH	478	}