OpenCores
URL https://opencores.org/ocsvn/openrisc/openrisc/trunk

Subversion Repositories openrisc

[/] [openrisc/] [tags/] [gnu-src/] [gcc-4.5.1/] [gcc-4.5.1-or32-1.0rc1/] [gcc/] [testsuite/] [gcc.dg/] [tree-ssa/] [tailrecursion-5.c] - Diff between revs 298 and 338

Only display areas with differences | Details | Blame | View Log

Rev 298 Rev 338
/* { dg-do run } */
/* { dg-do run } */
/* { dg-options "-O1 -foptimize-sibling-calls -fdump-tree-optimized" } */
/* { dg-options "-O1 -foptimize-sibling-calls -fdump-tree-optimized" } */
 
 
extern void abort (void);
extern void abort (void);
extern void exit (int);
extern void exit (int);
 
 
int sum (int n)
int sum (int n)
{
{
  if (n == 0)
  if (n == 0)
    return 0;
    return 0;
 
 
  return n + sum (n - 1);
  return n + sum (n - 1);
}
}
 
 
int fac (int n)
int fac (int n)
{
{
  if (n == 0)
  if (n == 0)
    return 1;
    return 1;
 
 
  return n * fac (n - 1);
  return n * fac (n - 1);
}
}
 
 
int sq_sum (int n)
int sq_sum (int n)
{
{
  if (n == 0)
  if (n == 0)
    return 0;
    return 0;
 
 
  return n * n + sq_sum (n - 1);
  return n * n + sq_sum (n - 1);
}
}
 
 
int pow2m1 (int n)
int pow2m1 (int n)
{
{
  if (n == 0)
  if (n == 0)
    return 0;
    return 0;
 
 
  return 2 * pow2m1 (n - 1) + 1;
  return 2 * pow2m1 (n - 1) + 1;
}
}
 
 
int fib (int n)
int fib (int n)
{
{
  if (n <= 1)
  if (n <= 1)
    return 1;
    return 1;
 
 
  return fib (n - 2) + fib (n - 1);
  return fib (n - 2) + fib (n - 1);
}
}
 
 
int main(void)
int main(void)
{
{
  if (sum (5) != 15)
  if (sum (5) != 15)
    abort ();
    abort ();
 
 
  if (fac (5) != 120)
  if (fac (5) != 120)
    abort ();
    abort ();
 
 
  if (sq_sum (5) != 55)
  if (sq_sum (5) != 55)
    abort ();
    abort ();
 
 
  if (pow2m1 (5) != 31)
  if (pow2m1 (5) != 31)
    abort ();
    abort ();
 
 
  if (fib (5) != 8)
  if (fib (5) != 8)
    abort ();
    abort ();
 
 
  exit (0);
  exit (0);
}
}
 
 
/* There is one call of sum in main and then 2 instances of the word in
/* There is one call of sum in main and then 2 instances of the word in
   ;; Function sum (sum) and one in the function header.  */
   ;; Function sum (sum) and one in the function header.  */
/* { dg-final { scan-tree-dump-times "\\msum\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\msum\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\mfac\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\mfac\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\msq_sum\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\msq_sum\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\mpow2m1\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\mpow2m1\\M" 4 "optimized"} } */
 
 
/* There is one recursive call to fib.  */
/* There is one recursive call to fib.  */
/* { dg-final { scan-tree-dump-times "\\mfib\\M" 5 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\mfib\\M" 5 "optimized"} } */
 
 
/* { dg-final { cleanup-tree-dump "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.