next              290 contrib/build-mca-comps-outside-of-tree/btl_tcp2_component.c     opal_list_item_t* next;
next              322 contrib/build-mca-comps-outside-of-tree/btl_tcp2_component.c         item = next) {
next              324 contrib/build-mca-comps-outside-of-tree/btl_tcp2_component.c         next = opal_list_get_next(item);
next               18 examples/Ring.java 	int next;
next               29 examples/Ring.java 	next = (myrank + 1) % size;
next               39 examples/Ring.java 	    System.out.println("Process 0 sending " + message[0] + " to rank " + next + " (" + size + " processes in ring)");
next               40 examples/Ring.java 	    MPI.COMM_WORLD.send(message, 1, MPI.INT, next, tag);
next               59 examples/Ring.java 	    MPI.COMM_WORLD.send(message, 1, MPI.INT, next, tag);
next               15 examples/ring_c.c     int rank, size, next, prev, message, tag = 201;
next               27 examples/ring_c.c     next = (rank + 1) % size;
next               38 examples/ring_c.c                message, next, tag, size);
next               39 examples/ring_c.c         MPI_Send(&message, 1, MPI_INT, next, tag, MPI_COMM_WORLD);
next               40 examples/ring_c.c         printf("Process 0 sent to %d\n", next);
next               60 examples/ring_c.c         MPI_Send(&message, 1, MPI_INT, next, tag, MPI_COMM_WORLD);
next               22 examples/ring_cxx.cc     int rank, size, next, prev, message, tag = 201;
next               34 examples/ring_cxx.cc     next = (rank + 1) % size;
next               43 examples/ring_cxx.cc         std::cout << "Process 0 sending " << message << " to " << next
next               46 examples/ring_cxx.cc         MPI::COMM_WORLD.Send(&message, 1, MPI::INT, next, tag);
next               47 examples/ring_cxx.cc         std::cout << "Process 0 sent to " << next << std::endl;
next               67 examples/ring_cxx.cc         MPI::COMM_WORLD.Send(&message, 1, MPI::INT, next, tag);
next               21 examples/ring_oshmem_c.c     int proc, nproc, next;
next               31 examples/ring_oshmem_c.c     next = (proc + 1) % nproc;
next               35 examples/ring_oshmem_c.c         printf("Process 0 puts message %d to %d (%d processes in ring)\n", message, next, nproc);
next               36 examples/ring_oshmem_c.c         shmem_int_put(&rbuf, &message, 1, next);
next               53 examples/ring_oshmem_c.c         shmem_int_put(&rbuf, &message, 1, next);
next              101 ompi/communicator/comm_request.c     ompi_comm_request_t *request, *next;
next              111 ompi/communicator/comm_request.c     OPAL_LIST_FOREACH_SAFE(request, next, &ompi_comm_requests_active, ompi_comm_request_t) {
next              189 ompi/communicator/comm_request.c     ompi_comm_request_item_t *item, *next;
next              193 ompi/communicator/comm_request.c     OPAL_LIST_FOREACH_SAFE(item, next, &request->schedule, ompi_comm_request_item_t) {
next              256 ompi/debuggers/ompi_msgq_dll.c     for (;comm; comm = comm->next) {
next              568 ompi/debuggers/ompi_msgq_dll.c     for( ; comm; comm = comm->next ) {
next              666 ompi/debuggers/ompi_msgq_dll.c             old->next                 = extra->communicator_list;
next              708 ompi/debuggers/ompi_msgq_dll.c             commp = &(*commp)->next;        /* go to the next communicator */
next              710 ompi/debuggers/ompi_msgq_dll.c             *commp = comm->next;			/* Remove from the list, *commp now points to the next */
next              725 ompi/debuggers/ompi_msgq_dll.c         for (i=0; i<commcount; i++, comm=comm->next)
next              735 ompi/debuggers/ompi_msgq_dll.c             comm->next = extra->communicator_list;
next              824 ompi/debuggers/ompi_msgq_dll.c     extra->current_communicator = extra->current_communicator->next;
next             1310 ompi/debuggers/ompi_msgq_dll.c             communicator_t *next = comm->next;
next             1316 ompi/debuggers/ompi_msgq_dll.c             comm = next;
next               66 ompi/debuggers/ompi_msgq_dll_defs.h     struct communicator_t * next;
next               66 ompi/mca/coll/base/coll_base_find_available.c     mca_base_component_list_item_t *cli, *next;
next               72 ompi/mca/coll/base/coll_base_find_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &ompi_coll_base_framework.framework_components, mca_base_component_list_item_t) {
next              427 ompi/mca/coll/libnbc/coll_libnbc_component.c     ompi_coll_libnbc_request_t* request, *next;
next              442 ompi/mca/coll/libnbc/coll_libnbc_component.c         OPAL_LIST_FOREACH_SAFE(request, next, &mca_coll_libnbc_component.active_requests,
next              348 ompi/mca/coll/portals4/coll_portals4.h         ptl_rank_t *prev, ptl_rank_t *next)
next              353 ompi/mca/coll/portals4/coll_portals4.h     *next = (rank == (np - 1)) ?
next             5206 ompi/mca/crcp/bkmrk/crcp_bkmrk_pml.c     opal_list_item_t* next = NULL;
next             5226 ompi/mca/crcp/bkmrk/crcp_bkmrk_pml.c             item = next) {
next             5228 ompi/mca/crcp/bkmrk/crcp_bkmrk_pml.c             next = opal_list_get_next(item);
next               46 ompi/mca/fbtl/base/fbtl_base_find_available.c     mca_base_component_list_item_t *cli, *next;
next               52 ompi/mca/fbtl/base/fbtl_base_find_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &ompi_fbtl_base_framework.framework_components, mca_base_component_list_item_t) {
next               41 ompi/mca/fcoll/base/fcoll_base_find_available.c     mca_base_component_list_item_t *cli, *next;
next               47 ompi/mca/fcoll/base/fcoll_base_find_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &ompi_fcoll_base_framework.framework_components, mca_base_component_list_item_t) {
next               53 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_read_all.c     struct flat_list_node *next;
next              264 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_read_all.c 	flat_buf->next = NULL;
next               53 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c     struct flat_list_node *next;
next              308 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c 	flat_buf->next = NULL;
next               43 ompi/mca/fs/base/fs_base_find_available.c     mca_base_component_list_item_t *cli, *next;
next               49 ompi/mca/fs/base/fs_base_find_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &ompi_fs_base_framework.framework_components, mca_base_component_list_item_t) {
next               62 ompi/mca/io/base/io_base_find_available.c     mca_base_component_list_item_t *cli, *next;
next               67 ompi/mca/io/base/io_base_find_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &ompi_io_base_framework.framework_components, mca_base_component_list_item_t) {
next              258 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrstr.c 	    flat_file = flat_file->next;
next              282 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_read.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              383 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_write.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              175 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              249 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c     while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              271 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              637 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c     while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               85 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_io_dtype.c 		flat_file_p = flat_file_p->next;
next               67 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              200 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c     while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               83 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              242 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c     while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               48 ompi/mca/io/romio321/romio/adio/ad_testfs/ad_testfs_seek.c         while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               69 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              195 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c     while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               83 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              222 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c     while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              289 ompi/mca/io/romio321/romio/adio/common/ad_coll_build_req_new.c 	fr_node_p = fr_node_p->next;
next               70 ompi/mca/io/romio321/romio/adio/common/ad_coll_exch_new.c     while (flat_node_p->next)
next               74 ompi/mca/io/romio321/romio/adio/common/ad_coll_exch_new.c 	flat_node_p = flat_node_p->next;
next               80 ompi/mca/io/romio321/romio/adio/common/ad_coll_exch_new.c     if ((flat_node_p->next = (ADIOI_Flatlist_node *) ADIOI_Malloc
next               85 ompi/mca/io/romio321/romio/adio/common/ad_coll_exch_new.c     flat_node_p = flat_node_p->next;
next               99 ompi/mca/io/romio321/romio/adio/common/ad_coll_exch_new.c     flat_node_p->next = NULL;
next              167 ompi/mca/io/romio321/romio/adio/common/ad_coll_exch_new.c             flat_file_p = flat_file_p->next; 
next              482 ompi/mca/io/romio321/romio/adio/common/ad_coll_exch_new.c 	    fr_node_p = fr_node_p->next;
next               12 ompi/mca/io/romio321/romio/adio/common/ad_end.c     ADIOI_Flatlist_node *curr, *next;
next               31 ompi/mca/io/romio321/romio/adio/common/ad_end.c 	next = curr->next;
next               33 ompi/mca/io/romio321/romio/adio/common/ad_end.c 	curr = next;
next               47 ompi/mca/io/romio321/romio/adio/common/ad_end.c         datarep_next = datarep->next;
next               66 ompi/mca/io/romio321/romio/adio/common/ad_init.c     ADIOI_Flatlist->next = NULL;
next              745 ompi/mca/io/romio321/romio/adio/common/ad_io_coll.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              355 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              160 ompi/mca/io/romio321/romio/adio/common/ad_read_str.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              132 ompi/mca/io/romio321/romio/adio/common/ad_read_str_naive.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               41 ompi/mca/io/romio321/romio/adio/common/ad_seek.c         while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               68 ompi/mca/io/romio321/romio/adio/common/ad_set_view.c 		flat_file = flat_file->next;
next              209 ompi/mca/io/romio321/romio/adio/common/ad_write_nolock.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              225 ompi/mca/io/romio321/romio/adio/common/ad_write_str.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next              132 ompi/mca/io/romio321/romio/adio/common/ad_write_str_naive.c 	while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               29 ompi/mca/io/romio321/romio/adio/common/async_list.c 	    curr->next = ADIOI_Async_avail_head+i;
next               30 ompi/mca/io/romio321/romio/adio/common/async_list.c 	    curr = curr->next;
next               32 ompi/mca/io/romio321/romio/adio/common/async_list.c 	curr->next = NULL;
next               41 ompi/mca/io/romio321/romio/adio/common/async_list.c 	    ADIOI_Malloc_async_head->next = NULL;
next               44 ompi/mca/io/romio321/romio/adio/common/async_list.c 	    ADIOI_Malloc_async_tail->next = (ADIOI_Malloc_async *)
next               46 ompi/mca/io/romio321/romio/adio/common/async_list.c 	    ADIOI_Malloc_async_tail = ADIOI_Malloc_async_tail->next;
next               48 ompi/mca/io/romio321/romio/adio/common/async_list.c 	    ADIOI_Malloc_async_tail->next = NULL;
next               53 ompi/mca/io/romio321/romio/adio/common/async_list.c     ADIOI_Async_avail_head = ADIOI_Async_avail_head->next;
next               67 ompi/mca/io/romio321/romio/adio/common/async_list.c 	ADIOI_Async_avail_tail->next = node;
next               70 ompi/mca/io/romio321/romio/adio/common/async_list.c     node->next = NULL;
next               83 ompi/mca/io/romio321/romio/adio/common/async_list.c 	ADIOI_Async_list_head->prev = ADIOI_Async_list_head->next = NULL;
next               89 ompi/mca/io/romio321/romio/adio/common/async_list.c 	curr->next = ADIOI_Malloc_async_node();
next               90 ompi/mca/io/romio321/romio/adio/common/async_list.c 	ADIOI_Async_list_tail = curr->next;
next               93 ompi/mca/io/romio321/romio/adio/common/async_list.c 	ADIOI_Async_list_tail->next = NULL;
next              144 ompi/mca/io/romio321/romio/adio/common/async_list.c 	ADIOI_Async_list_head = ADIOI_Async_list_head->next;
next              157 ompi/mca/io/romio321/romio/adio/common/async_list.c     ADIOI_Async_node *curr, *prev, *next;
next              162 ompi/mca/io/romio321/romio/adio/common/async_list.c     if (prev) prev->next = curr->next;
next              163 ompi/mca/io/romio321/romio/adio/common/async_list.c     else ADIOI_Async_list_head = curr->next;
next              165 ompi/mca/io/romio321/romio/adio/common/async_list.c     next = curr->next;
next              166 ompi/mca/io/romio321/romio/adio/common/async_list.c     if (next) next->prev = prev;
next               30 ompi/mca/io/romio321/romio/adio/common/byte_offset.c         while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               45 ompi/mca/io/romio321/romio/adio/common/eof_offset.c 	    flat_file = flat_file->next;
next              132 ompi/mca/io/romio321/romio/adio/common/flatten.c 	    flat = flat->next;
next              138 ompi/mca/io/romio321/romio/adio/common/flatten.c     flat->next = (ADIOI_Flatlist_node *)ADIOI_Malloc(sizeof(ADIOI_Flatlist_node));
next              139 ompi/mca/io/romio321/romio/adio/common/flatten.c     flat = flat->next;
next              142 ompi/mca/io/romio321/romio/adio/common/flatten.c     flat->next = NULL;
next             1276 ompi/mca/io/romio321/romio/adio/common/flatten.c 	flat = flat->next;
next             1279 ompi/mca/io/romio321/romio/adio/common/flatten.c 	prev->next = flat->next;
next             1291 ompi/mca/io/romio321/romio/adio/common/flatten.c     while (node->type != datatype) node = node->next;
next               31 ompi/mca/io/romio321/romio/adio/common/get_fp_posn.c         while (flat_file->type != fd->filetype) flat_file = flat_file->next;
next               34 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	    curr->next = ADIOI_Req_avail_head+i;
next               35 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	    curr = curr->next;
next               37 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	curr->next = NULL;
next               46 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	    ADIOI_Malloc_req_head->next = NULL;
next               49 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	    ADIOI_Malloc_req_tail->next = (ADIOI_Malloc_req *)
next               51 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	    ADIOI_Malloc_req_tail = ADIOI_Malloc_req_tail->next;
next               53 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	    ADIOI_Malloc_req_tail->next = NULL;
next               58 ompi/mca/io/romio321/romio/adio/common/req_malloc.c     ADIOI_Req_avail_head = ADIOI_Req_avail_head->next;
next               78 ompi/mca/io/romio321/romio/adio/common/req_malloc.c 	ADIOI_Req_avail_tail->next = node;
next               81 ompi/mca/io/romio321/romio/adio/common/req_malloc.c     node->next = NULL;
next               94 ompi/mca/io/romio321/romio/adio/include/adioi.h     struct ADIOI_Datarep *next; /* pointer to next datarep */
next              127 ompi/mca/io/romio321/romio/adio/include/adioi.h     struct ADIOI_Fl_node *next;  /* pointer to next node */
next               58 ompi/mca/io/romio321/romio/mpi-io/mpioimpl.h     struct MPIR_Info *next;
next               89 ompi/mca/io/romio321/romio/mpi-io/register_datarep.c     for (adio_datarep = ADIOI_Datarep_head; adio_datarep; adio_datarep = adio_datarep->next) {
next              135 ompi/mca/io/romio321/romio/mpi-io/register_datarep.c     adio_datarep->next          = ADIOI_Datarep_head;
next               45 ompi/mca/io/romio321/romio/mpi2-other/info/info_create.c     (*info)->next = 0;
next               61 ompi/mca/io/romio321/romio/mpi2-other/info/info_delete.c     curr = info->next;
next               68 ompi/mca/io/romio321/romio/mpi2-other/info/info_delete.c 	    prev->next = curr->next;
next               74 ompi/mca/io/romio321/romio/mpi2-other/info/info_delete.c 	curr = curr->next;
next               51 ompi/mca/io/romio321/romio/mpi2-other/info/info_dup.c     curr_new->next = 0;
next               53 ompi/mca/io/romio321/romio/mpi2-other/info/info_dup.c     curr_old = info->next;
next               55 ompi/mca/io/romio321/romio/mpi2-other/info/info_dup.c 	curr_new->next = (MPI_Info) ADIOI_Malloc(sizeof(struct MPIR_Info));
next               56 ompi/mca/io/romio321/romio/mpi2-other/info/info_dup.c 	curr_new = curr_new->next;
next               60 ompi/mca/io/romio321/romio/mpi2-other/info/info_dup.c 	curr_new->next = 0;
next               62 ompi/mca/io/romio321/romio/mpi2-other/info/info_dup.c 	curr_old = curr_old->next;
next               36 ompi/mca/io/romio321/romio/mpi2-other/info/info_free.c     MPI_Info curr, next;
next               43 ompi/mca/io/romio321/romio/mpi2-other/info/info_free.c     curr = (*info)->next;
next               48 ompi/mca/io/romio321/romio/mpi2-other/info/info_free.c 	next = curr->next;
next               52 ompi/mca/io/romio321/romio/mpi2-other/info/info_free.c 	curr = next;
next               74 ompi/mca/io/romio321/romio/mpi2-other/info/info_get.c     curr = info->next;
next               84 ompi/mca/io/romio321/romio/mpi2-other/info/info_get.c 	curr = curr->next;
next               46 ompi/mca/io/romio321/romio/mpi2-other/info/info_getnks.c     curr = info->next;
next               50 ompi/mca/io/romio321/romio/mpi2-other/info/info_getnks.c 	curr = curr->next;
next               53 ompi/mca/io/romio321/romio/mpi2-other/info/info_getnth.c     curr = info->next;
next               56 ompi/mca/io/romio321/romio/mpi2-other/info/info_getnth.c 	curr = curr->next;
next               65 ompi/mca/io/romio321/romio/mpi2-other/info/info_getnth.c     curr = info->next;
next               68 ompi/mca/io/romio321/romio/mpi2-other/info/info_getnth.c 	curr = curr->next;
next               63 ompi/mca/io/romio321/romio/mpi2-other/info/info_getvln.c     curr = info->next;
next               72 ompi/mca/io/romio321/romio/mpi2-other/info/info_getvln.c 	curr = curr->next;
next               76 ompi/mca/io/romio321/romio/mpi2-other/info/info_set.c     curr = info->next;
next               85 ompi/mca/io/romio321/romio/mpi2-other/info/info_set.c 	curr = curr->next;
next               89 ompi/mca/io/romio321/romio/mpi2-other/info/info_set.c 	prev->next = (MPI_Info) ADIOI_Malloc(sizeof(struct MPIR_Info));
next               90 ompi/mca/io/romio321/romio/mpi2-other/info/info_set.c 	curr = prev->next;
next               94 ompi/mca/io/romio321/romio/mpi2-other/info/info_set.c 	curr->next = 0;
next              365 ompi/mca/mtl/ofi/mtl_ofi_component.c             prov = prov->next;
next              375 ompi/mca/mtl/ofi/mtl_ofi_component.c             prov = prov->next;
next               62 ompi/mca/op/base/op_base_find_available.c     mca_base_component_list_item_t *cli, *next;
next               67 ompi/mca/op/base/op_base_find_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &ompi_op_base_framework.framework_components, mca_base_component_list_item_t) {
next               43 ompi/mca/osc/base/osc_base_frame.c     mca_base_component_list_item_t *cli, *next;
next               45 ompi/mca/osc/base/osc_base_frame.c     OPAL_LIST_FOREACH_SAFE(cli, next, &ompi_osc_base_framework.framework_components, mca_base_component_list_item_t) {
next              158 ompi/mca/osc/pt2pt/osc_pt2pt_component.c     ompi_osc_pt2pt_pending_t *pending, *next;
next              176 ompi/mca/osc/pt2pt/osc_pt2pt_component.c         OPAL_LIST_FOREACH_SAFE(pending, next, &mca_osc_pt2pt_component.pending_operations, ompi_osc_pt2pt_pending_t) {
next              774 ompi/mca/osc/pt2pt/osc_pt2pt_passive_target.c     ompi_osc_pt2pt_pending_lock_t *pending_lock, *next;
next              778 ompi/mca/osc/pt2pt/osc_pt2pt_passive_target.c     OPAL_LIST_FOREACH_SAFE(pending_lock, next, &module->locks_pending,
next              362 ompi/mca/osc/rdma/osc_rdma_active_target.c     ompi_osc_rdma_pending_post_t *pending_post, *next;
next              413 ompi/mca/osc/rdma/osc_rdma_active_target.c         OPAL_LIST_FOREACH_SAFE(pending_post, next, &module->pending_posts, ompi_osc_rdma_pending_post_t) {
next              401 ompi/mca/osc/rdma/osc_rdma_passive_target.c             ompi_osc_rdma_peer_t *peer, *next;
next              404 ompi/mca/osc/rdma/osc_rdma_passive_target.c             OPAL_LIST_FOREACH_SAFE(peer, next, &lock->demand_locked_peers, ompi_osc_rdma_peer_t) {
next              123 ompi/mca/osc/ucx/osc_ucx_active_target.c         ompi_osc_ucx_pending_post_t *pending_post, *next;
next              126 ompi/mca/osc/ucx/osc_ucx_active_target.c         OPAL_LIST_FOREACH_SAFE(pending_post, next, &module->pending_posts, ompi_osc_ucx_pending_post_t) {
next               30 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h     struct custom_match_prq_node* next;
next               73 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                             prev->next = elem->next;
next               77 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                             list->head = elem->next;
next               79 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                         if(!elem->next)
next               83 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                         elem->next = list->pool;
next               92 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         elem = elem->next;
next              118 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h             elem = elem->next;
next              156 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                                 prev->next = elem->next;
next              160 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                                 list->head = elem->next;
next              162 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                             if(!elem->next)
next              166 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                             elem->next = list->pool;
next              177 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         elem = elem->next;
next              213 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h             list->pool = list->pool->next;
next              219 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         elem->next = 0;
next              233 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h             list->tail->next = elem;
next              283 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         list->head = list->head->next;
next              289 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         list->pool = list->pool->next;
next              301 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h     for(elem = list->head; elem; elem = elem->next)
next              321 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h     for(elem = list->head; elem; elem = elem->next)
next              356 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h     struct custom_match_umq_node* next;
next              417 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         elem = elem->next;
next              439 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                 prev->next = elem->next;
next              443 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h                 list->head = elem->next;
next              445 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h             if(!elem->next)
next              449 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h             elem->next = list->pool;
next              472 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h             list->pool = list->pool->next;
next              481 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         elem->next = 0;
next              493 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h             list->tail->next = elem;
next              536 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         list->head = list->head->next;
next              542 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h         list->pool = list->pool->next;
next              561 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_arrays.h     for(elem = list->head; elem; elem = elem->next)
next               26 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h     struct custom_match_prq_node* next;
next               69 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                             prev->next = elem->next;
next               73 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                             list->head = elem->next;
next               75 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                         if(!elem->next)
next               79 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                         elem->next = list->pool;
next               88 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         elem = elem->next;
next              123 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         elem = elem->next;
next              173 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                                 prev->next = elem->next;
next              177 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                                 list->head = elem->next;
next              179 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                             if(!elem->next)
next              183 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                             elem->next = list->pool;
next              196 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         elem = elem->next;
next              228 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h             list->pool = list->pool->next;
next              236 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         elem->next = 0;
next              242 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h             list->tail->next = elem;
next              290 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         list->head = list->head->next;
next              296 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         list->pool = list->pool->next;
next              308 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h     for(elem = list->head; elem; elem = elem->next)
next              328 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h     for(elem = list->head; elem; elem = elem->next)
next              360 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h     struct custom_match_umq_node* next;
next              425 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         elem = elem->next;
next              446 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                 prev->next = elem->next;
next              450 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h                 list->head = elem->next;
next              452 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h             if(!elem->next)
next              456 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h             elem->next = list->pool;
next              482 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h             list->pool = list->pool->next;
next              492 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         elem->next = 0;
next              499 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h             list->tail->next = elem;
next              541 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         list->head = list->head->next;
next              547 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h         list->pool = list->pool->next;
next              566 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-byte.h     for(elem = list->head; elem; elem = elem->next)
next               26 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h     struct custom_match_prq_node* next;
next               69 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                             prev->next = elem->next;
next               73 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                             list->head = elem->next;
next               75 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                         if(!elem->next)
next               79 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                         elem->next = list->pool;
next               88 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         elem = elem->next;
next              123 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         elem = elem->next;
next              167 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                                 prev->next = elem->next;
next              171 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                                 list->head = elem->next;
next              173 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                             if(!elem->next)
next              177 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                             elem->next = list->pool;
next              190 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         elem = elem->next;
next              219 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h             list->pool = list->pool->next;
next              227 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         elem->next = 0;
next              233 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h             list->tail->next = elem;
next              282 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         list->head = list->head->next;
next              288 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         list->pool = list->pool->next;
next              300 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h     for(elem = list->head; elem; elem = elem->next)
next              320 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h     for(elem = list->head; elem; elem = elem->next)
next              352 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h     struct custom_match_umq_node* next;
next              416 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         elem = elem->next;
next              437 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                 prev->next = elem->next;
next              441 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h                 list->head = elem->next;
next              443 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h             if(!elem->next)
next              447 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h             elem->next = list->pool;
next              473 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h             list->pool = list->pool->next;
next              483 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         elem->next = 0;
next              492 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h             list->tail->next = elem;
next              536 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         list->head = list->head->next;
next              542 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h         list->pool = list->pool->next;
next              561 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-short.h     for(elem = list->head; elem; elem = elem->next)
next               26 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h     struct custom_match_prq_node* next;
next               67 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                             prev->next = elem->next;
next               71 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                             list->head = elem->next;
next               73 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                         if(!elem->next)
next               77 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                         elem->next = list->pool;
next               86 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         elem = elem->next;
next              122 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         elem = elem->next;
next              167 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                                 prev->next = elem->next;
next              171 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                                 list->head = elem->next;
next              173 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                             if(!elem->next)
next              177 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                             elem->next = list->pool;
next              190 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         elem = elem->next;
next              230 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h             list->pool = list->pool->next;
next              238 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         elem->next = 0;
next              244 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h             list->tail->next = elem;
next              292 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         list->head = list->head->next;
next              298 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         list->pool = list->pool->next;
next              310 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h     for(elem = list->head; elem; elem = elem->next)
next              329 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h     for(elem = list->head; elem; elem = elem->next)
next              361 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h     struct custom_match_umq_node* next;
next              434 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         elem = elem->next;
next              455 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                 prev->next = elem->next;
next              459 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h                 list->head = elem->next;
next              461 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h             if(!elem->next)
next              465 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h             elem->next = list->pool;
next              491 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h             list->pool = list->pool->next;
next              501 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         elem->next = 0;
next              510 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h             list->tail->next = elem;
next              554 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         list->head = list->head->next;
next              560 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h         list->pool = list->pool->next;
next              579 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_fuzzy512-word.h     for(elem = list->head; elem; elem = elem->next)
next               26 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     struct custom_match_prq_node* next;
next               58 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h                 prev->next = elem->next;
next               62 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h                 list->head = elem->next;
next               64 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h             if(!elem->next)
next               68 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h             elem->next = list->pool;
next               74 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         elem = elem->next;
next               95 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         elem = elem->next;
next              123 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h                 prev->next = elem->next;
next              127 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h                 list->head = elem->next;
next              129 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h             if(!elem->next)
next              133 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h             elem->next = list->pool;
next              146 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         elem = elem->next;
next              183 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->pool = list->pool->next;
next              189 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     elem->next = 0;
next              192 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->tail->next = elem;
next              242 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->head = list->head->next;
next              249 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->pool = list->pool->next;
next              265 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     for(elem = list->head; elem; elem = elem->next)
next              282 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     for(elem = list->head; elem; elem = elem->next)
next              312 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     struct custom_match_umq_node* next;
next              366 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         elem = elem->next;
next              382 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         prev->next = elem->next;
next              386 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->head = elem->next;
next              388 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     if(!elem->next)
next              392 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     elem->next = list->pool;
next              411 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->pool = list->pool->next;
next              420 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     elem->next = 0;
next              426 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->tail->next = elem;
next              471 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->head = list->head->next;
next              478 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h         list->pool = list->pool->next;
next              501 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_linkedlist.h     for(elem = list->head; elem; elem = elem->next)
next               28 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h     struct custom_match_prq_node* next;
next               71 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                             prev->next = elem->next;
next               75 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                             list->head = elem->next;
next               77 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                         if(!elem->next)
next               81 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                         elem->next = list->pool;
next               90 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         elem = elem->next;
next              124 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         elem = elem->next;
next              171 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                                 prev->next = elem->next;
next              175 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                                 list->head = elem->next;
next              177 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                             if(!elem->next)
next              181 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                             elem->next = list->pool;
next              194 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         elem = elem->next;
next              231 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h             list->pool = list->pool->next;
next              245 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         elem->next = 0;
next              251 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h             list->tail->next = elem;
next              301 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         list->head = list->head->next;
next              307 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         list->pool = list->pool->next;
next              319 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h     for(elem = list->head; elem; elem = elem->next)
next              339 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h     for(elem = list->head; elem; elem = elem->next)
next              372 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h     struct custom_match_umq_node* next;
next              436 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         elem = elem->next;
next              458 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                 prev->next = elem->next;
next              462 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h                 list->head = elem->next;
next              464 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h             if(!elem->next)
next              468 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h             elem->next = list->pool;
next              494 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h             list->pool = list->pool->next;
next              502 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         elem->next = 0;
next              508 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h             list->tail->next = elem;
next              550 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         list->head = list->head->next;
next              556 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h         list->pool = list->pool->next;
next              572 ompi/mca/pml/ob1/custommatch/pml_ob1_custom_match_vectors.h     for (custom_match_umq_node *elem = list->head; elem; elem = elem->next) {
next              122 ompi/mca/pml/ob1/pml_ob1_recvfrag.c     mca_pml_ob1_recv_frag_t  *prior, *next;
next              197 ompi/mca/pml/ob1/pml_ob1_recvfrag.c     next = (mca_pml_ob1_recv_frag_t*)parent->super.super.opal_list_next;
next              202 ompi/mca/pml/ob1/pml_ob1_recvfrag.c     if( (upper + 1) == next->hdr.hdr_match.hdr_seq ) {
next              204 ompi/mca/pml/ob1/pml_ob1_recvfrag.c         next->super.super.opal_list_next->opal_list_prev = (opal_list_item_t*)parent;
next              205 ompi/mca/pml/ob1/pml_ob1_recvfrag.c         parent->super.super.opal_list_next = next->super.super.opal_list_next;
next              207 ompi/mca/pml/ob1/pml_ob1_recvfrag.c         if( NULL != next->range ) {
next              208 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_next = (opal_list_item_t*)next->range;
next              209 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_prev = next->range->super.super.opal_list_prev;
next              210 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_next->opal_list_prev = (opal_list_item_t*)next;
next              211 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_prev->opal_list_next = (opal_list_item_t*)next;
next              212 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->range = NULL;
next              214 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_prev = (opal_list_item_t*)next;
next              215 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_next = (opal_list_item_t*)next;
next              218 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             parent->range = next;
next              223 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             frag->super.super.opal_list_next = (opal_list_item_t*)next;
next              224 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             parent->range->super.super.opal_list_prev = next->super.super.opal_list_prev;
next              225 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_prev->opal_list_next = (opal_list_item_t*)parent->range;
next              226 ompi/mca/pml/ob1/pml_ob1_recvfrag.c             next->super.super.opal_list_prev = (opal_list_item_t*)frag;
next              228 ompi/mca/pml/ob1/pml_ob1_recvfrag.c         if( next == *queue )
next               47 ompi/mca/sharedfp/base/sharedfp_base_find_available.c     opal_list_item_t *item, *next;
next               56 ompi/mca/sharedfp/base/sharedfp_base_find_available.c         next = opal_list_get_next(item);
next               71 ompi/mca/sharedfp/base/sharedfp_base_find_available.c          item = next;
next              113 ompi/mca/sharedfp/individual/sharedfp_individual.h     struct mca_sharedfp_individual_metadata_node_s* next;
next              137 ompi/mca/sharedfp/individual/sharedfp_individual.h     struct mca_sharedfp_individual_metadata_node_s *next;
next              267 ompi/mca/sharedfp/individual/sharedfp_individual_collaborate_data.c     currnode = headnode->next;
next              328 ompi/mca/sharedfp/individual/sharedfp_individual_collaborate_data.c     currnode = headnode->next;
next              342 ompi/mca/sharedfp/individual/sharedfp_individual_collaborate_data.c         headnode->next = currnode->next;
next              348 ompi/mca/sharedfp/individual/sharedfp_individual_collaborate_data.c         currnode = headnode->next;
next              229 ompi/mca/sharedfp/individual/sharedfp_individual_file_open.c     headnode->next   = NULL;
next               56 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c 	headnode->next = NULL;
next               74 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c     newnode->next               = NULL;
next               77 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c     if ( headnode->next == NULL) {
next               79 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c         headnode->next = newnode;
next               83 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c         tempnode = headnode->next;
next               85 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c         while(tempnode->next) {
next               86 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c             tempnode = tempnode->next;
next               89 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c         tempnode->next = newnode;
next              108 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c     current = headnode->next;
next              130 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c         headnode->next = current->next;
next              132 ompi/mca/sharedfp/individual/sharedfp_individual_insert_metadata.c         current = (headnode)->next;
next               48 ompi/mca/topo/base/topo_base_find_available.c     opal_list_item_t *item, *next;
next               57 ompi/mca/topo/base/topo_base_find_available.c         next = opal_list_get_next(item);
next               73 ompi/mca/topo/base/topo_base_find_available.c          item = next;
next               87 ompi/mca/topo/treematch/treematch/tm_malloc.c     for(s=size_hash; s != NULL; s=s->hh.next) {
next              122 ompi/mca/topo/treematch/treematch/tm_thread_pool.c     while(start_working_list->next == NULL) {
next              126 ompi/mca/topo/treematch/treematch/tm_thread_pool.c     work = start_working_list->next;
next              127 ompi/mca/topo/treematch/treematch/tm_thread_pool.c     start_working_list->next = work-> next;
next              148 ompi/mca/topo/treematch/treematch/tm_thread_pool.c   while(elem->next!=NULL){
next              149 ompi/mca/topo/treematch/treematch/tm_thread_pool.c     elem=elem->next;
next              151 ompi/mca/topo/treematch/treematch/tm_thread_pool.c   elem->next=work;
next              152 ompi/mca/topo/treematch/treematch/tm_thread_pool.c   work -> next = NULL;
next              261 ompi/mca/topo/treematch/treematch/tm_thread_pool.c       if (pool->working_list[id].next != NULL)
next               12 ompi/mca/topo/treematch/treematch/tm_thread_pool.h   struct _work_t *next;
next              433 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *new_group_list(tm_tree_t **tab, double val, group_list_t *next)
next              440 ompi/mca/topo/treematch/treematch/tm_tree.c   res->next = next;
next              463 ompi/mca/topo/treematch/treematch/tm_tree.c   elem = new_group_list(tab, val, list->next);
next              464 ompi/mca/topo/treematch/treematch/tm_tree.c   list->next = elem;
next              626 ompi/mca/topo/treematch/treematch/tm_tree.c     delete_group_list(list->next);
next              886 ompi/mca/topo/treematch/treematch/tm_tree.c    elem-> next           = NULL;
next              902 ompi/mca/topo/treematch/treematch/tm_tree.c       res[i-1]->next = res[i];
next              970 ompi/mca/topo/treematch/treematch/tm_tree.c 	work=work->next;
next             1001 ompi/mca/topo/treematch/treematch/tm_tree.c       work=work->next;
next             1076 ompi/mca/topo/treematch/treematch/tm_tree.c   cur->next = res;
next             1113 ompi/mca/topo/treematch/treematch/tm_tree.c   for(cur = res; cur->tab_group; cur = cur-> next)
next             1439 ompi/mca/topo/treematch/treematch/tm_tree.c     list = list->next;
next             1826 ompi/mca/topo/treematch/treematch/tm_tree.c     list.next = NULL;
next             1835 ompi/mca/topo/treematch/treematch/tm_tree.c     list_to_tab(list.next, tab_group, nb_groups);
next             1940 ompi/mca/topo/treematch/treematch/tm_tree.c     delete_group_list((&list)->next);
next               13 ompi/mca/topo/treematch/treematch/tm_tree.h   struct _group_list_t *next;
next               35 ompi/mca/topo/treematch/treematch/tm_tree.h   struct _work_unit_t *next;
next              155 ompi/mca/topo/treematch/treematch/uthash.h  (add)->hh.next = NULL;                                                          \
next              163 ompi/mca/topo/treematch/treematch/uthash.h     (head)->hh.tbl->tail->next = (add);                                          \
next              198 ompi/mca/topo/treematch/treematch/uthash.h     if ( ((delptr)->hh.prev == NULL) && ((delptr)->hh.next == NULL) )  {         \
next              213 ompi/mca/topo/treematch/treematch/uthash.h                     (head)->hh.tbl->hho))->next = (delptr)->hh.next;             \
next              215 ompi/mca/topo/treematch/treematch/uthash.h             DECLTYPE_ASSIGN(head,(delptr)->hh.next);                             \
next              217 ompi/mca/topo/treematch/treematch/uthash.h         if (_hd_hh_del->next) {                                                  \
next              218 ompi/mca/topo/treematch/treematch/uthash.h             ((UT_hash_handle*)((char*)_hd_hh_del->next +                         \
next              293 ompi/mca/topo/treematch/treematch/uthash.h            _thh = ( _thh->next ?  (UT_hash_handle*)((char*)(_thh->next) +        \
next              710 ompi/mca/topo/treematch/treematch/uthash.h                   _hs_q = (UT_hash_handle*)((_hs_q->next) ?                      \
next              711 ompi/mca/topo/treematch/treematch/uthash.h                           ((void*)((char*)(_hs_q->next) +                        \
next              719 ompi/mca/topo/treematch/treematch/uthash.h                       _hs_q = (UT_hash_handle*)((_hs_q->next) ?                  \
next              720 ompi/mca/topo/treematch/treematch/uthash.h                               ((void*)((char*)(_hs_q->next) +                    \
next              725 ompi/mca/topo/treematch/treematch/uthash.h                       _hs_p = (UT_hash_handle*)((_hs_p->next) ?                  \
next              726 ompi/mca/topo/treematch/treematch/uthash.h                               ((void*)((char*)(_hs_p->next) +                    \
next              734 ompi/mca/topo/treematch/treematch/uthash.h                       _hs_p = (UT_hash_handle*)((_hs_p->next) ?                  \
next              735 ompi/mca/topo/treematch/treematch/uthash.h                               ((void*)((char*)(_hs_p->next) +                    \
next              740 ompi/mca/topo/treematch/treematch/uthash.h                       _hs_q = (UT_hash_handle*)((_hs_q->next) ?                  \
next              741 ompi/mca/topo/treematch/treematch/uthash.h                               ((void*)((char*)(_hs_q->next) +                    \
next              746 ompi/mca/topo/treematch/treematch/uthash.h                       _hs_tail->next = ((_hs_e) ?                                \
next              757 ompi/mca/topo/treematch/treematch/uthash.h           _hs_tail->next = NULL;                                                 \
next              792 ompi/mca/topo/treematch/treematch/uthash.h             _dst_hh->next = NULL;                                                \
next              793 ompi/mca/topo/treematch/treematch/uthash.h             if (_last_elt_hh) { _last_elt_hh->next = _elt; }                     \
next              825 ompi/mca/topo/treematch/treematch/uthash.h for((el)=(head), (*(char**)(&(tmp)))=(char*)((head)?(head)->hh.next:NULL);       \
next              826 ompi/mca/topo/treematch/treematch/uthash.h   el; (el)=(tmp),(*(char**)(&(tmp)))=(char*)((tmp)?(tmp)->hh.next:NULL)) 
next              829 ompi/mca/topo/treematch/treematch/uthash.h for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)->hh.next:NULL);                 \
next              830 ompi/mca/topo/treematch/treematch/uthash.h   el; (el)=(tmp),(tmp)=DECLTYPE(el)((tmp)?(tmp)->hh.next:NULL))
next              897 ompi/mca/topo/treematch/treematch/uthash.h    void *next;                       /* next element in app order      */
next               36 ompi/request/grequestx.c     ompi_grequest_t *request, *next;
next               42 ompi/request/grequestx.c         OPAL_LIST_FOREACH_SAFE(request, next, &requests, ompi_grequest_t) {
next               35 ompi/runtime/ompi_mpi_preconnect.c     int param, next, prev, i, ret = OMPI_SUCCESS;
next               59 ompi/runtime/ompi_mpi_preconnect.c         next = (comm_rank + i) % comm_size;
next               63 ompi/runtime/ompi_mpi_preconnect.c                                              next, 1,
next               30 ompi/util/timings.h     struct ompi_timing_list_t *next;
next               77 ompi/util/timings.h             OMPI_TIMING.cur_timing->next = (struct ompi_timing_list_t*)malloc(sizeof(ompi_timing_list_t)); \
next               78 ompi/util/timings.h             OMPI_TIMING.cur_timing = (ompi_timing_list_t*)OMPI_TIMING.cur_timing->next;                    \
next               90 ompi/util/timings.h                 t = (ompi_timing_list_t*)t->next;                                  \
next              205 ompi/util/timings.h                         timing = (ompi_timing_list_t*)timing->next;               \
next              209 ompi/util/timings.h                         if (OMPI_TIMING.timing->next) {                           \
next              120 opal/class/opal_fifo.h     opal_list_item_t *item, *next, *ghost = &fifo->opal_fifo_ghost;
next              130 opal/class/opal_fifo.h         next = (opal_list_item_t *) item->opal_list_next;
next              137 opal/class/opal_fifo.h         if (tail.data.item != (intptr_t) item && (intptr_t) ghost != tail.data.item && ghost == next) {
next              143 opal/class/opal_fifo.h         if (opal_update_counted_pointer (&fifo->opal_fifo_head, &head, next)) {
next              151 opal/class/opal_fifo.h     if (ghost == next) {
next              217 opal/class/opal_fifo.h     register opal_list_item_t *item, *next;
next              240 opal/class/opal_fifo.h         next = (opal_list_item_t *) item->opal_list_next;
next              241 opal/class/opal_fifo.h         opal_atomic_sc_ptr(&fifo->opal_fifo_head.data.item, next, ret);
next              245 opal/class/opal_fifo.h     opal_list_item_t *item, *next;
next              264 opal/class/opal_fifo.h     next = (opal_list_item_t *) item->opal_list_next;
next              265 opal/class/opal_fifo.h     fifo->opal_fifo_head.data.item = (uintptr_t) next;
next              268 opal/class/opal_fifo.h     if (ghost == next) {
next              189 opal/class/opal_graph.c     opal_graph_edge_t *edge, *next;
next              198 opal/class/opal_graph.c         OPAL_LIST_FOREACH_SAFE(edge, next, aj_list->edges, opal_graph_edge_t) {
next              303 opal/class/opal_interval_tree.c     opal_interval_tree_node_t *node, *next;
next              314 opal/class/opal_interval_tree.c     OPAL_LIST_FOREACH_SAFE(node, next, &tree->gc_list, opal_interval_tree_node_t) {
next              466 opal/class/opal_interval_tree.c     opal_interval_tree_node_t **parent_ptr, *next, *parent = node->parent;
next              473 opal/class/opal_interval_tree.c     next = (node->right == nill) ? node->left : node->right;
next              475 opal/class/opal_interval_tree.c     next->parent = node->parent;
next              476 opal/class/opal_interval_tree.c     rp_publish (parent_ptr, next);
next              481 opal/class/opal_interval_tree.c         if (OPAL_INTERVAL_TREE_COLOR_RED == next->color) {
next              482 opal/class/opal_interval_tree.c             next->color = OPAL_INTERVAL_TREE_COLOR_BLACK;
next              484 opal/class/opal_interval_tree.c             opal_interval_tree_delete_fixup (tree, next, parent);
next              491 opal/class/opal_interval_tree.c     opal_interval_tree_node_t **parent_ptr, *next, *next_copy, *parent = node->parent;
next              495 opal/class/opal_interval_tree.c     next = opal_interval_tree_next (tree, node);
next              496 opal/class/opal_interval_tree.c     next_color = next->color;
next              498 opal/class/opal_interval_tree.c     if (next != node->right) {
next              500 opal/class/opal_interval_tree.c         next_copy = opal_interval_tree_node_copy (tree, next);
next              511 opal/class/opal_interval_tree.c         opal_interval_tree_delete_leaf (tree, next);
next              514 opal/class/opal_interval_tree.c         next->color = color;
next              515 opal/class/opal_interval_tree.c         next->left = node->left;
next              516 opal/class/opal_interval_tree.c         next->left->parent = next;
next              517 opal/class/opal_interval_tree.c         next->parent = node->parent;
next              518 opal/class/opal_interval_tree.c         rp_publish (parent_ptr, next);
next              524 opal/class/opal_interval_tree.c 	    if (OPAL_INTERVAL_TREE_COLOR_RED == next->right->color) {
next              525 opal/class/opal_interval_tree.c 		next->right->color = OPAL_INTERVAL_TREE_COLOR_BLACK;
next              527 opal/class/opal_interval_tree.c 		opal_interval_tree_delete_fixup (tree, next->right, next);
next              148 opal/class/opal_lifo.h     opal_list_item_t *next = (opal_list_item_t *) lifo->opal_lifo_head.data.item;
next              151 opal/class/opal_lifo.h         item->opal_list_next = next;
next              155 opal/class/opal_lifo.h         if (opal_atomic_compare_exchange_strong_ptr (&lifo->opal_lifo_head.data.item, (intptr_t *) &next, (intptr_t) item)) {
next              156 opal/class/opal_lifo.h             return next;
next              196 opal/class/opal_lifo.h     opal_list_item_t *next = (opal_list_item_t *) lifo->opal_lifo_head.data.item;
next              202 opal/class/opal_lifo.h         item->opal_list_next = next;
next              204 opal/class/opal_lifo.h         if (opal_atomic_compare_exchange_strong_ptr (&lifo->opal_lifo_head.data.item, (intptr_t *) &next, (intptr_t) item)) {
next              208 opal/class/opal_lifo.h             return next;
next              221 opal/class/opal_lifo.h     register opal_list_item_t *item, *next;
next              237 opal/class/opal_lifo.h         next = (opal_list_item_t *) item->opal_list_next;
next              238 opal/class/opal_lifo.h         opal_atomic_sc_ptr(&lifo->opal_lifo_head.data.item, next, ret);
next              116 opal/class/opal_list.c     volatile opal_list_item_t *ptr, *next;
next              137 opal/class/opal_list.c         next = ptr->opal_list_next;
next              138 opal/class/opal_list.c         item->opal_list_next = next;
next              140 opal/class/opal_list.c         next->opal_list_prev = item;
next              259 opal/class/opal_list.h #define OPAL_LIST_FOREACH_SAFE(item, next, list, type)                  \
next              261 opal/class/opal_list.h          next = (type *) ((opal_list_item_t *) (item))->opal_list_next ;\
next              263 opal/class/opal_list.h        item = next, next = (type *) ((opal_list_item_t *) (item))->opal_list_next)
next               77 opal/datatype/opal_convertor.c         opal_convertor_master_list = master->next;
next               78 opal/datatype/opal_convertor.c         master->next = NULL;
next              103 opal/datatype/opal_convertor.c         master = master->next;
next              110 opal/datatype/opal_convertor.c     master->next = opal_convertor_master_list;
next               31 opal/datatype/opal_convertor_internal.h     struct opal_convertor_master_t* next;
next              140 opal/mca/allocator/basic/allocator_basic.c         mca_allocator_basic_segment_t *next = (mca_allocator_basic_segment_t*)item;
next              141 opal/mca/allocator/basic/allocator_basic.c         if(seg->seg_addr + seg->seg_size == next->seg_addr) {
next              142 opal/mca/allocator/basic/allocator_basic.c             next->seg_addr = seg->seg_addr;
next              143 opal/mca/allocator/basic/allocator_basic.c             next->seg_size += seg->seg_size;
next              170 opal/mca/base/mca_base_component_find.c     mca_base_component_list_item_t *cli, *next;
next              187 opal/mca/base/mca_base_component_find.c     OPAL_LIST_FOREACH_SAFE(cli, next, components, mca_base_component_list_item_t) {
next               79 opal/mca/base/mca_base_components_close.c     mca_base_component_list_item_t *cli, *next;
next               86 opal/mca/base/mca_base_components_close.c     OPAL_LIST_FOREACH_SAFE(cli, next, components, mca_base_component_list_item_t) {
next               83 opal/mca/base/mca_base_components_open.c     mca_base_component_list_item_t *cli, *next;
next              116 opal/mca/base/mca_base_components_open.c     OPAL_LIST_FOREACH_SAFE(cli, next, components, mca_base_component_list_item_t) {
next               75 opal/mca/base/mca_base_components_register.c     mca_base_component_list_item_t *cli, *next;
next               85 opal/mca/base/mca_base_components_register.c     OPAL_LIST_FOREACH_SAFE(cli, next, &framework->framework_components, mca_base_component_list_item_t) {
next              199 opal/mca/base/mca_base_open.c     char *ptr, *next;
next              212 opal/mca/base/mca_base_open.c         next = strchr(ptr, ',');
next              213 opal/mca/base/mca_base_open.c         if (NULL != next) {
next              214 opal/mca/base/mca_base_open.c             *next = '\0';
next              274 opal/mca/base/mca_base_open.c         if (NULL == next) {
next              277 opal/mca/base/mca_base_open.c         ptr = next + 1;
next              402 opal/mca/base/mca_base_pvar.c     mca_base_pvar_handle_t *handle, *next;
next              417 opal/mca/base/mca_base_pvar.c     OPAL_LIST_FOREACH_SAFE(handle, next, &pvar->bound_handles, mca_base_pvar_handle_t) {
next              941 opal/mca/base/mca_base_pvar.c     mca_base_pvar_handle_t *handle, *next;
next              946 opal/mca/base/mca_base_pvar.c     OPAL_LIST_FOREACH_SAFE(handle, next, &session->handles, mca_base_pvar_handle_t) {
next              190 opal/mca/btl/base/btl_base_frame.c     mca_btl_base_selected_module_t *sm, *next;
next              198 opal/mca/btl/base/btl_base_frame.c     OPAL_LIST_FOREACH_SAFE(sm, next, &mca_btl_base_modules_initialized, mca_btl_base_selected_module_t) {
next               56 opal/mca/btl/base/btl_base_select.c     mca_base_component_list_item_t *cli, *next;
next               67 opal/mca/btl/base/btl_base_select.c     OPAL_LIST_FOREACH_SAFE(cli, next, &opal_btl_base_framework.framework_components, mca_base_component_list_item_t) {
next              324 opal/mca/btl/ofi/btl_ofi_component.c         info = info->next;
next              339 opal/mca/btl/ofi/btl_ofi_component.c         info = info->next;
next              276 opal/mca/btl/ofi/btl_ofi_module.c     mca_btl_ofi_endpoint_t *endpoint, *next;
next              307 opal/mca/btl/ofi/btl_ofi_module.c     OPAL_LIST_FOREACH_SAFE(endpoint, next, &ofi_btl->endpoints, mca_btl_ofi_endpoint_t) {
next              409 opal/mca/btl/tcp/btl_tcp_component.c     mca_btl_tcp_event_t *event, *next;
next              467 opal/mca/btl/tcp/btl_tcp_component.c     OPAL_LIST_FOREACH_SAFE(event, next, &mca_btl_tcp_component.tcp_events, mca_btl_tcp_event_t) {
next              489 opal/mca/btl/uct/btl_uct_component.c     mca_btl_uct_base_frag_t *frag, *next;
next              497 opal/mca/btl/uct/btl_uct_component.c     OPAL_LIST_FOREACH_SAFE(frag, next, &uct_btl->pending_frags, mca_btl_uct_base_frag_t) {
next              729 opal/mca/btl/usnic/btl_usnic_component.c     for (info = info_list; NULL != info; info = info->next) {
next              816 opal/mca/btl/usnic/btl_usnic_component.c              ++i, info = info->next) {
next              678 opal/mca/btl/vader/btl_vader_component.c     mca_btl_vader_frag_t *frag, *next;
next              686 opal/mca/btl/vader/btl_vader_component.c     OPAL_LIST_FOREACH_SAFE(frag, next, &ep->pending_frags, mca_btl_vader_frag_t) {
next              709 opal/mca/btl/vader/btl_vader_component.c     mca_btl_base_endpoint_t *ep, *next;
next              718 opal/mca/btl/vader/btl_vader_component.c     OPAL_LIST_FOREACH_SAFE(ep, next, &mca_btl_vader_component.pending_endpoints, mca_btl_base_endpoint_t) {
next              135 opal/mca/btl/vader/btl_vader_fifo.h     assert (hdr->next != value);
next              137 opal/mca/btl/vader/btl_vader_fifo.h     if (OPAL_UNLIKELY(VADER_FIFO_FREE == hdr->next)) {
next              141 opal/mca/btl/vader/btl_vader_fifo.h             while (VADER_FIFO_FREE == hdr->next) {
next              145 opal/mca/btl/vader/btl_vader_fifo.h             fifo->fifo_head = hdr->next;
next              148 opal/mca/btl/vader/btl_vader_fifo.h         fifo->fifo_head = hdr->next;
next              178 opal/mca/btl/vader/btl_vader_fifo.h         hdr->next = value;
next              207 opal/mca/btl/vader/btl_vader_fifo.h     hdr->next = VADER_FIFO_FREE;
next              226 opal/mca/btl/vader/btl_vader_fifo.h     hdr->next = VADER_FIFO_FREE;
next               61 opal/mca/btl/vader/btl_vader_frag.h     volatile intptr_t next;
next              248 opal/mca/common/ucx/common_ucx_wpool.c         _winfo_list_item_t *item, *next;
next              249 opal/mca/common/ucx/common_ucx_wpool.c         OPAL_LIST_FOREACH_SAFE(item, next, &wpool->idle_workers,
next              261 opal/mca/common/ucx/common_ucx_wpool.c         _winfo_list_item_t *item, *next;
next              262 opal/mca/common/ucx/common_ucx_wpool.c         OPAL_LIST_FOREACH_SAFE(item, next, &wpool->active_workers,
next              280 opal/mca/common/ucx/common_ucx_wpool.c     _winfo_list_item_t *item = NULL, *next = NULL;
next              286 opal/mca/common/ucx/common_ucx_wpool.c         OPAL_LIST_FOREACH_SAFE(item, next, &wpool->active_workers,
next              472 opal/mca/common/ucx/common_ucx_wpool.c     _ctx_record_list_item_t *item = NULL, *next;
next              477 opal/mca/common/ucx/common_ucx_wpool.c     OPAL_LIST_FOREACH_SAFE(item, next, &ctx->tls_workers,
next              739 opal/mca/common/ucx/common_ucx_wpool.c     _tlocal_table_t *item = NULL, *next;
next              751 opal/mca/common/ucx/common_ucx_wpool.c     OPAL_LIST_FOREACH_SAFE(item, next, &wpool->tls_list, _tlocal_table_t) {
next              240 opal/mca/event/libevent2022/libevent/buffer.c 	struct evbuffer_chain *next;
next              241 opal/mca/event/libevent2022/libevent/buffer.c 	for (; chain; chain = next) {
next              242 opal/mca/event/libevent2022/libevent/buffer.c 		next = chain->next;
next              251 opal/mca/event/libevent2022/libevent/buffer.c 	for (; chain; chain = chain->next) {
next              278 opal/mca/event/libevent2022/libevent/buffer.c 		ch = &(*ch)->next;
next              304 opal/mca/event/libevent2022/libevent/buffer.c 			ch = &(*ch)->next;
next              307 opal/mca/event/libevent2022/libevent/buffer.c 			buf->last->next = chain;
next              309 opal/mca/event/libevent2022/libevent/buffer.c 				buf->last_with_datap = &buf->last->next;
next              443 opal/mca/event/libevent2022/libevent/buffer.c 	struct evbuffer_cb_entry *cbent, *next;
next              482 opal/mca/event/libevent2022/libevent/buffer.c 	     cbent = next) {
next              485 opal/mca/event/libevent2022/libevent/buffer.c 		next = TAILQ_NEXT(cbent, next);
next              541 opal/mca/event/libevent2022/libevent/buffer.c 	    TAILQ_REMOVE(&buffer->callbacks, cbent, next);
next              549 opal/mca/event/libevent2022/libevent/buffer.c 	struct evbuffer_chain *chain, *next;
next              559 opal/mca/event/libevent2022/libevent/buffer.c 	for (chain = buffer->first; chain != NULL; chain = next) {
next              560 opal/mca/event/libevent2022/libevent/buffer.c 		next = chain->next;
next              662 opal/mca/event/libevent2022/libevent/buffer.c 	while ((*buf->last_with_datap)->next && (*buf->last_with_datap)->next->off) {
next              663 opal/mca/event/libevent2022/libevent/buffer.c 		buf->last_with_datap = &(*buf->last_with_datap)->next;
next              703 opal/mca/event/libevent2022/libevent/buffer.c 		firstchainp = &(*firstchainp)->next;
next              715 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next              725 opal/mca/event/libevent2022/libevent/buffer.c 		chainp = &(*chainp)->next;
next              774 opal/mca/event/libevent2022/libevent/buffer.c 		pinned = &(*pinned)->next;
next              839 opal/mca/event/libevent2022/libevent/buffer.c 	dst->last->next = src->first;
next              841 opal/mca/event/libevent2022/libevent/buffer.c 		dst->last_with_datap = &dst->last->next;
next              853 opal/mca/event/libevent2022/libevent/buffer.c 	src->last->next = dst->first;
next              862 opal/mca/event/libevent2022/libevent/buffer.c 		dst->last_with_datap = &src->last->next;
next              961 opal/mca/event/libevent2022/libevent/buffer.c 	struct evbuffer_chain *chain, *next;
next              978 opal/mca/event/libevent2022/libevent/buffer.c 		for (chain = buf->first; chain != NULL; chain = next) {
next              979 opal/mca/event/libevent2022/libevent/buffer.c 			next = chain->next;
next              992 opal/mca/event/libevent2022/libevent/buffer.c 		     chain = next) {
next              993 opal/mca/event/libevent2022/libevent/buffer.c 			next = chain->next;
next              999 opal/mca/event/libevent2022/libevent/buffer.c 			if (&chain->next == buf->last_with_datap)
next             1074 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             1135 opal/mca/event/libevent2022/libevent/buffer.c 		if (src->last_with_datap == &chain->next)
next             1137 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             1151 opal/mca/event/libevent2022/libevent/buffer.c 		previous->next = NULL;
next             1186 opal/mca/event/libevent2022/libevent/buffer.c 	struct evbuffer_chain *chain, *next, *tmp, *last_with_data;
next             1214 opal/mca/event/libevent2022/libevent/buffer.c 	for (tmp=chain->next; tmp; tmp=tmp->next) {
next             1232 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             1240 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             1255 opal/mca/event/libevent2022/libevent/buffer.c 	for (; chain != NULL && (size_t)size >= chain->off; chain = next) {
next             1256 opal/mca/event/libevent2022/libevent/buffer.c 		next = chain->next;
next             1263 opal/mca/event/libevent2022/libevent/buffer.c 		if (&chain->next == buf->last_with_datap)
next             1277 opal/mca/event/libevent2022/libevent/buffer.c 	tmp->next = chain;
next             1282 opal/mca/event/libevent2022/libevent/buffer.c 		if (buf->first->next && buf->first->next->off)
next             1283 opal/mca/event/libevent2022/libevent/buffer.c 			buf->last_with_datap = &buf->first->next;
next             1321 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             1370 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             1393 opal/mca/event/libevent2022/libevent/buffer.c 					goto next;
next             1399 opal/mca/event/libevent2022/libevent/buffer.c 		next:
next             1404 opal/mca/event/libevent2022/libevent/buffer.c 		if (! chain->next) {
next             1411 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             1698 opal/mca/event/libevent2022/libevent/buffer.c 		buf->last_with_datap = &tmp->next;
next             1700 opal/mca/event/libevent2022/libevent/buffer.c 	tmp->next = chain;
next             1757 opal/mca/event/libevent2022/libevent/buffer.c 		chainp = &(*chainp)->next;
next             1807 opal/mca/event/libevent2022/libevent/buffer.c 		if (chain->next && CHAIN_SPACE_LEN(chain->next) >= datlen) {
next             1810 opal/mca/event/libevent2022/libevent/buffer.c 			result = chain->next;
next             1839 opal/mca/event/libevent2022/libevent/buffer.c 		tmp->next = chain->next;
next             1860 opal/mca/event/libevent2022/libevent/buffer.c 	struct evbuffer_chain *chain = buf->last, *tmp, *next;
next             1883 opal/mca/event/libevent2022/libevent/buffer.c 	for (chain = *buf->last_with_datap; chain; chain = chain->next) {
next             1917 opal/mca/event/libevent2022/libevent/buffer.c 		buf->last->next = tmp;
next             1935 opal/mca/event/libevent2022/libevent/buffer.c 			chain = chain->next;
next             1939 opal/mca/event/libevent2022/libevent/buffer.c 		for (; chain; chain = next) {
next             1940 opal/mca/event/libevent2022/libevent/buffer.c 			next = chain->next;
next             1951 opal/mca/event/libevent2022/libevent/buffer.c 				(*buf->last_with_datap)->next = NULL;
next             1960 opal/mca/event/libevent2022/libevent/buffer.c 			(*buf->last_with_datap)->next = tmp;
next             2049 opal/mca/event/libevent2022/libevent/buffer.c 		firstchainp = &(*firstchainp)->next;
next             2060 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             2202 opal/mca/event/libevent2022/libevent/buffer.c 		chainp = &(*chainp)->next;
next             2301 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             2480 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             2530 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             2587 opal/mca/event/libevent2022/libevent/buffer.c 				chain = pos._internal.chain = chain->next;
next             2594 opal/mca/event/libevent2022/libevent/buffer.c 			chain = pos._internal.chain = chain->next;
next             2628 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             2653 opal/mca/event/libevent2022/libevent/buffer.c 		chain = chain->next;
next             2969 opal/mca/event/libevent2022/libevent/buffer.c 	TAILQ_INSERT_HEAD(&buffer->callbacks, e, next);
next             2979 opal/mca/event/libevent2022/libevent/buffer.c 	TAILQ_REMOVE(&buffer->callbacks, ent, next);
next             2991 opal/mca/event/libevent2022/libevent/buffer.c 	TAILQ_FOREACH(cbent, &buffer->callbacks, next) {
next               85 opal/mca/event/libevent2022/libevent/buffer_iocp.c 	struct evbuffer_chain *next, *chain = eo->first_pinned;
next               89 opal/mca/event/libevent2022/libevent/buffer_iocp.c 		next = chain->next;
next               91 opal/mca/event/libevent2022/libevent/buffer_iocp.c 		chain = next;
next              111 opal/mca/event/libevent2022/libevent/buffer_iocp.c 		chainp = &(*chainp)->next;
next              121 opal/mca/event/libevent2022/libevent/buffer_iocp.c 		chainp = &(*chainp)->next;
next              203 opal/mca/event/libevent2022/libevent/buffer_iocp.c 	for (i=0; i < MAX_WSABUFS && chain; ++i, chain=chain->next) {
next              283 opal/mca/event/libevent2022/libevent/buffer_iocp.c 	for ( ; chain; chain = chain->next) {
next               62 opal/mca/event/libevent2022/libevent/evbuffer-internal.h 	TAILQ_ENTRY(evbuffer_cb_entry) next;
next              171 opal/mca/event/libevent2022/libevent/evbuffer-internal.h 	struct evbuffer_chain *next;
next              183 opal/mca/event/libevent2022/libevent/evdns.c 	struct request *next, *prev;
next              225 opal/mca/event/libevent2022/libevent/evdns.c 	struct nameserver *next, *prev;
next              259 opal/mca/event/libevent2022/libevent/evdns.c 	struct server_reply_item *next; /* next item in sequence. */
next              360 opal/mca/event/libevent2022/libevent/evdns.c 	TAILQ_ENTRY(hosts_entry) next;
next              486 opal/mca/event/libevent2022/libevent/evdns.c 			req = req->next;
next              608 opal/mca/event/libevent2022/libevent/evdns.c 				req = req->next;
next             1327 opal/mca/event/libevent2022/libevent/evdns.c 		base->server_head = base->server_head->next;
next             1336 opal/mca/event/libevent2022/libevent/evdns.c 			base->server_head = base->server_head->next;
next             1340 opal/mca/event/libevent2022/libevent/evdns.c 		base->server_head = base->server_head->next;
next             1347 opal/mca/event/libevent2022/libevent/evdns.c 			base->server_head = base->server_head->next;
next             1771 opal/mca/event/libevent2022/libevent/evdns.c 		itemp = &((*itemp)->next);
next             1776 opal/mca/event/libevent2022/libevent/evdns.c 	item->next = NULL;
next             1948 opal/mca/event/libevent2022/libevent/evdns.c 			item = item->next;
next             2032 opal/mca/event/libevent2022/libevent/evdns.c 	struct server_reply_item *victim, *next, **list;
next             2044 opal/mca/event/libevent2022/libevent/evdns.c 			next = victim->next;
next             2049 opal/mca/event/libevent2022/libevent/evdns.c 			victim = next;
next             2336 opal/mca/event/libevent2022/libevent/evdns.c 				req = req->next;
next             2357 opal/mca/event/libevent2022/libevent/evdns.c 		server = server->next;
next             2385 opal/mca/event/libevent2022/libevent/evdns.c 		struct nameserver *next = server->next;
next             2396 opal/mca/event/libevent2022/libevent/evdns.c 		if (next == started_at)
next             2398 opal/mca/event/libevent2022/libevent/evdns.c 		server = next;
next             2407 opal/mca/event/libevent2022/libevent/evdns.c 			struct request *next = req->next;
next             2423 opal/mca/event/libevent2022/libevent/evdns.c 			if (next == req_started_at)
next             2425 opal/mca/event/libevent2022/libevent/evdns.c 			req = next;
next             2473 opal/mca/event/libevent2022/libevent/evdns.c 			server = server->next;
next             2519 opal/mca/event/libevent2022/libevent/evdns.c 		ns->next = ns->prev = ns;
next             2522 opal/mca/event/libevent2022/libevent/evdns.c 		ns->next = base->server_head->next;
next             2524 opal/mca/event/libevent2022/libevent/evdns.c 		base->server_head->next = ns;
next             2525 opal/mca/event/libevent2022/libevent/evdns.c 		ns->next->prev = ns;
next             2648 opal/mca/event/libevent2022/libevent/evdns.c 			ptr = ptr->next;
next             2652 opal/mca/event/libevent2022/libevent/evdns.c 		EVUTIL_ASSERT(req->next);
next             2656 opal/mca/event/libevent2022/libevent/evdns.c 	if (req->next == req) {
next             2660 opal/mca/event/libevent2022/libevent/evdns.c 		req->next->prev = req->prev;
next             2661 opal/mca/event/libevent2022/libevent/evdns.c 		req->prev->next = req->next;
next             2662 opal/mca/event/libevent2022/libevent/evdns.c 		if (*head == req) *head = req->next;
next             2664 opal/mca/event/libevent2022/libevent/evdns.c 	req->next = req->prev = NULL;
next             2674 opal/mca/event/libevent2022/libevent/evdns.c 		req->next = req->prev = req;
next             2679 opal/mca/event/libevent2022/libevent/evdns.c 	req->prev->next = req;
next             2680 opal/mca/event/libevent2022/libevent/evdns.c 	req->next = *head;
next             2758 opal/mca/event/libevent2022/libevent/evdns.c 	req->next = req->prev = NULL;
next             2986 opal/mca/event/libevent2022/libevent/evdns.c 	struct search_domain *next;
next             3002 opal/mca/event/libevent2022/libevent/evdns.c 		struct search_domain *next, *dom;
next             3003 opal/mca/event/libevent2022/libevent/evdns.c 		for (dom = state->head; dom; dom = next) {
next             3004 opal/mca/event/libevent2022/libevent/evdns.c 			next = dom->next;
next             3058 opal/mca/event/libevent2022/libevent/evdns.c 	sdomain->next = base->global_search_state->head;
next             3068 opal/mca/event/libevent2022/libevent/evdns.c 	struct search_domain *cur, *prev = NULL, *next;
next             3072 opal/mca/event/libevent2022/libevent/evdns.c 		next = cur->next;
next             3073 opal/mca/event/libevent2022/libevent/evdns.c 		cur->next = prev;
next             3075 opal/mca/event/libevent2022/libevent/evdns.c 		cur = next;
next             3126 opal/mca/event/libevent2022/libevent/evdns.c 	for (dom = state->head; dom; dom = dom->next) {
next             3967 opal/mca/event/libevent2022/libevent/evdns.c 		server_next = server->next;
next             3992 opal/mca/event/libevent2022/libevent/evdns.c 			dom_next = dom->next;
next             4002 opal/mca/event/libevent2022/libevent/evdns.c 			TAILQ_REMOVE(&base->hostsdb, victim, next);
next             4077 opal/mca/event/libevent2022/libevent/evdns.c 		TAILQ_INSERT_TAIL(&base->hostsdb, he, next);
next             4482 opal/mca/event/libevent2022/libevent/evdns.c 		e = TAILQ_NEXT(find_after, next);
next             4486 opal/mca/event/libevent2022/libevent/evdns.c 	for (; e; e = TAILQ_NEXT(e, next)) {
next              297 opal/mca/event/libevent2022/libevent/event-internal.h 	TAILQ_ENTRY(event_config_entry) next;
next              468 opal/mca/event/libevent2022/libevent/event.c 	TAILQ_FOREACH(entry, &cfg->entries, next) {
next              728 opal/mca/event/libevent2022/libevent/event.c 		struct event *next = TAILQ_NEXT(ev, ev_next);
next              733 opal/mca/event/libevent2022/libevent/event.c 		ev = next;
next              745 opal/mca/event/libevent2022/libevent/event.c 			struct event *next = TAILQ_NEXT(ev,
next              751 opal/mca/event/libevent2022/libevent/event.c 			ev = next;
next              760 opal/mca/event/libevent2022/libevent/event.c 			struct event *next = TAILQ_NEXT(ev, ev_active_next);
next              765 opal/mca/event/libevent2022/libevent/event.c 			ev = next;
next              951 opal/mca/event/libevent2022/libevent/event.c 		TAILQ_REMOVE(&cfg->entries, entry, next);
next              978 opal/mca/event/libevent2022/libevent/event.c 	TAILQ_INSERT_TAIL(&cfg->entries, entry, next);
next              146 opal/mca/event/libevent2022/libevent/evmap.c 	struct event_map_entry **ent, **next, *this;
next              147 opal/mca/event/libevent2022/libevent/evmap.c 	for (ent = HT_START(event_io_map, ctx); ent; ent = next) {
next              149 opal/mca/event/libevent2022/libevent/evmap.c 		next = HT_NEXT_RMV(event_io_map, ctx, ent);
next               38 opal/mca/event/libevent2022/libevent/evrpc-internal.h 	TAILQ_ENTRY(evrpc_hook) next;
next               98 opal/mca/event/libevent2022/libevent/evrpc-internal.h 	TAILQ_ENTRY(evrpc_hook_ctx) next;
next              105 opal/mca/event/libevent2022/libevent/evrpc-internal.h 	TAILQ_ENTRY(evrpc_meta) next;
next              170 opal/mca/event/libevent2022/libevent/evrpc-internal.h 	TAILQ_ENTRY(evrpc_request_wrapper) next;
next              104 opal/mca/event/libevent2022/libevent/evrpc.c 		TAILQ_REMOVE(&base->paused_requests, pause, next);
next              143 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_INSERT_TAIL(head, hook, next);
next              152 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_FOREACH(hook, head, next) {
next              154 opal/mca/event/libevent2022/libevent/evrpc.c 			TAILQ_REMOVE(head, hook, next);
next              191 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_FOREACH(hook, head, next) {
next              236 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_INSERT_TAIL(&base->registered_rpcs, rpc, next);
next              256 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_FOREACH(rpc, &base->registered_rpcs, next) {
next              264 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_REMOVE(&base->registered_rpcs, rpc, next);
next              549 opal/mca/event/libevent2022/libevent/evrpc.c 		TAILQ_REMOVE(&pool->requests, request, next);
next              554 opal/mca/event/libevent2022/libevent/evrpc.c 		TAILQ_REMOVE(&pool->paused_requests, pause, next);
next              559 opal/mca/event/libevent2022/libevent/evrpc.c 		TAILQ_REMOVE(&pool->connections, connection, next);
next              586 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_INSERT_TAIL(&pool->connections, connection, next);
next              609 opal/mca/event/libevent2022/libevent/evrpc.c 		TAILQ_REMOVE(&pool->requests, request, next);
next              618 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_REMOVE(&pool->connections, connection, next);
next              625 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_FOREACH(evcon, &pool->connections, next) {
next              643 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_FOREACH(connection, &pool->connections, next) {
next              776 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_INSERT_TAIL(&base->pause_requests, pause, next);
next              787 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_FOREACH(pause, head, next) {
next              796 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_REMOVE(head, pause, next);
next              816 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_INSERT_TAIL(&pool->requests, ctx, next);
next              967 opal/mca/event/libevent2022/libevent/evrpc.c 		TAILQ_REMOVE(&pool->requests, ctx, next);
next              993 opal/mca/event/libevent2022/libevent/evrpc.c 		TAILQ_REMOVE(meta_data, entry, next);
next             1051 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_INSERT_TAIL(&store->meta_data, meta, next);
next             1063 opal/mca/event/libevent2022/libevent/evrpc.c 	TAILQ_FOREACH(meta, &req->hook_meta->meta_data, next) {
next             1387 opal/mca/event/libevent2022/libevent/evutil.c 		struct evutil_addrinfo *next = ai->ai_next;
next             1391 opal/mca/event/libevent2022/libevent/evutil.c 		ai = next;
next             1740 opal/mca/event/libevent2022/libevent/evutil.c 				char *next;
next             1741 opal/mca/event/libevent2022/libevent/evutil.c 				long r = strtol(src, &next, 16);
next             1742 opal/mca/event/libevent2022/libevent/evutil.c 				if (next > 4+src)
next             1744 opal/mca/event/libevent2022/libevent/evutil.c 				if (next == src)
next             1751 opal/mca/event/libevent2022/libevent/evutil.c 				src = next;
next              226 opal/mca/event/libevent2022/libevent/ht-internal.h     struct type **p, **nextp, *next;                                    \
next              233 opal/mca/event/libevent2022/libevent/ht-internal.h         next = *nextp;                                                  \
next              236 opal/mca/event/libevent2022/libevent/ht-internal.h           *p = next;                                                    \
next              332 opal/mca/event/libevent2022/libevent/ht-internal.h         struct type *elm, *next;                                        \
next              336 opal/mca/event/libevent2022/libevent/ht-internal.h           next = elm->field.hte_next;                                   \
next              340 opal/mca/event/libevent2022/libevent/ht-internal.h           elm = next;                                                   \
next               65 opal/mca/event/libevent2022/libevent/http-internal.h 	TAILQ_ENTRY(evhttp_connection) next;
next              111 opal/mca/event/libevent2022/libevent/http-internal.h 	TAILQ_ENTRY(evhttp_cb) next;
next              124 opal/mca/event/libevent2022/libevent/http-internal.h 	TAILQ_ENTRY(evhttp_bound_socket) next;
next              131 opal/mca/event/libevent2022/libevent/http-internal.h 	TAILQ_ENTRY(evhttp_server_alias) next;
next              608 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(header, req->output_headers, next) {
next              662 opal/mca/event/libevent2022/libevent/http.c 			TAILQ_REMOVE(&req->evcon->requests, req, next);
next              736 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_REMOVE(&evcon->requests, req, next);
next              779 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&evcon->requests, req, next);
next             1141 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&evcon->requests, req, next);
next             1147 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&http->connections, evcon, next);
next             1306 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&evcon->requests, request, next);
next             1307 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_INSERT_TAIL(&requests, request, next);
next             1313 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&requests, request, next);
next             1600 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(header, headers, next) {
next             1616 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(headers, header, next);
next             1633 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(header, headers, next) {
next             1642 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_REMOVE(headers, header, next);
next             1706 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_INSERT_TAIL(headers, header, next);
next             2264 opal/mca/event/libevent2022/libevent/http.c        TAILQ_INSERT_TAIL(&evcon->requests, req, next);
next             2274 opal/mca/event/libevent2022/libevent/http.c 		       TAILQ_REMOVE(&evcon->requests, req, next);
next             2309 opal/mca/event/libevent2022/libevent/http.c 			TAILQ_REMOVE(&evcon->requests, req, next);
next             2348 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_REMOVE(&evcon->requests, req, next);
next             2890 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(cb, callbacks, next) {
next             2945 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(alias, &http->aliases, next) {
next             3166 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_INSERT_TAIL(&http->sockets, bound, next);
next             3187 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_REMOVE(&http->sockets, bound, next);
next             3265 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&http->sockets, bound, next);
next             3278 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&http->callbacks, http_cb, next);
next             3293 opal/mca/event/libevent2022/libevent/http.c 		TAILQ_REMOVE(&http->aliases, alias, next);
next             3348 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_INSERT_TAIL(&http->aliases, evalias, next);
next             3358 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(evalias, &http->aliases, next) {
next             3360 opal/mca/event/libevent2022/libevent/http.c 			TAILQ_REMOVE(&http->aliases, evalias, next);
next             3406 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(http_cb, &http->callbacks, next) {
next             3425 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_INSERT_TAIL(&http->callbacks, http_cb, next);
next             3435 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_FOREACH(http_cb, &http->callbacks, next) {
next             3442 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_REMOVE(&http->callbacks, http_cb, next);
next             3738 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_INSERT_TAIL(&evcon->requests, req, next);
next             3771 opal/mca/event/libevent2022/libevent/http.c 	TAILQ_INSERT_TAIL(&http->connections, evcon, next);
next               59 opal/mca/event/libevent2022/libevent/include/event2/http_struct.h 	TAILQ_ENTRY(evhttp_request) next;
next               64 opal/mca/event/libevent2022/libevent/include/event2/http_struct.h }       next;
next               59 opal/mca/event/libevent2022/libevent/include/event2/keyvalq_struct.h 	TAILQ_ENTRY(evkeyval) next;
next               60 opal/mca/event/libevent2022/libevent/include/event2/rpc_struct.h 	TAILQ_ENTRY(evrpc) next;
next              126 opal/mca/event/libevent2022/libevent/sample/http-server.c 	    header = header->next.tqe_next) {
next               85 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		if (&chain->next == buf->last_with_datap)
next               88 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		if (chain->next == NULL) {
next               92 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		chain = chain->next;
next              105 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		chain = chain->next;
next              108 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 			chain = chain->next;
next              134 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		chain = chain->next;
next              141 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		if (chain->next && chain->next->off)
next              143 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		chain = chain->next;
next              151 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		if (chain->next && chain->next->off)
next              153 opal/mca/event/libevent2022/libevent/test/regress_buffer.c 		chain = chain->next;
next              275 opal/mca/event/libevent2022/libevent/test/regress_iocp.c 	for (chain = buf->first; chain; chain = chain->next)
next              392 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     char *next;
next              393 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     val = strtoul(current, &next, 16);
next              404 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     if (*next != ',') {
next              405 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c       if (*next || count > 0)
next              410 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     current = (const char*) next+1;
next              490 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c   char *next;
next              501 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     val = strtoul(current, &next, 0);
next              503 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     if (next == current)
next              511 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     } else if (*next == '-') {
next              513 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c       if (*(next+1) == '\0') {
next              522 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     } else if (*next == ',' || *next == ' ' || *next == '\0') {
next              527 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     if (*next == '\0')
next              529 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     current = next+1;
next              667 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     char *next;
next              675 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     val = strtoul(ustr, &next, 16);
next              676 opal/mca/hwloc/hwloc201/hwloc/hwloc/bitmap.c     if (*next != '\0')
next               73 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   struct hwloc__plugin_desc *next;
next              155 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   desc->next = NULL;
next              162 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     prevdesc = &((*prevdesc)->next);
next              177 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   struct hwloc__plugin_desc *desc, *next;
next              184 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     next = desc->next;
next              189 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     desc = next;
next              286 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c 	*prev = (*prev)->next;
next              295 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     prev = &((*prev)->next);
next              306 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     prev = &((*prev)->next);
next              308 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   component->next = *prev;
next              347 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   for(desc = hwloc_plugins; NULL != desc; desc = desc->next)
next              387 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   for(desc = hwloc_plugins; NULL != desc; desc = desc->next) {
next              433 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     comp = comp->next;
next              590 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c       comp = comp->next;
next              601 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c       backend = backend->next;
next              654 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   backend->next = NULL;
next              690 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     pprev = &((*pprev)->next);
next              700 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     pprev = &((*pprev)->next);
next              701 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c   backend->next = *pprev;
next              731 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     backend = backend->next;
next              745 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     backend = backend->next;
next              765 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     backend = backend->next;
next              776 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     struct hwloc_backend *next = backend->next;
next              781 opal/mca/hwloc/hwloc201/hwloc/hwloc/components.c     topology->backends = next;
next               12 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 	hwloc_topology_diff_t next;
next               14 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 		next = diff->generic.next;
next               32 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 		diff = next;
next               46 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 		(*lastdiffp)->generic.next = newdiff;
next               50 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 	newdiff->generic.next = NULL;
next              330 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 			tmpdiff = tmpdiff->generic.next;
next              369 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 			dist1 = dist1->next;
next              370 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 			dist2 = dist2->next;
next              479 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 		tmpdiff = tmpdiff->generic.next;
next              488 opal/mca/hwloc/hwloc201/hwloc/hwloc/diff.c 		tmpdiff = tmpdiff->generic.next;
next               82 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   struct hwloc_internal_distances_s *dist, *next = topology->first_dist;
next               83 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   while ((dist = next) != NULL) {
next               84 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c     next = dist->next;
next              118 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   newdist->next = NULL;
next              121 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c     new->last_dist->next = newdist;
next              135 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   for(olddist = old->first_dist; olddist; olddist = olddist->next) {
next              159 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   struct hwloc_internal_distances_s *dist, *next;
next              174 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   next = topology->first_dist;
next              175 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   while ((dist = next) != NULL) {
next              176 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c     next = dist->next;
next              178 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c       if (next)
next              179 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c 	next->prev = dist->prev;
next              183 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c 	dist->prev->next = dist->next;
next              185 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c 	topology->first_dist = dist->next;
next              248 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c     topology->last_dist->next = dist;
next              252 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   dist->next = NULL;
next              497 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   struct hwloc_internal_distances_s *dist, *next;
next              499 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   for(dist = topology->first_dist; dist; dist = next) {
next              500 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c     next = dist->next;
next              505 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c 	dist->prev->next = next;
next              507 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c 	topology->first_dist = next;
next              508 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c       if (next)
next              509 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c 	next->prev = dist->prev;
next              522 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   for(dist = topology->first_dist; dist; dist = dist->next)
next              601 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c   for(dist = topology->first_dist; dist; dist = dist->next) {
next               90 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c     char *next = NULL;
next               95 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c 	next = &tmp[len]+1;
next              100 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c     if (next)
next              101 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c       tmp = next;
next             2479 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c     char *tmp, *next;
next             2491 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c       unsigned distance = strtoul(tmp, &next, 0); /* stored as a %d */
next             2492 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c       if (next == tmp)
next             2499 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c       tmp = next+1;
next             3773 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c     hwloc_obj_t next = packages->next_cousin;
next             3776 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c     packages = next;
next             5940 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c     tmpbackend = tmpbackend->next;
next               36 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c   unsigned next; /* id of the next object for that level */
next               49 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c     struct hwloc_synthetic_attached_s *next;
next               96 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c       const char *next;
next               97 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c       unsigned idx = strtoul(attr, (char **) &next, 10);
next               98 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c       if (next == attr) {
next              106 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c 	if (*next != ',') {
next              111 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c 	attr = next+1;
next              113 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c 	attr = next;
next              405 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c       *pprev = cur->next;
next              494 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c 	attached->next = NULL;
next              497 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c 	  pprev = &((*pprev)->next);
next              856 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c   unsigned os_index = indexes->next++;
next              893 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c   hwloc_synthetic_insert_attached(topology, data, attached->next, set);
next              969 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c     data->level[i].indexes.next = 0;
next              970 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c   data->numa_attached_indexes.next = 0;
next              972 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c   data->level[i].indexes.next = 0;
next               69 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c     attr = lstate->attr->next;
next               72 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c   for (; attr; attr = attr->next)
next               76 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c       for (subnode = attr->children; subnode; subnode = subnode->next) {
next              114 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c     lstate->child = child->next;
next              628 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c       v1dist->next = NULL;
next              630 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	data->last_v1dist->next = v1dist;
next             1148 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c     hwloc_obj_t cur, next;
next             1149 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c     for(cur = obj->first_child, next = cur->next_sibling;
next             1150 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	next;
next             1151 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	cur = next, next = next->next_sibling) {
next             1157 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c       if (hwloc_bitmap_compare_first(next->complete_cpuset, cur->complete_cpuset) < 0) {
next             1162 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	    hwloc__xml_import_report_outoforder(topology, next, cur);
next             1298 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	char *next;
next             1299 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	unsigned long long u = strtoull(tmp, &next, 0);
next             1300 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	if (next == tmp)
next             1303 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	if (*next != ' ')
next             1307 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	tmp = next+1;
next             1321 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	char *next;
next             1322 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	unsigned long long u = strtoull(tmp, &next, 0);
next             1323 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	if (next == tmp)
next             1326 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	if (*next != ' ')
next             1330 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	tmp = next+1;
next             1502 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c 	(*lastdiffp)->generic.next = diff;
next             1506 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c       diff->generic.next = NULL;
next             1695 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c       v1next = v1dist->next;
next             2116 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c     for(dist = topology->first_dist; dist; dist = dist->next) {
next             2317 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c   for(dist = topology->first_dist; dist; dist = dist->next) {
next             2396 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c     diff = diff->generic.next;
next             2516 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c     tmpdiff = tmpdiff->generic.next;
next             2557 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c     tmpdiff = tmpdiff->generic.next;
next             3009 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c     backend = backend->next;
next             3120 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c     backend = backend->next;
next              131 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/diff.h     union hwloc_topology_diff_u * next; /* pointer to the next element of the list, or NULL */
next              137 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/diff.h     union hwloc_topology_diff_u * next;
next              147 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/diff.h     union hwloc_topology_diff_u * next;
next               88 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   hwloc_obj_t next = hwloc_get_next_obj_by_depth(topology, depth, prev);
next               89 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   if (!next)
next               91 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   while (next && (hwloc_bitmap_iszero(next->cpuset) || !hwloc_bitmap_isincluded(next->cpuset, set)))
next               92 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h     next = next->next_cousin;
next               93 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   return next;
next              324 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   hwloc_obj_t next = hwloc_get_next_obj_by_depth(topology, depth, prev);
next              325 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   if (!next)
next              327 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   while (next && !hwloc_bitmap_intersects(set, next->cpuset))
next              328 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h     next = next->next_cousin;
next              329 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h   return next;
next               98 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/plugins.h   struct hwloc_disc_component * next;
next              128 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/plugins.h   struct hwloc_backend * next;
next              188 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h  (add)->hh.next = NULL;                                                          \
next              196 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h     (head)->hh.tbl->tail->next = (add);                                          \
next              230 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h     if ( ((delptr)->hh.prev == NULL) && ((delptr)->hh.next == NULL) )  {         \
next              246 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                     (head)->hh.tbl->hho))->next = (delptr)->hh.next;             \
next              248 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h             DECLTYPE_ASSIGN(head,(delptr)->hh.next);                             \
next              250 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h         if (_hd_hh_del->next != NULL) {                                          \
next              251 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h             ((UT_hash_handle*)((ptrdiff_t)_hd_hh_del->next +                     \
next              332 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h            _thh = ( _thh->next ?  (UT_hash_handle*)((char*)(_thh->next) +        \
next              756 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                   _hs_q = (UT_hash_handle*)((_hs_q->next != NULL) ?              \
next              757 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                           ((void*)((char*)(_hs_q->next) +                        \
next              765 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                       _hs_q = (UT_hash_handle*)((_hs_q->next != NULL) ?          \
next              766 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                               ((void*)((char*)(_hs_q->next) +                    \
next              772 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                         _hs_p = (UT_hash_handle*)((_hs_p->next != NULL) ?        \
next              773 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                                 ((void*)((char*)(_hs_p->next) +                  \
next              783 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                         _hs_p = (UT_hash_handle*)((_hs_p->next != NULL) ?        \
next              784 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                                ((void*)((char*)(_hs_p->next) +                   \
next              790 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                       _hs_q = (UT_hash_handle*)((_hs_q->next != NULL) ?          \
next              791 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                               ((void*)((char*)(_hs_q->next) +                    \
next              796 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h                       _hs_tail->next = ((_hs_e != NULL) ?                        \
next              810 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h             _hs_tail->next = NULL;                                               \
next              846 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h             _dst_hh->next = NULL;                                                \
next              847 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h             if (_last_elt_hh != NULL) { _last_elt_hh->next = _elt; }             \
next              886 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for(((el)=(head)), ((*(char**)(&(tmp)))=(char*)((head!=NULL)?(head)->hh.next:NULL)); \
next              887 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h   (el) != NULL; ((el)=(tmp)), ((*(char**)(&(tmp)))=(char*)((tmp!=NULL)?(tmp)->hh.next:NULL)))
next              890 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h for(((el)=(head)), ((tmp)=DECLTYPE(el)((head!=NULL)?(head)->hh.next:NULL));      \
next              891 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h   (el) != NULL; ((el)=(tmp)), ((tmp)=DECLTYPE(el)((tmp!=NULL)?(tmp)->hh.next:NULL)))
next              958 opal/mca/hwloc/hwloc201/hwloc/include/netloc/uthash.h    void *next;                       /* next element in app order      */
next              144 opal/mca/hwloc/hwloc201/hwloc/include/private/private.h     struct hwloc_internal_distances_s *prev, *next;
next               35 opal/mca/hwloc/hwloc201/hwloc/include/private/xml.h   struct hwloc__xml_imported_v1distances_s *prev, *next;
next               86 opal/mca/memory/base/memory_base_open.c     mca_base_component_list_item_t *item, *next;
next              103 opal/mca/memory/base/memory_base_open.c     OPAL_LIST_FOREACH_SAFE(item, next, &opal_memory_base_framework.framework_components, mca_base_component_list_item_t) {
next              117 opal/mca/pmix/pmix4x/pmix/src/class/pmix_list.c     volatile pmix_list_item_t *ptr, *next;
next              138 opal/mca/pmix/pmix4x/pmix/src/class/pmix_list.c         next = ptr->pmix_list_next;
next              139 opal/mca/pmix/pmix4x/pmix/src/class/pmix_list.c         item->pmix_list_next = next;
next              141 opal/mca/pmix/pmix4x/pmix/src/class/pmix_list.c         next->pmix_list_prev = item;
next              253 opal/mca/pmix/pmix4x/pmix/src/class/pmix_list.h #define PMIX_LIST_FOREACH_SAFE(item, next, list, type)                  \
next              255 opal/mca/pmix/pmix4x/pmix/src/class/pmix_list.h          next = (type *) ((pmix_list_item_t *) (item))->pmix_list_next ;\
next              257 opal/mca/pmix/pmix4x/pmix/src/class/pmix_list.h        item = next, next = (type *) ((pmix_list_item_t *) (item))->pmix_list_next)
next              527 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     const char *tmp = line, *next;
next              531 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     value = strtoull(tmp, (char **) &next, 16);
next              532 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     if (next == tmp) {
next              538 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     if (*next != '-') {
next              542 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c      tmp = next + 1;
next              544 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     value = strtoull(tmp, (char **) &next, 16);
next              545 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     if (next == tmp) {
next              549 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     tmp = next;
next              551 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     if (*next != ' ') {
next              554 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     tmp = next + 1;
next              557 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     next = strchr(tmp, '/');
next              558 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c     if (next) {
next              562 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c         next = strchr(tmp, '[');
next              563 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c         if (next) {
next              564 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c             if (!strncmp(next, "[heap]", 6)) {
next              566 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c             } else if (!strncmp(next, "[stack]", 7)) {
next              570 opal/mca/pmix/pmix4x/pmix/src/hwloc/hwloc.c                 if ((end = strchr(next, '\n')) != NULL) {
next              175 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_component_find.c     pmix_mca_base_component_list_item_t *cli, *next;
next              192 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_component_find.c     PMIX_LIST_FOREACH_SAFE(cli, next, components, pmix_mca_base_component_list_item_t) {
next               74 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_components_close.c     pmix_mca_base_component_list_item_t *cli, *next;
next               81 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_components_close.c     PMIX_LIST_FOREACH_SAFE(cli, next, components, pmix_mca_base_component_list_item_t) {
next               82 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_components_open.c     pmix_mca_base_component_list_item_t *cli, *next;
next              111 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_components_open.c     PMIX_LIST_FOREACH_SAFE(cli, next, components, pmix_mca_base_component_list_item_t) {
next               77 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_components_register.c     pmix_mca_base_component_list_item_t *cli, *next;
next               87 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_components_register.c     PMIX_LIST_FOREACH_SAFE(cli, next, &framework->framework_components, pmix_mca_base_component_list_item_t) {
next              197 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c     char *ptr, *next;
next              210 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c         next = strchr(ptr, ',');
next              211 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c         if (NULL != next) {
next              212 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c             *next = '\0';
next              272 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c         if (NULL == next) {
next              275 opal/mca/pmix/pmix4x/pmix/src/mca/base/pmix_mca_base_open.c         ptr = next + 1;
next              646 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         while(NULL != tmp->next) {
next              647 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp = tmp->next;
next              674 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp->next = seg;
next              682 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         while(NULL != tmp->next) {
next              683 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp = tmp->next;
next              711 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp->next = seg;
next              775 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         if (NULL == tmp->next && 1 == *((size_t*)((uint8_t*)(tmp->seg_info.seg_base_addr) + sizeof(size_t)))) {
next              776 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp->next = pmix_common_dstor_attach_new_segment(PMIX_DSTORE_INITIAL_SEGMENT, ds_ctx->base_path,
next              779 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         tmp = tmp->next;
next              814 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         tmp = tmp->next;
next              881 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp = tmp->next;
next              891 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         while (NULL != tmp->next && 0 != id) {
next              892 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp = tmp->next;
next              929 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         while (NULL != tmp->next) {
next              930 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp = tmp->next;
next              970 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         while (NULL != tmp->next && 0 != count) {
next              971 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c             tmp = tmp->next;
next             1021 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         tmp = tmp->next;
next             1034 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c     while (NULL != tmp->next) {
next             1035 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         tmp = tmp->next;
next             1085 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c     while (NULL != tmp->next) {
next             1086 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c         tmp = tmp->next;
next             1338 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c                 while (NULL != ldesc->next) {
next             1339 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_base.c                     ldesc = ldesc->next;
next              106 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c             new_seg->next = NULL;
next              145 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c     new_seg->next = NULL;
next              197 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c         new_seg->next = NULL;
next              235 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c     new_seg->next = NULL;
next              282 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c     while (NULL != tmp->next) {
next              283 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c         tmp = tmp->next;
next              287 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c     tmp->next = seg;
next              298 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.c         tmp = desc->next;
next               47 opal/mca/pmix/pmix4x/pmix/src/mca/common/dstore/dstore_segment.h     pmix_dstore_seg_desc_t *next;
next              536 opal/mca/pmix/pmix4x/pmix/src/mca/pnet/base/pnet_base_fns.c     pmix_kval_t *kv, *next;
next              585 opal/mca/pmix/pmix4x/pmix/src/mca/pnet/base/pnet_base_fns.c             PMIX_LIST_FOREACH_SAFE(kv, next, ilist, pmix_kval_t) {
next              460 opal/mca/pmix/pmix4x/pmix/src/mca/pnet/opa/pnet_opa.c     pmix_kval_t *kv, *next;
next              476 opal/mca/pmix/pmix4x/pmix/src/mca/pnet/opa/pnet_opa.c     PMIX_LIST_FOREACH_SAFE(kv, next, &nptr->setup_data, pmix_kval_t) {
next              591 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c                     goto next;
next              662 opal/mca/pmix/pmix4x/pmix/src/mca/ptl/usock/ptl_usock.c     next:
next              122 opal/mca/pmix/pmix4x/pmix/src/runtime/pmix_progress_threads.c     pmix_event_caddy_t *cd, *next;
next              123 opal/mca/pmix/pmix4x/pmix/src/runtime/pmix_progress_threads.c     PMIX_LIST_FOREACH_SAFE(cd, next, &trk->list, pmix_event_caddy_t) {
next               50 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.c         sync->next = sync->prev = sync;
next               54 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.c         sync->prev->next = sync;
next               55 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.c         sync->next = wait_sync_list;
next               91 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.c     sync->prev->next = sync->next;
next               92 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.c     sync->next->prev = sync->prev;
next               95 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.c         wait_sync_list = (sync == sync->next) ? NULL : sync->next;
next               35 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.h     struct pmix_wait_sync_t *next;
next               88 opal/mca/pmix/pmix4x/pmix/src/threads/wait_sync.h         (sync)->next = NULL;                                    \
next              260 opal/mca/pmix/pmix4x/pmix/src/util/timings.c     pmix_timing_event_t *ev, *next;
next              270 opal/mca/pmix/pmix4x/pmix/src/util/timings.c     PMIX_LIST_FOREACH_SAFE(ev, next, t->events, pmix_timing_event_t){
next              230 opal/mca/pmix/pmix4x/pmix/test/server_callbacks.c     pmix_test_info_t *iptr, *next;
next              234 opal/mca/pmix/pmix4x/pmix/test/server_callbacks.c     PMIX_LIST_FOREACH_SAFE(iptr, next, pmix_test_published_list, pmix_test_info_t) {
next               62 opal/mca/pmix/pmix4x/pmix/test/test_fence.c     participant_t *p, *next;
next              166 opal/mca/pmix/pmix4x/pmix/test/test_fence.c             PMIX_LIST_FOREACH_SAFE(p, next, desc->participants, participant_t) {
next              302 opal/mca/pmix/pmix4x/pmix/test/test_server.c     server_info_t *server, *next;
next              314 opal/mca/pmix/pmix4x/pmix/test/test_server.c     PMIX_LIST_FOREACH_SAFE(server, next, server_list, server_info_t) {
next              326 opal/mca/pmix/pmix4x/pmix/test/test_server.c             PMIX_LIST_FOREACH_SAFE(server, next, server_list, server_info_t) {
next              107 opal/mca/rcache/base/rcache_base_create.c     mca_rcache_base_selected_module_t *sm, *next;
next              109 opal/mca/rcache/base/rcache_base_create.c     OPAL_LIST_FOREACH_SAFE(sm, next, &mca_rcache_base_modules, mca_rcache_base_selected_module_t) {
next              121 opal/memoryhooks/memory.c     callback_list_item_t *cbitem, *next;
next              136 opal/memoryhooks/memory.c     OPAL_LIST_FOREACH_SAFE(cbitem, next, &release_cb_list, callback_list_item_t) {
next              133 opal/runtime/opal_finalize.c     opal_cleanup_fn_item_t *cleanup_item, *next;
next              135 opal/runtime/opal_finalize.c     OPAL_LIST_FOREACH_SAFE_REV(cleanup_item, next, &domain->super, opal_cleanup_fn_item_t) {
next               52 opal/threads/wait_sync.c         sync->next = sync->prev = sync;
next               56 opal/threads/wait_sync.c         sync->prev->next = sync;
next               57 opal/threads/wait_sync.c         sync->next = wait_sync_list;
next               95 opal/threads/wait_sync.c     sync->prev->next = sync->next;
next               96 opal/threads/wait_sync.c     sync->next->prev = sync->prev;
next               99 opal/threads/wait_sync.c         wait_sync_list = (sync == sync->next) ? NULL : sync->next;
next               35 opal/threads/wait_sync.h     struct ompi_wait_sync_t *next;
next               95 opal/threads/wait_sync.h         (sync)->next = NULL;                                    \
next              210 opal/util/bipartite_graph.c     opal_bp_graph_edge_t *e, *next;
next              216 opal/util/bipartite_graph.c         LIST_FOREACH_SAFE_CONTAINED(e, next, &v->out_edges,
next              225 opal/util/bipartite_graph.c         LIST_FOREACH_SAFE_CONTAINED(e, next, &v->in_edges,
next               87 opal/util/bipartite_graph_internal.h #define LIST_FOREACH_SAFE_CONTAINED(item, next, list, type, member)	\
next               89 opal/util/bipartite_graph_internal.h 	     next = container_of(					\
next               92 opal/util/bipartite_graph_internal.h 	 item = next,							\
next               93 opal/util/bipartite_graph_internal.h 	     next = container_of(					\
next              533 opal/util/stacktrace.c     char * next;
next              570 opal/util/stacktrace.c         next = strchr(opal_stacktrace_output_filename, ':');
next              571 opal/util/stacktrace.c         next++; // move past the ':' to the filename specified
next              573 opal/util/stacktrace.c         opal_stacktrace_output_filename_base = strdup(next);
next              599 opal/util/stacktrace.c     for (tmp = next = opal_signal_string ;
next              600 opal/util/stacktrace.c 	 next != NULL && *next != '\0';
next              601 opal/util/stacktrace.c 	 tmp = next + 1)
next              607 opal/util/stacktrace.c       sig = strtol (tmp, &next, 10);
next              613 opal/util/stacktrace.c       if (((0 == sig) && (tmp == next)) || (0 > sig) || (_NSIG <= sig)) {
next              618 opal/util/stacktrace.c       } else if (next == NULL) {
next              620 opal/util/stacktrace.c       } else if (':' == *next &&
next              621 opal/util/stacktrace.c                  0 == strncasecmp(next, ":complain", 9)) {
next              623 opal/util/stacktrace.c           next += 9;
next              624 opal/util/stacktrace.c       } else if (',' != *next && '\0' != *next) {
next              443 orte/mca/iof/hnp/iof_hnp.c     orte_iof_proc_t *proct, *next;
next              446 orte/mca/iof/hnp/iof_hnp.c     OPAL_LIST_FOREACH_SAFE(proct, next, &mca_iof_hnp_component.procs, orte_iof_proc_t) {
next               63 orte/mca/iof/hnp/iof_hnp_receive.c     orte_iof_sink_t *sink, *next;
next              188 orte/mca/iof/hnp/iof_hnp_receive.c             OPAL_LIST_FOREACH_SAFE(sink, next, proct->subscribers, orte_iof_sink_t) {
next              337 orte/mca/iof/orted/iof_orted.c     orte_iof_proc_t *proct, *next;
next              340 orte/mca/iof/orted/iof_orted.c     OPAL_LIST_FOREACH_SAFE(proct, next, &mca_iof_orted_component.procs, orte_iof_proc_t) {
next             1396 orte/mca/plm/base/plm_base_launch_support.c                         goto next;
next             1402 orte/mca/plm/base/plm_base_launch_support.c                   next:
next             1769 orte/mca/plm/base/plm_base_launch_support.c     opal_list_item_t *item, *next;
next             2172 orte/mca/plm/base/plm_base_launch_support.c             next = opal_list_get_next(item);
next             2183 orte/mca/plm/base/plm_base_launch_support.c             item = next;
next              486 orte/mca/ras/base/ras_base_allocate.c     orte_node_t *node, *next, *nptr;
next              563 orte/mca/ras/base/ras_base_allocate.c         OPAL_LIST_FOREACH_SAFE(node, next, &nodes, orte_node_t) {
next              144 orte/mca/rmaps/base/rmaps_base_support_fns.c     orte_node_t *node, *nd, *nptr, *next;
next              215 orte/mca/rmaps/base/rmaps_base_support_fns.c         OPAL_LIST_FOREACH_SAFE(nptr, next, &nodes, orte_node_t) {
next              416 orte/mca/rmaps/base/rmaps_base_support_fns.c         OPAL_LIST_FOREACH_SAFE(node, next, allocated_nodes, orte_node_t) {
next              483 orte/mca/rmaps/resilient/rmaps_resilient.c     opal_list_item_t *item, *next;
next              570 orte/mca/rmaps/resilient/rmaps_resilient.c         next = opal_list_get_next(item);
next              582 orte/mca/rmaps/resilient/rmaps_resilient.c             item = next;
next              611 orte/mca/rmaps/resilient/rmaps_resilient.c             item = next;
next              703 orte/mca/rmaps/resilient/rmaps_resilient.c     opal_list_item_t *item, *next, *curitem;
next              752 orte/mca/rmaps/resilient/rmaps_resilient.c             next = opal_list_get_next(item);
next              760 orte/mca/rmaps/resilient/rmaps_resilient.c             item = next;
next              128 orte/mca/rml/base/rml_base_msg_handlers.c     opal_list_item_t *item, *next;
next              138 orte/mca/rml/base/rml_base_msg_handlers.c         next = opal_list_get_next(item);
next              157 orte/mca/rml/base/rml_base_msg_handlers.c         item = next;
next              430 orte/mca/routed/debruijn/routed_debruijn.c             int next = ((my_vpid << log_npeers) | i) & rank_mask;
next              433 orte/mca/routed/debruijn/routed_debruijn.c             if (next > my_vpid && next < (int)orte_process_info.num_procs) {
next              435 orte/mca/routed/debruijn/routed_debruijn.c                 child->vpid = next;
next              465 orte/mca/rtc/hwloc/rtc_hwloc.c     const char *tmp = line, *next;
next              469 orte/mca/rtc/hwloc/rtc_hwloc.c     value = strtoull(tmp, (char **) &next, 16);
next              470 orte/mca/rtc/hwloc/rtc_hwloc.c     if (next == tmp) {
next              476 orte/mca/rtc/hwloc/rtc_hwloc.c     if (*next != '-') {
next              480 orte/mca/rtc/hwloc/rtc_hwloc.c      tmp = next + 1;
next              482 orte/mca/rtc/hwloc/rtc_hwloc.c     value = strtoull(tmp, (char **) &next, 16);
next              483 orte/mca/rtc/hwloc/rtc_hwloc.c     if (next == tmp) {
next              487 orte/mca/rtc/hwloc/rtc_hwloc.c     tmp = next;
next              489 orte/mca/rtc/hwloc/rtc_hwloc.c     if (*next != ' ') {
next              492 orte/mca/rtc/hwloc/rtc_hwloc.c     tmp = next + 1;
next              495 orte/mca/rtc/hwloc/rtc_hwloc.c     next = strchr(tmp, '/');
next              496 orte/mca/rtc/hwloc/rtc_hwloc.c     if (next) {
next              500 orte/mca/rtc/hwloc/rtc_hwloc.c         next = strchr(tmp, '[');
next              501 orte/mca/rtc/hwloc/rtc_hwloc.c         if (next) {
next              502 orte/mca/rtc/hwloc/rtc_hwloc.c             if (!strncmp(next, "[heap]", 6)) {
next              504 orte/mca/rtc/hwloc/rtc_hwloc.c             } else if (!strncmp(next, "[stack]", 7)) {
next              508 orte/mca/rtc/hwloc/rtc_hwloc.c                 if ((end = strchr(next, '\n')) != NULL) {
next              512 orte/mca/rtc/hwloc/rtc_hwloc.c                                     "Found special VMA \"%s\" before stack", next);
next              928 orte/mca/state/base/state_base_fns.c             goto next;
next              966 orte/mca/state/base/state_base_fns.c             goto next;
next              970 orte/mca/state/base/state_base_fns.c             goto next;
next              995 orte/mca/state/base/state_base_fns.c       next:
next              172 orte/orted/pmix/pmix_server_dyn.c     opal_value_t *info, *next;
next              280 orte/orted/pmix/pmix_server_dyn.c     OPAL_LIST_FOREACH_SAFE(info, next, job_info, opal_value_t) {
next              353 orte/runtime/orte_quit.c             goto next;
next              383 orte/runtime/orte_quit.c                 goto next;
next              392 orte/runtime/orte_quit.c       next:
next               12 orte/test/mpi/iof.c     int i, rank, size, next, prev, tag = 201;
next               23 orte/test/mpi/iof.c     next = (rank + 1) % size;
next               11 orte/test/mpi/ring.c     int i, rank, size, next, prev, tag = 201;
next               23 orte/test/mpi/ring.c     next = (rank + 1) % size;
next               35 orte/test/mpi/ring.c         MPI_Send(send_array, array_size, MPI_INT, next, tag,
next               47 orte/test/mpi/ring.c         MPI_Send(send_array, array_size, MPI_INT, next, tag, MPI_COMM_WORLD);
next               88 orte/test/mpi/xlib.c     int i, rank, size, next, prev, tag = 201;
next              156 orte/test/mpi/xlib.c     next = (rank + 1) % size;
next              168 orte/test/mpi/xlib.c         MPI_Send(send_array, array_size, MPI_INT, next, tag,
next              198 orte/test/mpi/xlib.c         MPI_Send(send_array, array_size, MPI_INT, next, tag, MPI_COMM_WORLD);
next               98 orte/util/attr.c     orte_attribute_t *kv, *end, *next;
next              121 orte/util/attr.c     next = (orte_attribute_t*)opal_list_get_next(&prev->super);
next              122 orte/util/attr.c     while (NULL != next) {
next              123 orte/util/attr.c         if (next->key == key) {
next              124 orte/util/attr.c             return next;
next              126 orte/util/attr.c         next = (orte_attribute_t*)opal_list_get_next(&next->super);
next              457 orte/util/dash_host/dash_host.c     opal_list_item_t *next;
next              517 orte/util/dash_host/dash_host.c                 next = opal_list_get_next(item);  /* save this position */
next              540 orte/util/dash_host/dash_host.c                 item = next;
next              554 orte/util/dash_host/dash_host.c                 next = opal_list_get_next(item);  /* save this position */
next              590 orte/util/dash_host/dash_host.c                 item = next;
next              623 orte/util/hostfile/hostfile.c     opal_list_item_t *item1, *item2, *next, *item3;
next              679 orte/util/hostfile/hostfile.c         next = opal_list_get_next(item2);
next              704 orte/util/hostfile/hostfile.c                     next = opal_list_get_next(item1);  /* keep our place */
next              730 orte/util/hostfile/hostfile.c                     item1 = next;
next              118 orte/util/show_help.c     opal_list_item_t *item, *next;
next              128 orte/util/show_help.c          item = next) {
next              129 orte/util/show_help.c         next = opal_list_get_next(item);
next               50 oshmem/mca/atomic/base/atomic_base_available.c     mca_base_component_list_item_t *cli, *next;
next               53 oshmem/mca/atomic/base/atomic_base_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &oshmem_atomic_base_framework.framework_components, mca_base_component_list_item_t) {
next               58 oshmem/mca/atomic/base/atomic_base_frame.c     mca_base_component_list_item_t *cli, *next;
next               61 oshmem/mca/atomic/base/atomic_base_frame.c     OPAL_LIST_FOREACH_SAFE(cli, next, &oshmem_atomic_base_framework.framework_components, mca_base_component_list_item_t) {
next             2205 oshmem/mca/memheap/ptmalloc/malloc.c   struct malloc_segment* next;   /* ptr to next segment */
next             2417 oshmem/mca/memheap/ptmalloc/malloc.c     if ((sp = sp->next) == 0)
next             2428 oshmem/mca/memheap/ptmalloc/malloc.c     if ((sp = sp->next) == 0)
next             2940 oshmem/mca/memheap/ptmalloc/malloc.c   mchunkptr next = chunk_plus_offset(p, sz);
next             2949 oshmem/mca/memheap/ptmalloc/malloc.c       dl_assert(next->prev_foot == sz);
next             2951 oshmem/mca/memheap/ptmalloc/malloc.c       assert (next == m->top || cinuse(next));
next             3121 oshmem/mca/memheap/ptmalloc/malloc.c       s = s->next;
next             3181 oshmem/mca/memheap/ptmalloc/malloc.c         s = s->next;
next             3219 oshmem/mca/memheap/ptmalloc/malloc.c         s = s->next;
next             3590 oshmem/mca/memheap/ptmalloc/malloc.c   m->seg.next = 0;
next             3667 oshmem/mca/memheap/ptmalloc/malloc.c   m->seg.next = ss;
next             3847 oshmem/mca/memheap/ptmalloc/malloc.c         sp = (NO_SEGMENT_TRAVERSAL) ? 0 : sp->next;
next             3860 oshmem/mca/memheap/ptmalloc/malloc.c           sp = (NO_SEGMENT_TRAVERSAL) ? 0 : sp->next;
next             3897 oshmem/mca/memheap/ptmalloc/malloc.c   msegmentptr sp = pred->next;
next             3901 oshmem/mca/memheap/ptmalloc/malloc.c     msegmentptr next = sp->next;
next             3922 oshmem/mca/memheap/ptmalloc/malloc.c           sp->next = next;
next             3932 oshmem/mca/memheap/ptmalloc/malloc.c     sp = next;
next             4127 oshmem/mca/memheap/ptmalloc/malloc.c     mchunkptr next = chunk_plus_offset(oldp, oldsize);
next             4134 oshmem/mca/memheap/ptmalloc/malloc.c                 ok_next(oldp, next) && ok_pinuse(next))) {
next             4148 oshmem/mca/memheap/ptmalloc/malloc.c       else if (next == m->top && oldsize + m->topsize > nb) {
next             4562 oshmem/mca/memheap/ptmalloc/malloc.c         mchunkptr next = chunk_plus_offset(p, psize);
next             4580 oshmem/mca/memheap/ptmalloc/malloc.c               else if ((next->head & INUSE_BITS) == INUSE_BITS) {
next             4582 oshmem/mca/memheap/ptmalloc/malloc.c                 set_free_with_pinuse(p, psize, next);
next             4591 oshmem/mca/memheap/ptmalloc/malloc.c         if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) {
next             4592 oshmem/mca/memheap/ptmalloc/malloc.c           if (!cinuse(next)) {  /* consolidate forward */
next             4593 oshmem/mca/memheap/ptmalloc/malloc.c             if (next == fm->top) {
next             4605 oshmem/mca/memheap/ptmalloc/malloc.c             else if (next == fm->dv) {
next             4612 oshmem/mca/memheap/ptmalloc/malloc.c               size_t nsize = chunksize(next);
next             4614 oshmem/mca/memheap/ptmalloc/malloc.c               unlink_chunk(fm, next, nsize);
next             4623 oshmem/mca/memheap/ptmalloc/malloc.c             set_free_with_pinuse(p, psize, next);
next             4837 oshmem/mca/memheap/ptmalloc/malloc.c       sp = sp->next;
next             4985 oshmem/mca/memheap/ptmalloc/malloc.c         mchunkptr next = chunk_plus_offset(p, psize);
next             5003 oshmem/mca/memheap/ptmalloc/malloc.c               else if ((next->head & INUSE_BITS) == INUSE_BITS) {
next             5005 oshmem/mca/memheap/ptmalloc/malloc.c                 set_free_with_pinuse(p, psize, next);
next             5014 oshmem/mca/memheap/ptmalloc/malloc.c         if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) {
next             5015 oshmem/mca/memheap/ptmalloc/malloc.c           if (!cinuse(next)) {  /* consolidate forward */
next             5016 oshmem/mca/memheap/ptmalloc/malloc.c             if (next == fm->top) {
next             5028 oshmem/mca/memheap/ptmalloc/malloc.c             else if (next == fm->dv) {
next             5035 oshmem/mca/memheap/ptmalloc/malloc.c               size_t nsize = chunksize(next);
next             5037 oshmem/mca/memheap/ptmalloc/malloc.c               unlink_chunk(fm, next, nsize);
next             5046 oshmem/mca/memheap/ptmalloc/malloc.c             set_free_with_pinuse(p, psize, next);
next               50 oshmem/mca/scoll/base/scoll_base_available.c     mca_base_component_list_item_t *cli, *next;
next               53 oshmem/mca/scoll/base/scoll_base_available.c     OPAL_LIST_FOREACH_SAFE(cli, next, &oshmem_scoll_base_framework.framework_components, mca_base_component_list_item_t) {
next              119 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     sshmem_ucx_shadow_alloc_elem_t *next;
next              146 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     next = &elem[old_count];
next              148 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     if ((next < end) &&                    /* non-last element? */
next              149 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         sshmem_ucx_shadow_is_free(next) && /* next is free */
next              150 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         (old_count + next->block_size >= count))
next              152 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         assert(elem < next);
next              153 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         assert(elem + count > next);
next              155 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         assert(next + next->block_size <= end);
next              157 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         if (old_count + next->block_size > count) {
next              159 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c                                        old_count + next->block_size - count);
next              162 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         sshmem_ucx_shadow_set_elem(next, 0, 0);
next               36 oshmem/shmem/c/shmem_lock.c     struct oshmem_lock_counter *next;
next               44 oshmem/shmem/c/shmem_lock.c     struct oshmem_lock_prev_pe_container *next;
next              156 oshmem/shmem/c/shmem_lock.c         current_counter = current_counter->next;
next              164 oshmem/shmem/c/shmem_lock.c         current_pe_container = current_pe_container->next;
next              536 oshmem/shmem/c/shmem_lock.c         current_counter = current_counter->next;
next              552 oshmem/shmem/c/shmem_lock.c         counter->next = lock_counter_head;
next              560 oshmem/shmem/c/shmem_lock.c         lock_counter_head->next = 0;
next              573 oshmem/shmem/c/shmem_lock.c         oshmem_lock_counter_t *next = counter->next;
next              575 oshmem/shmem/c/shmem_lock.c         if (next) {
next              576 oshmem/shmem/c/shmem_lock.c             next->prev = prev;
next              580 oshmem/shmem/c/shmem_lock.c             prev->next = next;
next              584 oshmem/shmem/c/shmem_lock.c             lock_counter_head = next;
next              902 oshmem/shmem/c/shmem_lock.c         container = container->next;
next              911 oshmem/shmem/c/shmem_lock.c         container->next = lock_prev_pe_container_head;
next              929 oshmem/shmem/c/shmem_lock.c         container = container->next;
next              933 oshmem/shmem/c/shmem_lock.c         oshmem_lock_prev_pe_container_t *next = container->next;
next              938 oshmem/shmem/c/shmem_lock.c             prev->next = next;
next              940 oshmem/shmem/c/shmem_lock.c         if (next) {
next              941 oshmem/shmem/c/shmem_lock.c             next->prev = prev;
next              944 oshmem/shmem/c/shmem_lock.c             lock_prev_pe_container_head = next;