Home
last modified time | relevance | path

Searched refs:hash_iter (Results 1 – 8 of 8) sorted by relevance

/titanic_41/usr/src/tools/ctf/cvt/
H A Diidesc.c187 hash_iter(ii, iidesc_count_type, (void *)II_GFUN), in iidesc_stats()
188 hash_iter(ii, iidesc_count_type, (void *)II_SFUN), in iidesc_stats()
189 hash_iter(ii, iidesc_count_type, (void *)II_GVAR), in iidesc_stats()
190 hash_iter(ii, iidesc_count_type, (void *)II_SVAR), in iidesc_stats()
191 hash_iter(ii, iidesc_count_type, (void *)II_TYPE), in iidesc_stats()
192 hash_iter(ii, iidesc_count_type, (void *)II_SOU)); in iidesc_stats()
H A Dalist.c152 return (hash_iter(alist->al_elements, (int (*)())alist_iter_cb, &aid)); in alist_iter()
204 return (hash_iter(alist->al_elements, alist_dump_cb, (void *)printer)); in alist_dump()
H A Dhash.h48 int hash_iter(hash_t *, int (*)(void *, void *), void *);
H A Dcompare.c86 (void) hash_iter(difftd->td_iihash, (int (*)())iidesc_dump, in main()
H A Dhash.c123 (void) hash_iter(from, hash_add_cb, to); in hash_merge()
211 hash_iter(hash_t *hash, int (*fun)(void *, void *), void *private) in hash_iter() function
H A Dmerge.c471 } else if (debug_level > 1 && hash_iter(mcd->md_parent->td_idhash, in map_td_tree_post()
513 } else if (debug_level > 1 && hash_iter(mcd->md_tdtba, in map_td_tree_self_post()
1050 (void) hash_iter(src, merge_type_cb, mcd); in merge_types()
1052 tdrc = hash_iter(mcd->md_tdtba, add_tdtba_cb, (void *)mcd); in merge_types()
H A Dtraverse.c225 return (hash_iter(iihash, (int (*)())iitraverse_td, &tdtd)); in iitraverse_hash()
H A Doutput.c137 (void) hash_iter(iiburst->iib_td->td_iihash, burst_iitypes, iiburst); in iiburst_types()