msi_bitmap.c 7.32 KB
Newer Older
1 2 3 4 5 6 7 8 9 10
/*
 * Copyright 2006-2008, Michael Ellerman, IBM Corporation.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; version 2 of the
 * License.
 *
 */

11
#include <linux/slab.h>
12
#include <linux/kernel.h>
13
#include <linux/kmemleak.h>
14
#include <linux/bitmap.h>
15
#include <linux/bootmem.h>
16
#include <asm/msi_bitmap.h>
17
#include <asm/setup.h>
18 19 20 21 22 23 24

int msi_bitmap_alloc_hwirqs(struct msi_bitmap *bmp, int num)
{
	unsigned long flags;
	int offset, order = get_count_order(num);

	spin_lock_irqsave(&bmp->lock, flags);
25 26 27 28 29 30 31

	offset = bitmap_find_next_zero_area(bmp->bitmap, bmp->irq_count, 0,
					    num, (1 << order) - 1);
	if (offset > bmp->irq_count)
		goto err;

	bitmap_set(bmp->bitmap, offset, num);
32 33
	spin_unlock_irqrestore(&bmp->lock, flags);

34
	pr_debug("msi_bitmap: allocated 0x%x at offset 0x%x\n", num, offset);
35 36

	return offset;
37 38 39
err:
	spin_unlock_irqrestore(&bmp->lock, flags);
	return -ENOMEM;
40
}
41
EXPORT_SYMBOL(msi_bitmap_alloc_hwirqs);
42 43 44 45 46 47

void msi_bitmap_free_hwirqs(struct msi_bitmap *bmp, unsigned int offset,
			    unsigned int num)
{
	unsigned long flags;

48 49
	pr_debug("msi_bitmap: freeing 0x%x at offset 0x%x\n",
		 num, offset);
50 51

	spin_lock_irqsave(&bmp->lock, flags);
52
	bitmap_clear(bmp->bitmap, offset, num);
53 54
	spin_unlock_irqrestore(&bmp->lock, flags);
}
55
EXPORT_SYMBOL(msi_bitmap_free_hwirqs);
56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89

void msi_bitmap_reserve_hwirq(struct msi_bitmap *bmp, unsigned int hwirq)
{
	unsigned long flags;

	pr_debug("msi_bitmap: reserving hwirq 0x%x\n", hwirq);

	spin_lock_irqsave(&bmp->lock, flags);
	bitmap_allocate_region(bmp->bitmap, hwirq, 0);
	spin_unlock_irqrestore(&bmp->lock, flags);
}

/**
 * msi_bitmap_reserve_dt_hwirqs - Reserve irqs specified in the device tree.
 * @bmp: pointer to the MSI bitmap.
 *
 * Looks in the device tree to see if there is a property specifying which
 * irqs can be used for MSI. If found those irqs reserved in the device tree
 * are reserved in the bitmap.
 *
 * Returns 0 for success, < 0 if there was an error, and > 0 if no property
 * was found in the device tree.
 **/
int msi_bitmap_reserve_dt_hwirqs(struct msi_bitmap *bmp)
{
	int i, j, len;
	const u32 *p;

	if (!bmp->of_node)
		return 1;

	p = of_get_property(bmp->of_node, "msi-available-ranges", &len);
	if (!p) {
		pr_debug("msi_bitmap: no msi-available-ranges property " \
90
			 "found on %pOF\n", bmp->of_node);
91 92 93 94 95
		return 1;
	}

	if (len % (2 * sizeof(u32)) != 0) {
		printk(KERN_WARNING "msi_bitmap: Malformed msi-available-ranges"
96
		       " property on %pOF\n", bmp->of_node);
97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115
		return -EINVAL;
	}

	bitmap_allocate_region(bmp->bitmap, 0, get_count_order(bmp->irq_count));

	spin_lock(&bmp->lock);

	/* Format is: (<u32 start> <u32 count>)+ */
	len /= 2 * sizeof(u32);
	for (i = 0; i < len; i++, p += 2) {
		for (j = 0; j < *(p + 1); j++)
			bitmap_release_region(bmp->bitmap, *p + j, 0);
	}

	spin_unlock(&bmp->lock);

	return 0;
}

116
int __ref msi_bitmap_alloc(struct msi_bitmap *bmp, unsigned int irq_count,
117 118 119 120 121 122 123 124 125 126
		     struct device_node *of_node)
{
	int size;

	if (!irq_count)
		return -EINVAL;

	size = BITS_TO_LONGS(irq_count) * sizeof(long);
	pr_debug("msi_bitmap: allocator bitmap size is 0x%x bytes\n", size);

127 128 129 130 131 132 133 134 135
	bmp->bitmap_from_slab = slab_is_available();
	if (bmp->bitmap_from_slab)
		bmp->bitmap = kzalloc(size, GFP_KERNEL);
	else {
		bmp->bitmap = memblock_virt_alloc(size, 0);
		/* the bitmap won't be freed from memblock allocator */
		kmemleak_not_leak(bmp->bitmap);
	}

136 137 138 139 140 141 142 143 144 145 146 147 148 149 150
	if (!bmp->bitmap) {
		pr_debug("msi_bitmap: ENOMEM allocating allocator bitmap!\n");
		return -ENOMEM;
	}

	/* We zalloc'ed the bitmap, so all irqs are free by default */
	spin_lock_init(&bmp->lock);
	bmp->of_node = of_node_get(of_node);
	bmp->irq_count = irq_count;

	return 0;
}

void msi_bitmap_free(struct msi_bitmap *bmp)
{
151 152
	if (bmp->bitmap_from_slab)
		kfree(bmp->bitmap);
153 154 155 156 157 158
	of_node_put(bmp->of_node);
	bmp->bitmap = NULL;
}

#ifdef CONFIG_MSI_BITMAP_SELFTEST

159
static void __init test_basics(void)
160 161
{
	struct msi_bitmap bmp;
162
	int rc, i, size = 512;
163 164

	/* Can't allocate a bitmap of 0 irqs */
165
	WARN_ON(msi_bitmap_alloc(&bmp, 0, NULL) == 0);
166 167

	/* of_node may be NULL */
168
	WARN_ON(msi_bitmap_alloc(&bmp, size, NULL));
169 170

	/* Should all be free by default */
171
	WARN_ON(bitmap_find_free_region(bmp.bitmap, size, get_count_order(size)));
172 173 174
	bitmap_release_region(bmp.bitmap, 0, get_count_order(size));

	/* With no node, there's no msi-available-ranges, so expect > 0 */
175
	WARN_ON(msi_bitmap_reserve_dt_hwirqs(&bmp) <= 0);
176 177

	/* Should all still be free */
178
	WARN_ON(bitmap_find_free_region(bmp.bitmap, size, get_count_order(size)));
179 180 181 182
	bitmap_release_region(bmp.bitmap, 0, get_count_order(size));

	/* Check we can fill it up and then no more */
	for (i = 0; i < size; i++)
183
		WARN_ON(msi_bitmap_alloc_hwirqs(&bmp, 1) < 0);
184

185
	WARN_ON(msi_bitmap_alloc_hwirqs(&bmp, 1) >= 0);
186 187

	/* Should all be allocated */
188
	WARN_ON(bitmap_find_free_region(bmp.bitmap, size, 0) >= 0);
189 190 191

	/* And if we free one we can then allocate another */
	msi_bitmap_free_hwirqs(&bmp, size / 2, 1);
192
	WARN_ON(msi_bitmap_alloc_hwirqs(&bmp, 1) != size / 2);
193

194 195 196
	/* Free most of them for the alignment tests */
	msi_bitmap_free_hwirqs(&bmp, 3, size - 3);

197
	/* Check we get a naturally aligned offset */
198
	rc = msi_bitmap_alloc_hwirqs(&bmp, 2);
199
	WARN_ON(rc < 0 && rc % 2 != 0);
200
	rc = msi_bitmap_alloc_hwirqs(&bmp, 4);
201
	WARN_ON(rc < 0 && rc % 4 != 0);
202
	rc = msi_bitmap_alloc_hwirqs(&bmp, 8);
203
	WARN_ON(rc < 0 && rc % 8 != 0);
204
	rc = msi_bitmap_alloc_hwirqs(&bmp, 9);
205
	WARN_ON(rc < 0 && rc % 16 != 0);
206
	rc = msi_bitmap_alloc_hwirqs(&bmp, 3);
207
	WARN_ON(rc < 0 && rc % 4 != 0);
208
	rc = msi_bitmap_alloc_hwirqs(&bmp, 7);
209
	WARN_ON(rc < 0 && rc % 8 != 0);
210
	rc = msi_bitmap_alloc_hwirqs(&bmp, 121);
211
	WARN_ON(rc < 0 && rc % 128 != 0);
212

213 214
	msi_bitmap_free(&bmp);

215 216
	/* Clients may WARN_ON bitmap == NULL for "not-allocated" */
	WARN_ON(bmp.bitmap != NULL);
217 218
}

219
static void __init test_of_node(void)
220 221 222 223 224 225 226 227 228 229 230 231 232
{
	u32 prop_data[] = { 10, 10, 25, 3, 40, 1, 100, 100, 200, 20 };
	const char *expected_str = "0-9,20-24,28-39,41-99,220-255";
	char *prop_name = "msi-available-ranges";
	char *node_name = "/fakenode";
	struct device_node of_node;
	struct property prop;
	struct msi_bitmap bmp;
	int size = 256;
	DECLARE_BITMAP(expected, size);

	/* There should really be a struct device_node allocator */
	memset(&of_node, 0, sizeof(of_node));
233
	of_node_init(&of_node);
234 235
	of_node.full_name = node_name;

236
	WARN_ON(msi_bitmap_alloc(&bmp, size, &of_node));
237 238

	/* No msi-available-ranges, so expect > 0 */
239
	WARN_ON(msi_bitmap_reserve_dt_hwirqs(&bmp) <= 0);
240 241

	/* Should all still be free */
242
	WARN_ON(bitmap_find_free_region(bmp.bitmap, size, get_count_order(size)));
243 244 245 246 247 248 249 250 251 252 253 254 255
	bitmap_release_region(bmp.bitmap, 0, get_count_order(size));

	/* Now create a fake msi-available-ranges property */

	/* There should really .. oh whatever */
	memset(&prop, 0, sizeof(prop));
	prop.name = prop_name;
	prop.value = &prop_data;
	prop.length = sizeof(prop_data);

	of_node.properties = &prop;

	/* msi-available-ranges, so expect == 0 */
256
	WARN_ON(msi_bitmap_reserve_dt_hwirqs(&bmp));
257 258

	/* Check we got the expected result */
259 260
	WARN_ON(bitmap_parselist(expected_str, expected, size));
	WARN_ON(!bitmap_equal(expected, bmp.bitmap, size));
261 262 263 264 265

	msi_bitmap_free(&bmp);
	kfree(bmp.bitmap);
}

266
static int __init msi_bitmap_selftest(void)
267 268 269 270 271 272 273 274 275 276
{
	printk(KERN_DEBUG "Running MSI bitmap self-tests ...\n");

	test_basics();
	test_of_node();

	return 0;
}
late_initcall(msi_bitmap_selftest);
#endif /* CONFIG_MSI_BITMAP_SELFTEST */