(* *********************************************************************) (* *) (* The Compcert verified compiler *) (* *) (* Bernhard Schommer, AbsInt Angewandte Informatik GmbH *) (* *) (* AbsInt Angewandte Informatik GmbH. All rights reserved. This file *) (* is distributed under the terms of the INRIA Non-Commercial *) (* License Agreement. *) (* *) (* *********************************************************************) (* Utility functions for the dwarf debuging type *) open DwarfTypes let id = ref 0 let next_id () = let nid = !id in incr id; nid let reset_id () = id := 0 (* Hashtable to from type name to entry id *) let type_table: (string, int) Hashtbl.t = Hashtbl.create 7 (* Clear the type map *) let reset_type_table () = Hashtbl.clear type_table (* Generate a new entry from a given tag *) let new_entry tag = let id = next_id () in { tag = tag; children = []; id = id; } (* Add an entry as child to another entry *) let add_children entry child = {entry with children = child::entry.children;} let list_iter_with_next f list = let rec aux = (function | [] -> () | [a] -> f None a | a::b::rest -> f (Some b.id) a; aux (b::rest)) in aux list (* Iter over the tree and pass the sibling id *) let entry_iter_sib f entry = let rec aux sib entry = f sib entry; list_iter_with_next aux entry.children in aux None entry (* Fold over the tree in prefix order *) let rec entry_fold f acc entry = let acc = f acc entry.tag in List.fold_left (entry_fold f) acc entry.children (* Attribute form encoding *) let dw_form_addr = 0x01 let dw_form_block2 = 0x03 let dw_form_block4 = 0x04 let dw_form_data2 = 0x05 let dw_form_data4 = 0x06 let dw_form_data8 = 0x07 let dw_form_string = 0x08 let dw_form_block = 0x09 let dw_form_block1 = 0x0a let dw_form_data1 = 0x0b let dw_form_flag = 0x0c let dw_form_sdata = 0x0d let dw_form_strp = 0x0e let dw_form_udata = 0x0f let dw_form_ref_addr = 0x10 let dw_form_ref1 = 0x11 let dw_form_ref2 = 0x12 let dw_form_ref4 = 0x13 let dw_form_ref8 = 0x14 let dw_ref_udata = 0x15 let dw_ref_indirect = 0x16