n_peers 33 ompi/patterns/comm/allgather.c int n_peers, int *ranks_in_comm,ompi_communicator_t *comm) n_peers 74 ompi/patterns/comm/allgather.c if(1 == n_peers) { n_peers 80 ompi/patterns/comm/allgather.c rc = ompi_netpatterns_setup_recursive_doubling_tree_node(n_peers, n_peers 86 ompi/patterns/comm/allgather.c n_extra_nodes=n_peers-my_exchange_node.n_largest_pow_2; n_peers 264 ompi/patterns/comm/allgather.c count*n_peers,dtype,ranks_in_comm[extra_rank], n_peers 277 ompi/patterns/comm/allgather.c count*n_peers,dtype,ranks_in_comm[extra_rank], n_peers 35 ompi/patterns/comm/allreduce.c struct ompi_op_t *op, int n_peers,int *ranks_in_comm, n_peers 61 ompi/patterns/comm/allreduce.c if(1 == n_peers) { n_peers 83 ompi/patterns/comm/allreduce.c rc = ompi_netpatterns_setup_recursive_doubling_tree_node(n_peers, n_peers 35 ompi/patterns/comm/bcast.c int n_peers, int *ranks_in_comm,ompi_communicator_t *comm) n_peers 46 ompi/patterns/comm/bcast.c node_rank=(my_rank_in_group-root+n_peers)%n_peers; n_peers 51 ompi/patterns/comm/bcast.c rc=ompi_netpatterns_setup_narray_tree(2, node_rank, n_peers, n_peers 58 ompi/patterns/comm/bcast.c if(1 == n_peers) { n_peers 66 ompi/patterns/comm/bcast.c peer_rank=(peer_rank+root)%n_peers; n_peers 79 ompi/patterns/comm/bcast.c peer_rank=(peer_rank+root)%n_peers; n_peers 31 ompi/patterns/comm/coll_ops.h ompi_datatype_t *dtype, int my_rank_in_group, int n_peers, n_peers 35 ompi/patterns/comm/coll_ops.h struct ompi_op_t *op, int n_peers,int *ranks_in_comm, n_peers 39 ompi/patterns/comm/coll_ops.h int n_peers, int *ranks_in_comm,ompi_communicator_t n_peers 89 ompi/patterns/net/allreduce.c size_t n_peers,message_extent,len_data_buffer; n_peers 130 ompi/patterns/net/allreduce.c n_peers=opal_list_get_size(peers); n_peers 143 ompi/patterns/net/allreduce.c proc_array=(ompi_proc_t **)malloc(sizeof(ompi_proc_t *)*n_peers); n_peers 156 ompi/patterns/net/allreduce.c ret=ompi_netpatterns_setup_recursive_doubling_tree_node(n_peers,my_rank,&my_exchange_node);