[Bug middle-end/56770] Partial sums loop optimization

2019-03-04 Thread steven at gcc dot gnu.org 
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=56770

Steven Bosscher  changed:

   What|Removed |Added

 Status|ASSIGNED|NEW
   Assignee|steven at gcc dot gnu.org  |unassigned at gcc dot 
gnu.org

[Bug middle-end/56770] Partial sums loop optimization

2013-03-29 Thread dje at gcc dot gnu.org 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56770



--- Comment #5 from David Edelsohn  2013-03-29 19:53:44 
UTC ---

Segher pointed out that the transformed code example is has a bug.  The first

revised loop should test j+1 < NZ.



for (j = 0; j+1 < NZ; j += 2){

fValue += Q[j] / r[j];

fValue1 += Q[j+1] / r[j+1];

}

[Bug middle-end/56770] Partial sums loop optimization

2013-03-29 Thread steven at gcc dot gnu.org 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56770



Steven Bosscher  changed:



   What|Removed |Added



   Keywords||missed-optimization

 Status|NEW |ASSIGNED

  Component|tree-optimization   |middle-end

 AssignedTo|unassigned at gcc dot   |steven at gcc dot gnu.org

   |gnu.org |



--- Comment #4 from Steven Bosscher  2013-03-29 
19:38:21 UTC ---

Interesting idea, I'll have a look.