return 0;
}
+static inline int gpt_entry_is_used(const struct gpt_entry *e)
+{
+ return memcmp(&e->type, &GPT_UNUSED_ENTRY_GUID,
+ sizeof(struct gpt_guid)) != 0;
+}
+
static const char *gpt_get_header_revstr(struct gpt_header *header)
{
return gpt_calculate_sizeof_ents(hdr, le32_to_cpu(hdr->npartition_entries), sz);
}
-static inline int partition_unused(const struct gpt_entry *e)
-{
- return !memcmp(&e->type, &GPT_UNUSED_ENTRY_GUID,
- sizeof(struct gpt_guid));
-}
static char *gpt_get_header_id(struct gpt_header *header)
{
for (i = 0; i < gpt_get_nentries(gpt); i++) {
struct gpt_entry *e = gpt_get_entry(gpt, i);
- if (!partition_unused(e))
+ if (gpt_entry_is_used(e))
used++;
}
return used;
for (i = 0; i < gpt_get_nentries(gpt); i++) {
struct gpt_entry *e = gpt_get_entry(gpt, i);
- if (partition_unused(e))
+ if (!gpt_entry_is_used(e))
continue;
if (gpt_partition_end(e) >= sectors)
return i + 1;
for (i = 0; i < gpt_get_nentries(gpt); i++) {
struct gpt_entry *e = gpt_get_entry(gpt, i);
- if (partition_unused(e))
+ if (!gpt_entry_is_used(e))
continue;
if (gpt_partition_start(e) > gpt_partition_end(e))
return i + 1;
struct gpt_entry *ei = gpt_get_entry(gpt, i);
struct gpt_entry *ej = gpt_get_entry(gpt, j);
- if (partition_unused(ei) || partition_unused(ej))
+ if (!gpt_entry_is_used(ei) || !gpt_entry_is_used(ej))
continue;
if (partition_overlap(ei, ej)) {
DBG(LABEL, ul_debug("GPT partitions overlap detected [%zu vs. %zu]", i, j));
for (i = 0; i < gpt_get_nentries(gpt); i++) {
struct gpt_entry *e = gpt_get_entry(gpt, i);
- if (partition_unused(e))
+ if (!gpt_entry_is_used(e))
continue;
if (first < gpt_partition_start(e))
continue;
gpt = self_label(cxt);
e = gpt_get_entry(gpt, n);
- pa->used = !partition_unused(e) || gpt_partition_start(e);
+ pa->used = gpt_entry_is_used(e) || gpt_partition_start(e);
if (!pa->used)
return 0;
if (partnum >= cxt->label->nparts_max)
return -EINVAL;
- if (partition_unused(gpt_get_entry(gpt, partnum)))
+ if (!gpt_entry_is_used(gpt_get_entry(gpt, partnum)))
return -EINVAL;
/* hasta la vista, baby! */
assert(partnum < gpt_get_nentries(gpt));
- if (!partition_unused(gpt_get_entry(gpt, partnum))) {
+ if (gpt_entry_is_used(gpt_get_entry(gpt, partnum))) {
fdisk_warnx(cxt, _("Partition %zu is already defined. "
"Delete it before re-adding it."), partnum +1);
return -ERANGE;
/* if first sector no explicitly defined then ignore small gaps before
* the first partition */
if ((!pa || !fdisk_partition_has_start(pa))
- && !partition_unused(e)
+ && gpt_entry_is_used(e)
&& disk_f < gpt_partition_start(e)) {
do {
for (i = 0; i < gpt_get_nentries(gpt); i++) {
struct gpt_entry *e = gpt_get_entry(gpt, i);
- if (partition_unused(e))
+ if (!gpt_entry_is_used(e))
continue;
if (gpt_partition_start(e) < first_usable) {
fdisk_warnx(cxt, _("Partition #%zu out of range (minimal start is %"PRIu64" sectors)"),
e = gpt_get_entry(gpt, i);
- return !partition_unused(e) || gpt_partition_start(e);
+ return gpt_entry_is_used(e) || gpt_partition_start(e);
}
/**
{
struct gpt_entry *ae = (struct gpt_entry *) a,
*be = (struct gpt_entry *) b;
- int au = partition_unused(ae),
- bu = partition_unused(be);
+ int au = gpt_entry_is_used(ae),
+ bu = gpt_entry_is_used(be);
- if (au && bu)
+ if (!au && !bu)
return 0;
- if (au)
+ if (!au)
return 1;
- if (bu)
+ if (!bu)
return -1;
return cmp_numbers(gpt_partition_start(ae), gpt_partition_start(be));