[polly] r291718 - Update tests to more precise analysis results in LLVM core

[Tobias Grosser via llvm-commits]

Very nice. Thank you Eli!

Best,
Tobias

On Fri, Jan 13, 2017, at 01:07 AM, Friedman, Eli via llvm-commits wrote:
> r291701, I think.  We get a slightly better estimate for the max 
> backedge-taken count, which therefore makes 
> ScalarEvolution::getSignedRange more accurate.  (I have a WIP patch for 
> SCEV that helps here a bit more; I'll finish it up and post it when I 
> have time.)
> 
> -Eli
> 
> On 1/12/2017 3:48 PM, Michael Kruse via llvm-commits wrote:
> > Which LLVM commit did this?
> >
> > Michael
> >
> > 2017-01-11 23:53 GMT+01:00 Tobias Grosser via llvm-commits
> > <llvm-commits at lists.llvm.org>:
> >> Author: grosser
> >> Date: Wed Jan 11 16:53:34 2017
> >> New Revision: 291718
> >>
> >> URL: http://llvm.org/viewvc/llvm-project?rev=291718&view=rev
> >> Log:
> >> Update tests to more precise analysis results in LLVM core
> >>
> >> LLVM's range analysis became a little tighter, which means Polly can derive
> >> tighter bounds as well.
> >>
> >> Modified:
> >>      polly/trunk/test/ScopInfo/NonAffine/non-affine-loop-condition-dependent-access_3.ll
> >>
> >> Modified: polly/trunk/test/ScopInfo/NonAffine/non-affine-loop-condition-dependent-access_3.ll
> >> URL: http://llvm.org/viewvc/llvm-project/polly/trunk/test/ScopInfo/NonAffine/non-affine-loop-condition-dependent-access_3.ll?rev=291718&r1=291717&r2=291718&view=diff
> >> ==============================================================================
> >> --- polly/trunk/test/ScopInfo/NonAffine/non-affine-loop-condition-dependent-access_3.ll (original)
> >> +++ polly/trunk/test/ScopInfo/NonAffine/non-affine-loop-condition-dependent-access_3.ll Wed Jan 11 16:53:34 2017
> >> @@ -95,9 +95,9 @@
> >>   ; ALL-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 0]
> >>   ; ALL-NEXT:             { Stmt_bb15__TO__bb25[i0, i1] -> MemRef_A[i1] };
> >>   ; ALL-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 0]
> >> -; ALL-NEXT:             { Stmt_bb15__TO__bb25[i0, i1] -> MemRef_A[o0] : 0 <= o0 <= 4294967295 };
> >> +; ALL-NEXT:             { Stmt_bb15__TO__bb25[i0, i1] -> MemRef_A[o0] : 0 <= o0 <= 2147483647 };
> >>   ; ALL-NEXT:         MayWriteAccess :=    [Reduction Type: NONE] [Scalar: 0]
> >> -; ALL-NEXT:             { Stmt_bb15__TO__bb25[i0, i1] -> MemRef_A[o0] : 0 <= o0 <= 4294967295 };
> >> +; ALL-NEXT:             { Stmt_bb15__TO__bb25[i0, i1] -> MemRef_A[o0] : 0 <= o0 <= 2147483647 };
> >>   ; ALL-NEXT: }
> >>   ;
> >>   ;    void f(int *A) {
> >>
> >>
> >> _______________________________________________
> >> llvm-commits mailing list
> >> llvm-commits at lists.llvm.org
> >> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits
> > _______________________________________________
> > llvm-commits mailing list
> > llvm-commits at lists.llvm.org
> > http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits
> 
> 
> -- 
> Employee of Qualcomm Innovation Center, Inc.
> Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum, a
> Linux Foundation Collaborative Project
> 
> _______________________________________________
> llvm-commits mailing list
> llvm-commits at lists.llvm.org
> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits