Displaying 3 results from an estimated 3 matches for "saddexpr".
Did you mean:
addexpr
2009 Jun 24
0
[LLVMdev] Handling SMax(N, N - constInt) in Scalar Evolution pass
Nick,
It might be a little bit difficult to handle SMax correctly. But is it
possible to reduce A+(-A) to 0 in SAddExpr?
Haohui
On Wed, 2009-06-24 at 01:05 -0500, Mai, Haohui wrote:
> On Tue, 2009-06-23 at 22:55 -0700, Nick Lewycky wrote:
> > Mai, Haohui wrote:
> > > Hi all,
> > >
> > > I'm working on a project which tries to prove an access to an array is
> > > s...
2009 Jun 24
1
[LLVMdev] Handling SMax(N, N - constInt) in Scalar Evolution pass
Mai, Haohui wrote:
> Nick,
>
> It might be a little bit difficult to handle SMax correctly. But is it
> possible to reduce A+(-A) to 0 in SAddExpr?
Yes, it should already do that. Here's a quick test I wrote up:
$ cat x.ll
define i8 @test(i8 %x) {
%neg = sub i8 0, %x
%sum = add i8 %x, %neg
ret i8 %sum
}
$ llvm-as < x.ll | opt -analyze -scalar-evolution -disable-output
Printing analysis 'Scalar Evolut...
2009 Jun 24
2
[LLVMdev] Handling SMax(N, N - constInt) in Scalar Evolution pass
On Tue, 2009-06-23 at 22:55 -0700, Nick Lewycky wrote:
> Mai, Haohui wrote:
> > Hi all,
> >
> > I'm working on a project which tries to prove an access to an array is
> > safe. For example,
> >
> > int foo(int s) {
> > int * p = malloc(s * sizeof int);
> > ...
> > int q = p[s - 2];
> > }
> >
> > then the access