2 /* { dg-options "-O1 -fdump-tree-optimized" } */
9 return n + sum (n - 1);
17 return n * fac (n - 1);
25 return n * n + sq_sum (n - 1);
33 return 2 * pow2m1 (n - 1) + 1;
41 return fib (n - 2) + fib (n - 1);
64 /* There is one call of sum in main and then 2 instances of the word in
65 ;; Function sum (sum) and one in the function header. */
66 /* { dg-final { scan-tree-dump-times "\\msum\\M" 4 "optimized"} } */
67 /* { dg-final { scan-tree-dump-times "\\mfac\\M" 4 "optimized"} } */
68 /* { dg-final { scan-tree-dump-times "\\msq_sum\\M" 4 "optimized"} } */
69 /* { dg-final { scan-tree-dump-times "\\mpow2m1\\M" 4 "optimized"} } */
71 /* There is one recursive call to fib. */
72 /* { dg-final { scan-tree-dump-times "\\mfib\\M" 5 "optimized"} } */