Files

80 lines
2.0 KiB
C

/*
This program is part of the TACLeBench benchmark suite.
Version V 1.x
Name: recursion
Author: unknown
Function: recursion is a recursion program.
This program computes the Fibonacci number recursively.
Source: MRTC
http://www.mrtc.mdh.se/projects/wcet/wcet_bench/recursion/recursion.c
Changes: no major functional changes
License: May be used, modified, and re-distributed freely.
*/
/*
Global Variables
*/
int recursion_result;
int recursion_input;
/*
Forward declaration of functions
*/
__attribute__((always_inline)) static inline int recursion_fib(int i);
__attribute__((noinline)) __attribute__((export_name("entrypoint")))
__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
recursion_main(void);
__attribute__((always_inline)) static inline void recursion_init(void);
__attribute__((always_inline)) static inline int recursion_return(void);
__attribute__((noinline)) __attribute__((export_name("main")))
__attribute__((noinline)) __attribute__((export_name("main"))) int
main(void);
__attribute__((always_inline)) static inline void
recursion_init() {
int volatile temp_input = 10;
recursion_input = temp_input;
}
__attribute__((always_inline)) static inline int
recursion_fib(int i) {
if (i == 0)
return 1;
if (i == 1)
return 1;
return recursion_fib(i - 1) + recursion_fib(i - 2);
}
__attribute__((always_inline)) static inline int
recursion_return() {
return (recursion_result + (-89)) != 0;
}
__attribute__((noinline)) __attribute__((export_name("entrypoint")))
__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
recursion_main(void) {
_Pragma("marker recursivecall")
_Pragma("flowrestriction 1*fib <= 177*recursivecall") recursion_result =
recursion_fib(recursion_input);
}
__attribute__((noinline)) __attribute__((export_name("main")))
__attribute__((noinline)) __attribute__((export_name("main"))) int
main(void) {
recursion_init();
recursion_main();
return (recursion_return());
}