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
|
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <time.h>
#include "cleanbench.h"
#include "randnum.h"
/************************
** BITFIELD OPERATIONS **
*************************/
#ifdef _LP64
#define ARRAY_SIZE 16384L
#else
#define ARRAY_SIZE 32768L
#endif
static clock_t DoBitfieldIteration(unsigned long *bitarray,
unsigned long *bitoparray,
long bitop_array_size,
unsigned long *nbitops);
static void SetBitRun(unsigned long* bitmap, unsigned long bit_address, unsigned long num_bits);
static void ClearBitRun(unsigned long* bitmap, unsigned long bit_address, unsigned long num_bits);
static void FlipBitRun(unsigned long* bitmap, unsigned long bit_address, unsigned long num_bits);
/*************
** DoBitops **
**************
** Perform the bit operations test portion of the CPU
** benchmark. Returns the iterations per second.
*/
double
DoBitops(void)
{
unsigned long* bitarray = NULL;
unsigned long* bitoparray = NULL;
clock_t total_time = 0;
int iterations = 0;
unsigned long nbitops;
static bool is_adjusted = false;
static int bitop_array_size = -70; /* -70 because we want to malloc 30 and we add 100 to it in the loop */
if (is_adjusted == false) {
is_adjusted = true;
bitarray = realloc(bitarray, ARRAY_SIZE * sizeof(unsigned long));
do {
bitop_array_size += 100;
bitoparray = malloc(bitop_array_size * 2 * sizeof(unsigned long));
/*
** Do an iteration of the bitmap test. If the
** elapsed time is less than or equal to the permitted
** minimum, then de-allocate the array, reallocate a
** larger version, and try again.
*/
} while (DoBitfieldIteration(bitarray, bitoparray, bitop_array_size, &nbitops) <= MINIMUM_TICKS);
} else {
/*
** Don't need to do self adjustment, just allocate
** the array space.
*/
bitarray = malloc(ARRAY_SIZE * sizeof(unsigned long));
bitoparray = malloc(bitop_array_size * 2 * sizeof(unsigned long));
}
/*
** All's well if we get here. Repeatedly perform bitops until the
** accumulated elapsed time is greater than # of seconds requested.
*/
do {
total_time += DoBitfieldIteration(bitarray, bitoparray, bitop_array_size,&nbitops);
iterations += nbitops;
} while (total_time < MINIMUM_SECONDS * CLOCKS_PER_SEC);
free(bitarray);
free(bitoparray);
return (double)(iterations * CLOCKS_PER_SEC) / (double)total_time;
}
/************************
** DoBitfieldIteration **
*************************
** Perform a single iteration of the bitfield benchmark.
** Return the # of ticks accumulated by the operation.
*/
static clock_t
DoBitfieldIteration(unsigned long *bitarray, unsigned long *bitoparray, long bitop_array_size, unsigned long *nbitops)
{
clock_t start, stop;
long i;
unsigned long bitoffset;
void (*DoBitOp[])(unsigned long* bitmap, unsigned long bit_address, unsigned long num_bits) = {
SetBitRun,
ClearBitRun,
FlipBitRun
};
/*
* ** Clear # bitops counter
* */
*nbitops = 0L;
/*
* ** Construct a set of bitmap offsets and run lengths.
* ** The offset can be any random number from 0 to the
* ** size of the bitmap (in bits). The run length can
* ** be any random number from 1 to the number of bits
* ** between the offset and the end of the bitmap.
* ** Note that the bitmap has 8192 * 32 bits in it.
* ** (262,144 bits)
* */
memset(bitarray, 0x55, ARRAY_SIZE);
randnum(13);
for (i = 0; i < bitop_array_size; i++) {
/* First item is offset */
*(bitoparray + i + i) = bitoffset = abs_randwc((int32_t)262140);
/* Next item is run length */
*nbitops += *(bitoparray + i + i + 1L) = abs_randwc((int32_t)262140 - bitoffset);
}
start = clock();
for(i = 0; i < bitop_array_size; i++) {
(*DoBitOp[i % 3])(bitarray, *(bitoparray + i + i), *(bitoparray + i + i + 1));
}
stop = clock();
return stop - start;
}
/***************
** FlipBitRun **
****************
** Complements a run of bits.
*/
static void
FlipBitRun(unsigned long* bitmap, unsigned long bit_address, unsigned long num_bits)
{
unsigned long bit_index;
unsigned long bit_number;
while (num_bits--) {
#ifdef _LP64
bit_index = bit_address >> 6;
bit_number = bit_address % 64;
#else
bit_index = bit_address >> 5;
bit_number = bit_address % 32;
#endif
bitmap[bit_index] ^= (1L << bit_number);
bit_address++;
}
}
/*****************************
* ** SetBitRun
* ***************************
* ** Set a run of num_bits starting
* ** at bit_address in bitmap
* */
static void
SetBitRun(unsigned long* bitmap, unsigned long bit_address, unsigned long num_bits)
{
unsigned long bit_index;
unsigned long bit_number;
while (num_bits--) {
#ifdef _LP64
bit_index = bit_address >> 6;
bit_number = bit_address % 64;
#else
bit_index = bit_address >> 5;
bit_number = bit_address % 32;
#endif
bitmap[bit_index] |= (1L << bit_number);
bit_address++;
}
}
/*****************************
* ** ClearBitRun
* ***************************
* ** Clear a run of num_bits starting
* ** at bit_address in bitmap
* */
static void
ClearBitRun(unsigned long* bitmap, unsigned long bit_address, unsigned long num_bits)
{
unsigned long bit_index;
unsigned long bit_number;
while (num_bits--) {
#ifdef _LP64
bit_index = bit_address >> 6;
bit_number = bit_address % 64;
#else
bit_index = bit_address >> 5;
bit_number = bit_address % 32;
#endif
bitmap[bit_index] &= ~(1L << bit_number);
bit_address++;
}
}
|
