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
|
/*
* $Id: memtest.c,v 1.1.1.1 2005/06/13 16:47:30 bogdan_iancu Exp $
*
* Copyright (C) 2001-2003 FhG Fokus
*
* This file is part of openser, a free SIP server.
*
* openser 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 of the License, or
* (at your option) any later version
*
* openser 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; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifdef DBG_QM_MALLOC
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "../globals.h"
#include "../config.h"
#if 0
#ifdef PKG_MALLOC
# ifdef VQ_MALLOC
# include "vq_malloc.h"
# define MY_MALLOC vqm_malloc
# define MY_FREE vqm_free
# define MY_INIT vqm_malloc_init
# define MY_BLOCK vqm_block
# define MY_STATUS vqm_status
# else
# include "q_malloc.h"
# define MY_MALLOC qm_malloc
# define MY_FREE qm_free
# define MY_INIT qm_malloc_init
# define MY_BLOCK qm_block
# define MY_STATUS qm_status
# endif
#endif
void memtest()
{
#define TEST_SIZE 1024*1024
#define TEST_RUN 1024
#define LONG_RUN 100000
#define ma(s) MY_MALLOC(mem_block, (s),__FILE__, __FUNCTION__, \
__LINE__);
#define mf(p) MY_FREE(mem_block, (p), __FILE__, __FUNCTION__, \
__LINE__);
char tst_mem[TEST_SIZE];
struct MY_BLOCK* mem_block;
char *p0,*p1,*p2,*p3,*p4,*p5,*p6/*,*p7,*p8,*p9*/;
int i, j, f;
char *p[TEST_RUN];
int t;
debug=7;
log_stderr=1;
printf("entering test\n");
mem_block=MY_INIT( tst_mem, TEST_SIZE );
/* coalescing test w/big fragments */
p0=ma(8194);
p1=ma(8194);
p2=ma(8194);
MY_STATUS(mem_block);
mf(p1);
mf(p0);
MY_STATUS(mem_block);
mf(p2);
MY_STATUS(mem_block);
/* reuse test w/big fragments */
p0=ma(8194);
p1=ma(4196);
mf(p0);
p0=ma(8190);
MY_STATUS(mem_block);
mf(p1);
mf(p0);
MY_STATUS(mem_block);
exit(0);
p0=ma(8);
p1=ma(24);
p2=ma(32);
p3=ma(32);
p4=ma(32);
p5=ma(1024);
p6=ma(2048);
// MY_STATUS(mem_block);
// *(p0+9)=0;
mf(p0);
mf(p2);
mf(p5);
mf(p6);
// MY_STATUS(mem_block);
mf(p1);
mf(p4);
mf(p3);
// mf(p3);
// MY_STATUS(mem_block);
for (i=0;i<TEST_RUN;i++)
p[i]=ma( random() & 1023 );
// MY_STATUS(mem_block);
for (i=0;i<TEST_RUN;i++)
mf( p[i] );
// MY_STATUS(mem_block);
f = 0;
#define GRANULARITY 100
for (j=0; j<LONG_RUN; j++) {
for (i=0;i<TEST_RUN;i++) {
t=random() & 1023;
if (! (t%24) ) t=(t+4096)*2;
p[i]=ma( random() & 1023 );
}
for (i=TEST_RUN/3;i<2*TEST_RUN/3;i++)
mf( p[i] );
for (i=TEST_RUN/3;i<2*TEST_RUN/3;i++) {
t=random() & 1023;
if (! (t%24) ) t=(t+4096)*2;
p[i]=ma( random() & 1023 );
}
for (i=0;i<TEST_RUN;i++)
mf( p[i] );
if ( GRANULARITY*j/LONG_RUN > f ) {
f=GRANULARITY*j/LONG_RUN ;
printf("%d%% done\n", f);
}
}
printf("now I'm really done\n");
MY_STATUS(mem_block);
printf("And I'm done with dumping final report too\n");
exit(0);
}
#endif
#endif
|
