summaryrefslogtreecommitdiffstats
path: root/llvm/unittests/Analysis/LoopInfoTest.cpp
Commit message (Collapse)AuthorAgeFilesLines
* Update the file headers across all of the LLVM projects in the monorepoChandler Carruth2019-01-191-4/+3
| | | | | | | | | | | | | | | | | to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
* [LoopInfo][FIX] Remove leftover dump in unit testJohannes Doerfert2018-09-111-1/+0
| | | | llvm-svn: 341968
* [LoopInfo] Fix Loop::getLoopID() for loops with multiple latchesJohannes Doerfert2018-09-111-0/+56
| | | | | | | | The previous implementation traversed all loop blocks and bailed if one was not a latch block. Since we are only interested in latch blocks, we should only traverse those. llvm-svn: 341926
* [LoopInfo] Add helper methods to compute two useful orderings of theChandler Carruth2017-01-201-0/+75
| | | | | | | | | | | | | | | | | | | | | | loops in a function. These are relatively confusing to talk about and compute correctly so it seems really good to write down their implementation in one place. I've replaced one place we needed this in the loop PM infrastructure and I have another place in a pending patch that wants it. We can't quite use this for the core loop PM walk because there we're sometimes working on a sub-forest. I'll add the expected unittests before committing this but wanted to make sure folks were happy with these names / comments. Credit goes to Richard Smith for the idea for naming the order where siblings are in reverse program order but the tree traversal remains preorder. Differential Revision: https://reviews.llvm.org/D28932 llvm-svn: 292569
* Refactor out LoopInfo computation so that it can be used byXin Tong2017-01-171-41/+48
| | | | | | | | | | | | | | | | | | other test cases. Summary: Refactor out LoopInfo computation so that it can be used by other test cases. So i am changing this test proactively for later commit, which will use this function. Reviewers: sanjoy, hfinkel Subscribers: llvm-commits Differential Revision: https://reviews.llvm.org/D28778 llvm-svn: 292250
* Empty line. NFC.Xin Tong2017-01-151-1/+0
| | | | llvm-svn: 292081
* Use getLoopLatch in place of isLoopSimplifyFormXin Tong2017-01-151-0/+77
Summary: Use getLoopLatch in place of isLoopSimplifyForm. we do not need to know whether the loop has a preheader nor dedicated exits. Reviewers: hfinkel, sanjoy, atrick, mkuper Subscribers: mzolotukhin, llvm-commits Differential Revision: https://reviews.llvm.org/D28724 llvm-svn: 292078
OpenPOWER on IntegriCloud