| /* fdisk.c -- Partition table manipulator for Linux. |
| * |
| * Copyright (C) 1992 A. V. Le Blanc (LeBlanc@mcc.ac.uk) |
| * |
| * This program is free software. You can redistribute it and/or |
| * modify it under the terms of the GNU General Public License as |
| * published by the Free Software Foundation: either version 1 or |
| * (at your option) any later version. |
| */ |
| |
| #include <unistd.h> |
| #include <stdio.h> |
| #include <stdlib.h> |
| #include <string.h> |
| #include <fcntl.h> |
| #include <ctype.h> |
| #include <setjmp.h> |
| #include <errno.h> |
| #include <getopt.h> |
| #include <sys/stat.h> |
| #include <sys/time.h> |
| #include <time.h> |
| #include <limits.h> |
| |
| #include "nls.h" |
| #include "blkdev.h" |
| #include "common.h" |
| #include "fdisk.h" |
| #include "wholedisk.h" |
| |
| #include "fdisksunlabel.h" |
| #include "fdisksgilabel.h" |
| #include "fdiskaixlabel.h" |
| #include "fdiskmaclabel.h" |
| |
| #ifdef HAVE_LINUX_COMPILER_H |
| #include <linux/compiler.h> |
| #endif |
| #ifdef HAVE_LINUX_BLKPG_H |
| #include <linux/blkpg.h> |
| #endif |
| #ifdef HAVE_LIBBLKID_INTERNAL |
| #include <blkid.h> |
| #endif |
| |
| #include "gpt.h" |
| |
| static void delete_partition(int i); |
| |
| #define hex_val(c) ({ \ |
| char _c = (c); \ |
| isdigit(_c) ? _c - '0' : \ |
| tolower(_c) + 10 - 'a'; \ |
| }) |
| |
| |
| #define LINE_LENGTH 800 |
| #define pt_offset(b, n) ((struct partition *)((b) + 0x1be + \ |
| (n) * sizeof(struct partition))) |
| #define sector(s) ((s) & 0x3f) |
| #define cylinder(s, c) ((c) | (((s) & 0xc0) << 2)) |
| |
| #define hsc2sector(h,s,c) (sector(s) - 1 + sectors * \ |
| ((h) + heads * cylinder(s,c))) |
| #define set_hsc(h,s,c,sector) { \ |
| s = sector % sectors + 1; \ |
| sector /= sectors; \ |
| h = sector % heads; \ |
| sector /= heads; \ |
| c = sector & 0xff; \ |
| s |= (sector >> 2) & 0xc0; \ |
| } |
| |
| /* A valid partition table sector ends in 0x55 0xaa */ |
| static unsigned int |
| part_table_flag(unsigned char *b) { |
| return ((unsigned int) b[510]) + (((unsigned int) b[511]) << 8); |
| } |
| |
| int |
| valid_part_table_flag(unsigned char *b) { |
| return (b[510] == 0x55 && b[511] == 0xaa); |
| } |
| |
| static void |
| write_part_table_flag(unsigned char *b) { |
| b[510] = 0x55; |
| b[511] = 0xaa; |
| } |
| |
| /* start_sect and nr_sects are stored little endian on all machines */ |
| /* moreover, they are not aligned correctly */ |
| static void |
| store4_little_endian(unsigned char *cp, unsigned int val) { |
| cp[0] = (val & 0xff); |
| cp[1] = ((val >> 8) & 0xff); |
| cp[2] = ((val >> 16) & 0xff); |
| cp[3] = ((val >> 24) & 0xff); |
| } |
| |
| static unsigned int |
| read4_little_endian(const unsigned char *cp) { |
| return (unsigned int)(cp[0]) + ((unsigned int)(cp[1]) << 8) |
| + ((unsigned int)(cp[2]) << 16) |
| + ((unsigned int)(cp[3]) << 24); |
| } |
| |
| static void |
| set_start_sect(struct partition *p, unsigned int start_sect) { |
| store4_little_endian(p->start4, start_sect); |
| } |
| |
| unsigned long long |
| get_start_sect(struct partition *p) { |
| return read4_little_endian(p->start4); |
| } |
| |
| static void |
| set_nr_sects(struct partition *p, unsigned long long nr_sects) { |
| store4_little_endian(p->size4, nr_sects); |
| } |
| |
| unsigned long long |
| get_nr_sects(struct partition *p) { |
| return read4_little_endian(p->size4); |
| } |
| |
| static ssize_t |
| xread(int fd, void *buf, size_t count) { |
| char *p = buf; |
| ssize_t out = 0; |
| ssize_t rv; |
| |
| while (count) { |
| rv = read(fd, p, count); |
| if (rv == -1) { |
| if (errno == EINTR || errno == EAGAIN) |
| continue; |
| return out ? out : -1; /* Error */ |
| } else if (rv == 0) { |
| return out; /* EOF */ |
| } |
| |
| p += rv; |
| out += rv; |
| count -= rv; |
| } |
| |
| return out; |
| } |
| |
| static unsigned int |
| get_random_id(void) { |
| int fd; |
| unsigned int v; |
| ssize_t rv = -1; |
| struct timeval tv; |
| |
| fd = open("/dev/urandom", O_RDONLY); |
| if (fd >= 0) { |
| rv = xread(fd, &v, sizeof v); |
| close(fd); |
| } |
| |
| if (rv == sizeof v) |
| return v; |
| |
| /* Fallback: sucks, but better than nothing */ |
| gettimeofday(&tv, NULL); |
| return (unsigned int)(tv.tv_sec + (tv.tv_usec << 12) + getpid()); |
| } |
| |
| /* normally O_RDWR, -l option gives O_RDONLY */ |
| static int type_open = O_RDWR; |
| |
| /* |
| * Raw disk label. For DOS-type partition tables the MBR, |
| * with descriptions of the primary partitions. |
| */ |
| unsigned char *MBRbuffer; |
| |
| /* |
| * per partition table entry data |
| * |
| * The four primary partitions have the same sectorbuffer (MBRbuffer) |
| * and have NULL ext_pointer. |
| * Each logical partition table entry has two pointers, one for the |
| * partition and one link to the next one. |
| */ |
| struct pte { |
| struct partition *part_table; /* points into sectorbuffer */ |
| struct partition *ext_pointer; /* points into sectorbuffer */ |
| char changed; /* boolean */ |
| unsigned long long offset; /* disk sector number */ |
| unsigned char *sectorbuffer; /* disk sector contents */ |
| } ptes[MAXIMUM_PARTS]; |
| |
| char *disk_device, /* must be specified */ |
| *line_ptr, /* interactive input */ |
| line_buffer[LINE_LENGTH]; |
| |
| int fd, /* the disk */ |
| ext_index, /* the prime extended partition */ |
| listing = 0, /* no aborts for fdisk -l */ |
| nowarn = 0, /* no warnings for fdisk -l/-s */ |
| dos_compatible_flag = ~0, |
| dos_changed = 0, |
| partitions = 4; /* maximum partition + 1 */ |
| |
| unsigned int user_cylinders, user_heads, user_sectors; |
| unsigned int pt_heads, pt_sectors; |
| unsigned int kern_heads, kern_sectors; |
| |
| unsigned long long sector_offset = 1, extended_offset = 0, sectors; |
| |
| unsigned int heads, |
| cylinders, |
| sector_size = DEFAULT_SECTOR_SIZE, |
| sector_factor = 1, |
| user_set_sector_size = 0, |
| units_per_sector = 1, |
| display_in_cyl_units = 1; |
| |
| unsigned long long total_number_of_sectors; /* (!) 512-byte sectors */ |
| unsigned long grain = DEFAULT_SECTOR_SIZE, |
| io_size = DEFAULT_SECTOR_SIZE, |
| min_io_size = DEFAULT_SECTOR_SIZE, |
| phy_sector_size = DEFAULT_SECTOR_SIZE, |
| alignment_offset; |
| int has_topology; |
| |
| #define dos_label (!sun_label && !sgi_label && !aix_label && !mac_label && !osf_label) |
| int sun_label = 0; /* looking at sun disklabel */ |
| int sgi_label = 0; /* looking at sgi disklabel */ |
| int aix_label = 0; /* looking at aix disklabel */ |
| int osf_label = 0; /* looking at OSF/1 disklabel */ |
| int mac_label = 0; /* looking at mac disklabel */ |
| int possibly_osf_label = 0; |
| |
| jmp_buf listingbuf; |
| |
| void fatal(enum failure why) { |
| char error[LINE_LENGTH], |
| *message = error; |
| int rc = EXIT_FAILURE; |
| |
| if (listing) { |
| close(fd); |
| longjmp(listingbuf, 1); |
| } |
| |
| switch (why) { |
| case help: |
| rc = EXIT_SUCCESS; |
| case usage: message = _( |
| "Usage:\n" |
| " fdisk [options] <disk> change partition table\n" |
| " fdisk [options] -l <disk> list partition table(s)\n" |
| " fdisk -s <partition> give partition size(s) in blocks\n" |
| "\nOptions:\n" |
| " -b <size> sector size (512, 1024, 2048 or 4096)\n" |
| " -c switch off DOS-compatible mode\n" |
| " -h print help\n" |
| " -u <size> give sizes in sectors instead of cylinders\n" |
| " -v print version\n" |
| " -C <number> specify the number of cylinders\n" |
| " -H <number> specify the number of heads\n" |
| " -S <number> specify the number of sectors per track\n" |
| "\n"); |
| break; |
| case unable_to_open: |
| snprintf(error, sizeof(error), |
| _("Unable to open %s\n"), disk_device); |
| break; |
| case unable_to_read: |
| snprintf(error, sizeof(error), |
| _("Unable to read %s\n"), disk_device); |
| break; |
| case unable_to_seek: |
| snprintf(error, sizeof(error), |
| _("Unable to seek on %s\n"),disk_device); |
| break; |
| case unable_to_write: |
| snprintf(error, sizeof(error), |
| _("Unable to write %s\n"), disk_device); |
| break; |
| case ioctl_error: |
| snprintf(error, sizeof(error), |
| _("BLKGETSIZE ioctl failed on %s\n"), |
| disk_device); |
| break; |
| case out_of_memory: |
| message = _("Unable to allocate any more memory\n"); |
| break; |
| default: |
| message = _("Fatal error\n"); |
| } |
| |
| fputc('\n', stderr); |
| fputs(message, stderr); |
| exit(rc); |
| } |
| |
| static void |
| seek_sector(int fd, unsigned long long secno) { |
| off_t offset = (off_t) secno * sector_size; |
| if (lseek(fd, offset, SEEK_SET) == (off_t) -1) |
| fatal(unable_to_seek); |
| } |
| |
| static void |
| read_sector(int fd, unsigned long long secno, unsigned char *buf) { |
| seek_sector(fd, secno); |
| if (read(fd, buf, sector_size) != sector_size) |
| fatal(unable_to_read); |
| } |
| |
| static void |
| write_sector(int fd, unsigned long long secno, unsigned char *buf) { |
| seek_sector(fd, secno); |
| if (write(fd, buf, sector_size) != sector_size) |
| fatal(unable_to_write); |
| } |
| |
| /* Allocate a buffer and read a partition table sector */ |
| static void |
| read_pte(int fd, int pno, unsigned long long offset) { |
| struct pte *pe = &ptes[pno]; |
| |
| pe->offset = offset; |
| pe->sectorbuffer = malloc(sector_size); |
| if (!pe->sectorbuffer) |
| fatal(out_of_memory); |
| read_sector(fd, offset, pe->sectorbuffer); |
| pe->changed = 0; |
| pe->part_table = pe->ext_pointer = NULL; |
| } |
| |
| static unsigned long long |
| get_partition_start(struct pte *pe) { |
| return pe->offset + get_start_sect(pe->part_table); |
| } |
| |
| struct partition * |
| get_part_table(int i) { |
| return ptes[i].part_table; |
| } |
| |
| void |
| set_all_unchanged(void) { |
| int i; |
| |
| for (i = 0; i < MAXIMUM_PARTS; i++) |
| ptes[i].changed = 0; |
| } |
| |
| void |
| set_changed(int i) { |
| ptes[i].changed = 1; |
| } |
| |
| static int |
| is_garbage_table(void) { |
| int i; |
| |
| for (i = 0; i < 4; i++) { |
| struct pte *pe = &ptes[i]; |
| struct partition *p = pe->part_table; |
| |
| if (p->boot_ind != 0 && p->boot_ind != 0x80) |
| return 1; |
| } |
| return 0; |
| } |
| |
| /* |
| * Avoid warning about DOS partitions when no DOS partition was changed. |
| * Here a heuristic "is probably dos partition". |
| * We might also do the opposite and warn in all cases except |
| * for "is probably nondos partition". |
| */ |
| static int |
| is_dos_partition(int t) { |
| return (t == 1 || t == 4 || t == 6 || |
| t == 0x0b || t == 0x0c || t == 0x0e || |
| t == 0x11 || t == 0x12 || t == 0x14 || t == 0x16 || |
| t == 0x1b || t == 0x1c || t == 0x1e || t == 0x24 || |
| t == 0xc1 || t == 0xc4 || t == 0xc6); |
| } |
| |
| static void |
| menu(void) { |
| if (sun_label) { |
| puts(_("Command action")); |
| puts(_(" a toggle a read only flag")); /* sun */ |
| puts(_(" b edit bsd disklabel")); |
| puts(_(" c toggle the mountable flag")); /* sun */ |
| puts(_(" d delete a partition")); |
| puts(_(" l list known partition types")); |
| puts(_(" m print this menu")); |
| puts(_(" n add a new partition")); |
| puts(_(" o create a new empty DOS partition table")); |
| puts(_(" p print the partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" s create a new empty Sun disklabel")); /* sun */ |
| puts(_(" t change a partition's system id")); |
| puts(_(" u change display/entry units")); |
| puts(_(" v verify the partition table")); |
| puts(_(" w write table to disk and exit")); |
| puts(_(" x extra functionality (experts only)")); |
| } |
| else if (sgi_label) { |
| puts(_("Command action")); |
| puts(_(" a select bootable partition")); /* sgi flavour */ |
| puts(_(" b edit bootfile entry")); /* sgi */ |
| puts(_(" c select sgi swap partition")); /* sgi flavour */ |
| puts(_(" d delete a partition")); |
| puts(_(" l list known partition types")); |
| puts(_(" m print this menu")); |
| puts(_(" n add a new partition")); |
| puts(_(" o create a new empty DOS partition table")); |
| puts(_(" p print the partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" s create a new empty Sun disklabel")); /* sun */ |
| puts(_(" t change a partition's system id")); |
| puts(_(" u change display/entry units")); |
| puts(_(" v verify the partition table")); |
| puts(_(" w write table to disk and exit")); |
| } |
| else if (aix_label || mac_label) { |
| puts(_("Command action")); |
| puts(_(" m print this menu")); |
| puts(_(" o create a new empty DOS partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" s create a new empty Sun disklabel")); /* sun */ |
| } |
| else { |
| puts(_("Command action")); |
| puts(_(" a toggle a bootable flag")); |
| puts(_(" b edit bsd disklabel")); |
| puts(_(" c toggle the dos compatibility flag")); |
| puts(_(" d delete a partition")); |
| puts(_(" l list known partition types")); |
| puts(_(" m print this menu")); |
| puts(_(" n add a new partition")); |
| puts(_(" o create a new empty DOS partition table")); |
| puts(_(" p print the partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" s create a new empty Sun disklabel")); /* sun */ |
| puts(_(" t change a partition's system id")); |
| puts(_(" u change display/entry units")); |
| puts(_(" v verify the partition table")); |
| puts(_(" w write table to disk and exit")); |
| puts(_(" x extra functionality (experts only)")); |
| } |
| } |
| |
| static void |
| xmenu(void) { |
| if (sun_label) { |
| puts(_("Command action")); |
| puts(_(" a change number of alternate cylinders")); /*sun*/ |
| puts(_(" c change number of cylinders")); |
| puts(_(" d print the raw data in the partition table")); |
| puts(_(" e change number of extra sectors per cylinder"));/*sun*/ |
| puts(_(" h change number of heads")); |
| puts(_(" i change interleave factor")); /*sun*/ |
| puts(_(" o change rotation speed (rpm)")); /*sun*/ |
| puts(_(" m print this menu")); |
| puts(_(" p print the partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" r return to main menu")); |
| puts(_(" s change number of sectors/track")); |
| puts(_(" v verify the partition table")); |
| puts(_(" w write table to disk and exit")); |
| puts(_(" y change number of physical cylinders")); /*sun*/ |
| } |
| else if (sgi_label) { |
| puts(_("Command action")); |
| puts(_(" b move beginning of data in a partition")); /* !sun */ |
| puts(_(" c change number of cylinders")); |
| puts(_(" d print the raw data in the partition table")); |
| puts(_(" e list extended partitions")); /* !sun */ |
| puts(_(" g create an IRIX (SGI) partition table"));/* sgi */ |
| puts(_(" h change number of heads")); |
| puts(_(" m print this menu")); |
| puts(_(" p print the partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" r return to main menu")); |
| puts(_(" s change number of sectors/track")); |
| puts(_(" v verify the partition table")); |
| puts(_(" w write table to disk and exit")); |
| } |
| else if (aix_label || mac_label) { |
| puts(_("Command action")); |
| puts(_(" b move beginning of data in a partition")); /* !sun */ |
| puts(_(" c change number of cylinders")); |
| puts(_(" d print the raw data in the partition table")); |
| puts(_(" e list extended partitions")); /* !sun */ |
| puts(_(" g create an IRIX (SGI) partition table"));/* sgi */ |
| puts(_(" h change number of heads")); |
| puts(_(" m print this menu")); |
| puts(_(" p print the partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" r return to main menu")); |
| puts(_(" s change number of sectors/track")); |
| puts(_(" v verify the partition table")); |
| puts(_(" w write table to disk and exit")); |
| } |
| else { |
| puts(_("Command action")); |
| puts(_(" b move beginning of data in a partition")); /* !sun */ |
| puts(_(" c change number of cylinders")); |
| puts(_(" d print the raw data in the partition table")); |
| puts(_(" e list extended partitions")); /* !sun */ |
| puts(_(" f fix partition order")); /* !sun, !aix, !sgi */ |
| puts(_(" g create an IRIX (SGI) partition table"));/* sgi */ |
| puts(_(" h change number of heads")); |
| puts(_(" i change the disk identifier")); /* dos only */ |
| puts(_(" m print this menu")); |
| puts(_(" p print the partition table")); |
| puts(_(" q quit without saving changes")); |
| puts(_(" r return to main menu")); |
| puts(_(" s change number of sectors/track")); |
| puts(_(" v verify the partition table")); |
| puts(_(" w write table to disk and exit")); |
| } |
| } |
| |
| static int |
| get_sysid(int i) { |
| return ( |
| sun_label ? sun_get_sysid(i) : |
| sgi_label ? sgi_get_sysid(i) : |
| ptes[i].part_table->sys_ind); |
| } |
| |
| static struct systypes * |
| get_sys_types(void) { |
| return ( |
| sun_label ? sun_sys_types : |
| sgi_label ? sgi_sys_types : |
| i386_sys_types); |
| } |
| |
| char *partition_type(unsigned char type) |
| { |
| int i; |
| struct systypes *types = get_sys_types(); |
| |
| for (i=0; types[i].name; i++) |
| if (types[i].type == type) |
| return _(types[i].name); |
| |
| return NULL; |
| } |
| |
| void list_types(struct systypes *sys) |
| { |
| unsigned int last[4], done = 0, next = 0, size; |
| int i; |
| |
| for (i = 0; sys[i].name; i++); |
| size = i; |
| |
| for (i = 3; i >= 0; i--) |
| last[3 - i] = done += (size + i - done) / (i + 1); |
| i = done = 0; |
| |
| do { |
| printf("%c%2x %-15.15s", i ? ' ' : '\n', |
| sys[next].type, _(sys[next].name)); |
| next = last[i++] + done; |
| if (i > 3 || next >= last[i]) { |
| i = 0; |
| next = ++done; |
| } |
| } while (done < last[0]); |
| putchar('\n'); |
| } |
| |
| static int |
| is_cleared_partition(struct partition *p) { |
| return !(!p || p->boot_ind || p->head || p->sector || p->cyl || |
| p->sys_ind || p->end_head || p->end_sector || p->end_cyl || |
| get_start_sect(p) || get_nr_sects(p)); |
| } |
| |
| static void |
| clear_partition(struct partition *p) { |
| if (!p) |
| return; |
| p->boot_ind = 0; |
| p->head = 0; |
| p->sector = 0; |
| p->cyl = 0; |
| p->sys_ind = 0; |
| p->end_head = 0; |
| p->end_sector = 0; |
| p->end_cyl = 0; |
| set_start_sect(p,0); |
| set_nr_sects(p,0); |
| } |
| |
| static void |
| set_partition(int i, int doext, unsigned long long start, |
| unsigned long long stop, int sysid) { |
| struct partition *p; |
| unsigned long long offset; |
| |
| if (doext) { |
| p = ptes[i].ext_pointer; |
| offset = extended_offset; |
| } else { |
| p = ptes[i].part_table; |
| offset = ptes[i].offset; |
| } |
| p->boot_ind = 0; |
| p->sys_ind = sysid; |
| set_start_sect(p, start - offset); |
| set_nr_sects(p, stop - start + 1); |
| if (dos_compatible_flag && (start/(sectors*heads) > 1023)) |
| start = heads*sectors*1024 - 1; |
| set_hsc(p->head, p->sector, p->cyl, start); |
| if (dos_compatible_flag && (stop/(sectors*heads) > 1023)) |
| stop = heads*sectors*1024 - 1; |
| set_hsc(p->end_head, p->end_sector, p->end_cyl, stop); |
| ptes[i].changed = 1; |
| } |
| |
| static int |
| test_c(char **m, char *mesg) { |
| int val = 0; |
| if (!*m) |
| fprintf(stderr, _("You must set")); |
| else { |
| fprintf(stderr, " %s", *m); |
| val = 1; |
| } |
| *m = mesg; |
| return val; |
| } |
| |
| #define alignment_required (grain != sector_size) |
| |
| static int |
| lba_is_aligned(unsigned long long lba) |
| { |
| unsigned int granularity = max(phy_sector_size, min_io_size); |
| unsigned long long offset = (lba << 9) & (granularity - 1); |
| |
| return !((granularity + alignment_offset - offset) & (granularity - 1)); |
| } |
| |
| #define ALIGN_UP 1 |
| #define ALIGN_DOWN 2 |
| #define ALIGN_NEAREST 3 |
| |
| static unsigned long long |
| align_lba(unsigned long long lba, int direction) |
| { |
| unsigned long long res; |
| |
| if (lba_is_aligned(lba)) |
| res = lba; |
| else { |
| unsigned long long sects_in_phy = grain / sector_size; |
| |
| if (lba < sector_offset) |
| res = sector_offset; |
| |
| else if (direction == ALIGN_UP) |
| res = ((lba + sects_in_phy) / sects_in_phy) * sects_in_phy; |
| |
| else if (direction == ALIGN_DOWN) |
| res = (lba / sects_in_phy) * sects_in_phy; |
| |
| else /* ALIGN_NEAREST */ |
| res = ((lba + sects_in_phy / 2) / sects_in_phy) * sects_in_phy; |
| |
| if (alignment_offset && !lba_is_aligned(res) && |
| res > alignment_offset / sector_size) { |
| /* |
| * apply alignment_offset |
| * |
| * On disk with alignment compensation physical blocks starts |
| * at LBA < 0 (usually LBA -1). It means we have to move LBA |
| * according the offset to be on the physical boundary. |
| */ |
| /* fprintf(stderr, "LBA: %llu apply alignment_offset\n", res); */ |
| res -= (max(phy_sector_size, min_io_size) - |
| alignment_offset) / sector_size; |
| |
| if (direction == ALIGN_UP && res < lba) |
| res += sects_in_phy; |
| } |
| } |
| |
| /*** |
| fprintf(stderr, "LBA %llu (%s) --align-(%s)--> %llu (%s)\n", |
| lba, |
| lba_is_aligned(lba) ? "OK" : "FALSE", |
| direction == ALIGN_UP ? "UP " : |
| direction == ALIGN_DOWN ? "DOWN " : "NEAREST", |
| res, |
| lba_is_aligned(res) ? "OK" : "FALSE"); |
| ***/ |
| return res; |
| } |
| |
| static unsigned long long |
| align_lba_in_range( unsigned long long lba, |
| unsigned long long start, |
| unsigned long long stop) |
| { |
| start = align_lba(start, ALIGN_UP); |
| stop = align_lba(stop, ALIGN_DOWN); |
| |
| lba = align_lba(lba, ALIGN_NEAREST); |
| |
| if (lba < start) |
| return start; |
| else if (lba > stop) |
| return stop; |
| return lba; |
| } |
| |
| static int |
| warn_geometry(void) { |
| char *m = NULL; |
| int prev = 0; |
| |
| if (sgi_label) /* cannot set cylinders etc anyway */ |
| return 0; |
| if (!heads) |
| prev = test_c(&m, _("heads")); |
| if (!sectors) |
| prev = test_c(&m, _("sectors")); |
| if (!cylinders) |
| prev = test_c(&m, _("cylinders")); |
| if (!m) |
| return 0; |
| fprintf(stderr, |
| _("%s%s.\nYou can do this from the extra functions menu.\n"), |
| prev ? _(" and ") : " ", m); |
| return 1; |
| } |
| |
| void update_units(void) |
| { |
| int cyl_units = heads * sectors; |
| |
| if (display_in_cyl_units && cyl_units) |
| units_per_sector = cyl_units; |
| else |
| units_per_sector = 1; /* in sectors */ |
| } |
| |
| static void |
| warn_limits(void) { |
| if (total_number_of_sectors > UINT_MAX && !nowarn) { |
| int giga = (total_number_of_sectors << 9) / 1000000000; |
| int hectogiga = (giga + 50) / 100; |
| |
| fprintf(stderr, _("\n" |
| "WARNING: The size of this disk is %d.%d TB (%llu bytes).\n" |
| "DOS partition table format can not be used on drives for volumes\n" |
| "larger than (%llu bytes) for %d-byte sectors. Use parted(1) and GUID \n" |
| "partition table format (GPT).\n\n"), |
| hectogiga / 10, hectogiga % 10, |
| total_number_of_sectors << 9, |
| (unsigned long long ) UINT_MAX * sector_size, |
| sector_size); |
| } |
| } |
| |
| static void |
| warn_alignment(void) { |
| if (nowarn) |
| return; |
| |
| if (sector_size != phy_sector_size) |
| fprintf(stderr, _("\n" |
| "The device presents a logical sector size that is smaller than\n" |
| "the physical sector size. Aligning to a physical sector (or optimal\n" |
| "I/O) size boundary is recommended, or performance may be impacted.\n")); |
| |
| if (dos_compatible_flag) { |
| fprintf(stderr, _("\n" |
| "WARNING: DOS-compatible mode is deprecated. It's strongly recommended to\n" |
| " switch off the mode (command 'c')")); |
| |
| if (display_in_cyl_units) |
| fprintf(stderr, _(" and change display units to\n" |
| " sectors (command 'u').\n")); |
| else |
| fprintf(stderr, ".\n"); |
| |
| } else if (display_in_cyl_units) |
| fprintf(stderr, _("\n" |
| "WARNING: cylinders as display units are deprecated. Use command 'u' to\n" |
| " change units to sectors.\n")); |
| |
| } |
| |
| static void |
| read_extended(int ext) { |
| int i; |
| struct pte *pex; |
| struct partition *p, *q; |
| |
| ext_index = ext; |
| pex = &ptes[ext]; |
| pex->ext_pointer = pex->part_table; |
| |
| p = pex->part_table; |
| if (!get_start_sect(p)) { |
| fprintf(stderr, |
| _("Bad offset in primary extended partition\n")); |
| return; |
| } |
| |
| while (IS_EXTENDED (p->sys_ind)) { |
| struct pte *pe = &ptes[partitions]; |
| |
| if (partitions >= MAXIMUM_PARTS) { |
| /* This is not a Linux restriction, but |
| this program uses arrays of size MAXIMUM_PARTS. |
| Do not try to `improve' this test. */ |
| struct pte *pre = &ptes[partitions-1]; |
| |
| fprintf(stderr, |
| _("Warning: omitting partitions after #%d.\n" |
| "They will be deleted " |
| "if you save this partition table.\n"), |
| partitions); |
| clear_partition(pre->ext_pointer); |
| pre->changed = 1; |
| return; |
| } |
| |
| read_pte(fd, partitions, extended_offset + get_start_sect(p)); |
| |
| if (!extended_offset) |
| extended_offset = get_start_sect(p); |
| |
| q = p = pt_offset(pe->sectorbuffer, 0); |
| for (i = 0; i < 4; i++, p++) if (get_nr_sects(p)) { |
| if (IS_EXTENDED (p->sys_ind)) { |
| if (pe->ext_pointer) |
| fprintf(stderr, |
| _("Warning: extra link " |
| "pointer in partition table" |
| " %d\n"), partitions + 1); |
| else |
| pe->ext_pointer = p; |
| } else if (p->sys_ind) { |
| if (pe->part_table) |
| fprintf(stderr, |
| _("Warning: ignoring extra " |
| "data in partition table" |
| " %d\n"), partitions + 1); |
| else |
| pe->part_table = p; |
| } |
| } |
| |
| /* very strange code here... */ |
| if (!pe->part_table) { |
| if (q != pe->ext_pointer) |
| pe->part_table = q; |
| else |
| pe->part_table = q + 1; |
| } |
| if (!pe->ext_pointer) { |
| if (q != pe->part_table) |
| pe->ext_pointer = q; |
| else |
| pe->ext_pointer = q + 1; |
| } |
| |
| p = pe->ext_pointer; |
| partitions++; |
| } |
| |
| /* remove empty links */ |
| remove: |
| for (i = 4; i < partitions; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| if (!get_nr_sects(pe->part_table) && |
| (partitions > 5 || ptes[4].part_table->sys_ind)) { |
| printf(_("omitting empty partition (%d)\n"), i+1); |
| delete_partition(i); |
| goto remove; /* numbering changed */ |
| } |
| } |
| } |
| |
| static void |
| dos_write_mbr_id(unsigned char *b, unsigned int id) { |
| store4_little_endian(&b[440], id); |
| } |
| |
| static unsigned int |
| dos_read_mbr_id(const unsigned char *b) { |
| return read4_little_endian(&b[440]); |
| } |
| |
| static void |
| dos_print_mbr_id(void) { |
| printf(_("Disk identifier: 0x%08x\n"), dos_read_mbr_id(MBRbuffer)); |
| } |
| |
| static void |
| dos_set_mbr_id(void) { |
| unsigned long new_id; |
| char *ep; |
| char ps[64]; |
| |
| snprintf(ps, sizeof ps, _("New disk identifier (current 0x%08x): "), |
| dos_read_mbr_id(MBRbuffer)); |
| |
| if (read_chars(ps) == '\n') |
| return; |
| |
| new_id = strtoul(line_ptr, &ep, 0); |
| if (*ep != '\n') |
| return; |
| |
| dos_write_mbr_id(MBRbuffer, new_id); |
| dos_print_mbr_id(); |
| } |
| |
| static void |
| create_doslabel(void) { |
| unsigned int id = get_random_id(); |
| |
| fprintf(stderr, |
| _("Building a new DOS disklabel with disk identifier 0x%08x.\n" |
| "Changes will remain in memory only, until you decide to write them.\n" |
| "After that, of course, the previous content won't be recoverable.\n\n"), |
| id); |
| sun_nolabel(); /* otherwise always recognised as sun */ |
| sgi_nolabel(); /* otherwise always recognised as sgi */ |
| mac_label = aix_label = osf_label = possibly_osf_label = 0; |
| partitions = 4; |
| |
| /* Zero out the MBR buffer */ |
| extended_offset = 0; |
| set_all_unchanged(); |
| set_changed(0); |
| get_boot(create_empty_dos); |
| |
| /* Generate an MBR ID for this disk */ |
| dos_write_mbr_id(MBRbuffer, id); |
| |
| /* Mark it bootable (unfortunately required) */ |
| write_part_table_flag(MBRbuffer); |
| } |
| |
| static void |
| get_topology(int fd) { |
| int arg; |
| #ifdef HAVE_LIBBLKID_INTERNAL |
| blkid_probe pr; |
| |
| pr = blkid_new_probe(); |
| if (pr && blkid_probe_set_device(pr, fd, 0, 0) == 0) { |
| blkid_topology tp = blkid_probe_get_topology(pr); |
| |
| if (tp) { |
| min_io_size = blkid_topology_get_minimum_io_size(tp); |
| io_size = blkid_topology_get_optimal_io_size(tp); |
| phy_sector_size = blkid_topology_get_physical_sector_size(tp); |
| alignment_offset = blkid_topology_get_alignment_offset(tp); |
| |
| /* We assume that the device provides topology info if |
| * optimal_io_size is set or alignment_offset is set or |
| * minimum_io_size is not power of 2. |
| * |
| * See also update_sector_offset(). |
| */ |
| if (io_size || alignment_offset || |
| (min_io_size & (min_io_size - 1))) |
| has_topology = 1; |
| if (!io_size) |
| /* optimal IO is optional, default to minimum IO */ |
| io_size = min_io_size; |
| } |
| } |
| blkid_free_probe(pr); |
| #endif |
| |
| if (user_set_sector_size) |
| /* fdisk since 2.17 differentiate between logical and physical |
| * sectors size. For backward compatibility the |
| * fdisk -b <sectorsize> |
| * changes both, logical and physical sector size. |
| */ |
| phy_sector_size = sector_size; |
| |
| else if (blkdev_get_sector_size(fd, &arg) == 0) { |
| sector_size = arg; |
| |
| if (!phy_sector_size) |
| phy_sector_size = sector_size; |
| } |
| |
| if (!min_io_size) |
| min_io_size = phy_sector_size; |
| if (!io_size) |
| io_size = min_io_size; |
| |
| if (sector_size != DEFAULT_SECTOR_SIZE) |
| printf(_("Note: sector size is %d (not %d)\n"), |
| sector_size, DEFAULT_SECTOR_SIZE); |
| } |
| |
| static void |
| get_kernel_geometry(int fd) { |
| #ifdef HDIO_GETGEO |
| struct hd_geometry geometry; |
| |
| if (!ioctl(fd, HDIO_GETGEO, &geometry)) { |
| kern_heads = geometry.heads; |
| kern_sectors = geometry.sectors; |
| /* never use geometry.cylinders - it is truncated */ |
| } |
| #endif |
| } |
| |
| static void |
| get_partition_table_geometry(void) { |
| unsigned char *bufp = MBRbuffer; |
| struct partition *p; |
| int i, h, s, hh, ss; |
| int first = 1; |
| int bad = 0; |
| |
| if (!(valid_part_table_flag(bufp))) |
| return; |
| |
| hh = ss = 0; |
| for (i=0; i<4; i++) { |
| p = pt_offset(bufp, i); |
| if (p->sys_ind != 0) { |
| h = p->end_head + 1; |
| s = (p->end_sector & 077); |
| if (first) { |
| hh = h; |
| ss = s; |
| first = 0; |
| } else if (hh != h || ss != s) |
| bad = 1; |
| } |
| } |
| |
| if (!first && !bad) { |
| pt_heads = hh; |
| pt_sectors = ss; |
| } |
| } |
| |
| /* |
| * Sets LBA of the first partition |
| */ |
| void |
| update_sector_offset(void) |
| { |
| grain = io_size; |
| |
| if (dos_compatible_flag) |
| sector_offset = sectors; /* usually 63 sectors */ |
| else { |
| /* |
| * Align the begin of partitions to: |
| * |
| * a) topology |
| * a2) alignment offset |
| * a1) or physical sector (minimal_io_size, aka "grain") |
| * |
| * b) or default to 1MiB (2048 sectrors, Windows Vista default) |
| * |
| * c) or for very small devices use 1 phy.sector |
| */ |
| unsigned long long x = 0; |
| |
| if (has_topology) { |
| if (alignment_offset) |
| x = alignment_offset; |
| else if (io_size > 2048 * 512) |
| x = io_size; |
| } |
| /* default to 1MiB */ |
| if (!x) |
| x = 2048 * 512; |
| |
| sector_offset = x / sector_size; |
| |
| /* don't use huge offset on small devices */ |
| if (total_number_of_sectors <= sector_offset * 4) |
| sector_offset = phy_sector_size / sector_size; |
| |
| /* use 1MiB grain always when possible */ |
| if (grain < 2048 * 512) |
| grain = 2048 * 512; |
| |
| /* don't use huge grain on small devices */ |
| if (total_number_of_sectors <= (grain * 4 / sector_size)) |
| grain = phy_sector_size; |
| } |
| } |
| |
| void |
| get_geometry(int fd, struct geom *g) { |
| unsigned long long llcyls; |
| |
| get_topology(fd); |
| sector_factor = sector_size / 512; |
| guess_device_type(fd); |
| heads = cylinders = sectors = 0; |
| kern_heads = kern_sectors = 0; |
| pt_heads = pt_sectors = 0; |
| |
| get_kernel_geometry(fd); |
| get_partition_table_geometry(); |
| |
| heads = user_heads ? user_heads : |
| pt_heads ? pt_heads : |
| kern_heads ? kern_heads : 255; |
| sectors = user_sectors ? user_sectors : |
| pt_sectors ? pt_sectors : |
| kern_sectors ? kern_sectors : 63; |
| |
| if (blkdev_get_sectors(fd, &total_number_of_sectors) == -1) |
| total_number_of_sectors = 0; |
| |
| update_sector_offset(); |
| |
| llcyls = total_number_of_sectors / (heads * sectors * sector_factor); |
| cylinders = llcyls; |
| if (cylinders != llcyls) /* truncated? */ |
| cylinders = ~0; |
| if (!cylinders) |
| cylinders = user_cylinders; |
| |
| if (g) { |
| g->heads = heads; |
| g->sectors = sectors; |
| g->cylinders = cylinders; |
| } |
| } |
| |
| /* |
| * Please, always use allocated buffer if you want to cast the buffer to |
| * any struct -- cast non-allocated buffer to any struct is against |
| * strict-aliasing rules. --kzak 16-Oct-2009 |
| */ |
| static void init_mbr_buffer(void) |
| { |
| if (MBRbuffer) |
| return; |
| |
| MBRbuffer = calloc(1, MAX_SECTOR_SIZE); |
| if (!MBRbuffer) |
| fatal(out_of_memory); |
| } |
| |
| void zeroize_mbr_buffer(void) |
| { |
| if (MBRbuffer) |
| memset(MBRbuffer, 0, MAX_SECTOR_SIZE); |
| } |
| |
| /* |
| * Read MBR. Returns: |
| * -1: no 0xaa55 flag present (possibly entire disk BSD) |
| * 0: found or created label |
| * 1: I/O error |
| */ |
| int |
| get_boot(enum action what) { |
| int i; |
| |
| partitions = 4; |
| ext_index = 0; |
| extended_offset = 0; |
| |
| for (i = 0; i < 4; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| pe->part_table = pt_offset(MBRbuffer, i); |
| pe->ext_pointer = NULL; |
| pe->offset = 0; |
| pe->sectorbuffer = MBRbuffer; |
| pe->changed = (what == create_empty_dos); |
| } |
| |
| if (what == create_empty_sun && check_sun_label()) |
| return 0; |
| |
| memset(MBRbuffer, 0, 512); |
| |
| if (what == create_empty_dos) |
| goto got_dos_table; /* skip reading disk */ |
| |
| if ((fd = open(disk_device, type_open)) < 0) { |
| if ((fd = open(disk_device, O_RDONLY)) < 0) { |
| if (what == try_only) |
| return 1; |
| fatal(unable_to_open); |
| } else |
| printf(_("You will not be able to write " |
| "the partition table.\n")); |
| } |
| |
| if (512 != read(fd, MBRbuffer, 512)) { |
| if (what == try_only) |
| return 1; |
| fatal(unable_to_read); |
| } |
| |
| get_geometry(fd, NULL); |
| |
| update_units(); |
| |
| if (check_sun_label()) |
| return 0; |
| |
| if (check_sgi_label()) |
| return 0; |
| |
| if (check_aix_label()) |
| return 0; |
| |
| if (check_mac_label()) |
| return 0; |
| |
| if (check_osf_label()) { |
| possibly_osf_label = 1; |
| if (!valid_part_table_flag(MBRbuffer)) { |
| osf_label = 1; |
| return 0; |
| } |
| printf(_("This disk has both DOS and BSD magic.\n" |
| "Give the 'b' command to go to BSD mode.\n")); |
| } |
| |
| got_dos_table: |
| |
| if (!valid_part_table_flag(MBRbuffer)) { |
| switch(what) { |
| case fdisk: |
| fprintf(stderr, |
| _("Device contains neither a valid DOS " |
| "partition table, nor Sun, SGI or OSF " |
| "disklabel\n")); |
| #ifdef __sparc__ |
| create_sunlabel(); |
| #else |
| create_doslabel(); |
| #endif |
| return 0; |
| case require: |
| return -1; |
| case try_only: |
| return -1; |
| case create_empty_dos: |
| case create_empty_sun: |
| break; |
| default: |
| fprintf(stderr, _("Internal error\n")); |
| exit(1); |
| } |
| } |
| |
| for (i = 0; i < 4; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| if (IS_EXTENDED (pe->part_table->sys_ind)) { |
| if (partitions != 4) |
| fprintf(stderr, _("Ignoring extra extended " |
| "partition %d\n"), i + 1); |
| else |
| read_extended(i); |
| } |
| } |
| |
| for (i = 3; i < partitions; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| if (!valid_part_table_flag(pe->sectorbuffer)) { |
| fprintf(stderr, |
| _("Warning: invalid flag 0x%04x of partition " |
| "table %d will be corrected by w(rite)\n"), |
| part_table_flag(pe->sectorbuffer), i + 1); |
| pe->changed = 1; |
| } |
| } |
| |
| warn_geometry(); |
| warn_limits(); |
| warn_alignment(); |
| |
| return 0; |
| } |
| |
| /* read line; return 0 or first char */ |
| int |
| read_line(void) |
| { |
| static int got_eof = 0; |
| |
| line_ptr = line_buffer; |
| if (!fgets(line_buffer, LINE_LENGTH, stdin)) { |
| if (feof(stdin)) |
| got_eof++; /* user typed ^D ? */ |
| if (got_eof >= 3) { |
| fflush(stdout); |
| fprintf(stderr, _("\ngot EOF thrice - exiting..\n")); |
| exit(1); |
| } |
| return 0; |
| } |
| while (*line_ptr && !isgraph(*line_ptr)) |
| line_ptr++; |
| return *line_ptr; |
| } |
| |
| char |
| read_char(char *mesg) |
| { |
| do { |
| fputs(mesg, stdout); |
| fflush (stdout); /* requested by niles@scyld.com */ |
| } while (!read_line()); |
| return *line_ptr; |
| } |
| |
| char |
| read_chars(char *mesg) |
| { |
| fputs(mesg, stdout); |
| fflush (stdout); /* niles@scyld.com */ |
| if (!read_line()) { |
| *line_ptr = '\n'; |
| line_ptr[1] = 0; |
| } |
| return *line_ptr; |
| } |
| |
| int |
| read_hex(struct systypes *sys) |
| { |
| int hex; |
| |
| while (1) |
| { |
| read_char(_("Hex code (type L to list codes): ")); |
| if (tolower(*line_ptr) == 'l') |
| list_types(sys); |
| else if (isxdigit (*line_ptr)) |
| { |
| hex = 0; |
| do |
| hex = hex << 4 | hex_val(*line_ptr++); |
| while (isxdigit(*line_ptr)); |
| return hex; |
| } |
| } |
| } |
| |
| static unsigned int |
| read_int_sx(unsigned int low, unsigned int dflt, unsigned int high, |
| unsigned int base, char *mesg, int *suffix) |
| { |
| unsigned int i; |
| int default_ok = 1; |
| static char *ms = NULL; |
| static int mslen = 0; |
| |
| if (!ms || strlen(mesg)+100 > mslen) { |
| mslen = strlen(mesg)+200; |
| if (!(ms = realloc(ms,mslen))) |
| fatal(out_of_memory); |
| } |
| |
| if (dflt < low || dflt > high) |
| default_ok = 0; |
| |
| if (default_ok) |
| snprintf(ms, mslen, _("%s (%u-%u, default %u): "), |
| mesg, low, high, dflt); |
| else |
| snprintf(ms, mslen, "%s (%u-%u): ", |
| mesg, low, high); |
| |
| while (1) { |
| int use_default = default_ok; |
| |
| /* ask question and read answer */ |
| while (read_chars(ms) != '\n' && !isdigit(*line_ptr) |
| && *line_ptr != '-' && *line_ptr != '+') |
| continue; |
| |
| if (*line_ptr == '+' || *line_ptr == '-') { |
| int minus = (*line_ptr == '-'); |
| int absolute = 0; |
| int suflen; |
| |
| i = atoi(line_ptr+1); |
| |
| while (isdigit(*++line_ptr)) |
| use_default = 0; |
| |
| suflen = strlen(line_ptr) - 1; |
| |
| while(isspace(*(line_ptr + suflen))) |
| *(line_ptr + suflen--) = '\0'; |
| |
| if ((*line_ptr == 'C' || *line_ptr == 'c') && |
| *(line_ptr + 1) == '\0') { |
| /* |
| * Cylinders |
| */ |
| if (!display_in_cyl_units) |
| i *= heads * sectors; |
| } else if (*line_ptr && |
| *(line_ptr + 1) == 'B' && |
| *(line_ptr + 2) == '\0') { |
| /* |
| * 10^N |
| */ |
| if (*line_ptr == 'K') |
| absolute = 1000; |
| else if (*line_ptr == 'M') |
| absolute = 1000000; |
| else if (*line_ptr == 'G') |
| absolute = 1000000000; |
| else |
| absolute = -1; |
| } else if (*line_ptr && |
| *(line_ptr + 1) == '\0') { |
| /* |
| * 2^N |
| */ |
| if (*line_ptr == 'K') |
| absolute = 1 << 10; |
| else if (*line_ptr == 'M') |
| absolute = 1 << 20; |
| else if (*line_ptr == 'G') |
| absolute = 1 << 30; |
| else |
| absolute = -1; |
| } else if (*line_ptr != '\0') |
| absolute = -1; |
| |
| if (absolute == -1) { |
| printf(_("Unsupported suffix: '%s'.\n"), line_ptr); |
| printf(_("Supported: 10^N: KB (KiloByte), MB (MegaByte), GB (GigaByte)\n" |
| " 2^N: K (KibiByte), M (MebiByte), G (GibiByte)\n")); |
| continue; |
| } |
| |
| if (absolute && i) { |
| unsigned long long bytes; |
| unsigned long unit; |
| |
| bytes = (unsigned long long) i * absolute; |
| unit = sector_size * units_per_sector; |
| bytes += unit/2; /* round */ |
| bytes /= unit; |
| i = bytes; |
| if (suffix) |
| *suffix = absolute; |
| } |
| if (minus) |
| i = -i; |
| i += base; |
| } else { |
| i = atoi(line_ptr); |
| while (isdigit(*line_ptr)) { |
| line_ptr++; |
| use_default = 0; |
| } |
| } |
| if (use_default) |
| printf(_("Using default value %u\n"), i = dflt); |
| if (i >= low && i <= high) |
| break; |
| else |
| printf(_("Value out of range.\n")); |
| } |
| return i; |
| } |
| |
| /* |
| * Print the message MESG, then read an integer in LOW..HIGH. |
| * If the user hits Enter, DFLT is returned, provided that is in LOW..HIGH. |
| * Answers like +10 are interpreted as offsets from BASE. |
| * |
| * There is no default if DFLT is not between LOW and HIGH. |
| */ |
| unsigned int |
| read_int(unsigned int low, unsigned int dflt, unsigned int high, |
| unsigned int base, char *mesg) |
| { |
| return read_int_sx(low, dflt, high, base, mesg, NULL); |
| } |
| |
| |
| int |
| get_partition(int warn, int max) { |
| struct pte *pe; |
| int i; |
| |
| i = read_int(1, 0, max, 0, _("Partition number")) - 1; |
| pe = &ptes[i]; |
| |
| if (warn) { |
| if ((!sun_label && !sgi_label && !pe->part_table->sys_ind) |
| || (sun_label && |
| (!sunlabel->partitions[i].num_sectors || |
| !sunlabel->part_tags[i].tag)) |
| || (sgi_label && (!sgi_get_num_sectors(i))) |
| ) |
| fprintf(stderr, |
| _("Warning: partition %d has empty type\n"), |
| i+1); |
| } |
| return i; |
| } |
| |
| static int |
| get_existing_partition(int warn, int max) { |
| int pno = -1; |
| int i; |
| |
| for (i = 0; i < max; i++) { |
| struct pte *pe = &ptes[i]; |
| struct partition *p = pe->part_table; |
| |
| if (p && !is_cleared_partition(p)) { |
| if (pno >= 0) |
| goto not_unique; |
| pno = i; |
| } |
| } |
| if (pno >= 0) { |
| printf(_("Selected partition %d\n"), pno+1); |
| return pno; |
| } |
| printf(_("No partition is defined yet!\n")); |
| return -1; |
| |
| not_unique: |
| return get_partition(warn, max); |
| } |
| |
| static int |
| get_nonexisting_partition(int warn, int max) { |
| int pno = -1; |
| int i; |
| |
| for (i = 0; i < max; i++) { |
| struct pte *pe = &ptes[i]; |
| struct partition *p = pe->part_table; |
| |
| if (p && is_cleared_partition(p)) { |
| if (pno >= 0) |
| goto not_unique; |
| pno = i; |
| } |
| } |
| if (pno >= 0) { |
| printf(_("Selected partition %d\n"), pno+1); |
| return pno; |
| } |
| printf(_("All primary partitions have been defined already!\n")); |
| return -1; |
| |
| not_unique: |
| return get_partition(warn, max); |
| } |
| |
| const char * |
| str_units(int n) { /* n==1: use singular */ |
| if (n == 1) |
| return display_in_cyl_units ? _("cylinder") : _("sector"); |
| else |
| return display_in_cyl_units ? _("cylinders") : _("sectors"); |
| } |
| |
| void change_units(void) |
| { |
| display_in_cyl_units = !display_in_cyl_units; |
| update_units(); |
| printf(_("Changing display/entry units to %s\n"), |
| str_units(PLURAL)); |
| } |
| |
| static void |
| toggle_active(int i) { |
| struct pte *pe = &ptes[i]; |
| struct partition *p = pe->part_table; |
| |
| if (IS_EXTENDED (p->sys_ind) && !p->boot_ind) |
| fprintf(stderr, |
| _("WARNING: Partition %d is an extended partition\n"), |
| i + 1); |
| p->boot_ind = (p->boot_ind ? 0 : ACTIVE_FLAG); |
| pe->changed = 1; |
| } |
| |
| static void |
| toggle_dos_compatibility_flag(void) { |
| dos_compatible_flag = ~dos_compatible_flag; |
| if (dos_compatible_flag) |
| printf(_("DOS Compatibility flag is set\n")); |
| else |
| printf(_("DOS Compatibility flag is not set\n")); |
| |
| update_sector_offset(); |
| } |
| |
| static void |
| delete_partition(int i) { |
| struct pte *pe = &ptes[i]; |
| struct partition *p = pe->part_table; |
| struct partition *q = pe->ext_pointer; |
| |
| /* Note that for the fifth partition (i == 4) we don't actually |
| * decrement partitions. |
| */ |
| |
| if (warn_geometry()) |
| return; /* C/H/S not set */ |
| pe->changed = 1; |
| |
| if (sun_label) { |
| sun_delete_partition(i); |
| return; |
| } |
| |
| if (sgi_label) { |
| sgi_delete_partition(i); |
| return; |
| } |
| |
| if (i < 4) { |
| if (IS_EXTENDED (p->sys_ind) && i == ext_index) { |
| partitions = 4; |
| ptes[ext_index].ext_pointer = NULL; |
| extended_offset = 0; |
| } |
| clear_partition(p); |
| return; |
| } |
| |
| if (!q->sys_ind && i > 4) { |
| /* the last one in the chain - just delete */ |
| --partitions; |
| --i; |
| clear_partition(ptes[i].ext_pointer); |
| ptes[i].changed = 1; |
| } else { |
| /* not the last one - further ones will be moved down */ |
| if (i > 4) { |
| /* delete this link in the chain */ |
| p = ptes[i-1].ext_pointer; |
| *p = *q; |
| set_start_sect(p, get_start_sect(q)); |
| set_nr_sects(p, get_nr_sects(q)); |
| ptes[i-1].changed = 1; |
| } else if (partitions > 5) { /* 5 will be moved to 4 */ |
| /* the first logical in a longer chain */ |
| struct pte *pe = &ptes[5]; |
| |
| if (pe->part_table) /* prevent SEGFAULT */ |
| set_start_sect(pe->part_table, |
| get_partition_start(pe) - |
| extended_offset); |
| pe->offset = extended_offset; |
| pe->changed = 1; |
| } |
| |
| if (partitions > 5) { |
| partitions--; |
| while (i < partitions) { |
| ptes[i] = ptes[i+1]; |
| i++; |
| } |
| } else |
| /* the only logical: clear only */ |
| clear_partition(ptes[i].part_table); |
| } |
| } |
| |
| static void |
| change_sysid(void) { |
| char *temp; |
| int i, sys, origsys; |
| struct partition *p; |
| |
| /* If sgi_label then don't use get_existing_partition, |
| let the user select a partition, since get_existing_partition() |
| only works for Linux like partition tables. */ |
| if (!sgi_label) { |
| i = get_existing_partition(0, partitions); |
| } else { |
| i = get_partition(0, partitions); |
| } |
| |
| if (i == -1) |
| return; |
| p = ptes[i].part_table; |
| origsys = sys = get_sysid(i); |
| |
| /* if changing types T to 0 is allowed, then |
| the reverse change must be allowed, too */ |
| if (!sys && !sgi_label && !sun_label && !get_nr_sects(p)) |
| printf(_("Partition %d does not exist yet!\n"), i + 1); |
| else while (1) { |
| sys = read_hex (get_sys_types()); |
| |
| if (!sys && !sgi_label && !sun_label) { |
| printf(_("Type 0 means free space to many systems\n" |
| "(but not to Linux). Having partitions of\n" |
| "type 0 is probably unwise. You can delete\n" |
| "a partition using the `d' command.\n")); |
| /* break; */ |
| } |
| |
| if (!sun_label && !sgi_label) { |
| if (IS_EXTENDED (sys) != IS_EXTENDED (p->sys_ind)) { |
| printf(_("You cannot change a partition into" |
| " an extended one or vice versa\n" |
| "Delete it first.\n")); |
| break; |
| } |
| } |
| |
| if (sys < 256) { |
| if (sun_label && i == 2 && sys != SUN_TAG_BACKUP) |
| printf(_("Consider leaving partition 3 " |
| "as Whole disk (5),\n" |
| "as SunOS/Solaris expects it and " |
| "even Linux likes it.\n\n")); |
| if (sgi_label && ((i == 10 && sys != ENTIRE_DISK) |
| || (i == 8 && sys != 0))) |
| printf(_("Consider leaving partition 9 " |
| "as volume header (0),\nand " |
| "partition 11 as entire volume (6), " |
| "as IRIX expects it.\n\n")); |
| if (sys == origsys) |
| break; |
| if (sun_label) { |
| ptes[i].changed = sun_change_sysid(i, sys); |
| } else |
| if (sgi_label) { |
| ptes[i].changed = sgi_change_sysid(i, sys); |
| } else { |
| p->sys_ind = sys; |
| ptes[i].changed = 1; |
| } |
| temp = partition_type(sys) ? : _("Unknown"); |
| if (ptes[i].changed) |
| printf (_("Changed system type of partition %d " |
| "to %x (%s)\n"), i + 1, sys, temp); |
| else |
| printf (_("System type of partition %d is unchanged: " |
| "%x (%s)\n"), i + 1, sys, temp); |
| if (is_dos_partition(origsys) || |
| is_dos_partition(sys)) |
| dos_changed = 1; |
| break; |
| } |
| } |
| } |
| |
| /* check_consistency() and long2chs() added Sat Mar 6 12:28:16 1993, |
| * faith@cs.unc.edu, based on code fragments from pfdisk by Gordon W. Ross, |
| * Jan. 1990 (version 1.2.1 by Gordon W. Ross Aug. 1990; Modified by S. |
| * Lubkin Oct. 1991). */ |
| |
| static void |
| long2chs(ulong ls, unsigned int *c, unsigned int *h, unsigned int *s) { |
| int spc = heads * sectors; |
| |
| *c = ls / spc; |
| ls = ls % spc; |
| *h = ls / sectors; |
| *s = ls % sectors + 1; /* sectors count from 1 */ |
| } |
| |
| static void check_consistency(struct partition *p, int partition) { |
| unsigned int pbc, pbh, pbs; /* physical beginning c, h, s */ |
| unsigned int pec, peh, pes; /* physical ending c, h, s */ |
| unsigned int lbc, lbh, lbs; /* logical beginning c, h, s */ |
| unsigned int lec, leh, les; /* logical ending c, h, s */ |
| |
| if (!dos_compatible_flag) |
| return; |
| |
| if (!heads || !sectors || (partition >= 4)) |
| return; /* do not check extended partitions */ |
| |
| /* physical beginning c, h, s */ |
| pbc = (p->cyl & 0xff) | ((p->sector << 2) & 0x300); |
| pbh = p->head; |
| pbs = p->sector & 0x3f; |
| |
| /* physical ending c, h, s */ |
| pec = (p->end_cyl & 0xff) | ((p->end_sector << 2) & 0x300); |
| peh = p->end_head; |
| pes = p->end_sector & 0x3f; |
| |
| /* compute logical beginning (c, h, s) */ |
| long2chs(get_start_sect(p), &lbc, &lbh, &lbs); |
| |
| /* compute logical ending (c, h, s) */ |
| long2chs(get_start_sect(p) + get_nr_sects(p) - 1, &lec, &leh, &les); |
| |
| /* Same physical / logical beginning? */ |
| if (cylinders <= 1024 && (pbc != lbc || pbh != lbh || pbs != lbs)) { |
| printf(_("Partition %d has different physical/logical " |
| "beginnings (non-Linux?):\n"), partition + 1); |
| printf(_(" phys=(%d, %d, %d) "), pbc, pbh, pbs); |
| printf(_("logical=(%d, %d, %d)\n"),lbc, lbh, lbs); |
| } |
| |
| /* Same physical / logical ending? */ |
| if (cylinders <= 1024 && (pec != lec || peh != leh || pes != les)) { |
| printf(_("Partition %d has different physical/logical " |
| "endings:\n"), partition + 1); |
| printf(_(" phys=(%d, %d, %d) "), pec, peh, pes); |
| printf(_("logical=(%d, %d, %d)\n"),lec, leh, les); |
| } |
| |
| #if 0 |
| /* Beginning on cylinder boundary? */ |
| if (pbh != !pbc || pbs != 1) { |
| printf(_("Partition %i does not start on cylinder " |
| "boundary:\n"), partition + 1); |
| printf(_(" phys=(%d, %d, %d) "), pbc, pbh, pbs); |
| printf(_("should be (%d, %d, 1)\n"), pbc, !pbc); |
| } |
| #endif |
| |
| /* Ending on cylinder boundary? */ |
| if (peh != (heads - 1) || pes != sectors) { |
| printf(_("Partition %i does not end on cylinder boundary.\n"), |
| partition + 1); |
| #if 0 |
| printf(_(" phys=(%d, %d, %d) "), pec, peh, pes); |
| printf(_("should be (%d, %d, %d)\n"), |
| pec, heads - 1, sectors); |
| #endif |
| } |
| } |
| |
| static void |
| check_alignment(unsigned long long lba, int partition) |
| { |
| if (!lba_is_aligned(lba)) |
| printf(_("Partition %i does not start on physical sector boundary.\n"), |
| partition + 1); |
| } |
| |
| static void |
| list_disk_geometry(void) { |
| long long bytes = (total_number_of_sectors << 9); |
| long megabytes = bytes/1000000; |
| |
| if (megabytes < 10000) |
| printf(_("\nDisk %s: %ld MB, %lld bytes\n"), |
| disk_device, megabytes, bytes); |
| else { |
| long hectomega = (megabytes + 50) / 100; |
| printf(_("\nDisk %s: %ld.%ld GB, %lld bytes\n"), |
| disk_device, hectomega / 10, hectomega % 10, bytes); |
| } |
| printf(_("%d heads, %llu sectors/track, %d cylinders"), |
| heads, sectors, cylinders); |
| if (units_per_sector == 1) |
| printf(_(", total %llu sectors"), |
| total_number_of_sectors / sector_factor); |
| printf("\n"); |
| printf(_("Units = %s of %d * %d = %d bytes\n"), |
| str_units(PLURAL), |
| units_per_sector, sector_size, units_per_sector * sector_size); |
| |
| printf(_("Sector size (logical/physical): %u bytes / %lu bytes\n"), |
| sector_size, phy_sector_size); |
| printf(_("I/O size (minimum/optimal): %lu bytes / %lu bytes\n"), |
| min_io_size, io_size); |
| if (alignment_offset) |
| printf(_("Alignment offset: %lu bytes\n"), alignment_offset); |
| if (dos_label) |
| dos_print_mbr_id(); |
| printf("\n"); |
| } |
| |
| /* |
| * Check whether partition entries are ordered by their starting positions. |
| * Return 0 if OK. Return i if partition i should have been earlier. |
| * Two separate checks: primary and logical partitions. |
| */ |
| static int |
| wrong_p_order(int *prev) { |
| struct pte *pe; |
| struct partition *p; |
| unsigned int last_p_start_pos = 0, p_start_pos; |
| int i, last_i = 0; |
| |
| for (i = 0 ; i < partitions; i++) { |
| if (i == 4) { |
| last_i = 4; |
| last_p_start_pos = 0; |
| } |
| pe = &ptes[i]; |
| if ((p = pe->part_table)->sys_ind) { |
| p_start_pos = get_partition_start(pe); |
| |
| if (last_p_start_pos > p_start_pos) { |
| if (prev) |
| *prev = last_i; |
| return i; |
| } |
| |
| last_p_start_pos = p_start_pos; |
| last_i = i; |
| } |
| } |
| return 0; |
| } |
| |
| /* |
| * Fix the chain of logicals. |
| * extended_offset is unchanged, the set of sectors used is unchanged |
| * The chain is sorted so that sectors increase, and so that |
| * starting sectors increase. |
| * |
| * After this it may still be that cfdisk doesnt like the table. |
| * (This is because cfdisk considers expanded parts, from link to |
| * end of partition, and these may still overlap.) |
| * Now |
| * sfdisk /dev/hda > ohda; sfdisk /dev/hda < ohda |
| * may help. |
| */ |
| static void |
| fix_chain_of_logicals(void) { |
| int j, oj, ojj, sj, sjj; |
| struct partition *pj,*pjj,tmp; |
| |
| /* Stage 1: sort sectors but leave sector of part 4 */ |
| /* (Its sector is the global extended_offset.) */ |
| stage1: |
| for (j = 5; j < partitions-1; j++) { |
| oj = ptes[j].offset; |
| ojj = ptes[j+1].offset; |
| if (oj > ojj) { |
| ptes[j].offset = ojj; |
| ptes[j+1].offset = oj; |
| pj = ptes[j].part_table; |
| set_start_sect(pj, get_start_sect(pj)+oj-ojj); |
| pjj = ptes[j+1].part_table; |
| set_start_sect(pjj, get_start_sect(pjj)+ojj-oj); |
| set_start_sect(ptes[j-1].ext_pointer, |
| ojj-extended_offset); |
| set_start_sect(ptes[j].ext_pointer, |
| oj-extended_offset); |
| goto stage1; |
| } |
| } |
| |
| /* Stage 2: sort starting sectors */ |
| stage2: |
| for (j = 4; j < partitions-1; j++) { |
| pj = ptes[j].part_table; |
| pjj = ptes[j+1].part_table; |
| sj = get_start_sect(pj); |
| sjj = get_start_sect(pjj); |
| oj = ptes[j].offset; |
| ojj = ptes[j+1].offset; |
| if (oj+sj > ojj+sjj) { |
| tmp = *pj; |
| *pj = *pjj; |
| *pjj = tmp; |
| set_start_sect(pj, ojj+sjj-oj); |
| set_start_sect(pjj, oj+sj-ojj); |
| goto stage2; |
| } |
| } |
| |
| /* Probably something was changed */ |
| for (j = 4; j < partitions; j++) |
| ptes[j].changed = 1; |
| } |
| |
| static void |
| fix_partition_table_order(void) { |
| struct pte *pei, *pek; |
| int i,k; |
| |
| if (!wrong_p_order(NULL)) { |
| printf(_("Nothing to do. Ordering is correct already.\n\n")); |
| return; |
| } |
| |
| while ((i = wrong_p_order(&k)) != 0 && i < 4) { |
| /* partition i should have come earlier, move it */ |
| /* We have to move data in the MBR */ |
| struct partition *pi, *pk, *pe, pbuf; |
| pei = &ptes[i]; |
| pek = &ptes[k]; |
| |
| pe = pei->ext_pointer; |
| pei->ext_pointer = pek->ext_pointer; |
| pek->ext_pointer = pe; |
| |
| pi = pei->part_table; |
| pk = pek->part_table; |
| |
| memmove(&pbuf, pi, sizeof(struct partition)); |
| memmove(pi, pk, sizeof(struct partition)); |
| memmove(pk, &pbuf, sizeof(struct partition)); |
| |
| pei->changed = pek->changed = 1; |
| } |
| |
| if (i) |
| fix_chain_of_logicals(); |
| |
| printf(_("Done.\n")); |
| |
| } |
| |
| static void |
| list_table(int xtra) { |
| struct partition *p; |
| char *type; |
| int i, w; |
| |
| if (sun_label) { |
| sun_list_table(xtra); |
| return; |
| } |
| |
| if (sgi_label) { |
| sgi_list_table(xtra); |
| return; |
| } |
| |
| list_disk_geometry(); |
| |
| if (osf_label) { |
| xbsd_print_disklabel(xtra); |
| return; |
| } |
| |
| if (is_garbage_table()) { |
| printf(_("This doesn't look like a partition table\n" |
| "Probably you selected the wrong device.\n\n")); |
| } |
| |
| /* Heuristic: we list partition 3 of /dev/foo as /dev/foo3, |
| but if the device name ends in a digit, say /dev/foo1, |
| then the partition is called /dev/foo1p3. */ |
| w = strlen(disk_device); |
| if (w && isdigit(disk_device[w-1])) |
| w++; |
| if (w < 5) |
| w = 5; |
| |
| printf(_("%*s Boot Start End Blocks Id System\n"), |
| w+1, _("Device")); |
| |
| for (i = 0; i < partitions; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| p = pe->part_table; |
| if (p && !is_cleared_partition(p)) { |
| unsigned int psects = get_nr_sects(p); |
| unsigned int pblocks = psects; |
| unsigned int podd = 0; |
| |
| if (sector_size < 1024) { |
| pblocks /= (1024 / sector_size); |
| podd = psects % (1024 / sector_size); |
| } |
| if (sector_size > 1024) |
| pblocks *= (sector_size / 1024); |
| printf( |
| "%s %c %11lu %11lu %11lu%c %2x %s\n", |
| partname(disk_device, i+1, w+2), |
| /* boot flag */ !p->boot_ind ? ' ' : p->boot_ind == ACTIVE_FLAG |
| ? '*' : '?', |
| /* start */ (unsigned long) cround(get_partition_start(pe)), |
| /* end */ (unsigned long) cround(get_partition_start(pe) + psects |
| - (psects ? 1 : 0)), |
| /* odd flag on end */ (unsigned long) pblocks, podd ? '+' : ' ', |
| /* type id */ p->sys_ind, |
| /* type name */ (type = partition_type(p->sys_ind)) ? |
| type : _("Unknown")); |
| check_consistency(p, i); |
| check_alignment(get_partition_start(pe), i); |
| } |
| } |
| |
| /* Is partition table in disk order? It need not be, but... */ |
| /* partition table entries are not checked for correct order if this |
| is a sgi, sun or aix labeled disk... */ |
| if (dos_label && wrong_p_order(NULL)) { |
| printf(_("\nPartition table entries are not in disk order\n")); |
| } |
| } |
| |
| static void |
| x_list_table(int extend) { |
| struct pte *pe; |
| struct partition *p; |
| int i; |
| |
| printf(_("\nDisk %s: %d heads, %llu sectors, %d cylinders\n\n"), |
| disk_device, heads, sectors, cylinders); |
| printf(_("Nr AF Hd Sec Cyl Hd Sec Cyl Start Size ID\n")); |
| for (i = 0 ; i < partitions; i++) { |
| pe = &ptes[i]; |
| p = (extend ? pe->ext_pointer : pe->part_table); |
| if (p != NULL) { |
| printf("%2d %02x%4d%4d%5d%4d%4d%5d%11lu%11lu %02x\n", |
| i + 1, p->boot_ind, p->head, |
| sector(p->sector), |
| cylinder(p->sector, p->cyl), p->end_head, |
| sector(p->end_sector), |
| cylinder(p->end_sector, p->end_cyl), |
| (unsigned long) get_start_sect(p), |
| (unsigned long) get_nr_sects(p), p->sys_ind); |
| if (p->sys_ind) { |
| check_consistency(p, i); |
| check_alignment(get_partition_start(pe), i); |
| } |
| } |
| } |
| } |
| |
| static void |
| fill_bounds(unsigned long long *first, unsigned long long *last) { |
| int i; |
| struct pte *pe = &ptes[0]; |
| struct partition *p; |
| |
| for (i = 0; i < partitions; pe++,i++) { |
| p = pe->part_table; |
| if (!p->sys_ind || IS_EXTENDED (p->sys_ind)) { |
| first[i] = 0xffffffff; |
| last[i] = 0; |
| } else { |
| first[i] = get_partition_start(pe); |
| last[i] = first[i] + get_nr_sects(p) - 1; |
| } |
| } |
| } |
| |
| static void |
| check(int n, unsigned int h, unsigned int s, unsigned int c, |
| unsigned int start) { |
| unsigned int total, real_s, real_c; |
| |
| real_s = sector(s) - 1; |
| real_c = cylinder(s, c); |
| total = (real_c * sectors + real_s) * heads + h; |
| if (!total) |
| fprintf(stderr, _("Warning: partition %d contains sector 0\n"), n); |
| if (h >= heads) |
| fprintf(stderr, |
| _("Partition %d: head %d greater than maximum %d\n"), |
| n, h + 1, heads); |
| if (real_s >= sectors) |
| fprintf(stderr, _("Partition %d: sector %d greater than " |
| "maximum %llu\n"), n, s, sectors); |
| if (real_c >= cylinders) |
| fprintf(stderr, _("Partitions %d: cylinder %d greater than " |
| "maximum %d\n"), n, real_c + 1, cylinders); |
| if (cylinders <= 1024 && start != total) |
| fprintf(stderr, |
| _("Partition %d: previous sectors %d disagrees with " |
| "total %d\n"), n, start, total); |
| } |
| |
| static void |
| verify(void) { |
| int i, j; |
| unsigned long long total = 1; |
| unsigned long long n_sectors = (total_number_of_sectors / sector_factor); |
| unsigned long long first[partitions], last[partitions]; |
| struct partition *p; |
| |
| if (warn_geometry()) |
| return; |
| |
| if (sun_label) { |
| verify_sun(); |
| return; |
| } |
| |
| if (sgi_label) { |
| verify_sgi(1); |
| return; |
| } |
| |
| fill_bounds(first, last); |
| for (i = 0; i < partitions; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| p = pe->part_table; |
| if (p->sys_ind && !IS_EXTENDED (p->sys_ind)) { |
| check_consistency(p, i); |
| check_alignment(get_partition_start(pe), i); |
| if (get_partition_start(pe) < first[i]) |
| printf(_("Warning: bad start-of-data in " |
| "partition %d\n"), i + 1); |
| check(i + 1, p->end_head, p->end_sector, p->end_cyl, |
| last[i]); |
| total += last[i] + 1 - first[i]; |
| for (j = 0; j < i; j++) |
| if ((first[i] >= first[j] && first[i] <= last[j]) |
| || ((last[i] <= last[j] && last[i] >= first[j]))) { |
| printf(_("Warning: partition %d overlaps " |
| "partition %d.\n"), j + 1, i + 1); |
| total += first[i] >= first[j] ? |
| first[i] : first[j]; |
| total -= last[i] <= last[j] ? |
| last[i] : last[j]; |
| } |
| } |
| } |
| |
| if (extended_offset) { |
| struct pte *pex = &ptes[ext_index]; |
| unsigned long long e_last = get_start_sect(pex->part_table) + |
| get_nr_sects(pex->part_table) - 1; |
| |
| for (i = 4; i < partitions; i++) { |
| total++; |
| p = ptes[i].part_table; |
| if (!p->sys_ind) { |
| if (i != 4 || i + 1 < partitions) |
| printf(_("Warning: partition %d " |
| "is empty\n"), i + 1); |
| } |
| else if (first[i] < extended_offset || |
| last[i] > e_last) |
| printf(_("Logical partition %d not entirely in " |
| "partition %d\n"), i + 1, ext_index + 1); |
| } |
| } |
| |
| if (total > n_sectors) |
| printf(_("Total allocated sectors %llu greater than the maximum" |
| " %llu\n"), total, n_sectors); |
| else if (total < n_sectors) |
| printf(_("Remaining %lld unallocated %d-byte sectors\n"), |
| n_sectors - total, sector_size); |
| } |
| |
| static unsigned long long |
| get_unused_start(int part_n, |
| unsigned long long start, |
| unsigned long long first[], |
| unsigned long long last[]) |
| { |
| int i; |
| |
| for (i = 0; i < partitions; i++) { |
| unsigned long long lastplusoff; |
| |
| if (start == ptes[i].offset) |
| start += sector_offset; |
| lastplusoff = last[i] + ((part_n < 4) ? 0 : sector_offset); |
| if (start >= first[i] && start <= lastplusoff) |
| start = lastplusoff + 1; |
| } |
| |
| return start; |
| } |
| |
| static void |
| add_partition(int n, int sys) { |
| char mesg[256]; /* 48 does not suffice in Japanese */ |
| int i, read = 0; |
| struct partition *p = ptes[n].part_table; |
| struct partition *q = ptes[ext_index].part_table; |
| long long llimit; |
| unsigned long long start, stop = 0, limit, temp, |
| first[partitions], last[partitions]; |
| |
| if (p && p->sys_ind) { |
| printf(_("Partition %d is already defined. Delete " |
| "it before re-adding it.\n"), n + 1); |
| return; |
| } |
| fill_bounds(first, last); |
| if (n < 4) { |
| start = sector_offset; |
| if (display_in_cyl_units || !total_number_of_sectors) |
| llimit = heads * sectors * cylinders - 1; |
| else |
| llimit = (total_number_of_sectors / sector_factor) - 1; |
| limit = llimit; |
| if (limit != llimit) |
| limit = 0x7fffffff; |
| if (extended_offset) { |
| first[ext_index] = extended_offset; |
| last[ext_index] = get_start_sect(q) + |
| get_nr_sects(q) - 1; |
| } |
| } else { |
| start = extended_offset + sector_offset; |
| limit = get_start_sect(q) + get_nr_sects(q) - 1; |
| } |
| if (display_in_cyl_units) |
| for (i = 0; i < partitions; i++) |
| first[i] = (cround(first[i]) - 1) * units_per_sector; |
| |
| snprintf(mesg, sizeof(mesg), _("First %s"), str_units(SINGULAR)); |
| do { |
| unsigned long long dflt, aligned; |
| |
| temp = start; |
| dflt = start = get_unused_start(n, start, first, last); |
| |
| /* the default sector should be aligned and unused */ |
| do { |
| aligned = align_lba_in_range(dflt, dflt, limit); |
| dflt = get_unused_start(n, aligned, first, last); |
| } while (dflt != aligned && dflt > aligned && dflt < limit); |
| |
| if (dflt >= limit) |
| dflt = start; |
| if (start > limit) |
| break; |
| if (start >= temp+units_per_sector && read) { |
| printf(_("Sector %llu is already allocated\n"), temp); |
| temp = start; |
| read = 0; |
| } |
| if (!read && start == temp) { |
| unsigned long long i = start; |
| |
| start = read_int(cround(i), cround(dflt), cround(limit), |
| 0, mesg); |
| if (display_in_cyl_units) { |
| start = (start - 1) * units_per_sector; |
| if (start < i) start = i; |
| } |
| read = 1; |
| } |
| } while (start != temp || !read); |
| if (n > 4) { /* NOT for fifth partition */ |
| struct pte *pe = &ptes[n]; |
| |
| pe->offset = start - sector_offset; |
| if (pe->offset == extended_offset) { /* must be corrected */ |
| pe->offset++; |
| if (sector_offset == 1) |
| start++; |
| } |
| } |
| |
| for (i = 0; i < partitions; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| if (start < pe->offset && limit >= pe->offset) |
| limit = pe->offset - 1; |
| if (start < first[i] && limit >= first[i]) |
| limit = first[i] - 1; |
| } |
| if (start > limit) { |
| printf(_("No free sectors available\n")); |
| if (n > 4) |
| partitions--; |
| return; |
| } |
| if (cround(start) == cround(limit)) { |
| stop = limit; |
| } else { |
| int sx = 0; |
| |
| snprintf(mesg, sizeof(mesg), |
| _("Last %1$s, +%2$s or +size{K,M,G}"), |
| str_units(SINGULAR), str_units(PLURAL)); |
| |
| stop = read_int_sx(cround(start), cround(limit), cround(limit), |
| cround(start), mesg, &sx); |
| if (display_in_cyl_units) { |
| stop = stop * units_per_sector - 1; |
| if (stop >limit) |
| stop = limit; |
| } |
| |
| if (sx && alignment_required) { |
| /* the last sector has not been exactly requested (but |
| * defined by +size{K,M,G} convention), so be smart |
| * and align the end of the partition. The next |
| * partition will start at phy.block boundary. |
| */ |
| stop = align_lba_in_range(stop, start, limit) - 1; |
| if (stop > limit) |
| stop = limit; |
| } |
| } |
| |
| set_partition(n, 0, start, stop, sys); |
| if (n > 4) |
| set_partition(n - 1, 1, ptes[n].offset, stop, EXTENDED); |
| |
| if (IS_EXTENDED (sys)) { |
| struct pte *pe4 = &ptes[4]; |
| struct pte *pen = &ptes[n]; |
| |
| ext_index = n; |
| pen->ext_pointer = p; |
| pe4->offset = extended_offset = start; |
| if (!(pe4->sectorbuffer = calloc(1, sector_size))) |
| fatal(out_of_memory); |
| pe4->part_table = pt_offset(pe4->sectorbuffer, 0); |
| pe4->ext_pointer = pe4->part_table + 1; |
| pe4->changed = 1; |
| partitions = 5; |
| } |
| } |
| |
| static void |
| add_logical(void) { |
| if (partitions > 5 || ptes[4].part_table->sys_ind) { |
| struct pte *pe = &ptes[partitions]; |
| |
| if (!(pe->sectorbuffer = calloc(1, sector_size))) |
| fatal(out_of_memory); |
| pe->part_table = pt_offset(pe->sectorbuffer, 0); |
| pe->ext_pointer = pe->part_table + 1; |
| pe->offset = 0; |
| pe->changed = 1; |
| partitions++; |
| } |
| add_partition(partitions - 1, LINUX_NATIVE); |
| } |
| |
| static void |
| new_partition(void) { |
| int i, free_primary = 0; |
| |
| if (warn_geometry()) |
| return; |
| |
| if (sun_label) { |
| add_sun_partition(get_partition(0, partitions), LINUX_NATIVE); |
| return; |
| } |
| |
| if (sgi_label) { |
| sgi_add_partition(get_partition(0, partitions), LINUX_NATIVE); |
| return; |
| } |
| |
| if (aix_label) { |
| printf(_("\tSorry - this fdisk cannot handle AIX disk labels." |
| "\n\tIf you want to add DOS-type partitions, create" |
| "\n\ta new empty DOS partition table first. (Use o.)" |
| "\n\tWARNING: " |
| "This will destroy the present disk contents.\n")); |
| return; |
| } |
| |
| if (mac_label) { |
| printf(_("\tSorry - this fdisk cannot handle Mac disk labels." |
| "\n\tIf you want to add DOS-type partitions, create" |
| "\n\ta new empty DOS partition table first. (Use o.)" |
| "\n\tWARNING: " |
| "This will destroy the present disk contents.\n")); |
| return; |
| } |
| |
| for (i = 0; i < 4; i++) |
| free_primary += !ptes[i].part_table->sys_ind; |
| |
| if (!free_primary && partitions >= MAXIMUM_PARTS) { |
| printf(_("The maximum number of partitions has been created\n")); |
| return; |
| } |
| |
| if (!free_primary) { |
| if (extended_offset) |
| add_logical(); |
| else |
| printf(_("You must delete some partition and add " |
| "an extended partition first\n")); |
| } else if (partitions >= MAXIMUM_PARTS) { |
| printf(_("All logical partitions are in use\n")); |
| printf(_("Adding a primary partition\n")); |
| add_partition(get_partition(0, 4), LINUX_NATIVE); |
| } else { |
| char c, line[LINE_LENGTH]; |
| snprintf(line, sizeof(line), |
| _("Command action\n %s\n p primary " |
| "partition (1-4)\n"), extended_offset ? |
| _("l logical (5 or over)") : _("e extended")); |
| while (1) { |
| if ((c = tolower(read_char(line))) == 'p') { |
| int i = get_nonexisting_partition(0, 4); |
| if (i >= 0) |
| add_partition(i, LINUX_NATIVE); |
| return; |
| } |
| else if (c == 'l' && extended_offset) { |
| add_logical(); |
| return; |
| } |
| else if (c == 'e' && !extended_offset) { |
| int i = get_nonexisting_partition(0, 4); |
| if (i >= 0) |
| add_partition(i, EXTENDED); |
| return; |
| } |
| else |
| printf(_("Invalid partition number " |
| "for type `%c'\n"), c); |
| } |
| } |
| } |
| |
| static void |
| write_table(void) { |
| int i; |
| |
| if (dos_label) { |
| for (i=0; i<3; i++) |
| if (ptes[i].changed) |
| ptes[3].changed = 1; |
| for (i = 3; i < partitions; i++) { |
| struct pte *pe = &ptes[i]; |
| |
| if (pe->changed) { |
| write_part_table_flag(pe->sectorbuffer); |
| write_sector(fd, pe->offset, pe->sectorbuffer); |
| } |
| } |
| } |
| else if (sgi_label) { |
| /* no test on change? the printf below might be mistaken */ |
| sgi_write_table(); |
| } else if (sun_label) { |
| int needw = 0; |
| |
| for (i=0; i<8; i++) |
| if (ptes[i].changed) |
| needw = 1; |
| if (needw) |
| sun_write_table(); |
| } |
| |
| printf(_("The partition table has been altered!\n\n")); |
| reread_partition_table(1); |
| } |
| |
| void |
| reread_partition_table(int leave) { |
| int i; |
| struct stat statbuf; |
| |
| i = fstat(fd, &statbuf); |
| if (i == 0 && S_ISBLK(statbuf.st_mode)) { |
| sync(); |
| #ifdef BLKRRPART |
| printf(_("Calling ioctl() to re-read partition table.\n")); |
| i = ioctl(fd, BLKRRPART); |
| #else |
| errno = ENOSYS; |
| i = 1; |
| #endif |
| } |
| |
| if (i) { |
| printf(_("\nWARNING: Re-reading the partition table failed with error %d: %s.\n" |
| "The kernel still uses the old table. The new table will be used at\n" |
| "the next reboot or after you run partprobe(8) or kpartx(8)\n"), |
| errno, strerror(errno)); |
| } |
| |
| if (dos_changed) |
| printf( |
| _("\nWARNING: If you have created or modified any DOS 6.x\n" |
| "partitions, please see the fdisk manual page for additional\n" |
| "information.\n")); |
| |
| if (leave) { |
| if (fsync(fd) || close(fd)) { |
| fprintf(stderr, _("\nError closing file\n")); |
| exit(1); |
| } |
| |
| printf(_("Syncing disks.\n")); |
| sync(); |
| exit(!!i); |
| } |
| } |
| |
| #define MAX_PER_LINE 16 |
| static void |
| print_buffer(unsigned char pbuffer[]) { |
| int i, |
| l; |
| |
| for (i = 0, l = 0; i < sector_size; i++, l++) { |
| if (l == 0) |
| printf("0x%03X:", i); |
| printf(" %02X", pbuffer[i]); |
| if (l == MAX_PER_LINE - 1) { |
| printf("\n"); |
| l = -1; |
| } |
| } |
| if (l > 0) |
| printf("\n"); |
| printf("\n"); |
| } |
| |
| static void |
| print_raw(void) { |
| int i; |
| |
| printf(_("Device: %s\n"), disk_device); |
| if (sun_label || sgi_label) |
| print_buffer(MBRbuffer); |
| else for (i = 3; i < partitions; i++) |
| print_buffer(ptes[i].sectorbuffer); |
| } |
| |
| static void |
| move_begin(int i) { |
| struct pte *pe = &ptes[i]; |
| struct partition *p = pe->part_table; |
| unsigned int new, first; |
| |
| if (warn_geometry()) |
| return; |
| if (!p->sys_ind || !get_nr_sects(p) || IS_EXTENDED (p->sys_ind)) { |
| printf(_("Partition %d has no data area\n"), i + 1); |
| return; |
| } |
| first = get_partition_start(pe); |
| new = read_int(first, first, first + get_nr_sects(p) - 1, first, |
| _("New beginning of data")) - pe->offset; |
| |
| if (new != get_nr_sects(p)) { |
| first = get_nr_sects(p) + get_start_sect(p) - new; |
| set_nr_sects(p, first); |
| set_start_sect(p, new); |
| pe->changed = 1; |
| } |
| } |
| |
| static void |
| xselect(void) { |
| char c; |
| |
| while(1) { |
| putchar('\n'); |
| c = tolower(read_char(_("Expert command (m for help): "))); |
| switch (c) { |
| case 'a': |
| if (sun_label) |
| sun_set_alt_cyl(); |
| break; |
| case 'b': |
| if (dos_label) |
| move_begin(get_partition(0, partitions)); |
| break; |
| case 'c': |
| user_cylinders = cylinders = |
| read_int(1, cylinders, 1048576, 0, |
| _("Number of cylinders")); |
| if (sun_label) |
| sun_set_ncyl(cylinders); |
| break; |
| case 'd': |
| print_raw(); |
| break; |
| case 'e': |
| if (sgi_label) |
| sgi_set_xcyl(); |
| else if (sun_label) |
| sun_set_xcyl(); |
| else |
| if (dos_label) |
| x_list_table(1); |
| break; |
| case 'f': |
| if (dos_label) |
| fix_partition_table_order(); |
| break; |
| case 'g': |
| create_sgilabel(); |
| break; |
| case 'h': |
| user_heads = heads = read_int(1, heads, 256, 0, |
| _("Number of heads")); |
| update_units(); |
| break; |
| case 'i': |
| if (sun_label) |
| sun_set_ilfact(); |
| if (dos_label) |
| dos_set_mbr_id(); |
| break; |
| case 'o': |
| if (sun_label) |
| sun_set_rspeed(); |
| break; |
| case 'p': |
| if (sun_label) |
| list_table(1); |
| else |
| x_list_table(0); |
| break; |
| case 'q': |
| close(fd); |
| printf("\n"); |
| exit(0); |
| case 'r': |
| return; |
| case 's': |
| user_sectors = sectors = read_int(1, sectors, 63, 0, |
| _("Number of sectors")); |
| if (dos_compatible_flag) |
| fprintf(stderr, _("Warning: setting " |
| "sector offset for DOS " |
| "compatiblity\n")); |
| update_sector_offset(); |
| update_units(); |
| break; |
| case 'v': |
| verify(); |
| break; |
| case 'w': |
| write_table(); /* does not return */ |
| break; |
| case 'y': |
| if (sun_label) |
| sun_set_pcylcount(); |
| break; |
| default: |
| xmenu(); |
| } |
| } |
| } |
| |
| static int |
| is_ide_cdrom_or_tape(char *device) { |
| FILE *procf; |
| char buf[100]; |
| struct stat statbuf; |
| int is_ide = 0; |
| |
| /* No device was given explicitly, and we are trying some |
| likely things. But opening /dev/hdc may produce errors like |
| "hdc: tray open or drive not ready" |
| if it happens to be a CD-ROM drive. It even happens that |
| the process hangs on the attempt to read a music CD. |
| So try to be careful. This only works since 2.1.73. */ |
| |
| if (strncmp("/dev/hd", device, 7)) |
| return 0; |
| |
| snprintf(buf, sizeof(buf), "/proc/ide/%s/media", device+5); |
| procf = fopen(buf, "r"); |
| if (procf != NULL && fgets(buf, sizeof(buf), procf)) |
| is_ide = (!strncmp(buf, "cdrom", 5) || |
| !strncmp(buf, "tape", 4)); |
| else |
| /* Now when this proc file does not exist, skip the |
| device when it is read-only. */ |
| if (stat(device, &statbuf) == 0) |
| is_ide = ((statbuf.st_mode & 0222) == 0); |
| |
| if (procf) |
| fclose(procf); |
| return is_ide; |
| } |
| |
| static void |
| gpt_warning(char *dev) |
| { |
| if (dev && gpt_probe_signature_devname(dev)) |
| fprintf(stderr, _("\nWARNING: GPT (GUID Partition Table) detected on '%s'! " |
| "The util fdisk doesn't support GPT. Use GNU Parted.\n\n"), dev); |
| } |
| |
| static void |
| try(char *device, int user_specified) { |
| int gb; |
| |
| disk_device = device; |
| if (setjmp(listingbuf)) |
| return; |
| if (!user_specified) |
| if (is_ide_cdrom_or_tape(device)) |
| return; |
| gpt_warning(device); |
| if ((fd = open(disk_device, type_open)) >= 0) { |
| gb = get_boot(try_only); |
| if (gb > 0) { /* I/O error */ |
| } else if (gb < 0) { /* no DOS signature */ |
| list_disk_geometry(); |
| if (!aix_label && !mac_label && btrydev(device) < 0) |
| fprintf(stderr, |
| _("Disk %s doesn't contain a valid " |
| "partition table\n"), device); |
| } else { |
| list_table(0); |
| } |
| close(fd); |
| } else { |
| /* Ignore other errors, since we try IDE |
| and SCSI hard disks which may not be |
| installed on the system. */ |
| if (errno == EACCES) { |
| fprintf(stderr, _("Cannot open %s\n"), device); |
| return; |
| } |
| } |
| } |
| |
| /* |
| * for fdisk -l: |
| * try all things in /proc/partitions that look like a full disk |
| */ |
| static void |
| tryprocpt(void) { |
| FILE *procpt; |
| char line[128], ptname[128], devname[256]; |
| int ma, mi; |
| unsigned long long sz; |
| |
| procpt = fopen(PROC_PARTITIONS, "r"); |
| if (procpt == NULL) { |
| fprintf(stderr, _("cannot open %s\n"), PROC_PARTITIONS); |
| return; |
| } |
| |
| while (fgets(line, sizeof(line), procpt)) { |
| if (sscanf (line, " %d %d %llu %128[^\n ]", |
| &ma, &mi, &sz, ptname) != 4) |
| continue; |
| snprintf(devname, sizeof(devname), "/dev/%s", ptname); |
| if (is_whole_disk(devname)) |
| try(devname, 0); |
| } |
| fclose(procpt); |
| } |
| |
| static void |
| dummy(int *kk) {} |
| |
| static void |
| unknown_command(int c) { |
| printf(_("%c: unknown command\n"), c); |
| } |
| |
| |
| |
| int |
| main(int argc, char **argv) { |
| int j, c; |
| int optl = 0, opts = 0; |
| |
| setlocale(LC_ALL, ""); |
| bindtextdomain(PACKAGE, LOCALEDIR); |
| textdomain(PACKAGE); |
| |
| while ((c = getopt(argc, argv, "b:cC:hH:lsS:uvV")) != -1) { |
| switch (c) { |
| case 'b': |
| /* Ugly: this sector size is really per device, |
| so cannot be combined with multiple disks, |
| and te same goes for the C/H/S options. |
| */ |
| sector_size = atoi(optarg); |
| if (sector_size != 512 && sector_size != 1024 && |
| sector_size != 2048 && sector_size != 4096) |
| fatal(usage); |
| sector_offset = 2; |
| user_set_sector_size = 1; |
| break; |
| case 'C': |
| user_cylinders = atoi(optarg); |
| break; |
| case 'c': |
| dos_compatible_flag = 0; |
| break; |
| case 'h': |
| fatal(help); |
| break; |
| case 'H': |
| user_heads = atoi(optarg); |
| if (user_heads <= 0 || user_heads > 256) |
| user_heads = 0; |
| break; |
| case 'S': |
| user_sectors = atoi(optarg); |
| if (user_sectors <= 0 || user_sectors >= 64) |
| user_sectors = 0; |
| break; |
| case 'l': |
| optl = 1; |
| break; |
| case 's': |
| opts = 1; |
| break; |
| case 'u': |
| display_in_cyl_units = 0; |
| break; |
| case 'V': |
| case 'v': |
| printf("fdisk (%s)\n", PACKAGE_STRING); |
| exit(0); |
| default: |
| fatal(usage); |
| } |
| } |
| |
| #if 0 |
| printf(_("This kernel finds the sector size itself - " |
| "-b option ignored\n")); |
| #else |
| if (user_set_sector_size && argc-optind != 1) |
| printf(_("Warning: the -b (set sector size) option should" |
| " be used with one specified device\n")); |
| #endif |
| |
| init_mbr_buffer(); |
| |
| if (optl) { |
| nowarn = 1; |
| type_open = O_RDONLY; |
| if (argc > optind) { |
| int k; |
| /* avoid gcc warning: |
| variable `k' might be clobbered by `longjmp' */ |
| dummy(&k); |
| listing = 1; |
| for (k = optind; k < argc; k++) |
| try(argv[k], 1); |
| } else { |
| /* we no longer have default device names */ |
| /* but we can use /proc/partitions instead */ |
| tryprocpt(); |
| } |
| exit(0); |
| } |
| |
| if (opts) { |
| unsigned long long |