142     const void * keyptr;  member
256     v = keyprint(t->keyptr);  in print_entry()
263         (Dwarf_Unsigned)(uintptr_t)t->keyptr,  in print_entry()
343     e->keyptr = key;  in allocate_ts_entry()
397             if(p->keyptr) {  in resize_table()
398                 tsearch_inner(p->keyptr,  in resize_table()
410                 tsearch_inner(n->keyptr,  in resize_table()
476         s->keyptr = (const void *)key;  in tsearch_inner()
481     kc = compar(key,s->keyptr);  in tsearch_inner()
487         return (void *)&(s->keyptr);  in tsearch_inner()
491         kc = compar(key,c->keyptr);  in tsearch_inner()
497             return (void *)&(c->keyptr);  in tsearch_inner()
535     return (void *)&(r->keyptr);  in dwarf_tsearch()
563     return (void *)(&(r->keyptr));  in dwarf_tfind()
595             return (void *)&(parentp->keyptr);  in dwarf_tdelete()
605             return (void *)&(found->keyptr);  in dwarf_tdelete()
615             found->keyptr = 0;  in dwarf_tdelete()
634         if(p->keyptr) {  in dwarf_twalk_inner()
635             action((void *)(&(p->keyptr)),dwarf_leaf,level);  in dwarf_twalk_inner()
638             action((void *)(&(n->keyptr)),dwarf_leaf,level);  in dwarf_twalk_inner()
669         if(p->keyptr && p->entryused) {  in dwarf_tdestroy_inner()
671                 free_node((void *)(p->keyptr));  in dwarf_tdestroy_inner()
678                 free_node((void *)(n->keyptr));  in dwarf_tdestroy_inner()