Currently we are using part.size in partitionCompare(), this will
return the grown size of a partition if it is already grown at this
point, potentially changing the order in which we allocate partitions
while we are growing. By using req_base_size we will always allocate
the partitions in the same order while growing multiple partitions.
---
storage/partitioning.py | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
diff --git a/storage/partitioning.py b/storage/partitioning.py
index 9d298bb..7a59747 100644
--- a/storage/partitioning.py
+++ b/storage/partitioning.py
@@ -373,7 +373,7 @@ def partitionCompare(part1, part2):
ret -= cmp(part1.req_primary, part2.req_primary) * 200
# larger requests go to the front of the list
- ret -= cmp(part1.size, part2.size) * 100
+ ret -= cmp(part1.req_base_size, part2.req_base_size) * 100
# fixed size requests to the front
ret += cmp(part1.req_grow, part2.req_grow) * 50
--
1.6.2
_______________________________________________
Anaconda-devel-list mailing list
Anaconda-devel-list@xxxxxxxxxx
https://www.redhat.com/mailman/listinfo/anaconda-devel-list
