Reduce runtime of tacle countnegative/fft/recursion benchmarks
This commit is contained in:
+1
-1
@@ -28,7 +28,7 @@
|
||||
__attribute__((import_module("__pragma"), import_name("loopbound"))) extern void
|
||||
__pragma_loopbound(unsigned int min_bound, unsigned int max_bound);
|
||||
|
||||
#define MAXSIZE 20
|
||||
#define MAXSIZE 8
|
||||
|
||||
/*
|
||||
Type definition for the matrix
|
||||
|
||||
@@ -71,7 +71,7 @@
|
||||
__attribute__((import_module("__pragma"), import_name("loopbound"))) extern void
|
||||
__pragma_loopbound(unsigned int min_bound, unsigned int max_bound);
|
||||
|
||||
#define N_FFT 1024
|
||||
#define N_FFT 16
|
||||
#define NUMBER_OF_BITS 13 /* fract format 1.NUMBER_OF_BITS = 1.13 */
|
||||
|
||||
#define BITS_PER_TWID 13 /* bits per twiddle coefficient */
|
||||
|
||||
@@ -37,7 +37,7 @@ __attribute__((noinline)) __attribute__((export_name("main"))) int main(void);
|
||||
|
||||
void
|
||||
recursion_init() {
|
||||
int volatile temp_input = 10;
|
||||
int volatile temp_input = 7;
|
||||
recursion_input = temp_input;
|
||||
}
|
||||
|
||||
@@ -53,7 +53,7 @@ recursion_fib(int i) {
|
||||
|
||||
int
|
||||
recursion_return() {
|
||||
return (recursion_result + (-89)) != 0;
|
||||
return (recursion_result + (-21)) != 0;
|
||||
}
|
||||
|
||||
__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
|
||||
|
||||
Reference in New Issue
Block a user