NetBSD/sbin/gpt/map.c

337 lines
7.7 KiB
C

/*-
* Copyright (c) 2002 Marcel Moolenaar
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#ifdef __FBSDID
__FBSDID("$FreeBSD: src/sbin/gpt/map.c,v 1.6 2005/08/31 01:47:19 marcel Exp $");
#endif
#ifdef __RCSID
__RCSID("$NetBSD: map.c,v 1.6 2013/11/27 20:40:48 christos Exp $");
#endif
#include <sys/types.h>
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include "map.h"
int lbawidth;
static map_t *mediamap;
static map_t *
mkmap(off_t start, off_t size, int type)
{
map_t *m;
m = malloc(sizeof(*m));
if (m == NULL)
return (NULL);
m->map_start = start;
m->map_size = size;
m->map_next = m->map_prev = NULL;
m->map_type = type;
m->map_index = 0;
m->map_data = NULL;
return (m);
}
map_t *
map_add(off_t start, off_t size, int type, void *data)
{
map_t *m, *n, *p;
n = mediamap;
while (n != NULL && n->map_start + n->map_size <= start)
n = n->map_next;
if (n == NULL)
return (NULL);
if (n->map_start + n->map_size < start + size) {
warnx("error: map entry doesn't fit media");
return (NULL);
}
if (n->map_start == start && n->map_size == size) {
if (n->map_type != MAP_TYPE_UNUSED) {
if (n->map_type != MAP_TYPE_MBR_PART ||
type != MAP_TYPE_GPT_PART) {
warnx("warning: partition(%llu,%llu) mirrored",
(long long)start, (long long)size);
}
}
n->map_type = type;
n->map_data = data;
return (n);
}
if (n->map_type != MAP_TYPE_UNUSED) {
if (n->map_type != MAP_TYPE_MBR_PART ||
type != MAP_TYPE_GPT_PART) {
warnx("error: bogus map");
return (0);
}
n->map_type = MAP_TYPE_UNUSED;
}
m = mkmap(start, size, type);
if (m == NULL)
return (NULL);
m->map_data = data;
if (start == n->map_start) {
m->map_prev = n->map_prev;
m->map_next = n;
if (m->map_prev != NULL)
m->map_prev->map_next = m;
else
mediamap = m;
n->map_prev = m;
n->map_start += size;
n->map_size -= size;
} else if (start + size == n->map_start + n->map_size) {
p = n;
m->map_next = p->map_next;
m->map_prev = p;
if (m->map_next != NULL)
m->map_next->map_prev = m;
p->map_next = m;
p->map_size -= size;
} else {
p = mkmap(n->map_start, start - n->map_start, n->map_type);
n->map_start += p->map_size + m->map_size;
n->map_size -= (p->map_size + m->map_size);
p->map_prev = n->map_prev;
m->map_prev = p;
n->map_prev = m;
m->map_next = n;
p->map_next = m;
if (p->map_prev != NULL)
p->map_prev->map_next = p;
else
mediamap = p;
}
return (m);
}
map_t *
map_alloc(off_t start, off_t size, off_t alignment)
{
off_t delta;
map_t *m;
if (alignment > 0) {
if ((start % alignment) != 0)
start = (start + alignment) / alignment * alignment;
if ((size % alignment) != 0)
size = (size + alignment) / alignment * alignment;
}
for (m = mediamap; m != NULL; m = m->map_next) {
if (m->map_type != MAP_TYPE_UNUSED || m->map_start < 2)
continue;
if (start != 0 && m->map_start > start)
return (NULL);
if (start != 0)
delta = start - m->map_start;
else if (alignment > 0 && m->map_start % alignment != 0)
delta = (m->map_start + alignment) /
alignment * alignment - m->map_start;
else
delta = 0;
if (size == 0 || m->map_size - delta >= size) {
if (m->map_size - delta < alignment)
continue;
if (size == 0) {
if (alignment > 0 &&
(m->map_size - delta) % alignment != 0)
size = (m->map_size - delta) /
alignment * alignment;
else
size = m->map_size - delta;
}
return map_add(m->map_start + delta, size,
MAP_TYPE_GPT_PART, NULL);
}
}
return NULL;
}
off_t
map_resize(map_t *m, off_t size, off_t alignment)
{
map_t *n, *o;
off_t alignsize, prevsize;
n = m->map_next;
if (size < 0 || alignment < 0) {
warnx("negative size or alignment");
return 0;
}
if (size == 0 && alignment == 0) {
if (n == NULL || n->map_type != MAP_TYPE_UNUSED)
return 0;
else {
size = m->map_size + n->map_size;
m->map_size = size;
m->map_next = n->map_next;
if (n->map_next != NULL)
n->map_next->map_prev = m;
if (n->map_data != NULL)
free(n->map_data);
free(n);
return size;
}
}
if (size == 0 && alignment > 0) {
if (n == NULL || n->map_type != MAP_TYPE_UNUSED)
return 0;
else {
prevsize = m->map_size;
size = (m->map_size + n->map_size) /
alignment * alignment;
if (size <= prevsize)
return 0;
m->map_size = size;
n->map_start += size - prevsize;
n->map_size -= size - prevsize;
if (n->map_size == 0) {
m->map_next = n->map_next;
if (n->map_next != NULL)
n->map_next->map_prev = m;
if (n->map_data != NULL)
free(n->map_data);
free(n);
}
return size;
}
}
alignsize = size;
if (alignment % size != 0)
alignsize = (size + alignment) / alignment * alignment;
if (alignsize < m->map_size) { /* shrinking */
prevsize = m->map_size;
m->map_size = alignsize;
if (n == NULL || n->map_type != MAP_TYPE_UNUSED) {
o = mkmap(m->map_start + alignsize,
prevsize - alignsize, MAP_TYPE_UNUSED);
m->map_next = o;
o->map_prev = m;
o->map_next = n;
if (n != NULL)
n->map_prev = o;
return alignsize;
} else {
n->map_start -= alignsize;
n->map_size += alignsize;
return alignsize;
}
} else if (alignsize > m->map_size) { /* expanding */
if (n == NULL || n->map_type != MAP_TYPE_UNUSED ||
n->map_size < alignsize - m->map_size) {
return 0;
}
n->map_size -= alignsize - m->map_size;
n->map_start += alignsize - m->map_size;
if (n->map_size == 0) {
m->map_next = n->map_next;
if (n->map_next != NULL)
n->map_next->map_prev = m;
if (n->map_data != NULL)
free(n->map_data);
free(n);
}
m->map_size = alignsize;
return alignsize;
} else /* correct size */
return alignsize;
}
map_t *
map_find(int type)
{
map_t *m;
m = mediamap;
while (m != NULL && m->map_type != type)
m = m->map_next;
return (m);
}
map_t *
map_first(void)
{
return mediamap;
}
map_t *
map_last(void)
{
map_t *m;
m = mediamap;
while (m != NULL && m->map_next != NULL)
m = m->map_next;
return (m);
}
off_t
map_free(off_t start, off_t size)
{
map_t *m;
m = mediamap;
while (m != NULL && m->map_start + m->map_size <= start)
m = m->map_next;
if (m == NULL || m->map_type != MAP_TYPE_UNUSED)
return (0LL);
if (size)
return ((m->map_start + m->map_size >= start + size) ? 1 : 0);
return (m->map_size - (start - m->map_start));
}
void
map_init(off_t size)
{
char buf[32];
mediamap = mkmap(0LL, size, MAP_TYPE_UNUSED);
lbawidth = sprintf(buf, "%llu", (long long)size);
if (lbawidth < 5)
lbawidth = 5;
}