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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
|
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <math.h>
#include <limits.h>
#include "nmglobal.h"
#include "nbench1.h"
/************************
** BITFIELD OPERATIONS **
*************************/
/*************
** DoBitops **
**************
** Perform the bit operations test portion of the CPU
** benchmark. Returns the iterations per second.
*/
void
DoBitops(void)
{
/* Error context string */
const char *context = "CPU:Bitfields";
/* Local bitop structure */
BitOpStruct *locbitopstruct = &global_bitopstruct;
unsigned long *bitarraybase = NULL; /* Base of bitmap array */
unsigned long *bitoparraybase = NULL; /* Base of bitmap operations array */
unsigned long nbitops; /* # of bitfield operations */
unsigned long accumtime; /* Accumulated time in ticks */
double iterations; /* # of iterations */
int ticks;
/*
** See if we need to run adjustment code.
*/
if (locbitopstruct->adjust == 0) {
bitarraybase = realloc(bitarraybase, locbitopstruct->bitfieldarraysize * sizeof(unsigned long));
if (!bitarraybase) {
fprintf(stderr, "Error in %s, could not allocate memory. Exitting...\n", context);
exit(1);
}
/*
** Initialize bitfield operations array to [2,30] elements
*/
locbitopstruct->bitoparraysize = 30L;
while(1) {
bitoparraybase = malloc(locbitopstruct->bitoparraysize * 2 * sizeof(unsigned long));
if (!bitoparraybase) {
fprintf(stderr, "Error in %s, could not allocate memory. Exitting...\n", context);
free(bitarraybase);
exit(1);
}
/*
** 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.
*/
ticks = DoBitfieldIteration(bitarraybase,
bitoparraybase,
locbitopstruct->bitoparraysize,
&nbitops);
if (ticks > global_min_ticks) {
break;
}
locbitopstruct->bitoparraysize += 100L;
}
} else {
/*
** Don't need to do self adjustment, just allocate
** the array space.
*/
bitarraybase = malloc(locbitopstruct->bitfieldarraysize * sizeof(unsigned long));
if (!bitarraybase) {
fprintf(stderr, "Error in %s, could not allocate memory. Exitting...\n", context);
exit(1);
}
bitoparraybase = malloc(locbitopstruct->bitoparraysize * 2 * sizeof(unsigned long));
if (!bitoparraybase) {
fprintf(stderr, "Error in %s, could not allocate memory. Exitting...\n", context);
free(bitarraybase);
exit(1);
}
}
/*
** All's well if we get here. Repeatedly perform bitops until the
** accumulated elapsed time is greater than # of seconds requested.
*/
accumtime = 0L;
iterations = 0.0;
do {
accumtime += DoBitfieldIteration(bitarraybase,
bitoparraybase,
locbitopstruct->bitoparraysize,&nbitops);
iterations += (double)nbitops;
} while (TicksToSecs(accumtime) < locbitopstruct->request_secs);
/*
** Clean up, calculate results, and go home.
** Also, set adjustment flag to show that we don't have
** to do self adjusting in the future.
*/
free(bitarraybase);
free(bitoparraybase);
locbitopstruct->bitopspersec = iterations / TicksToFracSecs(accumtime);
if (locbitopstruct->adjust == 0) {
locbitopstruct->adjust = 1;
}
}
/************************
** DoBitfieldIteration **
*************************
** Perform a single iteration of the bitfield benchmark.
** Return the # of ticks accumulated by the operation.
*/
static unsigned long DoBitfieldIteration(unsigned long *bitarraybase,
unsigned long *bitoparraybase,
long bitoparraysize,
unsigned long *nbitops)
{
long i; /* Index */
unsigned long bitoffset; /* Offset into bitmap */
unsigned long elapsed; /* Time to execute */
/*
** 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)
*/
/*
** Reset random number generator so things repeat.
** Also reset the bit array we work on.
** added by Uwe F. Mayer
*/
randnum((int32_t)13);
for (i=0;i<global_bitopstruct.bitfieldarraysize;i++)
{
#ifdef _LP64
*(bitarraybase+i)=(unsigned long)0x5555555555555555;
#else
*(bitarraybase+i)=(unsigned long)0x55555555;
#endif
}
randnum((int32_t)13);
/* end of addition of code */
for (i=0;i<bitoparraysize;i++)
{
/* First item is offset */
/* *(bitoparraybase+i+i)=bitoffset=abs_randwc(262140L); */
*(bitoparraybase+i+i)=bitoffset=abs_randwc((int32_t)262140);
/* Next item is run length */
/* *nbitops+=*(bitoparraybase+i+i+1L)=abs_randwc(262140L-bitoffset);*/
*nbitops+=*(bitoparraybase+i+i+1L)=abs_randwc((int32_t)262140-bitoffset);
}
/*
** Array of offset and lengths built...do an iteration of
** the test.
** Start the stopwatch.
*/
elapsed=StartStopwatch();
/*
** Loop through array off offset/run length pairs.
** Execute operation based on modulus of index.
*/
for(i = 0; i < bitoparraysize; i++) {
int asdf = i % 3;
switch(asdf) {
case 2: /* Complement run of bits */
FlipBitRun(bitarraybase,
*(bitoparraybase+i+i),
*(bitoparraybase+i+i+1));
break;
default:
ToggleBitRun(bitarraybase,
*(bitoparraybase+i+i),
*(bitoparraybase+i+i+1),
!i);
break;
}
}
/*
** Return elapsed time
*/
return(StopStopwatch(elapsed));
}
/***************
** FlipBitRun **
****************
** Complements a run of bits.
*/
static void FlipBitRun(unsigned long *bitmap, /* Bit map */
unsigned long bit_addr, /* Bit address */
unsigned long nbits) /* # of bits to flip */
{
unsigned long bindex; /* Index into array */
unsigned long bitnumb; /* Bit number */
while(nbits--)
{
#ifdef _LP64
bindex=bit_addr>>6; /* Index is number /64 */
bitnumb=bit_addr % 64; /* Bit number in longword */
#else
bindex=bit_addr>>5; /* Index is number /32 */
bitnumb=bit_addr % 32; /* Bit number in longword */
#endif
bitmap[bindex]^=(1L<<bitnumb);
bit_addr++;
}
return;
}
/*****************************
** ToggleBitRun *
******************************
** Set or clear a run of nbits starting at
** bit_addr in bitmap.
*/
void ToggleBitRun(unsigned long *bitmap, /* Bitmap */
unsigned long bit_addr, /* Address of bits to set */
unsigned long nbits, /* # of bits to set/clr */
unsigned int val) /* 1 or 0 */
{
unsigned long bindex; /* Index into array */
unsigned long bitnumb; /* Bit number */
#if 0
while (nbits != 0) {
nbits--;
bindex = bit_addr >> 6; /* Index is number /64 */
bitnumb = bit_addr % 64; /* Bit number in word */
if (val) {
bitmap[bindex] |= (1L << bitnumb);
} else {
bitmap[bindex] &= ~(1L << bitnumb);
}
bit_addr++;
}
#else
if (val) {
for (; nbits != 0; nbits--) {
bindex = bit_addr >> 6;
bitnumb = bit_addr % 64;
bitmap[bindex] |= (1L << bitnumb);
bit_addr++;
}
} else {
for (; nbits != 0; nbits--) {
bindex = bit_addr >> 6;
bitnumb = bit_addr % 64;
bitmap[bindex] &= ~(1L << bitnumb);
bit_addr++;
}
}
#endif
return;
}
|
