diff options
author | John McCall <rjmccall@apple.com> | 2021-07-21 15:39:42 -0400 |
---|---|---|
committer | John McCall <rjmccall@apple.com> | 2021-07-21 15:47:18 -0400 |
commit | 326a5a2658d81db46a78b184fe42e522ef170f32 (patch) | |
tree | 219ddf79c93c83b67f09bf6732d37709b38221f9 /llvm/lib/Support/OptimizedStructLayout.cpp | |
parent | 9643d11e1d7f918c0e5184c9488935720d591c90 (diff) | |
download | llvm-326a5a2658d81db46a78b184fe42e522ef170f32.zip llvm-326a5a2658d81db46a78b184fe42e522ef170f32.tar.gz llvm-326a5a2658d81db46a78b184fe42e522ef170f32.tar.bz2 |
Fix a bug in OptimizedStructLayout when filling gaps before
fixed fields with highly-aligned flexible fields.
The code was not considering the possibility that aligning
the current offset to the alignment of a queue might push
us past the end of the gap. Subtracting the offsets to
figure out the maximum field size for the gap then overflowed,
making us think that we had nearly unbounded space to fill.
Fixes PR 51131.
Diffstat (limited to 'llvm/lib/Support/OptimizedStructLayout.cpp')
-rw-r--r-- | llvm/lib/Support/OptimizedStructLayout.cpp | 8 |
1 files changed, 7 insertions, 1 deletions
diff --git a/llvm/lib/Support/OptimizedStructLayout.cpp b/llvm/lib/Support/OptimizedStructLayout.cpp index 9bbd767..19a93ed 100644 --- a/llvm/lib/Support/OptimizedStructLayout.cpp +++ b/llvm/lib/Support/OptimizedStructLayout.cpp @@ -350,6 +350,7 @@ llvm::performOptimizedStructLayout(MutableArrayRef<Field> Fields) { Optional<uint64_t> EndOffset) -> bool { assert(Queue->Head); assert(StartOffset == alignTo(LastEnd, Queue->Alignment)); + assert(!EndOffset || StartOffset < *EndOffset); // Figure out the maximum size that a field can be, and ignore this // queue if there's nothing in it that small. @@ -372,6 +373,7 @@ llvm::performOptimizedStructLayout(MutableArrayRef<Field> Fields) { // Helper function to find the "best" flexible-offset field according // to the criteria described above. auto tryAddBestField = [&](Optional<uint64_t> BeforeOffset) -> bool { + assert(!BeforeOffset || LastEnd < *BeforeOffset); auto QueueB = FlexibleFieldsByAlignment.begin(); auto QueueE = FlexibleFieldsByAlignment.end(); @@ -403,9 +405,12 @@ llvm::performOptimizedStructLayout(MutableArrayRef<Field> Fields) { return false; // Otherwise, scan backwards to find the most-aligned queue that - // still has minimal leading padding after LastEnd. + // still has minimal leading padding after LastEnd. If that + // minimal padding is already at or past the end point, we're done. --FirstQueueToSearch; Offset = alignTo(LastEnd, FirstQueueToSearch->Alignment); + if (BeforeOffset && Offset >= *BeforeOffset) + return false; while (FirstQueueToSearch != QueueB && Offset == alignTo(LastEnd, FirstQueueToSearch[-1].Alignment)) --FirstQueueToSearch; @@ -415,6 +420,7 @@ llvm::performOptimizedStructLayout(MutableArrayRef<Field> Fields) { // Phase 1: fill the gaps between fixed-offset fields with the best // flexible-offset field that fits. for (auto I = Fields.begin(); I != FirstFlexible; ++I) { + assert(LastEnd <= I->Offset); while (LastEnd != I->Offset) { if (!tryAddBestField(I->Offset)) break; |