drivers/mtd/mtdpart.c

37 	WARN_ON(!list_empty(&mtd->part.node));
42 					   const struct mtd_partition *part,
49 			  parent->part.size : parent->size;
57 	name = kstrdup(part->name, GFP_KERNEL);
68 	child->part.flags = parent->flags & ~part->mask_flags;
69 	child->part.flags |= part->add_flags;
70 	child->flags = child->part.flags;
71 	child->part.size = part->size;
91 	child->dev.of_node = part->of_node;
93 	child->part.offset = part->offset;
96 	if (child->part.offset == MTDPART_OFS_APPEND)
97 		child->part.offset = cur_offset;
98 	if (child->part.offset == MTDPART_OFS_NXTBLK) {
100 		child->part.offset = cur_offset;
103 			child->part.offset += wr_alignment - remainder;
107 			       child->part.offset);
110 	if (child->part.offset == MTDPART_OFS_RETAIN) {
111 		child->part.offset = cur_offset;
112 		if (parent_size - child->part.offset >= child->part.size) {
113 			child->part.size = parent_size - child->part.offset -
114 					   child->part.size;
117 				part->name, parent_size - child->part.offset,
118 				child->part.size);
123 	if (child->part.size == MTDPART_SIZ_FULL)
124 		child->part.size = parent_size - child->part.offset;
127 	       child->part.offset, child->part.offset + child->part.size,
131 	if (child->part.offset >= parent_size) {
133 		child->part.offset = 0;
134 		child->part.size = 0;
139 			part->name);
142 	if (child->part.offset + child->part.size > parent->size) {
143 		child->part.size = parent_size - child->part.offset;
145 			part->name, parent->name, child->part.size);
151 		u64 end = child->part.offset + child->part.size;
154 		/* Find the first erase regions which is part of this
156 		for (i = 0; i < max && regions[i].offset <= child->part.offset;
190 			part->name);
193 	tmp = mtd_get_master_ofs(child, 0) + child->part.size;
198 			part->name);
201 	child->size = child->part.size;
209 		while (offs < child->part.size) {
227 	return sysfs_emit(buf, "%lld\n", mtd->part.offset);
250 			  parent->part.size : parent->size;
251 	struct mtd_partition part;
266 	memset(&part, 0, sizeof(part));
267 	part.name = name;
268 	part.size = length;
269 	part.offset = offset;
271 	child = allocate_partition(parent, &part, -1, offset);
276 	list_add_tail(&child->part.node, &parent->partitions);
289 	list_del(&child->part.node);
310 	list_for_each_entry_safe(child, next, &mtd->partitions, part.node) {
318 	list_del_init(&mtd->part.node);
335 	list_for_each_entry_safe(child, next, &mtd->partitions, part.node) {
340 		list_del_init(&child->part.node);
373 	list_for_each_entry(child, &mtd->partitions, part.node) {
413 		list_add_tail(&child->part.node, &parent->partitions);
419 			list_del(&child->part.node);
435 		cur_offset = child->part.offset + child->part.size;