[net-next-2.6.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:
 */
struct lock_class_key irq_desc_lock_class;

#if defined(CONFIG_SMP) && defined(CONFIG_GENERIC_HARDIRQS)
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)
{
	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;
	desc->status = IRQ_DEFAULT_INIT_FLAGS;
	desc->handle_irq = handle_bad_irq;
	desc->depth = 1;
	desc->irq_count = 0;
	desc->irqs_unhandled = 0;
	desc->name = NULL;
	memset(desc->kstat_irqs, 0, nr_cpu_ids * sizeof(*(desc->kstat_irqs)));
	desc_smp_init(desc, node);
}

int nr_irqs = NR_IRQS;
EXPORT_SYMBOL_GPL(nr_irqs);

DEFINE_RAW_SPINLOCK(sparse_irq_lock);
static DECLARE_BITMAP(allocated_irqs, NR_IRQS);

#ifdef CONFIG_SPARSE_IRQ

void __ref init_kstat_irqs(struct irq_desc *desc, int node, int nr)
{
	void *ptr;

	ptr = kzalloc_node(nr * sizeof(*desc->kstat_irqs),
			   GFP_ATOMIC, node);

	/*
	 * don't overwite if can not get new one
	 * init_copy_kstat_irqs() could still use old one
	 */
	if (ptr) {
		printk(KERN_DEBUG "  alloc kstat_irqs on node %d\n", node);
		desc->kstat_irqs = ptr;
	}
}

static RADIX_TREE(irq_desc_tree, GFP_ATOMIC);

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

void replace_irq_desc(unsigned int irq, struct irq_desc *desc)
{
	void **ptr;

	ptr = radix_tree_lookup_slot(&irq_desc_tree, irq);
	if (ptr)
		radix_tree_replace_slot(ptr, desc);
}

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

static struct irq_desc *alloc_desc(int irq, int node)
{
	/* Temporary hack until we can switch to GFP_KERNEL */
	gfp_t gfp = gfp_allowed_mask == GFP_BOOT_MASK ? GFP_NOWAIT : GFP_ATOMIC;
	struct irq_desc *desc;

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

	return desc;

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

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

	unregister_irq_proc(irq, desc);

	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	delete_irq_desc(irq);
	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);

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

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

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

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

	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	bitmap_clear(allocated_irqs, start, cnt);
	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	return -ENOMEM;
}

struct irq_desc * __ref irq_to_desc_alloc_node(unsigned int irq, int node)
{
	int res = irq_alloc_descs(irq, irq, 1, node);

	if (res == -EEXIST || res == irq)
		return irq_to_desc(irq);
	return NULL;
}

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

	for (i = 0; i < initcnt; i++) {
		desc = alloc_desc(i, node);
		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] = {
		.status		= IRQ_DEFAULT_INIT_FLAGS,
		.handle_irq	= handle_bad_irq,
		.depth		= 1,
		.lock		= __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
	}
};

static unsigned int kstat_irqs_all[NR_IRQS][NR_CPUS];
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].irq_data.irq = i;
		desc[i].irq_data.chip = &no_irq_chip;
		desc[i].kstat_irqs = kstat_irqs_all[i];
		alloc_masks(desc + i, GFP_KERNEL, node);
		desc_smp_init(desc + i, node);
		lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
	}
	return arch_early_irq_init();
}

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

struct irq_desc *irq_to_desc_alloc_node(unsigned int irq, int node)
{
	return irq_to_desc(irq);
}

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

static inline int alloc_descs(unsigned int start, unsigned int cnt, int node)
{
	return start;
}
#endif /* !CONFIG_SPARSE_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)
{
	unsigned long flags;
	int i;

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

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

	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	bitmap_clear(allocated_irqs, from, cnt);
	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
}

/**
 * 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)
{
	unsigned long flags;
	int start, ret;

	if (!cnt)
		return -EINVAL;

	raw_spin_lock_irqsave(&sparse_irq_lock, flags);

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

	ret = -ENOMEM;
	if (start >= nr_irqs)
		goto err;

	bitmap_set(allocated_irqs, start, cnt);
	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	return alloc_descs(start, cnt, node);

err:
	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	return ret;
}

/**
 * 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 long flags;
	unsigned int start;
	int ret = 0;

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

	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	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;
	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	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);
}

/**
 * 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));
	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[cpu] : 0;
}
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	*/
	23	struct lock_class_key irq_desc_lock_class;
	24
	25	#if defined(CONFIG_SMP) && defined(CONFIG_GENERIC_HARDIRQS)
	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
	72
	73	static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node)
	74	{
	75	desc->irq_data.irq = irq;
	76	desc->irq_data.chip = &no_irq_chip;
	77	desc->irq_data.chip_data = NULL;
	78	desc->irq_data.handler_data = NULL;
	79	desc->irq_data.msi_desc = NULL;
	80	desc->status = IRQ_DEFAULT_INIT_FLAGS;
	81	desc->handle_irq = handle_bad_irq;
	82	desc->depth = 1;
b7b29338 TG	83	desc->irq_count = 0;
b7b29338 TG	84	desc->irqs_unhandled = 0;
1f5a5b87 TG	85	desc->name = NULL;
	86	memset(desc->kstat_irqs, 0, nr_cpu_ids * sizeof(*(desc->kstat_irqs)));
	87	desc_smp_init(desc, node);
	88	}
	89
3795de23 TG	90	int nr_irqs = NR_IRQS;
	91	EXPORT_SYMBOL_GPL(nr_irqs);
	92
1f5a5b87 TG	93	DEFINE_RAW_SPINLOCK(sparse_irq_lock);
	94	static DECLARE_BITMAP(allocated_irqs, NR_IRQS);
	95
3795de23 TG	96	#ifdef CONFIG_SPARSE_IRQ
3795de23 TG	97
3795de23 TG	98	void __ref init_kstat_irqs(struct irq_desc *desc, int node, int nr)
	99	{
	100	void *ptr;
	101
	102	ptr = kzalloc_node(nr * sizeof(*desc->kstat_irqs),
	103	GFP_ATOMIC, node);
	104
	105	/*
	106	* don't overwite if can not get new one
	107	* init_copy_kstat_irqs() could still use old one
	108	*/
	109	if (ptr) {
	110	printk(KERN_DEBUG " alloc kstat_irqs on node %d\n", node);
	111	desc->kstat_irqs = ptr;
	112	}
	113	}
	114
3795de23 TG	115	static RADIX_TREE(irq_desc_tree, GFP_ATOMIC);
3795de23 TG	116
1f5a5b87	117	static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
3795de23 TG	118	{
	119	radix_tree_insert(&irq_desc_tree, irq, desc);
	120	}
	121
	122	struct irq_desc *irq_to_desc(unsigned int irq)
	123	{
	124	return radix_tree_lookup(&irq_desc_tree, irq);
	125	}
	126
	127	void replace_irq_desc(unsigned int irq, struct irq_desc *desc)
	128	{
	129	void **ptr;
	130
	131	ptr = radix_tree_lookup_slot(&irq_desc_tree, irq);
	132	if (ptr)
	133	radix_tree_replace_slot(ptr, desc);
	134	}
	135
1f5a5b87 TG	136	static void delete_irq_desc(unsigned int irq)
	137	{
	138	radix_tree_delete(&irq_desc_tree, irq);
	139	}
	140
	141	#ifdef CONFIG_SMP
	142	static void free_masks(struct irq_desc *desc)
	143	{
	144	#ifdef CONFIG_GENERIC_PENDING_IRQ
	145	free_cpumask_var(desc->pending_mask);
	146	#endif
	147	free_cpumask_var(desc->affinity);
	148	}
	149	#else
	150	static inline void free_masks(struct irq_desc *desc) { }
	151	#endif
	152
	153	static struct irq_desc *alloc_desc(int irq, int node)
	154	{
aa99ec0f TG	155	/* Temporary hack until we can switch to GFP_KERNEL */
aa99ec0f TG	156	gfp_t gfp = gfp_allowed_mask == GFP_BOOT_MASK ? GFP_NOWAIT : GFP_ATOMIC;
1f5a5b87	157	struct irq_desc *desc;
1f5a5b87 TG	158
	159	desc = kzalloc_node(sizeof(*desc), gfp, node);
	160	if (!desc)
	161	return NULL;
	162	/* allocate based on nr_cpu_ids */
	163	desc->kstat_irqs = kzalloc_node(nr_cpu_ids * sizeof(*desc->kstat_irqs),
	164	gfp, node);
	165	if (!desc->kstat_irqs)
	166	goto err_desc;
	167
	168	if (alloc_masks(desc, gfp, node))
	169	goto err_kstat;
	170
	171	raw_spin_lock_init(&desc->lock);
	172	lockdep_set_class(&desc->lock, &irq_desc_lock_class);
	173
	174	desc_set_defaults(irq, desc, node);
	175
	176	return desc;
	177
	178	err_kstat:
	179	kfree(desc->kstat_irqs);
	180	err_desc:
	181	kfree(desc);
	182	return NULL;
	183	}
	184
	185	static void free_desc(unsigned int irq)
	186	{
	187	struct irq_desc *desc = irq_to_desc(irq);
	188	unsigned long flags;
	189
13bfe99e TG	190	unregister_irq_proc(irq, desc);
13bfe99e TG	191
1f5a5b87 TG	192	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	193	delete_irq_desc(irq);
	194	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	195
	196	free_masks(desc);
	197	kfree(desc->kstat_irqs);
	198	kfree(desc);
	199	}
	200
	201	static int alloc_descs(unsigned int start, unsigned int cnt, int node)
	202	{
	203	struct irq_desc *desc;
	204	unsigned long flags;
	205	int i;
	206
	207	for (i = 0; i < cnt; i++) {
	208	desc = alloc_desc(start + i, node);
	209	if (!desc)
	210	goto err;
	211	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	212	irq_insert_desc(start + i, desc);
	213	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	214	}
	215	return start;
	216
	217	err:
	218	for (i--; i >= 0; i--)
	219	free_desc(start + i);
	220
	221	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	222	bitmap_clear(allocated_irqs, start, cnt);
	223	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	224	return -ENOMEM;
	225	}
	226
aa99ec0f TG	227	struct irq_desc * __ref irq_to_desc_alloc_node(unsigned int irq, int node)
	228	{
	229	int res = irq_alloc_descs(irq, irq, 1, node);
3795de23	230
aa99ec0f TG	231	if (res == -EEXIST \|\| res == irq)
	232	return irq_to_desc(irq);
	233	return NULL;
	234	}
3795de23 TG	235
	236	int __init early_irq_init(void)
	237	{
b683de2b	238	int i, initcnt, node = first_online_node;
3795de23	239	struct irq_desc *desc;
3795de23 TG	240
	241	init_irq_default_affinity();
	242
b683de2b TG	243	/* Let arch update nr_irqs and return the nr of preallocated irqs */
	244	initcnt = arch_probe_nr_irqs();
	245	printk(KERN_INFO "NR_IRQS:%d nr_irqs:%d %d\n", NR_IRQS, nr_irqs, initcnt);
3795de23	246
b683de2b	247	for (i = 0; i < initcnt; i++) {
aa99ec0f TG	248	desc = alloc_desc(i, node);
	249	set_bit(i, allocated_irqs);
	250	irq_insert_desc(i, desc);
3795de23	251	}
3795de23 TG	252	return arch_early_irq_init();
	253	}
	254
3795de23 TG	255	#else /* !CONFIG_SPARSE_IRQ */
	256
	257	struct irq_desc irq_desc[NR_IRQS] __cacheline_aligned_in_smp = {
	258	[0 ... NR_IRQS-1] = {
1318a481	259	.status = IRQ_DEFAULT_INIT_FLAGS,
3795de23 TG	260	.handle_irq = handle_bad_irq,
	261	.depth = 1,
	262	.lock = __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
	263	}
	264	};
	265
	266	static unsigned int kstat_irqs_all[NR_IRQS][NR_CPUS];
	267	int __init early_irq_init(void)
	268	{
aa99ec0f	269	int count, i, node = first_online_node;
3795de23	270	struct irq_desc *desc;
3795de23 TG	271
	272	init_irq_default_affinity();
	273
	274	printk(KERN_INFO "NR_IRQS:%d\n", NR_IRQS);
	275
	276	desc = irq_desc;
	277	count = ARRAY_SIZE(irq_desc);
	278
	279	for (i = 0; i < count; i++) {
	280	desc[i].irq_data.irq = i;
	281	desc[i].irq_data.chip = &no_irq_chip;
3795de23	282	desc[i].kstat_irqs = kstat_irqs_all[i];
aa99ec0f TG	283	alloc_masks(desc + i, GFP_KERNEL, node);
aa99ec0f TG	284	desc_smp_init(desc + i, node);
154cd387	285	lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
3795de23 TG	286	}
	287	return arch_early_irq_init();
	288	}
	289
	290	struct irq_desc *irq_to_desc(unsigned int irq)
	291	{
	292	return (irq < NR_IRQS) ? irq_desc + irq : NULL;
	293	}
	294
	295	struct irq_desc *irq_to_desc_alloc_node(unsigned int irq, int node)
	296	{
	297	return irq_to_desc(irq);
	298	}
1f5a5b87	299
1f5a5b87 TG	300	static void free_desc(unsigned int irq)
1f5a5b87 TG	301	{
b7b29338	302	dynamic_irq_cleanup(irq);
1f5a5b87 TG	303	}
	304
	305	static inline int alloc_descs(unsigned int start, unsigned int cnt, int node)
	306	{
	307	return start;
	308	}
3795de23 TG	309	#endif /* !CONFIG_SPARSE_IRQ */
3795de23 TG	310
1f5a5b87 TG	311	/* Dynamic interrupt handling */
	312
	313	/**
	314	* irq_free_descs - free irq descriptors
	315	* @from: Start of descriptor range
	316	* @cnt: Number of consecutive irqs to free
	317	*/
	318	void irq_free_descs(unsigned int from, unsigned int cnt)
	319	{
	320	unsigned long flags;
	321	int i;
	322
	323	if (from >= nr_irqs \|\| (from + cnt) > nr_irqs)
	324	return;
	325
	326	for (i = 0; i < cnt; i++)
	327	free_desc(from + i);
	328
	329	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	330	bitmap_clear(allocated_irqs, from, cnt);
	331	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	332	}
	333
	334	/**
	335	* irq_alloc_descs - allocate and initialize a range of irq descriptors
	336	* @irq: Allocate for specific irq number if irq >= 0
	337	* @from: Start the search from this irq number
	338	* @cnt: Number of consecutive irqs to allocate.
	339	* @node: Preferred node on which the irq descriptor should be allocated
	340	*
	341	* Returns the first irq number or error code
	342	*/
	343	int __ref
	344	irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node)
	345	{
	346	unsigned long flags;
	347	int start, ret;
	348
	349	if (!cnt)
	350	return -EINVAL;
	351
	352	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	353
	354	start = bitmap_find_next_zero_area(allocated_irqs, nr_irqs, from, cnt, 0);
	355	ret = -EEXIST;
	356	if (irq >=0 && start != irq)
	357	goto err;
	358
	359	ret = -ENOMEM;
	360	if (start >= nr_irqs)
	361	goto err;
	362
	363	bitmap_set(allocated_irqs, start, cnt);
	364	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	365	return alloc_descs(start, cnt, node);
	366
	367	err:
	368	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	369	return ret;
	370	}
	371
06f6c339 TG	372	/**
	373	* irq_reserve_irqs - mark irqs allocated
	374	* @from: mark from irq number
	375	* @cnt: number of irqs to mark
	376	*
	377	* Returns 0 on success or an appropriate error code
	378	*/
	379	int irq_reserve_irqs(unsigned int from, unsigned int cnt)
	380	{
	381	unsigned long flags;
	382	unsigned int start;
	383	int ret = 0;
	384
	385	if (!cnt \|\| (from + cnt) > nr_irqs)
	386	return -EINVAL;
	387
	388	raw_spin_lock_irqsave(&sparse_irq_lock, flags);
	389	start = bitmap_find_next_zero_area(allocated_irqs, nr_irqs, from, cnt, 0);
	390	if (start == from)
	391	bitmap_set(allocated_irqs, start, cnt);
	392	else
	393	ret = -EEXIST;
	394	raw_spin_unlock_irqrestore(&sparse_irq_lock, flags);
	395	return ret;
	396	}
	397
a98d24b7 TG	398	/**
	399	* irq_get_next_irq - get next allocated irq number
	400	* @offset: where to start the search
	401	*
	402	* Returns next irq number after offset or nr_irqs if none is found.
	403	*/
	404	unsigned int irq_get_next_irq(unsigned int offset)
	405	{
	406	return find_next_bit(allocated_irqs, nr_irqs, offset);
	407	}
	408
b7b29338 TG	409	/**
	410	* dynamic_irq_cleanup - cleanup a dynamically allocated irq
	411	* @irq: irq number to initialize
	412	*/
	413	void dynamic_irq_cleanup(unsigned int irq)
3795de23	414	{
b7b29338 TG	415	struct irq_desc *desc = irq_to_desc(irq);
	416	unsigned long flags;
	417
	418	raw_spin_lock_irqsave(&desc->lock, flags);
	419	desc_set_defaults(irq, desc, desc_node(desc));
	420	raw_spin_unlock_irqrestore(&desc->lock, flags);
3795de23 TG	421	}
3795de23 TG	422
3795de23 TG	423	unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
	424	{
	425	struct irq_desc *desc = irq_to_desc(irq);
	426	return desc ? desc->kstat_irqs[cpu] : 0;
	427	}