diff options
| author | Grant Likely <grant.likely@secretlab.ca> | 2010-01-28 16:38:25 -0500 |
|---|---|---|
| committer | Grant Likely <grant.likely@secretlab.ca> | 2010-01-28 16:38:25 -0500 |
| commit | 0ada0a73120c28cc432bcdbac061781465c2f48f (patch) | |
| tree | d17cadd4ea47e25d9e48e7d409a39c84268fbd27 /lib/iommu-helper.c | |
| parent | 6016a363f6b56b46b24655bcfc0499b715851cf3 (diff) | |
| parent | 92dcffb916d309aa01778bf8963a6932e4014d07 (diff) | |
Merge commit 'v2.6.33-rc5' into secretlab/test-devicetree
Diffstat (limited to 'lib/iommu-helper.c')
| -rw-r--r-- | lib/iommu-helper.c | 59 |
1 files changed, 9 insertions, 50 deletions
diff --git a/lib/iommu-helper.c b/lib/iommu-helper.c index 75dbda03f4fb..c0251f4ad08b 100644 --- a/lib/iommu-helper.c +++ b/lib/iommu-helper.c | |||
| @@ -3,41 +3,7 @@ | |||
| 3 | */ | 3 | */ |
| 4 | 4 | ||
| 5 | #include <linux/module.h> | 5 | #include <linux/module.h> |
| 6 | #include <linux/bitops.h> | 6 | #include <linux/bitmap.h> |
| 7 | |||
| 8 | static unsigned long find_next_zero_area(unsigned long *map, | ||
| 9 | unsigned long size, | ||
| 10 | unsigned long start, | ||
| 11 | unsigned int nr, | ||
| 12 | unsigned long align_mask) | ||
| 13 | { | ||
| 14 | unsigned long index, end, i; | ||
| 15 | again: | ||
| 16 | index = find_next_zero_bit(map, size, start); | ||
| 17 | |||
| 18 | /* Align allocation */ | ||
| 19 | index = (index + align_mask) & ~align_mask; | ||
| 20 | |||
| 21 | end = index + nr; | ||
| 22 | if (end >= size) | ||
| 23 | return -1; | ||
| 24 | for (i = index; i < end; i++) { | ||
| 25 | if (test_bit(i, map)) { | ||
| 26 | start = i+1; | ||
| 27 | goto again; | ||
| 28 | } | ||
| 29 | } | ||
| 30 | return index; | ||
| 31 | } | ||
| 32 | |||
| 33 | void iommu_area_reserve(unsigned long *map, unsigned long i, int len) | ||
| 34 | { | ||
| 35 | unsigned long end = i + len; | ||
| 36 | while (i < end) { | ||
| 37 | __set_bit(i, map); | ||
| 38 | i++; | ||
| 39 | } | ||
| 40 | } | ||
| 41 | 7 | ||
| 42 | int iommu_is_span_boundary(unsigned int index, unsigned int nr, | 8 | int iommu_is_span_boundary(unsigned int index, unsigned int nr, |
| 43 | unsigned long shift, | 9 | unsigned long shift, |
| @@ -55,31 +21,24 @@ unsigned long iommu_area_alloc(unsigned long *map, unsigned long size, | |||
| 55 | unsigned long align_mask) | 21 | unsigned long align_mask) |
| 56 | { | 22 | { |
| 57 | unsigned long index; | 23 | unsigned long index; |
| 24 | |||
| 25 | /* We don't want the last of the limit */ | ||
| 26 | size -= 1; | ||
| 58 | again: | 27 | again: |
| 59 | index = find_next_zero_area(map, size, start, nr, align_mask); | 28 | index = bitmap_find_next_zero_area(map, size, start, nr, align_mask); |
| 60 | if (index != -1) { | 29 | if (index < size) { |
| 61 | if (iommu_is_span_boundary(index, nr, shift, boundary_size)) { | 30 | if (iommu_is_span_boundary(index, nr, shift, boundary_size)) { |
| 62 | /* we could do more effectively */ | 31 | /* we could do more effectively */ |
| 63 | start = index + 1; | 32 | start = index + 1; |
| 64 | goto again; | 33 | goto again; |
| 65 | } | 34 | } |
| 66 | iommu_area_reserve(map, index, nr); | 35 | bitmap_set(map, index, nr); |
| 36 | return index; | ||
| 67 | } | 37 | } |
| 68 | return index; | 38 | return -1; |
| 69 | } | 39 | } |
| 70 | EXPORT_SYMBOL(iommu_area_alloc); | 40 | EXPORT_SYMBOL(iommu_area_alloc); |
| 71 | 41 | ||
| 72 | void iommu_area_free(unsigned long *map, unsigned long start, unsigned int nr) | ||
| 73 | { | ||
| 74 | unsigned long end = start + nr; | ||
| 75 | |||
| 76 | while (start < end) { | ||
| 77 | __clear_bit(start, map); | ||
| 78 | start++; | ||
| 79 | } | ||
| 80 | } | ||
| 81 | EXPORT_SYMBOL(iommu_area_free); | ||
| 82 | |||
| 83 | unsigned long iommu_num_pages(unsigned long addr, unsigned long len, | 42 | unsigned long iommu_num_pages(unsigned long addr, unsigned long len, |
| 84 | unsigned long io_page_size) | 43 | unsigned long io_page_size) |
| 85 | { | 44 | { |
