1 // SPDX-License-Identifier: GPL-2.0+
3 * Simple MTD partitioning layer
5 * Copyright © 2000 Nicolas Pitre <nico@fluxnic.net>
6 * Copyright © 2002 Thomas Gleixner <gleixner@linutronix.de>
7 * Copyright © 2000-2010 David Woodhouse <dwmw2@infradead.org>
12 #include <linux/module.h>
13 #include <linux/types.h>
14 #include <linux/kernel.h>
15 #include <linux/slab.h>
16 #include <linux/list.h>
17 #include <linux/kmod.h>
22 #include <linux/errno.h>
23 #include <linux/compat.h>
24 #include <ubi_uboot.h>
26 #include <linux/mtd/mtd.h>
27 #include <linux/mtd/partitions.h>
28 #include <linux/err.h>
29 #include <linux/sizes.h>
33 /* Our partition linked list */
34 static LIST_HEAD(mtd_partitions);
36 static DEFINE_MUTEX(mtd_partitions_mutex);
38 DEFINE_MUTEX(mtd_partitions_mutex);
41 /* Our partition node structure */
44 struct mtd_info *master;
46 struct list_head list;
50 * Given a pointer to the MTD object in the mtd_part structure, we can retrieve
51 * the pointer to that structure with this macro.
53 #define PART(x) ((struct mtd_part *)(x))
60 * kstrdup - allocate space for and copy an existing string
61 * @s: the string to duplicate
62 * @gfp: the GFP mask used in the kmalloc() call when allocating memory
64 char *kstrdup(const char *s, gfp_t gfp)
73 buf = kmalloc(len, gfp);
80 #define MTD_SIZE_REMAINING (~0LLU)
81 #define MTD_OFFSET_NOT_SPECIFIED (~0LLU)
84 * mtd_parse_partition - Parse @mtdparts partition definition, fill @partition
85 * with it and update the @mtdparts string pointer.
87 * The partition name is allocated and must be freed by the caller.
89 * This function is widely inspired from part_parse (mtdparts.c).
91 * @mtdparts: String describing the partition with mtdparts command syntax
92 * @partition: MTD partition structure to fill
94 * @return 0 on success, an error otherwise.
96 static int mtd_parse_partition(const char **_mtdparts,
97 struct mtd_partition *partition)
99 const char *mtdparts = *_mtdparts;
100 const char *name = NULL;
104 /* Ensure the partition structure is empty */
105 memset(partition, 0, sizeof(struct mtd_partition));
107 /* Fetch the partition size */
108 if (*mtdparts == '-') {
109 /* Assign all remaining space to this partition */
110 partition->size = MTD_SIZE_REMAINING;
113 partition->size = ustrtoull(mtdparts, (char **)&mtdparts, 0);
114 if (partition->size < SZ_4K) {
115 printf("Minimum partition size 4kiB, %lldB requested\n",
121 /* Check for the offset */
122 partition->offset = MTD_OFFSET_NOT_SPECIFIED;
123 if (*mtdparts == '@') {
125 partition->offset = ustrtoull(mtdparts, (char **)&mtdparts, 0);
128 /* Now look for the name */
129 if (*mtdparts == '(') {
131 mtdparts = strchr(name, ')');
133 printf("No closing ')' found in partition name\n");
136 name_len = mtdparts - name + 1;
137 if ((name_len - 1) == 0) {
138 printf("Empty partition name\n");
143 /* Name will be of the form size@offset */
147 /* Check if the partition is read-only */
148 if (strncmp(mtdparts, "ro", 2) == 0) {
149 partition->mask_flags |= MTD_WRITEABLE;
153 /* Check for a potential next partition definition */
154 if (*mtdparts == ',') {
155 if (partition->size == MTD_SIZE_REMAINING) {
156 printf("No partitions allowed after a fill-up\n");
160 } else if ((*mtdparts == ';') || (*mtdparts == '\0')) {
163 printf("Unexpected character '%c' in mtdparts\n", *mtdparts);
168 * Allocate a buffer for the name and either copy the provided name or
169 * auto-generate it with the form 'size@offset'.
171 buf = malloc(name_len);
176 strncpy(buf, name, name_len - 1);
178 snprintf(buf, name_len, "0x%08llx@0x%08llx",
179 partition->size, partition->offset);
181 buf[name_len - 1] = '\0';
182 partition->name = buf;
184 *_mtdparts = mtdparts;
190 * mtd_parse_partitions - Create a partition array from an mtdparts definition
192 * Stateless function that takes a @parent MTD device, a string @_mtdparts
193 * describing the partitions (with the "mtdparts" command syntax) and creates
194 * the corresponding MTD partition structure array @_parts. Both the name and
195 * the structure partition itself must be freed freed, the caller may use
196 * @mtd_free_parsed_partitions() for this purpose.
198 * @parent: MTD device which contains the partitions
199 * @_mtdparts: Pointer to a string describing the partitions with "mtdparts"
201 * @_parts: Allocated array containing the partitions, must be freed by the
203 * @_nparts: Size of @_parts array.
205 * @return 0 on success, an error otherwise.
207 int mtd_parse_partitions(struct mtd_info *parent, const char **_mtdparts,
208 struct mtd_partition **_parts, int *_nparts)
210 struct mtd_partition partition = {}, *parts;
211 const char *mtdparts = *_mtdparts;
212 int cur_off = 0, cur_sz = 0;
217 /* First, iterate over the partitions until we know their number */
218 while (mtdparts[0] != '\0' && mtdparts[0] != ';') {
219 ret = mtd_parse_partition(&mtdparts, &partition);
223 free((char *)partition.name);
227 /* Allocate an array of partitions to give back to the caller */
228 parts = malloc(sizeof(*parts) * nparts);
230 printf("Not enough space to save partitions meta-data\n");
234 /* Iterate again over each partition to save the data in our array */
235 for (idx = 0; idx < nparts; idx++) {
236 ret = mtd_parse_partition(_mtdparts, &parts[idx]);
240 if (parts[idx].size == MTD_SIZE_REMAINING)
241 parts[idx].size = parent->size - cur_sz;
242 cur_sz += parts[idx].size;
244 sz = parts[idx].size;
245 if (sz < parent->writesize || do_div(sz, parent->writesize)) {
246 printf("Partition size must be a multiple of %d\n",
251 if (parts[idx].offset == MTD_OFFSET_NOT_SPECIFIED)
252 parts[idx].offset = cur_off;
253 cur_off += parts[idx].size;
255 parts[idx].ecclayout = parent->ecclayout;
258 /* Offset by one mtdparts to point to the next device if any */
259 if (*_mtdparts[0] == ';')
269 * mtd_free_parsed_partitions - Free dynamically allocated partitions
271 * Each successful call to @mtd_parse_partitions must be followed by a call to
272 * @mtd_free_parsed_partitions to free any allocated array during the parsing
275 * @parts: Array containing the partitions that will be freed.
276 * @nparts: Size of @parts array.
278 void mtd_free_parsed_partitions(struct mtd_partition *parts,
283 for (i = 0; i < nparts; i++)
284 free((char *)parts[i].name);
290 * MTD methods which simply translate the effective address and pass through
291 * to the _real_ device.
294 static int part_read(struct mtd_info *mtd, loff_t from, size_t len,
295 size_t *retlen, u_char *buf)
297 struct mtd_part *part = PART(mtd);
298 struct mtd_ecc_stats stats;
301 stats = part->master->ecc_stats;
302 res = part->master->_read(part->master, from + part->offset, len,
304 if (unlikely(mtd_is_eccerr(res)))
305 mtd->ecc_stats.failed +=
306 part->master->ecc_stats.failed - stats.failed;
308 mtd->ecc_stats.corrected +=
309 part->master->ecc_stats.corrected - stats.corrected;
314 static int part_point(struct mtd_info *mtd, loff_t from, size_t len,
315 size_t *retlen, void **virt, resource_size_t *phys)
317 struct mtd_part *part = PART(mtd);
319 return part->master->_point(part->master, from + part->offset, len,
323 static int part_unpoint(struct mtd_info *mtd, loff_t from, size_t len)
325 struct mtd_part *part = PART(mtd);
327 return part->master->_unpoint(part->master, from + part->offset, len);
331 static unsigned long part_get_unmapped_area(struct mtd_info *mtd,
333 unsigned long offset,
336 struct mtd_part *part = PART(mtd);
338 offset += part->offset;
339 return part->master->_get_unmapped_area(part->master, len, offset,
343 static int part_read_oob(struct mtd_info *mtd, loff_t from,
344 struct mtd_oob_ops *ops)
346 struct mtd_part *part = PART(mtd);
349 if (from >= mtd->size)
351 if (ops->datbuf && from + ops->len > mtd->size)
355 * If OOB is also requested, make sure that we do not read past the end
361 if (ops->mode == MTD_OPS_AUTO_OOB)
365 pages = mtd_div_by_ws(mtd->size, mtd);
366 pages -= mtd_div_by_ws(from, mtd);
367 if (ops->ooboffs + ops->ooblen > pages * len)
371 res = part->master->_read_oob(part->master, from + part->offset, ops);
373 if (mtd_is_bitflip(res))
374 mtd->ecc_stats.corrected++;
375 if (mtd_is_eccerr(res))
376 mtd->ecc_stats.failed++;
381 static int part_read_user_prot_reg(struct mtd_info *mtd, loff_t from,
382 size_t len, size_t *retlen, u_char *buf)
384 struct mtd_part *part = PART(mtd);
385 return part->master->_read_user_prot_reg(part->master, from, len,
389 static int part_get_user_prot_info(struct mtd_info *mtd, size_t len,
390 size_t *retlen, struct otp_info *buf)
392 struct mtd_part *part = PART(mtd);
393 return part->master->_get_user_prot_info(part->master, len, retlen,
397 static int part_read_fact_prot_reg(struct mtd_info *mtd, loff_t from,
398 size_t len, size_t *retlen, u_char *buf)
400 struct mtd_part *part = PART(mtd);
401 return part->master->_read_fact_prot_reg(part->master, from, len,
405 static int part_get_fact_prot_info(struct mtd_info *mtd, size_t len,
406 size_t *retlen, struct otp_info *buf)
408 struct mtd_part *part = PART(mtd);
409 return part->master->_get_fact_prot_info(part->master, len, retlen,
413 static int part_write(struct mtd_info *mtd, loff_t to, size_t len,
414 size_t *retlen, const u_char *buf)
416 struct mtd_part *part = PART(mtd);
417 return part->master->_write(part->master, to + part->offset, len,
421 static int part_panic_write(struct mtd_info *mtd, loff_t to, size_t len,
422 size_t *retlen, const u_char *buf)
424 struct mtd_part *part = PART(mtd);
425 return part->master->_panic_write(part->master, to + part->offset, len,
429 static int part_write_oob(struct mtd_info *mtd, loff_t to,
430 struct mtd_oob_ops *ops)
432 struct mtd_part *part = PART(mtd);
436 if (ops->datbuf && to + ops->len > mtd->size)
438 return part->master->_write_oob(part->master, to + part->offset, ops);
441 static int part_write_user_prot_reg(struct mtd_info *mtd, loff_t from,
442 size_t len, size_t *retlen, u_char *buf)
444 struct mtd_part *part = PART(mtd);
445 return part->master->_write_user_prot_reg(part->master, from, len,
449 static int part_lock_user_prot_reg(struct mtd_info *mtd, loff_t from,
452 struct mtd_part *part = PART(mtd);
453 return part->master->_lock_user_prot_reg(part->master, from, len);
457 static int part_writev(struct mtd_info *mtd, const struct kvec *vecs,
458 unsigned long count, loff_t to, size_t *retlen)
460 struct mtd_part *part = PART(mtd);
461 return part->master->_writev(part->master, vecs, count,
462 to + part->offset, retlen);
466 static int part_erase(struct mtd_info *mtd, struct erase_info *instr)
468 struct mtd_part *part = PART(mtd);
471 instr->addr += part->offset;
472 ret = part->master->_erase(part->master, instr);
474 if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN)
475 instr->fail_addr -= part->offset;
476 instr->addr -= part->offset;
481 void mtd_erase_callback(struct erase_info *instr)
483 if (instr->mtd->_erase == part_erase) {
484 struct mtd_part *part = PART(instr->mtd);
486 if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN)
487 instr->fail_addr -= part->offset;
488 instr->addr -= part->offset;
491 instr->callback(instr);
493 EXPORT_SYMBOL_GPL(mtd_erase_callback);
495 static int part_lock(struct mtd_info *mtd, loff_t ofs, uint64_t len)
497 struct mtd_part *part = PART(mtd);
498 return part->master->_lock(part->master, ofs + part->offset, len);
501 static int part_unlock(struct mtd_info *mtd, loff_t ofs, uint64_t len)
503 struct mtd_part *part = PART(mtd);
504 return part->master->_unlock(part->master, ofs + part->offset, len);
507 static int part_is_locked(struct mtd_info *mtd, loff_t ofs, uint64_t len)
509 struct mtd_part *part = PART(mtd);
510 return part->master->_is_locked(part->master, ofs + part->offset, len);
513 static void part_sync(struct mtd_info *mtd)
515 struct mtd_part *part = PART(mtd);
516 part->master->_sync(part->master);
520 static int part_suspend(struct mtd_info *mtd)
522 struct mtd_part *part = PART(mtd);
523 return part->master->_suspend(part->master);
526 static void part_resume(struct mtd_info *mtd)
528 struct mtd_part *part = PART(mtd);
529 part->master->_resume(part->master);
533 static int part_block_isreserved(struct mtd_info *mtd, loff_t ofs)
535 struct mtd_part *part = PART(mtd);
537 return part->master->_block_isreserved(part->master, ofs);
540 static int part_block_isbad(struct mtd_info *mtd, loff_t ofs)
542 struct mtd_part *part = PART(mtd);
544 return part->master->_block_isbad(part->master, ofs);
547 static int part_block_markbad(struct mtd_info *mtd, loff_t ofs)
549 struct mtd_part *part = PART(mtd);
553 res = part->master->_block_markbad(part->master, ofs);
555 mtd->ecc_stats.badblocks++;
559 static inline void free_partition(struct mtd_part *p)
566 * This function unregisters and destroy all slave MTD objects which are
567 * attached to the given master MTD object.
570 int del_mtd_partitions(struct mtd_info *master)
572 struct mtd_part *slave, *next;
575 debug("Deleting MTD partitions on \"%s\":\n", master->name);
577 mutex_lock(&mtd_partitions_mutex);
578 list_for_each_entry_safe(slave, next, &mtd_partitions, list)
579 if (slave->master == master) {
580 ret = del_mtd_device(&slave->mtd);
585 list_del(&slave->list);
586 free_partition(slave);
588 mutex_unlock(&mtd_partitions_mutex);
593 static struct mtd_part *allocate_partition(struct mtd_info *master,
594 const struct mtd_partition *part, int partno,
597 struct mtd_part *slave;
600 /* allocate the partition structure */
601 slave = kzalloc(sizeof(*slave), GFP_KERNEL);
602 name = kstrdup(part->name, GFP_KERNEL);
603 if (!name || !slave) {
604 printk(KERN_ERR"memory allocation error while creating partitions for \"%s\"\n",
608 return ERR_PTR(-ENOMEM);
611 /* set up the MTD object for this partition */
612 slave->mtd.type = master->type;
613 slave->mtd.flags = master->flags & ~part->mask_flags;
614 slave->mtd.size = part->size;
615 slave->mtd.writesize = master->writesize;
616 slave->mtd.writebufsize = master->writebufsize;
617 slave->mtd.oobsize = master->oobsize;
618 slave->mtd.oobavail = master->oobavail;
619 slave->mtd.subpage_sft = master->subpage_sft;
621 slave->mtd.name = name;
622 slave->mtd.owner = master->owner;
624 slave->mtd.backing_dev_info = master->backing_dev_info;
626 /* NOTE: we don't arrange MTDs as a tree; it'd be error-prone
627 * to have the same data be in two different partitions.
629 slave->mtd.dev.parent = master->dev.parent;
633 slave->mtd._read = part_read;
635 slave->mtd._write = part_write;
637 if (master->_panic_write)
638 slave->mtd._panic_write = part_panic_write;
641 if (master->_point && master->_unpoint) {
642 slave->mtd._point = part_point;
643 slave->mtd._unpoint = part_unpoint;
647 if (master->_get_unmapped_area)
648 slave->mtd._get_unmapped_area = part_get_unmapped_area;
649 if (master->_read_oob)
650 slave->mtd._read_oob = part_read_oob;
651 if (master->_write_oob)
652 slave->mtd._write_oob = part_write_oob;
653 if (master->_read_user_prot_reg)
654 slave->mtd._read_user_prot_reg = part_read_user_prot_reg;
655 if (master->_read_fact_prot_reg)
656 slave->mtd._read_fact_prot_reg = part_read_fact_prot_reg;
657 if (master->_write_user_prot_reg)
658 slave->mtd._write_user_prot_reg = part_write_user_prot_reg;
659 if (master->_lock_user_prot_reg)
660 slave->mtd._lock_user_prot_reg = part_lock_user_prot_reg;
661 if (master->_get_user_prot_info)
662 slave->mtd._get_user_prot_info = part_get_user_prot_info;
663 if (master->_get_fact_prot_info)
664 slave->mtd._get_fact_prot_info = part_get_fact_prot_info;
666 slave->mtd._sync = part_sync;
668 if (!partno && !master->dev.class && master->_suspend &&
670 slave->mtd._suspend = part_suspend;
671 slave->mtd._resume = part_resume;
674 slave->mtd._writev = part_writev;
677 slave->mtd._lock = part_lock;
679 slave->mtd._unlock = part_unlock;
680 if (master->_is_locked)
681 slave->mtd._is_locked = part_is_locked;
682 if (master->_block_isreserved)
683 slave->mtd._block_isreserved = part_block_isreserved;
684 if (master->_block_isbad)
685 slave->mtd._block_isbad = part_block_isbad;
686 if (master->_block_markbad)
687 slave->mtd._block_markbad = part_block_markbad;
688 slave->mtd._erase = part_erase;
689 slave->master = master;
690 slave->offset = part->offset;
692 if (slave->offset == MTDPART_OFS_APPEND)
693 slave->offset = cur_offset;
694 if (slave->offset == MTDPART_OFS_NXTBLK) {
695 slave->offset = cur_offset;
696 if (mtd_mod_by_eb(cur_offset, master) != 0) {
697 /* Round up to next erasesize */
698 slave->offset = (mtd_div_by_eb(cur_offset, master) + 1) * master->erasesize;
699 debug("Moving partition %d: "
700 "0x%012llx -> 0x%012llx\n", partno,
701 (unsigned long long)cur_offset, (unsigned long long)slave->offset);
704 if (slave->offset == MTDPART_OFS_RETAIN) {
705 slave->offset = cur_offset;
706 if (master->size - slave->offset >= slave->mtd.size) {
707 slave->mtd.size = master->size - slave->offset
710 debug("mtd partition \"%s\" doesn't have enough space: %#llx < %#llx, disabled\n",
711 part->name, master->size - slave->offset,
713 /* register to preserve ordering */
717 if (slave->mtd.size == MTDPART_SIZ_FULL)
718 slave->mtd.size = master->size - slave->offset;
720 debug("0x%012llx-0x%012llx : \"%s\"\n", (unsigned long long)slave->offset,
721 (unsigned long long)(slave->offset + slave->mtd.size), slave->mtd.name);
723 /* let's do some sanity checks */
724 if (slave->offset >= master->size) {
725 /* let's register it anyway to preserve ordering */
728 printk(KERN_ERR"mtd: partition \"%s\" is out of reach -- disabled\n",
732 if (slave->offset + slave->mtd.size > master->size) {
733 slave->mtd.size = master->size - slave->offset;
734 printk(KERN_WARNING"mtd: partition \"%s\" extends beyond the end of device \"%s\" -- size truncated to %#llx\n",
735 part->name, master->name, (unsigned long long)slave->mtd.size);
737 if (master->numeraseregions > 1) {
738 /* Deal with variable erase size stuff */
739 int i, max = master->numeraseregions;
740 u64 end = slave->offset + slave->mtd.size;
741 struct mtd_erase_region_info *regions = master->eraseregions;
743 /* Find the first erase regions which is part of this
745 for (i = 0; i < max && regions[i].offset <= slave->offset; i++)
747 /* The loop searched for the region _behind_ the first one */
751 /* Pick biggest erasesize */
752 for (; i < max && regions[i].offset < end; i++) {
753 if (slave->mtd.erasesize < regions[i].erasesize) {
754 slave->mtd.erasesize = regions[i].erasesize;
757 BUG_ON(slave->mtd.erasesize == 0);
759 /* Single erase size */
760 slave->mtd.erasesize = master->erasesize;
763 if ((slave->mtd.flags & MTD_WRITEABLE) &&
764 mtd_mod_by_eb(slave->offset, &slave->mtd)) {
765 /* Doesn't start on a boundary of major erase size */
766 /* FIXME: Let it be writable if it is on a boundary of
767 * _minor_ erase size though */
768 slave->mtd.flags &= ~MTD_WRITEABLE;
769 printk(KERN_WARNING"mtd: partition \"%s\" doesn't start on an erase block boundary -- force read-only\n",
772 if ((slave->mtd.flags & MTD_WRITEABLE) &&
773 mtd_mod_by_eb(slave->mtd.size, &slave->mtd)) {
774 slave->mtd.flags &= ~MTD_WRITEABLE;
775 printk(KERN_WARNING"mtd: partition \"%s\" doesn't end on an erase block -- force read-only\n",
779 slave->mtd.ecclayout = master->ecclayout;
780 slave->mtd.ecc_step_size = master->ecc_step_size;
781 slave->mtd.ecc_strength = master->ecc_strength;
782 slave->mtd.bitflip_threshold = master->bitflip_threshold;
784 if (master->_block_isbad) {
787 while (offs < slave->mtd.size) {
788 if (mtd_block_isbad(master, offs + slave->offset))
789 slave->mtd.ecc_stats.badblocks++;
790 offs += slave->mtd.erasesize;
799 int mtd_add_partition(struct mtd_info *master, const char *name,
800 long long offset, long long length)
802 struct mtd_partition part;
803 struct mtd_part *p, *new;
807 /* the direct offset is expected */
808 if (offset == MTDPART_OFS_APPEND ||
809 offset == MTDPART_OFS_NXTBLK)
812 if (length == MTDPART_SIZ_FULL)
813 length = master->size - offset;
820 part.offset = offset;
822 part.ecclayout = NULL;
824 new = allocate_partition(master, &part, -1, offset);
829 end = offset + length;
831 mutex_lock(&mtd_partitions_mutex);
832 list_for_each_entry(p, &mtd_partitions, list)
833 if (p->master == master) {
834 if ((start >= p->offset) &&
835 (start < (p->offset + p->mtd.size)))
838 if ((end >= p->offset) &&
839 (end < (p->offset + p->mtd.size)))
843 list_add(&new->list, &mtd_partitions);
844 mutex_unlock(&mtd_partitions_mutex);
846 add_mtd_device(&new->mtd);
850 mutex_unlock(&mtd_partitions_mutex);
854 EXPORT_SYMBOL_GPL(mtd_add_partition);
856 int mtd_del_partition(struct mtd_info *master, int partno)
858 struct mtd_part *slave, *next;
861 mutex_lock(&mtd_partitions_mutex);
862 list_for_each_entry_safe(slave, next, &mtd_partitions, list)
863 if ((slave->master == master) &&
864 (slave->mtd.index == partno)) {
865 ret = del_mtd_device(&slave->mtd);
869 list_del(&slave->list);
870 free_partition(slave);
873 mutex_unlock(&mtd_partitions_mutex);
877 EXPORT_SYMBOL_GPL(mtd_del_partition);
881 * This function, given a master MTD object and a partition table, creates
882 * and registers slave MTD objects which are bound to the master according to
883 * the partition definitions.
885 * We don't register the master, or expect the caller to have done so,
886 * for reasons of data integrity.
889 int add_mtd_partitions(struct mtd_info *master,
890 const struct mtd_partition *parts,
893 struct mtd_part *slave;
894 uint64_t cur_offset = 0;
899 * Need to init the list here, since LIST_INIT() does not
900 * work on platforms where relocation has problems (like MIPS
903 if (mtd_partitions.next == NULL)
904 INIT_LIST_HEAD(&mtd_partitions);
907 debug("Creating %d MTD partitions on \"%s\":\n", nbparts, master->name);
909 for (i = 0; i < nbparts; i++) {
910 slave = allocate_partition(master, parts + i, i, cur_offset);
912 return PTR_ERR(slave);
914 mutex_lock(&mtd_partitions_mutex);
915 list_add(&slave->list, &mtd_partitions);
916 mutex_unlock(&mtd_partitions_mutex);
918 add_mtd_device(&slave->mtd);
920 cur_offset = slave->offset + slave->mtd.size;
927 static DEFINE_SPINLOCK(part_parser_lock);
928 static LIST_HEAD(part_parsers);
930 static struct mtd_part_parser *get_partition_parser(const char *name)
932 struct mtd_part_parser *p, *ret = NULL;
934 spin_lock(&part_parser_lock);
936 list_for_each_entry(p, &part_parsers, list)
937 if (!strcmp(p->name, name) && try_module_get(p->owner)) {
942 spin_unlock(&part_parser_lock);
947 #define put_partition_parser(p) do { module_put((p)->owner); } while (0)
949 void register_mtd_parser(struct mtd_part_parser *p)
951 spin_lock(&part_parser_lock);
952 list_add(&p->list, &part_parsers);
953 spin_unlock(&part_parser_lock);
955 EXPORT_SYMBOL_GPL(register_mtd_parser);
957 void deregister_mtd_parser(struct mtd_part_parser *p)
959 spin_lock(&part_parser_lock);
961 spin_unlock(&part_parser_lock);
963 EXPORT_SYMBOL_GPL(deregister_mtd_parser);
966 * Do not forget to update 'parse_mtd_partitions()' kerneldoc comment if you
967 * are changing this array!
969 static const char * const default_mtd_part_types[] = {
976 * parse_mtd_partitions - parse MTD partitions
977 * @master: the master partition (describes whole MTD device)
978 * @types: names of partition parsers to try or %NULL
979 * @pparts: array of partitions found is returned here
980 * @data: MTD partition parser-specific data
982 * This function tries to find partition on MTD device @master. It uses MTD
983 * partition parsers, specified in @types. However, if @types is %NULL, then
984 * the default list of parsers is used. The default list contains only the
985 * "cmdlinepart" and "ofpart" parsers ATM.
986 * Note: If there are more then one parser in @types, the kernel only takes the
987 * partitions parsed out by the first parser.
989 * This function may return:
990 * o a negative error code in case of failure
991 * o zero if no partitions were found
992 * o a positive number of found partitions, in which case on exit @pparts will
993 * point to an array containing this number of &struct mtd_info objects.
995 int parse_mtd_partitions(struct mtd_info *master, const char *const *types,
996 struct mtd_partition **pparts,
997 struct mtd_part_parser_data *data)
999 struct mtd_part_parser *parser;
1003 types = default_mtd_part_types;
1005 for ( ; ret <= 0 && *types; types++) {
1006 parser = get_partition_parser(*types);
1007 if (!parser && !request_module("%s", *types))
1008 parser = get_partition_parser(*types);
1011 ret = (*parser->parse_fn)(master, pparts, data);
1012 put_partition_parser(parser);
1014 printk(KERN_NOTICE "%d %s partitions found on MTD device %s\n",
1015 ret, parser->name, master->name);
1023 int mtd_is_partition(const struct mtd_info *mtd)
1025 struct mtd_part *part;
1028 mutex_lock(&mtd_partitions_mutex);
1029 list_for_each_entry(part, &mtd_partitions, list)
1030 if (&part->mtd == mtd) {
1034 mutex_unlock(&mtd_partitions_mutex);
1038 EXPORT_SYMBOL_GPL(mtd_is_partition);
1040 /* Returns the size of the entire flash chip */
1041 uint64_t mtd_get_device_size(const struct mtd_info *mtd)
1043 if (!mtd_is_partition(mtd))
1046 return PART(mtd)->master->size;
1048 EXPORT_SYMBOL_GPL(mtd_get_device_size);