| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | [tests] Force invariant load hoisting for test cases that need it II | Tobias Grosser | 2016-08-15 | 1 | -1/+2 |
| | | | | | llvm-svn: 278669 | ||||
| * | Codegen:Do not invalidate dominator tree when bailing out during code generation | Tobias Grosser | 2016-03-23 | 1 | -1/+1 |
| | | | | | | | | | | When codegenerating invariant loads in some rare cases we cannot generate code and bail out. This change ensures that we maintain a valid dominator tree in these situations. This fixes llvm.org/PR26736 Contributed-by: Matthias Reisinger <d412vv1n@gmail.com> llvm-svn: 264142 | ||||
| * | [FIX] Bail out if there is a dependence cycle between invariant loads | Johannes Doerfert | 2015-11-07 | 1 | -0/+73 |
| While the program cannot cause a dependence cycle between invariant loads, additional constraints (e.g., to ensure finite loops) can introduce them. It is hard to detect them in the SCoP description, thus we will only check for them at code generation time. If such a recursion is detected we will bail out the code generation and place a "false" runtime check to guarantee the original code is used. This fixes bug 25443. llvm-svn: 252412 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|