public inbox for gcc-bugs@sourceware.org
help / color / mirror / Atom feed
* [Bug tree-optimization/18529] New: When the lower bound of a loop is non-constant we cannot find the number of iterations
@ 2004-11-17 15:43 pinskia at gcc dot gnu dot org
  2004-11-17 15:45 ` [Bug tree-optimization/18529] " pinskia at gcc dot gnu dot org
                   ` (5 more replies)
  0 siblings, 6 replies; 7+ messages in thread
From: pinskia at gcc dot gnu dot org @ 2004-11-17 15:43 UTC (permalink / raw)
  To: gcc-bugs

long *a;

void f(int start, int end)
{
  int i;
  for (i = start; i <end ; i++)
    a[i] = 0;
}

Some anylsis of the problem here: <http://gcc.gnu.org/ml/gcc/2004-08/msg01315.html>.

I filed this to keep track of it.

-- 
           Summary: When the lower bound of a loop is non-constant we cannot
                    find the number of iterations
           Product: gcc
           Version: 4.0.0
            Status: UNCONFIRMED
          Keywords: missed-optimization
          Severity: enhancement
          Priority: P2
         Component: tree-optimization
        AssignedTo: unassigned at gcc dot gnu dot org
        ReportedBy: pinskia at gcc dot gnu dot org
                CC: gcc-bugs at gcc dot gnu dot org


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


^ permalink raw reply	[flat|nested] 7+ messages in thread

end of thread, other threads:[~2004-12-01  0:40 UTC | newest]

Thread overview: 7+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2004-11-17 15:43 [Bug tree-optimization/18529] New: When the lower bound of a loop is non-constant we cannot find the number of iterations pinskia at gcc dot gnu dot org
2004-11-17 15:45 ` [Bug tree-optimization/18529] " pinskia at gcc dot gnu dot org
2004-11-18 14:01 ` rakdver at gcc dot gnu dot org
2004-11-18 21:54 ` rakdver at gcc dot gnu dot org
2004-11-22 21:34 ` cvs-commit at gcc dot gnu dot org
2004-11-22 21:34 ` rakdver at gcc dot gnu dot org
2004-12-01  0:40 ` pinskia at gcc dot gnu dot org

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).