Lines Matching defs:partitions
1 /* fdisk.c - fdisk program to modify partitions on disk.
89 struct part_entry partitions[PARTITION_MAX];
212 pe = &partitions[i];
241 q = p = partitions[idx].part;
247 xprintf("Warning: deleting partitions after 60\n");
249 partitions[num_parts-1].modified = 1;
254 partitions[num_parts].part = part_offset(sec_buf, 0);
255 partitions[num_parts].sec_buffer = sec_buf;
259 partitions[num_parts].start_offset = offset;
303 struct part_entry *pe = &partitions[i];
323 for (; i < num_parts; i++) free(partitions[i].sec_buffer);
335 partitions[0].modified = 1;
388 if (IS_EXTENDED(partitions[i].part->sys_ind)) {
468 p = partitions[i].part;
472 start_sec = swap_le32toh(p->start4) + partitions[i].start_offset;
525 partitions[i].part = part_offset(MBRbuf, i);
526 partitions[i].sec_buffer = MBRbuf;
527 partitions[i].modified = 0;
528 partitions[i].start_offset = 0;
569 * if only logical, then move the later partitions backwards 1 step
576 struct part_entry *pe = &partitions[i];
590 pe = &partitions[looper];
604 partitions[i].modified = 1;
606 q = partitions[i + 1].part;
608 ext_p = part_offset(partitions[i].sec_buffer, 1);
609 ext_q = part_offset(partitions[i + 1].sec_buffer, 1);
612 new_start = partitions[i + 1].start_offset + swap_le32toh(q->start4) - extended_offset;
616 memset(partitions[i].part, 0, sizeof(struct partition));
620 ext_p = part_offset(partitions[i-1].sec_buffer, 1);
621 ext_q = part_offset(partitions[i].sec_buffer, 1);
623 partitions[i-1].modified = 1;
628 partitions[looper-1] = partitions[looper];
649 struct partition *p = partitions[i].part;
655 partitions[i].modified = 1;
666 if (partitions[i].modified) partitions[3].modified = 1;
669 pe = &partitions[i];
680 for (i = 4; i < num_parts; i++) free(partitions[i].sec_buffer);
694 if (!is_partition_clear(partitions[i].part)) {
713 if (is_partition_clear(partitions[i].part)) {
720 xprintf("All primary partitions have been defined already!\n");
883 struct part_entry *pe = &partitions[i];
918 struct part_entry *pe = &partitions[idx];
926 pe = &partitions[i];
941 pe = &partitions[idx];
959 p = partitions[idx-1].part + 1; //extended pointer for logical partitions
965 partitions[idx-1].modified = 1;
968 pe = &partitions[4];
981 if (num_parts > 5 || !is_partition_clear(partitions[4].part)) {
982 pe = &partitions[num_parts];
997 * MAX partitions limit is taken to be 60, can be changed
1005 for (i = 0; i < 4; i++) if(is_partition_clear(partitions[i].part)) free_part++;
1008 xprintf("The maximum number of partitions has been created\n");
1046 pe = &partitions[i-1];
1090 pe = &partitions[i];
1102 pe = &partitions[i];
1121 struct part_entry *pex = &partitions[ext_idx];
1127 p = partitions[i].part;
1148 struct part_entry *pe = &partitions[idx];
1179 pe = &partitions[i];
1198 pe = &partitions[i];
1226 pe = &partitions[i];
1239 py = partitions[j+1].part;
1240 px = partitions[j].part;
1247 partitions[j].modified = 1;
1253 oj = partitions[j].start_offset;
1254 ojj = partitions[j+1].start_offset;
1256 partitions[j].start_offset = ojj;
1257 partitions[j+1].start_offset = oj;
1258 pj = partitions[j].part;
1260 pjj = partitions[j+1].part;
1262 set_levalue((partitions[j-1].part+1)->start4, ojj-extended_offset);
1263 set_levalue((partitions[j].part+1)->start4, oj-extended_offset);
1269 pj = partitions[j].part;
1270 pjj = partitions[j+1].part;
1273 oj = partitions[j].start_offset;
1274 ojj = partitions[j+1].start_offset;
1285 for (j = 4; j < num_parts; j++) partitions[j].modified = 1;
1313 "e\tlist extended partitions\n"
1352 case 'e': //list extended partitions
1425 memset(&partitions[i], 0, sizeof(struct part_entry));
1438 /* Read proc/partitions and then print the details
1439 * for partitions on each device
1445 FILE* fp = xfopen("/proc/partitions", "r");
