File: tailrecursion-7.c

package info (click to toggle)
gcc-riscv64-unknown-elf 8.3.0.2019.08%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 680,956 kB
  • sloc: ansic: 3,237,715; cpp: 896,882; ada: 772,854; f90: 144,254; asm: 68,788; makefile: 67,456; sh: 29,743; exp: 28,045; objc: 15,273; fortran: 11,885; python: 7,369; pascal: 5,375; awk: 3,725; perl: 2,872; yacc: 316; xml: 311; ml: 285; lex: 198; haskell: 122
file content (39 lines) | stat: -rw-r--r-- 707 bytes parent folder | download | duplicates (6) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
 
/* { dg-do run } */
/* { dg-options "-O1 -foptimize-sibling-calls -fdump-tree-optimized" } */

extern void abort (void);
extern void exit (int);

int foo (int n)
{
  return n == 0 ? 1 : n * (n - foo (n - 1));
}

int bar (int n)
{
  return n == 0 ? 1 : n * (- bar (n - 1));
}

int baz (int n, int m)
{
  return n == 0 ? 100 : (baz (n - 1, m) - m);
}

int main (void)
{
  if (foo (6) != 726)
    abort ();

  if (bar (7) != -5040)
    abort ();

  if (baz (10, 5) != 50)
    abort ();

  exit (0);
}

/* { dg-final { scan-tree-dump-times "\\mfoo\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\mbar\\M" 4 "optimized"} } */
/* { dg-final { scan-tree-dump-times "\\mbaz\\M" 4 "optimized"} } */