Project Ortega BCM5719 LLVM https://git.raptorcs.com/git/bcm5719-llvm/atom?h=meklort-10.0.1 2018-05-10T07:09:10+00:00 2018-05-10T07:09:10+00:00 Tobias Grosser tobias@grosser.es 2018-05-10T07:09:10+00:00 urn:sha1:6bbca36414e9a2249949d9a64d5f0891a4543c30 Rename variable to retainedNodes. This unbreaks the Polly builds. llvm-svn: 331960 2017-08-30T18:12:35+00:00 Adrian Prantl aprantl@apple.com 2017-08-30T18:12:35+00:00 urn:sha1:6120801066c5203320681beed2885fafcf06472c llvm-svn: 312147 2017-05-12T02:17:15+00:00 Hongbin Zheng etherzhhb@gmail.com 2017-05-12T02:17:15+00:00 urn:sha1:4fe342cb7560993988dd6f978607a2442a905910 Today Polly generates induction variable in this way: polly.indvar = phi 0, polly.indvar.next ... polly.indvar.next = polly.indvar + stide polly.loop_cond = predicate polly.indvar, (UB - stride) Instead of: polly.indvar = phi 0, polly.indvar.next ... polly.indvar.next = polly.indvar + stide polly.loop_cond = predicate polly.indvar.next, UB The way Polly generate induction variable cause some problem in the indvar simplify pass. This patch make polly generate the later form, by assuming the induction variable never overflow Differential Revision: https://reviews.llvm.org/D33089 llvm-svn: 302866 2016-12-20T02:09:59+00:00 Adrian Prantl aprantl@apple.com 2016-12-20T02:09:59+00:00 urn:sha1:abd69332e20327368bacaa647b5f5c7a77e2ff07 llvm-svn: 290154 2016-12-16T19:39:18+00:00 Adrian Prantl aprantl@apple.com 2016-12-16T19:39:18+00:00 urn:sha1:80d13b4545bc4ede92e01d9d208fdb4f70dc1179 llvm-svn: 289983 2016-12-16T16:17:24+00:00 Adrian Prantl aprantl@apple.com 2016-12-16T16:17:24+00:00 urn:sha1:e0a1bdad3f54859678aa60959ef33be4ef69be50 llvm-svn: 289953 2016-09-13T05:19:26+00:00 Tobias Grosser tobias@grosser.es 2016-09-13T05:19:26+00:00 urn:sha1:b51d507c74189312edee9802f53f785157f90723 llvm-svn: 281295 2016-06-11T19:17:15+00:00 Tobias Grosser tobias@grosser.es 2016-06-11T19:17:15+00:00 urn:sha1:3717aa5ddbf9bd5b14f9604b5bd0803dc7e8fe8a The recent expression type changes still need more discussion, which will happen on phabricator or on the mailing list. The precise list of commits reverted are: - "Refactor division generation code" - "[NFC] Generate runtime checks after the SCoP" - "[FIX] Determine insertion point during SCEV expansion" - "Look through IntToPtr & PtrToInt instructions" - "Use minimal types for generated expressions" - "Temporarily promote values to i64 again" - "[NFC] Avoid unnecessary comparison for min/max expressions" - "[Polly] Fix -Wunused-variable warnings (NFC)" - "[NFC] Simplify min/max expression generation" - "Simplify the type adjustment in the IslExprBuilder" Some of them are just reverted as we would otherwise get conflicts. I will try to re-commit them if possible. llvm-svn: 272483 2016-06-06T09:57:41+00:00 Johannes Doerfert doerfert@cs.uni-saarland.de 2016-06-06T09:57:41+00:00 urn:sha1:0767a511bae598ad6ee85fef9de35ada86478abd We now use the minimal necessary bit width for the generated code. If operations might overflow (add/sub/mul) we will try to adjust the types in order to ensure a non-wrapping computation. If the type adjustment is not possible, thus the necessary type is bigger than the type value of --polly-max-expr-bit-width, we will use assumptions to verify the computation will not wrap. However, for run-time checks we cannot build assumptions but instead utilize overflow tracking intrinsics. llvm-svn: 271878 2016-04-15T21:02:35+00:00 Tobias Grosser tobias@grosser.es 2016-04-15T21:02:35+00:00 urn:sha1:b99b97420f307fd6dbc9052505f6b7b1426e7c9a llvm-svn: 266475