mat               377 ompi/mca/common/monitoring/monitoring_prof.c int write_mat(char * filename, size_t * mat, unsigned int dim)
mat               392 ompi/mca/common/monitoring/monitoring_prof.c             fprintf(matrix_file, "%zu ", mat[i * comm_world_size + j]);
mat               548 ompi/mca/topo/treematch/treematch/tm_bucket.c   double **mat = aff_mat->mat;
mat               557 ompi/mca/topo/treematch/treematch/tm_bucket.c   partial_sort(&bucket_list,mat,N);
mat               576 ompi/mca/topo/treematch/treematch/tm_bucket.c 	printf("elem[%d][%d]=%f ",i,j,mat[i][j]);
mat                55 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   double **mat = com_mat->comm;
mat                75 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if(mat[i][j]){
mat                77 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edlotab[edgeNum] = (SCOTCH_Num)mat[i][j];
mat                83 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if(mat[i][j]){
mat                85 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edlotab[edgeNum] = (SCOTCH_Num)mat[i][j];
mat               643 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_tab_com_mat(com_mat_t **mat,int k)
mat               646 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   if( !mat )
mat               650 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     for ( j = 0 ; j < mat[i]->n ; j ++)
mat               651 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       FREE( mat[i]->comm[j] );
mat               652 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     FREE( mat[i]->comm );
mat               653 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     FREE(mat[i]);
mat               656 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   FREE(mat);
mat               659 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_tab_local_vertices(int **mat, int k)
mat               662 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   if( !mat )
mat               666 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     FREE( mat[i] );
mat               668 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   FREE(mat);
mat                50 ompi/mca/topo/treematch/treematch/tm_mapping.c tm_affinity_mat_t * new_affinity_mat(double **mat, double *sum_row, int order, long int nnz);
mat                54 ompi/mca/topo/treematch/treematch/tm_mapping.c long int init_mat(char *filename,int N, double **mat, double *sum_row);
mat                64 ompi/mca/topo/treematch/treematch/tm_mapping.c tm_affinity_mat_t * tm_build_affinity_mat(double **mat, int order);
mat               120 ompi/mca/topo/treematch/treematch/tm_mapping.c long int  init_mat(char *filename,int N, double **mat, double *sum_row){
mat               144 ompi/mca/topo/treematch/treematch/tm_mapping.c   	mat[i][j] = atof(ptr);
mat               145 ompi/mca/topo/treematch/treematch/tm_mapping.c 	if(mat[i][j]) nnz++;
mat               146 ompi/mca/topo/treematch/treematch/tm_mapping.c   	sum_row[i] += mat [i][j];
mat               147 ompi/mca/topo/treematch/treematch/tm_mapping.c   	if(mat[i][j]<0){
mat               149 ompi/mca/topo/treematch/treematch/tm_mapping.c   	    fprintf(stderr,"Warning: negative value in com matrix! mat[%d][%d]=%f\n",i,j,mat[i][j]);
mat               181 ompi/mca/topo/treematch/treematch/tm_mapping.c static char *parse_line(int i, double **mat, double *sum_row, int N, char *data, char *filename, long int *nnz){
mat               196 ompi/mca/topo/treematch/treematch/tm_mapping.c       mat[i][j] = val;
mat               217 ompi/mca/topo/treematch/treematch/tm_mapping.c static long int init_mat_mmap(char *filename,int N, double **mat, double *sum_row){
mat               240 ompi/mca/topo/treematch/treematch/tm_mapping.c     data = parse_line(i, mat, sum_row, N, data, filename, &nnz);
mat               253 ompi/mca/topo/treematch/treematch/tm_mapping.c static long int init_mat_long(char *filename,int N, double **mat, double *sum_row){
mat               269 ompi/mca/topo/treematch/treematch/tm_mapping.c     parse_line(i, mat, sum_row, N, line, filename, &nnz);
mat               280 ompi/mca/topo/treematch/treematch/tm_mapping.c tm_affinity_mat_t * new_affinity_mat(double **mat, double *sum_row, int order, long int nnz){
mat               284 ompi/mca/topo/treematch/treematch/tm_mapping.c   aff_mat -> mat     = mat;
mat               293 ompi/mca/topo/treematch/treematch/tm_mapping.c tm_affinity_mat_t * tm_build_affinity_mat(double **mat, int order){
mat               302 ompi/mca/topo/treematch/treematch/tm_mapping.c       if(mat[i][j]){
mat               304 ompi/mca/topo/treematch/treematch/tm_mapping.c 	sum_row[i] += mat [i][j];
mat               309 ompi/mca/topo/treematch/treematch/tm_mapping.c   return new_affinity_mat(mat, sum_row, order, nnz);
mat               321 ompi/mca/topo/treematch/treematch/tm_mapping.c     FREE(aff_mat->mat[i]);
mat               323 ompi/mca/topo/treematch/treematch/tm_mapping.c   FREE(aff_mat->mat);
mat               331 ompi/mca/topo/treematch/treematch/tm_mapping.c   double **mat = NULL;
mat               342 ompi/mca/topo/treematch/treematch/tm_mapping.c   mat = (double**)MALLOC(order*sizeof(double*));
mat               345 ompi/mca/topo/treematch/treematch/tm_mapping.c     mat[i] = (double*)MALLOC((order)*sizeof(double));
mat               349 ompi/mca/topo/treematch/treematch/tm_mapping.c     nnz = init_mat_long(filename,order, mat, sum_row); 
mat               353 ompi/mca/topo/treematch/treematch/tm_mapping.c     nnz = init_mat_mmap(filename,order, mat, sum_row);
mat               358 ompi/mca/topo/treematch/treematch/tm_mapping.c     nnz = init_mat_mmap(filename,order, mat, sum_row); 
mat               373 ompi/mca/topo/treematch/treematch/tm_mapping.c     return new_affinity_mat(mat, sum_row, order, nnz);
mat                 8 ompi/mca/topo/treematch/treematch/tm_mapping.h tm_affinity_mat_t * new_affinity_mat(double **mat, double *sum_row, int order, long int nnz);
mat                14 ompi/mca/topo/treematch/treematch/tm_mapping.h long int  init_mat(char *filename,int N, double **mat, double *sum_row);
mat                92 ompi/mca/topo/treematch/treematch/tm_solution.c   double **mat = aff_mat->mat;
mat               100 ompi/mca/topo/treematch/treematch/tm_solution.c       c = mat[i][j];
mat               128 ompi/mca/topo/treematch/treematch/tm_solution.c   double **mat = aff_mat->mat;
mat               136 ompi/mca/topo/treematch/treematch/tm_solution.c       c = mat[i][j];
mat               164 ompi/mca/topo/treematch/treematch/tm_solution.c   double **mat = aff_mat->mat;
mat               170 ompi/mca/topo/treematch/treematch/tm_solution.c       c = mat[i][j];
mat               113 ompi/mca/topo/treematch/treematch/tm_tree.c   free_tab_double(aff_mat->mat, aff_mat->order);
mat               244 ompi/mca/topo/treematch/treematch/tm_tree.c   double **mat = (double**)args[5];
mat               267 ompi/mca/topo/treematch/treematch/tm_tree.c 	    mat[i][j] += old_mat[id1][id2];
mat               271 ompi/mca/topo/treematch/treematch/tm_tree.c 	if(mat[i][j]){
mat               273 ompi/mca/topo/treematch/treematch/tm_tree.c 	  sum_row[i] += mat[i][j];
mat               283 ompi/mca/topo/treematch/treematch/tm_tree.c   double **new_mat = NULL, **old_mat = aff_mat->mat;
mat               410 ompi/mca/topo/treematch/treematch/tm_tree.c   double **mat = aff_mat->mat;
mat               425 ompi/mca/topo/treematch/treematch/tm_tree.c       res -= mat[id1][id2];
mat               910 ompi/mca/topo/treematch/treematch/tm_tree.c static int8_t **indep_mat_dup(int8_t** mat, int n){
mat               918 ompi/mca/topo/treematch/treematch/tm_tree.c     memcpy(res[i], mat[i], sizeof(int8_t)*row_len);
mat              1593 ompi/mca/topo/treematch/treematch/tm_tree.c   com_mat.comm = aff_mat->mat;
mat              1653 ompi/mca/topo/treematch/treematch/tm_tree.c   double **mat = aff_mat->mat;
mat              1664 ompi/mca/topo/treematch/treematch/tm_tree.c       graph[e].val = mat[i][j];
mat              1711 ompi/mca/topo/treematch/treematch/tm_tree.c   double **mat = NULL, *sum_row;
mat              1721 ompi/mca/topo/treematch/treematch/tm_tree.c   old_mat = aff_mat -> mat;
mat              1723 ompi/mca/topo/treematch/treematch/tm_tree.c   mat = (double**)MALLOC(mat_order*sizeof(double*));
mat              1725 ompi/mca/topo/treematch/treematch/tm_tree.c     mat[i] = (double*)MALLOC(mat_order*sizeof(double));
mat              1743 ompi/mca/topo/treematch/treematch/tm_tree.c 	mat[i][j] = 0;
mat              1745 ompi/mca/topo/treematch/treematch/tm_tree.c 	mat[i][j] = 1e-4*old_mat[i][j]/comm_speed-fabs(avg-(obj_weight[i]+obj_weight[j])/2);
mat              1746 ompi/mca/topo/treematch/treematch/tm_tree.c 	sum_row[i] += mat[i][j];
mat              1748 ompi/mca/topo/treematch/treematch/tm_tree.c       if(mat[i][j]) nnz++;
mat              1750 ompi/mca/topo/treematch/treematch/tm_tree.c   return new_affinity_mat(mat, sum_row, mat_order,nnz);
mat              1962 ompi/mca/topo/treematch/treematch/tm_tree.c   old_mat = (*aff_mat) -> mat;
mat              2320 ompi/mca/topo/treematch/treematch/tm_tree.c     result = kpartition_build_tree_from_topology(topology, aff_mat->mat, nb_processes, constraints, nb_constraints,
mat                78 ompi/mca/topo/treematch/treematch/treematch.h   double ** mat;
mat               146 ompi/mca/topo/treematch/treematch/treematch.h tm_affinity_mat_t * tm_build_affinity_mat(double **mat, int order);
mat                71 test/datatype/ddt_lib.c void print_double_mat( unsigned int N, double* mat )
mat                78 test/datatype/ddt_lib.c       pMat = mat + i * N;
mat                87 test/datatype/ddt_lib.c int init_random_upper_matrix( unsigned int N, double* mat )
mat                93 test/datatype/ddt_lib.c         mat += i;
mat                95 test/datatype/ddt_lib.c             *mat = (double)random();
mat                96 test/datatype/ddt_lib.c             mat++;
mat                51 test/datatype/ddt_lib.h extern void print_double_mat( unsigned int N, double* mat );
mat                52 test/datatype/ddt_lib.h extern int init_random_upper_matrix( unsigned int N, double* mat );
mat               498 test/datatype/opal_ddt_lib.c int init_random_upper_matrix( unsigned int N, double* mat )
mat               504 test/datatype/opal_ddt_lib.c         mat += i;
mat               506 test/datatype/opal_ddt_lib.c             *mat = (double)random();
mat               507 test/datatype/opal_ddt_lib.c             mat++;
mat                41 test/datatype/opal_ddt_lib.h extern int init_random_upper_matrix( unsigned int N, double* mat );