Lines Matching refs:num_parts
85 static int num_parts, disp_unit_cyl, dos_flag, dev_fd = 3;
205 sector_t first[num_parts], last_seen_val = 0;
210 for (i = 0; i < num_parts; i++) {
246 if (num_parts >= 60) {
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;
258 if (num_parts > 4) offset += local_start_off;
259 partitions[num_parts].start_offset = offset;
266 num_parts++; //extended partions present.
323 for (; i < num_parts; i++) free(partitions[i].sec_buffer);
331 num_parts = 4;
387 for (i = 0; i < num_parts; i++) {
467 for (i = 0; i < num_parts; i++) {
520 num_parts = 4; //max of primaries in a part table
524 for (i = 0; i < num_parts; i++) {
589 for (looper = 4; looper < num_parts; looper++) {
600 num_parts = 4;
605 if (num_parts > i+1) {
627 for (; looper < num_parts; looper++)
629 num_parts--;
633 static int ask_partition(int num_parts)
638 xprintf("Partition (%u - %u):", 1, num_parts);
642 if (val > 0 && val <= num_parts) return val;
668 for (i = 3; i < num_parts; i++) {
680 for (i = 4; i < num_parts; i++) free(partitions[i].sec_buffer);
696 return ask_partition(num_parts)-1;
801 for (i = start_index; i < num_parts; i++) {
824 for (i = 0; i < num_parts; i++)
838 for (i = start_index; i < num_parts; i++)
877 for (i = 0; i < num_parts; i++)
882 for (i = 0; i < num_parts; i++) {
917 sector_t start, end, begin_sec[num_parts], end_sec[num_parts];
925 for (i = 0; i < num_parts; i++) {
973 num_parts = 5;
981 if (num_parts > 5 || !is_partition_clear(partitions[4].part)) {
982 pe = &partitions[num_parts];
987 num_parts++;
988 if (!add_partition(num_parts - 1, LINUX_NATIVE)) {
989 num_parts--;
993 else add_partition(num_parts -1, LINUX_NATIVE);
1007 if (!free_part && num_parts >= 60) {
1045 i = ask_partition(num_parts);
1085 sector_t begin_sec[num_parts], end_sec[num_parts], total = 1;
1089 for (i = 0; i < num_parts; i++) {
1101 for (i = 0; i < num_parts; i++) {
1125 for (i = 4; i < num_parts; i++) {
1129 if (i != 4 || i + 1 < num_parts)
1178 for (i = 3; i < num_parts; i++) {
1197 for (i = 0; i < num_parts; i++) {
1220 sector_t first[num_parts], min;
1225 for (i = 0; i < num_parts; i++) {
1251 for (i = 5; i < num_parts; i++) {
1252 for (j = 5; j < num_parts - 1; j++) {
1267 for (i = 4; i < num_parts; i++) {
1268 for (j = 4; j < num_parts - 1; j++) {
1285 for (j = 4; j < num_parts; j++) partitions[j].modified = 1;
1336 idx = ask_partition(num_parts);
1424 for (i = 4; i < num_parts; i++)
1449 num_parts = 4;
1497 p = ask_partition(num_parts);
1507 p = get_non_free_partition(num_parts); //4 was here
