2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Simple MTD partitioning layer
|
|
|
|
*
|
|
|
|
* (C) 2000 Nicolas Pitre <nico@cam.org>
|
|
|
|
*
|
|
|
|
* This code is GPL
|
|
|
|
*
|
2005-11-07 12:15:26 +01:00
|
|
|
* $Id: mtdpart.c,v 1.55 2005/11/07 11:14:20 gleixner Exp $
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* 02-21-2002 Thomas Gleixner <gleixner@autronix.de>
|
|
|
|
* added support for read_oob, write_oob
|
2005-11-07 12:15:26 +01:00
|
|
|
*/
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/kmod.h>
|
|
|
|
#include <linux/mtd/mtd.h>
|
|
|
|
#include <linux/mtd/partitions.h>
|
|
|
|
#include <linux/mtd/compatmac.h>
|
|
|
|
|
|
|
|
/* Our partition linked list */
|
|
|
|
static LIST_HEAD(mtd_partitions);
|
|
|
|
|
|
|
|
/* Our partition node structure */
|
|
|
|
struct mtd_part {
|
|
|
|
struct mtd_info mtd;
|
|
|
|
struct mtd_info *master;
|
|
|
|
u_int32_t offset;
|
|
|
|
int index;
|
|
|
|
struct list_head list;
|
|
|
|
int registered;
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Given a pointer to the MTD object in the mtd_part structure, we can retrieve
|
|
|
|
* the pointer to that structure with this macro.
|
|
|
|
*/
|
|
|
|
#define PART(x) ((struct mtd_part *)(x))
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
|
|
|
|
/*
|
2005-04-17 00:20:36 +02:00
|
|
|
* MTD methods which simply translate the effective address and pass through
|
|
|
|
* to the _real_ device.
|
|
|
|
*/
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
static int part_read (struct mtd_info *mtd, loff_t from, size_t len,
|
2005-04-17 00:20:36 +02:00
|
|
|
size_t *retlen, u_char *buf)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2006-05-30 00:37:34 +02:00
|
|
|
int res;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (from >= mtd->size)
|
|
|
|
len = 0;
|
|
|
|
else if (from + len > mtd->size)
|
|
|
|
len = mtd->size - from;
|
2006-05-30 00:37:34 +02:00
|
|
|
res = part->master->read (part->master, from + part->offset,
|
2006-05-23 17:21:03 +02:00
|
|
|
len, retlen, buf);
|
2006-05-30 00:37:34 +02:00
|
|
|
if (unlikely(res)) {
|
|
|
|
if (res == -EUCLEAN)
|
|
|
|
mtd->ecc_stats.corrected++;
|
|
|
|
if (res == -EBADMSG)
|
|
|
|
mtd->ecc_stats.failed++;
|
|
|
|
}
|
|
|
|
return res;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
static int part_point (struct mtd_info *mtd, loff_t from, size_t len,
|
2005-04-17 00:20:36 +02:00
|
|
|
size_t *retlen, u_char **buf)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
if (from >= mtd->size)
|
|
|
|
len = 0;
|
|
|
|
else if (from + len > mtd->size)
|
|
|
|
len = mtd->size - from;
|
2005-11-07 12:15:26 +01:00
|
|
|
return part->master->point (part->master, from + part->offset,
|
2005-04-17 00:20:36 +02:00
|
|
|
len, retlen, buf);
|
|
|
|
}
|
2006-05-23 17:21:03 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static void part_unpoint (struct mtd_info *mtd, u_char *addr, loff_t from, size_t len)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
|
|
|
|
part->master->unpoint (part->master, addr, from + part->offset, len);
|
|
|
|
}
|
|
|
|
|
2006-05-29 03:26:58 +02:00
|
|
|
static int part_read_oob(struct mtd_info *mtd, loff_t from,
|
|
|
|
struct mtd_oob_ops *ops)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2006-05-30 00:37:34 +02:00
|
|
|
int res;
|
2006-05-29 03:26:58 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (from >= mtd->size)
|
2006-05-29 03:26:58 +02:00
|
|
|
return -EINVAL;
|
2006-11-03 16:20:38 +01:00
|
|
|
if (ops->datbuf && from + ops->len > mtd->size)
|
2006-05-29 03:26:58 +02:00
|
|
|
return -EINVAL;
|
2006-05-30 00:37:34 +02:00
|
|
|
res = part->master->read_oob(part->master, from + part->offset, ops);
|
|
|
|
|
|
|
|
if (unlikely(res)) {
|
|
|
|
if (res == -EUCLEAN)
|
|
|
|
mtd->ecc_stats.corrected++;
|
|
|
|
if (res == -EBADMSG)
|
|
|
|
mtd->ecc_stats.failed++;
|
|
|
|
}
|
|
|
|
return res;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
static int part_read_user_prot_reg (struct mtd_info *mtd, loff_t from, size_t len,
|
2005-04-17 00:20:36 +02:00
|
|
|
size_t *retlen, u_char *buf)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2005-11-07 12:15:26 +01:00
|
|
|
return part->master->read_user_prot_reg (part->master, from,
|
2005-04-17 00:20:36 +02:00
|
|
|
len, retlen, buf);
|
|
|
|
}
|
|
|
|
|
2005-02-08 18:11:19 +01:00
|
|
|
static int part_get_user_prot_info (struct mtd_info *mtd,
|
|
|
|
struct otp_info *buf, size_t len)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
return part->master->get_user_prot_info (part->master, buf, len);
|
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
static int part_read_fact_prot_reg (struct mtd_info *mtd, loff_t from, size_t len,
|
2005-04-17 00:20:36 +02:00
|
|
|
size_t *retlen, u_char *buf)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2005-11-07 12:15:26 +01:00
|
|
|
return part->master->read_fact_prot_reg (part->master, from,
|
2005-04-17 00:20:36 +02:00
|
|
|
len, retlen, buf);
|
|
|
|
}
|
|
|
|
|
2005-02-08 18:11:19 +01:00
|
|
|
static int part_get_fact_prot_info (struct mtd_info *mtd,
|
|
|
|
struct otp_info *buf, size_t len)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
return part->master->get_fact_prot_info (part->master, buf, len);
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static int part_write (struct mtd_info *mtd, loff_t to, size_t len,
|
|
|
|
size_t *retlen, const u_char *buf)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
if (!(mtd->flags & MTD_WRITEABLE))
|
|
|
|
return -EROFS;
|
|
|
|
if (to >= mtd->size)
|
|
|
|
len = 0;
|
|
|
|
else if (to + len > mtd->size)
|
|
|
|
len = mtd->size - to;
|
2006-05-23 17:21:03 +02:00
|
|
|
return part->master->write (part->master, to + part->offset,
|
|
|
|
len, retlen, buf);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2006-05-29 03:26:58 +02:00
|
|
|
static int part_write_oob(struct mtd_info *mtd, loff_t to,
|
|
|
|
struct mtd_oob_ops *ops)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2006-05-29 03:26:58 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!(mtd->flags & MTD_WRITEABLE))
|
|
|
|
return -EROFS;
|
2006-05-29 03:26:58 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (to >= mtd->size)
|
2006-05-29 03:26:58 +02:00
|
|
|
return -EINVAL;
|
2006-11-03 16:20:38 +01:00
|
|
|
if (ops->datbuf && to + ops->len > mtd->size)
|
2006-05-29 03:26:58 +02:00
|
|
|
return -EINVAL;
|
|
|
|
return part->master->write_oob(part->master, to + part->offset, ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
static int part_write_user_prot_reg (struct mtd_info *mtd, loff_t from, size_t len,
|
2005-04-17 00:20:36 +02:00
|
|
|
size_t *retlen, u_char *buf)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2005-11-07 12:15:26 +01:00
|
|
|
return part->master->write_user_prot_reg (part->master, from,
|
2005-04-17 00:20:36 +02:00
|
|
|
len, retlen, buf);
|
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
static int part_lock_user_prot_reg (struct mtd_info *mtd, loff_t from, size_t len)
|
2005-02-08 18:11:19 +01:00
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
return part->master->lock_user_prot_reg (part->master, from, len);
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static int part_writev (struct mtd_info *mtd, const struct kvec *vecs,
|
|
|
|
unsigned long count, loff_t to, size_t *retlen)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
if (!(mtd->flags & MTD_WRITEABLE))
|
|
|
|
return -EROFS;
|
2006-05-23 16:06:03 +02:00
|
|
|
return part->master->writev (part->master, vecs, count,
|
2005-04-17 00:20:36 +02:00
|
|
|
to + part->offset, retlen);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int part_erase (struct mtd_info *mtd, struct erase_info *instr)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
int ret;
|
|
|
|
if (!(mtd->flags & MTD_WRITEABLE))
|
|
|
|
return -EROFS;
|
|
|
|
if (instr->addr >= mtd->size)
|
|
|
|
return -EINVAL;
|
|
|
|
instr->addr += part->offset;
|
|
|
|
ret = part->master->erase(part->master, instr);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mtd_erase_callback(struct erase_info *instr)
|
|
|
|
{
|
|
|
|
if (instr->mtd->erase == part_erase) {
|
|
|
|
struct mtd_part *part = PART(instr->mtd);
|
|
|
|
|
|
|
|
if (instr->fail_addr != 0xffffffff)
|
|
|
|
instr->fail_addr -= part->offset;
|
|
|
|
instr->addr -= part->offset;
|
|
|
|
}
|
|
|
|
if (instr->callback)
|
|
|
|
instr->callback(instr);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mtd_erase_callback);
|
|
|
|
|
|
|
|
static int part_lock (struct mtd_info *mtd, loff_t ofs, size_t len)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2005-11-07 12:15:26 +01:00
|
|
|
if ((len + ofs) > mtd->size)
|
2005-04-17 00:20:36 +02:00
|
|
|
return -EINVAL;
|
|
|
|
return part->master->lock(part->master, ofs + part->offset, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int part_unlock (struct mtd_info *mtd, loff_t ofs, size_t len)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2005-11-07 12:15:26 +01:00
|
|
|
if ((len + ofs) > mtd->size)
|
2005-04-17 00:20:36 +02:00
|
|
|
return -EINVAL;
|
|
|
|
return part->master->unlock(part->master, ofs + part->offset, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void part_sync(struct mtd_info *mtd)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
part->master->sync(part->master);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int part_suspend(struct mtd_info *mtd)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
return part->master->suspend(part->master);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void part_resume(struct mtd_info *mtd)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
part->master->resume(part->master);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int part_block_isbad (struct mtd_info *mtd, loff_t ofs)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
|
|
|
if (ofs >= mtd->size)
|
|
|
|
return -EINVAL;
|
|
|
|
ofs += part->offset;
|
|
|
|
return part->master->block_isbad(part->master, ofs);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int part_block_markbad (struct mtd_info *mtd, loff_t ofs)
|
|
|
|
{
|
|
|
|
struct mtd_part *part = PART(mtd);
|
2006-05-30 00:37:34 +02:00
|
|
|
int res;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!(mtd->flags & MTD_WRITEABLE))
|
|
|
|
return -EROFS;
|
|
|
|
if (ofs >= mtd->size)
|
|
|
|
return -EINVAL;
|
|
|
|
ofs += part->offset;
|
2006-05-30 00:37:34 +02:00
|
|
|
res = part->master->block_markbad(part->master, ofs);
|
|
|
|
if (!res)
|
|
|
|
mtd->ecc_stats.badblocks++;
|
|
|
|
return res;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
/*
|
|
|
|
* This function unregisters and destroy all slave MTD objects which are
|
2005-04-17 00:20:36 +02:00
|
|
|
* attached to the given master MTD object.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int del_mtd_partitions(struct mtd_info *master)
|
|
|
|
{
|
|
|
|
struct list_head *node;
|
|
|
|
struct mtd_part *slave;
|
|
|
|
|
|
|
|
for (node = mtd_partitions.next;
|
|
|
|
node != &mtd_partitions;
|
|
|
|
node = node->next) {
|
|
|
|
slave = list_entry(node, struct mtd_part, list);
|
|
|
|
if (slave->master == master) {
|
|
|
|
struct list_head *prev = node->prev;
|
|
|
|
__list_del(prev, node->next);
|
|
|
|
if(slave->registered)
|
|
|
|
del_mtd_device(&slave->mtd);
|
|
|
|
kfree(slave);
|
|
|
|
node = prev;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function, given a master MTD object and a partition table, creates
|
|
|
|
* and registers slave MTD objects which are bound to the master according to
|
|
|
|
* the partition definitions.
|
|
|
|
* (Q: should we register the master MTD object as well?)
|
|
|
|
*/
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
int add_mtd_partitions(struct mtd_info *master,
|
2005-04-17 00:20:36 +02:00
|
|
|
const struct mtd_partition *parts,
|
|
|
|
int nbparts)
|
|
|
|
{
|
|
|
|
struct mtd_part *slave;
|
|
|
|
u_int32_t cur_offset = 0;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
printk (KERN_NOTICE "Creating %d MTD partitions on \"%s\":\n", nbparts, master->name);
|
|
|
|
|
|
|
|
for (i = 0; i < nbparts; i++) {
|
|
|
|
|
|
|
|
/* allocate the partition structure */
|
2006-11-15 20:10:29 +01:00
|
|
|
slave = kzalloc (sizeof(*slave), GFP_KERNEL);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!slave) {
|
|
|
|
printk ("memory allocation error while creating partitions for \"%s\"\n",
|
|
|
|
master->name);
|
|
|
|
del_mtd_partitions(master);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
list_add(&slave->list, &mtd_partitions);
|
|
|
|
|
|
|
|
/* set up the MTD object for this partition */
|
|
|
|
slave->mtd.type = master->type;
|
|
|
|
slave->mtd.flags = master->flags & ~parts[i].mask_flags;
|
|
|
|
slave->mtd.size = parts[i].size;
|
2006-05-22 23:18:05 +02:00
|
|
|
slave->mtd.writesize = master->writesize;
|
2005-04-17 00:20:36 +02:00
|
|
|
slave->mtd.oobsize = master->oobsize;
|
|
|
|
slave->mtd.ecctype = master->ecctype;
|
|
|
|
slave->mtd.eccsize = master->eccsize;
|
|
|
|
|
|
|
|
slave->mtd.name = parts[i].name;
|
|
|
|
slave->mtd.bank_size = master->bank_size;
|
|
|
|
slave->mtd.owner = master->owner;
|
|
|
|
|
|
|
|
slave->mtd.read = part_read;
|
|
|
|
slave->mtd.write = part_write;
|
|
|
|
|
|
|
|
if(master->point && master->unpoint){
|
|
|
|
slave->mtd.point = part_point;
|
|
|
|
slave->mtd.unpoint = part_unpoint;
|
|
|
|
}
|
2005-11-07 12:15:26 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (master->read_oob)
|
|
|
|
slave->mtd.read_oob = part_read_oob;
|
|
|
|
if (master->write_oob)
|
|
|
|
slave->mtd.write_oob = part_write_oob;
|
|
|
|
if(master->read_user_prot_reg)
|
|
|
|
slave->mtd.read_user_prot_reg = part_read_user_prot_reg;
|
|
|
|
if(master->read_fact_prot_reg)
|
|
|
|
slave->mtd.read_fact_prot_reg = part_read_fact_prot_reg;
|
|
|
|
if(master->write_user_prot_reg)
|
|
|
|
slave->mtd.write_user_prot_reg = part_write_user_prot_reg;
|
2005-02-08 18:11:19 +01:00
|
|
|
if(master->lock_user_prot_reg)
|
|
|
|
slave->mtd.lock_user_prot_reg = part_lock_user_prot_reg;
|
|
|
|
if(master->get_user_prot_info)
|
|
|
|
slave->mtd.get_user_prot_info = part_get_user_prot_info;
|
|
|
|
if(master->get_fact_prot_info)
|
|
|
|
slave->mtd.get_fact_prot_info = part_get_fact_prot_info;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (master->sync)
|
|
|
|
slave->mtd.sync = part_sync;
|
|
|
|
if (!i && master->suspend && master->resume) {
|
|
|
|
slave->mtd.suspend = part_suspend;
|
|
|
|
slave->mtd.resume = part_resume;
|
|
|
|
}
|
|
|
|
if (master->writev)
|
|
|
|
slave->mtd.writev = part_writev;
|
|
|
|
if (master->lock)
|
|
|
|
slave->mtd.lock = part_lock;
|
|
|
|
if (master->unlock)
|
|
|
|
slave->mtd.unlock = part_unlock;
|
|
|
|
if (master->block_isbad)
|
|
|
|
slave->mtd.block_isbad = part_block_isbad;
|
|
|
|
if (master->block_markbad)
|
|
|
|
slave->mtd.block_markbad = part_block_markbad;
|
|
|
|
slave->mtd.erase = part_erase;
|
|
|
|
slave->master = master;
|
|
|
|
slave->offset = parts[i].offset;
|
|
|
|
slave->index = i;
|
|
|
|
|
|
|
|
if (slave->offset == MTDPART_OFS_APPEND)
|
|
|
|
slave->offset = cur_offset;
|
|
|
|
if (slave->offset == MTDPART_OFS_NXTBLK) {
|
2005-09-30 16:49:12 +02:00
|
|
|
slave->offset = cur_offset;
|
|
|
|
if ((cur_offset % master->erasesize) != 0) {
|
|
|
|
/* Round up to next erasesize */
|
|
|
|
slave->offset = ((cur_offset / master->erasesize) + 1) * master->erasesize;
|
2005-04-17 00:20:36 +02:00
|
|
|
printk(KERN_NOTICE "Moving partition %d: "
|
|
|
|
"0x%08x -> 0x%08x\n", i,
|
|
|
|
cur_offset, slave->offset);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (slave->mtd.size == MTDPART_SIZ_FULL)
|
|
|
|
slave->mtd.size = master->size - slave->offset;
|
|
|
|
cur_offset = slave->offset + slave->mtd.size;
|
2005-11-07 12:15:26 +01:00
|
|
|
|
|
|
|
printk (KERN_NOTICE "0x%08x-0x%08x : \"%s\"\n", slave->offset,
|
2005-04-17 00:20:36 +02:00
|
|
|
slave->offset + slave->mtd.size, slave->mtd.name);
|
|
|
|
|
|
|
|
/* let's do some sanity checks */
|
|
|
|
if (slave->offset >= master->size) {
|
|
|
|
/* let's register it anyway to preserve ordering */
|
|
|
|
slave->offset = 0;
|
|
|
|
slave->mtd.size = 0;
|
|
|
|
printk ("mtd: partition \"%s\" is out of reach -- disabled\n",
|
|
|
|
parts[i].name);
|
|
|
|
}
|
|
|
|
if (slave->offset + slave->mtd.size > master->size) {
|
|
|
|
slave->mtd.size = master->size - slave->offset;
|
|
|
|
printk ("mtd: partition \"%s\" extends beyond the end of device \"%s\" -- size truncated to %#x\n",
|
|
|
|
parts[i].name, master->name, slave->mtd.size);
|
|
|
|
}
|
|
|
|
if (master->numeraseregions>1) {
|
|
|
|
/* Deal with variable erase size stuff */
|
|
|
|
int i;
|
|
|
|
struct mtd_erase_region_info *regions = master->eraseregions;
|
2005-11-07 12:15:26 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/* Find the first erase regions which is part of this partition. */
|
|
|
|
for (i=0; i < master->numeraseregions && slave->offset >= regions[i].offset; i++)
|
|
|
|
;
|
|
|
|
|
|
|
|
for (i--; i < master->numeraseregions && slave->offset + slave->mtd.size > regions[i].offset; i++) {
|
|
|
|
if (slave->mtd.erasesize < regions[i].erasesize) {
|
|
|
|
slave->mtd.erasesize = regions[i].erasesize;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* Single erase size */
|
|
|
|
slave->mtd.erasesize = master->erasesize;
|
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
if ((slave->mtd.flags & MTD_WRITEABLE) &&
|
2005-04-17 00:20:36 +02:00
|
|
|
(slave->offset % slave->mtd.erasesize)) {
|
|
|
|
/* Doesn't start on a boundary of major erase size */
|
|
|
|
/* FIXME: Let it be writable if it is on a boundary of _minor_ erase size though */
|
|
|
|
slave->mtd.flags &= ~MTD_WRITEABLE;
|
|
|
|
printk ("mtd: partition \"%s\" doesn't start on an erase block boundary -- force read-only\n",
|
|
|
|
parts[i].name);
|
|
|
|
}
|
2005-11-07 12:15:26 +01:00
|
|
|
if ((slave->mtd.flags & MTD_WRITEABLE) &&
|
2005-04-17 00:20:36 +02:00
|
|
|
(slave->mtd.size % slave->mtd.erasesize)) {
|
|
|
|
slave->mtd.flags &= ~MTD_WRITEABLE;
|
|
|
|
printk ("mtd: partition \"%s\" doesn't end on an erase block -- force read-only\n",
|
|
|
|
parts[i].name);
|
|
|
|
}
|
|
|
|
|
2006-05-27 22:16:10 +02:00
|
|
|
slave->mtd.ecclayout = master->ecclayout;
|
2006-05-30 00:37:34 +02:00
|
|
|
if (master->block_isbad) {
|
|
|
|
uint32_t offs = 0;
|
|
|
|
|
|
|
|
while(offs < slave->mtd.size) {
|
|
|
|
if (master->block_isbad(master,
|
|
|
|
offs + slave->offset))
|
|
|
|
slave->mtd.ecc_stats.badblocks++;
|
|
|
|
offs += slave->mtd.erasesize;
|
|
|
|
}
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if(parts[i].mtdp)
|
|
|
|
{ /* store the object pointer (caller may or may not register it */
|
|
|
|
*parts[i].mtdp = &slave->mtd;
|
|
|
|
slave->registered = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* register our partition */
|
|
|
|
add_mtd_device(&slave->mtd);
|
|
|
|
slave->registered = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(add_mtd_partitions);
|
|
|
|
EXPORT_SYMBOL(del_mtd_partitions);
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(part_parser_lock);
|
|
|
|
static LIST_HEAD(part_parsers);
|
|
|
|
|
|
|
|
static struct mtd_part_parser *get_partition_parser(const char *name)
|
|
|
|
{
|
|
|
|
struct list_head *this;
|
|
|
|
void *ret = NULL;
|
|
|
|
spin_lock(&part_parser_lock);
|
|
|
|
|
|
|
|
list_for_each(this, &part_parsers) {
|
|
|
|
struct mtd_part_parser *p = list_entry(this, struct mtd_part_parser, list);
|
|
|
|
|
|
|
|
if (!strcmp(p->name, name) && try_module_get(p->owner)) {
|
|
|
|
ret = p;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
spin_unlock(&part_parser_lock);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int register_mtd_parser(struct mtd_part_parser *p)
|
|
|
|
{
|
|
|
|
spin_lock(&part_parser_lock);
|
|
|
|
list_add(&p->list, &part_parsers);
|
|
|
|
spin_unlock(&part_parser_lock);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int deregister_mtd_parser(struct mtd_part_parser *p)
|
|
|
|
{
|
|
|
|
spin_lock(&part_parser_lock);
|
|
|
|
list_del(&p->list);
|
|
|
|
spin_unlock(&part_parser_lock);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-11-07 12:15:26 +01:00
|
|
|
int parse_mtd_partitions(struct mtd_info *master, const char **types,
|
2005-04-17 00:20:36 +02:00
|
|
|
struct mtd_partition **pparts, unsigned long origin)
|
|
|
|
{
|
|
|
|
struct mtd_part_parser *parser;
|
|
|
|
int ret = 0;
|
2005-11-07 12:15:26 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
for ( ; ret <= 0 && *types; types++) {
|
|
|
|
parser = get_partition_parser(*types);
|
|
|
|
#ifdef CONFIG_KMOD
|
|
|
|
if (!parser && !request_module("%s", *types))
|
|
|
|
parser = get_partition_parser(*types);
|
|
|
|
#endif
|
|
|
|
if (!parser) {
|
|
|
|
printk(KERN_NOTICE "%s partition parsing not available\n",
|
|
|
|
*types);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
ret = (*parser->parse_fn)(master, pparts, origin);
|
|
|
|
if (ret > 0) {
|
2005-11-07 12:15:26 +01:00
|
|
|
printk(KERN_NOTICE "%d %s partitions found on MTD device %s\n",
|
2005-04-17 00:20:36 +02:00
|
|
|
ret, parser->name, master->name);
|
|
|
|
}
|
|
|
|
put_partition_parser(parser);
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL_GPL(parse_mtd_partitions);
|
|
|
|
EXPORT_SYMBOL_GPL(register_mtd_parser);
|
|
|
|
EXPORT_SYMBOL_GPL(deregister_mtd_parser);
|
|
|
|
|
|
|
|
MODULE_LICENSE("GPL");
|
|
|
|
MODULE_AUTHOR("Nicolas Pitre <nico@cam.org>");
|
|
|
|
MODULE_DESCRIPTION("Generic support for partitioning of MTD devices");
|
|
|
|
|