Merge pull request #69506 from nate-chandler/gardening/20231030/1

[Gardening] Cleaned up a few comments.

Author: swift-ci

lib/IRGen/LocalTypeData.cpp

@@ -311,15 +311,15 @@ LocalTypeDataCache::StateAdvancement LocalTypeDataCache::advanceStateInScope(
   key = key.getCachingKey();
 
   auto iterator = Map.find(key);
-  // There's no chain of entries, no no entry which could possibly be used.
+  // There's no chain of entries, so no entry which could possibly be used.
   if (iterator == Map.end())
     return StateAdvancement::NoEntry;
   auto &chain = iterator->second;
 
-  // Scan the chain for entries with the appropriate relationship to the active
-  // dominance scope, and "promote their state".  Any entry whose state is
-  // already at least as complete than `state` is unaffected, and results in
-  // exiting early.
+  // Scan the chain for an entry with the appropriate relationship to the active
+  // dominance scope, and "promote its state".  The existence of a concrete
+  // entry whose state is already at least as complete as `state` is
+  // unaffected, and results in exiting early.
   //
   // There are two cases of interest:
   //

lib/SILOptimizer/Mandatory/AddressLowering.h

@@ -138,7 +138,7 @@ struct ValueStorage {
 
   /// When either isDefProjection or isUseProjection is set, this refers to the
   /// storage whose "def" this value projects out of or whose operand this
-  /// storage projects into via its "use.
+  /// storage projects into via its "use".
   uint32_t projectedStorageID = InvalidID;
 
   /// For use-projections, identifies the operand index of the composing use.

lib/SILOptimizer/Mandatory/PhiStorageOptimizer.cpp

@@ -56,6 +56,7 @@
 ///
 ///   bb0:
 ///     %get0 = apply %get<T>() : $@convention(thin) <τ_0_0>() -> @out τ_0_0
+///     cond_br undef, bb1, bb2
 ///
 ///   bb1:
 ///     destroy_value %get0 : $T