| /dports/devel/dwarfdump/dwarf-20161124/libdwarf/ |
| H A D | dwarf_tsearch.h | 78 #define dwarf_tdelete _dwarf_tdelete macro
99 void *dwarf_tdelete(const void * /*key*/, void ** /*rootp*/,
|
| H A D | dwarf_tied.c | 395 dwarf_tdelete(entry,tree,tied_compare_function); in delone()
|
| H A D | dwarf_alloc.c | 539 dwarf_tdelete(key,&dbg->de_alloc_tree,simple_compare_function); in dwarf_dealloc()
|
| H A D | dwarf_tsearchhash.c | 538 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| /dports/devel/libdwarf/dwarf-20161124/libdwarf/ |
| H A D | dwarf_tsearch.h | 78 #define dwarf_tdelete _dwarf_tdelete macro
99 void *dwarf_tdelete(const void * /*key*/, void ** /*rootp*/,
|
| H A D | dwarf_tied.c | 395 dwarf_tdelete(entry,tree,tied_compare_function); in delone()
|
| H A D | dwarf_alloc.c | 539 dwarf_tdelete(key,&dbg->de_alloc_tree,simple_compare_function); in dwarf_dealloc()
|
| H A D | dwarf_tsearchhash.c | 538 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| /dports/devel/libdwarf/dwarf-20161124/dwarfdump/ |
| H A D | dwarf_tsearch.h | 83 void *dwarf_tdelete(const void * /*key*/, void ** /*rootp*/,
|
| H A D | dwarf_tsearchbal.c | 884 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| /dports/devel/dwarfdump/dwarf-20161124/dwarfdump/ |
| H A D | dwarf_tsearch.h | 83 void *dwarf_tdelete(const void * /*key*/, void ** /*rootp*/,
|
| H A D | dwarf_tsearchbal.c | 884 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| /dports/devel/dwarfdump/dwarf-20161124/tsearch/ |
| H A D | dwarf_tsearch.h | 99 void *dwarf_tdelete(const void * /*key*/, void ** /*rootp*/,
|
| H A D | tsearch_tester.c | 77 #define dwarf_tdelete(a,b,c) tdelete(a,b,c) macro
588 r = dwarf_tdelete(mt,tree,mt_compare_func); in delrecsbypointer()
692 dwarf_tdelete(mt,tree,mt_compare_func); in deleteonebypointer()
836 void *r2 = dwarf_tdelete((void *)newval,tree,value_compare_func); in deletebyvalue()
|
| H A D | dwarf_tsearchbin.c | 340 dwarf_tdelete(const void *key, void **headin, in dwarf_tdelete() function
|
| H A D | dwarf_tsearchepp.c | 337 dwarf_tdelete(const void *key, void **headin, in dwarf_tdelete() function
|
| H A D | dwarf_tsearchhash.c | 538 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| H A D | dwarf_tsearchred.c | 730 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| H A D | dwarf_tsearchbal.c | 885 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| /dports/devel/libdwarf/dwarf-20161124/tsearch/ |
| H A D | dwarf_tsearch.h | 99 void *dwarf_tdelete(const void * /*key*/, void ** /*rootp*/,
|
| H A D | tsearch_tester.c | 77 #define dwarf_tdelete(a,b,c) tdelete(a,b,c) macro
588 r = dwarf_tdelete(mt,tree,mt_compare_func); in delrecsbypointer()
692 dwarf_tdelete(mt,tree,mt_compare_func); in deleteonebypointer()
836 void *r2 = dwarf_tdelete((void *)newval,tree,value_compare_func); in deletebyvalue()
|
| H A D | dwarf_tsearchbin.c | 340 dwarf_tdelete(const void *key, void **headin, in dwarf_tdelete() function
|
| H A D | dwarf_tsearchepp.c | 337 dwarf_tdelete(const void *key, void **headin, in dwarf_tdelete() function
|
| H A D | dwarf_tsearchhash.c | 538 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|
| H A D | dwarf_tsearchred.c | 730 dwarf_tdelete(const void *key, void **rootp, in dwarf_tdelete() function
|