On Thu, 2009-10-08 at 08:49 +0200, Zdenek Dvorak wrote:
> Hi,
>
> > > Ah, indeed. Sorry for being confused. Is tree-niter-desc->assumptions
> > > or ->may_be_zero non-NULL?
> >
> > Yes both. I attached the gdb content for both.
>
> you need to check may_be_zero, which in your case should conta
> On Wed, Oct 7, 2009 at 7:21 PM, Tobias Grosser
> wrote:
> > On Wed, 2009-10-07 at 18:30 +0200, Tobias Grosser wrote:
> >> On Wed, 2009-10-07 at 17:44 +0200, Richard Guenther wrote:
> >> > On Wed, Oct 7, 2009 at 5:35 PM, Tobias Grosser
> >> > wrote:
> >> > > On Wed, 2009-10-07 at 17:23 +0200, Ri
Hi,
> > Ah, indeed. Sorry for being confused. Is tree-niter-desc->assumptions
> > or ->may_be_zero non-NULL?
>
> Yes both. I attached the gdb content for both.
you need to check may_be_zero, which in your case should contain
something like N <= 49. If this condition is true, the number of
ite
On Wed, Oct 7, 2009 at 7:21 PM, Tobias Grosser
wrote:
> On Wed, 2009-10-07 at 18:30 +0200, Tobias Grosser wrote:
>> On Wed, 2009-10-07 at 17:44 +0200, Richard Guenther wrote:
>> > On Wed, Oct 7, 2009 at 5:35 PM, Tobias Grosser
>> > wrote:
>> > > On Wed, 2009-10-07 at 17:23 +0200, Richard Guenther
On Wed, 2009-10-07 at 18:30 +0200, Tobias Grosser wrote:
> On Wed, 2009-10-07 at 17:44 +0200, Richard Guenther wrote:
> > On Wed, Oct 7, 2009 at 5:35 PM, Tobias Grosser
> > wrote:
> > > On Wed, 2009-10-07 at 17:23 +0200, Richard Guenther wrote:
> > >> On Wed, Oct 7, 2009 at 5:16 PM, Tobias Grosser
On Wed, Oct 7, 2009 at 5:35 PM, Tobias Grosser
wrote:
> On Wed, 2009-10-07 at 17:23 +0200, Richard Guenther wrote:
>> On Wed, Oct 7, 2009 at 5:16 PM, Tobias Grosser
>> wrote:
>> > On Wed, 2009-10-07 at 16:42 +0200, Richard Guenther wrote:
>> >> On Wed, Oct 7, 2009 at 4:37 PM, Tobias Grosser
>> >>
On Wed, 2009-10-07 at 17:23 +0200, Richard Guenther wrote:
> On Wed, Oct 7, 2009 at 5:16 PM, Tobias Grosser
> wrote:
> > On Wed, 2009-10-07 at 16:42 +0200, Richard Guenther wrote:
> >> On Wed, Oct 7, 2009 at 4:37 PM, Tobias Grosser
> >> wrote:
> >> > I try to analyse this code:
> >> > ---
On Wed, Oct 7, 2009 at 5:16 PM, Tobias Grosser
wrote:
> On Wed, 2009-10-07 at 16:42 +0200, Richard Guenther wrote:
>> On Wed, Oct 7, 2009 at 4:37 PM, Tobias Grosser
>> wrote:
>> > I try to analyse this code:
>> > --
>> > int foo (int N)
>> > {
>
On Wed, 2009-10-07 at 16:42 +0200, Richard Guenther wrote:
> On Wed, Oct 7, 2009 at 4:37 PM, Tobias Grosser
> wrote:
> > I try to analyse this code:
> > --
> > int foo (int N)
> > {
> > int ftab[257];
> > int i, j;
> >
> > for (i = 0; i < N -
On Wed, Oct 7, 2009 at 4:37 PM, Tobias Grosser
wrote:
> I try to analyse this code:
> --
> int foo (int N)
> {
> int ftab[257];
> int i, j;
>
> for (i = 0; i < N - 7488645; i++)
> j = ftab [i];
>
> return j;
> }
>
I try to analyse this code:
--
int foo (int N)
{
int ftab[257];
int i, j;
for (i = 0; i < N - 7488645; i++)
j = ftab [i];
return j;
}
--
The number of iterations I get is:
(unsig
11 matches
Mail list logo