q 81 contrib/scaling/mpi_memprobe.c opal_pmix_query_t *q; q 88 contrib/scaling/mpi_memprobe.c q = OBJ_NEW(opal_pmix_query_t); q 89 contrib/scaling/mpi_memprobe.c opal_list_append(&query, &q->super); q 90 contrib/scaling/mpi_memprobe.c opal_argv_append_nosize(&q->keys, OPAL_PMIX_QUERY_MEMORY_USAGE); q 96 contrib/scaling/mpi_memprobe.c opal_list_append(&q->qualifiers, &kv->super); q 101 contrib/scaling/mpi_memprobe.c opal_list_append(&q->qualifiers, &kv->super); q 106 contrib/scaling/mpi_memprobe.c opal_list_append(&q->qualifiers, &kv->super); q 1838 ompi/communicator/comm.c static int rankkeycompare (const void *p, const void *q) q 1845 ompi/communicator/comm.c b = (int*)q; q 80 ompi/mca/coll/libnbc/libdict/dict.c char p, q; q 83 ompi/mca/coll/libnbc/libdict/dict.c p = *a++; q = *b++; q 84 ompi/mca/coll/libnbc/libdict/dict.c if (p == 0 || p != q) q 87 ompi/mca/coll/libnbc/libdict/dict.c return (p > q) - (p < q); q 176 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_node *node, *parent = NULL, *q = NULL; q 199 ompi/mca/coll/libnbc/libdict/hb_tree.c q = parent; q 215 ompi/mca/coll/libnbc/libdict/hb_tree.c while (parent != q) { q 220 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q) { q 221 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q->llink == node) { q 222 ompi/mca/coll/libnbc/libdict/hb_tree.c if (--q->bal == -2) { q 223 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q->llink->bal > 0) q 224 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_left(tree, q->llink); q 225 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_right(tree, q); q 228 ompi/mca/coll/libnbc/libdict/hb_tree.c if (++q->bal == +2) { q 229 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q->rlink->bal < 0) q 230 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_right(tree, q->rlink); q 231 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_left(tree, q); q 243 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_node *node, *parent = NULL, *q = NULL; q 259 ompi/mca/coll/libnbc/libdict/hb_tree.c q = parent; q 275 ompi/mca/coll/libnbc/libdict/hb_tree.c while (parent != q) { q 280 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q) { q 281 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q->llink == node) { q 282 ompi/mca/coll/libnbc/libdict/hb_tree.c if (--q->bal == -2) { q 283 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q->llink->bal > 0) q 284 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_left(tree, q->llink); q 285 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_right(tree, q); q 288 ompi/mca/coll/libnbc/libdict/hb_tree.c if (++q->bal == +2) { q 289 ompi/mca/coll/libnbc/libdict/hb_tree.c if (q->rlink->bal < 0) q 290 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_right(tree, q->rlink); q 291 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_left(tree, q); q 35 ompi/mca/common/ompio/common_ompio_print_queue.c struct mca_common_ompio_print_queue *q=NULL; q 38 ompi/mca/common/ompio/common_ompio_print_queue.c q = (struct mca_common_ompio_print_queue *) malloc ( sizeof(mca_common_ompio_print_queue)); q 39 ompi/mca/common/ompio/common_ompio_print_queue.c if ( NULL == q ) { q 42 ompi/mca/common/ompio/common_ompio_print_queue.c q->first = 0; q 43 ompi/mca/common/ompio/common_ompio_print_queue.c q->last = MCA_COMMON_OMPIO_QUEUESIZE - 1; q 44 ompi/mca/common/ompio/common_ompio_print_queue.c q->count = 0; q 46 ompi/mca/common/ompio/common_ompio_print_queue.c *r = q; q 50 ompi/mca/common/ompio/common_ompio_print_queue.c int mca_common_ompio_register_print_entry ( struct mca_common_ompio_print_queue *q, q 53 ompi/mca/common/ompio/common_ompio_print_queue.c if (q->count >= MCA_COMMON_OMPIO_QUEUESIZE){ q 57 ompi/mca/common/ompio/common_ompio_print_queue.c q->last = (q->last + 1) % MCA_COMMON_OMPIO_QUEUESIZE; q 58 ompi/mca/common/ompio/common_ompio_print_queue.c q->entry[q->last] = x; q 59 ompi/mca/common/ompio/common_ompio_print_queue.c q->count = q->count + 1; q 65 ompi/mca/common/ompio/common_ompio_print_queue.c int mca_common_ompio_unregister_print_entry ( struct mca_common_ompio_print_queue *q, q 69 ompi/mca/common/ompio/common_ompio_print_queue.c if (q->count <= 0){ q 73 ompi/mca/common/ompio/common_ompio_print_queue.c *x = q->entry[q->first]; q 74 ompi/mca/common/ompio/common_ompio_print_queue.c q->first = (q->first+1) % MCA_COMMON_OMPIO_QUEUESIZE; q 75 ompi/mca/common/ompio/common_ompio_print_queue.c q->count = q->count - 1; q 81 ompi/mca/common/ompio/common_ompio_print_queue.c int mca_common_ompio_empty_print_queue( struct mca_common_ompio_print_queue *q) q 83 ompi/mca/common/ompio/common_ompio_print_queue.c if (q->count == 0) { q 90 ompi/mca/common/ompio/common_ompio_print_queue.c int mca_common_ompio_full_print_queue( struct mca_common_ompio_print_queue *q) q 92 ompi/mca/common/ompio/common_ompio_print_queue.c if (q->count < MCA_COMMON_OMPIO_QUEUESIZE) { q 100 ompi/mca/common/ompio/common_ompio_print_queue.c int mca_common_ompio_print_time_info( struct mca_common_ompio_print_queue *q, q 109 ompi/mca/common/ompio/common_ompio_print_queue.c nprocs_for_coll = q->entry[0].nprocs_for_coll; q 147 ompi/mca/common/ompio/common_ompio_print_queue.c if (q->count > 0){ q 148 ompi/mca/common/ompio/common_ompio_print_queue.c for (i=0; i < q->count; i++){ q 155 ompi/mca/common/ompio/common_ompio_print_queue.c time_details[j] += q->entry[i].time[j]; q 157 ompi/mca/common/ompio/common_ompio_print_queue.c time_details[3] = q->entry[i].aggregator; q 49 ompi/mca/common/ompio/common_ompio_print_queue.h OMPI_DECLSPEC int mca_common_ompio_register_print_entry (struct mca_common_ompio_print_queue *q, q 52 ompi/mca/common/ompio/common_ompio_print_queue.h OMPI_DECLSPEC int mca_common_ompio_unregister_print_entry (struct mca_common_ompio_print_queue *q, q 55 ompi/mca/common/ompio/common_ompio_print_queue.h OMPI_DECLSPEC int mca_common_ompio_empty_print_queue( struct mca_common_ompio_print_queue *q); q 57 ompi/mca/common/ompio/common_ompio_print_queue.h OMPI_DECLSPEC int mca_common_ompio_full_print_queue( struct mca_common_ompio_print_queue *q); q 59 ompi/mca/common/ompio/common_ompio_print_queue.h OMPI_DECLSPEC int mca_common_ompio_initialize_print_queue(struct mca_common_ompio_print_queue **q); q 61 ompi/mca/common/ompio/common_ompio_print_queue.h OMPI_DECLSPEC int mca_common_ompio_print_time_info( struct mca_common_ompio_print_queue *q, q 47 ompi/mca/topo/base/topo_base_cart_shift.c int srcord, destord, i, *d, *q; q 63 ompi/mca/topo/base/topo_base_cart_shift.c q = comm->c_topo->mtc.cart->periods; q 64 ompi/mca/topo/base/topo_base_cart_shift.c for (i = 0; (i < comm->c_topo->mtc.cart->ndims) && (i <= direction); ++i, ++d, ++q) { q 66 ompi/mca/topo/base/topo_base_cart_shift.c thisperiod = *q; q 17 ompi/mca/topo/treematch/treematch/PriorityQueue.c int PQ_init(PriorityQueue * const q, int size) q 20 ompi/mca/topo/treematch/treematch/PriorityQueue.c q->size = size; q 21 ompi/mca/topo/treematch/treematch/PriorityQueue.c q->elements = malloc(sizeof(QueueElement *) * size); q 23 ompi/mca/topo/treematch/treematch/PriorityQueue.c q->elements[i]=NULL; q 24 ompi/mca/topo/treematch/treematch/PriorityQueue.c return fiboTreeInit((FiboTree *)q, compFunc); q 27 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_exit(PriorityQueue * const q) q 31 ompi/mca/topo/treematch/treematch/PriorityQueue.c for(i = 0; i < q->size; i++) q 33 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(q->elements[i] != NULL) q 34 ompi/mca/topo/treematch/treematch/PriorityQueue.c free(q->elements[i]); q 36 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(q->elements != NULL) q 37 ompi/mca/topo/treematch/treematch/PriorityQueue.c free(q->elements); q 38 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeExit((FiboTree *)q); q 40 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_free(PriorityQueue * const q) q 43 ompi/mca/topo/treematch/treematch/PriorityQueue.c for(i = 0; i < q->size; i++) q 45 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(q->elements[i] != NULL) q 46 ompi/mca/topo/treematch/treematch/PriorityQueue.c free(q->elements[i]); q 48 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeFree((FiboTree *)q); q 51 ompi/mca/topo/treematch/treematch/PriorityQueue.c int PQ_isEmpty(PriorityQueue * const q) q 53 ompi/mca/topo/treematch/treematch/PriorityQueue.c FiboTree * tree = (FiboTree *)q; q 60 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_insertElement(PriorityQueue * const q, QueueElement * const e) q 62 ompi/mca/topo/treematch/treematch/PriorityQueue.c if(e->value >= 0 && e->value < q->size) q 64 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeAdd((FiboTree *)q, (FiboNode *)(e)); q 65 ompi/mca/topo/treematch/treematch/PriorityQueue.c q->elements[e->value] = e; q 69 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_deleteElement(PriorityQueue * const q, QueueElement * const e) q 71 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeDel((FiboTree *)q, (FiboNode *)(e)); q 72 ompi/mca/topo/treematch/treematch/PriorityQueue.c q->elements[e->value] = NULL; q 76 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_insert(PriorityQueue * const q, int val, double key) q 78 ompi/mca/topo/treematch/treematch/PriorityQueue.c if( val >= 0 && val < q->size) q 83 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); q 87 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_delete(PriorityQueue * const q, int val) q 89 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; q 90 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); q 94 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * PQ_findMaxElement(PriorityQueue * const q) q 96 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = (QueueElement *)(fiboTreeMin((FiboTree *)q)); q 99 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * PQ_deleteMaxElement(PriorityQueue * const q) q 101 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = (QueueElement *)(fiboTreeMin((FiboTree *)q)); q 104 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); q 109 ompi/mca/topo/treematch/treematch/PriorityQueue.c double PQ_findMaxKey(PriorityQueue * const q) q 111 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = PQ_findMaxElement(q); q 117 ompi/mca/topo/treematch/treematch/PriorityQueue.c int PQ_deleteMax(PriorityQueue * const q) q 119 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = PQ_deleteMaxElement(q); q 127 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_increaseElementKey(PriorityQueue * const q, QueueElement * const e, double i) q 131 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); q 133 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); q 136 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_decreaseElementKey(PriorityQueue * const q, QueueElement * const e, double i) q 140 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); q 142 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); q 145 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_adjustElementKey(PriorityQueue * const q, QueueElement * const e, double i) q 149 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_deleteElement(q, e); q 151 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_insertElement(q, e); q 155 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_increaseKey(PriorityQueue * const q, int val, double i) q 157 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; q 159 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_increaseElementKey(q, e, i); q 162 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_decreaseKey(PriorityQueue * const q, int val, double i) q 164 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; q 166 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_decreaseElementKey(q, e, i); q 169 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_adjustKey(PriorityQueue * const q, int val, double i) q 171 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * e = q->elements[val]; q 173 ompi/mca/topo/treematch/treematch/PriorityQueue.c PQ_adjustElementKey(q, e, i); q 290 opal/mca/btl/smcuda/btl_smcuda.h volatile void **q = (volatile void **) RELATIVE2VIRTUAL(fifo->queue); q 294 opal/mca/btl/smcuda/btl_smcuda.h if ( SM_FIFO_FREE != q[fifo->head] ) q 298 opal/mca/btl/smcuda/btl_smcuda.h q[fifo->head] = value; q 87 opal/mca/event/libevent2022/libevent/defer-internal.h #define LOCK_DEFERRED_QUEUE(q) \ q 88 opal/mca/event/libevent2022/libevent/defer-internal.h EVLOCK_LOCK((q)->lock, 0) q 89 opal/mca/event/libevent2022/libevent/defer-internal.h #define UNLOCK_DEFERRED_QUEUE(q) \ q 90 opal/mca/event/libevent2022/libevent/defer-internal.h EVLOCK_UNLOCK((q)->lock, 0) q 1242 opal/mca/event/libevent2022/libevent/evdns.c struct evdns_server_question *q; q 1249 opal/mca/event/libevent2022/libevent/evdns.c q = mm_malloc(sizeof(struct evdns_server_question) + namelen); q 1250 opal/mca/event/libevent2022/libevent/evdns.c if (!q) q 1252 opal/mca/event/libevent2022/libevent/evdns.c q->type = type; q 1253 opal/mca/event/libevent2022/libevent/evdns.c q->dns_question_class = class; q 1254 opal/mca/event/libevent2022/libevent/evdns.c memcpy(q->name, tmp_name, namelen+1); q 1255 opal/mca/event/libevent2022/libevent/evdns.c server_req->base.questions[server_req->base.nquestions++] = q; q 151 opal/mca/event/libevent2022/libevent/test/regress_testutils.c while (tab->q && evutil_ascii_strcasecmp(question, tab->q) && q 152 opal/mca/event/libevent2022/libevent/test/regress_testutils.c strcmp("*", tab->q)) q 154 opal/mca/event/libevent2022/libevent/test/regress_testutils.c if (tab->q == NULL) q 33 opal/mca/event/libevent2022/libevent/test/regress_testutils.h const char *q; q 1270 opal/mca/pmix/ext2x/ext2x.c opal_pmix_query_t *q; q 1299 opal/mca/pmix/ext2x/ext2x.c OPAL_LIST_FOREACH(q, queries, opal_pmix_query_t) { q 1300 opal/mca/pmix/ext2x/ext2x.c cd->queries[n].keys = opal_argv_copy(q->keys); q 1301 opal/mca/pmix/ext2x/ext2x.c cd->queries[n].nqual = opal_list_get_size(&q->qualifiers); q 1305 opal/mca/pmix/ext2x/ext2x.c OPAL_LIST_FOREACH(ival, &q->qualifiers, opal_value_t) { q 958 opal/mca/pmix/ext2x/ext2x_server_north.c opal_pmix_query_t *q; q 984 opal/mca/pmix/ext2x/ext2x_server_north.c q = OBJ_NEW(opal_pmix_query_t); q 987 opal/mca/pmix/ext2x/ext2x_server_north.c opal_list_append(&opalcaddy->info, &q->super); q 988 opal/mca/pmix/ext2x/ext2x_server_north.c q->keys = opal_argv_copy(queries[n].keys); q 991 opal/mca/pmix/ext2x/ext2x_server_north.c opal_list_append(&q->qualifiers, &oinfo->super); q 1500 opal/mca/pmix/ext3x/ext3x.c opal_pmix_query_t *q; q 1529 opal/mca/pmix/ext3x/ext3x.c OPAL_LIST_FOREACH(q, queries, opal_pmix_query_t) { q 1530 opal/mca/pmix/ext3x/ext3x.c cd->queries[n].keys = opal_argv_copy(q->keys); q 1531 opal/mca/pmix/ext3x/ext3x.c cd->queries[n].nqual = opal_list_get_size(&q->qualifiers); q 1535 opal/mca/pmix/ext3x/ext3x.c OPAL_LIST_FOREACH(ival, &q->qualifiers, opal_value_t) { q 974 opal/mca/pmix/ext3x/ext3x_server_north.c opal_pmix_query_t *q; q 1000 opal/mca/pmix/ext3x/ext3x_server_north.c q = OBJ_NEW(opal_pmix_query_t); q 1003 opal/mca/pmix/ext3x/ext3x_server_north.c opal_list_append(&opalcaddy->info, &q->super); q 1004 opal/mca/pmix/ext3x/ext3x_server_north.c q->keys = opal_argv_copy(queries[n].keys); q 1007 opal/mca/pmix/ext3x/ext3x_server_north.c opal_list_append(&q->qualifiers, &oinfo->super); q 438 opal/mca/pmix/pmix4x/pmix/examples/debugger.c myquery_data_t *q; q 446 opal/mca/pmix/pmix4x/pmix/examples/debugger.c q = (myquery_data_t*)malloc(sizeof(myquery_data_t)); q 447 opal/mca/pmix/pmix4x/pmix/examples/debugger.c DEBUG_CONSTRUCT_LOCK(&q->lock); q 448 opal/mca/pmix/pmix4x/pmix/examples/debugger.c if (PMIX_SUCCESS != (rc = PMIx_Query_info_nb(query, nq, cbfunc, (void*)q))) { q 452 opal/mca/pmix/pmix4x/pmix/examples/debugger.c DEBUG_WAIT_THREAD(&q->lock); q 453 opal/mca/pmix/pmix4x/pmix/examples/debugger.c DEBUG_DESTRUCT_LOCK(&q->lock); q 455 opal/mca/pmix/pmix4x/pmix/examples/debugger.c if (NULL == q->info) { q 460 opal/mca/pmix/pmix4x/pmix/examples/debugger.c if (PMIX_STRING != q->info[0].value.type) { q 461 opal/mca/pmix/pmix4x/pmix/examples/debugger.c fprintf(stderr, "Query returned incorrect data type: %d\n", q->info[0].value.type); q 464 opal/mca/pmix/pmix4x/pmix/examples/debugger.c if (NULL == q->info[0].value.data.string) { q 469 opal/mca/pmix/pmix4x/pmix/examples/debugger.c fprintf(stderr, "Query returned %s\n", q->info[0].value.data.string); q 85 opal/mca/pmix/pmix4x/pmix/examples/examples.h #define DEBUG_CONSTRUCT_MYQUERY(q) \ q 87 opal/mca/pmix/pmix4x/pmix/examples/examples.h DEBUG_CONSTRUCT_LOCK(&((q)->lock)); \ q 88 opal/mca/pmix/pmix4x/pmix/examples/examples.h (q)->info = NULL; \ q 89 opal/mca/pmix/pmix4x/pmix/examples/examples.h (q)->ninfo = 0; \ q 92 opal/mca/pmix/pmix4x/pmix/examples/examples.h #define DEBUG_DESTRUCT_MYQUERY(q) \ q 94 opal/mca/pmix/pmix4x/pmix/examples/examples.h DEBUG_DESTRUCT_LOCK(&((q)->lock)); \ q 95 opal/mca/pmix/pmix4x/pmix/examples/examples.h if (NULL != (q)->info) { \ q 96 opal/mca/pmix/pmix4x/pmix/examples/examples.h PMIX_INFO_FREE((q)->info, (q)->ninfo); \ q 454 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/bfrops.h #define PMIX_BFROPS_VALUE_CMP(r, p, q, s) \ q 455 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/bfrops.h (r) = (p)->nptr->compat.bfrops->value_cmp(q, s) q 708 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/tcp/ptl_tcp.c pmix_ptl_queue_t *q; q 714 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/tcp/ptl_tcp.c q = PMIX_NEW(pmix_ptl_queue_t); q 716 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/tcp/ptl_tcp.c q->peer = pr; q 717 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/tcp/ptl_tcp.c q->buf = bfr; q 718 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/tcp/ptl_tcp.c q->tag = tag; q 719 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/tcp/ptl_tcp.c PMIX_THREADSHIFT(q, pmix_ptl_base_send); q 260 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c pmix_ptl_queue_t *q; q 266 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c q = PMIX_NEW(pmix_ptl_queue_t); q 268 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c q->peer = peer; q 269 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c q->buf = bfr; q 270 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c q->tag = tag; q 271 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c PMIX_THREADSHIFT(q, pmix_usock_send); q 1487 opal/mca/pmix/pmix4x/pmix4x.c opal_pmix_query_t *q; q 1516 opal/mca/pmix/pmix4x/pmix4x.c OPAL_LIST_FOREACH(q, queries, opal_pmix_query_t) { q 1517 opal/mca/pmix/pmix4x/pmix4x.c cd->queries[n].keys = opal_argv_copy(q->keys); q 1518 opal/mca/pmix/pmix4x/pmix4x.c cd->queries[n].nqual = opal_list_get_size(&q->qualifiers); q 1522 opal/mca/pmix/pmix4x/pmix4x.c OPAL_LIST_FOREACH(ival, &q->qualifiers, opal_value_t) { q 973 opal/mca/pmix/pmix4x/pmix4x_server_north.c opal_pmix_query_t *q; q 999 opal/mca/pmix/pmix4x/pmix4x_server_north.c q = OBJ_NEW(opal_pmix_query_t); q 1002 opal/mca/pmix/pmix4x/pmix4x_server_north.c opal_list_append(&opalcaddy->info, &q->super); q 1003 opal/mca/pmix/pmix4x/pmix4x_server_north.c q->keys = opal_argv_copy(queries[n].keys); q 1006 opal/mca/pmix/pmix4x/pmix4x_server_north.c opal_list_append(&q->qualifiers, &oinfo->super); q 99 orte/mca/ess/base/ess_base_std_tool.c opal_pmix_query_t *q; q 158 orte/mca/ess/base/ess_base_std_tool.c q = OBJ_NEW(opal_pmix_query_t); q 159 orte/mca/ess/base/ess_base_std_tool.c opal_argv_append_nosize(&q->keys, OPAL_PMIX_SERVER_URI); q 160 orte/mca/ess/base/ess_base_std_tool.c opal_list_append(&info, &q->super); q 486 orte/orted/pmix/pmix_server_gen.c opal_pmix_query_t *q; q 513 orte/orted/pmix/pmix_server_gen.c OPAL_LIST_FOREACH(q, cd->info, opal_pmix_query_t) { q 514 orte/orted/pmix/pmix_server_gen.c for (n=0; NULL != q->keys[n]; n++) { q 517 orte/orted/pmix/pmix_server_gen.c ORTE_NAME_PRINT(ORTE_PROC_MY_NAME), q->keys[n]); q 518 orte/orted/pmix/pmix_server_gen.c if (0 == strcmp(q->keys[n], OPAL_PMIX_QUERY_NAMESPACES)) { q 539 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_QUERY_SPAWN_SUPPORT)) { q 559 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_QUERY_DEBUG_SUPPORT)) { q 571 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_QUERY_MEMORY_USAGE)) { q 576 orte/orted/pmix/pmix_server_gen.c if (0 == opal_list_get_size(&q->qualifiers)) { q 587 orte/orted/pmix/pmix_server_gen.c OPAL_LIST_FOREACH(kv, &q->qualifiers, opal_value_t) { q 651 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_TIME_REMAINING)) { q 660 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_HWLOC_XML_V1)) { q 684 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_HWLOC_XML_V2)) { q 701 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_SERVER_URI)) { q 708 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_QUERY_PROC_TABLE)) { q 711 orte/orted/pmix/pmix_server_gen.c OPAL_LIST_FOREACH(kv, &q->qualifiers, opal_value_t) { q 757 orte/orted/pmix/pmix_server_gen.c } else if (0 == strcmp(q->keys[n], OPAL_PMIX_QUERY_LOCAL_PROC_TABLE)) { q 760 orte/orted/pmix/pmix_server_gen.c OPAL_LIST_FOREACH(kv, &q->qualifiers, opal_value_t) { q 3046 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr q; q 3053 oshmem/mca/memheap/ptmalloc/malloc.c q = next_chunk(p); q 3054 oshmem/mca/memheap/ptmalloc/malloc.c if (q->head != FENCEPOST_HEAD) q 3055 oshmem/mca/memheap/ptmalloc/malloc.c do_check_inuse_chunk(m, q); q 3103 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr q = align_as_chunk(s->base); q 3105 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(pinuse(q)); q 3106 oshmem/mca/memheap/ptmalloc/malloc.c while (segment_holds(s, q) && q 3107 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { q 3108 oshmem/mca/memheap/ptmalloc/malloc.c sum += chunksize(q); q 3109 oshmem/mca/memheap/ptmalloc/malloc.c if (cinuse(q)) { q 3110 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(!bin_find(m, q)); q 3111 oshmem/mca/memheap/ptmalloc/malloc.c do_check_inuse_chunk(m, q); q 3114 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert(q == m->dv || bin_find(m, q)); q 3116 oshmem/mca/memheap/ptmalloc/malloc.c do_check_free_chunk(m, q); q 3118 oshmem/mca/memheap/ptmalloc/malloc.c lastq = q; q 3119 oshmem/mca/memheap/ptmalloc/malloc.c q = next_chunk(q); q 3170 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr q = align_as_chunk(s->base); q 3171 oshmem/mca/memheap/ptmalloc/malloc.c while (segment_holds(s, q) && q 3172 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { q 3173 oshmem/mca/memheap/ptmalloc/malloc.c size_t sz = chunksize(q); q 3175 oshmem/mca/memheap/ptmalloc/malloc.c if (!cinuse(q)) { q 3179 oshmem/mca/memheap/ptmalloc/malloc.c q = next_chunk(q); q 3212 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr q = align_as_chunk(s->base); q 3213 oshmem/mca/memheap/ptmalloc/malloc.c while (segment_holds(s, q) && q 3214 oshmem/mca/memheap/ptmalloc/malloc.c q != m->top && q->head != FENCEPOST_HEAD) { q 3215 oshmem/mca/memheap/ptmalloc/malloc.c if (!cinuse(q)) q 3216 oshmem/mca/memheap/ptmalloc/malloc.c used -= chunksize(q); q 3217 oshmem/mca/memheap/ptmalloc/malloc.c q = next_chunk(q); q 3604 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr q = chunk_plus_offset(p, nb); q 3608 oshmem/mca/memheap/ptmalloc/malloc.c dl_assert((char*)oldfirst > (char*)q); q 3615 oshmem/mca/memheap/ptmalloc/malloc.c m->top = q; q 3616 oshmem/mca/memheap/ptmalloc/malloc.c q->head = tsize | PINUSE_BIT; q 3617 oshmem/mca/memheap/ptmalloc/malloc.c check_top_chunk(m, q); q 3621 oshmem/mca/memheap/ptmalloc/malloc.c m->dv = q; q 3622 oshmem/mca/memheap/ptmalloc/malloc.c set_size_and_pinuse_of_free_chunk(q, dsize); q 3631 oshmem/mca/memheap/ptmalloc/malloc.c set_free_with_pinuse(q, qsize, oldfirst); q 3632 oshmem/mca/memheap/ptmalloc/malloc.c insert_chunk(m, q, qsize); q 3633 oshmem/mca/memheap/ptmalloc/malloc.c check_free_chunk(m, q); q 3683 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr q = (mchunkptr)old_top; q 3685 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr tn = chunk_plus_offset(q, psize); q 3686 oshmem/mca/memheap/ptmalloc/malloc.c set_free_with_pinuse(q, psize, tn); q 3687 oshmem/mca/memheap/ptmalloc/malloc.c insert_chunk(m, q, psize);