diff options
| author | Greg Kroah-Hartman <gregkh@linuxfoundation.org> | 2013-06-24 18:14:43 -0400 |
|---|---|---|
| committer | Greg Kroah-Hartman <gregkh@linuxfoundation.org> | 2013-06-24 18:14:43 -0400 |
| commit | b5aef682e00c424bb2f55639168083b61803a012 (patch) | |
| tree | b7b69146e8331f96db02b766fc139d8a0907d446 /kernel/range.c | |
| parent | 90f8908127b55aa22f5a995880d5ac8cd23fbe1e (diff) | |
| parent | 9e895ace5d82df8929b16f58e9f515f6d54ab82d (diff) | |
Merge 3.10-rc7 into driver-core-next
We want the firmware merge fixes, and other bits, in here now.
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Diffstat (limited to 'kernel/range.c')
| -rw-r--r-- | kernel/range.c | 21 |
1 files changed, 11 insertions, 10 deletions
diff --git a/kernel/range.c b/kernel/range.c index eb911dbce267..322ea8e93e4b 100644 --- a/kernel/range.c +++ b/kernel/range.c | |||
| @@ -4,7 +4,7 @@ | |||
| 4 | #include <linux/kernel.h> | 4 | #include <linux/kernel.h> |
| 5 | #include <linux/init.h> | 5 | #include <linux/init.h> |
| 6 | #include <linux/sort.h> | 6 | #include <linux/sort.h> |
| 7 | 7 | #include <linux/string.h> | |
| 8 | #include <linux/range.h> | 8 | #include <linux/range.h> |
| 9 | 9 | ||
| 10 | int add_range(struct range *range, int az, int nr_range, u64 start, u64 end) | 10 | int add_range(struct range *range, int az, int nr_range, u64 start, u64 end) |
| @@ -32,9 +32,8 @@ int add_range_with_merge(struct range *range, int az, int nr_range, | |||
| 32 | if (start >= end) | 32 | if (start >= end) |
| 33 | return nr_range; | 33 | return nr_range; |
| 34 | 34 | ||
| 35 | /* Try to merge it with old one: */ | 35 | /* get new start/end: */ |
| 36 | for (i = 0; i < nr_range; i++) { | 36 | for (i = 0; i < nr_range; i++) { |
| 37 | u64 final_start, final_end; | ||
| 38 | u64 common_start, common_end; | 37 | u64 common_start, common_end; |
| 39 | 38 | ||
| 40 | if (!range[i].end) | 39 | if (!range[i].end) |
| @@ -45,14 +44,16 @@ int add_range_with_merge(struct range *range, int az, int nr_range, | |||
| 45 | if (common_start > common_end) | 44 | if (common_start > common_end) |
| 46 | continue; | 45 | continue; |
| 47 | 46 | ||
| 48 | final_start = min(range[i].start, start); | 47 | /* new start/end, will add it back at last */ |
| 49 | final_end = max(range[i].end, end); | 48 | start = min(range[i].start, start); |
| 49 | end = max(range[i].end, end); | ||
| 50 | 50 | ||
| 51 | /* clear it and add it back for further merge */ | 51 | memmove(&range[i], &range[i + 1], |
| 52 | range[i].start = 0; | 52 | (nr_range - (i + 1)) * sizeof(range[i])); |
| 53 | range[i].end = 0; | 53 | range[nr_range - 1].start = 0; |
| 54 | return add_range_with_merge(range, az, nr_range, | 54 | range[nr_range - 1].end = 0; |
| 55 | final_start, final_end); | 55 | nr_range--; |
| 56 | i--; | ||
| 56 | } | 57 | } |
| 57 | 58 | ||
| 58 | /* Need to add it: */ | 59 | /* Need to add it: */ |
