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
|
/*
* This file is part of Quagga.
*
* Quagga is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2, or (at your option) any
* later version.
*
* Quagga is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <zebra.h>
#include <memory.h>
DEFINE_MGROUP(TEST_MEMORY, "memory test");
DEFINE_MTYPE_STATIC(TEST_MEMORY, TEST, "generic test mtype");
/* Memory torture tests
*
* Tests below are generic but comments are focused on interaction with
* Paul's proposed memory 'quick' cache, which may never be included in
* CVS
*/
struct thread_master *master;
#if 0 /* set to 1 to use system alloc directly */
#undef XMALLOC
#undef XCALLOC
#undef XREALLOC
#undef XFREE
#define XMALLOC(T,S) malloc((S))
#define XCALLOC(T,S) calloc(1, (S))
#define XREALLOC(T,P,S) realloc((P),(S))
#define XFREE(T,P) free((P))
#endif
#define TIMES 10
int main(int argc, char **argv)
{
void *a[10];
int i;
printf("malloc x, malloc x, free, malloc x, free free\n\n");
/* simple case, test cache */
for (i = 0; i < TIMES; i++) {
a[0] = XMALLOC(MTYPE_TEST, 1024);
memset(a[0], 1, 1024);
a[1] = XMALLOC(MTYPE_TEST, 1024);
memset(a[1], 1, 1024);
XFREE(MTYPE_TEST, a[0]); /* should go to cache */
a[0] = XMALLOC(MTYPE_TEST,
1024); /* should be satisfied from cache */
XFREE(MTYPE_TEST, a[0]);
XFREE(MTYPE_TEST, a[1]);
}
printf("malloc x, malloc y, free x, malloc y, free free\n\n");
/* cache should go invalid, valid, invalid, etc.. */
for (i = 0; i < TIMES; i++) {
a[0] = XMALLOC(MTYPE_TEST, 512);
memset(a[0], 1, 512);
a[1] = XMALLOC(MTYPE_TEST, 1024); /* invalidate cache */
memset(a[1], 1, 1024);
XFREE(MTYPE_TEST, a[0]);
a[0] = XMALLOC(MTYPE_TEST, 1024);
XFREE(MTYPE_TEST, a[0]);
XFREE(MTYPE_TEST, a[1]);
/* cache should become valid again on next request */
}
printf("calloc\n\n");
/* test calloc */
for (i = 0; i < TIMES; i++) {
a[0] = XCALLOC(MTYPE_TEST, 1024);
memset(a[0], 1, 1024);
a[1] = XCALLOC(MTYPE_TEST, 512); /* invalidate cache */
memset(a[1], 1, 512);
XFREE(MTYPE_TEST, a[1]);
XFREE(MTYPE_TEST, a[0]);
/* alloc == 0, cache can become valid again on next request */
}
printf("calloc and realloc\n\n");
/* check calloc + realloc */
for (i = 0; i < TIMES; i++) {
printf("calloc a0 1024\n");
a[0] = XCALLOC(MTYPE_TEST, 1024);
memset(a[0], 1, 1024 / 2);
printf("calloc 1 1024\n");
a[1] = XCALLOC(MTYPE_TEST, 1024);
memset(a[1], 1, 1024 / 2);
printf("realloc 0 1024\n");
a[3] = XREALLOC(MTYPE_TEST, a[0], 2048); /* invalidate cache */
if (a[3] != NULL)
a[0] = a[3];
memset(a[0], 1, 1024);
printf("calloc 2 512\n");
a[2] = XCALLOC(MTYPE_TEST, 512);
memset(a[2], 1, 512);
printf("free 1 0 2\n");
XFREE(MTYPE_TEST, a[1]);
XFREE(MTYPE_TEST, a[0]);
XFREE(MTYPE_TEST, a[2]);
/* alloc == 0, cache valid next request */
}
return 0;
}
|
