| /dports/devel/dwarfdump/dwarf-20161124/libdwarf/ |
| H A D | dwarf_tsearch.h | 80 #define dwarf_tdestroy _dwarf_tdestroy macro
109 void dwarf_tdestroy(void * /*root*/,
|
| H A D | pro_alloc.c | 187 dwarf_tdestroy(dbg->de_debug_str_hashtab, in _dwarf_p_dealloc_all()
|
| H A D | dwarf_alloc.c | 682 dwarf_tdestroy(dbg->de_alloc_tree,tdestroy_free_node); in _dwarf_free_all_of_one_debug()
685 dwarf_tdestroy(dbg->de_tied_data.td_tied_search, in _dwarf_free_all_of_one_debug()
|
| /dports/devel/libdwarf/dwarf-20161124/libdwarf/ |
| H A D | dwarf_tsearch.h | 80 #define dwarf_tdestroy _dwarf_tdestroy macro
109 void dwarf_tdestroy(void * /*root*/,
|
| H A D | pro_alloc.c | 187 dwarf_tdestroy(dbg->de_debug_str_hashtab, in _dwarf_p_dealloc_all()
|
| H A D | dwarf_alloc.c | 682 dwarf_tdestroy(dbg->de_alloc_tree,tdestroy_free_node); in _dwarf_free_all_of_one_debug()
685 dwarf_tdestroy(dbg->de_tied_data.td_tied_search, in _dwarf_free_all_of_one_debug()
|
| /dports/devel/libdwarf/dwarf-20161124/tsearch/ |
| H A D | tsearch_tester.c | 79 #define dwarf_tdestroy(a,b) tdestroy(a,b) macro
756 dwarf_tdestroy(treesq1,mt_free_func); in applybypointer()
908 dwarf_tdestroy(treesq1,value_node_free); in applybyvalue()
930 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
945 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
956 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
972 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
|
| H A D | dwarf_tsearch.h | 109 void dwarf_tdestroy(void * /*root*/,
|
| H A D | dwarf_tsearchbin.c | 525 dwarf_tdestroy(void *headin, void (*free_node)(void *nodep)) in dwarf_tdestroy() function
|
| H A D | dwarf_tsearchepp.c | 551 dwarf_tdestroy(void *headin, void (*free_node)(void *nodep)) in dwarf_tdestroy() function
|
| H A D | dwarf_tsearchhash.c | 662 dwarf_tdestroy(void *rootp, void (*free_node)(void *nodep)) in dwarf_tdestroy() function
|
| /dports/devel/dwarfdump/dwarf-20161124/tsearch/ |
| H A D | tsearch_tester.c | 79 #define dwarf_tdestroy(a,b) tdestroy(a,b) macro
756 dwarf_tdestroy(treesq1,mt_free_func); in applybypointer()
908 dwarf_tdestroy(treesq1,value_node_free); in applybyvalue()
930 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
945 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
956 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
972 dwarf_tdestroy(tree1,mt_free_func); in standard_tests()
|
| H A D | dwarf_tsearch.h | 109 void dwarf_tdestroy(void * /*root*/,
|
| H A D | dwarf_tsearchbin.c | 525 dwarf_tdestroy(void *headin, void (*free_node)(void *nodep)) in dwarf_tdestroy() function
|
| H A D | dwarf_tsearchepp.c | 551 dwarf_tdestroy(void *headin, void (*free_node)(void *nodep)) in dwarf_tdestroy() function
|
| /dports/devel/libdwarf/dwarf-20161124/dwarfdump/ |
| H A D | dwarf_tsearch.h | 93 void dwarf_tdestroy(void * /*root*/,
|
| H A D | makename.c | 74 dwarf_tdestroy(makename_data,value_node_free); in makename_destructor()
|
| H A D | addrmap.c | 122 dwarf_tdestroy(map,addr_map_free_func); in addr_map_destroy()
|
| H A D | helpertree.c | 82 dwarf_tdestroy(map,helpertree_map_free_func); in helpertree_map_destroy()
|
| H A D | macrocheck.c | 140 dwarf_tdestroy(map,macrocheck_map_free_func); in macrocheck_map_destroy()
|
| /dports/devel/dwarfdump/dwarf-20161124/dwarfdump/ |
| H A D | dwarf_tsearch.h | 93 void dwarf_tdestroy(void * /*root*/,
|
| H A D | makename.c | 74 dwarf_tdestroy(makename_data,value_node_free); in makename_destructor()
|
| H A D | addrmap.c | 122 dwarf_tdestroy(map,addr_map_free_func); in addr_map_destroy()
|
| H A D | helpertree.c | 82 dwarf_tdestroy(map,helpertree_map_free_func); in helpertree_map_destroy()
|
| H A D | macrocheck.c | 140 dwarf_tdestroy(map,macrocheck_map_free_func); in macrocheck_map_destroy()
|