--- Comment #18 from spop at gcc dot gnu dot org 2007-10-31 13:53 ---
Subject: Bug 32377
Author: spop
Date: Wed Oct 31 13:53:03 2007
New Revision: 129797
URL: http://gcc.gnu.org/viewcvs?root=gccview=revrev=129797
Log:
2007-10-31 Sebastian Pop [EMAIL PROTECTED]
PR
--- Comment #19 from spop at gcc dot gnu dot org 2007-10-31 13:53 ---
Fixed.
--
spop at gcc dot gnu dot org changed:
What|Removed |Added
Status|NEW
--- Comment #16 from sebpop at gmail dot com 2007-10-31 01:13 ---
Subject: Re: can't determine dependence (source/destination overlap without
more than size)
Testing a fix.
--- Comment #17 from sebpop at gmail dot com 2007-10-31 01:13 ---
Created an attachment (id=14445)
--- Comment #15 from sebpop at gmail dot com 2007-07-09 14:19 ---
Subject: Re: can't determine dependence (source/destination overlap without
more than size)
I was going to submit the attached patch, but now the analysis fails with
affine-affine test failed: missing iteration counts
--- Comment #13 from irar at il dot ibm dot com 2007-07-08 10:00 ---
Hi Sebastian,
I was going to submit the attached patch, but now the analysis fails with
affine-affine test failed: missing iteration counts and distance vector is
not built (so the loop in this PR cannot be vectorized
--- Comment #14 from irar at il dot ibm dot com 2007-07-08 10:01 ---
Created an attachment (id=13869)
-- (http://gcc.gnu.org/bugzilla/attachment.cgi?id=13869action=view)
patch
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=32377
--- Comment #10 from sebpop at gmail dot com 2007-07-04 07:21 ---
Subject: Re: can't determine dependence (source/destination overlap without
more than size)
I can submit a patch for merging that part of code in trunk if you need
this flag to test if you are in one or the other
--- Comment #12 from irar at il dot ibm dot com 2007-07-04 08:34 ---
(In reply to comment #10)
I have committed the attached patch to trunk.
Sebastian
Thanks a lot!
Ira
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=32377
--- Comment #6 from spop at gcc dot gnu dot org 2007-07-03 07:14 ---
(In reply to comment #5)
I am not sure about that. I tried the following cases and got distance 1 (and
direction positive) in all of them for load and store to ia pair.
What am I missing?
Distance vectors are
--- Comment #7 from irar at il dot ibm dot com 2007-07-03 12:57 ---
(In reply to comment #6)
Distance vectors are lexicographically positive vectors, that is why you get
the 1
in all these cases. If you want to know which one comes first, you have to
look
at the DR_IS_READ for
--- Comment #8 from sebpop at gmail dot com 2007-07-03 13:57 ---
Subject: Re: can't determine dependence (source/destination overlap without
more than size)
On 3 Jul 2007 12:57:33 -, irar at il dot ibm dot com
[EMAIL PROTECTED] wrote:
for (i = 0; i N; i++){
ia[i+1] =
--- Comment #9 from irar at il dot ibm dot com 2007-07-03 16:43 ---
(In reply to comment #8)
I can submit a patch for merging that part of code in trunk if you need
this flag to test if you are in one or the other case.
I guess we can't vectorize the loop in this PR without it,
--- Comment #5 from irar at il dot ibm dot com 2007-07-02 12:20 ---
(In reply to comment #4)
Looks like the data-dependence analysis is doing it's job
I am not sure about that. I tried the following cases and got distance 1 (and
direction positive) in all of them for load and store to
--- Comment #4 from dorit at gcc dot gnu dot org 2007-07-01 12:48 ---
Looks like the data-dependence analysis is doing it's job (it figures out that
the dependence distance is 1), but the vectorizer is still not willing to
vectorize. Need to look into this.
--
--- Comment #3 from pinskia at gcc dot gnu dot org 2007-06-18 02:45 ---
t.f:10: note: not vectorized: possible dependence between data-refs
(*a_54(D))[S.13_17] and (*a_54(D))[D.1376_50]
--
pinskia at gcc dot gnu dot org changed:
What|Removed
15 matches
Mail list logo
