2 * Copyright 2006-2007, Michael Ellerman, IBM Corporation.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; version 2 of the
11 #include <linux/irq.h>
12 #include <linux/bootmem.h>
13 #include <linux/bitmap.h>
14 #include <linux/msi.h>
17 #include <asm/hw_irq.h>
18 #include <asm/ppc-pci.h>
21 static void __mpic_msi_reserve_hwirq(struct mpic *mpic, irq_hw_number_t hwirq)
23 pr_debug("mpic: reserving hwirq 0x%lx\n", hwirq);
24 bitmap_allocate_region(mpic->hwirq_bitmap, hwirq, 0);
27 void mpic_msi_reserve_hwirq(struct mpic *mpic, irq_hw_number_t hwirq)
31 /* The mpic calls this even when there is no allocator setup */
32 if (!mpic->hwirq_bitmap)
35 spin_lock_irqsave(&mpic->bitmap_lock, flags);
36 __mpic_msi_reserve_hwirq(mpic, hwirq);
37 spin_unlock_irqrestore(&mpic->bitmap_lock, flags);
40 irq_hw_number_t mpic_msi_alloc_hwirqs(struct mpic *mpic, int num)
43 int offset, order = get_count_order(num);
45 spin_lock_irqsave(&mpic->bitmap_lock, flags);
47 * This is fast, but stricter than we need. We might want to add
48 * a fallback routine which does a linear search with no alignment.
50 offset = bitmap_find_free_region(mpic->hwirq_bitmap, mpic->irq_count,
52 spin_unlock_irqrestore(&mpic->bitmap_lock, flags);
54 pr_debug("mpic: allocated 0x%x (2^%d) at offset 0x%x\n",
60 void mpic_msi_free_hwirqs(struct mpic *mpic, int offset, int num)
63 int order = get_count_order(num);
65 pr_debug("mpic: freeing 0x%x (2^%d) at offset 0x%x\n",
68 spin_lock_irqsave(&mpic->bitmap_lock, flags);
69 bitmap_release_region(mpic->hwirq_bitmap, offset, order);
70 spin_unlock_irqrestore(&mpic->bitmap_lock, flags);
73 #ifdef CONFIG_MPIC_U3_HT_IRQS
74 static int mpic_msi_reserve_u3_hwirqs(struct mpic *mpic)
76 irq_hw_number_t hwirq;
77 struct irq_host_ops *ops = mpic->irqhost->ops;
78 struct device_node *np;
82 pr_debug("mpic: found U3, guessing msi allocator setup\n");
84 /* Reserve source numbers we know are reserved in the HW */
85 for (i = 0; i < 8; i++)
86 __mpic_msi_reserve_hwirq(mpic, i);
88 for (i = 42; i < 46; i++)
89 __mpic_msi_reserve_hwirq(mpic, i);
91 for (i = 100; i < 105; i++)
92 __mpic_msi_reserve_hwirq(mpic, i);
95 while ((np = of_find_all_nodes(np))) {
96 pr_debug("mpic: mapping hwirqs for %s\n", np->full_name);
99 while (of_irq_map_one(np, index++, &oirq) == 0) {
100 ops->xlate(mpic->irqhost, NULL, oirq.specifier,
101 oirq.size, &hwirq, &flags);
102 __mpic_msi_reserve_hwirq(mpic, hwirq);
109 static int mpic_msi_reserve_u3_hwirqs(struct mpic *mpic)
115 static int mpic_msi_reserve_dt_hwirqs(struct mpic *mpic)
120 p = of_get_property(mpic->of_node, "msi-available-ranges", &len);
122 pr_debug("mpic: no msi-available-ranges property found on %s\n",
123 mpic->of_node->full_name);
128 printk(KERN_WARNING "mpic: Malformed msi-available-ranges "
129 "property on %s\n", mpic->of_node->full_name);
133 bitmap_allocate_region(mpic->hwirq_bitmap, 0,
134 get_count_order(mpic->irq_count));
136 /* Format is: (<u32 start> <u32 count>)+ */
138 for (i = 0; i < len / 2; i++, p += 2)
139 mpic_msi_free_hwirqs(mpic, *p, *(p + 1));
144 int mpic_msi_init_allocator(struct mpic *mpic)
148 BUG_ON(mpic->hwirq_bitmap);
149 spin_lock_init(&mpic->bitmap_lock);
151 size = BITS_TO_LONGS(mpic->irq_count) * sizeof(long);
152 pr_debug("mpic: allocator bitmap size is 0x%x bytes\n", size);
155 mpic->hwirq_bitmap = kmalloc(size, GFP_KERNEL);
157 mpic->hwirq_bitmap = alloc_bootmem(size);
159 if (!mpic->hwirq_bitmap) {
160 pr_debug("mpic: ENOMEM allocating allocator bitmap!\n");
164 memset(mpic->hwirq_bitmap, 0, size);
166 rc = mpic_msi_reserve_dt_hwirqs(mpic);
168 if (mpic->flags & MPIC_U3_HT_IRQS)
169 rc = mpic_msi_reserve_u3_hwirqs(mpic);
179 kfree(mpic->hwirq_bitmap);
181 mpic->hwirq_bitmap = NULL;