Restoring authorship annotation for <shadchin@yandex-team.ru>. Commit 1 of 2.

1 files changed, 15 insertions, 15 deletions

diff --git a/contrib/libs/llvm12/include/llvm/Analysis/LoopInfoImpl.h b/contrib/libs/llvm12/include/llvm/Analysis/LoopInfoImpl.h
index 6032e9babb..72b1f3d0d5 100644
--- a/contrib/libs/llvm12/include/llvm/Analysis/LoopInfoImpl.h
+++ b/contrib/libs/llvm12/include/llvm/Analysis/LoopInfoImpl.h
@@ -75,13 +75,13 @@ void LoopBase<BlockT, LoopT>::getExitBlocks(
         ExitBlocks.push_back(Succ);
 }
 
-template <class BlockT, class LoopT>
-bool LoopBase<BlockT, LoopT>::hasNoExitBlocks() const {
-  SmallVector<BlockT *, 8> ExitBlocks;
-  getExitBlocks(ExitBlocks);
-  return ExitBlocks.empty();
-}
-
+template <class BlockT, class LoopT> 
+bool LoopBase<BlockT, LoopT>::hasNoExitBlocks() const { 
+  SmallVector<BlockT *, 8> ExitBlocks; 
+  getExitBlocks(ExitBlocks); 
+  return ExitBlocks.empty(); 
+} 
+ 
 /// getExitBlock - If getExitBlocks would return exactly one block,
 /// return that block. Otherwise return null.
 template <class BlockT, class LoopT>
@@ -516,7 +516,7 @@ void PopulateLoopsDFS<BlockT, LoopT>::insertIntoLoop(BlockT *Block) {
   if (Subloop && Block == Subloop->getHeader()) {
     // We reach this point once per subloop after processing all the blocks in
     // the subloop.
-    if (!Subloop->isOutermost())
+    if (!Subloop->isOutermost()) 
       Subloop->getParentLoop()->getSubLoopsVector().push_back(Subloop);
     else
       LI->addTopLevelLoop(Subloop);
@@ -680,13 +680,13 @@ static void compareLoops(const LoopT *L, const LoopT *OtherL,
          "Mismatched basic blocks in the loops!");
 
   const SmallPtrSetImpl<const BlockT *> &BlocksSet = L->getBlocksSet();
-  const SmallPtrSetImpl<const BlockT *> &OtherBlocksSet =
-      OtherL->getBlocksSet();
+  const SmallPtrSetImpl<const BlockT *> &OtherBlocksSet = 
+      OtherL->getBlocksSet(); 
   assert(BlocksSet.size() == OtherBlocksSet.size() &&
-         llvm::all_of(BlocksSet,
-                      [&OtherBlocksSet](const BlockT *BB) {
-                        return OtherBlocksSet.count(BB);
-                      }) &&
+         llvm::all_of(BlocksSet, 
+                      [&OtherBlocksSet](const BlockT *BB) { 
+                        return OtherBlocksSet.count(BB); 
+                      }) && 
          "Mismatched basic blocks in BlocksSets!");
 }
 #endif
@@ -696,7 +696,7 @@ void LoopInfoBase<BlockT, LoopT>::verify(
     const DomTreeBase<BlockT> &DomTree) const {
   DenseSet<const LoopT *> Loops;
   for (iterator I = begin(), E = end(); I != E; ++I) {
-    assert((*I)->isOutermost() && "Top-level loop has a parent!");
+    assert((*I)->isOutermost() && "Top-level loop has a parent!"); 
     (*I)->verifyLoopNest(&Loops);
   }