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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
//**************************************************************************
// Quicksort benchmark
//--------------------------------------------------------------------------
//
// This benchmark uses quicksort to sort an array of integers. The
// implementation is largely adapted from Numerical Recipes for C. The
// input data (and reference data) should be generated using the
// qsort_gendata.pl perl script and dumped to a file named
// dataset1.h The smips-gcc toolchain does not support system calls
// so printf's can only be used on a host system, not on the smips
// processor simulator itself. You should not change anything except
// the HOST_DEBUG and PREALLOCATE macros for your timing run.
int ncores = 1;
#include "util.h"
//--------------------------------------------------------------------------
// Macros
// Set HOST_DEBUG to 1 if you are going to compile this for a host
// machine (ie Athena/Linux) for debug purposes and set HOST_DEBUG
// to 0 if you are compiling with the smips-gcc toolchain.
#ifndef HOST_DEBUG
#define HOST_DEBUG 0
#endif
// Set PREALLOCATE to 1 if you want to preallocate the benchmark
// function before starting stats. If you have instruction/data
// caches and you don't want to count the overhead of misses, then
// you will need to use preallocation.
#ifndef PREALLOCATE
#define PREALLOCATE 0
#endif
// Set SET_STATS to 1 if you want to carve out the piece that actually
// does the computation.
#ifndef SET_STATS
#define SET_STATS 0
#endif
// The INSERTION_THRESHOLD is the size of the subarray when the
// algorithm switches to using an insertion sort instead of
// quick sort.
#define INSERTION_THRESHOLD 7
// NSTACK is the required auxiliary storage.
// It must be at least 2*lg(DATA_SIZE)
#define NSTACK 50
// Swap macro for swapping two values.
#define SWAP(a,b) temp=(a);(a)=(b);(b)=temp;
//--------------------------------------------------------------------------
// Input/Reference Data
#include "dataset1.h"
//--------------------------------------------------------------------------
// Helper functions
int verify( int n, int test[], int correct[] )
{
int i;
for ( i = 0; i < n; i++ ) {
if ( test[i] != correct[i] ) {
return 2;
}
}
return 1;
}
#if HOST_DEBUG
void printArray( char name[], int n, int arr[] )
{
int i;
printf( " %10s :", name );
for ( i = 0; i < n; i++ )
printf( " %3d ", arr[i] );
printf( "\n" );
}
#endif
void setStats( int enable )
{
#if ( !HOST_DEBUG && SET_STATS )
asm( "mtpcr %0, cr10" : : "r" (enable) );
#endif
}
//--------------------------------------------------------------------------
// Quicksort function
void sort( int n, int arr[] )
{
int i,j,k;
int ir = n;
int l = 1;
int jstack = 0;
int a, temp;
int istack[NSTACK];
for (;;) {
#if HOST_DEBUG
printArray( "", n, arr );
#endif
// Insertion sort when subarray small enough.
if ( ir-l < INSERTION_THRESHOLD ) {
for ( j = l+1; j <= ir; j++ ) {
a = arr[j-1];
for ( i = j-1; i >= l; i-- ) {
if ( arr[i-1] <= a ) break;
arr[i] = arr[i-1];
}
arr[i] = a;
}
if ( jstack == 0 ) break;
// Pop stack and begin a new round of partitioning.
ir = istack[jstack--];
l = istack[jstack--];
}
else {
// Choose median of left, center, and right elements as
// partitioning element a. Also rearrange so that a[l-1] <= a[l] <= a[ir-].
k = (l+ir) >> 1;
SWAP(arr[k-1],arr[l])
if ( arr[l-1] > arr[ir-1] ) {
SWAP(arr[l-1],arr[ir-1])
}
if ( arr[l] > arr[ir-1] ) {
SWAP(arr[l],arr[ir-1])
}
if ( arr[l-1] > arr[l] ) {
SWAP(arr[l-1],arr[l])
}
// Initialize pointers for partitioning.
i = l+1;
j = ir;
// Partitioning element.
a = arr[l];
for (;;) { // Beginning of innermost loop.
do i++; while (arr[i-1] < a); // Scan up to find element > a.
do j--; while (arr[j-1] > a); // Scan down to find element < a.
if (j < i) break; // Pointers crossed. Partitioning complete.
SWAP(arr[i-1],arr[j-1]); // Exchange elements.
} // End of innermost loop.
// Insert partitioning element.
arr[l] = arr[j-1];
arr[j-1] = a;
jstack += 2;
// Push pointers to larger subarray on stack,
// process smaller subarray immediately.
#if HOST_DEBUG
if ( jstack > NSTACK ) { printf("NSTACK too small in sort.\n"); exit(1); }
#endif
if ( ir-i+1 >= j-l ) {
istack[jstack] = ir;
istack[jstack-1] = i;
ir = j-1;
}
else {
istack[jstack] = j-1;
istack[jstack-1] = l;
l = i;
}
}
}
}
//--------------------------------------------------------------------------
// Main
int main( int argc, char* argv[] )
{
// Output the input array
#if HOST_DEBUG
printArray( "input", DATA_SIZE, input_data );
printArray( "verify", DATA_SIZE, verify_data );
#endif
// If needed we preallocate everything in the caches
#if PREALLOCATE
sort( DATA_SIZE, input_data );
#endif
// Do the sort
setStats(1);
sort( DATA_SIZE, input_data );
setStats(0);
// Print out the results
#if HOST_DEBUG
printArray( "test", DATA_SIZE, input_data );
#endif
// Check the results
finishTest(verify( DATA_SIZE, input_data, verify_data ));
}
|
