gcc/testsuite/gcc.dg/tree-ssa/tailrecursion-7.c

   1 /* { dg-do run } */
   2 /* { dg-options "-O1 -foptimize-sibling-calls -fdump-tree-optimized" } */
   3
   4 extern void abort (void);
   5 extern void exit (int);
   6
   7 int foo (int n)
   8 {
   9   return n == 0 ? 1 : n * (n - foo (n - 1));
  10 }
  11
  12 int bar (int n)
  13 {
  14   return n == 0 ? 1 : n * (- bar (n - 1));
  15 }
  16
  17 int baz (int n, int m)
  18 {
  19   return n == 0 ? 100 : (baz (n - 1, m) - m);
  20 }
  21
  22 int main (void)
  23 {
  24   if (foo (6) != 726)
  25     abort ();
  26
  27   if (bar (7) != -5040)
  28     abort ();
  29
  30   if (baz (10, 5) != 50)
  31     abort ();
  32
  33   exit (0);
  34 }
  35
  36 /* { dg-final { scan-tree-dump-times "\\mfoo\\M" 4 "optimized"} } */
  37 /* { dg-final { scan-tree-dump-times "\\mbar\\M" 4 "optimized"} } */
  38 /* { dg-final { scan-tree-dump-times "\\mbaz\\M" 4 "optimized"} } */
  39