aboutsummaryrefslogtreecommitdiffstats
path: root/target/linux/brcm47xx/patches-3.8/020-mtd-bcm47xxpart-simplify-size-calculation-to-one-loo.patch
diff options
context:
space:
mode:
authorHauke Mehrtens <hauke@hauke-m.de>2013-02-16 20:28:24 +0000
committerHauke Mehrtens <hauke@hauke-m.de>2013-02-16 20:28:24 +0000
commit1a8218d6e4f770c026149a836f93fe9f9e2b4a4f (patch)
tree2dc2d4678f4c56f10e3ff13a6dab51eaa1579851 /target/linux/brcm47xx/patches-3.8/020-mtd-bcm47xxpart-simplify-size-calculation-to-one-loo.patch
parent1d6574b9c3fb992b9bf509d02c76e9250834ae24 (diff)
downloadupstream-1a8218d6e4f770c026149a836f93fe9f9e2b4a4f.tar.gz
upstream-1a8218d6e4f770c026149a836f93fe9f9e2b4a4f.tar.bz2
upstream-1a8218d6e4f770c026149a836f93fe9f9e2b4a4f.zip
brcm47xx: add initial support for kernel 3.8
This contains the following new bigger changes: * new partition parser which still could lake some features or have bugs * new nand flash driver * using physmap-flash flash driver for parallel flash * some changes to the serial flash driver With these changes OpenWrt starts using more of the mainline flash drivers. SVN-Revision: 35632
Diffstat (limited to 'target/linux/brcm47xx/patches-3.8/020-mtd-bcm47xxpart-simplify-size-calculation-to-one-loo.patch')
-rw-r--r--target/linux/brcm47xx/patches-3.8/020-mtd-bcm47xxpart-simplify-size-calculation-to-one-loo.patch20
1 files changed, 20 insertions, 0 deletions
diff --git a/target/linux/brcm47xx/patches-3.8/020-mtd-bcm47xxpart-simplify-size-calculation-to-one-loo.patch b/target/linux/brcm47xx/patches-3.8/020-mtd-bcm47xxpart-simplify-size-calculation-to-one-loo.patch
new file mode 100644
index 0000000000..88771d9840
--- /dev/null
+++ b/target/linux/brcm47xx/patches-3.8/020-mtd-bcm47xxpart-simplify-size-calculation-to-one-loo.patch
@@ -0,0 +1,20 @@
+--- a/drivers/mtd/bcm47xxpart.c
++++ b/drivers/mtd/bcm47xxpart.c
+@@ -169,11 +169,12 @@ static int bcm47xxpart_parse(struct mtd_
+ * Assume that partitions end at the beginning of the one they are
+ * followed by.
+ */
+- for (i = 0; i < curr_part - 1; i++)
+- parts[i].size = parts[i + 1].offset - parts[i].offset;
+- if (curr_part > 0)
+- parts[curr_part - 1].size =
+- master->size - parts[curr_part - 1].offset;
++ for (i = 0; i < curr_part; i++) {
++ u64 next_part_offset = (i < curr_part - 1) ?
++ parts[i + 1].offset : master->size;
++
++ parts[i].size = next_part_offset - parts[i].offset;
++ }
+
+ *pparts = parts;
+ return curr_part;