head 535 ompi/mca/coll/base/coll_base_topo.c int i, maxchainlen, mark, head, len, rank, size, srank /* shifted rank */; head 627 ompi/mca/coll/base/coll_base_topo.c head = 1+column*maxchainlen; head 631 ompi/mca/coll/base/coll_base_topo.c head = mark*maxchainlen+1+(column-mark)*(maxchainlen-1); head 635 ompi/mca/coll/base/coll_base_topo.c if( srank == head ) { head 640 ompi/mca/coll/base/coll_base_topo.c if( srank == (head + len - 1) ) { head 37 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h custom_match_prq_node* head; head 49 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h custom_match_prq_node* elem = list->head; head 77 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = elem->next; head 103 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h custom_match_prq_node* elem = list->head; head 131 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h custom_match_prq_node* elem = list->head; head 160 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = elem->next; head 238 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = elem; head 267 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = 0; head 280 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h while(list->head) head 282 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h elem = list->head; head 283 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = list->head->next; head 301 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h for(elem = list->head; elem; elem = elem->next) head 321 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h for(elem = list->head; elem; elem = elem->next) head 363 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h custom_match_umq_node* head; head 381 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h custom_match_umq_node* elem = list->head; head 443 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = elem->next; head 499 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = elem; head 520 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = 0; head 533 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h while(list->head) head 535 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h elem = list->head; head 536 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h list->head = list->head->next; head 561 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h for(elem = list->head; elem; elem = elem->next) head 33 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h custom_match_prq_node* head; head 46 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h custom_match_prq_node* elem = list->head; head 73 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = elem->next; head 99 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h custom_match_prq_node* elem = list->head; head 135 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h custom_match_prq_node* elem = list->head; head 177 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = elem->next; head 247 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = elem; head 274 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = 0; head 287 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h while(list->head) head 289 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h elem = list->head; head 290 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = list->head->next; head 308 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h for(elem = list->head; elem; elem = elem->next) head 328 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h for(elem = list->head; elem; elem = elem->next) head 367 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h custom_match_umq_node* head; head 385 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h custom_match_umq_node* elem = list->head; head 450 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = elem->next; head 505 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = elem; head 525 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = 0; head 538 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h while(list->head) head 540 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h elem = list->head; head 541 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h list->head = list->head->next; head 566 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h for(elem = list->head; elem; elem = elem->next) head 33 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h custom_match_prq_node* head; head 46 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h custom_match_prq_node* elem = list->head; head 73 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = elem->next; head 99 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h custom_match_prq_node* elem = list->head; head 135 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h custom_match_prq_node* elem = list->head; head 171 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = elem->next; head 238 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = elem; head 266 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = 0; head 279 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h while(list->head) head 281 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h elem = list->head; head 282 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = list->head->next; head 300 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h for(elem = list->head; elem; elem = elem->next) head 320 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h for(elem = list->head; elem; elem = elem->next) head 359 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h custom_match_umq_node* head; head 375 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h custom_match_umq_node* elem = list->head; head 441 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = elem->next; head 500 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = elem; head 520 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = 0; head 533 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h while(list->head) head 535 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h elem = list->head; head 536 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h list->head = list->head->next; head 561 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h for(elem = list->head; elem; elem = elem->next) head 33 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h custom_match_prq_node* head; head 45 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h custom_match_prq_node* elem = list->head; head 71 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = elem->next; head 97 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h custom_match_prq_node* elem = list->head; head 134 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h custom_match_prq_node* elem = list->head; head 171 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = elem->next; head 249 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = elem; head 276 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = 0; head 289 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h while(list->head) head 291 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h elem = list->head; head 292 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = list->head->next; head 310 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h for(elem = list->head; elem; elem = elem->next) head 329 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h for(elem = list->head; elem; elem = elem->next) head 368 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h custom_match_umq_node* head; head 384 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h custom_match_umq_node* elem = list->head; head 459 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = elem->next; head 518 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = elem; head 538 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = 0; head 551 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h while(list->head) head 553 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h elem = list->head; head 554 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h list->head = list->head->next; head 579 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h for(elem = list->head; elem; elem = elem->next) head 32 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h custom_match_prq_node* head; head 44 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h custom_match_prq_node* elem = list->head; head 62 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = elem->next; head 84 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h custom_match_prq_node* elem = list->head; head 106 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h custom_match_prq_node* elem = list->head; head 127 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = elem->next; head 197 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = elem; head 224 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = 0; head 239 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h while(list->head) head 241 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h elem = list->head; head 242 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = list->head->next; head 265 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h for(elem = list->head; elem; elem = elem->next) head 282 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h for(elem = list->head; elem; elem = elem->next) head 318 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h custom_match_umq_node* head; head 333 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h custom_match_umq_node* elem = list->head; head 386 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = elem->next; head 434 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = elem; head 453 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = 0; head 468 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h while(list->head) head 470 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h elem = list->head; head 471 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h list->head = list->head->next; head 501 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h for(elem = list->head; elem; elem = elem->next) head 35 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h custom_match_prq_node* head; head 47 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h custom_match_prq_node* elem = list->head; head 75 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = elem->next; head 101 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h custom_match_prq_node* elem = list->head; head 136 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h custom_match_prq_node* elem = list->head; head 175 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = elem->next; head 256 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = elem; head 285 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = 0; head 298 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h while(list->head) head 300 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h elem = list->head; head 301 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = list->head->next; head 319 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h for(elem = list->head; elem; elem = elem->next) head 339 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h for(elem = list->head; elem; elem = elem->next) head 379 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h custom_match_umq_node* head; head 395 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h custom_match_umq_node* elem = list->head; head 462 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = elem->next; head 513 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = elem; head 534 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = 0; head 547 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h while(list->head) head 549 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h elem = list->head; head 550 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h list->head = list->head->next; head 572 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h for (custom_match_umq_node *elem = list->head; elem; elem = elem->next) { head 84 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FIND(hh,head,keyptr,keylen,out) \ head 88 ompi/mca/topo/treematch/treematch/uthash.h if (head) { \ head 89 ompi/mca/topo/treematch/treematch/uthash.h HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ head 90 ompi/mca/topo/treematch/treematch/uthash.h if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \ head 91 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ head 130 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_MAKE_TABLE(hh,head) \ head 132 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ head 134 ompi/mca/topo/treematch/treematch/uthash.h if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ head 135 ompi/mca/topo/treematch/treematch/uthash.h memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \ head 136 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = &((head)->hh); \ head 137 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_buckets = HASH_INITIAL_NUM_BUCKETS; \ head 138 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2; \ head 139 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \ head 140 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ head 142 ompi/mca/topo/treematch/treematch/uthash.h if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \ head 143 ompi/mca/topo/treematch/treematch/uthash.h memset((head)->hh.tbl->buckets, 0, \ head 145 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_MAKE((head)->hh.tbl); \ head 146 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->signature = HASH_SIGNATURE; \ head 149 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ head 150 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD_KEYPTR(hh,head,&((add)->fieldname),keylen_in,add) head 152 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ head 158 ompi/mca/topo/treematch/treematch/uthash.h if (!(head)) { \ head 159 ompi/mca/topo/treematch/treematch/uthash.h head = (add); \ head 160 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.prev = NULL; \ head 161 ompi/mca/topo/treematch/treematch/uthash.h HASH_MAKE_TABLE(hh,head); \ head 163 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail->next = (add); \ head 164 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ head 165 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = &((add)->hh); \ head 167 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items++; \ head 168 ompi/mca/topo/treematch/treematch/uthash.h (add)->hh.tbl = (head)->hh.tbl; \ head 169 ompi/mca/topo/treematch/treematch/uthash.h HASH_FCN(keyptr,keylen_in, (head)->hh.tbl->num_buckets, \ head 171 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \ head 172 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \ head 173 ompi/mca/topo/treematch/treematch/uthash.h HASH_EMIT_KEY(hh,head,keyptr,keylen_in); \ head 174 ompi/mca/topo/treematch/treematch/uthash.h HASH_FSCK(hh,head); \ head 194 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_DELETE(hh,head,delptr) \ head 199 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl->buckets, \ head 200 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ head 201 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ head 202 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ head 203 ompi/mca/topo/treematch/treematch/uthash.h head = NULL; \ head 206 ompi/mca/topo/treematch/treematch/uthash.h if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ head 207 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = \ head 209 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho); \ head 213 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho))->next = (delptr)->hh.next; \ head 215 ompi/mca/topo/treematch/treematch/uthash.h DECLTYPE_ASSIGN(head,(delptr)->hh.next); \ head 219 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho))->prev = \ head 222 ompi/mca/topo/treematch/treematch/uthash.h HASH_TO_BKT( _hd_hh_del->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ head 223 ompi/mca/topo/treematch/treematch/uthash.h HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \ head 224 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items--; \ head 226 ompi/mca/topo/treematch/treematch/uthash.h HASH_FSCK(hh,head); \ head 231 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FIND_STR(head,findstr,out) \ head 232 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND(hh,head,findstr,strlen(findstr),out) head 233 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD_STR(head,strfield,add) \ head 234 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD(hh,head,strfield,strlen(add->strfield),add) head 235 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FIND_INT(head,findint,out) \ head 236 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND(hh,head,findint,sizeof(int),out) head 237 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD_INT(head,intfield,add) \ head 238 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD(hh,head,intfield,sizeof(int),add) head 239 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FIND_PTR(head,findptr,out) \ head 240 ompi/mca/topo/treematch/treematch/uthash.h HASH_FIND(hh,head,findptr,sizeof(void *),out) head 241 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD_PTR(head,ptrfield,add) \ head 242 ompi/mca/topo/treematch/treematch/uthash.h HASH_ADD(hh,head,ptrfield,sizeof(void *),add) head 243 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_DEL(head,delptr) \ head 244 ompi/mca/topo/treematch/treematch/uthash.h HASH_DELETE(hh,head,delptr) head 251 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FSCK(hh,head) \ head 257 ompi/mca/topo/treematch/treematch/uthash.h if (head) { \ head 259 ompi/mca/topo/treematch/treematch/uthash.h for( _bkt_i = 0; _bkt_i < (head)->hh.tbl->num_buckets; _bkt_i++) { \ head 261 ompi/mca/topo/treematch/treematch/uthash.h _thh = (head)->hh.tbl->buckets[_bkt_i].hh_head; \ head 273 ompi/mca/topo/treematch/treematch/uthash.h if ((head)->hh.tbl->buckets[_bkt_i].count != _bkt_count) { \ head 275 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->buckets[_bkt_i].count, _bkt_count); \ head 278 ompi/mca/topo/treematch/treematch/uthash.h if (_count != (head)->hh.tbl->num_items) { \ head 280 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items, _count ); \ head 285 ompi/mca/topo/treematch/treematch/uthash.h _thh = &(head)->hh; \ head 292 ompi/mca/topo/treematch/treematch/uthash.h _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \ head 294 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho) : NULL ); \ head 296 ompi/mca/topo/treematch/treematch/uthash.h if (_count != (head)->hh.tbl->num_items) { \ head 298 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_items, _count ); \ head 303 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FSCK(hh,head) head 310 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) \ head 317 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) head 568 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,out) \ head 570 ompi/mca/topo/treematch/treematch/uthash.h if (head.hh_head) DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,head.hh_head)); \ head 582 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ADD_TO_BKT(head,addhh) \ head 584 ompi/mca/topo/treematch/treematch/uthash.h head.count++; \ head 585 ompi/mca/topo/treematch/treematch/uthash.h (addhh)->hh_next = head.hh_head; \ head 587 ompi/mca/topo/treematch/treematch/uthash.h if (head.hh_head) { (head).hh_head->hh_prev = (addhh); } \ head 588 ompi/mca/topo/treematch/treematch/uthash.h (head).hh_head=addhh; \ head 589 ompi/mca/topo/treematch/treematch/uthash.h if (head.count >= ((head.expand_mult+1) * HASH_BKT_CAPACITY_THRESH) \ head 596 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_DEL_IN_BKT(hh,head,hh_del) \ head 597 ompi/mca/topo/treematch/treematch/uthash.h (head).count--; \ head 598 ompi/mca/topo/treematch/treematch/uthash.h if ((head).hh_head == hh_del) { \ head 599 ompi/mca/topo/treematch/treematch/uthash.h (head).hh_head = hh_del->hh_next; \ head 689 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) head 690 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_SRT(hh,head,cmpfcn) \ head 695 ompi/mca/topo/treematch/treematch/uthash.h if (head) { \ head 698 ompi/mca/topo/treematch/treematch/uthash.h _hs_list = &((head)->hh); \ head 712 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 721 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 727 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 730 ompi/mca/topo/treematch/treematch/uthash.h cmpfcn(DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_p)), \ head 731 ompi/mca/topo/treematch/treematch/uthash.h DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_q))) \ head 736 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 742 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 747 ompi/mca/topo/treematch/treematch/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_e) : NULL); \ head 752 ompi/mca/topo/treematch/treematch/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_tail) : NULL); \ head 760 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->tail = _hs_tail; \ head 761 ompi/mca/topo/treematch/treematch/uthash.h DECLTYPE_ASSIGN(head,ELMT_FROM_HH((head)->hh.tbl, _hs_list)); \ head 765 ompi/mca/topo/treematch/treematch/uthash.h HASH_FSCK(hh,head); \ head 812 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_CLEAR(hh,head) \ head 814 ompi/mca/topo/treematch/treematch/uthash.h if (head) { \ head 815 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl->buckets, \ head 816 ompi/mca/topo/treematch/treematch/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket)); \ head 817 ompi/mca/topo/treematch/treematch/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ head 818 ompi/mca/topo/treematch/treematch/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ head 819 ompi/mca/topo/treematch/treematch/uthash.h (head)=NULL; \ head 824 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ITER(hh,head,el,tmp) \ head 825 ompi/mca/topo/treematch/treematch/uthash.h for((el)=(head), (*(char**)(&(tmp)))=(char*)((head)?(head)->hh.next:NULL); \ head 828 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_ITER(hh,head,el,tmp) \ head 829 ompi/mca/topo/treematch/treematch/uthash.h for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)->hh.next:NULL); \ head 834 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_COUNT(head) HASH_CNT(hh,head) head 835 ompi/mca/topo/treematch/treematch/uthash.h #define HASH_CNT(hh,head) ((head)?((head)->hh.tbl->num_items):0) head 105 opal/class/opal_fifo.h opal_counted_pointer_t head = {.value = fifo->opal_fifo_head.value}; head 106 opal/class/opal_fifo.h opal_update_counted_pointer (&fifo->opal_fifo_head, &head, item); head 121 opal/class/opal_fifo.h opal_counted_pointer_t head, tail; head 123 opal/class/opal_fifo.h opal_read_counted_pointer (&fifo->opal_fifo_head, &head); head 129 opal/class/opal_fifo.h item = (opal_list_item_t *) head.data.item; head 138 opal/class/opal_fifo.h opal_read_counted_pointer (&fifo->opal_fifo_head, &head); head 143 opal/class/opal_fifo.h if (opal_update_counted_pointer (&fifo->opal_fifo_head, &head, next)) { head 254 opal/class/opal_lifo.h opal_list_item_t *item, *head, *ghost = &lifo->opal_lifo_ghost; head 264 opal/class/opal_lifo.h head = item; head 266 opal/class/opal_lifo.h if (opal_atomic_compare_exchange_strong_ptr (&lifo->opal_lifo_head.data.item, (intptr_t *) &head, head 273 opal/class/opal_lifo.h item = head; head 46 opal/class/opal_ring_buffer.c ring->head = 0; head 93 opal/class/opal_ring_buffer.c if (NULL != ring->addr[ring->head]) { head 94 opal/class/opal_ring_buffer.c p = (char*)ring->addr[ring->head]; head 98 opal/class/opal_ring_buffer.c ring->tail = ring->head + 1; head 101 opal/class/opal_ring_buffer.c ring->addr[ring->head] = (char*)ptr; head 103 opal/class/opal_ring_buffer.c ring->tail = ring->head; head 105 opal/class/opal_ring_buffer.c if (ring->head == ring->size - 1) { head 106 opal/class/opal_ring_buffer.c ring->head = 0; head 108 opal/class/opal_ring_buffer.c ring->head++; head 131 opal/class/opal_ring_buffer.c if (ring->tail == ring->head) { head 149 opal/class/opal_ring_buffer.c if (ring->head == 0) { head 152 opal/class/opal_ring_buffer.c p = ring->addr[ring->head - 1]; head 46 opal/class/opal_ring_buffer.h int head; head 90 opal/mca/btl/smcuda/btl_smcuda.h volatile int head; head 278 opal/mca/btl/smcuda/btl_smcuda.h fifo->head = 0; head 294 opal/mca/btl/smcuda/btl_smcuda.h if ( SM_FIFO_FREE != q[fifo->head] ) head 298 opal/mca/btl/smcuda/btl_smcuda.h q[fifo->head] = value; head 300 opal/mca/btl/smcuda/btl_smcuda.h fifo->head = (fifo->head + 1) & fifo->mask; head 77 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ROOT(head) (head)->sph_root head 78 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) head 81 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ head 82 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ head 83 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ head 84 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = tmp; \ head 87 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ head 88 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \ head 89 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \ head 90 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = tmp; \ head 93 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_LINKLEFT(head, tmp, field) do { \ head 94 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \ head 95 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h tmp = (head)->sph_root; \ head 96 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \ head 99 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_LINKRIGHT(head, tmp, field) do { \ head 100 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ head 101 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h tmp = (head)->sph_root; \ head 102 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \ head 105 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ head 106 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \ head 107 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\ head 108 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \ head 109 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \ head 122 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_FIND(struct name *head, struct type *elm) \ head 124 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_EMPTY(head)) \ head 126 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 127 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if ((cmp)(elm, (head)->sph_root) == 0) \ head 128 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h return (head->sph_root); \ head 133 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_NEXT(struct name *head, struct type *elm) \ head 135 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 147 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_MIN_MAX(struct name *head, int val) \ head 149 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_MINMAX(head, val); \ head 150 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h return (SPLAY_ROOT(head)); \ head 158 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_INSERT(struct name *head, struct type *elm) \ head 160 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_EMPTY(head)) { \ head 164 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 165 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __comp = (cmp)(elm, (head)->sph_root); \ head 167 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\ head 168 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(elm, field) = (head)->sph_root; \ head 169 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT((head)->sph_root, field) = NULL; \ head 171 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\ head 172 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(elm, field) = (head)->sph_root; \ head 173 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = NULL; \ head 175 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h return ((head)->sph_root); \ head 177 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = (elm); \ head 182 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_REMOVE(struct name *head, struct type *elm) \ head 185 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_EMPTY(head)) \ head 187 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 188 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if ((cmp)(elm, (head)->sph_root) == 0) { \ head 189 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \ head 190 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\ head 192 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \ head 193 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\ head 194 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 195 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = __tmp; \ head 203 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(struct name *head, struct type *elm) \ head 211 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h while ((__comp = (cmp)(elm, (head)->sph_root))) { \ head 213 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \ head 217 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \ head 218 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\ head 221 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKLEFT(head, __right, field); \ head 223 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \ head 227 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \ head 228 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\ head 231 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKRIGHT(head, __left, field); \ head 234 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ head 240 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h void name##_SPLAY_MINMAX(struct name *head, int __comp) \ head 249 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \ head 253 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \ head 254 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\ head 257 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKLEFT(head, __right, field); \ head 259 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \ head 263 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \ head 264 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\ head 267 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKRIGHT(head, __left, field); \ head 270 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ head 285 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_FOREACH(x, name, head) \ head 286 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h for ((x) = SPLAY_MIN(name, head); \ head 288 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (x) = SPLAY_NEXT(name, head, x)) head 317 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_ROOT(head) (head)->rbh_root head 318 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_EMPTY(head) (RB_ROOT(head) == NULL) head 335 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ head 347 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->rbh_root = (tmp); \ head 355 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ head 367 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->rbh_root = (tmp); \ head 391 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \ head 406 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\ head 412 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, gparent, tmp, field); \ head 422 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\ head 428 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, gparent, tmp, field); \ head 431 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_COLOR(head->rbh_root, field) = RB_BLACK; \ head 435 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \ head 439 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm != RB_ROOT(head)) { \ head 444 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\ head 461 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, tmp, oleft, field);\ head 468 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\ head 469 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm = RB_ROOT(head); \ head 476 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\ head 493 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, tmp, oright, field);\ head 500 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\ head 501 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm = RB_ROOT(head); \ head 511 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_REMOVE(struct name *head, struct type *elm) \ head 536 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = child; \ head 547 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = elm; \ head 570 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = child; \ head 573 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_REMOVE_COLOR(head, parent, child); \ head 579 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_INSERT(struct name *head, struct type *elm) \ head 584 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h tmp = RB_ROOT(head); \ head 603 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = elm; \ head 604 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_INSERT_COLOR(head, elm); \ head 610 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_FIND(struct name *head, struct type *elm) \ head 612 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h struct type *tmp = RB_ROOT(head); \ head 648 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_MINMAX(struct name *head, int val) \ head 650 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h struct type *tmp = RB_ROOT(head); \ head 672 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_FOREACH(x, name, head) \ head 673 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h for ((x) = RB_MIN(name, head); \ head 754 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ROOT(head) (head)->sph_root head 755 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) head 758 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ head 759 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ head 760 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ head 761 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = tmp; \ head 764 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ head 765 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \ head 766 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \ head 767 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = tmp; \ head 770 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_LINKLEFT(head, tmp, field) do { \ head 771 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \ head 772 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h tmp = (head)->sph_root; \ head 773 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \ head 776 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_LINKRIGHT(head, tmp, field) do { \ head 777 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ head 778 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h tmp = (head)->sph_root; \ head 779 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \ head 782 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ head 783 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \ head 784 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\ head 785 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \ head 786 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \ head 799 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_FIND(struct name *head, struct type *elm) \ head 801 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_EMPTY(head)) \ head 803 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 804 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if ((cmp)(elm, (head)->sph_root) == 0) \ head 805 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h return (head->sph_root); \ head 810 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_NEXT(struct name *head, struct type *elm) \ head 812 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 824 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_MIN_MAX(struct name *head, int val) \ head 826 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_MINMAX(head, val); \ head 827 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h return (SPLAY_ROOT(head)); \ head 835 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_INSERT(struct name *head, struct type *elm) \ head 837 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_EMPTY(head)) { \ head 841 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 842 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __comp = (cmp)(elm, (head)->sph_root); \ head 844 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\ head 845 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(elm, field) = (head)->sph_root; \ head 846 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT((head)->sph_root, field) = NULL; \ head 848 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\ head 849 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LEFT(elm, field) = (head)->sph_root; \ head 850 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = NULL; \ head 852 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h return ((head)->sph_root); \ head 854 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = (elm); \ head 859 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY_REMOVE(struct name *head, struct type *elm) \ head 862 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_EMPTY(head)) \ head 864 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 865 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if ((cmp)(elm, (head)->sph_root) == 0) { \ head 866 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \ head 867 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\ head 869 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \ head 870 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\ head 871 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(head, elm); \ head 872 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT((head)->sph_root, field) = __tmp; \ head 880 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_SPLAY(struct name *head, struct type *elm) \ head 888 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h while ((__comp = (cmp)(elm, (head)->sph_root))) { \ head 890 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \ head 894 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \ head 895 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\ head 898 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKLEFT(head, __right, field); \ head 900 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \ head 904 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \ head 905 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\ head 908 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKRIGHT(head, __left, field); \ head 911 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ head 917 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h void name##_SPLAY_MINMAX(struct name *head, int __comp) \ head 926 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \ head 930 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \ head 931 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\ head 934 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKLEFT(head, __right, field); \ head 936 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \ head 940 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \ head 941 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\ head 944 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_LINKRIGHT(head, __left, field); \ head 947 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ head 962 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_FOREACH(x, name, head) \ head 963 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h for ((x) = SPLAY_MIN(name, head); \ head 965 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (x) = SPLAY_NEXT(name, head, x)) head 994 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_ROOT(head) (head)->rbh_root head 995 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_EMPTY(head) (RB_ROOT(head) == NULL) head 1012 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ head 1024 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->rbh_root = (tmp); \ head 1032 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ head 1044 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h (head)->rbh_root = (tmp); \ head 1068 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \ head 1083 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\ head 1089 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, gparent, tmp, field); \ head 1099 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\ head 1105 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, gparent, tmp, field); \ head 1108 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_COLOR(head->rbh_root, field) = RB_BLACK; \ head 1112 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \ head 1116 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm != RB_ROOT(head)) { \ head 1121 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\ head 1138 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, tmp, oleft, field);\ head 1145 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\ head 1146 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm = RB_ROOT(head); \ head 1153 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\ head 1170 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_LEFT(head, tmp, oright, field);\ head 1177 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\ head 1178 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm = RB_ROOT(head); \ head 1188 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_REMOVE(struct name *head, struct type *elm) \ head 1213 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = child; \ head 1224 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = elm; \ head 1247 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = child; \ head 1250 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_REMOVE_COLOR(head, parent, child); \ head 1256 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_INSERT(struct name *head, struct type *elm) \ head 1261 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h tmp = RB_ROOT(head); \ head 1280 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_ROOT(head) = elm; \ head 1281 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_INSERT_COLOR(head, elm); \ head 1287 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_FIND(struct name *head, struct type *elm) \ head 1289 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h struct type *tmp = RB_ROOT(head); \ head 1325 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h name##_RB_MINMAX(struct name *head, int val) \ head 1327 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h struct type *tmp = RB_ROOT(head); \ head 1349 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define RB_FOREACH(x, name, head) \ head 1350 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h for ((x) = RB_MIN(name, head); \ head 93 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_HEAD_INITIALIZER(head) \ head 106 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_FIRST(head) ((head)->slh_first) head 107 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_END(head) NULL head 108 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) head 111 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_FOREACH(var, head, field) \ head 112 opal/mca/event/libevent2022/libevent/compat/sys/queue.h for((var) = SLIST_FIRST(head); \ head 113 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (var) != SLIST_END(head); \ head 119 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_INIT(head) { \ head 120 opal/mca/event/libevent2022/libevent/compat/sys/queue.h SLIST_FIRST(head) = SLIST_END(head); \ head 128 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_INSERT_HEAD(head, elm, field) do { \ head 129 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.sle_next = (head)->slh_first; \ head 130 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->slh_first = (elm); \ head 133 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SLIST_REMOVE_HEAD(head, field) do { \ head 134 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->slh_first = (head)->slh_first->field.sle_next; \ head 145 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define LIST_HEAD_INITIALIZER(head) \ head 157 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define LIST_FIRST(head) ((head)->lh_first) head 158 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define LIST_END(head) NULL head 159 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) head 162 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define LIST_FOREACH(var, head, field) \ head 163 opal/mca/event/libevent2022/libevent/compat/sys/queue.h for((var) = LIST_FIRST(head); \ head 164 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (var)!= LIST_END(head); \ head 170 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define LIST_INIT(head) do { \ head 171 opal/mca/event/libevent2022/libevent/compat/sys/queue.h LIST_FIRST(head) = LIST_END(head); \ head 189 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define LIST_INSERT_HEAD(head, elm, field) do { \ head 190 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if (((elm)->field.le_next = (head)->lh_first) != NULL) \ head 191 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->lh_first->field.le_prev = &(elm)->field.le_next;\ head 192 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->lh_first = (elm); \ head 193 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.le_prev = &(head)->lh_first; \ head 220 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_HEAD_INITIALIZER(head) \ head 221 opal/mca/event/libevent2022/libevent/compat/sys/queue.h { NULL, &(head).sqh_first } head 231 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_FIRST(head) ((head)->sqh_first) head 232 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_END(head) NULL head 233 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) head 236 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_FOREACH(var, head, field) \ head 237 opal/mca/event/libevent2022/libevent/compat/sys/queue.h for((var) = SIMPLEQ_FIRST(head); \ head 238 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (var) != SIMPLEQ_END(head); \ head 244 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_INIT(head) do { \ head 245 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->sqh_first = NULL; \ head 246 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->sqh_last = &(head)->sqh_first; \ head 249 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ head 250 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \ head 251 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \ head 252 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->sqh_first = (elm); \ head 255 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ head 257 opal/mca/event/libevent2022/libevent/compat/sys/queue.h *(head)->sqh_last = (elm); \ head 258 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \ head 261 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ head 263 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \ head 267 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define SIMPLEQ_REMOVE_HEAD(head, elm, field) do { \ head 268 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if (((head)->sqh_first = (elm)->field.sqe_next) == NULL) \ head 269 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->sqh_last = &(head)->sqh_first; \ head 281 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_HEAD_INITIALIZER(head) \ head 282 opal/mca/event/libevent2022/libevent/compat/sys/queue.h { NULL, &(head).tqh_first } head 293 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_FIRST(head) ((head)->tqh_first) head 294 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_END(head) NULL head 296 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_LAST(head, headname) \ head 297 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (*(((struct headname *)((head)->tqh_last))->tqh_last)) head 301 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_EMPTY(head) \ head 302 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (TAILQ_FIRST(head) == TAILQ_END(head)) head 304 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_FOREACH(var, head, field) \ head 305 opal/mca/event/libevent2022/libevent/compat/sys/queue.h for((var) = TAILQ_FIRST(head); \ head 306 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (var) != TAILQ_END(head); \ head 309 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ head 310 opal/mca/event/libevent2022/libevent/compat/sys/queue.h for((var) = TAILQ_LAST(head, headname); \ head 311 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (var) != TAILQ_END(head); \ head 317 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_INIT(head) do { \ head 318 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_first = NULL; \ head 319 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_last = &(head)->tqh_first; \ head 322 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_INSERT_HEAD(head, elm, field) do { \ head 323 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ head 324 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_first->field.tqe_prev = \ head 327 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ head 328 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_first = (elm); \ head 329 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.tqe_prev = &(head)->tqh_first; \ head 332 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_INSERT_TAIL(head, elm, field) do { \ head 334 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.tqe_prev = (head)->tqh_last; \ head 335 opal/mca/event/libevent2022/libevent/compat/sys/queue.h *(head)->tqh_last = (elm); \ head 336 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ head 339 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ head 344 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ head 356 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_REMOVE(head, elm, field) do { \ head 361 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_last = (elm)->field.tqe_prev; \ head 365 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define TAILQ_REPLACE(head, elm, elm2, field) do { \ head 370 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->tqh_last = &(elm2)->field.tqe_next; \ head 384 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_HEAD_INITIALIZER(head) \ head 385 opal/mca/event/libevent2022/libevent/compat/sys/queue.h { CIRCLEQ_END(&head), CIRCLEQ_END(&head) } head 396 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_FIRST(head) ((head)->cqh_first) head 397 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_LAST(head) ((head)->cqh_last) head 398 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_END(head) ((void *)(head)) head 401 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_EMPTY(head) \ head 402 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head)) head 404 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_FOREACH(var, head, field) \ head 405 opal/mca/event/libevent2022/libevent/compat/sys/queue.h for((var) = CIRCLEQ_FIRST(head); \ head 406 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (var) != CIRCLEQ_END(head); \ head 409 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ head 410 opal/mca/event/libevent2022/libevent/compat/sys/queue.h for((var) = CIRCLEQ_LAST(head); \ head 411 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (var) != CIRCLEQ_END(head); \ head 417 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_INIT(head) do { \ head 418 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_first = CIRCLEQ_END(head); \ head 419 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_last = CIRCLEQ_END(head); \ head 422 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ head 425 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \ head 426 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_last = (elm); \ head 432 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ head 435 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \ head 436 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_first = (elm); \ head 442 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ head 443 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.cqe_next = (head)->cqh_first; \ head 444 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.cqe_prev = CIRCLEQ_END(head); \ head 445 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if ((head)->cqh_last == CIRCLEQ_END(head)) \ head 446 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_last = (elm); \ head 448 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_first->field.cqe_prev = (elm); \ head 449 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_first = (elm); \ head 452 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ head 453 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.cqe_next = CIRCLEQ_END(head); \ head 454 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (elm)->field.cqe_prev = (head)->cqh_last; \ head 455 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if ((head)->cqh_first == CIRCLEQ_END(head)) \ head 456 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_first = (elm); \ head 458 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_last->field.cqe_next = (elm); \ head 459 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_last = (elm); \ head 462 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_REMOVE(head, elm, field) do { \ head 463 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \ head 464 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_last = (elm)->field.cqe_prev; \ head 468 opal/mca/event/libevent2022/libevent/compat/sys/queue.h if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \ head 469 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head)->cqh_first = (elm)->field.cqe_next; \ head 475 opal/mca/event/libevent2022/libevent/compat/sys/queue.h #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ head 477 opal/mca/event/libevent2022/libevent/compat/sys/queue.h CIRCLEQ_END(head)) \ head 478 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head).cqh_last = (elm2); \ head 482 opal/mca/event/libevent2022/libevent/compat/sys/queue.h CIRCLEQ_END(head)) \ head 483 opal/mca/event/libevent2022/libevent/compat/sys/queue.h (head).cqh_first = (elm2); \ head 387 opal/mca/event/libevent2022/libevent/evdns.c static void evdns_request_insert(struct request *req, struct request **head); head 388 opal/mca/event/libevent2022/libevent/evdns.c static void evdns_request_remove(struct request *req, struct request **head); head 646 opal/mca/event/libevent2022/libevent/evdns.c request_finished(struct request *const req, struct request **head, int free_handle) { head 648 opal/mca/event/libevent2022/libevent/evdns.c int was_inflight = (head != &base->req_waiting_head); head 652 opal/mca/event/libevent2022/libevent/evdns.c if (head) head 653 opal/mca/event/libevent2022/libevent/evdns.c evdns_request_remove(req, head); head 2631 opal/mca/event/libevent2022/libevent/evdns.c evdns_request_remove(struct request *req, struct request **head) head 2640 opal/mca/event/libevent2022/libevent/evdns.c EVUTIL_ASSERT(*head != NULL); head 2642 opal/mca/event/libevent2022/libevent/evdns.c ptr = *head; head 2649 opal/mca/event/libevent2022/libevent/evdns.c } while (ptr != *head); head 2658 opal/mca/event/libevent2022/libevent/evdns.c *head = NULL; head 2662 opal/mca/event/libevent2022/libevent/evdns.c if (*head == req) *head = req->next; head 2669 opal/mca/event/libevent2022/libevent/evdns.c evdns_request_insert(struct request *req, struct request **head) { head 2672 opal/mca/event/libevent2022/libevent/evdns.c if (!*head) { head 2673 opal/mca/event/libevent2022/libevent/evdns.c *head = req; head 2678 opal/mca/event/libevent2022/libevent/evdns.c req->prev = (*head)->prev; head 2680 opal/mca/event/libevent2022/libevent/evdns.c req->next = *head; head 2681 opal/mca/event/libevent2022/libevent/evdns.c (*head)->prev = req; head 2994 opal/mca/event/libevent2022/libevent/evdns.c struct search_domain *head; head 3003 opal/mca/event/libevent2022/libevent/evdns.c for (dom = state->head; dom; dom = next) { head 3058 opal/mca/event/libevent2022/libevent/evdns.c sdomain->next = base->global_search_state->head; head 3061 opal/mca/event/libevent2022/libevent/evdns.c base->global_search_state->head = sdomain; head 3070 opal/mca/event/libevent2022/libevent/evdns.c cur = base->global_search_state->head; head 3078 opal/mca/event/libevent2022/libevent/evdns.c base->global_search_state->head = prev; head 3126 opal/mca/event/libevent2022/libevent/evdns.c for (dom = state->head; dom; dom = dom->next) { head 3991 opal/mca/event/libevent2022/libevent/evdns.c for (dom = base->global_search_state->head; dom; dom = dom_next) { head 315 opal/mca/event/libevent2022/libevent/event-internal.h #define TAILQ_FIRST(head) ((head)->tqh_first) head 318 opal/mca/event/libevent2022/libevent/event-internal.h #define TAILQ_END(head) NULL head 325 opal/mca/event/libevent2022/libevent/event-internal.h #define TAILQ_FOREACH(var, head, field) \ head 326 opal/mca/event/libevent2022/libevent/event-internal.h for ((var) = TAILQ_FIRST(head); \ head 327 opal/mca/event/libevent2022/libevent/event-internal.h (var) != TAILQ_END(head); \ head 1148 opal/mca/event/libevent2022/libevent/event.c const struct timeval *now, struct event *head) head 1150 opal/mca/event/libevent2022/libevent/event.c struct timeval timeout = head->ev_timeout; head 125 opal/mca/event/libevent2022/libevent/evrpc.c struct evrpc_hook_list *head = NULL; head 129 opal/mca/event/libevent2022/libevent/evrpc.c head = &base->in_hooks; head 132 opal/mca/event/libevent2022/libevent/evrpc.c head = &base->out_hooks; head 143 opal/mca/event/libevent2022/libevent/evrpc.c TAILQ_INSERT_TAIL(head, hook, next); head 149 opal/mca/event/libevent2022/libevent/evrpc.c evrpc_remove_hook_internal(struct evrpc_hook_list *head, void *handle) head 152 opal/mca/event/libevent2022/libevent/evrpc.c TAILQ_FOREACH(hook, head, next) { head 154 opal/mca/event/libevent2022/libevent/evrpc.c TAILQ_REMOVE(head, hook, next); head 171 opal/mca/event/libevent2022/libevent/evrpc.c struct evrpc_hook_list *head = NULL; head 174 opal/mca/event/libevent2022/libevent/evrpc.c head = &base->in_hooks; head 177 opal/mca/event/libevent2022/libevent/evrpc.c head = &base->out_hooks; head 183 opal/mca/event/libevent2022/libevent/evrpc.c return (evrpc_remove_hook_internal(head, handle)); head 187 opal/mca/event/libevent2022/libevent/evrpc.c evrpc_process_hooks(struct evrpc_hook_list *head, void *ctx, head 191 opal/mca/event/libevent2022/libevent/evrpc.c TAILQ_FOREACH(hook, head, next) { head 784 opal/mca/event/libevent2022/libevent/evrpc.c struct evrpc_pause_list *head = &base->pause_requests; head 787 opal/mca/event/libevent2022/libevent/evrpc.c TAILQ_FOREACH(pause, head, next) { head 796 opal/mca/event/libevent2022/libevent/evrpc.c TAILQ_REMOVE(head, pause, next); head 41 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_EMPTY(head) \ head 42 opal/mca/event/libevent2022/libevent/ht-internal.h ((head)->hth_n_entries == 0) head 45 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_SIZE(head) \ head 46 opal/mca/event/libevent2022/libevent/ht-internal.h ((head)->hth_n_entries) head 48 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) head 49 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) head 50 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) head 51 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) head 52 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_START(name, head) name##_HT_START(head) head 53 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) head 54 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) head 55 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_CLEAR(name, head) name##_HT_CLEAR(head) head 56 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_INIT(name, head) name##_HT_INIT(head) head 117 opal/mca/event/libevent2022/libevent/ht-internal.h #define _HT_BUCKET(head, field, elm, hashfn) \ head 118 opal/mca/event/libevent2022/libevent/ht-internal.h ((head)->hth_table[_HT_ELT_HASH(elm,field,hashfn) % head->hth_table_length]) head 120 opal/mca/event/libevent2022/libevent/ht-internal.h #define HT_FOREACH(x, name, head) \ head 121 opal/mca/event/libevent2022/libevent/ht-internal.h for ((x) = HT_START(name, head); \ head 123 opal/mca/event/libevent2022/libevent/ht-internal.h (x) = HT_NEXT(name, head, x)) head 130 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_INIT(struct name *head) { \ head 131 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_table_length = 0; \ head 132 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_table = NULL; \ head 133 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_n_entries = 0; \ head 134 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_load_limit = 0; \ head 135 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_prime_idx = -1; \ head 140 opal/mca/event/libevent2022/libevent/ht-internal.h _##name##_HT_FIND_P(struct name *head, struct type *elm) \ head 143 opal/mca/event/libevent2022/libevent/ht-internal.h if (!head->hth_table) \ head 145 opal/mca/event/libevent2022/libevent/ht-internal.h p = &_HT_BUCKET(head, field, elm, hashfn); \ head 156 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_FIND(const struct name *head, struct type *elm) \ head 159 opal/mca/event/libevent2022/libevent/ht-internal.h struct name *h = (struct name *) head; \ head 167 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_INSERT(struct name *head, struct type *elm) \ head 170 opal/mca/event/libevent2022/libevent/ht-internal.h if (!head->hth_table || head->hth_n_entries >= head->hth_load_limit) \ head 171 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_GROW(head, head->hth_n_entries+1); \ head 172 opal/mca/event/libevent2022/libevent/ht-internal.h ++head->hth_n_entries; \ head 174 opal/mca/event/libevent2022/libevent/ht-internal.h p = &_HT_BUCKET(head, field, elm, hashfn); \ head 182 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_REPLACE(struct name *head, struct type *elm) \ head 185 opal/mca/event/libevent2022/libevent/ht-internal.h if (!head->hth_table || head->hth_n_entries >= head->hth_load_limit) \ head 186 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_GROW(head, head->hth_n_entries+1); \ head 188 opal/mca/event/libevent2022/libevent/ht-internal.h p = _##name##_HT_FIND_P(head, elm); \ head 196 opal/mca/event/libevent2022/libevent/ht-internal.h ++head->hth_n_entries; \ head 203 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_REMOVE(struct name *head, struct type *elm) \ head 207 opal/mca/event/libevent2022/libevent/ht-internal.h p = _##name##_HT_FIND_P(head,elm); \ head 213 opal/mca/event/libevent2022/libevent/ht-internal.h --head->hth_n_entries; \ head 221 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_FOREACH_FN(struct name *head, \ head 227 opal/mca/event/libevent2022/libevent/ht-internal.h if (!head->hth_table) \ head 229 opal/mca/event/libevent2022/libevent/ht-internal.h for (idx=0; idx < head->hth_table_length; ++idx) { \ head 230 opal/mca/event/libevent2022/libevent/ht-internal.h p = &head->hth_table[idx]; \ head 235 opal/mca/event/libevent2022/libevent/ht-internal.h --head->hth_n_entries; \ head 247 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_START(struct name *head) \ head 250 opal/mca/event/libevent2022/libevent/ht-internal.h while (b < head->hth_table_length) { \ head 251 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_table[b]) \ head 252 opal/mca/event/libevent2022/libevent/ht-internal.h return &head->hth_table[b]; \ head 263 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_NEXT(struct name *head, struct type **elm) \ head 268 opal/mca/event/libevent2022/libevent/ht-internal.h unsigned b = (_HT_ELT_HASH(*elm, field, hashfn) % head->hth_table_length)+1; \ head 269 opal/mca/event/libevent2022/libevent/ht-internal.h while (b < head->hth_table_length) { \ head 270 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_table[b]) \ head 271 opal/mca/event/libevent2022/libevent/ht-internal.h return &head->hth_table[b]; \ head 278 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_NEXT_RMV(struct name *head, struct type **elm) \ head 282 opal/mca/event/libevent2022/libevent/ht-internal.h --head->hth_n_entries; \ head 286 opal/mca/event/libevent2022/libevent/ht-internal.h unsigned b = (h % head->hth_table_length)+1; \ head 287 opal/mca/event/libevent2022/libevent/ht-internal.h while (b < head->hth_table_length) { \ head 288 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_table[b]) \ head 289 opal/mca/event/libevent2022/libevent/ht-internal.h return &head->hth_table[b]; \ head 313 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_GROW(struct name *head, unsigned size) \ head 318 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_prime_idx == (int)name##_N_PRIMES - 1) \ head 320 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_load_limit > size) \ head 322 opal/mca/event/libevent2022/libevent/ht-internal.h prime_idx = head->hth_prime_idx; \ head 331 opal/mca/event/libevent2022/libevent/ht-internal.h for (b = 0; b < head->hth_table_length; ++b) { \ head 334 opal/mca/event/libevent2022/libevent/ht-internal.h elm = head->hth_table[b]; \ head 343 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_table) \ head 344 opal/mca/event/libevent2022/libevent/ht-internal.h freefn(head->hth_table); \ head 345 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_table = new_table; \ head 348 opal/mca/event/libevent2022/libevent/ht-internal.h new_table = reallocfn(head->hth_table, new_len*sizeof(struct type*)); \ head 350 opal/mca/event/libevent2022/libevent/ht-internal.h memset(new_table + head->hth_table_length, 0, \ head 351 opal/mca/event/libevent2022/libevent/ht-internal.h (new_len - head->hth_table_length)*sizeof(struct type*)); \ head 352 opal/mca/event/libevent2022/libevent/ht-internal.h for (b=0; b < head->hth_table_length; ++b) { \ head 365 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_table = new_table; \ head 367 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_table_length = new_len; \ head 368 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_prime_idx = prime_idx; \ head 369 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_load_limit = new_load_limit; \ head 375 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_CLEAR(struct name *head) \ head 377 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_table) \ head 378 opal/mca/event/libevent2022/libevent/ht-internal.h freefn(head->hth_table); \ head 379 opal/mca/event/libevent2022/libevent/ht-internal.h head->hth_table_length = 0; \ head 380 opal/mca/event/libevent2022/libevent/ht-internal.h name##_HT_INIT(head); \ head 385 opal/mca/event/libevent2022/libevent/ht-internal.h _##name##_HT_REP_IS_BAD(const struct name *head) \ head 389 opal/mca/event/libevent2022/libevent/ht-internal.h if (!head->hth_table_length) { \ head 390 opal/mca/event/libevent2022/libevent/ht-internal.h if (!head->hth_table && !head->hth_n_entries && \ head 391 opal/mca/event/libevent2022/libevent/ht-internal.h !head->hth_load_limit && head->hth_prime_idx == -1) \ head 396 opal/mca/event/libevent2022/libevent/ht-internal.h if (!head->hth_table || head->hth_prime_idx < 0 || \ head 397 opal/mca/event/libevent2022/libevent/ht-internal.h !head->hth_load_limit) \ head 399 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_n_entries > head->hth_load_limit) \ head 401 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_table_length != name##_PRIMES[head->hth_prime_idx]) \ head 403 opal/mca/event/libevent2022/libevent/ht-internal.h if (head->hth_load_limit != (unsigned)(load*head->hth_table_length)) \ head 405 opal/mca/event/libevent2022/libevent/ht-internal.h for (n = i = 0; i < head->hth_table_length; ++i) { \ head 406 opal/mca/event/libevent2022/libevent/ht-internal.h for (elm = head->hth_table[i]; elm; elm = elm->field.hte_next) { \ head 409 opal/mca/event/libevent2022/libevent/ht-internal.h if ((_HT_ELT_HASH(elm, field, hashfn) % head->hth_table_length) != i) \ head 414 opal/mca/event/libevent2022/libevent/ht-internal.h if (n != head->hth_n_entries) \ head 422 opal/mca/event/libevent2022/libevent/ht-internal.h #define _HT_FIND_OR_INSERT(name, field, hashfn, head, eltype, elm, var, y, n) \ head 424 opal/mca/event/libevent2022/libevent/ht-internal.h struct name *_##var##_head = head; \ head 437 opal/mca/event/libevent2022/libevent/ht-internal.h #define _HT_FOI_INSERT(field, head, elm, newent, var) \ head 442 opal/mca/event/libevent2022/libevent/ht-internal.h ++((head)->hth_n_entries); \ head 106 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FIND(hh,head,keyptr,keylen,out) \ head 109 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (head != NULL) { \ head 111 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ head 112 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv) != 0) { \ head 113 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ head 153 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_MAKE_TABLE(hh,head) \ head 155 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ head 157 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ head 158 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \ head 159 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = &((head)->hh); \ head 160 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_buckets = HASH_INITIAL_NUM_BUCKETS; \ head 161 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2; \ head 162 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \ head 163 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ head 165 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \ head 166 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h memset((head)->hh.tbl->buckets, 0, \ head 168 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_MAKE((head)->hh.tbl); \ head 169 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->signature = HASH_SIGNATURE; \ head 172 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ head 173 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD_KEYPTR(hh,head,&((add)->fieldname),keylen_in,add) head 175 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ head 178 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,&((add)->fieldname),keylen_in,replaced); \ head 180 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_DELETE(hh,head,replaced); \ head 182 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,fieldname,keylen_in,add); \ head 185 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ head 191 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (!(head)) { \ head 192 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h head = (add); \ head 193 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.prev = NULL; \ head 194 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_MAKE_TABLE(hh,head); \ head 196 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail->next = (add); \ head 197 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ head 198 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = &((add)->hh); \ head 200 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items++; \ head 201 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (add)->hh.tbl = (head)->hh.tbl; \ head 202 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FCN(keyptr,keylen_in, (head)->hh.tbl->num_buckets, \ head 204 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \ head 205 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \ head 206 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_EMIT_KEY(hh,head,keyptr,keylen_in); \ head 207 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FSCK(hh,head); \ head 227 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_DELETE(hh,head,delptr) \ head 231 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl->buckets, \ head 232 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ head 233 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ head 234 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ head 235 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h head = NULL; \ head 239 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ head 240 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = \ head 242 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho); \ head 246 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho))->next = (delptr)->hh.next; \ head 248 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h DECLTYPE_ASSIGN(head,(delptr)->hh.next); \ head 252 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho))->prev = \ head 255 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_TO_BKT( _hd_hh_del->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ head 256 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \ head 257 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items--; \ head 259 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FSCK(hh,head); \ head 264 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FIND_STR(head,findstr,out) \ head 265 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,findstr,(unsigned)strlen(findstr),out) head 266 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD_STR(head,strfield,add) \ head 267 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,strfield[0],(unsigned int)strlen(add->strfield),add) head 268 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_REPLACE_STR(head,strfield,add,replaced) \ head 269 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_REPLACE(hh,head,strfield[0],(unsigned)strlen(add->strfield),add,replaced) head 270 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FIND_INT(head,findint,out) \ head 271 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,findint,sizeof(int),out) head 272 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD_INT(head,intfield,add) \ head 273 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,intfield,sizeof(int),add) head 274 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_REPLACE_INT(head,intfield,add,replaced) \ head 275 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_REPLACE(hh,head,intfield,sizeof(int),add,replaced) head 276 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FIND_PTR(head,findptr,out) \ head 277 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FIND(hh,head,findptr,sizeof(void *),out) head 278 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD_PTR(head,ptrfield,add) \ head 279 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_ADD(hh,head,ptrfield,sizeof(void *),add) head 280 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_REPLACE_PTR(head,ptrfield,add,replaced) \ head 281 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_REPLACE(hh,head,ptrfield,sizeof(void *),add,replaced) head 282 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_DEL(head,delptr) \ head 283 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_DELETE(hh,head,delptr) head 290 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FSCK(hh,head) \ head 293 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (head) { \ head 298 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for( _bkt_i = 0; _bkt_i < (head)->hh.tbl->num_buckets; _bkt_i++) { \ head 300 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _thh = (head)->hh.tbl->buckets[_bkt_i].hh_head; \ head 312 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((head)->hh.tbl->buckets[_bkt_i].count != _bkt_count) { \ head 314 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->buckets[_bkt_i].count, _bkt_count); \ head 317 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (_count != (head)->hh.tbl->num_items) { \ head 319 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items, _count ); \ head 324 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _thh = &(head)->hh; \ head 331 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \ head 333 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho) : NULL ); \ head 335 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (_count != (head)->hh.tbl->num_items) { \ head 337 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_items, _count ); \ head 342 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FSCK(hh,head) head 349 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) \ head 356 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) head 614 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,out) \ head 616 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (head.hh_head != NULL) { DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,head.hh_head)); } \ head 628 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ADD_TO_BKT(head,addhh) \ head 630 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h head.count++; \ head 631 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (addhh)->hh_next = head.hh_head; \ head 633 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (head.hh_head != NULL) { (head).hh_head->hh_prev = (addhh); } \ head 634 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head).hh_head=addhh; \ head 635 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((head.count >= ((head.expand_mult+1U) * HASH_BKT_CAPACITY_THRESH)) \ head 642 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_DEL_IN_BKT(hh,head,hh_del) \ head 643 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head).count--; \ head 644 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if ((head).hh_head == hh_del) { \ head 645 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head).hh_head = hh_del->hh_next; \ head 735 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) head 736 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_SRT(hh,head,cmpfcn) \ head 741 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (head != NULL) { \ head 744 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h _hs_list = &((head)->hh); \ head 758 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 767 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 774 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 778 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h cmpfcn(DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_p)), \ head 779 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_q))) \ head 785 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 792 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->hho)) : NULL); \ head 797 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_e) : NULL); \ head 803 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ELMT_FROM_HH((head)->hh.tbl,_hs_tail) : NULL); \ head 814 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->tail = _hs_tail; \ head 815 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h DECLTYPE_ASSIGN(head,ELMT_FROM_HH((head)->hh.tbl, _hs_list)); \ head 819 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_FSCK(hh,head); \ head 866 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_CLEAR(hh,head) \ head 868 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h if (head != NULL) { \ head 869 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl->buckets, \ head 870 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket)); \ head 871 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h HASH_BLOOM_FREE((head)->hh.tbl); \ head 872 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ head 873 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (head)=NULL; \ head 877 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_OVERHEAD(hh,head) \ head 878 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ((head != NULL) ? ( \ head 879 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h (size_t)(((head)->hh.tbl->num_items * sizeof(UT_hash_handle)) + \ head 880 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h ((head)->hh.tbl->num_buckets * sizeof(UT_hash_bucket)) + \ head 885 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ITER(hh,head,el,tmp) \ head 886 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for(((el)=(head)), ((*(char**)(&(tmp)))=(char*)((head!=NULL)?(head)->hh.next:NULL)); \ head 889 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_ITER(hh,head,el,tmp) \ head 890 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for(((el)=(head)), ((tmp)=DECLTYPE(el)((head!=NULL)?(head)->hh.next:NULL)); \ head 895 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_COUNT(head) HASH_CNT(hh,head) head 896 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h #define HASH_CNT(hh,head) ((head != NULL)?((head)->hh.tbl->num_items):0U) head 44 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c ring->head = 0; head 87 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c if (NULL != ring->addr[ring->head]) { head 88 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c p = (char*)ring->addr[ring->head]; head 92 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c ring->tail = ring->head + 1; head 95 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c ring->addr[ring->head] = (char*)ptr; head 97 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c ring->tail = ring->head; head 99 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c if (ring->head == ring->size - 1) { head 100 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c ring->head = 0; head 102 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c ring->head++; head 123 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c if (ring->tail == ring->head) { head 139 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c if (ring->head == 0) { head 142 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.c p = ring->addr[ring->head - 1]; head 42 opal/mca/pmix/pmix4x/pmix/src/class/pmix_ring_buffer.h int head; head 764 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c pmix_infolist_t *info, *head; head 780 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c head = NULL; head 850 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c head = PMIX_NEW(pmix_infolist_t); head 851 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c PMIX_LOAD_KEY(head->info.key, cd->queries[n].keys[m]); head 852 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c head->info.value.type = PMIX_DATA_ARRAY; head 855 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c head->info.value.data.darray = darray; head 862 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c pmix_list_append(&cd->results, &head->super); head 1919 oshmem/mca/memheap/ptmalloc/malloc.c size_t head; /* Size and inuse bits. */ head 1991 oshmem/mca/memheap/ptmalloc/malloc.c #define cinuse(p) ((p)->head & CINUSE_BIT) head 1992 oshmem/mca/memheap/ptmalloc/malloc.c #define pinuse(p) ((p)->head & PINUSE_BIT) head 1993 oshmem/mca/memheap/ptmalloc/malloc.c #define chunksize(p) ((p)->head & ~(FLAG_BITS)) head 1995 oshmem/mca/memheap/ptmalloc/malloc.c #define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT) head 1996 oshmem/mca/memheap/ptmalloc/malloc.c #define clear_cinuse(p) ((p)->head &= ~CINUSE_BIT) head 2003 oshmem/mca/memheap/ptmalloc/malloc.c #define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~FLAG_BITS))) head 2007 oshmem/mca/memheap/ptmalloc/malloc.c #define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT) head 2015 oshmem/mca/memheap/ptmalloc/malloc.c ((p)->head = (s|PINUSE_BIT), set_foot(p, s)) head 2022 oshmem/mca/memheap/ptmalloc/malloc.c (!((p)->head & PINUSE_BIT) && ((p)->prev_foot & IS_MMAPPED_BIT)) head 2129 oshmem/mca/memheap/ptmalloc/malloc.c size_t head; head 2748 oshmem/mca/memheap/ptmalloc/malloc.c ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ head 2749 oshmem/mca/memheap/ptmalloc/malloc.c ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) head 2753 oshmem/mca/memheap/ptmalloc/malloc.c ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ head 2754 oshmem/mca/memheap/ptmalloc/malloc.c ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) head 2758 oshmem/mca/memheap/ptmalloc/malloc.c ((p)->head = (s|PINUSE_BIT|CINUSE_BIT)) head 2771 oshmem/mca/memheap/ptmalloc/malloc.c ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ head 2772 oshmem/mca/memheap/ptmalloc/malloc.c (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT), \ head 2776 oshmem/mca/memheap/ptmalloc/malloc.c ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ head 2777 oshmem/mca/memheap/ptmalloc/malloc.c (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\ head 2781 oshmem/mca/memheap/ptmalloc/malloc.c ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ head 2894 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); head 2901 oshmem/mca/memheap/ptmalloc/malloc.c size_t sz = p->head & ~INUSE_BITS; /* third-lowest bit can be set! */ head 2903 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); head 2918 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); head 2922 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD); head 2923 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0); head 2964 oshmem/mca/memheap/ptmalloc/malloc.c size_t sz = p->head & ~(PINUSE_BIT|CINUSE_BIT); head 2976 oshmem/mca/memheap/ptmalloc/malloc.c tchunkptr head = 0; head 3000 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(head == 0); /* only one node on chain has parent */ head 3001 oshmem/mca/memheap/ptmalloc/malloc.c head = u; head 3022 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(head != 0); head 3054 oshmem/mca/memheap/ptmalloc/malloc.c if (q->head != FENCEPOST_HEAD) head 3107 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { head 3172 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { head 3214 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { head 3501 oshmem/mca/memheap/ptmalloc/malloc.c (p)->head = (psize|CINUSE_BIT); head 3503 oshmem/mca/memheap/ptmalloc/malloc.c chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD; head 3504 oshmem/mca/memheap/ptmalloc/malloc.c chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0; head 3536 oshmem/mca/memheap/ptmalloc/malloc.c newp->head = (psize|CINUSE_BIT); head 3538 oshmem/mca/memheap/ptmalloc/malloc.c chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD; head 3539 oshmem/mca/memheap/ptmalloc/malloc.c chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0; head 3563 oshmem/mca/memheap/ptmalloc/malloc.c p->head = psize | PINUSE_BIT; head 3565 oshmem/mca/memheap/ptmalloc/malloc.c chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE; head 3616 oshmem/mca/memheap/ptmalloc/malloc.c q->head = tsize | PINUSE_BIT; head 3672 oshmem/mca/memheap/ptmalloc/malloc.c p->head = FENCEPOST_HEAD; head 3674 oshmem/mca/memheap/ptmalloc/malloc.c if ((char*)(&(nextp->head)) < old_end) head 3878 oshmem/mca/memheap/ptmalloc/malloc.c r->head = rsize | PINUSE_BIT; head 4154 oshmem/mca/memheap/ptmalloc/malloc.c newtop->head = newtopsize |PINUSE_BIT; head 4237 oshmem/mca/memheap/ptmalloc/malloc.c newp->head = (newsize|CINUSE_BIT); head 4522 oshmem/mca/memheap/ptmalloc/malloc.c r->head = rsize | PINUSE_BIT; head 4580 oshmem/mca/memheap/ptmalloc/malloc.c else if ((next->head & INUSE_BITS) == INUSE_BITS) { head 4596 oshmem/mca/memheap/ptmalloc/malloc.c p->head = tsize | PINUSE_BIT; head 4779 oshmem/mca/memheap/ptmalloc/malloc.c msp->head = (msize|PINUSE_BIT|CINUSE_BIT); head 4951 oshmem/mca/memheap/ptmalloc/malloc.c r->head = rsize | PINUSE_BIT; head 5003 oshmem/mca/memheap/ptmalloc/malloc.c else if ((next->head & INUSE_BITS) == INUSE_BITS) { head 5019 oshmem/mca/memheap/ptmalloc/malloc.c p->head = tsize | PINUSE_BIT;