2 * Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved.
3 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
5 * This file is part of LVM2.
7 * This copyrighted material is made available to anyone wishing to use,
8 * modify, copy, or redistribute it subject to the terms and conditions
9 * of the GNU Lesser General Public License v.2.1.
11 * You should have received a copy of the GNU Lesser General Public License
12 * along with this program; if not, write to the Free Software Foundation,
13 * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 * FIXME: Quick hack. We can use caching to
21 * prevent a total re-read, even so vg_number
22 * causes the tools to check *every* pv. Yuck.
23 * Put in separate file so it wouldn't contaminate
26 int get_free_vg_number(struct format_instance *fid, struct dev_filter *filter,
27 const char *candidate_vg, int *result)
29 struct dm_list all_pvs;
31 struct dm_pool *mem = dm_pool_create("lvm1 vg_number", 10 * 1024);
32 int numbers[MAX_VG], i, r = 0;
34 dm_list_init(&all_pvs);
39 if (!read_pvs_in_vg(fid->fmt, NULL, filter, mem, &all_pvs))
42 memset(numbers, 0, sizeof(numbers));
44 dm_list_iterate_items(dl, &all_pvs) {
45 if (!*dl->pvd.vg_name || !strcmp((char *)dl->pvd.vg_name, candidate_vg))
48 numbers[dl->vgd.vg_number] = 1;
51 for (i = 0; i < MAX_VG; i++) {