Jack Howarth wrote:
> Thanks in advance for getting this libtool update into gcc 4.5.
I'd just like to add: thanks (in behind) for all the work you've put in this
summer getting everything updated. You done a really good job and we're all
better off for it :)
cheers,
DaveK
On Thu, Dec 03, 2009 at 09:32:38PM +0100, Ralf Wildenhues wrote:
> * Jack Howarth wrote on Thu, Dec 03, 2009 at 03:22:56AM CET:
> > On Wed, Dec 02, 2009 at 11:08:49PM +0100, Richard Guenther wrote:
> > > On Wed, 2 Dec 2009, Ralf Wildenhues wrote:
> > > >
> > > > The Libtool update would fix a coup
On Fri, Dec 4, 2009 at 1:20 PM, Sebastian Pop wrote:
> On Fri, Dec 4, 2009 at 11:08, Cédric Bastoul wrote:
>> We usually call this case (parameter times IV) "fully parametric".
>> Armin Grosslinger looked at it before finding a more general solution,
>
> I don't want the more general solution: IV
On 12/04/09 10:00, jose manuel Herrera Magana wrote:
i am try to star hit my password and just don't letme beginig and tele smoking
about certifiques and signaturas than i never see befor
well first things first is gcc has nothing
todo with your password settings.
maybe resetting your accoun
On Fri, Dec 4, 2009 at 11:08, Cédric Bastoul wrote:
> We usually call this case (parameter times IV) "fully parametric".
> Armin Grosslinger looked at it before finding a more general solution,
I don't want the more general solution: IV * IV doesn't commonly
happen, but parameter * IV does, and o
i am try to star hit my password and just don't letme beginig and tele smoking
about certifiques and signaturas than i never see befor
On Fri, 2009-12-04 at 10:50 -0600, Sebastian Pop wrote:
> On Fri, Dec 4, 2009 at 10:39, Tobias Grosser
> wrote:
> > I do not believe this is already possible for arbitrary N.
> >
> > You would have to write a scattering function like this
> >
> > s0 = i+n*(j-1)
> >
> > What is
> >
> > s= i + n*j
On 12/01/2009 09:02 AM, Rainer Emrich wrote:
C:/MinGW/i686-pc/i686-pc/i686-pc/gcc-4.5.0/mingw/lib/libppl.a(Polyhedron_widenings.o):Polyhedron_widenings.cc:(.text$_ZN23Parma_Polyhedra_Library3BoxINS_8IntervalI10__gmp_exprIA1_12__mpq_structS4_ENS_25Interval_Restriction_NoneINS_20Interval_Info_Bitse
On Fri, Dec 4, 2009 at 11:50 AM, Sebastian Pop wrote:
> On Fri, Dec 4, 2009 at 10:39, Tobias Grosser
> wrote:
>> I do not believe this is already possible for arbitrary N.
>>
>> You would have to write a scattering function like this
>>
>> s0 = i+n*(j-1)
>>
>> What is
>>
>> s= i + n*j - n
>>
On Fri, Dec 4, 2009 at 10:44, Cédric Bastoul wrote:
> I see no way to do this with affine scattering. We would need
> polynomial functions like Armin Grosslinger is doing, see
> http://www.infosun.fim.uni-passau.de/cl/publications/docs/MIP-0803.pdf
> but I think that's too slow at the moment...
I
On Fri, Dec 4, 2009 at 10:39, Tobias Grosser wrote:
> I do not believe this is already possible for arbitrary N.
>
> You would have to write a scattering function like this
>
> s0 = i+n*(j-1)
>
> What is
>
> s= i + n*j - n
> ^^^ Here is a product that is not affine linear.
Yes this is affi
I see no way to do this with affine scattering. We would need
polynomial functions like Armin Grosslinger is doing, see
http://www.infosun.fim.uni-passau.de/cl/publications/docs/MIP-0803.pdf
but I think that's too slow at the moment...
On Fri, Dec 4, 2009 at 11:29 AM, Sebastian Pop wrote:
> On Fr
On Fri, 2009-12-04 at 10:29 -0600, Sebastian Pop wrote:
> On Fri, Dec 4, 2009 at 09:41, Toon Moene wrote:
> > I wonder if Graphite can do this one (or is planned to be able to):
> >
> > Another loop optimization that suggests itself
> > is the following, trying to eliminate unnecessary
> > loop co
On Fri, Dec 4, 2009 at 09:41, Toon Moene wrote:
> I wonder if Graphite can do this one (or is planned to be able to):
>
> Another loop optimization that suggests itself
> is the following, trying to eliminate unnecessary
> loop constructs:
> \begin{verbatim}
> SUBROUTINE SUB(A, B, C, N, M)
>
I wonder if Graphite can do this one (or is planned to be able to):
Another loop optimization that suggests itself
is the following, trying to eliminate unnecessary
loop constructs:
\begin{verbatim}
SUBROUTINE SUB(A, B, C, N, M)
REAL A(N, M), B(N, M), C(N, M)
DO J = 1, M
On Fri, Dec 04, 2009 at 12:23:27PM (+0100), Rainer Emrich wrote:
> Unfortunally this doesn't solve the issue!
It would be helpful if you could file a proper bug report with a standalone
reproducer.
Thanks.
Dodji
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Jason Merrill schrieb:
> On 12/01/2009 09:02 AM, Rainer Emrich wrote:
>> C:/MinGW/i686-pc/i686-pc/i686-pc/gcc-4.5.0/mingw/lib/libppl.a(Polyhedron_widenings.o):Polyhedron_widenings.cc:(.text$_ZN23Parma_Polyhedra_Library3BoxINS_8IntervalI10__gmp_exprIA1_
Hello,
I want to offer my site to become another mirror for GCC. the server
for my website is located in Malaysia.
URL: http://hackgreen.org/gcc
Location: Malaysia
Email: ad...@hackgreen.org
Name: malaya
global-allow-subscribe-fikri.fadzil=gmail@gcc.gnu.org
19 matches
Mail list logo
