[deliverable/linux.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);
}

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

#ifdef CONFIG_SMP
static inline int desc_node(struct irq_desc *desc)
{
	return desc->irq_data.node;
}
#else
static inline int desc_node(struct irq_desc *desc) { return 0; }
#endif

static void free_desc(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);
}

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

/* Statistics access */
void clear_kstat_irqs(struct irq_desc *desc)
{
	memset(desc->kstat_irqs, 0, nr_cpu_ids * sizeof(*(desc->kstat_irqs)));
}

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