elements           17 ompi/mca/io/romio321/romio/test/status.c     int *buf, i, rank, nints, len, count, elements;
elements           64 ompi/mca/io/romio321/romio/test/status.c     MPI_Get_elements(&status, MPI_INT, &elements);
elements           70 ompi/mca/io/romio321/romio/test/status.c 	if (elements != nints) {
elements           72 ompi/mca/io/romio321/romio/test/status.c 	    printf("elements = %d, should be %d\n", elements, nints);
elements           21 ompi/mca/topo/treematch/treematch/PriorityQueue.c   q->elements = malloc(sizeof(QueueElement *) * size);
elements           23 ompi/mca/topo/treematch/treematch/PriorityQueue.c     q->elements[i]=NULL;
elements           33 ompi/mca/topo/treematch/treematch/PriorityQueue.c       if(q->elements[i] != NULL)
elements           34 ompi/mca/topo/treematch/treematch/PriorityQueue.c 	free(q->elements[i]);
elements           36 ompi/mca/topo/treematch/treematch/PriorityQueue.c   if(q->elements != NULL)
elements           37 ompi/mca/topo/treematch/treematch/PriorityQueue.c     free(q->elements);
elements           45 ompi/mca/topo/treematch/treematch/PriorityQueue.c       if(q->elements[i] != NULL)
elements           46 ompi/mca/topo/treematch/treematch/PriorityQueue.c 	free(q->elements[i]);
elements           65 ompi/mca/topo/treematch/treematch/PriorityQueue.c       q->elements[e->value] = e;
elements           72 ompi/mca/topo/treematch/treematch/PriorityQueue.c   q->elements[e->value] = NULL;
elements           89 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
elements          157 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
elements          164 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
elements          171 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
elements           21 ompi/mca/topo/treematch/treematch/PriorityQueue.h   QueueElement ** elements; /*a vector of element with their value as key so we can easily retreive an element from its value */
elements           48 test/class/opal_list.c     test_data_t *elements, *ele;
elements           81 test/class/opal_list.c     elements=(test_data_t *)malloc(sizeof(test_data_t)*size_elements);
elements           82 test/class/opal_list.c     assert(elements);
elements           84 test/class/opal_list.c         OBJ_CONSTRUCT(elements + i, test_data_t);
elements           85 test/class/opal_list.c         (elements+i)->data=i;
elements           90 test/class/opal_list.c         opal_list_append(&list,(opal_list_item_t *)(elements+i));
elements          186 test/class/opal_list.c     opal_list_prepend(&list,(opal_list_item_t *)elements);
elements          229 test/class/opal_list.c     opal_list_append(&list,(opal_list_item_t *)(elements+size_elements-1));
elements          257 test/class/opal_list.c         opal_list_remove_item(&list,(opal_list_item_t *)(elements+indx));
elements          283 test/class/opal_list.c     i=opal_list_insert(&list,(opal_list_item_t *)(elements+indx),indx);
elements          344 test/class/opal_list.c     if (NULL != elements) free(elements);
elements           53 test/class/opal_tree.c     test_data_t *elements;
elements           91 test/class/opal_tree.c     elements=(test_data_t *)malloc(sizeof(test_data_t)*total_elements);
elements           92 test/class/opal_tree.c     assert(elements);
elements           94 test/class/opal_tree.c         OBJ_CONSTRUCT(elements + i, test_data_t);
elements           95 test/class/opal_tree.c         (elements+i)->data=i;
elements          105 test/class/opal_tree.c             opal_tree_add_child(item,(opal_tree_item_t *)(elements+
elements          257 test/class/opal_tree.c     if (NULL != elements) free(elements);