tree_order 128 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_netpatterns_setup_narray_tree(int tree_order, int my_rank, int num_nodes, tree_order 131 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_netpatterns_setup_narray_knomial_tree( int tree_order, int my_rank, int num_nodes, tree_order 139 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes, tree_order 142 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_netpatterns_setup_narray_tree_contigous_ranks(int tree_order, tree_order 38 ompi/patterns/net/netpatterns_knomial_tree.c int num_nodes, int node_rank, int tree_order, int *hier_ranks, tree_order 57 ompi/patterns/net/netpatterns_knomial_tree.c num_nodes, node_rank, tree_order)); tree_order 60 ompi/patterns/net/netpatterns_knomial_tree.c assert(tree_order > 1); tree_order 61 ompi/patterns/net/netpatterns_knomial_tree.c if (tree_order > num_nodes) { tree_order 62 ompi/patterns/net/netpatterns_knomial_tree.c tree_order = num_nodes; tree_order 66 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->tree_order = tree_order; tree_order 75 ompi/patterns/net/netpatterns_knomial_tree.c cnt *= tree_order; tree_order 87 ompi/patterns/net/netpatterns_knomial_tree.c cnt /= tree_order; tree_order 99 ompi/patterns/net/netpatterns_knomial_tree.c group_info[0] = num_nodes/tree_order; tree_order 102 ompi/patterns/net/netpatterns_knomial_tree.c group_info[i] = group_info[i-1]/tree_order; tree_order 210 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->payload_info[i] = (netpatterns_payload_t *) malloc(sizeof(netpatterns_payload_t)*(tree_order-1)); tree_order 257 ompi/patterns/net/netpatterns_knomial_tree.c k_temp1 = tree_order; /* k^1 */ tree_order 274 ompi/patterns/net/netpatterns_knomial_tree.c FIND_BASE(base,reindex_myid,i+1,tree_order); tree_order 275 ompi/patterns/net/netpatterns_knomial_tree.c for( j = 0; j < ( tree_order - 1 ); j ++ ) { tree_order 286 ompi/patterns/net/netpatterns_knomial_tree.c FIND_BASE(peer_base,peer,i,tree_order); tree_order 297 ompi/patterns/net/netpatterns_knomial_tree.c FIND_BASE(base_temp,reindex_myid,i,tree_order); tree_order 340 ompi/patterns/net/netpatterns_knomial_tree.c k_temp1 *= tree_order; tree_order 341 ompi/patterns/net/netpatterns_knomial_tree.c k_temp2 *= tree_order; tree_order 419 ompi/patterns/net/netpatterns_knomial_tree.c ((tree_order - 1) * sizeof(int)); tree_order 424 ompi/patterns/net/netpatterns_knomial_tree.c k_temp1 = tree_order; tree_order 431 ompi/patterns/net/netpatterns_knomial_tree.c FIND_BASE(base,exchange_node->reindex_myid,i+1,tree_order); tree_order 433 ompi/patterns/net/netpatterns_knomial_tree.c for( j = 0; j < (tree_order-1); j ++ ) { tree_order 445 ompi/patterns/net/netpatterns_knomial_tree.c k_temp1 *= tree_order; tree_order 446 ompi/patterns/net/netpatterns_knomial_tree.c k_temp2 *= tree_order; tree_order 449 ompi/patterns/net/netpatterns_knomial_tree.c for(j = 0; j < (tree_order-1); j++){ tree_order 468 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->n_tags = tree_order * n_levels + 1; tree_order 536 ompi/patterns/net/netpatterns_knomial_tree.c int num_nodes, int node_rank, int tree_order, tree_order 546 ompi/patterns/net/netpatterns_knomial_tree.c num_nodes, node_rank, tree_order)); tree_order 549 ompi/patterns/net/netpatterns_knomial_tree.c assert(tree_order > 1); tree_order 550 ompi/patterns/net/netpatterns_knomial_tree.c if (tree_order > num_nodes) { tree_order 551 ompi/patterns/net/netpatterns_knomial_tree.c tree_order = num_nodes; tree_order 554 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->tree_order = tree_order; tree_order 561 ompi/patterns/net/netpatterns_knomial_tree.c cnt *= tree_order; tree_order 568 ompi/patterns/net/netpatterns_knomial_tree.c cnt /= tree_order; tree_order 591 ompi/patterns/net/netpatterns_knomial_tree.c for (i = 0, tmp = node_rank * (tree_order - 1) + cnt + i; tree_order 592 ompi/patterns/net/netpatterns_knomial_tree.c tmp < num_nodes && i < tree_order - 1; tree_order 597 ompi/patterns/net/netpatterns_knomial_tree.c assert(exchange_node->n_extra_sources < tree_order); tree_order 605 ompi/patterns/net/netpatterns_knomial_tree.c for (i = 0, tmp = node_rank * (tree_order - 1) + cnt; tree_order 606 ompi/patterns/net/netpatterns_knomial_tree.c i < tree_order - 1 && tmp < num_nodes; ++i, ++tmp) { tree_order 619 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->rank_extra_sources_array[0] = (node_rank - cnt) / (tree_order - 1); tree_order 636 ompi/patterns/net/netpatterns_knomial_tree.c ((tree_order - 1) * sizeof(int)); tree_order 643 ompi/patterns/net/netpatterns_knomial_tree.c i++, kpow_num *= tree_order) { tree_order 644 ompi/patterns/net/netpatterns_knomial_tree.c k_base = node_rank / (kpow_num * tree_order); tree_order 645 ompi/patterns/net/netpatterns_knomial_tree.c for(j = 1; j < tree_order; j++) { tree_order 647 ompi/patterns/net/netpatterns_knomial_tree.c if (k_base != peer/(kpow_num * tree_order)) { tree_order 649 ompi/patterns/net/netpatterns_knomial_tree.c peer = k_base * (kpow_num * tree_order) + tree_order 650 ompi/patterns/net/netpatterns_knomial_tree.c peer % (kpow_num * tree_order); tree_order 654 ompi/patterns/net/netpatterns_knomial_tree.c i, j, tree_order, peer)); tree_order 666 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->n_tags = tree_order * n_levels + 1; tree_order 701 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order, tree_order 709 ompi/patterns/net/netpatterns_knomial_tree.c NETPATTERNS_VERBOSE(("Enter ompi_netpatterns_setup_recursive_doubling_n_tree_node(num_nodes=%d, node_rank=%d, tree_order=%d)", num_nodes, node_rank, tree_order)); tree_order 712 ompi/patterns/net/netpatterns_knomial_tree.c while (tree_order > num_nodes) { tree_order 713 ompi/patterns/net/netpatterns_knomial_tree.c tree_order /= 2; tree_order 716 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->tree_order = tree_order; tree_order 718 ompi/patterns/net/netpatterns_knomial_tree.c assert(0 == (tree_order & (tree_order - 1))); tree_order 725 ompi/patterns/net/netpatterns_knomial_tree.c cnt *= tree_order; tree_order 732 ompi/patterns/net/netpatterns_knomial_tree.c cnt /= tree_order; tree_order 736 ompi/patterns/net/netpatterns_knomial_tree.c if (2 == tree_order) { tree_order 742 ompi/patterns/net/netpatterns_knomial_tree.c tmp *= tree_order; tree_order 748 ompi/patterns/net/netpatterns_knomial_tree.c if (2 == tree_order) { tree_order 802 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->n_exchanges = n_levels * (tree_order - 1); tree_order 810 ompi/patterns/net/netpatterns_knomial_tree.c for ( i = 0, shift = 1 ; i < exchange_node->n_exchanges ; shift *= tree_order ) { tree_order 811 ompi/patterns/net/netpatterns_knomial_tree.c for ( mask = 1 ; mask < tree_order ; ++mask, ++i ) { tree_order 813 ompi/patterns/net/netpatterns_knomial_tree.c NETPATTERNS_VERBOSE(("rank_exchanges#%d/%d = %d", i, tree_order, node_rank ^ (mask * shift))); tree_order 828 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->n_tags = tree_order * n_levels + 1; tree_order 864 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank,int tree_order, tree_order 880 ompi/patterns/net/netpatterns_knomial_tree.c cnt*=tree_order; tree_order 887 ompi/patterns/net/netpatterns_knomial_tree.c cnt/=tree_order; tree_order 37 ompi/patterns/net/netpatterns_knomial_tree.h int tree_order; tree_order 80 ompi/patterns/net/netpatterns_knomial_tree.h int tree_order; tree_order 114 ompi/patterns/net/netpatterns_knomial_tree.h OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order, tree_order 124 ompi/patterns/net/netpatterns_knomial_tree.h int num_nodes, int node_rank, int tree_order, tree_order 131 ompi/patterns/net/netpatterns_knomial_tree.h int num_nodes, int node_rank, int tree_order, int *hier_ranks, tree_order 30 ompi/patterns/net/netpatterns_multinomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes, tree_order 41 ompi/patterns/net/netpatterns_multinomial_tree.c if( 1 >= tree_order ) { tree_order 55 ompi/patterns/net/netpatterns_multinomial_tree.c cnt*=tree_order; tree_order 88 ompi/patterns/net/netpatterns_multinomial_tree.c n_nodes_prev_level=n_nodes_in_this_level/tree_order; tree_order 98 ompi/patterns/net/netpatterns_multinomial_tree.c (n_cum_nodes-n_nodes_prev_level)+node/tree_order; tree_order 121 ompi/patterns/net/netpatterns_multinomial_tree.c if( n_full_stripes < tree_order ) { tree_order 144 ompi/patterns/net/netpatterns_multinomial_tree.c n_children=tree_order; tree_order 145 ompi/patterns/net/netpatterns_multinomial_tree.c tree_nodes[node_index].n_children=tree_order; tree_order 153 ompi/patterns/net/netpatterns_multinomial_tree.c rank+tree_order*node; tree_order 164 ompi/patterns/net/netpatterns_multinomial_tree.c n_nodes_in_this_level*=tree_order; tree_order 36 ompi/patterns/net/netpatterns_nary_tree.c int ompi_netpatterns_setup_narray_tree(int tree_order, int my_rank, int num_nodes, tree_order 46 ompi/patterns/net/netpatterns_nary_tree.c if( 1 >= tree_order ) { tree_order 57 ompi/patterns/net/netpatterns_nary_tree.c result/=tree_order; tree_order 69 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 86 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 90 ompi/patterns/net/netpatterns_nary_tree.c my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; tree_order 101 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 116 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 118 ompi/patterns/net/netpatterns_nary_tree.c start_index=cum_cnt+my_rank_in_my_level*tree_order; tree_order 119 ompi/patterns/net/netpatterns_nary_tree.c end_index=start_index+tree_order-1; tree_order 176 ompi/patterns/net/netpatterns_nary_tree.c int tree_order, int my_rank, int num_nodes, tree_order 187 ompi/patterns/net/netpatterns_nary_tree.c if( 1 >= tree_order ) { tree_order 198 ompi/patterns/net/netpatterns_nary_tree.c result/=tree_order; tree_order 210 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 227 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 237 ompi/patterns/net/netpatterns_nary_tree.c tree_order, &my_node->k_node); tree_order 243 ompi/patterns/net/netpatterns_nary_tree.c my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; tree_order 254 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 260 ompi/patterns/net/netpatterns_nary_tree.c num_nodes = cnt / tree_order; tree_order 274 ompi/patterns/net/netpatterns_nary_tree.c cnt*=tree_order; tree_order 276 ompi/patterns/net/netpatterns_nary_tree.c start_index=cum_cnt+my_rank_in_my_level*tree_order; tree_order 277 ompi/patterns/net/netpatterns_nary_tree.c end_index=start_index+tree_order-1; tree_order 343 ompi/patterns/net/netpatterns_nary_tree.c static int fill_in_node_data(int tree_order, int num_nodes, int my_node, tree_order 351 ompi/patterns/net/netpatterns_nary_tree.c num_ranks_per_child=num_nodes/tree_order; tree_order 353 ompi/patterns/net/netpatterns_nary_tree.c num_children=tree_order; tree_order 354 ompi/patterns/net/netpatterns_nary_tree.c n_extra=num_nodes-num_ranks_per_child*tree_order; tree_order 411 ompi/patterns/net/netpatterns_nary_tree.c rc=fill_in_node_data(tree_order, n_ranks_to_child, rank, nodes_data); tree_order 435 ompi/patterns/net/netpatterns_nary_tree.c int tree_order, int num_nodes, tree_order 452 ompi/patterns/net/netpatterns_nary_tree.c rc=fill_in_node_data(tree_order,