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 | ||
141 | res = part->master->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); | |
b33a2887 | 170 | return part->master->read_fact_prot_reg(part->master, from, |
1da177e4 LT |
171 | len, retlen, buf); |
172 | } | |
173 | ||
b33a2887 AN |
174 | static int part_get_fact_prot_info(struct mtd_info *mtd, struct otp_info *buf, |
175 | size_t len) | |
f77814dd NP |
176 | { |
177 | struct mtd_part *part = PART(mtd); | |
b33a2887 | 178 | return part->master->get_fact_prot_info(part->master, buf, len); |
f77814dd NP |
179 | } |
180 | ||
b33a2887 AN |
181 | static int part_write(struct mtd_info *mtd, loff_t to, size_t len, |
182 | size_t *retlen, const u_char *buf) | |
1da177e4 LT |
183 | { |
184 | struct mtd_part *part = PART(mtd); | |
185 | if (!(mtd->flags & MTD_WRITEABLE)) | |
186 | return -EROFS; | |
187 | if (to >= mtd->size) | |
188 | len = 0; | |
189 | else if (to + len > mtd->size) | |
190 | len = mtd->size - to; | |
eda95cbf | 191 | return mtd_write(part->master, to + part->offset, len, retlen, buf); |
1da177e4 LT |
192 | } |
193 | ||
b33a2887 AN |
194 | static int part_panic_write(struct mtd_info *mtd, loff_t to, size_t len, |
195 | size_t *retlen, const u_char *buf) | |
388bbb09 RP |
196 | { |
197 | struct mtd_part *part = PART(mtd); | |
198 | if (!(mtd->flags & MTD_WRITEABLE)) | |
199 | return -EROFS; | |
200 | if (to >= mtd->size) | |
201 | len = 0; | |
202 | else if (to + len > mtd->size) | |
203 | len = mtd->size - to; | |
b33a2887 | 204 | return part->master->panic_write(part->master, to + part->offset, |
388bbb09 RP |
205 | len, retlen, buf); |
206 | } | |
207 | ||
8593fbc6 | 208 | static int part_write_oob(struct mtd_info *mtd, loff_t to, |
b33a2887 | 209 | struct mtd_oob_ops *ops) |
1da177e4 LT |
210 | { |
211 | struct mtd_part *part = PART(mtd); | |
8593fbc6 | 212 | |
1da177e4 LT |
213 | if (!(mtd->flags & MTD_WRITEABLE)) |
214 | return -EROFS; | |
8593fbc6 | 215 | |
1da177e4 | 216 | if (to >= mtd->size) |
8593fbc6 | 217 | return -EINVAL; |
7014568b | 218 | if (ops->datbuf && to + ops->len > mtd->size) |
8593fbc6 TG |
219 | return -EINVAL; |
220 | return part->master->write_oob(part->master, to + part->offset, ops); | |
1da177e4 LT |
221 | } |
222 | ||
b33a2887 AN |
223 | static int part_write_user_prot_reg(struct mtd_info *mtd, loff_t from, |
224 | size_t len, size_t *retlen, u_char *buf) | |
1da177e4 LT |
225 | { |
226 | struct mtd_part *part = PART(mtd); | |
b33a2887 | 227 | return part->master->write_user_prot_reg(part->master, from, |
1da177e4 LT |
228 | len, retlen, buf); |
229 | } | |
230 | ||
b33a2887 AN |
231 | static int part_lock_user_prot_reg(struct mtd_info *mtd, loff_t from, |
232 | size_t len) | |
f77814dd NP |
233 | { |
234 | struct mtd_part *part = PART(mtd); | |
b33a2887 | 235 | return part->master->lock_user_prot_reg(part->master, from, len); |
f77814dd NP |
236 | } |
237 | ||
b33a2887 AN |
238 | static int part_writev(struct mtd_info *mtd, const struct kvec *vecs, |
239 | unsigned long count, loff_t to, size_t *retlen) | |
1da177e4 LT |
240 | { |
241 | struct mtd_part *part = PART(mtd); | |
242 | if (!(mtd->flags & MTD_WRITEABLE)) | |
243 | return -EROFS; | |
b33a2887 | 244 | return part->master->writev(part->master, vecs, count, |
1da177e4 | 245 | to + part->offset, retlen); |
1da177e4 LT |
246 | } |
247 | ||
b33a2887 | 248 | static int part_erase(struct mtd_info *mtd, struct erase_info *instr) |
1da177e4 LT |
249 | { |
250 | struct mtd_part *part = PART(mtd); | |
251 | int ret; | |
252 | if (!(mtd->flags & MTD_WRITEABLE)) | |
253 | return -EROFS; | |
254 | if (instr->addr >= mtd->size) | |
255 | return -EINVAL; | |
256 | instr->addr += part->offset; | |
7e1f0dc0 | 257 | ret = mtd_erase(part->master, instr); |
74641d75 | 258 | if (ret) { |
bb0eb217 | 259 | if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN) |
74641d75 AH |
260 | instr->fail_addr -= part->offset; |
261 | instr->addr -= part->offset; | |
262 | } | |
1da177e4 LT |
263 | return ret; |
264 | } | |
265 | ||
266 | void mtd_erase_callback(struct erase_info *instr) | |
267 | { | |
268 | if (instr->mtd->erase == part_erase) { | |
269 | struct mtd_part *part = PART(instr->mtd); | |
270 | ||
bb0eb217 | 271 | if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN) |
1da177e4 LT |
272 | instr->fail_addr -= part->offset; |
273 | instr->addr -= part->offset; | |
274 | } | |
275 | if (instr->callback) | |
276 | instr->callback(instr); | |
277 | } | |
278 | EXPORT_SYMBOL_GPL(mtd_erase_callback); | |
279 | ||
69423d99 | 280 | static int part_lock(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
1da177e4 LT |
281 | { |
282 | struct mtd_part *part = PART(mtd); | |
97894cda | 283 | if ((len + ofs) > mtd->size) |
1da177e4 LT |
284 | return -EINVAL; |
285 | return part->master->lock(part->master, ofs + part->offset, len); | |
286 | } | |
287 | ||
69423d99 | 288 | static int part_unlock(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
1da177e4 LT |
289 | { |
290 | struct mtd_part *part = PART(mtd); | |
97894cda | 291 | if ((len + ofs) > mtd->size) |
1da177e4 LT |
292 | return -EINVAL; |
293 | return part->master->unlock(part->master, ofs + part->offset, len); | |
294 | } | |
295 | ||
9938424f RC |
296 | static int part_is_locked(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
297 | { | |
298 | struct mtd_part *part = PART(mtd); | |
299 | if ((len + ofs) > mtd->size) | |
300 | return -EINVAL; | |
301 | return part->master->is_locked(part->master, ofs + part->offset, len); | |
302 | } | |
303 | ||
1da177e4 LT |
304 | static void part_sync(struct mtd_info *mtd) |
305 | { | |
306 | struct mtd_part *part = PART(mtd); | |
307 | part->master->sync(part->master); | |
308 | } | |
309 | ||
310 | static int part_suspend(struct mtd_info *mtd) | |
311 | { | |
312 | struct mtd_part *part = PART(mtd); | |
313 | return part->master->suspend(part->master); | |
314 | } | |
315 | ||
316 | static void part_resume(struct mtd_info *mtd) | |
317 | { | |
318 | struct mtd_part *part = PART(mtd); | |
319 | part->master->resume(part->master); | |
320 | } | |
321 | ||
b33a2887 | 322 | static int part_block_isbad(struct mtd_info *mtd, loff_t ofs) |
1da177e4 LT |
323 | { |
324 | struct mtd_part *part = PART(mtd); | |
325 | if (ofs >= mtd->size) | |
326 | return -EINVAL; | |
327 | ofs += part->offset; | |
328 | return part->master->block_isbad(part->master, ofs); | |
329 | } | |
330 | ||
b33a2887 | 331 | static int part_block_markbad(struct mtd_info *mtd, loff_t ofs) |
1da177e4 LT |
332 | { |
333 | struct mtd_part *part = PART(mtd); | |
f1a28c02 TG |
334 | int res; |
335 | ||
1da177e4 LT |
336 | if (!(mtd->flags & MTD_WRITEABLE)) |
337 | return -EROFS; | |
338 | if (ofs >= mtd->size) | |
339 | return -EINVAL; | |
340 | ofs += part->offset; | |
f1a28c02 TG |
341 | res = part->master->block_markbad(part->master, ofs); |
342 | if (!res) | |
343 | mtd->ecc_stats.badblocks++; | |
344 | return res; | |
1da177e4 LT |
345 | } |
346 | ||
5daa7b21 RT |
347 | static inline void free_partition(struct mtd_part *p) |
348 | { | |
349 | kfree(p->mtd.name); | |
350 | kfree(p); | |
351 | } | |
352 | ||
97894cda TG |
353 | /* |
354 | * This function unregisters and destroy all slave MTD objects which are | |
1da177e4 LT |
355 | * attached to the given master MTD object. |
356 | */ | |
357 | ||
358 | int del_mtd_partitions(struct mtd_info *master) | |
359 | { | |
71a928c0 | 360 | struct mtd_part *slave, *next; |
5daa7b21 | 361 | int ret, err = 0; |
1da177e4 | 362 | |
5daa7b21 | 363 | mutex_lock(&mtd_partitions_mutex); |
71a928c0 | 364 | list_for_each_entry_safe(slave, next, &mtd_partitions, list) |
1da177e4 | 365 | if (slave->master == master) { |
5daa7b21 RT |
366 | ret = del_mtd_device(&slave->mtd); |
367 | if (ret < 0) { | |
368 | err = ret; | |
369 | continue; | |
370 | } | |
71a928c0 | 371 | list_del(&slave->list); |
5daa7b21 | 372 | free_partition(slave); |
1da177e4 | 373 | } |
5daa7b21 | 374 | mutex_unlock(&mtd_partitions_mutex); |
1da177e4 | 375 | |
5daa7b21 | 376 | return err; |
1da177e4 LT |
377 | } |
378 | ||
5daa7b21 RT |
379 | static struct mtd_part *allocate_partition(struct mtd_info *master, |
380 | const struct mtd_partition *part, int partno, | |
381 | uint64_t cur_offset) | |
7788ba71 AN |
382 | { |
383 | struct mtd_part *slave; | |
5daa7b21 | 384 | char *name; |
7788ba71 AN |
385 | |
386 | /* allocate the partition structure */ | |
b33a2887 | 387 | slave = kzalloc(sizeof(*slave), GFP_KERNEL); |
5daa7b21 RT |
388 | name = kstrdup(part->name, GFP_KERNEL); |
389 | if (!name || !slave) { | |
b33a2887 | 390 | printk(KERN_ERR"memory allocation error while creating partitions for \"%s\"\n", |
5daa7b21 RT |
391 | master->name); |
392 | kfree(name); | |
393 | kfree(slave); | |
394 | return ERR_PTR(-ENOMEM); | |
7788ba71 | 395 | } |
7788ba71 AN |
396 | |
397 | /* set up the MTD object for this partition */ | |
398 | slave->mtd.type = master->type; | |
399 | slave->mtd.flags = master->flags & ~part->mask_flags; | |
400 | slave->mtd.size = part->size; | |
401 | slave->mtd.writesize = master->writesize; | |
7fa33ac0 | 402 | slave->mtd.writebufsize = master->writebufsize; |
7788ba71 AN |
403 | slave->mtd.oobsize = master->oobsize; |
404 | slave->mtd.oobavail = master->oobavail; | |
405 | slave->mtd.subpage_sft = master->subpage_sft; | |
406 | ||
5daa7b21 | 407 | slave->mtd.name = name; |
7788ba71 | 408 | slave->mtd.owner = master->owner; |
402d3265 | 409 | slave->mtd.backing_dev_info = master->backing_dev_info; |
7788ba71 | 410 | |
1f24b5a8 DB |
411 | /* NOTE: we don't arrange MTDs as a tree; it'd be error-prone |
412 | * to have the same data be in two different partitions. | |
413 | */ | |
414 | slave->mtd.dev.parent = master->dev.parent; | |
415 | ||
7788ba71 AN |
416 | slave->mtd.read = part_read; |
417 | slave->mtd.write = part_write; | |
418 | ||
419 | if (master->panic_write) | |
420 | slave->mtd.panic_write = part_panic_write; | |
421 | ||
b33a2887 | 422 | if (master->point && master->unpoint) { |
7788ba71 AN |
423 | slave->mtd.point = part_point; |
424 | slave->mtd.unpoint = part_unpoint; | |
425 | } | |
426 | ||
402d3265 DH |
427 | if (master->get_unmapped_area) |
428 | slave->mtd.get_unmapped_area = part_get_unmapped_area; | |
7788ba71 AN |
429 | if (master->read_oob) |
430 | slave->mtd.read_oob = part_read_oob; | |
431 | if (master->write_oob) | |
432 | slave->mtd.write_oob = part_write_oob; | |
b33a2887 | 433 | if (master->read_user_prot_reg) |
7788ba71 | 434 | slave->mtd.read_user_prot_reg = part_read_user_prot_reg; |
b33a2887 | 435 | if (master->read_fact_prot_reg) |
7788ba71 | 436 | slave->mtd.read_fact_prot_reg = part_read_fact_prot_reg; |
b33a2887 | 437 | if (master->write_user_prot_reg) |
7788ba71 | 438 | slave->mtd.write_user_prot_reg = part_write_user_prot_reg; |
b33a2887 | 439 | if (master->lock_user_prot_reg) |
7788ba71 | 440 | slave->mtd.lock_user_prot_reg = part_lock_user_prot_reg; |
b33a2887 | 441 | if (master->get_user_prot_info) |
7788ba71 | 442 | slave->mtd.get_user_prot_info = part_get_user_prot_info; |
b33a2887 | 443 | if (master->get_fact_prot_info) |
7788ba71 AN |
444 | slave->mtd.get_fact_prot_info = part_get_fact_prot_info; |
445 | if (master->sync) | |
446 | slave->mtd.sync = part_sync; | |
4704a784 | 447 | if (!partno && !master->dev.class && master->suspend && master->resume) { |
7788ba71 AN |
448 | slave->mtd.suspend = part_suspend; |
449 | slave->mtd.resume = part_resume; | |
450 | } | |
451 | if (master->writev) | |
452 | slave->mtd.writev = part_writev; | |
453 | if (master->lock) | |
454 | slave->mtd.lock = part_lock; | |
455 | if (master->unlock) | |
456 | slave->mtd.unlock = part_unlock; | |
9938424f RC |
457 | if (master->is_locked) |
458 | slave->mtd.is_locked = part_is_locked; | |
7788ba71 AN |
459 | if (master->block_isbad) |
460 | slave->mtd.block_isbad = part_block_isbad; | |
461 | if (master->block_markbad) | |
462 | slave->mtd.block_markbad = part_block_markbad; | |
463 | slave->mtd.erase = part_erase; | |
464 | slave->master = master; | |
465 | slave->offset = part->offset; | |
7788ba71 AN |
466 | |
467 | if (slave->offset == MTDPART_OFS_APPEND) | |
468 | slave->offset = cur_offset; | |
469 | if (slave->offset == MTDPART_OFS_NXTBLK) { | |
470 | slave->offset = cur_offset; | |
69423d99 | 471 | if (mtd_mod_by_eb(cur_offset, master) != 0) { |
7788ba71 | 472 | /* Round up to next erasesize */ |
69423d99 | 473 | slave->offset = (mtd_div_by_eb(cur_offset, master) + 1) * master->erasesize; |
7788ba71 | 474 | printk(KERN_NOTICE "Moving partition %d: " |
69423d99 AH |
475 | "0x%012llx -> 0x%012llx\n", partno, |
476 | (unsigned long long)cur_offset, (unsigned long long)slave->offset); | |
7788ba71 AN |
477 | } |
478 | } | |
1a31368b DES |
479 | if (slave->offset == MTDPART_OFS_RETAIN) { |
480 | slave->offset = cur_offset; | |
481 | if (master->size - slave->offset >= slave->mtd.size) { | |
482 | slave->mtd.size = master->size - slave->offset | |
483 | - slave->mtd.size; | |
484 | } else { | |
485 | printk(KERN_ERR "mtd partition \"%s\" doesn't have enough space: %#llx < %#llx, disabled\n", | |
486 | part->name, master->size - slave->offset, | |
487 | slave->mtd.size); | |
488 | /* register to preserve ordering */ | |
489 | goto out_register; | |
490 | } | |
491 | } | |
7788ba71 AN |
492 | if (slave->mtd.size == MTDPART_SIZ_FULL) |
493 | slave->mtd.size = master->size - slave->offset; | |
494 | ||
69423d99 AH |
495 | printk(KERN_NOTICE "0x%012llx-0x%012llx : \"%s\"\n", (unsigned long long)slave->offset, |
496 | (unsigned long long)(slave->offset + slave->mtd.size), slave->mtd.name); | |
7788ba71 AN |
497 | |
498 | /* let's do some sanity checks */ | |
499 | if (slave->offset >= master->size) { | |
f636ffb4 | 500 | /* let's register it anyway to preserve ordering */ |
7788ba71 AN |
501 | slave->offset = 0; |
502 | slave->mtd.size = 0; | |
b33a2887 | 503 | printk(KERN_ERR"mtd: partition \"%s\" is out of reach -- disabled\n", |
7788ba71 | 504 | part->name); |
f636ffb4 | 505 | goto out_register; |
7788ba71 AN |
506 | } |
507 | if (slave->offset + slave->mtd.size > master->size) { | |
508 | slave->mtd.size = master->size - slave->offset; | |
69423d99 AH |
509 | printk(KERN_WARNING"mtd: partition \"%s\" extends beyond the end of device \"%s\" -- size truncated to %#llx\n", |
510 | part->name, master->name, (unsigned long long)slave->mtd.size); | |
7788ba71 | 511 | } |
b33a2887 | 512 | if (master->numeraseregions > 1) { |
7788ba71 | 513 | /* Deal with variable erase size stuff */ |
6910c136 | 514 | int i, max = master->numeraseregions; |
69423d99 | 515 | u64 end = slave->offset + slave->mtd.size; |
7788ba71 AN |
516 | struct mtd_erase_region_info *regions = master->eraseregions; |
517 | ||
6910c136 AN |
518 | /* Find the first erase regions which is part of this |
519 | * partition. */ | |
520 | for (i = 0; i < max && regions[i].offset <= slave->offset; i++) | |
7788ba71 | 521 | ; |
6910c136 | 522 | /* The loop searched for the region _behind_ the first one */ |
a57ca046 RK |
523 | if (i > 0) |
524 | i--; | |
7788ba71 | 525 | |
6910c136 AN |
526 | /* Pick biggest erasesize */ |
527 | for (; i < max && regions[i].offset < end; i++) { | |
7788ba71 AN |
528 | if (slave->mtd.erasesize < regions[i].erasesize) { |
529 | slave->mtd.erasesize = regions[i].erasesize; | |
530 | } | |
531 | } | |
6910c136 | 532 | BUG_ON(slave->mtd.erasesize == 0); |
7788ba71 AN |
533 | } else { |
534 | /* Single erase size */ | |
535 | slave->mtd.erasesize = master->erasesize; | |
536 | } | |
537 | ||
538 | if ((slave->mtd.flags & MTD_WRITEABLE) && | |
69423d99 | 539 | mtd_mod_by_eb(slave->offset, &slave->mtd)) { |
7788ba71 | 540 | /* Doesn't start on a boundary of major erase size */ |
b33a2887 AN |
541 | /* FIXME: Let it be writable if it is on a boundary of |
542 | * _minor_ erase size though */ | |
7788ba71 | 543 | slave->mtd.flags &= ~MTD_WRITEABLE; |
b33a2887 | 544 | printk(KERN_WARNING"mtd: partition \"%s\" doesn't start on an erase block boundary -- force read-only\n", |
7788ba71 AN |
545 | part->name); |
546 | } | |
547 | if ((slave->mtd.flags & MTD_WRITEABLE) && | |
69423d99 | 548 | mtd_mod_by_eb(slave->mtd.size, &slave->mtd)) { |
7788ba71 | 549 | slave->mtd.flags &= ~MTD_WRITEABLE; |
b33a2887 | 550 | printk(KERN_WARNING"mtd: partition \"%s\" doesn't end on an erase block -- force read-only\n", |
7788ba71 AN |
551 | part->name); |
552 | } | |
553 | ||
554 | slave->mtd.ecclayout = master->ecclayout; | |
555 | if (master->block_isbad) { | |
69423d99 | 556 | uint64_t offs = 0; |
7788ba71 | 557 | |
b33a2887 | 558 | while (offs < slave->mtd.size) { |
7788ba71 AN |
559 | if (master->block_isbad(master, |
560 | offs + slave->offset)) | |
561 | slave->mtd.ecc_stats.badblocks++; | |
562 | offs += slave->mtd.erasesize; | |
563 | } | |
564 | } | |
565 | ||
f636ffb4 | 566 | out_register: |
7788ba71 AN |
567 | return slave; |
568 | } | |
569 | ||
5daa7b21 RT |
570 | int mtd_add_partition(struct mtd_info *master, char *name, |
571 | long long offset, long long length) | |
572 | { | |
573 | struct mtd_partition part; | |
574 | struct mtd_part *p, *new; | |
575 | uint64_t start, end; | |
576 | int ret = 0; | |
577 | ||
578 | /* the direct offset is expected */ | |
579 | if (offset == MTDPART_OFS_APPEND || | |
580 | offset == MTDPART_OFS_NXTBLK) | |
581 | return -EINVAL; | |
582 | ||
583 | if (length == MTDPART_SIZ_FULL) | |
584 | length = master->size - offset; | |
585 | ||
586 | if (length <= 0) | |
587 | return -EINVAL; | |
588 | ||
589 | part.name = name; | |
590 | part.size = length; | |
591 | part.offset = offset; | |
592 | part.mask_flags = 0; | |
593 | part.ecclayout = NULL; | |
594 | ||
595 | new = allocate_partition(master, &part, -1, offset); | |
596 | if (IS_ERR(new)) | |
597 | return PTR_ERR(new); | |
598 | ||
599 | start = offset; | |
600 | end = offset + length; | |
601 | ||
602 | mutex_lock(&mtd_partitions_mutex); | |
603 | list_for_each_entry(p, &mtd_partitions, list) | |
604 | if (p->master == master) { | |
605 | if ((start >= p->offset) && | |
606 | (start < (p->offset + p->mtd.size))) | |
607 | goto err_inv; | |
608 | ||
609 | if ((end >= p->offset) && | |
610 | (end < (p->offset + p->mtd.size))) | |
611 | goto err_inv; | |
612 | } | |
613 | ||
614 | list_add(&new->list, &mtd_partitions); | |
615 | mutex_unlock(&mtd_partitions_mutex); | |
616 | ||
617 | add_mtd_device(&new->mtd); | |
618 | ||
619 | return ret; | |
620 | err_inv: | |
621 | mutex_unlock(&mtd_partitions_mutex); | |
622 | free_partition(new); | |
623 | return -EINVAL; | |
624 | } | |
625 | EXPORT_SYMBOL_GPL(mtd_add_partition); | |
626 | ||
627 | int mtd_del_partition(struct mtd_info *master, int partno) | |
628 | { | |
629 | struct mtd_part *slave, *next; | |
630 | int ret = -EINVAL; | |
631 | ||
632 | mutex_lock(&mtd_partitions_mutex); | |
633 | list_for_each_entry_safe(slave, next, &mtd_partitions, list) | |
634 | if ((slave->master == master) && | |
635 | (slave->mtd.index == partno)) { | |
636 | ret = del_mtd_device(&slave->mtd); | |
637 | if (ret < 0) | |
638 | break; | |
639 | ||
640 | list_del(&slave->list); | |
641 | free_partition(slave); | |
642 | break; | |
643 | } | |
644 | mutex_unlock(&mtd_partitions_mutex); | |
645 | ||
646 | return ret; | |
647 | } | |
648 | EXPORT_SYMBOL_GPL(mtd_del_partition); | |
649 | ||
1da177e4 LT |
650 | /* |
651 | * This function, given a master MTD object and a partition table, creates | |
652 | * and registers slave MTD objects which are bound to the master according to | |
653 | * the partition definitions. | |
1f24b5a8 DB |
654 | * |
655 | * We don't register the master, or expect the caller to have done so, | |
656 | * for reasons of data integrity. | |
1da177e4 LT |
657 | */ |
658 | ||
97894cda | 659 | int add_mtd_partitions(struct mtd_info *master, |
1da177e4 LT |
660 | const struct mtd_partition *parts, |
661 | int nbparts) | |
662 | { | |
663 | struct mtd_part *slave; | |
69423d99 | 664 | uint64_t cur_offset = 0; |
1da177e4 LT |
665 | int i; |
666 | ||
b33a2887 | 667 | printk(KERN_NOTICE "Creating %d MTD partitions on \"%s\":\n", nbparts, master->name); |
1da177e4 LT |
668 | |
669 | for (i = 0; i < nbparts; i++) { | |
5daa7b21 RT |
670 | slave = allocate_partition(master, parts + i, i, cur_offset); |
671 | if (IS_ERR(slave)) | |
672 | return PTR_ERR(slave); | |
673 | ||
674 | mutex_lock(&mtd_partitions_mutex); | |
675 | list_add(&slave->list, &mtd_partitions); | |
676 | mutex_unlock(&mtd_partitions_mutex); | |
677 | ||
678 | add_mtd_device(&slave->mtd); | |
679 | ||
1da177e4 | 680 | cur_offset = slave->offset + slave->mtd.size; |
1da177e4 LT |
681 | } |
682 | ||
683 | return 0; | |
684 | } | |
1da177e4 LT |
685 | |
686 | static DEFINE_SPINLOCK(part_parser_lock); | |
687 | static LIST_HEAD(part_parsers); | |
688 | ||
689 | static struct mtd_part_parser *get_partition_parser(const char *name) | |
690 | { | |
71a928c0 | 691 | struct mtd_part_parser *p, *ret = NULL; |
1da177e4 | 692 | |
71a928c0 | 693 | spin_lock(&part_parser_lock); |
1da177e4 | 694 | |
71a928c0 | 695 | list_for_each_entry(p, &part_parsers, list) |
1da177e4 LT |
696 | if (!strcmp(p->name, name) && try_module_get(p->owner)) { |
697 | ret = p; | |
698 | break; | |
699 | } | |
71a928c0 | 700 | |
1da177e4 LT |
701 | spin_unlock(&part_parser_lock); |
702 | ||
703 | return ret; | |
704 | } | |
705 | ||
953b3bd1 DES |
706 | #define put_partition_parser(p) do { module_put((p)->owner); } while (0) |
707 | ||
1da177e4 LT |
708 | int register_mtd_parser(struct mtd_part_parser *p) |
709 | { | |
710 | spin_lock(&part_parser_lock); | |
711 | list_add(&p->list, &part_parsers); | |
712 | spin_unlock(&part_parser_lock); | |
713 | ||
714 | return 0; | |
715 | } | |
b33a2887 | 716 | EXPORT_SYMBOL_GPL(register_mtd_parser); |
1da177e4 LT |
717 | |
718 | int deregister_mtd_parser(struct mtd_part_parser *p) | |
719 | { | |
720 | spin_lock(&part_parser_lock); | |
721 | list_del(&p->list); | |
722 | spin_unlock(&part_parser_lock); | |
723 | return 0; | |
724 | } | |
b33a2887 | 725 | EXPORT_SYMBOL_GPL(deregister_mtd_parser); |
1da177e4 | 726 | |
ad274cec AB |
727 | /* |
728 | * Do not forget to update 'parse_mtd_partitions()' kerneldoc comment if you | |
729 | * are changing this array! | |
730 | */ | |
d26c87d6 DES |
731 | static const char *default_mtd_part_types[] = { |
732 | "cmdlinepart", | |
733 | "ofpart", | |
734 | NULL | |
735 | }; | |
5c4eefbd | 736 | |
ad274cec AB |
737 | /** |
738 | * parse_mtd_partitions - parse MTD partitions | |
739 | * @master: the master partition (describes whole MTD device) | |
740 | * @types: names of partition parsers to try or %NULL | |
741 | * @pparts: array of partitions found is returned here | |
c7975330 | 742 | * @data: MTD partition parser-specific data |
ad274cec AB |
743 | * |
744 | * This function tries to find partition on MTD device @master. It uses MTD | |
745 | * partition parsers, specified in @types. However, if @types is %NULL, then | |
746 | * the default list of parsers is used. The default list contains only the | |
d26c87d6 | 747 | * "cmdlinepart" and "ofpart" parsers ATM. |
ad274cec AB |
748 | * |
749 | * This function may return: | |
750 | * o a negative error code in case of failure | |
751 | * o zero if no partitions were found | |
752 | * o a positive number of found partitions, in which case on exit @pparts will | |
753 | * point to an array containing this number of &struct mtd_info objects. | |
754 | */ | |
97894cda | 755 | int parse_mtd_partitions(struct mtd_info *master, const char **types, |
c7975330 DES |
756 | struct mtd_partition **pparts, |
757 | struct mtd_part_parser_data *data) | |
1da177e4 LT |
758 | { |
759 | struct mtd_part_parser *parser; | |
760 | int ret = 0; | |
97894cda | 761 | |
5c4eefbd DES |
762 | if (!types) |
763 | types = default_mtd_part_types; | |
764 | ||
1da177e4 LT |
765 | for ( ; ret <= 0 && *types; types++) { |
766 | parser = get_partition_parser(*types); | |
1da177e4 LT |
767 | if (!parser && !request_module("%s", *types)) |
768 | parser = get_partition_parser(*types); | |
7c802fbd | 769 | if (!parser) |
1da177e4 | 770 | continue; |
c7975330 | 771 | ret = (*parser->parse_fn)(master, pparts, data); |
1da177e4 | 772 | if (ret > 0) { |
97894cda | 773 | printk(KERN_NOTICE "%d %s partitions found on MTD device %s\n", |
1da177e4 LT |
774 | ret, parser->name, master->name); |
775 | } | |
776 | put_partition_parser(parser); | |
777 | } | |
778 | return ret; | |
779 | } | |
5daa7b21 | 780 | |
a7e93dcd | 781 | int mtd_is_partition(struct mtd_info *mtd) |
5daa7b21 RT |
782 | { |
783 | struct mtd_part *part; | |
a7e93dcd | 784 | int ispart = 0; |
5daa7b21 RT |
785 | |
786 | mutex_lock(&mtd_partitions_mutex); | |
787 | list_for_each_entry(part, &mtd_partitions, list) | |
788 | if (&part->mtd == mtd) { | |
a7e93dcd | 789 | ispart = 1; |
5daa7b21 RT |
790 | break; |
791 | } | |
792 | mutex_unlock(&mtd_partitions_mutex); | |
793 | ||
a7e93dcd | 794 | return ispart; |
5daa7b21 | 795 | } |
a7e93dcd | 796 | EXPORT_SYMBOL_GPL(mtd_is_partition); |