1 (* hivex OCaml bindings
2 * Copyright (C) 2009-2010 Red Hat Inc.
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
19 (* Fold over the large hive. *)
23 let (//) = Filename.concat
25 (* This is a generic function to fold over hives.
26 * fn : 'a -> node -> 'a is called for each node
27 * fv : 'a -> node -> value array -> 'a is called for the values at each node
29 let hive_fold h fn fv a root =
32 let a = fv a node (Hivex.node_values h node) in
33 Array.fold_left fold a (Hivex.node_children h node)
38 let h = Hivex.open_file ("../images/large") [] in
40 (* Count the number of nodes and values in the hive. *)
41 let count_node (nodes, values) _ = (nodes+1, values) in
42 let count_values (nodes, values) _ vs = (nodes, values + Array.length vs) in
43 let root = Hivex.root h in
44 let (nodes, values) = hive_fold h count_node count_values (0, 0) root in
45 printf "large test hive contains %d nodes and %d values\n%!" nodes values;
49 (* Gc.compact is a good way to ensure we don't have
50 * heap corruption or double-freeing.