exchange           27 ompi/mca/topo/treematch/treematch/tm_solution.c void exchange(int *sol,int i,int j);
exchange          387 ompi/mca/topo/treematch/treematch/tm_solution.c   exchange(sol,l,m);
exchange          389 ompi/mca/topo/treematch/treematch/tm_solution.c   exchange(sol,l,m);
exchange          474 ompi/mca/topo/treematch/treematch/tm_solution.c 	exchange(sol,l,m);
exchange          494 ompi/mca/topo/treematch/treematch/tm_solution.c 	exchange(sol,history[j][1],history[j][2]);
exchange           19 ompi/mca/topo/treematch/treematch/tm_solution.h void exchange(int *sol,int i,int j);
exchange           37 ompi/patterns/comm/allgather.c     int pair_rank,exchange,extra_rank, n_extra_nodes,n_extra;
exchange          133 ompi/patterns/comm/allgather.c     for(exchange=0 ; exchange < my_exchange_node.n_exchanges ; exchange++) {
exchange          136 ompi/patterns/comm/allgather.c         pair_rank=my_exchange_node.rank_exchanges[exchange];
exchange           40 ompi/patterns/comm/allreduce.c     int pair_rank,exchange,extra_rank;
exchange          164 ompi/patterns/comm/allreduce.c         for(exchange=0 ; exchange < my_exchange_node.n_exchanges ; exchange++) {
exchange          167 ompi/patterns/comm/allreduce.c             pair_rank=my_exchange_node.rank_exchanges[exchange];
exchange          178 ompi/patterns/comm/allreduce.c                         exchange);
exchange           85 ompi/patterns/net/allreduce.c     int pair_rank,exchange,extra_rank;
exchange          242 ompi/patterns/net/allreduce.c         for(exchange=0 ; exchange < my_exchange_node->n_exchanges ; exchange++) {
exchange          253 ompi/patterns/net/allreduce.c             pair_rank=my_exchange_node->rank_exchanges[exchange];
exchange          284 ompi/patterns/net/allreduce.c             index_read=(exchange&1);
exchange          285 ompi/patterns/net/allreduce.c             index_write=((exchange+1)&1);