mirror of
git://sourceware.org/git/lvm2.git
synced 2024-10-28 20:25:52 +03:00
58 lines
1.0 KiB
C
58 lines
1.0 KiB
C
/*
|
|
* Copyright (C) 2001 Sistina Software (UK) Limited.
|
|
*
|
|
* This file is released under the GPL.
|
|
*/
|
|
|
|
#include "log.h"
|
|
#include "pool.h"
|
|
#include "disk-rep.h"
|
|
|
|
/*
|
|
* FIXME: Quick hack. We can use caching to
|
|
* prevent a total re-read, even so vg_number
|
|
* causes the tools to check *every* pv. Yuck.
|
|
* Put in seperate file so it wouldn't contaminate
|
|
* other code.
|
|
*/
|
|
int get_free_vg_number(struct dev_filter *filter, const char *candidate_vg,
|
|
int *result)
|
|
{
|
|
struct list_head all_pvs, *tmp;
|
|
struct disk_list *dl;
|
|
struct pool *mem = pool_create(10 * 1024);
|
|
int numbers[MAX_VG], i, r = 0;
|
|
|
|
if (!mem) {
|
|
stack;
|
|
return 0;
|
|
}
|
|
|
|
if (!read_pvs_in_vg(NULL, filter, mem, &all_pvs)) {
|
|
stack;
|
|
goto out;
|
|
}
|
|
|
|
memset(numbers, 0, sizeof(numbers));
|
|
|
|
list_for_each (tmp, &all_pvs) {
|
|
dl = list_entry(tmp, struct disk_list, list);
|
|
if (!strcmp(dl->pv.vg_name, candidate_vg))
|
|
continue;
|
|
|
|
numbers[dl->vg.vg_number] = 1;
|
|
}
|
|
|
|
for (i = 0; i < MAX_VG; i++) {
|
|
if (!numbers[i]) {
|
|
r = 1;
|
|
*result = i;
|
|
break;
|
|
}
|
|
}
|
|
|
|
out:
|
|
pool_destroy(mem);
|
|
return r;
|
|
}
|