Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Simple MTD partitioning layer | |
3 | * | |
a1452a37 DW |
4 | * Copyright © 2000 Nicolas Pitre <nico@fluxnic.net> |
5 | * Copyright © 2002 Thomas Gleixner <gleixner@linutronix.de> | |
6 | * Copyright © 2000-2010 David Woodhouse <dwmw2@infradead.org> | |
1da177e4 | 7 | * |
a1452a37 DW |
8 | * This program is free software; you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by | |
10 | * the Free Software Foundation; either version 2 of the License, or | |
11 | * (at your option) any later version. | |
12 | * | |
13 | * This program is distributed in the hope that it will be useful, | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | * GNU General Public License for more details. | |
17 | * | |
18 | * You should have received a copy of the GNU General Public License | |
19 | * along with this program; if not, write to the Free Software | |
20 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
1da177e4 | 21 | * |
97894cda | 22 | */ |
1da177e4 LT |
23 | |
24 | #include <linux/module.h> | |
25 | #include <linux/types.h> | |
26 | #include <linux/kernel.h> | |
27 | #include <linux/slab.h> | |
28 | #include <linux/list.h> | |
1da177e4 LT |
29 | #include <linux/kmod.h> |
30 | #include <linux/mtd/mtd.h> | |
31 | #include <linux/mtd/partitions.h> | |
5daa7b21 | 32 | #include <linux/err.h> |
1da177e4 | 33 | |
eea72d5f JI |
34 | #include "mtdcore.h" |
35 | ||
1da177e4 LT |
36 | /* Our partition linked list */ |
37 | static LIST_HEAD(mtd_partitions); | |
5daa7b21 | 38 | static DEFINE_MUTEX(mtd_partitions_mutex); |
1da177e4 LT |
39 | |
40 | /* Our partition node structure */ | |
41 | struct mtd_part { | |
42 | struct mtd_info mtd; | |
43 | struct mtd_info *master; | |
69423d99 | 44 | uint64_t offset; |
1da177e4 | 45 | struct list_head list; |
1da177e4 LT |
46 | }; |
47 | ||
48 | /* | |
49 | * Given a pointer to the MTD object in the mtd_part structure, we can retrieve | |
50 | * the pointer to that structure with this macro. | |
51 | */ | |
52 | #define PART(x) ((struct mtd_part *)(x)) | |
53 | ||
97894cda TG |
54 | |
55 | /* | |
1da177e4 LT |
56 | * MTD methods which simply translate the effective address and pass through |
57 | * to the _real_ device. | |
58 | */ | |
59 | ||
b33a2887 AN |
60 | static int part_read(struct mtd_info *mtd, loff_t from, size_t len, |
61 | size_t *retlen, u_char *buf) | |
1da177e4 LT |
62 | { |
63 | struct mtd_part *part = PART(mtd); | |
d8877f19 | 64 | struct mtd_ecc_stats stats; |
f1a28c02 TG |
65 | int res; |
66 | ||
d8877f19 YK |
67 | stats = part->master->ecc_stats; |
68 | ||
1da177e4 LT |
69 | if (from >= mtd->size) |
70 | len = 0; | |
71 | else if (from + len > mtd->size) | |
72 | len = mtd->size - from; | |
329ad399 | 73 | res = mtd_read(part->master, from + part->offset, len, retlen, buf); |
f1a28c02 | 74 | if (unlikely(res)) { |
d57f4054 | 75 | if (mtd_is_bitflip(res)) |
d8877f19 | 76 | mtd->ecc_stats.corrected += part->master->ecc_stats.corrected - stats.corrected; |
d57f4054 | 77 | if (mtd_is_eccerr(res)) |
d8877f19 | 78 | mtd->ecc_stats.failed += part->master->ecc_stats.failed - stats.failed; |
f1a28c02 TG |
79 | } |
80 | return res; | |
1da177e4 LT |
81 | } |
82 | ||
b33a2887 AN |
83 | static int part_point(struct mtd_info *mtd, loff_t from, size_t len, |
84 | size_t *retlen, void **virt, resource_size_t *phys) | |
1da177e4 LT |
85 | { |
86 | struct mtd_part *part = PART(mtd); | |
87 | if (from >= mtd->size) | |
88 | len = 0; | |
89 | else if (from + len > mtd->size) | |
90 | len = mtd->size - from; | |
d35ea200 AB |
91 | return mtd_point(part->master, from + part->offset, len, retlen, |
92 | virt, phys); | |
1da177e4 | 93 | } |
9223a456 | 94 | |
a98889f3 | 95 | static void part_unpoint(struct mtd_info *mtd, loff_t from, size_t len) |
1da177e4 LT |
96 | { |
97 | struct mtd_part *part = PART(mtd); | |
98 | ||
7219778a | 99 | mtd_unpoint(part->master, from + part->offset, len); |
1da177e4 LT |
100 | } |
101 | ||
402d3265 DH |
102 | static unsigned long part_get_unmapped_area(struct mtd_info *mtd, |
103 | unsigned long len, | |
104 | unsigned long offset, | |
105 | unsigned long flags) | |
106 | { | |
107 | struct mtd_part *part = PART(mtd); | |
108 | ||
109 | offset += part->offset; | |
04c601bf | 110 | return mtd_get_unmapped_area(part->master, len, offset, flags); |
402d3265 DH |
111 | } |
112 | ||
8593fbc6 | 113 | static int part_read_oob(struct mtd_info *mtd, loff_t from, |
b33a2887 | 114 | struct mtd_oob_ops *ops) |
1da177e4 LT |
115 | { |
116 | struct mtd_part *part = PART(mtd); | |
f1a28c02 | 117 | int res; |
8593fbc6 | 118 | |
1da177e4 | 119 | if (from >= mtd->size) |
8593fbc6 | 120 | return -EINVAL; |
7014568b | 121 | if (ops->datbuf && from + ops->len > mtd->size) |
8593fbc6 | 122 | return -EINVAL; |
f1a28c02 | 123 | |
154bf89f AB |
124 | /* |
125 | * If OOB is also requested, make sure that we do not read past the end | |
126 | * of this partition. | |
127 | */ | |
128 | if (ops->oobbuf) { | |
129 | size_t len, pages; | |
130 | ||
0612b9dd | 131 | if (ops->mode == MTD_OPS_AUTO_OOB) |
154bf89f AB |
132 | len = mtd->oobavail; |
133 | else | |
134 | len = mtd->oobsize; | |
135 | pages = mtd_div_by_ws(mtd->size, mtd); | |
136 | pages -= mtd_div_by_ws(from, mtd); | |
137 | if (ops->ooboffs + ops->ooblen > pages * len) | |
138 | return -EINVAL; | |
139 | } | |
140 | ||
fd2819bb | 141 | res = mtd_read_oob(part->master, from + part->offset, ops); |
f1a28c02 | 142 | if (unlikely(res)) { |
d57f4054 | 143 | if (mtd_is_bitflip(res)) |
f1a28c02 | 144 | mtd->ecc_stats.corrected++; |
d57f4054 | 145 | if (mtd_is_eccerr(res)) |
f1a28c02 TG |
146 | mtd->ecc_stats.failed++; |
147 | } | |
148 | return res; | |
1da177e4 LT |
149 | } |
150 | ||
b33a2887 AN |
151 | static int part_read_user_prot_reg(struct mtd_info *mtd, loff_t from, |
152 | size_t len, size_t *retlen, u_char *buf) | |
1da177e4 LT |
153 | { |
154 | struct mtd_part *part = PART(mtd); | |
b33a2887 | 155 | return part->master->read_user_prot_reg(part->master, from, |
1da177e4 LT |
156 | len, retlen, buf); |
157 | } | |
158 | ||
b33a2887 AN |
159 | static int part_get_user_prot_info(struct mtd_info *mtd, |
160 | struct otp_info *buf, size_t len) | |
f77814dd NP |
161 | { |
162 | struct mtd_part *part = PART(mtd); | |
b33a2887 | 163 | return part->master->get_user_prot_info(part->master, buf, len); |
f77814dd NP |
164 | } |
165 | ||
b33a2887 AN |
166 | static int part_read_fact_prot_reg(struct mtd_info *mtd, loff_t from, |
167 | size_t len, size_t *retlen, u_char *buf) | |
1da177e4 LT |
168 | { |
169 | struct mtd_part *part = PART(mtd); | |
d264f72a | 170 | return mtd_read_fact_prot_reg(part->master, from, len, retlen, buf); |
1da177e4 LT |
171 | } |
172 | ||
b33a2887 AN |
173 | static int part_get_fact_prot_info(struct mtd_info *mtd, struct otp_info *buf, |
174 | size_t len) | |
f77814dd NP |
175 | { |
176 | struct mtd_part *part = PART(mtd); | |
a750b5ce | 177 | return mtd_get_fact_prot_info(part->master, buf, len); |
f77814dd NP |
178 | } |
179 | ||
b33a2887 AN |
180 | static int part_write(struct mtd_info *mtd, loff_t to, size_t len, |
181 | size_t *retlen, const u_char *buf) | |
1da177e4 LT |
182 | { |
183 | struct mtd_part *part = PART(mtd); | |
184 | if (!(mtd->flags & MTD_WRITEABLE)) | |
185 | return -EROFS; | |
186 | if (to >= mtd->size) | |
187 | len = 0; | |
188 | else if (to + len > mtd->size) | |
189 | len = mtd->size - to; | |
eda95cbf | 190 | return mtd_write(part->master, to + part->offset, len, retlen, buf); |
1da177e4 LT |
191 | } |
192 | ||
b33a2887 AN |
193 | static int part_panic_write(struct mtd_info *mtd, loff_t to, size_t len, |
194 | size_t *retlen, const u_char *buf) | |
388bbb09 RP |
195 | { |
196 | struct mtd_part *part = PART(mtd); | |
197 | if (!(mtd->flags & MTD_WRITEABLE)) | |
198 | return -EROFS; | |
199 | if (to >= mtd->size) | |
200 | len = 0; | |
201 | else if (to + len > mtd->size) | |
202 | len = mtd->size - to; | |
7ae79d7f AB |
203 | return mtd_panic_write(part->master, to + part->offset, len, retlen, |
204 | buf); | |
388bbb09 RP |
205 | } |
206 | ||
8593fbc6 | 207 | static int part_write_oob(struct mtd_info *mtd, loff_t to, |
b33a2887 | 208 | struct mtd_oob_ops *ops) |
1da177e4 LT |
209 | { |
210 | struct mtd_part *part = PART(mtd); | |
8593fbc6 | 211 | |
1da177e4 LT |
212 | if (!(mtd->flags & MTD_WRITEABLE)) |
213 | return -EROFS; | |
8593fbc6 | 214 | |
1da177e4 | 215 | if (to >= mtd->size) |
8593fbc6 | 216 | return -EINVAL; |
7014568b | 217 | if (ops->datbuf && to + ops->len > mtd->size) |
8593fbc6 | 218 | return -EINVAL; |
a2cc5ba0 | 219 | return mtd_write_oob(part->master, to + part->offset, ops); |
1da177e4 LT |
220 | } |
221 | ||
b33a2887 AN |
222 | static int part_write_user_prot_reg(struct mtd_info *mtd, loff_t from, |
223 | size_t len, size_t *retlen, u_char *buf) | |
1da177e4 LT |
224 | { |
225 | struct mtd_part *part = PART(mtd); | |
b33a2887 | 226 | return part->master->write_user_prot_reg(part->master, from, |
1da177e4 LT |
227 | len, retlen, buf); |
228 | } | |
229 | ||
b33a2887 AN |
230 | static int part_lock_user_prot_reg(struct mtd_info *mtd, loff_t from, |
231 | size_t len) | |
f77814dd NP |
232 | { |
233 | struct mtd_part *part = PART(mtd); | |
b33a2887 | 234 | return part->master->lock_user_prot_reg(part->master, from, len); |
f77814dd NP |
235 | } |
236 | ||
b33a2887 AN |
237 | static int part_writev(struct mtd_info *mtd, const struct kvec *vecs, |
238 | unsigned long count, loff_t to, size_t *retlen) | |
1da177e4 LT |
239 | { |
240 | struct mtd_part *part = PART(mtd); | |
241 | if (!(mtd->flags & MTD_WRITEABLE)) | |
242 | return -EROFS; | |
b33a2887 | 243 | return part->master->writev(part->master, vecs, count, |
1da177e4 | 244 | to + part->offset, retlen); |
1da177e4 LT |
245 | } |
246 | ||
b33a2887 | 247 | static int part_erase(struct mtd_info *mtd, struct erase_info *instr) |
1da177e4 LT |
248 | { |
249 | struct mtd_part *part = PART(mtd); | |
250 | int ret; | |
251 | if (!(mtd->flags & MTD_WRITEABLE)) | |
252 | return -EROFS; | |
253 | if (instr->addr >= mtd->size) | |
254 | return -EINVAL; | |
255 | instr->addr += part->offset; | |
7e1f0dc0 | 256 | ret = mtd_erase(part->master, instr); |
74641d75 | 257 | if (ret) { |
bb0eb217 | 258 | if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN) |
74641d75 AH |
259 | instr->fail_addr -= part->offset; |
260 | instr->addr -= part->offset; | |
261 | } | |
1da177e4 LT |
262 | return ret; |
263 | } | |
264 | ||
265 | void mtd_erase_callback(struct erase_info *instr) | |
266 | { | |
267 | if (instr->mtd->erase == part_erase) { | |
268 | struct mtd_part *part = PART(instr->mtd); | |
269 | ||
bb0eb217 | 270 | if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN) |
1da177e4 LT |
271 | instr->fail_addr -= part->offset; |
272 | instr->addr -= part->offset; | |
273 | } | |
274 | if (instr->callback) | |
275 | instr->callback(instr); | |
276 | } | |
277 | EXPORT_SYMBOL_GPL(mtd_erase_callback); | |
278 | ||
69423d99 | 279 | static int part_lock(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
1da177e4 LT |
280 | { |
281 | struct mtd_part *part = PART(mtd); | |
97894cda | 282 | if ((len + ofs) > mtd->size) |
1da177e4 LT |
283 | return -EINVAL; |
284 | return part->master->lock(part->master, ofs + part->offset, len); | |
285 | } | |
286 | ||
69423d99 | 287 | static int part_unlock(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
1da177e4 LT |
288 | { |
289 | struct mtd_part *part = PART(mtd); | |
97894cda | 290 | if ((len + ofs) > mtd->size) |
1da177e4 LT |
291 | return -EINVAL; |
292 | return part->master->unlock(part->master, ofs + part->offset, len); | |
293 | } | |
294 | ||
9938424f RC |
295 | static int part_is_locked(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
296 | { | |
297 | struct mtd_part *part = PART(mtd); | |
298 | if ((len + ofs) > mtd->size) | |
299 | return -EINVAL; | |
300 | return part->master->is_locked(part->master, ofs + part->offset, len); | |
301 | } | |
302 | ||
1da177e4 LT |
303 | static void part_sync(struct mtd_info *mtd) |
304 | { | |
305 | struct mtd_part *part = PART(mtd); | |
306 | part->master->sync(part->master); | |
307 | } | |
308 | ||
309 | static int part_suspend(struct mtd_info *mtd) | |
310 | { | |
311 | struct mtd_part *part = PART(mtd); | |
312 | return part->master->suspend(part->master); | |
313 | } | |
314 | ||
315 | static void part_resume(struct mtd_info *mtd) | |
316 | { | |
317 | struct mtd_part *part = PART(mtd); | |
318 | part->master->resume(part->master); | |
319 | } | |
320 | ||
b33a2887 | 321 | static int part_block_isbad(struct mtd_info *mtd, loff_t ofs) |
1da177e4 LT |
322 | { |
323 | struct mtd_part *part = PART(mtd); | |
324 | if (ofs >= mtd->size) | |
325 | return -EINVAL; | |
326 | ofs += part->offset; | |
327 | return part->master->block_isbad(part->master, ofs); | |
328 | } | |
329 | ||
b33a2887 | 330 | static int part_block_markbad(struct mtd_info *mtd, loff_t ofs) |
1da177e4 LT |
331 | { |
332 | struct mtd_part *part = PART(mtd); | |
f1a28c02 TG |
333 | int res; |
334 | ||
1da177e4 LT |
335 | if (!(mtd->flags & MTD_WRITEABLE)) |
336 | return -EROFS; | |
337 | if (ofs >= mtd->size) | |
338 | return -EINVAL; | |
339 | ofs += part->offset; | |
f1a28c02 TG |
340 | res = part->master->block_markbad(part->master, ofs); |
341 | if (!res) | |
342 | mtd->ecc_stats.badblocks++; | |
343 | return res; | |
1da177e4 LT |
344 | } |
345 | ||
5daa7b21 RT |
346 | static inline void free_partition(struct mtd_part *p) |
347 | { | |
348 | kfree(p->mtd.name); | |
349 | kfree(p); | |
350 | } | |
351 | ||
97894cda TG |
352 | /* |
353 | * This function unregisters and destroy all slave MTD objects which are | |
1da177e4 LT |
354 | * attached to the given master MTD object. |
355 | */ | |
356 | ||
357 | int del_mtd_partitions(struct mtd_info *master) | |
358 | { | |
71a928c0 | 359 | struct mtd_part *slave, *next; |
5daa7b21 | 360 | int ret, err = 0; |
1da177e4 | 361 | |
5daa7b21 | 362 | mutex_lock(&mtd_partitions_mutex); |
71a928c0 | 363 | list_for_each_entry_safe(slave, next, &mtd_partitions, list) |
1da177e4 | 364 | if (slave->master == master) { |
5daa7b21 RT |
365 | ret = del_mtd_device(&slave->mtd); |
366 | if (ret < 0) { | |
367 | err = ret; | |
368 | continue; | |
369 | } | |
71a928c0 | 370 | list_del(&slave->list); |
5daa7b21 | 371 | free_partition(slave); |
1da177e4 | 372 | } |
5daa7b21 | 373 | mutex_unlock(&mtd_partitions_mutex); |
1da177e4 | 374 | |
5daa7b21 | 375 | return err; |
1da177e4 LT |
376 | } |
377 | ||
5daa7b21 RT |
378 | static struct mtd_part *allocate_partition(struct mtd_info *master, |
379 | const struct mtd_partition *part, int partno, | |
380 | uint64_t cur_offset) | |
7788ba71 AN |
381 | { |
382 | struct mtd_part *slave; | |
5daa7b21 | 383 | char *name; |
7788ba71 AN |
384 | |
385 | /* allocate the partition structure */ | |
b33a2887 | 386 | slave = kzalloc(sizeof(*slave), GFP_KERNEL); |
5daa7b21 RT |
387 | name = kstrdup(part->name, GFP_KERNEL); |
388 | if (!name || !slave) { | |
b33a2887 | 389 | printk(KERN_ERR"memory allocation error while creating partitions for \"%s\"\n", |
5daa7b21 RT |
390 | master->name); |
391 | kfree(name); | |
392 | kfree(slave); | |
393 | return ERR_PTR(-ENOMEM); | |
7788ba71 | 394 | } |
7788ba71 AN |
395 | |
396 | /* set up the MTD object for this partition */ | |
397 | slave->mtd.type = master->type; | |
398 | slave->mtd.flags = master->flags & ~part->mask_flags; | |
399 | slave->mtd.size = part->size; | |
400 | slave->mtd.writesize = master->writesize; | |
7fa33ac0 | 401 | slave->mtd.writebufsize = master->writebufsize; |
7788ba71 AN |
402 | slave->mtd.oobsize = master->oobsize; |
403 | slave->mtd.oobavail = master->oobavail; | |
404 | slave->mtd.subpage_sft = master->subpage_sft; | |
405 | ||
5daa7b21 | 406 | slave->mtd.name = name; |
7788ba71 | 407 | slave->mtd.owner = master->owner; |
402d3265 | 408 | slave->mtd.backing_dev_info = master->backing_dev_info; |
7788ba71 | 409 | |
1f24b5a8 DB |
410 | /* NOTE: we don't arrange MTDs as a tree; it'd be error-prone |
411 | * to have the same data be in two different partitions. | |
412 | */ | |
413 | slave->mtd.dev.parent = master->dev.parent; | |
414 | ||
7788ba71 AN |
415 | slave->mtd.read = part_read; |
416 | slave->mtd.write = part_write; | |
417 | ||
418 | if (master->panic_write) | |
419 | slave->mtd.panic_write = part_panic_write; | |
420 | ||
b33a2887 | 421 | if (master->point && master->unpoint) { |
7788ba71 AN |
422 | slave->mtd.point = part_point; |
423 | slave->mtd.unpoint = part_unpoint; | |
424 | } | |
425 | ||
402d3265 DH |
426 | if (master->get_unmapped_area) |
427 | slave->mtd.get_unmapped_area = part_get_unmapped_area; | |
7788ba71 AN |
428 | if (master->read_oob) |
429 | slave->mtd.read_oob = part_read_oob; | |
430 | if (master->write_oob) | |
431 | slave->mtd.write_oob = part_write_oob; | |
b33a2887 | 432 | if (master->read_user_prot_reg) |
7788ba71 | 433 | slave->mtd.read_user_prot_reg = part_read_user_prot_reg; |
b33a2887 | 434 | if (master->read_fact_prot_reg) |
7788ba71 | 435 | slave->mtd.read_fact_prot_reg = part_read_fact_prot_reg; |
b33a2887 | 436 | if (master->write_user_prot_reg) |
7788ba71 | 437 | slave->mtd.write_user_prot_reg = part_write_user_prot_reg; |
b33a2887 | 438 | if (master->lock_user_prot_reg) |
7788ba71 | 439 | slave->mtd.lock_user_prot_reg = part_lock_user_prot_reg; |
b33a2887 | 440 | if (master->get_user_prot_info) |
7788ba71 | 441 | slave->mtd.get_user_prot_info = part_get_user_prot_info; |
b33a2887 | 442 | if (master->get_fact_prot_info) |
7788ba71 AN |
443 | slave->mtd.get_fact_prot_info = part_get_fact_prot_info; |
444 | if (master->sync) | |
445 | slave->mtd.sync = part_sync; | |
4704a784 | 446 | if (!partno && !master->dev.class && master->suspend && master->resume) { |
7788ba71 AN |
447 | slave->mtd.suspend = part_suspend; |
448 | slave->mtd.resume = part_resume; | |
449 | } | |
450 | if (master->writev) | |
451 | slave->mtd.writev = part_writev; | |
452 | if (master->lock) | |
453 | slave->mtd.lock = part_lock; | |
454 | if (master->unlock) | |
455 | slave->mtd.unlock = part_unlock; | |
9938424f RC |
456 | if (master->is_locked) |
457 | slave->mtd.is_locked = part_is_locked; | |
7788ba71 AN |
458 | if (master->block_isbad) |
459 | slave->mtd.block_isbad = part_block_isbad; | |
460 | if (master->block_markbad) | |
461 | slave->mtd.block_markbad = part_block_markbad; | |
462 | slave->mtd.erase = part_erase; | |
463 | slave->master = master; | |
464 | slave->offset = part->offset; | |
7788ba71 AN |
465 | |
466 | if (slave->offset == MTDPART_OFS_APPEND) | |
467 | slave->offset = cur_offset; | |
468 | if (slave->offset == MTDPART_OFS_NXTBLK) { | |
469 | slave->offset = cur_offset; | |
69423d99 | 470 | if (mtd_mod_by_eb(cur_offset, master) != 0) { |
7788ba71 | 471 | /* Round up to next erasesize */ |
69423d99 | 472 | slave->offset = (mtd_div_by_eb(cur_offset, master) + 1) * master->erasesize; |
7788ba71 | 473 | printk(KERN_NOTICE "Moving partition %d: " |
69423d99 AH |
474 | "0x%012llx -> 0x%012llx\n", partno, |
475 | (unsigned long long)cur_offset, (unsigned long long)slave->offset); | |
7788ba71 AN |
476 | } |
477 | } | |
1a31368b DES |
478 | if (slave->offset == MTDPART_OFS_RETAIN) { |
479 | slave->offset = cur_offset; | |
480 | if (master->size - slave->offset >= slave->mtd.size) { | |
481 | slave->mtd.size = master->size - slave->offset | |
482 | - slave->mtd.size; | |
483 | } else { | |
484 | printk(KERN_ERR "mtd partition \"%s\" doesn't have enough space: %#llx < %#llx, disabled\n", | |
485 | part->name, master->size - slave->offset, | |
486 | slave->mtd.size); | |
487 | /* register to preserve ordering */ | |
488 | goto out_register; | |
489 | } | |
490 | } | |
7788ba71 AN |
491 | if (slave->mtd.size == MTDPART_SIZ_FULL) |
492 | slave->mtd.size = master->size - slave->offset; | |
493 | ||
69423d99 AH |
494 | printk(KERN_NOTICE "0x%012llx-0x%012llx : \"%s\"\n", (unsigned long long)slave->offset, |
495 | (unsigned long long)(slave->offset + slave->mtd.size), slave->mtd.name); | |
7788ba71 AN |
496 | |
497 | /* let's do some sanity checks */ | |
498 | if (slave->offset >= master->size) { | |
f636ffb4 | 499 | /* let's register it anyway to preserve ordering */ |
7788ba71 AN |
500 | slave->offset = 0; |
501 | slave->mtd.size = 0; | |
b33a2887 | 502 | printk(KERN_ERR"mtd: partition \"%s\" is out of reach -- disabled\n", |
7788ba71 | 503 | part->name); |
f636ffb4 | 504 | goto out_register; |
7788ba71 AN |
505 | } |
506 | if (slave->offset + slave->mtd.size > master->size) { | |
507 | slave->mtd.size = master->size - slave->offset; | |
69423d99 AH |
508 | printk(KERN_WARNING"mtd: partition \"%s\" extends beyond the end of device \"%s\" -- size truncated to %#llx\n", |
509 | part->name, master->name, (unsigned long long)slave->mtd.size); | |
7788ba71 | 510 | } |
b33a2887 | 511 | if (master->numeraseregions > 1) { |
7788ba71 | 512 | /* Deal with variable erase size stuff */ |
6910c136 | 513 | int i, max = master->numeraseregions; |
69423d99 | 514 | u64 end = slave->offset + slave->mtd.size; |
7788ba71 AN |
515 | struct mtd_erase_region_info *regions = master->eraseregions; |
516 | ||
6910c136 AN |
517 | /* Find the first erase regions which is part of this |
518 | * partition. */ | |
519 | for (i = 0; i < max && regions[i].offset <= slave->offset; i++) | |
7788ba71 | 520 | ; |
6910c136 | 521 | /* The loop searched for the region _behind_ the first one */ |
a57ca046 RK |
522 | if (i > 0) |
523 | i--; | |
7788ba71 | 524 | |
6910c136 AN |
525 | /* Pick biggest erasesize */ |
526 | for (; i < max && regions[i].offset < end; i++) { | |
7788ba71 AN |
527 | if (slave->mtd.erasesize < regions[i].erasesize) { |
528 | slave->mtd.erasesize = regions[i].erasesize; | |
529 | } | |
530 | } | |
6910c136 | 531 | BUG_ON(slave->mtd.erasesize == 0); |
7788ba71 AN |
532 | } else { |
533 | /* Single erase size */ | |
534 | slave->mtd.erasesize = master->erasesize; | |
535 | } | |
536 | ||
537 | if ((slave->mtd.flags & MTD_WRITEABLE) && | |
69423d99 | 538 | mtd_mod_by_eb(slave->offset, &slave->mtd)) { |
7788ba71 | 539 | /* Doesn't start on a boundary of major erase size */ |
b33a2887 AN |
540 | /* FIXME: Let it be writable if it is on a boundary of |
541 | * _minor_ erase size though */ | |
7788ba71 | 542 | slave->mtd.flags &= ~MTD_WRITEABLE; |
b33a2887 | 543 | printk(KERN_WARNING"mtd: partition \"%s\" doesn't start on an erase block boundary -- force read-only\n", |
7788ba71 AN |
544 | part->name); |
545 | } | |
546 | if ((slave->mtd.flags & MTD_WRITEABLE) && | |
69423d99 | 547 | mtd_mod_by_eb(slave->mtd.size, &slave->mtd)) { |
7788ba71 | 548 | slave->mtd.flags &= ~MTD_WRITEABLE; |
b33a2887 | 549 | printk(KERN_WARNING"mtd: partition \"%s\" doesn't end on an erase block -- force read-only\n", |
7788ba71 AN |
550 | part->name); |
551 | } | |
552 | ||
553 | slave->mtd.ecclayout = master->ecclayout; | |
554 | if (master->block_isbad) { | |
69423d99 | 555 | uint64_t offs = 0; |
7788ba71 | 556 | |
b33a2887 | 557 | while (offs < slave->mtd.size) { |
7788ba71 AN |
558 | if (master->block_isbad(master, |
559 | offs + slave->offset)) | |
560 | slave->mtd.ecc_stats.badblocks++; | |
561 | offs += slave->mtd.erasesize; | |
562 | } | |
563 | } | |
564 | ||
f636ffb4 | 565 | out_register: |
7788ba71 AN |
566 | return slave; |
567 | } | |
568 | ||
5daa7b21 RT |
569 | int mtd_add_partition(struct mtd_info *master, char *name, |
570 | long long offset, long long length) | |
571 | { | |
572 | struct mtd_partition part; | |
573 | struct mtd_part *p, *new; | |
574 | uint64_t start, end; | |
575 | int ret = 0; | |
576 | ||
577 | /* the direct offset is expected */ | |
578 | if (offset == MTDPART_OFS_APPEND || | |
579 | offset == MTDPART_OFS_NXTBLK) | |
580 | return -EINVAL; | |
581 | ||
582 | if (length == MTDPART_SIZ_FULL) | |
583 | length = master->size - offset; | |
584 | ||
585 | if (length <= 0) | |
586 | return -EINVAL; | |
587 | ||
588 | part.name = name; | |
589 | part.size = length; | |
590 | part.offset = offset; | |
591 | part.mask_flags = 0; | |
592 | part.ecclayout = NULL; | |
593 | ||
594 | new = allocate_partition(master, &part, -1, offset); | |
595 | if (IS_ERR(new)) | |
596 | return PTR_ERR(new); | |
597 | ||
598 | start = offset; | |
599 | end = offset + length; | |
600 | ||
601 | mutex_lock(&mtd_partitions_mutex); | |
602 | list_for_each_entry(p, &mtd_partitions, list) | |
603 | if (p->master == master) { | |
604 | if ((start >= p->offset) && | |
605 | (start < (p->offset + p->mtd.size))) | |
606 | goto err_inv; | |
607 | ||
608 | if ((end >= p->offset) && | |
609 | (end < (p->offset + p->mtd.size))) | |
610 | goto err_inv; | |
611 | } | |
612 | ||
613 | list_add(&new->list, &mtd_partitions); | |
614 | mutex_unlock(&mtd_partitions_mutex); | |
615 | ||
616 | add_mtd_device(&new->mtd); | |
617 | ||
618 | return ret; | |
619 | err_inv: | |
620 | mutex_unlock(&mtd_partitions_mutex); | |
621 | free_partition(new); | |
622 | return -EINVAL; | |
623 | } | |
624 | EXPORT_SYMBOL_GPL(mtd_add_partition); | |
625 | ||
626 | int mtd_del_partition(struct mtd_info *master, int partno) | |
627 | { | |
628 | struct mtd_part *slave, *next; | |
629 | int ret = -EINVAL; | |
630 | ||
631 | mutex_lock(&mtd_partitions_mutex); | |
632 | list_for_each_entry_safe(slave, next, &mtd_partitions, list) | |
633 | if ((slave->master == master) && | |
634 | (slave->mtd.index == partno)) { | |
635 | ret = del_mtd_device(&slave->mtd); | |
636 | if (ret < 0) | |
637 | break; | |
638 | ||
639 | list_del(&slave->list); | |
640 | free_partition(slave); | |
641 | break; | |
642 | } | |
643 | mutex_unlock(&mtd_partitions_mutex); | |
644 | ||
645 | return ret; | |
646 | } | |
647 | EXPORT_SYMBOL_GPL(mtd_del_partition); | |
648 | ||
1da177e4 LT |
649 | /* |
650 | * This function, given a master MTD object and a partition table, creates | |
651 | * and registers slave MTD objects which are bound to the master according to | |
652 | * the partition definitions. | |
1f24b5a8 DB |
653 | * |
654 | * We don't register the master, or expect the caller to have done so, | |
655 | * for reasons of data integrity. | |
1da177e4 LT |
656 | */ |
657 | ||
97894cda | 658 | int add_mtd_partitions(struct mtd_info *master, |
1da177e4 LT |
659 | const struct mtd_partition *parts, |
660 | int nbparts) | |
661 | { | |
662 | struct mtd_part *slave; | |
69423d99 | 663 | uint64_t cur_offset = 0; |
1da177e4 LT |
664 | int i; |
665 | ||
b33a2887 | 666 | printk(KERN_NOTICE "Creating %d MTD partitions on \"%s\":\n", nbparts, master->name); |
1da177e4 LT |
667 | |
668 | for (i = 0; i < nbparts; i++) { | |
5daa7b21 RT |
669 | slave = allocate_partition(master, parts + i, i, cur_offset); |
670 | if (IS_ERR(slave)) | |
671 | return PTR_ERR(slave); | |
672 | ||
673 | mutex_lock(&mtd_partitions_mutex); | |
674 | list_add(&slave->list, &mtd_partitions); | |
675 | mutex_unlock(&mtd_partitions_mutex); | |
676 | ||
677 | add_mtd_device(&slave->mtd); | |
678 | ||
1da177e4 | 679 | cur_offset = slave->offset + slave->mtd.size; |
1da177e4 LT |
680 | } |
681 | ||
682 | return 0; | |
683 | } | |
1da177e4 LT |
684 | |
685 | static DEFINE_SPINLOCK(part_parser_lock); | |
686 | static LIST_HEAD(part_parsers); | |
687 | ||
688 | static struct mtd_part_parser *get_partition_parser(const char *name) | |
689 | { | |
71a928c0 | 690 | struct mtd_part_parser *p, *ret = NULL; |
1da177e4 | 691 | |
71a928c0 | 692 | spin_lock(&part_parser_lock); |
1da177e4 | 693 | |
71a928c0 | 694 | list_for_each_entry(p, &part_parsers, list) |
1da177e4 LT |
695 | if (!strcmp(p->name, name) && try_module_get(p->owner)) { |
696 | ret = p; | |
697 | break; | |
698 | } | |
71a928c0 | 699 | |
1da177e4 LT |
700 | spin_unlock(&part_parser_lock); |
701 | ||
702 | return ret; | |
703 | } | |
704 | ||
953b3bd1 DES |
705 | #define put_partition_parser(p) do { module_put((p)->owner); } while (0) |
706 | ||
1da177e4 LT |
707 | int register_mtd_parser(struct mtd_part_parser *p) |
708 | { | |
709 | spin_lock(&part_parser_lock); | |
710 | list_add(&p->list, &part_parsers); | |
711 | spin_unlock(&part_parser_lock); | |
712 | ||
713 | return 0; | |
714 | } | |
b33a2887 | 715 | EXPORT_SYMBOL_GPL(register_mtd_parser); |
1da177e4 LT |
716 | |
717 | int deregister_mtd_parser(struct mtd_part_parser *p) | |
718 | { | |
719 | spin_lock(&part_parser_lock); | |
720 | list_del(&p->list); | |
721 | spin_unlock(&part_parser_lock); | |
722 | return 0; | |
723 | } | |
b33a2887 | 724 | EXPORT_SYMBOL_GPL(deregister_mtd_parser); |
1da177e4 | 725 | |
ad274cec AB |
726 | /* |
727 | * Do not forget to update 'parse_mtd_partitions()' kerneldoc comment if you | |
728 | * are changing this array! | |
729 | */ | |
d26c87d6 DES |
730 | static const char *default_mtd_part_types[] = { |
731 | "cmdlinepart", | |
732 | "ofpart", | |
733 | NULL | |
734 | }; | |
5c4eefbd | 735 | |
ad274cec AB |
736 | /** |
737 | * parse_mtd_partitions - parse MTD partitions | |
738 | * @master: the master partition (describes whole MTD device) | |
739 | * @types: names of partition parsers to try or %NULL | |
740 | * @pparts: array of partitions found is returned here | |
c7975330 | 741 | * @data: MTD partition parser-specific data |
ad274cec AB |
742 | * |
743 | * This function tries to find partition on MTD device @master. It uses MTD | |
744 | * partition parsers, specified in @types. However, if @types is %NULL, then | |
745 | * the default list of parsers is used. The default list contains only the | |
d26c87d6 | 746 | * "cmdlinepart" and "ofpart" parsers ATM. |
ad274cec AB |
747 | * |
748 | * This function may return: | |
749 | * o a negative error code in case of failure | |
750 | * o zero if no partitions were found | |
751 | * o a positive number of found partitions, in which case on exit @pparts will | |
752 | * point to an array containing this number of &struct mtd_info objects. | |
753 | */ | |
97894cda | 754 | int parse_mtd_partitions(struct mtd_info *master, const char **types, |
c7975330 DES |
755 | struct mtd_partition **pparts, |
756 | struct mtd_part_parser_data *data) | |
1da177e4 LT |
757 | { |
758 | struct mtd_part_parser *parser; | |
759 | int ret = 0; | |
97894cda | 760 | |
5c4eefbd DES |
761 | if (!types) |
762 | types = default_mtd_part_types; | |
763 | ||
1da177e4 LT |
764 | for ( ; ret <= 0 && *types; types++) { |
765 | parser = get_partition_parser(*types); | |
1da177e4 LT |
766 | if (!parser && !request_module("%s", *types)) |
767 | parser = get_partition_parser(*types); | |
7c802fbd | 768 | if (!parser) |
1da177e4 | 769 | continue; |
c7975330 | 770 | ret = (*parser->parse_fn)(master, pparts, data); |
1da177e4 | 771 | if (ret > 0) { |
97894cda | 772 | printk(KERN_NOTICE "%d %s partitions found on MTD device %s\n", |
1da177e4 LT |
773 | ret, parser->name, master->name); |
774 | } | |
775 | put_partition_parser(parser); | |
776 | } | |
777 | return ret; | |
778 | } | |
5daa7b21 | 779 | |
a7e93dcd | 780 | int mtd_is_partition(struct mtd_info *mtd) |
5daa7b21 RT |
781 | { |
782 | struct mtd_part *part; | |
a7e93dcd | 783 | int ispart = 0; |
5daa7b21 RT |
784 | |
785 | mutex_lock(&mtd_partitions_mutex); | |
786 | list_for_each_entry(part, &mtd_partitions, list) | |
787 | if (&part->mtd == mtd) { | |
a7e93dcd | 788 | ispart = 1; |
5daa7b21 RT |
789 | break; |
790 | } | |
791 | mutex_unlock(&mtd_partitions_mutex); | |
792 | ||
a7e93dcd | 793 | return ispart; |
5daa7b21 | 794 | } |
a7e93dcd | 795 | EXPORT_SYMBOL_GPL(mtd_is_partition); |