-
Notifications
You must be signed in to change notification settings - Fork 2
/
stress_test3.c
130 lines (107 loc) · 3.17 KB
/
stress_test3.c
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
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <time.h>
#include <string.h>
#include "dmm.h"
#ifdef HAVE_DRAND48
#define RAND() (drand48())
#define SEED(x) (srand48((x)))
#else
#define RAND() ((double)random()/RAND_MAX)
#define SEED(x) (srandom((x)))
#endif
#define BUFLEN (1000)
#define LOOPCNT (50000)
#define MAX_ALLOC_SIZE (MAX_HEAP_SIZE/100)
/* Set to 1 for non-deterministic seeding after each execution */
#define PSEUDO_RANDOM_SEED 0
#define ALLOC_CONST 0.5
int main(int argc, char *argv[]) {
int size;
int itr;
void *ptr[BUFLEN];
int i,j;
double randvar;
int fail = 0;
//long global[LOOPCNT][2];
long int global[LOOPCNT][2];
clock_t begin, end;
double time_spent;
for(j = 0; j < LOOPCNT; j++) {
global[j][0] = -1;
global[j][1] = -1;
}
/* Set the PSEUDO_RANDOM_SEED for pseduo random seed initialization based on time, i.e.,
* the random values changes after each execution
*/
if(PSEUDO_RANDOM_SEED)
SEED(time(NULL));
assert(MAX_HEAP_SIZE >= 1024*1024 && "MAX_HEAP_SIZE is too low; Recommended setting is at least 1MB for test_stress2");
for(i=0; i < BUFLEN; i++) {
ptr[i] = NULL;
}
begin = clock();
for(i = 0; i < LOOPCNT; i++) {
DEBUG("\nCNT %li\n",i);
itr = (int)(RAND() * BUFLEN);
randvar = RAND();
if(randvar < ALLOC_CONST && ptr[itr] == NULL) {
size = (int)(RAND() * MAX_ALLOC_SIZE);
if(size > 0) {
ptr[itr] = dmalloc(size);
//memset(ptr[itr], 0, size);
}
else
continue;
if(ptr[itr] == NULL) {
DEBUG("malloc at iteration %d failed for size %d\n", i,size);
fflush(stderr);
++fail;
continue;
}
/* Range check */
for(j = 0; j < i; j++) {
if(global[j][0] == -1) {
continue;
}
if((ptr[itr] >= global[j][0]) && (ptr[itr]+size <= global[j][1])) {
printf("[s] = %ld, [e] = %ld, [p] = %ld, [itr] = %d, [size] = %ld\n", global[j][0], global[j][1], ptr[itr], i, size);
printf("Correctness check failed\n");
exit(EXIT_FAILURE);
}
}
global[i][0] = ptr[itr];
global[i][1] = ptr[itr] + size;
printf("Assigned: [s] = %ld, [e] = %ld, [p] = %ld, [itr] = %d, [size] = %ld\n", global[i][0], global[i][1], ptr[itr],i, size);
} else if(randvar >= ALLOC_CONST && ptr[itr] != NULL) {
DEBUG("Freeing ptr[%d]\n", itr);
for(j = 0; j < i; j++) {
if(global[j][0] == ptr[itr]) {
global[j][0] = -1;
global[j][1] = -1;
}
}
dfree(ptr[itr]);
ptr[itr] = NULL;
}
}
/*
* now -- free them
* */
for(i=0; i < BUFLEN; i++) {
if(ptr[i] != NULL) {
dfree(ptr[i]);
ptr[i] = NULL;
}
}
end = clock();
//print_freelists();
DEBUG("\n");
time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
printf("Test case summary\n");
printf("Loop count: %d, malloc successful: %d, malloc failed: %d, execution time: %g seconds\n\n", LOOPCNT, LOOPCNT-fail, fail, time_spent);
printf("Stress testcases3 passed!\n");
return 0;
}