-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfact.c
More file actions
189 lines (158 loc) · 2.86 KB
/
fact.c
File metadata and controls
189 lines (158 loc) · 2.86 KB
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
/* Benchmark factorials */
#include <stdio.h>
#include "cpe.h"
#define ASIZE 1024
long rfact(long n)
{
if (n <= 1)
return 1;
return n * rfact(n-1);
}
/* $begin fact */
long fact(long n)
{
long i;
long result = 1;
for (i = 2; i <= n; i++)
result = result * i;
return result;
}
/* $end fact */
/* $begin fact_u2 */
long fact_u2a(long n)
{
long i;
long result = 1;
for (i = 2; i <= n-1; i +=2) {
result = (result * i) * (i+1);
}
for (; i <= n; i++)
result *= i;
return result;
}
/* $end fact_u2 */
long fact_u2b(long n)
{
long i;
long result = 1;
for (i = 2; i <= n-1; i +=2) {
/* $begin fact_u2line */
result = result * (i * (i+1));
/* $end fact_u2line */
}
for (; i <= n; i++)
result *= i;
return result;
}
long fact_u2c(long n)
{
long i;
long result0 = 1;
long result1 = 1;
for (i = 2; i <= n-1; i+=2) {
result0 *= i;
result1 *= (i+1);
}
for (; i <= n; i++)
result0 *= i;
return result0 * result1;
}
long fact_u3a(long n)
{
long i;
long result = 1;
for (i = 2; i <= n-2; i +=3) {
result = (result * i) * (i+1) * (i+2);
}
for (; i <= n; i++)
result *= i;
return result;
}
long fact_u3b(long n)
{
long i;
long result = 1;
for (i = 2; i <= n-2; i +=3) {
result = result * (i * (i+1) * (i+2));
}
for (; i <= n; i++)
result *= i;
return result;
}
long fact_u3c(long n)
{
long i;
long result0 = 1;
long result1 = 1;
long result2 = 1;
for (i = 2; i <= n-2; i+=3) {
result0 *= i;
result1 *= (i+1);
result2 *= (i+2);
}
for (; i <= n; i++)
result0 *= i;
return result0 * result1 * result2;
}
/* Strange version to test partial expansion of recursion */
long rfact_a(long n)
{
if (n <= 1)
return 1;
return n * -rfact_a(n-1);
}
typedef long (*fact_fun)(long);
#define TEST_COUNT 9
static fact_fun funs[TEST_COUNT] =
{ rfact, fact,
fact_u2a, fact_u2b, fact_u2c,
fact_u3a, fact_u3b, fact_u3c,
rfact_a
};
static char *test_descr[TEST_COUNT] =
{
"Recursive",
"Iterative",
"Unroll 2X Assoc 1",
"Unroll 2X Assoc 2",
"Unroll 2X Split",
"Unroll 3X Assoc 1",
"Unroll 3X Assoc 2",
"Unroll 3X Split",
"Expansion of recursion"
};
long idx = 0;
static void test(long n)
{
funs[idx](n);
}
/* Perform functional test of factorial function i */
static void ftest(long i)
{
long n;
for (n = 0; n < 10; n++) {
if (funs[i](n) != rfact(n)) {
printf("Oops. %ld! yields %ld, should be %ld\n",
n, funs[i](n), rfact(n));
break;
}
}
}
static void run_test(long i)
{
double cpe;
printf("Description: %s, ",
test_descr[i]);
idx = i;
cpe = find_cpe(test, ASIZE);
/* print results */
printf("CPE = %.2f\n", cpe);
ftest(i);
}
int main()
{
int i;
for (i = 0; i < TEST_COUNT; i++)
run_test(i);
return 0;
}