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
22 * The in core rep. only stores a mapping from
23 * logical extents to physical extents against an
24 * lv. Sometimes, when allocating a new lv for
25 * instance, it is useful to have the inverse
34 /* Number of extents unreserved during ALLOC_ANYWHERE allocation. */
37 struct dm_list list; /* pv_map.areas */
41 * When building up a potential group of "parallel" extent ranges during
42 * an allocation attempt, track the maximum number of extents that may
43 * need to be used as a particular parallel area. Several of these
44 * structs may reference the same pv_area, but 'used' may differ between
45 * them. The sum of all the 'used' variables referring to the same
46 * pv_area may not exceed that area's count, so we cannot allocate the
55 struct physical_volume *pv;
56 struct dm_list areas; /* struct pv_areas */
57 uint32_t pe_count; /* Total number of PEs */
63 * Find intersection between available_pvs and free space in VG
65 struct dm_list *create_pv_maps(struct dm_pool *mem, struct volume_group *vg,
66 struct dm_list *allocatable_pvs);
68 void consume_pv_area(struct pv_area *area, uint32_t to_go);
69 void reinsert_reduced_pv_area(struct pv_area *pva);
71 uint32_t pv_maps_size(struct dm_list *pvms);