This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: patch for merging graphite branch (before tuplification)


Mark,
   I thought Roberto covered that when he said...

So the most that can be guaranteed is a minimal form (i.e., with
the minimum number of individually-normalized constraints),
but there is no guarantee to obtain, for the same polyhedron,
the same set of constraints.  However, if you stick to a particular
PPL release, you can count on obtaining the same set of constraints
on all architectures.

That sentence was a little confusing, but I took it to mean that
the solutions were implementation dependent and as long as you
stuck with a specific implemenentation (ie version of ppl), you
wouldn't get THE correct answer but at least a consistent one.
                     Jack

On Fri, Aug 08, 2008 at 08:57:05AM -0700, Mark Mitchell wrote:
> Paolo Bonzini wrote:
>>
>>> Sebastian, will the behavior of Graphite be deterministic, in that 
>>> for a given compiler and a given input program, we can be assured of 
>>> the same output?  (I would assume so, but I would like to check.)
>>
>> Roberto said that the parts of PPL that are used in Graphite *do not*  
>> require floating point.  In fact, off list he even told me that some  
>> parts of PPL were written specially because other available packages  
>> used floating point.
>
> OK, great!  I'd 99.9% sure it's not an issue, but I'd still like a  
> direct answer from Sebastian on the determinism issue.
>
> Thanks,
>
> -- 
> Mark Mitchell
> CodeSourcery
> mark@codesourcery.com
> (650) 331-3385 x713


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]