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
|
#include "zlib.h"
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
// don't inline, to be friendly to js engine osr
void __attribute__ ((noinline)) doit(char *buffer, int size, int i) {
static char *buffer2 = NULL;
static char *buffer3 = NULL;
int maxCompressedSize = compressBound(size);
if (!buffer2) buffer2 = (char*)malloc(maxCompressedSize);
if (!buffer3) buffer3 = (char*)malloc(size);
int compressedSize = maxCompressedSize;
compress(buffer2, &compressedSize, buffer, size);
if (i == 0) printf("sizes: %d,%d\n", size, compressedSize);
int decompressedSize = size;
uncompress(buffer3, &decompressedSize, buffer2, compressedSize);
assert(decompressedSize == size);
if (i == 0) assert(strcmp(buffer, buffer3) == 0);
}
int main(int argc, char **argv) {
int size = atoi(argv[1]);
int iters = atoi(argv[2]);
char *buffer = malloc(size);
int i = 0;
int run = 0;
char runChar = 17;
int sum = 0;
while (i < size) {
if (run > 0) {
run--;
} else {
if ((i & 7) == 0) {
runChar = i & 7;
run = i & 31;
} else {
runChar = (i*i) % 6714;
}
}
buffer[i] = runChar;
sum += buffer[i];
if (argc == 100) printf("%d: %d\n", i, buffer[i]); // confuse llvm optimizer, work around possible bug, this is not speed-relevant anyhow
i++;
}
printf("sum: %d\n", sum);
for (i = 0; i < iters; i++) {
doit(buffer, size, i);
}
printf("ok.\n");
return 0;
}
|
