]>
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 | 39 | |
0a9d72b6 RM |
40 | /** |
41 | * struct mtd_part - our partition node structure | |
42 | * | |
43 | * @mtd: struct holding partition details | |
44 | * @parent: parent mtd - flash device or another partition | |
45 | * @offset: partition offset relative to the *flash device* | |
46 | */ | |
1da177e4 LT |
47 | struct mtd_part { |
48 | struct mtd_info mtd; | |
0a9d72b6 | 49 | struct mtd_info *parent; |
69423d99 | 50 | uint64_t offset; |
1da177e4 | 51 | struct list_head list; |
1da177e4 LT |
52 | }; |
53 | ||
54 | /* | |
55 | * Given a pointer to the MTD object in the mtd_part structure, we can retrieve | |
2524534d | 56 | * the pointer to that structure. |
1da177e4 | 57 | */ |
2524534d BN |
58 | static inline struct mtd_part *mtd_to_part(const struct mtd_info *mtd) |
59 | { | |
60 | return container_of(mtd, struct mtd_part, mtd); | |
61 | } | |
1da177e4 | 62 | |
97894cda TG |
63 | |
64 | /* | |
1da177e4 LT |
65 | * MTD methods which simply translate the effective address and pass through |
66 | * to the _real_ device. | |
67 | */ | |
68 | ||
b33a2887 AN |
69 | static int part_read(struct mtd_info *mtd, loff_t from, size_t len, |
70 | size_t *retlen, u_char *buf) | |
1da177e4 | 71 | { |
2524534d | 72 | struct mtd_part *part = mtd_to_part(mtd); |
d8877f19 | 73 | struct mtd_ecc_stats stats; |
f1a28c02 TG |
74 | int res; |
75 | ||
0a9d72b6 RM |
76 | stats = part->parent->ecc_stats; |
77 | res = part->parent->_read(part->parent, from + part->offset, len, | |
994c8409 | 78 | retlen, buf); |
edbc4540 MD |
79 | if (unlikely(mtd_is_eccerr(res))) |
80 | mtd->ecc_stats.failed += | |
0a9d72b6 | 81 | part->parent->ecc_stats.failed - stats.failed; |
edbc4540 MD |
82 | else |
83 | mtd->ecc_stats.corrected += | |
0a9d72b6 | 84 | part->parent->ecc_stats.corrected - stats.corrected; |
f1a28c02 | 85 | return res; |
1da177e4 LT |
86 | } |
87 | ||
b33a2887 AN |
88 | static int part_point(struct mtd_info *mtd, loff_t from, size_t len, |
89 | size_t *retlen, void **virt, resource_size_t *phys) | |
1da177e4 | 90 | { |
2524534d | 91 | struct mtd_part *part = mtd_to_part(mtd); |
5def4898 | 92 | |
0a9d72b6 | 93 | return part->parent->_point(part->parent, from + part->offset, len, |
994c8409 | 94 | retlen, virt, phys); |
1da177e4 | 95 | } |
9223a456 | 96 | |
5e4e6e3f | 97 | static int part_unpoint(struct mtd_info *mtd, loff_t from, size_t len) |
1da177e4 | 98 | { |
2524534d | 99 | struct mtd_part *part = mtd_to_part(mtd); |
1da177e4 | 100 | |
0a9d72b6 | 101 | return part->parent->_unpoint(part->parent, from + part->offset, len); |
1da177e4 LT |
102 | } |
103 | ||
8593fbc6 | 104 | static int part_read_oob(struct mtd_info *mtd, loff_t from, |
b33a2887 | 105 | struct mtd_oob_ops *ops) |
1da177e4 | 106 | { |
2524534d | 107 | struct mtd_part *part = mtd_to_part(mtd); |
f1a28c02 | 108 | int res; |
8593fbc6 | 109 | |
1da177e4 | 110 | if (from >= mtd->size) |
8593fbc6 | 111 | return -EINVAL; |
7014568b | 112 | if (ops->datbuf && from + ops->len > mtd->size) |
8593fbc6 | 113 | return -EINVAL; |
f1a28c02 | 114 | |
154bf89f AB |
115 | /* |
116 | * If OOB is also requested, make sure that we do not read past the end | |
117 | * of this partition. | |
118 | */ | |
119 | if (ops->oobbuf) { | |
120 | size_t len, pages; | |
121 | ||
29f1058a | 122 | len = mtd_oobavail(mtd, ops); |
154bf89f AB |
123 | pages = mtd_div_by_ws(mtd->size, mtd); |
124 | pages -= mtd_div_by_ws(from, mtd); | |
125 | if (ops->ooboffs + ops->ooblen > pages * len) | |
126 | return -EINVAL; | |
127 | } | |
128 | ||
0a9d72b6 | 129 | res = part->parent->_read_oob(part->parent, from + part->offset, ops); |
f1a28c02 | 130 | if (unlikely(res)) { |
d57f4054 | 131 | if (mtd_is_bitflip(res)) |
f1a28c02 | 132 | mtd->ecc_stats.corrected++; |
d57f4054 | 133 | if (mtd_is_eccerr(res)) |
f1a28c02 TG |
134 | mtd->ecc_stats.failed++; |
135 | } | |
136 | return res; | |
1da177e4 LT |
137 | } |
138 | ||
b33a2887 AN |
139 | static int part_read_user_prot_reg(struct mtd_info *mtd, loff_t from, |
140 | size_t len, size_t *retlen, u_char *buf) | |
1da177e4 | 141 | { |
2524534d | 142 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 143 | return part->parent->_read_user_prot_reg(part->parent, from, len, |
994c8409 | 144 | retlen, buf); |
1da177e4 LT |
145 | } |
146 | ||
4b78fc42 CR |
147 | static int part_get_user_prot_info(struct mtd_info *mtd, size_t len, |
148 | size_t *retlen, struct otp_info *buf) | |
f77814dd | 149 | { |
2524534d | 150 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 151 | return part->parent->_get_user_prot_info(part->parent, len, retlen, |
4b78fc42 | 152 | buf); |
f77814dd NP |
153 | } |
154 | ||
b33a2887 AN |
155 | static int part_read_fact_prot_reg(struct mtd_info *mtd, loff_t from, |
156 | size_t len, size_t *retlen, u_char *buf) | |
1da177e4 | 157 | { |
2524534d | 158 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 159 | return part->parent->_read_fact_prot_reg(part->parent, from, len, |
994c8409 | 160 | retlen, buf); |
1da177e4 LT |
161 | } |
162 | ||
4b78fc42 CR |
163 | static int part_get_fact_prot_info(struct mtd_info *mtd, size_t len, |
164 | size_t *retlen, struct otp_info *buf) | |
f77814dd | 165 | { |
2524534d | 166 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 167 | return part->parent->_get_fact_prot_info(part->parent, len, retlen, |
4b78fc42 | 168 | buf); |
f77814dd NP |
169 | } |
170 | ||
b33a2887 AN |
171 | static int part_write(struct mtd_info *mtd, loff_t to, size_t len, |
172 | size_t *retlen, const u_char *buf) | |
1da177e4 | 173 | { |
2524534d | 174 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 175 | return part->parent->_write(part->parent, to + part->offset, len, |
994c8409 | 176 | retlen, buf); |
1da177e4 LT |
177 | } |
178 | ||
b33a2887 AN |
179 | static int part_panic_write(struct mtd_info *mtd, loff_t to, size_t len, |
180 | size_t *retlen, const u_char *buf) | |
388bbb09 | 181 | { |
2524534d | 182 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 183 | return part->parent->_panic_write(part->parent, to + part->offset, len, |
994c8409 | 184 | retlen, buf); |
388bbb09 RP |
185 | } |
186 | ||
8593fbc6 | 187 | static int part_write_oob(struct mtd_info *mtd, loff_t to, |
b33a2887 | 188 | struct mtd_oob_ops *ops) |
1da177e4 | 189 | { |
2524534d | 190 | struct mtd_part *part = mtd_to_part(mtd); |
8593fbc6 | 191 | |
1da177e4 | 192 | if (to >= mtd->size) |
8593fbc6 | 193 | return -EINVAL; |
7014568b | 194 | if (ops->datbuf && to + ops->len > mtd->size) |
8593fbc6 | 195 | return -EINVAL; |
0a9d72b6 | 196 | return part->parent->_write_oob(part->parent, to + part->offset, ops); |
1da177e4 LT |
197 | } |
198 | ||
b33a2887 AN |
199 | static int part_write_user_prot_reg(struct mtd_info *mtd, loff_t from, |
200 | size_t len, size_t *retlen, u_char *buf) | |
1da177e4 | 201 | { |
2524534d | 202 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 203 | return part->parent->_write_user_prot_reg(part->parent, from, len, |
994c8409 | 204 | retlen, buf); |
1da177e4 LT |
205 | } |
206 | ||
b33a2887 AN |
207 | static int part_lock_user_prot_reg(struct mtd_info *mtd, loff_t from, |
208 | size_t len) | |
f77814dd | 209 | { |
2524534d | 210 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 211 | return part->parent->_lock_user_prot_reg(part->parent, from, len); |
f77814dd NP |
212 | } |
213 | ||
b33a2887 AN |
214 | static int part_writev(struct mtd_info *mtd, const struct kvec *vecs, |
215 | unsigned long count, loff_t to, size_t *retlen) | |
1da177e4 | 216 | { |
2524534d | 217 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 218 | return part->parent->_writev(part->parent, vecs, count, |
994c8409 | 219 | to + part->offset, retlen); |
1da177e4 LT |
220 | } |
221 | ||
b33a2887 | 222 | static int part_erase(struct mtd_info *mtd, struct erase_info *instr) |
1da177e4 | 223 | { |
2524534d | 224 | struct mtd_part *part = mtd_to_part(mtd); |
1da177e4 | 225 | int ret; |
664addc2 | 226 | |
1da177e4 | 227 | instr->addr += part->offset; |
0a9d72b6 | 228 | ret = part->parent->_erase(part->parent, instr); |
74641d75 | 229 | if (ret) { |
bb0eb217 | 230 | if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN) |
74641d75 AH |
231 | instr->fail_addr -= part->offset; |
232 | instr->addr -= part->offset; | |
233 | } | |
1da177e4 LT |
234 | return ret; |
235 | } | |
236 | ||
237 | void mtd_erase_callback(struct erase_info *instr) | |
238 | { | |
3c3c10bb | 239 | if (instr->mtd->_erase == part_erase) { |
2524534d | 240 | struct mtd_part *part = mtd_to_part(instr->mtd); |
1da177e4 | 241 | |
bb0eb217 | 242 | if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN) |
1da177e4 LT |
243 | instr->fail_addr -= part->offset; |
244 | instr->addr -= part->offset; | |
245 | } | |
246 | if (instr->callback) | |
247 | instr->callback(instr); | |
248 | } | |
249 | EXPORT_SYMBOL_GPL(mtd_erase_callback); | |
250 | ||
69423d99 | 251 | static int part_lock(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
1da177e4 | 252 | { |
2524534d | 253 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 254 | return part->parent->_lock(part->parent, ofs + part->offset, len); |
1da177e4 LT |
255 | } |
256 | ||
69423d99 | 257 | static int part_unlock(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
1da177e4 | 258 | { |
2524534d | 259 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 260 | return part->parent->_unlock(part->parent, ofs + part->offset, len); |
1da177e4 LT |
261 | } |
262 | ||
9938424f RC |
263 | static int part_is_locked(struct mtd_info *mtd, loff_t ofs, uint64_t len) |
264 | { | |
2524534d | 265 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 266 | return part->parent->_is_locked(part->parent, ofs + part->offset, len); |
9938424f RC |
267 | } |
268 | ||
1da177e4 LT |
269 | static void part_sync(struct mtd_info *mtd) |
270 | { | |
2524534d | 271 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 272 | part->parent->_sync(part->parent); |
1da177e4 LT |
273 | } |
274 | ||
275 | static int part_suspend(struct mtd_info *mtd) | |
276 | { | |
2524534d | 277 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 278 | return part->parent->_suspend(part->parent); |
1da177e4 LT |
279 | } |
280 | ||
281 | static void part_resume(struct mtd_info *mtd) | |
282 | { | |
2524534d | 283 | struct mtd_part *part = mtd_to_part(mtd); |
0a9d72b6 | 284 | part->parent->_resume(part->parent); |
1da177e4 LT |
285 | } |
286 | ||
8471bb73 EG |
287 | static int part_block_isreserved(struct mtd_info *mtd, loff_t ofs) |
288 | { | |
2524534d | 289 | struct mtd_part *part = mtd_to_part(mtd); |
8471bb73 | 290 | ofs += part->offset; |
0a9d72b6 | 291 | return part->parent->_block_isreserved(part->parent, ofs); |
8471bb73 EG |
292 | } |
293 | ||
b33a2887 | 294 | static int part_block_isbad(struct mtd_info *mtd, loff_t ofs) |
1da177e4 | 295 | { |
2524534d | 296 | struct mtd_part *part = mtd_to_part(mtd); |
1da177e4 | 297 | ofs += part->offset; |
0a9d72b6 | 298 | return part->parent->_block_isbad(part->parent, ofs); |
1da177e4 LT |
299 | } |
300 | ||
b33a2887 | 301 | static int part_block_markbad(struct mtd_info *mtd, loff_t ofs) |
1da177e4 | 302 | { |
2524534d | 303 | struct mtd_part *part = mtd_to_part(mtd); |
f1a28c02 TG |
304 | int res; |
305 | ||
1da177e4 | 306 | ofs += part->offset; |
0a9d72b6 | 307 | res = part->parent->_block_markbad(part->parent, ofs); |
f1a28c02 TG |
308 | if (!res) |
309 | mtd->ecc_stats.badblocks++; | |
310 | return res; | |
1da177e4 LT |
311 | } |
312 | ||
5e149073 RW |
313 | static int part_get_device(struct mtd_info *mtd) |
314 | { | |
315 | struct mtd_part *part = mtd_to_part(mtd); | |
0a9d72b6 | 316 | return part->parent->_get_device(part->parent); |
5e149073 RW |
317 | } |
318 | ||
319 | static void part_put_device(struct mtd_info *mtd) | |
320 | { | |
321 | struct mtd_part *part = mtd_to_part(mtd); | |
0a9d72b6 | 322 | part->parent->_put_device(part->parent); |
5e149073 RW |
323 | } |
324 | ||
adbbc3bc BB |
325 | static int part_ooblayout_ecc(struct mtd_info *mtd, int section, |
326 | struct mtd_oob_region *oobregion) | |
327 | { | |
328 | struct mtd_part *part = mtd_to_part(mtd); | |
329 | ||
0a9d72b6 | 330 | return mtd_ooblayout_ecc(part->parent, section, oobregion); |
adbbc3bc BB |
331 | } |
332 | ||
333 | static int part_ooblayout_free(struct mtd_info *mtd, int section, | |
334 | struct mtd_oob_region *oobregion) | |
335 | { | |
336 | struct mtd_part *part = mtd_to_part(mtd); | |
337 | ||
0a9d72b6 | 338 | return mtd_ooblayout_free(part->parent, section, oobregion); |
adbbc3bc BB |
339 | } |
340 | ||
341 | static const struct mtd_ooblayout_ops part_ooblayout_ops = { | |
342 | .ecc = part_ooblayout_ecc, | |
343 | .free = part_ooblayout_free, | |
344 | }; | |
345 | ||
6080ef6e JW |
346 | static int part_max_bad_blocks(struct mtd_info *mtd, loff_t ofs, size_t len) |
347 | { | |
348 | struct mtd_part *part = mtd_to_part(mtd); | |
349 | ||
0a9d72b6 | 350 | return part->parent->_max_bad_blocks(part->parent, |
6080ef6e JW |
351 | ofs + part->offset, len); |
352 | } | |
353 | ||
5daa7b21 RT |
354 | static inline void free_partition(struct mtd_part *p) |
355 | { | |
356 | kfree(p->mtd.name); | |
357 | kfree(p); | |
358 | } | |
359 | ||
1a0915be RM |
360 | /** |
361 | * mtd_parse_part - parse MTD partition looking for subpartitions | |
362 | * | |
363 | * @slave: part that is supposed to be a container and should be parsed | |
364 | * @types: NULL-terminated array with names of partition parsers to try | |
365 | * | |
366 | * Some partitions are kind of containers with extra subpartitions (volumes). | |
367 | * There can be various formats of such containers. This function tries to use | |
368 | * specified parsers to analyze given partition and registers found | |
369 | * subpartitions on success. | |
370 | */ | |
371 | static int mtd_parse_part(struct mtd_part *slave, const char *const *types) | |
372 | { | |
373 | struct mtd_partitions parsed; | |
374 | int err; | |
375 | ||
376 | err = parse_mtd_partitions(&slave->mtd, types, &parsed, NULL); | |
377 | if (err) | |
378 | return err; | |
379 | else if (!parsed.nr_parts) | |
380 | return -ENOENT; | |
381 | ||
382 | err = add_mtd_partitions(&slave->mtd, parsed.parts, parsed.nr_parts); | |
383 | ||
384 | mtd_part_parser_cleanup(&parsed); | |
385 | ||
386 | return err; | |
387 | } | |
388 | ||
0a9d72b6 | 389 | static struct mtd_part *allocate_partition(struct mtd_info *parent, |
5daa7b21 RT |
390 | const struct mtd_partition *part, int partno, |
391 | uint64_t cur_offset) | |
7788ba71 | 392 | { |
c169e3d3 | 393 | int wr_alignment = (parent->flags & MTD_NO_ERASE) ? parent->writesize : |
0a9d72b6 | 394 | parent->erasesize; |
7788ba71 | 395 | struct mtd_part *slave; |
1eeef2d7 | 396 | u32 remainder; |
5daa7b21 | 397 | char *name; |
1eeef2d7 | 398 | u64 tmp; |
7788ba71 AN |
399 | |
400 | /* allocate the partition structure */ | |
b33a2887 | 401 | slave = kzalloc(sizeof(*slave), GFP_KERNEL); |
5daa7b21 RT |
402 | name = kstrdup(part->name, GFP_KERNEL); |
403 | if (!name || !slave) { | |
b33a2887 | 404 | printk(KERN_ERR"memory allocation error while creating partitions for \"%s\"\n", |
0a9d72b6 | 405 | parent->name); |
5daa7b21 RT |
406 | kfree(name); |
407 | kfree(slave); | |
408 | return ERR_PTR(-ENOMEM); | |
7788ba71 | 409 | } |
7788ba71 AN |
410 | |
411 | /* set up the MTD object for this partition */ | |
0a9d72b6 RM |
412 | slave->mtd.type = parent->type; |
413 | slave->mtd.flags = parent->flags & ~part->mask_flags; | |
7788ba71 | 414 | slave->mtd.size = part->size; |
0a9d72b6 RM |
415 | slave->mtd.writesize = parent->writesize; |
416 | slave->mtd.writebufsize = parent->writebufsize; | |
417 | slave->mtd.oobsize = parent->oobsize; | |
418 | slave->mtd.oobavail = parent->oobavail; | |
419 | slave->mtd.subpage_sft = parent->subpage_sft; | |
420 | slave->mtd.pairing = parent->pairing; | |
7788ba71 | 421 | |
5daa7b21 | 422 | slave->mtd.name = name; |
0a9d72b6 | 423 | slave->mtd.owner = parent->owner; |
7788ba71 | 424 | |
727dc612 DE |
425 | /* NOTE: Historically, we didn't arrange MTDs as a tree out of |
426 | * concern for showing the same data in multiple partitions. | |
427 | * However, it is very useful to have the master node present, | |
428 | * so the MTD_PARTITIONED_MASTER option allows that. The master | |
429 | * will have device nodes etc only if this is set, so make the | |
430 | * parent conditional on that option. Note, this is a way to | |
431 | * distinguish between the master and the partition in sysfs. | |
1f24b5a8 | 432 | */ |
97519dc5 | 433 | slave->mtd.dev.parent = IS_ENABLED(CONFIG_MTD_PARTITIONED_MASTER) || mtd_is_partition(parent) ? |
0a9d72b6 RM |
434 | &parent->dev : |
435 | parent->dev.parent; | |
42e9401b | 436 | slave->mtd.dev.of_node = part->of_node; |
1f24b5a8 | 437 | |
3c3c10bb AB |
438 | slave->mtd._read = part_read; |
439 | slave->mtd._write = part_write; | |
7788ba71 | 440 | |
0a9d72b6 | 441 | if (parent->_panic_write) |
3c3c10bb | 442 | slave->mtd._panic_write = part_panic_write; |
7788ba71 | 443 | |
0a9d72b6 | 444 | if (parent->_point && parent->_unpoint) { |
3c3c10bb AB |
445 | slave->mtd._point = part_point; |
446 | slave->mtd._unpoint = part_unpoint; | |
7788ba71 AN |
447 | } |
448 | ||
0a9d72b6 | 449 | if (parent->_read_oob) |
3c3c10bb | 450 | slave->mtd._read_oob = part_read_oob; |
0a9d72b6 | 451 | if (parent->_write_oob) |
3c3c10bb | 452 | slave->mtd._write_oob = part_write_oob; |
0a9d72b6 | 453 | if (parent->_read_user_prot_reg) |
3c3c10bb | 454 | slave->mtd._read_user_prot_reg = part_read_user_prot_reg; |
0a9d72b6 | 455 | if (parent->_read_fact_prot_reg) |
3c3c10bb | 456 | slave->mtd._read_fact_prot_reg = part_read_fact_prot_reg; |
0a9d72b6 | 457 | if (parent->_write_user_prot_reg) |
3c3c10bb | 458 | slave->mtd._write_user_prot_reg = part_write_user_prot_reg; |
0a9d72b6 | 459 | if (parent->_lock_user_prot_reg) |
3c3c10bb | 460 | slave->mtd._lock_user_prot_reg = part_lock_user_prot_reg; |
0a9d72b6 | 461 | if (parent->_get_user_prot_info) |
3c3c10bb | 462 | slave->mtd._get_user_prot_info = part_get_user_prot_info; |
0a9d72b6 | 463 | if (parent->_get_fact_prot_info) |
3c3c10bb | 464 | slave->mtd._get_fact_prot_info = part_get_fact_prot_info; |
0a9d72b6 | 465 | if (parent->_sync) |
3c3c10bb | 466 | slave->mtd._sync = part_sync; |
0a9d72b6 RM |
467 | if (!partno && !parent->dev.class && parent->_suspend && |
468 | parent->_resume) { | |
c169e3d3 BN |
469 | slave->mtd._suspend = part_suspend; |
470 | slave->mtd._resume = part_resume; | |
7788ba71 | 471 | } |
0a9d72b6 | 472 | if (parent->_writev) |
3c3c10bb | 473 | slave->mtd._writev = part_writev; |
0a9d72b6 | 474 | if (parent->_lock) |
3c3c10bb | 475 | slave->mtd._lock = part_lock; |
0a9d72b6 | 476 | if (parent->_unlock) |
3c3c10bb | 477 | slave->mtd._unlock = part_unlock; |
0a9d72b6 | 478 | if (parent->_is_locked) |
3c3c10bb | 479 | slave->mtd._is_locked = part_is_locked; |
0a9d72b6 | 480 | if (parent->_block_isreserved) |
8471bb73 | 481 | slave->mtd._block_isreserved = part_block_isreserved; |
0a9d72b6 | 482 | if (parent->_block_isbad) |
3c3c10bb | 483 | slave->mtd._block_isbad = part_block_isbad; |
0a9d72b6 | 484 | if (parent->_block_markbad) |
3c3c10bb | 485 | slave->mtd._block_markbad = part_block_markbad; |
0a9d72b6 | 486 | if (parent->_max_bad_blocks) |
6080ef6e | 487 | slave->mtd._max_bad_blocks = part_max_bad_blocks; |
5e149073 | 488 | |
0a9d72b6 | 489 | if (parent->_get_device) |
5e149073 | 490 | slave->mtd._get_device = part_get_device; |
0a9d72b6 | 491 | if (parent->_put_device) |
5e149073 RW |
492 | slave->mtd._put_device = part_put_device; |
493 | ||
3c3c10bb | 494 | slave->mtd._erase = part_erase; |
0a9d72b6 | 495 | slave->parent = parent; |
7788ba71 | 496 | slave->offset = part->offset; |
7788ba71 AN |
497 | |
498 | if (slave->offset == MTDPART_OFS_APPEND) | |
499 | slave->offset = cur_offset; | |
500 | if (slave->offset == MTDPART_OFS_NXTBLK) { | |
1eeef2d7 | 501 | tmp = cur_offset; |
7788ba71 | 502 | slave->offset = cur_offset; |
1eeef2d7 CP |
503 | remainder = do_div(tmp, wr_alignment); |
504 | if (remainder) { | |
505 | slave->offset += wr_alignment - remainder; | |
7788ba71 | 506 | printk(KERN_NOTICE "Moving partition %d: " |
69423d99 AH |
507 | "0x%012llx -> 0x%012llx\n", partno, |
508 | (unsigned long long)cur_offset, (unsigned long long)slave->offset); | |
7788ba71 AN |
509 | } |
510 | } | |
1a31368b DES |
511 | if (slave->offset == MTDPART_OFS_RETAIN) { |
512 | slave->offset = cur_offset; | |
0a9d72b6 RM |
513 | if (parent->size - slave->offset >= slave->mtd.size) { |
514 | slave->mtd.size = parent->size - slave->offset | |
1a31368b DES |
515 | - slave->mtd.size; |
516 | } else { | |
517 | printk(KERN_ERR "mtd partition \"%s\" doesn't have enough space: %#llx < %#llx, disabled\n", | |
0a9d72b6 | 518 | part->name, parent->size - slave->offset, |
1a31368b DES |
519 | slave->mtd.size); |
520 | /* register to preserve ordering */ | |
521 | goto out_register; | |
522 | } | |
523 | } | |
7788ba71 | 524 | if (slave->mtd.size == MTDPART_SIZ_FULL) |
0a9d72b6 | 525 | slave->mtd.size = parent->size - slave->offset; |
7788ba71 | 526 | |
69423d99 AH |
527 | printk(KERN_NOTICE "0x%012llx-0x%012llx : \"%s\"\n", (unsigned long long)slave->offset, |
528 | (unsigned long long)(slave->offset + slave->mtd.size), slave->mtd.name); | |
7788ba71 AN |
529 | |
530 | /* let's do some sanity checks */ | |
0a9d72b6 | 531 | if (slave->offset >= parent->size) { |
f636ffb4 | 532 | /* let's register it anyway to preserve ordering */ |
7788ba71 AN |
533 | slave->offset = 0; |
534 | slave->mtd.size = 0; | |
b33a2887 | 535 | printk(KERN_ERR"mtd: partition \"%s\" is out of reach -- disabled\n", |
7788ba71 | 536 | part->name); |
f636ffb4 | 537 | goto out_register; |
7788ba71 | 538 | } |
0a9d72b6 RM |
539 | if (slave->offset + slave->mtd.size > parent->size) { |
540 | slave->mtd.size = parent->size - slave->offset; | |
69423d99 | 541 | printk(KERN_WARNING"mtd: partition \"%s\" extends beyond the end of device \"%s\" -- size truncated to %#llx\n", |
0a9d72b6 | 542 | part->name, parent->name, (unsigned long long)slave->mtd.size); |
7788ba71 | 543 | } |
0a9d72b6 | 544 | if (parent->numeraseregions > 1) { |
7788ba71 | 545 | /* Deal with variable erase size stuff */ |
0a9d72b6 | 546 | int i, max = parent->numeraseregions; |
69423d99 | 547 | u64 end = slave->offset + slave->mtd.size; |
0a9d72b6 | 548 | struct mtd_erase_region_info *regions = parent->eraseregions; |
7788ba71 | 549 | |
6910c136 AN |
550 | /* Find the first erase regions which is part of this |
551 | * partition. */ | |
552 | for (i = 0; i < max && regions[i].offset <= slave->offset; i++) | |
7788ba71 | 553 | ; |
6910c136 | 554 | /* The loop searched for the region _behind_ the first one */ |
a57ca046 RK |
555 | if (i > 0) |
556 | i--; | |
7788ba71 | 557 | |
6910c136 AN |
558 | /* Pick biggest erasesize */ |
559 | for (; i < max && regions[i].offset < end; i++) { | |
7788ba71 AN |
560 | if (slave->mtd.erasesize < regions[i].erasesize) { |
561 | slave->mtd.erasesize = regions[i].erasesize; | |
562 | } | |
563 | } | |
6910c136 | 564 | BUG_ON(slave->mtd.erasesize == 0); |
7788ba71 AN |
565 | } else { |
566 | /* Single erase size */ | |
0a9d72b6 | 567 | slave->mtd.erasesize = parent->erasesize; |
7788ba71 AN |
568 | } |
569 | ||
7e439681 BB |
570 | /* |
571 | * Slave erasesize might differ from the master one if the master | |
572 | * exposes several regions with different erasesize. Adjust | |
573 | * wr_alignment accordingly. | |
574 | */ | |
575 | if (!(slave->mtd.flags & MTD_NO_ERASE)) | |
576 | wr_alignment = slave->mtd.erasesize; | |
577 | ||
1eeef2d7 CP |
578 | tmp = slave->offset; |
579 | remainder = do_div(tmp, wr_alignment); | |
580 | if ((slave->mtd.flags & MTD_WRITEABLE) && remainder) { | |
7788ba71 | 581 | /* Doesn't start on a boundary of major erase size */ |
b33a2887 AN |
582 | /* FIXME: Let it be writable if it is on a boundary of |
583 | * _minor_ erase size though */ | |
7788ba71 | 584 | slave->mtd.flags &= ~MTD_WRITEABLE; |
1eeef2d7 | 585 | printk(KERN_WARNING"mtd: partition \"%s\" doesn't start on an erase/write block boundary -- force read-only\n", |
7788ba71 AN |
586 | part->name); |
587 | } | |
1eeef2d7 CP |
588 | |
589 | tmp = slave->mtd.size; | |
590 | remainder = do_div(tmp, wr_alignment); | |
591 | if ((slave->mtd.flags & MTD_WRITEABLE) && remainder) { | |
7788ba71 | 592 | slave->mtd.flags &= ~MTD_WRITEABLE; |
1eeef2d7 | 593 | printk(KERN_WARNING"mtd: partition \"%s\" doesn't end on an erase/write block -- force read-only\n", |
7788ba71 AN |
594 | part->name); |
595 | } | |
596 | ||
adbbc3bc | 597 | mtd_set_ooblayout(&slave->mtd, &part_ooblayout_ops); |
0a9d72b6 RM |
598 | slave->mtd.ecc_step_size = parent->ecc_step_size; |
599 | slave->mtd.ecc_strength = parent->ecc_strength; | |
600 | slave->mtd.bitflip_threshold = parent->bitflip_threshold; | |
d062d4ed | 601 | |
0a9d72b6 | 602 | if (parent->_block_isbad) { |
69423d99 | 603 | uint64_t offs = 0; |
7788ba71 | 604 | |
b33a2887 | 605 | while (offs < slave->mtd.size) { |
0a9d72b6 | 606 | if (mtd_block_isreserved(parent, offs + slave->offset)) |
fdf43a42 | 607 | slave->mtd.ecc_stats.bbtblocks++; |
0a9d72b6 | 608 | else if (mtd_block_isbad(parent, offs + slave->offset)) |
7788ba71 AN |
609 | slave->mtd.ecc_stats.badblocks++; |
610 | offs += slave->mtd.erasesize; | |
611 | } | |
612 | } | |
613 | ||
f636ffb4 | 614 | out_register: |
7788ba71 AN |
615 | return slave; |
616 | } | |
617 | ||
a62c24d7 DE |
618 | static ssize_t mtd_partition_offset_show(struct device *dev, |
619 | struct device_attribute *attr, char *buf) | |
620 | { | |
621 | struct mtd_info *mtd = dev_get_drvdata(dev); | |
2524534d | 622 | struct mtd_part *part = mtd_to_part(mtd); |
a62c24d7 DE |
623 | return snprintf(buf, PAGE_SIZE, "%lld\n", part->offset); |
624 | } | |
625 | ||
626 | static DEVICE_ATTR(offset, S_IRUGO, mtd_partition_offset_show, NULL); | |
627 | ||
628 | static const struct attribute *mtd_partition_attrs[] = { | |
629 | &dev_attr_offset.attr, | |
630 | NULL | |
631 | }; | |
632 | ||
633 | static int mtd_add_partition_attrs(struct mtd_part *new) | |
634 | { | |
635 | int ret = sysfs_create_files(&new->mtd.dev.kobj, mtd_partition_attrs); | |
636 | if (ret) | |
637 | printk(KERN_WARNING | |
638 | "mtd: failed to create partition attrs, err=%d\n", ret); | |
639 | return ret; | |
640 | } | |
641 | ||
0a9d72b6 | 642 | int mtd_add_partition(struct mtd_info *parent, const char *name, |
5daa7b21 RT |
643 | long long offset, long long length) |
644 | { | |
645 | struct mtd_partition part; | |
3a434f66 | 646 | struct mtd_part *new; |
5daa7b21 RT |
647 | int ret = 0; |
648 | ||
649 | /* the direct offset is expected */ | |
650 | if (offset == MTDPART_OFS_APPEND || | |
651 | offset == MTDPART_OFS_NXTBLK) | |
652 | return -EINVAL; | |
653 | ||
654 | if (length == MTDPART_SIZ_FULL) | |
0a9d72b6 | 655 | length = parent->size - offset; |
5daa7b21 RT |
656 | |
657 | if (length <= 0) | |
658 | return -EINVAL; | |
659 | ||
93867233 | 660 | memset(&part, 0, sizeof(part)); |
5daa7b21 RT |
661 | part.name = name; |
662 | part.size = length; | |
663 | part.offset = offset; | |
5daa7b21 | 664 | |
0a9d72b6 | 665 | new = allocate_partition(parent, &part, -1, offset); |
5daa7b21 RT |
666 | if (IS_ERR(new)) |
667 | return PTR_ERR(new); | |
668 | ||
5daa7b21 | 669 | mutex_lock(&mtd_partitions_mutex); |
5daa7b21 RT |
670 | list_add(&new->list, &mtd_partitions); |
671 | mutex_unlock(&mtd_partitions_mutex); | |
672 | ||
673 | add_mtd_device(&new->mtd); | |
674 | ||
a62c24d7 DE |
675 | mtd_add_partition_attrs(new); |
676 | ||
5daa7b21 | 677 | return ret; |
5daa7b21 RT |
678 | } |
679 | EXPORT_SYMBOL_GPL(mtd_add_partition); | |
680 | ||
08263a9a RM |
681 | /** |
682 | * __mtd_del_partition - delete MTD partition | |
683 | * | |
684 | * @priv: internal MTD struct for partition to be deleted | |
685 | * | |
686 | * This function must be called with the partitions mutex locked. | |
687 | */ | |
688 | static int __mtd_del_partition(struct mtd_part *priv) | |
689 | { | |
97519dc5 | 690 | struct mtd_part *child, *next; |
08263a9a RM |
691 | int err; |
692 | ||
97519dc5 RM |
693 | list_for_each_entry_safe(child, next, &mtd_partitions, list) { |
694 | if (child->parent == &priv->mtd) { | |
695 | err = __mtd_del_partition(child); | |
696 | if (err) | |
697 | return err; | |
698 | } | |
699 | } | |
700 | ||
c5ceaba7 RM |
701 | sysfs_remove_files(&priv->mtd.dev.kobj, mtd_partition_attrs); |
702 | ||
08263a9a RM |
703 | err = del_mtd_device(&priv->mtd); |
704 | if (err) | |
705 | return err; | |
706 | ||
707 | list_del(&priv->list); | |
708 | free_partition(priv); | |
709 | ||
710 | return 0; | |
711 | } | |
712 | ||
713 | /* | |
714 | * This function unregisters and destroy all slave MTD objects which are | |
97519dc5 | 715 | * attached to the given MTD object. |
08263a9a | 716 | */ |
97519dc5 | 717 | int del_mtd_partitions(struct mtd_info *mtd) |
08263a9a RM |
718 | { |
719 | struct mtd_part *slave, *next; | |
720 | int ret, err = 0; | |
721 | ||
722 | mutex_lock(&mtd_partitions_mutex); | |
723 | list_for_each_entry_safe(slave, next, &mtd_partitions, list) | |
97519dc5 | 724 | if (slave->parent == mtd) { |
08263a9a RM |
725 | ret = __mtd_del_partition(slave); |
726 | if (ret < 0) | |
727 | err = ret; | |
728 | } | |
729 | mutex_unlock(&mtd_partitions_mutex); | |
730 | ||
731 | return err; | |
732 | } | |
733 | ||
97519dc5 | 734 | int mtd_del_partition(struct mtd_info *mtd, int partno) |
5daa7b21 RT |
735 | { |
736 | struct mtd_part *slave, *next; | |
737 | int ret = -EINVAL; | |
738 | ||
739 | mutex_lock(&mtd_partitions_mutex); | |
740 | list_for_each_entry_safe(slave, next, &mtd_partitions, list) | |
97519dc5 | 741 | if ((slave->parent == mtd) && |
5daa7b21 | 742 | (slave->mtd.index == partno)) { |
08263a9a | 743 | ret = __mtd_del_partition(slave); |
5daa7b21 RT |
744 | break; |
745 | } | |
746 | mutex_unlock(&mtd_partitions_mutex); | |
747 | ||
748 | return ret; | |
749 | } | |
750 | EXPORT_SYMBOL_GPL(mtd_del_partition); | |
751 | ||
1da177e4 LT |
752 | /* |
753 | * This function, given a master MTD object and a partition table, creates | |
754 | * and registers slave MTD objects which are bound to the master according to | |
755 | * the partition definitions. | |
1f24b5a8 | 756 | * |
727dc612 DE |
757 | * For historical reasons, this function's caller only registers the master |
758 | * if the MTD_PARTITIONED_MASTER config option is set. | |
1da177e4 LT |
759 | */ |
760 | ||
97894cda | 761 | int add_mtd_partitions(struct mtd_info *master, |
1da177e4 LT |
762 | const struct mtd_partition *parts, |
763 | int nbparts) | |
764 | { | |
765 | struct mtd_part *slave; | |
69423d99 | 766 | uint64_t cur_offset = 0; |
1da177e4 LT |
767 | int i; |
768 | ||
b33a2887 | 769 | printk(KERN_NOTICE "Creating %d MTD partitions on \"%s\":\n", nbparts, master->name); |
1da177e4 LT |
770 | |
771 | for (i = 0; i < nbparts; i++) { | |
5daa7b21 | 772 | slave = allocate_partition(master, parts + i, i, cur_offset); |
e5bae867 BB |
773 | if (IS_ERR(slave)) { |
774 | del_mtd_partitions(master); | |
5daa7b21 | 775 | return PTR_ERR(slave); |
e5bae867 | 776 | } |
5daa7b21 RT |
777 | |
778 | mutex_lock(&mtd_partitions_mutex); | |
779 | list_add(&slave->list, &mtd_partitions); | |
780 | mutex_unlock(&mtd_partitions_mutex); | |
781 | ||
782 | add_mtd_device(&slave->mtd); | |
a62c24d7 | 783 | mtd_add_partition_attrs(slave); |
1a0915be RM |
784 | if (parts[i].types) |
785 | mtd_parse_part(slave, parts[i].types); | |
5daa7b21 | 786 | |
1da177e4 | 787 | cur_offset = slave->offset + slave->mtd.size; |
1da177e4 LT |
788 | } |
789 | ||
790 | return 0; | |
791 | } | |
1da177e4 LT |
792 | |
793 | static DEFINE_SPINLOCK(part_parser_lock); | |
794 | static LIST_HEAD(part_parsers); | |
795 | ||
5531ae48 | 796 | static struct mtd_part_parser *mtd_part_parser_get(const char *name) |
1da177e4 | 797 | { |
71a928c0 | 798 | struct mtd_part_parser *p, *ret = NULL; |
1da177e4 | 799 | |
71a928c0 | 800 | spin_lock(&part_parser_lock); |
1da177e4 | 801 | |
71a928c0 | 802 | list_for_each_entry(p, &part_parsers, list) |
1da177e4 LT |
803 | if (!strcmp(p->name, name) && try_module_get(p->owner)) { |
804 | ret = p; | |
805 | break; | |
806 | } | |
71a928c0 | 807 | |
1da177e4 LT |
808 | spin_unlock(&part_parser_lock); |
809 | ||
810 | return ret; | |
811 | } | |
812 | ||
5531ae48 BN |
813 | static inline void mtd_part_parser_put(const struct mtd_part_parser *p) |
814 | { | |
815 | module_put(p->owner); | |
816 | } | |
953b3bd1 | 817 | |
adc83bf8 BN |
818 | /* |
819 | * Many partition parsers just expected the core to kfree() all their data in | |
820 | * one chunk. Do that by default. | |
821 | */ | |
822 | static void mtd_part_parser_cleanup_default(const struct mtd_partition *pparts, | |
823 | int nr_parts) | |
824 | { | |
825 | kfree(pparts); | |
826 | } | |
827 | ||
b9eab011 | 828 | int __register_mtd_parser(struct mtd_part_parser *p, struct module *owner) |
1da177e4 | 829 | { |
b9eab011 BN |
830 | p->owner = owner; |
831 | ||
adc83bf8 BN |
832 | if (!p->cleanup) |
833 | p->cleanup = &mtd_part_parser_cleanup_default; | |
834 | ||
1da177e4 LT |
835 | spin_lock(&part_parser_lock); |
836 | list_add(&p->list, &part_parsers); | |
837 | spin_unlock(&part_parser_lock); | |
b9eab011 BN |
838 | |
839 | return 0; | |
1da177e4 | 840 | } |
b9eab011 | 841 | EXPORT_SYMBOL_GPL(__register_mtd_parser); |
1da177e4 | 842 | |
cf3b2b1e | 843 | void deregister_mtd_parser(struct mtd_part_parser *p) |
1da177e4 LT |
844 | { |
845 | spin_lock(&part_parser_lock); | |
846 | list_del(&p->list); | |
847 | spin_unlock(&part_parser_lock); | |
1da177e4 | 848 | } |
b33a2887 | 849 | EXPORT_SYMBOL_GPL(deregister_mtd_parser); |
1da177e4 | 850 | |
ad274cec AB |
851 | /* |
852 | * Do not forget to update 'parse_mtd_partitions()' kerneldoc comment if you | |
853 | * are changing this array! | |
854 | */ | |
ccef4dcc | 855 | static const char * const default_mtd_part_types[] = { |
d26c87d6 DES |
856 | "cmdlinepart", |
857 | "ofpart", | |
858 | NULL | |
859 | }; | |
5c4eefbd | 860 | |
01f9c724 BN |
861 | static int mtd_part_do_parse(struct mtd_part_parser *parser, |
862 | struct mtd_info *master, | |
863 | struct mtd_partitions *pparts, | |
864 | struct mtd_part_parser_data *data) | |
865 | { | |
866 | int ret; | |
867 | ||
868 | ret = (*parser->parse_fn)(master, &pparts->parts, data); | |
869 | pr_debug("%s: parser %s: %i\n", master->name, parser->name, ret); | |
870 | if (ret <= 0) | |
871 | return ret; | |
872 | ||
873 | pr_notice("%d %s partitions found on MTD device %s\n", ret, | |
874 | parser->name, master->name); | |
875 | ||
876 | pparts->nr_parts = ret; | |
877 | pparts->parser = parser; | |
878 | ||
879 | return ret; | |
880 | } | |
881 | ||
ad274cec AB |
882 | /** |
883 | * parse_mtd_partitions - parse MTD partitions | |
884 | * @master: the master partition (describes whole MTD device) | |
885 | * @types: names of partition parsers to try or %NULL | |
07fd2f87 | 886 | * @pparts: info about partitions found is returned here |
c7975330 | 887 | * @data: MTD partition parser-specific data |
ad274cec AB |
888 | * |
889 | * This function tries to find partition on MTD device @master. It uses MTD | |
890 | * partition parsers, specified in @types. However, if @types is %NULL, then | |
891 | * the default list of parsers is used. The default list contains only the | |
d26c87d6 | 892 | * "cmdlinepart" and "ofpart" parsers ATM. |
c51803dd HS |
893 | * Note: If there are more then one parser in @types, the kernel only takes the |
894 | * partitions parsed out by the first parser. | |
ad274cec AB |
895 | * |
896 | * This function may return: | |
897 | * o a negative error code in case of failure | |
07fd2f87 | 898 | * o zero otherwise, and @pparts will describe the partitions, number of |
adc83bf8 BN |
899 | * partitions, and the parser which parsed them. Caller must release |
900 | * resources with mtd_part_parser_cleanup() when finished with the returned | |
901 | * data. | |
ad274cec | 902 | */ |
26a47346 | 903 | int parse_mtd_partitions(struct mtd_info *master, const char *const *types, |
07fd2f87 | 904 | struct mtd_partitions *pparts, |
c7975330 | 905 | struct mtd_part_parser_data *data) |
1da177e4 LT |
906 | { |
907 | struct mtd_part_parser *parser; | |
5a2415b0 | 908 | int ret, err = 0; |
97894cda | 909 | |
5c4eefbd DES |
910 | if (!types) |
911 | types = default_mtd_part_types; | |
912 | ||
5a2415b0 | 913 | for ( ; *types; types++) { |
8e2c992b | 914 | pr_debug("%s: parsing partitions %s\n", master->name, *types); |
5531ae48 | 915 | parser = mtd_part_parser_get(*types); |
1da177e4 | 916 | if (!parser && !request_module("%s", *types)) |
5531ae48 | 917 | parser = mtd_part_parser_get(*types); |
8e2c992b MS |
918 | pr_debug("%s: got parser %s\n", master->name, |
919 | parser ? parser->name : NULL); | |
7c802fbd | 920 | if (!parser) |
1da177e4 | 921 | continue; |
01f9c724 BN |
922 | ret = mtd_part_do_parse(parser, master, pparts, data); |
923 | /* Found partitions! */ | |
924 | if (ret > 0) | |
07fd2f87 | 925 | return 0; |
adc83bf8 | 926 | mtd_part_parser_put(parser); |
5a2415b0 BN |
927 | /* |
928 | * Stash the first error we see; only report it if no parser | |
929 | * succeeds | |
930 | */ | |
931 | if (ret < 0 && !err) | |
932 | err = ret; | |
1da177e4 | 933 | } |
5a2415b0 | 934 | return err; |
1da177e4 | 935 | } |
5daa7b21 | 936 | |
adc83bf8 BN |
937 | void mtd_part_parser_cleanup(struct mtd_partitions *parts) |
938 | { | |
939 | const struct mtd_part_parser *parser; | |
940 | ||
941 | if (!parts) | |
942 | return; | |
943 | ||
944 | parser = parts->parser; | |
945 | if (parser) { | |
946 | if (parser->cleanup) | |
947 | parser->cleanup(parts->parts, parts->nr_parts); | |
948 | ||
949 | mtd_part_parser_put(parser); | |
950 | } | |
951 | } | |
952 | ||
5dee4674 | 953 | int mtd_is_partition(const struct mtd_info *mtd) |
5daa7b21 RT |
954 | { |
955 | struct mtd_part *part; | |
a7e93dcd | 956 | int ispart = 0; |
5daa7b21 RT |
957 | |
958 | mutex_lock(&mtd_partitions_mutex); | |
959 | list_for_each_entry(part, &mtd_partitions, list) | |
960 | if (&part->mtd == mtd) { | |
a7e93dcd | 961 | ispart = 1; |
5daa7b21 RT |
962 | break; |
963 | } | |
964 | mutex_unlock(&mtd_partitions_mutex); | |
965 | ||
a7e93dcd | 966 | return ispart; |
5daa7b21 | 967 | } |
a7e93dcd | 968 | EXPORT_SYMBOL_GPL(mtd_is_partition); |
62082e56 RG |
969 | |
970 | /* Returns the size of the entire flash chip */ | |
971 | uint64_t mtd_get_device_size(const struct mtd_info *mtd) | |
972 | { | |
973 | if (!mtd_is_partition(mtd)) | |
974 | return mtd->size; | |
975 | ||
97519dc5 | 976 | return mtd_get_device_size(mtd_to_part(mtd)->parent); |
62082e56 RG |
977 | } |
978 | EXPORT_SYMBOL_GPL(mtd_get_device_size); |