Lines Matching refs:child
43 struct mtd_info *child;
49 child = kzalloc(sizeof(*child), GFP_KERNEL);
51 if (!name || !child) {
55 kfree(child);
60 child->type = parent->type;
61 child->part.flags = parent->flags & ~part->mask_flags;
62 child->part.flags |= part->add_flags;
63 child->flags = child->part.flags;
64 child->part.size = part->size;
65 child->writesize = parent->writesize;
66 child->writebufsize = parent->writebufsize;
67 child->oobsize = parent->oobsize;
68 child->oobavail = parent->oobavail;
69 child->subpage_sft = parent->subpage_sft;
71 child->name = name;
72 child->owner = parent->owner;
82 child->dev.parent = IS_ENABLED(CONFIG_MTD_PARTITIONED_MASTER) || mtd_is_partition(parent) ?
84 child->dev.of_node = part->of_node;
85 child->parent = parent;
86 child->part.offset = part->offset;
87 INIT_LIST_HEAD(&child->partitions);
89 if (child->part.offset == MTDPART_OFS_APPEND)
90 child->part.offset = cur_offset;
91 if (child->part.offset == MTDPART_OFS_NXTBLK) {
93 child->part.offset = cur_offset;
96 child->part.offset += wr_alignment - remainder;
100 child->part.offset);
103 if (child->part.offset == MTDPART_OFS_RETAIN) {
104 child->part.offset = cur_offset;
105 if (parent_size - child->part.offset >= child->part.size) {
106 child->part.size = parent_size - child->part.offset -
107 child->part.size;
110 part->name, parent_size - child->part.offset,
111 child->part.size);
116 if (child->part.size == MTDPART_SIZ_FULL)
117 child->part.size = parent_size - child->part.offset;
120 child->part.offset, child->part.offset + child->part.size,
121 child->name);
124 if (child->part.offset >= parent_size) {
126 child->part.offset = 0;
127 child->part.size = 0;
130 child->erasesize = parent->erasesize;
135 if (child->part.offset + child->part.size > parent->size) {
136 child->part.size = parent_size - child->part.offset;
138 part->name, parent->name, child->part.size);
144 u64 end = child->part.offset + child->part.size;
149 for (i = 0; i < max && regions[i].offset <= child->part.offset;
158 if (child->erasesize < regions[i].erasesize)
159 child->erasesize = regions[i].erasesize;
161 BUG_ON(child->erasesize == 0);
164 child->erasesize = master->erasesize;
172 if (!(child->flags & MTD_NO_ERASE))
173 wr_alignment = child->erasesize;
175 tmp = mtd_get_master_ofs(child, 0);
177 if ((child->flags & MTD_WRITEABLE) && remainder) {
181 child->flags &= ~MTD_WRITEABLE;
186 tmp = mtd_get_master_ofs(child, 0) + child->part.size;
188 if ((child->flags & MTD_WRITEABLE) && remainder) {
189 child->flags &= ~MTD_WRITEABLE;
194 child->size = child->part.size;
195 child->ecc_step_size = parent->ecc_step_size;
196 child->ecc_strength = parent->ecc_strength;
197 child->bitflip_threshold = parent->bitflip_threshold;
202 while (offs < child->part.size) {
203 if (mtd_block_isreserved(child, offs))
204 child->ecc_stats.bbtblocks++;
205 else if (mtd_block_isbad(child, offs))
206 child->ecc_stats.badblocks++;
207 offs += child->erasesize;
212 return child;
246 struct mtd_info *child;
265 child = allocate_partition(parent, &part, -1, offset);
266 if (IS_ERR(child))
267 return PTR_ERR(child);
270 list_add_tail(&child->part.node, &parent->partitions);
273 ret = add_mtd_device(child);
277 mtd_add_partition_attrs(child);
283 list_del(&child->part.node);
286 free_partition(child);
301 struct mtd_info *child, *next;
304 list_for_each_entry_safe(child, next, &mtd->partitions, part.node) {
305 err = __mtd_del_partition(child);
328 struct mtd_info *child, *next;
332 list_for_each_entry_safe(child, next, &mtd->partitions, part.node) {
333 if (mtd_has_partitions(child))
334 __del_mtd_partitions(child);
336 pr_info("Deleting %s MTD partition\n", child->name);
337 ret = del_mtd_device(child);
340 child->name, ret);
345 list_del(&child->part.node);
346 free_partition(child);
368 struct mtd_info *child, *master = mtd_get_master(mtd);
372 list_for_each_entry(child, &mtd->partitions, part.node) {
373 if (child->index == partno) {
374 ret = __mtd_del_partition(child);
386 * and registers the child MTD objects which are bound to the parent according
397 struct mtd_info *child, *master = mtd_get_master(parent);
405 child = allocate_partition(parent, parts + i, i, cur_offset);
406 if (IS_ERR(child)) {
407 ret = PTR_ERR(child);
412 list_add_tail(&child->part.node, &parent->partitions);
415 ret = add_mtd_device(child);
418 list_del(&child->part.node);
421 free_partition(child);
425 mtd_add_partition_attrs(child);
428 parse_mtd_partitions(child, parts[i].types, NULL);
430 cur_offset = child->part.offset + child->part.size;