Lines Matching refs:part
35 const struct mtd_partition *part,
42 parent->part.size : parent->size;
50 name = kstrdup(part->name, GFP_KERNEL);
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;
84 child->dev.of_node = part->of_node;
86 child->part.offset = part->offset;
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,
124 if (child->part.offset >= parent_size) {
126 child->part.offset = 0;
127 child->part.size = 0;
132 part->name);
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;
147 /* Find the first erase regions which is part of this
149 for (i = 0; i < max && regions[i].offset <= child->part.offset;
183 part->name);
186 tmp = mtd_get_master_ofs(child, 0) + child->part.size;
191 part->name);
194 child->size = child->part.size;
202 while (offs < child->part.size) {
220 return snprintf(buf, PAGE_SIZE, "%lld\n", mtd->part.offset);
244 parent->part.size : parent->size;
245 struct mtd_partition part;
260 memset(&part, 0, sizeof(part));
261 part.name = name;
262 part.size = length;
263 part.offset = offset;
265 child = allocate_partition(parent, &part, -1, offset);
270 list_add_tail(&child->part.node, &parent->partitions);
283 list_del(&child->part.node);
304 list_for_each_entry_safe(child, next, &mtd->partitions, part.node) {
316 list_del(&mtd->part.node);
332 list_for_each_entry_safe(child, next, &mtd->partitions, part.node) {
345 list_del(&child->part.node);
372 list_for_each_entry(child, &mtd->partitions, part.node) {
412 list_add_tail(&child->part.node, &parent->partitions);
418 list_del(&child->part.node);
430 cur_offset = child->part.offset + child->part.size;