@@ -877,7 +877,6 @@ AvailableValues &Implementation::computeAvailableValues(SILBasicBlock *block) {
877
877
llvm::dbgs ()
878
878
<< " Destructuring available values in preds to smallest size for bb"
879
879
<< block->getDebugID() << '\n');
880
- auto *fn = block->getFunction ();
881
880
IntervalMapAllocator::Map typeSpanToValue (getAllocator());
882
881
for (auto *predBlock : predsSkippingBackEdges) {
883
882
SWIFT_DEFER { typeSpanToValue.clear (); };
@@ -930,20 +929,10 @@ AvailableValues &Implementation::computeAvailableValues(SILBasicBlock *block) {
930
929
// smallest offset size could result in further destructuring that an
931
930
// earlier value required. Instead, we do a final loop afterwards using
932
931
// the interval map to update each available value.
933
- auto iterType = iterValue->getType ();
934
932
auto loc = getSafeLoc (predBlock->getTerminator ());
935
933
SILBuilderWithScope builder (predBlock->getTerminator ());
936
934
937
935
while (smallestOffsetSize->first .size < iterOffsetSize.size ) {
938
- TypeOffsetSizePair childOffsetSize;
939
- SILType childType;
940
-
941
- // We are returned an optional here and should never fail... so use a
942
- // force unwrap.
943
- std::tie (childOffsetSize, childType) =
944
- *iterOffsetSize.walkOneLevelTowardsChild (iterOffsetSize, iterType,
945
- fn);
946
-
947
936
// Before we destructure ourselves, erase our entire value from the
948
937
// map. We do not need to consider the possibility of there being holes
949
938
// in our range since we always store values whole to their entire
0 commit comments