hh 27 ompi/mca/topo/treematch/treematch/tm_malloc.c UT_hash_handle hh; /* makes this structure hashable */ hh 87 ompi/mca/topo/treematch/treematch/tm_malloc.c for(s=size_hash; s != NULL; s=s->hh.next) { hh 84 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FIND(hh,head,keyptr,keylen,out) \ hh 89 ompi/mca/topo/treematch/treematch/uthash.h HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ hh 90 ompi/mca/topo/treematch/treematch/uthash.h if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \ hh 91 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ hh 130 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_MAKE_TABLE(hh,head) \ hh 132 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ hh 134 ompi/mca/topo/treematch/treematch/uthash.h if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ hh 135 ompi/mca/topo/treematch/treematch/uthash.h memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \ hh 136 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = &((head)->hh); \ hh 137 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_buckets = HASH_INITIAL_NUM_BUCKETS; \ hh 138 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2; \ hh 139 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \ hh 140 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ hh 142 ompi/mca/topo/treematch/treematch/uthash.h if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \ hh 143 ompi/mca/topo/treematch/treematch/uthash.h memset((head)->hh.tbl->buckets, 0, \ hh 145 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_MAKE((head)->hh.tbl); \ hh 146 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->signature = HASH_SIGNATURE; \ hh 149 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ hh 150 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD_KEYPTR(hh,head,&((add)->fieldname),keylen_in,add) hh 152 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ hh 155 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.next = NULL; \ hh 156 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.key = (char*)keyptr; \ hh 157 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.keylen = keylen_in; \ hh 160 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.prev = NULL; \ hh 161 ompi/mca/topo/treematch/treematch/uthash.h HASH_MAKE_TABLE(hh,head); \ hh 163 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail->next = (add); \ hh 164 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ hh 165 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = &((add)->hh); \ hh 167 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items++; \ hh 168 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.tbl = (head)->hh.tbl; \ hh 169 ompi/mca/topo/treematch/treematch/uthash.h HASH_FCN(keyptr,keylen_in, (head)->hh.tbl->num_buckets, \ hh 170 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.hashv, _ha_bkt); \ hh 171 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \ hh 172 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \ hh 173 ompi/mca/topo/treematch/treematch/uthash.h HASH_EMIT_KEY(hh,head,keyptr,keylen_in); \ hh 174 ompi/mca/topo/treematch/treematch/uthash.h HASH_FSCK(hh,head); \ hh 194 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_DELETE(hh,head,delptr) \ hh 198 ompi/mca/topo/treematch/treematch/uthash.h if ( ((delptr)->hh.prev == NULL) && ((delptr)->hh.next == NULL) ) { \ hh 199 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl->buckets, \ hh 200 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ hh 201 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ hh 202 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ hh 205 ompi/mca/topo/treematch/treematch/uthash.h _hd_hh_del = &((delptr)->hh); \ hh 206 ompi/mca/topo/treematch/treematch/uthash.h if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ hh 207 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = \ hh 208 ompi/mca/topo/treematch/treematch/uthash.h (UT_hash_handle*)((char*)((delptr)->hh.prev) + \ hh 209 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho); \ hh 211 ompi/mca/topo/treematch/treematch/uthash.h if ((delptr)->hh.prev) { \ hh 212 ompi/mca/topo/treematch/treematch/uthash.h ((UT_hash_handle*)((char*)((delptr)->hh.prev) + \ hh 213 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho))->next = (delptr)->hh.next; \ hh 215 ompi/mca/topo/treematch/treematch/uthash.h DECLTYPE_ASSIGN(head,(delptr)->hh.next); \ hh 219 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho))->prev = \ hh 222 ompi/mca/topo/treematch/treematch/uthash.h HASH_TO_BKT( _hd_hh_del->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ hh 223 ompi/mca/topo/treematch/treematch/uthash.h HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \ hh 224 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items--; \ hh 226 ompi/mca/topo/treematch/treematch/uthash.h HASH_FSCK(hh,head); \ hh 232 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND(hh,head,findstr,strlen(findstr),out) hh 234 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD(hh,head,strfield,strlen(add->strfield),add) hh 236 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND(hh,head,findint,sizeof(int),out) hh 238 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD(hh,head,intfield,sizeof(int),add) hh 240 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND(hh,head,findptr,sizeof(void *),out) hh 242 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD(hh,head,ptrfield,sizeof(void *),add) hh 244 ompi/mca/topo/treematch/treematch/uthash.h HASH_DELETE(hh,head,delptr) hh 251 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FSCK(hh,head) \ hh 259 ompi/mca/topo/treematch/treematch/uthash.h for( _bkt_i = 0; _bkt_i < (head)->hh.tbl->num_buckets; _bkt_i++) { \ hh 261 ompi/mca/topo/treematch/treematch/uthash.h _thh = (head)->hh.tbl->buckets[_bkt_i].hh_head; \ hh 273 ompi/mca/topo/treematch/treematch/uthash.h if ((head)->hh.tbl->buckets[_bkt_i].count != _bkt_count) { \ hh 275 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->buckets[_bkt_i].count, _bkt_count); \ hh 278 ompi/mca/topo/treematch/treematch/uthash.h if (_count != (head)->hh.tbl->num_items) { \ hh 280 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items, _count ); \ hh 285 ompi/mca/topo/treematch/treematch/uthash.h _thh = &(head)->hh; \ hh 292 ompi/mca/topo/treematch/treematch/uthash.h _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \ hh 294 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho) : NULL ); \ hh 296 ompi/mca/topo/treematch/treematch/uthash.h if (_count != (head)->hh.tbl->num_items) { \ hh 298 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items, _count ); \ hh 303 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FSCK(hh,head) hh 310 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) \ hh 317 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) hh 568 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,out) \ hh 573 ompi/mca/topo/treematch/treematch/uthash.h if (out->hh.keylen == keylen_in) { \ hh 574 ompi/mca/topo/treematch/treematch/uthash.h if ((HASH_KEYCMP(out->hh.key,keyptr,keylen_in)) == 0) break; \ hh 576 ompi/mca/topo/treematch/treematch/uthash.h if (out->hh.hh_next) DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,out->hh.hh_next)); \ hh 596 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_DEL_IN_BKT(hh,head,hh_del) \ hh 689 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) hh 690 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_SRT(hh,head,cmpfcn) \ hh 698 ompi/mca/topo/treematch/treematch/uthash.h _hs_list = &((head)->hh); \ hh 712 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 721 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 727 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 730 ompi/mca/topo/treematch/treematch/uthash.h cmpfcn(DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_p)), \ hh 731 ompi/mca/topo/treematch/treematch/uthash.h DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_q))) \ hh 736 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 742 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 747 ompi/mca/topo/treematch/treematch/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_e) : NULL); \ hh 752 ompi/mca/topo/treematch/treematch/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_tail) : NULL); \ hh 760 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = _hs_tail; \ hh 761 ompi/mca/topo/treematch/treematch/uthash.h DECLTYPE_ASSIGN(head,ELMT_FROM_HH((head)->hh.tbl, _hs_list)); \ hh 765 ompi/mca/topo/treematch/treematch/uthash.h HASH_FSCK(hh,head); \ hh 812 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_CLEAR(hh,head) \ hh 815 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl->buckets, \ hh 816 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket)); \ hh 817 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ hh 818 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ hh 824 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ITER(hh,head,el,tmp) \ hh 825 ompi/mca/topo/treematch/treematch/uthash.h for((el)=(head), (*(char**)(&(tmp)))=(char*)((head)?(head)->hh.next:NULL); \ hh 826 ompi/mca/topo/treematch/treematch/uthash.h el; (el)=(tmp),(*(char**)(&(tmp)))=(char*)((tmp)?(tmp)->hh.next:NULL)) hh 828 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ITER(hh,head,el,tmp) \ hh 829 ompi/mca/topo/treematch/treematch/uthash.h for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)->hh.next:NULL); \ hh 830 ompi/mca/topo/treematch/treematch/uthash.h el; (el)=(tmp),(tmp)=DECLTYPE(el)((tmp)?(tmp)->hh.next:NULL)) hh 834 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_COUNT(head) HASH_CNT(hh,head) hh 835 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_CNT(hh,head) ((head)?((head)->hh.tbl->num_items):0) hh 106 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FIND(hh,head,keyptr,keylen,out) \ hh 111 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ hh 112 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv) != 0) { \ hh 113 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ hh 153 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_MAKE_TABLE(hh,head) \ hh 155 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ hh 157 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ hh 158 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \ hh 159 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = &((head)->hh); \ hh 160 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_buckets = HASH_INITIAL_NUM_BUCKETS; \ hh 161 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2; \ hh 162 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \ hh 163 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ hh 165 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \ hh 166 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h memset((head)->hh.tbl->buckets, 0, \ hh 168 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_MAKE((head)->hh.tbl); \ hh 169 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->signature = HASH_SIGNATURE; \ hh 172 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ hh 173 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD_KEYPTR(hh,head,&((add)->fieldname),keylen_in,add) hh 175 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ hh 178 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,&((add)->fieldname),keylen_in,replaced); \ hh 180 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_DELETE(hh,head,replaced); \ hh 182 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,fieldname,keylen_in,add); \ hh 185 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ hh 188 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.next = NULL; \ hh 189 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.key = (char*)(keyptr); \ hh 190 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.keylen = (unsigned)(keylen_in); \ hh 193 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.prev = NULL; \ hh 194 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_MAKE_TABLE(hh,head); \ hh 196 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail->next = (add); \ hh 197 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ hh 198 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = &((add)->hh); \ hh 200 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items++; \ hh 201 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.tbl = (head)->hh.tbl; \ hh 202 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FCN(keyptr,keylen_in, (head)->hh.tbl->num_buckets, \ hh 203 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.hashv, _ha_bkt); \ hh 204 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \ hh 205 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \ hh 206 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_EMIT_KEY(hh,head,keyptr,keylen_in); \ hh 207 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FSCK(hh,head); \ hh 227 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_DELETE(hh,head,delptr) \ hh 230 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ( ((delptr)->hh.prev == NULL) && ((delptr)->hh.next == NULL) ) { \ hh 231 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl->buckets, \ hh 232 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ hh 233 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ hh 234 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ hh 238 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _hd_hh_del = &((delptr)->hh); \ hh 239 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ hh 240 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = \ hh 241 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (UT_hash_handle*)((ptrdiff_t)((delptr)->hh.prev) + \ hh 242 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho); \ hh 244 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((delptr)->hh.prev != NULL) { \ hh 245 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ((UT_hash_handle*)((ptrdiff_t)((delptr)->hh.prev) + \ hh 246 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho))->next = (delptr)->hh.next; \ hh 248 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h DECLTYPE_ASSIGN(head,(delptr)->hh.next); \ hh 252 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho))->prev = \ hh 255 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_TO_BKT( _hd_hh_del->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ hh 256 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \ hh 257 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items--; \ hh 259 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FSCK(hh,head); \ hh 265 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,findstr,(unsigned)strlen(findstr),out) hh 267 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,strfield[0],(unsigned int)strlen(add->strfield),add) hh 269 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_REPLACE(hh,head,strfield[0],(unsigned)strlen(add->strfield),add,replaced) hh 271 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,findint,sizeof(int),out) hh 273 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,intfield,sizeof(int),add) hh 275 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_REPLACE(hh,head,intfield,sizeof(int),add,replaced) hh 277 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,findptr,sizeof(void *),out) hh 279 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,ptrfield,sizeof(void *),add) hh 281 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_REPLACE(hh,head,ptrfield,sizeof(void *),add,replaced) hh 283 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_DELETE(hh,head,delptr) hh 290 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FSCK(hh,head) \ hh 298 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for( _bkt_i = 0; _bkt_i < (head)->hh.tbl->num_buckets; _bkt_i++) { \ hh 300 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _thh = (head)->hh.tbl->buckets[_bkt_i].hh_head; \ hh 312 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((head)->hh.tbl->buckets[_bkt_i].count != _bkt_count) { \ hh 314 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->buckets[_bkt_i].count, _bkt_count); \ hh 317 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (_count != (head)->hh.tbl->num_items) { \ hh 319 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items, _count ); \ hh 324 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _thh = &(head)->hh; \ hh 331 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \ hh 333 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho) : NULL ); \ hh 335 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (_count != (head)->hh.tbl->num_items) { \ hh 337 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items, _count ); \ hh 342 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FSCK(hh,head) hh 349 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) \ hh 356 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) hh 614 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,out) \ hh 619 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((out)->hh.keylen == (keylen_in)) { \ hh 620 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((HASH_KEYCMP((out)->hh.key,keyptr,keylen_in)) == 0) { break; } \ hh 622 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((out)->hh.hh_next != NULL) { DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,(out)->hh.hh_next)); } \ hh 642 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_DEL_IN_BKT(hh,head,hh_del) \ hh 735 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) hh 736 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_SRT(hh,head,cmpfcn) \ hh 744 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _hs_list = &((head)->hh); \ hh 758 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 767 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 774 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 778 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h cmpfcn(DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_p)), \ hh 779 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_q))) \ hh 785 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 792 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ hh 797 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_e) : NULL); \ hh 803 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_tail) : NULL); \ hh 814 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = _hs_tail; \ hh 815 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h DECLTYPE_ASSIGN(head,ELMT_FROM_HH((head)->hh.tbl, _hs_list)); \ hh 819 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FSCK(hh,head); \ hh 866 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_CLEAR(hh,head) \ hh 869 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl->buckets, \ hh 870 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket)); \ hh 871 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ hh 872 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ hh 877 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_OVERHEAD(hh,head) \ hh 879 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (size_t)(((head)->hh.tbl->num_items * sizeof(UT_hash_handle)) + \ hh 880 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ((head)->hh.tbl->num_buckets * sizeof(UT_hash_bucket)) + \ hh 885 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ITER(hh,head,el,tmp) \ hh 886 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for(((el)=(head)), ((*(char**)(&(tmp)))=(char*)((head!=NULL)?(head)->hh.next:NULL)); \ hh 887 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (el) != NULL; ((el)=(tmp)), ((*(char**)(&(tmp)))=(char*)((tmp!=NULL)?(tmp)->hh.next:NULL))) hh 889 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ITER(hh,head,el,tmp) \ hh 890 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for(((el)=(head)), ((tmp)=DECLTYPE(el)((head!=NULL)?(head)->hh.next:NULL)); \ hh 891 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (el) != NULL; ((el)=(tmp)), ((tmp)=DECLTYPE(el)((tmp!=NULL)?(tmp)->hh.next:NULL))) hh 895 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_COUNT(head) HASH_CNT(hh,head) hh 896 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_CNT(hh,head) ((head != NULL)?((head)->hh.tbl->num_items):0U) hh 155 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h UT_hash_handle hh; /* makes this structure hashable with physical_id */ hh 205 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h UT_hash_handle hh; /* makes this structure hashable */ hh 235 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h UT_hash_handle hh; /* makes this structure hashable */ hh 259 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h UT_hash_handle hh; /* makes this structure hashable */ hh 275 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h UT_hash_handle hh; /* makes this structure hashable */ hh 353 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h HASH_ITER(hh, topology->nodes, node, _tmp) hh 397 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h HASH_ITER(hh, node->edges, edge, _tmp) hh 400 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h HASH_ITER(hh, node->paths, path, _tmp) hh 409 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h HASH_ITER(hh, node->paths, path, _tmp)