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