mat_order 364 ompi/mca/topo/treematch/treematch/tm_tree.c void free_tab_double(double**tab, int mat_order) mat_order 367 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ) mat_order 372 ompi/mca/topo/treematch/treematch/tm_tree.c void free_tab_int(int**tab, int mat_order) mat_order 375 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ) mat_order 380 ompi/mca/topo/treematch/treematch/tm_tree.c void display_tab(double **tab, int mat_order) mat_order 386 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ){ mat_order 388 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < mat_order ; j++ ){ mat_order 474 ompi/mca/topo/treematch/treematch/tm_tree.c int mat_order = aff_mat->order; mat_order 480 ompi/mca/topo/treematch/treematch/tm_tree.c }else if( (mat_order+depth) >= (arity+id) ){ mat_order 482 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = id ; i < mat_order ; i++ ){ mat_order 1509 ompi/mca/topo/treematch/treematch/tm_tree.c int mat_order = aff_mat->order; mat_order 1535 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = id+1 ; i < mat_order ; i++ ){ mat_order 1652 ompi/mca/topo/treematch/treematch/tm_tree.c int mat_order = aff_mat->order; mat_order 1658 ompi/mca/topo/treematch/treematch/tm_tree.c graph = (adjacency_t*)MALLOC(sizeof(adjacency_t)*((mat_order*mat_order-mat_order)/2)); mat_order 1660 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ) mat_order 1661 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = i+1 ; j < mat_order ; j++){ mat_order 1673 ompi/mca/topo/treematch/treematch/tm_tree.c assert( e == (mat_order*mat_order-mat_order)/2); mat_order 1714 ompi/mca/topo/treematch/treematch/tm_tree.c int i, j, mat_order; mat_order 1720 ompi/mca/topo/treematch/treematch/tm_tree.c mat_order = aff_mat->order; mat_order 1723 ompi/mca/topo/treematch/treematch/tm_tree.c mat = (double**)MALLOC(mat_order*sizeof(double*)); mat_order 1724 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ) mat_order 1725 ompi/mca/topo/treematch/treematch/tm_tree.c mat[i] = (double*)MALLOC(mat_order*sizeof(double)); mat_order 1727 ompi/mca/topo/treematch/treematch/tm_tree.c sum_row = (double*)CALLOC(mat_order, sizeof(double)); mat_order 1732 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ) mat_order 1734 ompi/mca/topo/treematch/treematch/tm_tree.c avg /= mat_order; mat_order 1740 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ) mat_order 1741 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < mat_order ; j++){ mat_order 1750 ompi/mca/topo/treematch/treematch/tm_tree.c return new_affinity_mat(mat, sum_row, mat_order,nnz); mat_order 1769 ompi/mca/topo/treematch/treematch/tm_tree.c int mat_order = aff_mat -> order; mat_order 1788 ompi/mca/topo/treematch/treematch/tm_tree.c nbg = choose(mat_order, arity); mat_order 1957 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_aff_mat(tm_affinity_mat_t **aff_mat , int mat_order, int K) mat_order 1964 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order+K; mat_order 1971 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ){ mat_order 1972 ompi/mca/topo/treematch/treematch/tm_tree.c memcpy(new_mat[i], old_mat[i], mat_order*sizeof(double)); mat_order 1979 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_obj_weight(double **tab, int mat_order, int K) mat_order 1990 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ ) mat_order 1992 ompi/mca/topo/treematch/treematch/tm_tree.c avg /= mat_order; mat_order 1994 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order+K; mat_order 1999 ompi/mca/topo/treematch/treematch/tm_tree.c if(i < mat_order) mat_order 2029 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_tab_node(tm_tree_t **tab, int mat_order, int K, int depth, tm_topology_t *topology) mat_order 2039 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order+K; mat_order 2044 ompi/mca/topo/treematch/treematch/tm_tree.c if(i < mat_order) mat_order 2081 ompi/mca/topo/treematch/treematch/tm_tree.c int mat_order=aff_mat->order ; mat_order 2092 ompi/mca/topo/treematch/treematch/tm_tree.c if((1 == mat_order) && (0 == depth)) mat_order 2096 ompi/mca/topo/treematch/treematch/tm_tree.c fprintf(stderr, "Error: matrix size: %d and depth:%d (should be 1 and -1 respectively)\n", mat_order, depth); mat_order 2102 ompi/mca/topo/treematch/treematch/tm_tree.c if( mat_order%arity != 0 ){ mat_order 2104 ompi/mca/topo/treematch/treematch/tm_tree.c K = arity*((mat_order/arity)+1)-mat_order; mat_order 2107 ompi/mca/topo/treematch/treematch/tm_tree.c printf("****mat_order=%d arity=%d K=%d\n", mat_order, arity, K); mat_order 2110 ompi/mca/topo/treematch/treematch/tm_tree.c complete_aff_mat(&aff_mat, mat_order, K); mat_order 2112 ompi/mca/topo/treematch/treematch/tm_tree.c complete_obj_weight(&obj_weight, mat_order, K); mat_order 2115 ompi/mca/topo/treematch/treematch/tm_tree.c complete_tab_node(&tab_node, mat_order, K, depth, topology); mat_order 2117 ompi/mca/topo/treematch/treematch/tm_tree.c mat_order += K; /*increase the number of nodes accordingly*/ mat_order 2123 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order/arity; mat_order 2125 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Depth=%d\tnb_nodes=%d\tnb_groups=%d\tsize of groups(arity)=%d\n", depth, mat_order, M, arity); mat_order 2163 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = mat_order-K ; i < mat_order ; i++ ) mat_order 2201 ompi/mca/topo/treematch/treematch/tm_tree.c int mat_order = aff_mat->order; mat_order 2203 ompi/mca/topo/treematch/treematch/tm_tree.c tab_node = (tm_tree_t*)MALLOC(sizeof(tm_tree_t)*mat_order); mat_order 2205 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < mat_order ; i++ )