Cross Reference: /illumos-gate/usr/src/lib/libdtrace/common/dt

Lines Matching defs:hash
442 	dt_ahash_t *hash = &agp->dtat_hash;
472 	if (hash->dtah_hash == NULL) {
475 		hash->dtah_size = DTRACE_AHASHSIZE;
476 		size = hash->dtah_size * sizeof (dt_ahashent_t *);
478 		if ((hash->dtah_hash = malloc(size)) == NULL)
481 		bzero(hash->dtah_hash, size);
542 		ndx = hashval % hash->dtah_size;
544 		for (h = hash->dtah_hash[ndx]; h != NULL; h = h->dtahe_next) {
681 		if (hash->dtah_hash[ndx] != NULL)
682 			hash->dtah_hash[ndx]->dtahe_prev = h;
684 		h->dtahe_next = hash->dtah_hash[ndx];
685 		hash->dtah_hash[ndx] = h;
687 		if (hash->dtah_all != NULL)
688 			hash->dtah_all->dtahe_prevall = h;
690 		h->dtahe_nextall = hash->dtah_all;
691 		hash->dtah_all = h;
1195 		 * First, remove this hash entry from its hash chain.
1200 			dt_ahash_t *hash = &agp->dtat_hash;
1201 			size_t ndx = h->dtahe_hashval % hash->dtah_size;
1203 			assert(hash->dtah_hash[ndx] == h);
1204 			hash->dtah_hash[ndx] = h->dtahe_next;
1211 		 * Now remove it from the list of all hash entries.
1216 			dt_ahash_t *hash = &agp->dtat_hash;
1218 			assert(hash->dtah_all == h);
1219 			hash->dtah_all = h->dtahe_nextall;
1282 	dt_ahash_t *hash = &dtp->dt_aggregate.dtat_hash;
1284 	for (h = hash->dtah_all; h != NULL; h = next) {
1286 		 * dt_aggwalk_rval() can potentially remove the current hash
1287 		 * entry; we need to load the next hash entry before calling
1306 	dt_ahash_t *hash = &agp->dtat_hash;
1318 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
1336 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
1394 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
1417 	dt_ahash_t *hash = &agp->dtat_hash;
1419 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
1438 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
1507 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
1531 	dt_ahash_t *hash = &agp->dtat_hash;
1551 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall)
1559 	for (h = hash->dtah_all, i = 0; h != NULL; h = h->dtahe_nextall)
1676 	dt_ahash_t *hash = &agp->dtat_hash;
1759 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
1961 	for (h = hash->dtah_all, i = 0; h != NULL; h = h->dtahe_nextall) {
2137 	dt_ahash_t *hash = &agp->dtat_hash;
2144 	for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) {
2163 	dt_ahash_t *hash = &agp->dtat_hash;
2168 	if (hash->dtah_hash == NULL) {
2169 		assert(hash->dtah_all == NULL);
2171 		free(hash->dtah_hash);
2173 		for (h = hash->dtah_all; h != NULL; h = next) {
2188 		hash->dtah_hash = NULL;
2189 		hash->dtah_all = NULL;
2190 		hash->dtah_size = 0;