[gardening] Use consistent spacing

Author: practicalswift

include/swift/ABI/System.h

@@ -59,7 +59,7 @@
 // Weak references use a marker to tell when they are controlled by
 // the ObjC runtime and when they are controlled by the Swift runtime.
 // Non-ObjC platforms don't use this marker.
-#define SWIFT_ABI_DEFAULT_OBJC_WEAK_REFERENCE_MARKER_MASK  0
+#define SWIFT_ABI_DEFAULT_OBJC_WEAK_REFERENCE_MARKER_MASK 0
 #define SWIFT_ABI_DEFAULT_OBJC_WEAK_REFERENCE_MARKER_VALUE 0
 
 /*********************************** i386 *************************************/

include/swift/Runtime/Config.h

@@ -134,9 +134,9 @@
 #define SWIFT_LLVM_CC_RegisterPreservingCC llvm::CallingConv::PreserveMost
 
 #if SWIFT_USE_SWIFTCALL
-#define SWIFT_LLVM_CC_SwiftCC  llvm::CallingConv::Swift
+#define SWIFT_LLVM_CC_SwiftCC llvm::CallingConv::Swift
 #else
-#define SWIFT_LLVM_CC_SwiftCC  llvm::CallingConv::C
+#define SWIFT_LLVM_CC_SwiftCC llvm::CallingConv::C
 #endif
 
 // If defined, it indicates that runtime function wrappers

lib/IDE/SwiftSourceDocInfo.cpp

@@ -918,7 +918,7 @@ getCallArgLabelRanges(SourceManager &SM, Expr *Arg) {
   std::vector<CharSourceRange> Ranges;
   if (TupleExpr *TE = dyn_cast<TupleExpr>(Arg)) {
     size_t ElemIndex = 0;
-    for(Expr *Elem: TE->getElements()) {
+    for (Expr *Elem : TE->getElements()) {
       SourceLoc LabelStart(Elem->getStartLoc());
       SourceLoc LabelEnd(LabelStart);
 

lib/Index/Index.cpp

@@ -310,7 +310,7 @@ class IndexSwiftASTWalker : public SourceEntityWalker {
     if (NameLoc.isCompound()) {
       size_t LabelIndex = 0;
       SourceLoc ArgLoc;
-      while((ArgLoc = NameLoc.getArgumentLabelLoc(LabelIndex++)).isValid()) {
+      while ((ArgLoc = NameLoc.getArgumentLabelLoc(LabelIndex++)).isValid()) {
         LabelLocs.push_back(ArgLoc);
       }
     } else if (auto *CallParent = dyn_cast_or_null<CallExpr>(getParentExpr())) {
@@ -327,7 +327,7 @@ class IndexSwiftASTWalker : public SourceEntityWalker {
       return;
 
     auto LabelIt = LabelLocs.begin();
-    for(auto Prop : TypeContext->getStoredProperties()) {
+    for (auto Prop : TypeContext->getStoredProperties()) {
       if (Prop->getParentInitializer() && Prop->isLet())
         continue;
 

lib/SILOptimizer/Mandatory/ConstantPropagation.cpp

@@ -318,7 +318,7 @@ static SILInstruction *constantFoldCompare(BuiltinInst *BI,
     }
   }
 
-  // At the same time (x>>n) > Int.max and  Int.max < (x>>n) is false.
+  // At the same time (x>>n) > Int.max and Int.max < (x>>n) is false.
   if (match(BI,
             m_CombineOr(
                 // Int.max < x

lib/SILOptimizer/Mandatory/DiagnoseStaticExclusivity.cpp

@@ -95,7 +95,7 @@ class ObjectProjection {
 ///
 /// The key invariant that this class must maintain is that if it says
 /// two storage locations are the same then they must be the same at run time.
-/// It is  allowed to err on the other side: it may imprecisely fail to
+/// It is allowed to err on the other side: it may imprecisely fail to
 /// recognize that two storage locations that represent the same run-time
 /// location are in fact the same.
 class AccessedStorage {

stdlib/private/StdlibCollectionUnittest/CheckMutableCollectionType.swift.gyb

@@ -489,7 +489,7 @@ func checkSortedPredicateThrow(
     result = try c.sorted {
       (lhs, rhs) throws -> Bool in
       _blackHole(closureLifetimeTracker)
-      if  throwElement == extractValue(rhs).value {
+      if throwElement == extractValue(rhs).value {
         thrown = true
         throw SillyError.JazzHands
       }
@@ -1005,7 +1005,7 @@ func checkSortPredicateThrow(
     try c.sort {
       (lhs, rhs) throws -> Bool in
       _blackHole(closureLifetimeTracker)
-      if  throwElement == extractValue(rhs).value {
+      if throwElement == extractValue(rhs).value {
         throw SillyError.JazzHands
       }
       return lessImpl(extractValue(lhs).value, extractValue(rhs).value)

test/SILOptimizer/capture_promotion_generic_context.sil

@@ -85,7 +85,7 @@ struct R<T> {
 // CHECK:         switch_enum %2 : $E<(R<T>) -> Builtin.Int32>
 // CHECK-NOT:     project_box
 // CHECK:       } // end sil function '_T023generic_promotable_box2Tf2nni_n'
-sil @generic_promotable_box2 : $@convention(thin) <T> (@in R<T>, @in Int, <τ_0_0> { var  E<(R<τ_0_0>) -> Int> } <T>) -> () {
+sil @generic_promotable_box2 : $@convention(thin) <T> (@in R<T>, @in Int, <τ_0_0> { var E<(R<τ_0_0>) -> Int> } <T>) -> () {
 entry(%0: $*R<T>, %1 : $*Int, %b : $<τ_0_0> { var E< (R<τ_0_0>)->Int > } <T>):
   %a = project_box %b : $<τ_0_0> { var E<(R<τ_0_0>)->Int> } <T>, 0
   %e = load %a : $*E<(R<T>)->Int>

test/SILOptimizer/constant_propagation.sil

@@ -307,7 +307,7 @@ bb0:
 
 // For any x of the same size as Int.max and n>=1 , (x>>n) is always <= Int.max,
 // that is (x>>n) <= Int.max and Int.max >= (x>>n) are true.
-// At the same time (x>>n) > Int.max and  Int.max < (x>>n) is always false.
+// At the same time (x>>n) > Int.max and Int.max < (x>>n) is always false.
 sil @fold_cmp_lshr_with_IntMax : $@convention(thin) (Builtin.Int64) -> Builtin.Int64 {
 bb0(%0 : $Builtin.Int64):
   %1 = integer_literal $Builtin.Int64, 9223372036854775807