⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 mtdpart.c

📁 linux和2410结合开发 用他可以生成2410所需的zImage文件
💻 C
📖 第 1 页 / 共 2 页
字号:
	part->master->resume(part->master);}/*  * This function unregisters and destroy all slave MTD objects which are  * 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?) */int add_mtd_partitions(struct mtd_info *master, 		       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 */		slave = kmalloc (sizeof(*slave), GFP_KERNEL);		if (!slave) {			printk ("memory allocation error while creating partitions for \"%s\"\n",				master->name);			del_mtd_partitions(master);			return -ENOMEM;		}		memset(slave, 0, sizeof(*slave));		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;		slave->mtd.oobblock = master->oobblock;		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;		}				if (master->read_ecc)			slave->mtd.read_ecc = part_read_ecc;		if (master->write_ecc)			slave->mtd.write_ecc = part_write_ecc;		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;		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->readv)			slave->mtd.readv = part_readv;		if (master->writev_ecc)			slave->mtd.writev_ecc = part_writev_ecc;		if (master->readv_ecc)			slave->mtd.readv_ecc = part_readv_ecc;		if (master->lock)			slave->mtd.lock = part_lock;		if (master->unlock)			slave->mtd.unlock = part_unlock;		slave->mtd.erase = part_erase;		slave->master = master;		slave->offset = parts[i].offset;		slave->index = i;		if (parts[i].oobsel) // BUSHI			memcpy(&slave->mtd.oobinfo, parts[i].oobsel, sizeof(struct nand_oobinfo));		if (slave->offset == MTDPART_OFS_APPEND)			slave->offset = cur_offset;		if (slave->offset == MTDPART_OFS_NXTBLK) {			u_int32_t emask = master->erasesize-1;			slave->offset = (cur_offset + emask) & ~emask;			if (slave->offset != cur_offset) {				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;			printk (KERN_NOTICE "0x%08x-0x%08x : \"%s\"\n", slave->offset, 			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;						/* 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;		}		if ((slave->mtd.flags & MTD_WRITEABLE) && 		    (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);		}		if ((slave->mtd.flags & MTD_WRITEABLE) && 		    (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);		}		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 spinlock_t part_parser_lock = SPIN_LOCK_UNLOCKED;static LIST_HEAD(part_parsers);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;}int parse_mtd_partitions(struct mtd_info *master, const char **types, 			 struct mtd_partition **pparts, unsigned long origin){	struct mtd_part_parser *parser;	int ret = 0;			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) {			printk(KERN_NOTICE "%d %s partitions found on MTD device %s\n", 			       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");

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -