prev_data          50 ompi/patterns/net/netpatterns_knomial_tree.c     int *prev_data = NULL;
prev_data         193 ompi/patterns/net/netpatterns_knomial_tree.c     prev_data = (int *) malloc( num_nodes*sizeof(int) );
prev_data         194 ompi/patterns/net/netpatterns_knomial_tree.c     if( NULL == prev_data ) {
prev_data         227 ompi/patterns/net/netpatterns_knomial_tree.c         prev_data[i] = hier_ranks[i];
prev_data         247 ompi/patterns/net/netpatterns_knomial_tree.c                 prev_data[myid] += prev_data[exchange_node->reindex_map[j]];
prev_data         264 ompi/patterns/net/netpatterns_knomial_tree.c             current_data[myid] = prev_data[myid];
prev_data         281 ompi/patterns/net/netpatterns_knomial_tree.c                             exchange_node->payload_info[i][j].r_len = prev_data[exchange_node->reindex_map[peer]];
prev_data         324 ompi/patterns/net/netpatterns_knomial_tree.c                             exchange_node->payload_info[i][j].s_len = prev_data[node_rank];
prev_data         333 ompi/patterns/net/netpatterns_knomial_tree.c                         current_data[myid] += prev_data[exchange_node->reindex_map[peer]];
prev_data         346 ompi/patterns/net/netpatterns_knomial_tree.c             prev_data[j] = current_data[j];
prev_data         470 ompi/patterns/net/netpatterns_knomial_tree.c     free(prev_data);
prev_data         492 ompi/patterns/net/netpatterns_knomial_tree.c     if (NULL != prev_data ){
prev_data         493 ompi/patterns/net/netpatterns_knomial_tree.c         free(prev_data);