fmt

EnzymeAD · Nov 4, 2024 · 5d90df3 · 5d90df3
1 parent a69f47c
commit 5d90df3
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 6 deletions.
diff --git a/enzyme/Enzyme/DifferentialUseAnalysis.cpp b/enzyme/Enzyme/DifferentialUseAnalysis.cpp
@@ -912,7 +912,7 @@ void DifferentialUseAnalysis::minCut(const DataLayout &DL, LoopInfo &OrigLI,
       }
       continue;
     }
-    
+
     // When ambiguous, push to cache the last value in a computation chain
     // This should be considered in a cost for the max flow
     if (mp.size() == 1 && !Required.count(V)) {
@@ -988,7 +988,6 @@ void DifferentialUseAnalysis::minCut(const DataLayout &DL, LoopInfo &OrigLI,
     }
   }
 
-
   // Fix up non-repeatable writing calls that chain within rematerialized
   // allocations. We could iterate from the keys of the valuemap, but that would
   // be a non-determinstic ordering.

diff --git a/enzyme/Enzyme/GradientUtils.cpp b/enzyme/Enzyme/GradientUtils.cpp
@@ -8177,7 +8177,7 @@ void GradientUtils::computeMinCache() {
                                    notForAnalysis);
             if (oneneed) {
               knownRecomputeHeuristic[&I] = false;
- 
+
               CountTrackedPointers T(I.getType());
               assert(!T.derived);
             } else
@@ -8273,10 +8273,10 @@ void GradientUtils::computeMinCache() {
         assert(!MinReq.count(V));
         unnecessaryIntermediates.insert(cast<Instruction>(V));
       }
- 
+
       if (NeedGraph.count(V) && MinReq.count(V)) {
-            CountTrackedPointers T(V->getType());
-            assert(!T.derived);
+        CountTrackedPointers T(V->getType());
+        assert(!T.derived);
       }
     }
   }