path: root/btt/devmap.c
diff options
authorAlan David Brunelle <>2006-10-03 14:44:18 +0200
committerJens Axboe <>2006-10-03 14:44:18 +0200
commit6eb42155679cfa6fcd03d23199c5ba0a233b53e7 (patch)
tree88882783654bff6086c81f3c73bc2cefb00862cc /btt/devmap.c
parentd216e9ce50602b7a7f99e1196e42d52d00f1b4f5 (diff)
[PATCH] Convert to using on-the-fly RB trees, no post-traversal.
From: Alan D. Brunelle <> - Converted to using RB trees as much as possible - significant speed up in general. - Changed from constructing IO bushes to just doing things inline as we get the traces. Significant speed up and reduction in complexity. Lost ability to absolutely handle REQUEUE traces (may put out the wrong min/max information for certain stats). - Added btt/dip_rb.c - Removed btt/traverse.c btt/iofree.c btt/cylist.c - Fixed message concerning stats & range data to include '.dat' - Added in timing statistics (K traces per second handled) - Changed verbose to just update once per second - Added notions of "foreach" iterators for devices, processes, IO traces, ... - Removed a lot of redundant code in output (using iterators instead) - If not interested in seek information, don't calculate a lot of stuff - again, significant speed up. Signed-off-by: Alan D. Brunelle <> Signed-off-by: Jens Axboe <>
Diffstat (limited to 'btt/devmap.c')
1 files changed, 3 insertions, 2 deletions
diff --git a/btt/devmap.c b/btt/devmap.c
index 2227617..2b6366c 100644
--- a/btt/devmap.c
+++ b/btt/devmap.c
@@ -19,12 +19,13 @@
#include <stdio.h>
#include "globals.h"
struct devmap *all_devmaps = NULL;
void dev_map_add(struct devmap *dmp)
- struct devmap *this = zmalloc(sizeof(*this));
+ struct devmap *this = malloc(sizeof(struct devmap));
*this = *dmp;
this->next = all_devmaps;