Add a perf test to measure the speed (and memory) of PDB handling.
* modified perf/heap.c so that it optionally creates a partially defined bytes every N bytes
* created perf/heap_pdb4.vgperf calling heap 4 (so one byte on 4 is PDB in what heap allocates).
before/after pool alloc, here are the performances on a ppc64. So, it looks like
pool alloc also significantly improves the speed of PDB handling.
perl perf/vg_perf --vg=../pool_alloc --vg=../before_pool_trunk_untouched --reps=5 perf/heap_pdb4.vgperf
-- heap_pdb4 --
heap_pdb4 pool_alloc:0.41s no: 3.0s ( 7.3x, -----) me:11.9s (29.0x, -----)
heap_pdb4 before_pool_trunk_untouched:0.41s no: 3.1s ( 7.6x, -3.7%) me:16.9s (41.1x,-41.7%)
git-svn-id: svn://svn.valgrind.org/valgrind/trunk@12342 a5019735-40e9-0310-863c-91ae7b9d1cf9
diff --git a/perf/heap.c b/perf/heap.c
index c84f6cb..8b38bec 100644
--- a/perf/heap.c
+++ b/perf/heap.c
@@ -7,9 +7,16 @@
char* arr[NLIVE];
-int main ( void )
+int main ( int argc, char* argv[] )
{
int i, j, nbytes = 0;
+ int pdb = 0;
+ int jpdb;
+
+ if (argc > 1) {
+ pdb = atoi(argv[1]);
+ }
+
printf("initialising\n");
for (i = 0; i < NLIVE; i++)
arr[i] = NULL;
@@ -22,6 +29,12 @@
if (arr[j])
free(arr[j]);
arr[j] = malloc(nbytes);
+ if (pdb > 0) {
+ // create some partially defined bytes in arr[j]
+ for (jpdb=0; jpdb<nbytes; jpdb = jpdb+pdb) {
+ arr[j][jpdb] &= (jpdb & 0xff);
+ }
+ }
// Cycle through the sizes 0,8,16,24,32. Zero will get rounded up to
// 8, so the 8B bucket will get twice as much traffic.