20.5520.27
mg.A 15.0911.86
sp.W 37.1135.49
geomean15.8413.94
speedup 13.68%
2006-06-02 Canqun Yang <[EMAIL PROTECTED]>
* config/ia64/ia64.h (SIMULTANEOUS_PREFETCHES): Define to 18.
(PREFETCH_BLOCK): Define to 128.
(PREFETCH_LATENCY): Def
--- Andrey Belevantsev <[EMAIL PROTECTED]>:
> Canqun Yang wrote:
> > Hi, all
> >
> > This patch results a performance increase of 4% for SPECfp2000 and 13% for
> > NAS benchmark suite
> on
> > Itanium-2 system, respectively. More performance incr
o
> generate "lfetch", which is why I ask...)
>
Yes, GCC does. I have tried this on the old prefetch implementation at RTL
level and the new one
at TREE level, but no significant performance difference for SPECfp2000 and NAS
benchmarks.
Nevertheless, it worth taking more time t
Hi, all
Is there any way to get the (estimated) execution times of each function call
during IPA passes?
Currently, in GCC, the loop information can only be formed after tree-ssa pass
by calling
loop_optimizer_init, so it is impossible to estimated the times of a function
call when the IPA
opti
Hi, all
The new loop unroller causes performance degradation
due to the unimplemented giv (general induction
variable) optimizations.
When will it be implemented?
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
> On Feb 28, 2005 02:35 PM, Canqun Yang
<[EMAIL PROTECTED]> wrote:
>
> > Hi, all
> >
> > The new loop unroller causes performance
degradation
> > due to the unimplemented giv (general induction
> > variable) optimizations.
> >
> > When will it
e two assembly code
versions, one for which has address giv splitting in
the loop unroller, the
other not.
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
giv.f90
Description: Binary data
giv_no_opt.s
Description: Binary data
giv_opt.s
Description: Binary data
anqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
2005-03-25 Canqun Yang <[EMAIL PROTECTED]>
* ia64.c (SIMULTANEOUS_PREFETCHES): Redefine as 18.
(PREFETCH_BLOCK): Redefine as 64.
(PREFETCH_BLOCKS_BEFORE_LOOP_MAX): New
The last ChangeLog of rtlopt-branch was written in
2003. After more than one year, many impovements in
this branch haven't been put into the GCC HEAD. Why?
ÒýÑÔ Steven Bosscher <[EMAIL PROTECTED]>:
> On Saturday 26 March 2005 02:22, Canqun Yang wrote:
> > Â Â
ÒýÑÔ Steven Bosscher <[EMAIL PROTECTED]>:
> On Sunday 27 March 2005 03:53, Canqun Yang wrote:
> > The last ChangeLog of rtlopt-branch was written in
> > 2003. After more than one year, many impovements in
> > this branch haven't been put into the GCC HEAD.
W
ÒýÑÔ Zdenek Dvorak <[EMAIL PROTECTED]>:
> Hello,
>
> > On Sunday 27 March 2005 03:53, Canqun Yang wrote:
> > > The last ChangeLog of rtlopt-branch was written
in
> > > 2003. After more than one year, many impovements
in
> > > this branch haven'
ÒýÑÔ Zdenek Dvorak <[EMAIL PROTECTED]>:
> Hello,
>
> > On Sunday 27 March 2005 04:45, Canqun Yang wrote:
> > > Another question is why the new RTL loop-
unroller does
> > > not support giv splitting.
> >
> > Apparently because for most people it
s whithout "-fmodulo-sched".
2005-03-31 Canqun Yang <[EMAIL PROTECTED]>
* modulo-sched.c (doloop_register_get): Deal
with if_then_else pattern.
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
pi.f90
Description:
ent on any of the
>SPECs -- and in fact improving the current optimizers
will make raise >the
>bar for the new ones. ;-)
>
>Question is: who is going review/potentially approve
this patch?
>
>Gerald
Canqun Yang
Creative Compiler Research Group.
National University of Defens
far away from the old one. So, I plan to port my work
on new loop optimizer after Zdenek has commited his
patches.
>
> Gr.
> Steven
>
>
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
1GHz system.
I have implemented the double precison version of
inline round. If it is worth doing, I can go on to
finish the other precision mode versions.
2005-04-07 Canqun Yang <[EMAIL PROTECTED]>
* config/ia64/ia64.md (UNSPEC_ROUND): New
constant.
(floa
uble, the
rounding to integer
> should be performed entirely in long double mode,
using the long double
> predecessor of 0.5.
>
> See ada/trans.c around line 5340 for an example of
how Ada does this.
>
>-Geert
>
> On Apr 7, 2005, at 05:38, Canqun Yang wrote:
> > Gfo
Steven Bosscher <[EMAIL PROTECTED]>:
> On Thursday 21 April 2005 17:37, Mostafa Hagog wrote:
> > The other thing is to analyze this problem more
deeply but I don't have
> > IA64.
> ...and I don't care enough about it. Canqun?
>
> Gr.
> Steven
>
Hi, all,
Is there anyone familiar with the check routine
check_ext_dependent_givs defined loop.c, and give me
an example explaining why it is needed.
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
platform is a 64bit system.
Best regards,
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
n level or with compile options like '-
ffast-math' and '-fno-wrapv'?
5. Is there any way to extend the function of
check_ext_dependent_givs to manage
non-iteration-variable BIVs in non-constant-iteration
loops. I have tried but failed.
Best regards,
Canqun Yang
Creativ
u.org/ml/gcc-patches/2005-03/msg02848.html.
>
> I have tested the patch on powerpc-apple-darwin and
there are some tests
> that
> started failing. So I am going to debug it to see what
causes the failures.
>
> Mostafa.
>
> >
> > Gr.
> > Steven
> >
> >
>
>
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
Steven Bosscher <[EMAIL PROTECTED]>:
> On Wednesday 01 June 2005 16:43, Canqun Yang wrote:
> > Hi, all
> >
> > I've taken a look on modulo-sched.c recently, and
found
> > that both new_cycles and orig_cycles are
imprecise. The
> > reason is tha
Canqun Yang <[EMAIL PROTECTED]>:
> Steven Bosscher <[EMAIL PROTECTED]>:
>
> > On Wednesday 01 June 2005 16:43, Canqun Yang wrote:
> > > Hi, all
> > >
> > > I've taken a look on modulo-sched.c recently, and
> found
> > > that
Hi, all
Function inlining for FORTRAN programs always fails. If no one engages in it, I
will give a try.
Would you please give me some clues?
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
Paul Brook <[EMAIL PROTECTED]>:
> On Wednesday 20 July 2005 15:35, Canqun Yang wrote:
> > Hi, all
> >
> > Function inlining for FORTRAN programs always fails.
>
> Not entirely true. Inlining of contained procedures works fine (or it did la
> st
> time I
j;
double sum;
for (i = 0; i < N; i+=5)
for (j = 0; j < N; j+=5)
a[i][j] = 2* i*j + i*i + j*j;
sum = 0.0;
for (i = 0; i < N; i+=5)
for (j = 0; j < N; j+=5)
sum += a[i][j];
printf ("%f\n",
Hi, Guenther
It works. Thank you very much!
Canqun Yang
--- Richard Guenther <[EMAIL PROTECTED]>:
> On 7/26/07, Canqun Yang <[EMAIL PROTECTED]> wrote:
> > Hi, all
> >
> > Can anyone help me to resolve this problem?
> >
> > When I compile a progra
. The only
regression is
FORTRAN 95 testcase function_modulo_1.f90, it produces a wong result.
Canqun Yang
Creative Compiler Research Group.
National University of Defense Technology, China.
29 matches
Mail list logo
