mirror of
git://sourceware.org/git/lvm2.git
synced 2024-10-28 03:27:58 +03:00
25b733809a
Lots of changes/very little testing so far => there'll be bugs!
Use 'vgcreate -M text' to create a volume group with its metadata stored
in text files. Text format metadata changes should be reasonably atomic,
with a (basic) automatic recovery mechanism if the system crashes while a
change is in progress.
Add a metadata section to lvm.conf to specify multiple directories if
you want (recommended) to keep multiple copies of the metadata (eg on
different filesystems).
e.g. metadata {
dirs = ["/etc/lvm/metadata1","/usr/local/lvm/metadata2"]
}
Plenty of refinements still in the pipeline.
110 lines
1.5 KiB
C
110 lines
1.5 KiB
C
/*
|
|
* Copyright (C) 2001 Sistina Software (UK) Limited.
|
|
*
|
|
* This file is released under the LGPL.
|
|
*/
|
|
|
|
#include "ttree.h"
|
|
#include "pool.h"
|
|
#include "log.h"
|
|
|
|
struct node {
|
|
unsigned k;
|
|
struct node *l, *m, *r;
|
|
void *data;
|
|
};
|
|
|
|
struct ttree {
|
|
int klen;
|
|
struct pool *mem;
|
|
struct node *root;
|
|
};
|
|
|
|
struct node **_lookup_single(struct node **c, unsigned int k)
|
|
{
|
|
while (*c) {
|
|
if (k < (*c)->k)
|
|
c = &((*c)->l);
|
|
|
|
else if (k > (*c)->k)
|
|
c = &((*c)->r);
|
|
|
|
else {
|
|
c = &((*c)->m);
|
|
break;
|
|
}
|
|
}
|
|
|
|
return c;
|
|
}
|
|
|
|
void *ttree_lookup(struct ttree *tt, unsigned *key)
|
|
{
|
|
struct node **c = &tt->root;
|
|
int count = tt->klen;
|
|
|
|
while (*c && count) {
|
|
c = _lookup_single(c, *key++);
|
|
count--;
|
|
}
|
|
|
|
return *c ? (*c)->data : NULL;
|
|
}
|
|
|
|
static struct node *_node(struct pool *mem, unsigned int k)
|
|
{
|
|
struct node *n = pool_zalloc(mem, sizeof(*n));
|
|
|
|
if (n)
|
|
n->k = k;
|
|
|
|
return n;
|
|
}
|
|
|
|
int ttree_insert(struct ttree *tt, unsigned int *key, void *data)
|
|
{
|
|
struct node **c = &tt->root;
|
|
int count = tt->klen;
|
|
unsigned int k;
|
|
|
|
do {
|
|
k = *key++;
|
|
c = _lookup_single(c, k);
|
|
count--;
|
|
|
|
} while (*c && count);
|
|
|
|
if (!*c) {
|
|
count++;
|
|
|
|
while (count--) {
|
|
if (!(*c = _node(tt->mem, k))) {
|
|
stack;
|
|
return 0;
|
|
}
|
|
|
|
k = *key++;
|
|
|
|
if (count)
|
|
c = &((*c)->m);
|
|
}
|
|
}
|
|
(*c)->data = data;
|
|
|
|
return 1;
|
|
}
|
|
|
|
struct ttree *ttree_create(struct pool *mem, unsigned int klen)
|
|
{
|
|
struct ttree *tt;
|
|
|
|
if (!(tt = pool_zalloc(mem, sizeof(*tt)))) {
|
|
stack;
|
|
return NULL;
|
|
}
|
|
|
|
tt->klen = klen;
|
|
tt->mem = mem;
|
|
return tt;
|
|
}
|