N 22 examples/oshmem_max_reduction.c long src[N]; N 23 examples/oshmem_max_reduction.c long dst[N]; N 40 examples/oshmem_max_reduction.c for (i = 0; i < N; i += 1) { N 46 examples/oshmem_max_reduction.c shmem_long_max_to_all(dst, src, N, 0, 0, num_pes, pWrk, pSync); N 50 examples/oshmem_max_reduction.c for (i = 0; i < N; i+= 1) { N 190 ompi/mca/topo/treematch/treematch/tm_bucket.c int N,n,size; N 196 ompi/mca/topo/treematch/treematch/tm_bucket.c N = bucket_list->N; N 198 ompi/mca/topo/treematch/treematch/tm_bucket.c size = N*N/n; N 266 ompi/mca/topo/treematch/treematch/tm_bucket.c int N,i,j,id; N 268 ompi/mca/topo/treematch/treematch/tm_bucket.c N = bucket_list->N; N 270 ompi/mca/topo/treematch/treematch/tm_bucket.c for( i = 0 ; i < N ; i++ ) N 271 ompi/mca/topo/treematch/treematch/tm_bucket.c for( j = i+1 ; j < N ; j++ ){ N 289 ompi/mca/topo/treematch/treematch/tm_bucket.c void partial_sort(bucket_list_t *bl,double **tab,int N) N 297 ompi/mca/topo/treematch/treematch/tm_bucket.c if( N <= 0){ N 299 ompi/mca/topo/treematch/treematch/tm_bucket.c fprintf(stderr,"Error: tryng to group a matrix of size %d<=0!\n",N); N 305 ompi/mca/topo/treematch/treematch/tm_bucket.c nb_buckets = (int)floor(CmiLog2(N)); N 320 ompi/mca/topo/treematch/treematch/tm_bucket.c bucket_list->N = N; N 324 ompi/mca/topo/treematch/treematch/tm_bucket.c printf("N=%d, n=%d\n",N,n); N 328 ompi/mca/topo/treematch/treematch/tm_bucket.c i = genrand_int32()%(N-2)+1; N 329 ompi/mca/topo/treematch/treematch/tm_bucket.c if( i == N-2 ) N 330 ompi/mca/topo/treematch/treematch/tm_bucket.c j = N-1; N 332 ompi/mca/topo/treematch/treematch/tm_bucket.c j = genrand_int32()%(N-i-2)+i+1; N 337 ompi/mca/topo/treematch/treematch/tm_bucket.c assert( i < N ); N 338 ompi/mca/topo/treematch/treematch/tm_bucket.c assert( j < N ); N 501 ompi/mca/topo/treematch/treematch/tm_bucket.c void free_tab_bucket(bucket_t **bucket_tab,int N) N 504 ompi/mca/topo/treematch/treematch/tm_bucket.c for( i = 0 ; i < N ; i++ ) N 547 ompi/mca/topo/treematch/treematch/tm_bucket.c int N = aff_mat->order; N 552 ompi/mca/topo/treematch/treematch/tm_bucket.c printf("starting sort of N=%d elements\n",N); N 557 ompi/mca/topo/treematch/treematch/tm_bucket.c partial_sort(&bucket_list,mat,N); N 20 ompi/mca/topo/treematch/treematch/tm_bucket.h int N;/* length of tab */ N 496 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c constraint_t *split_constraints (int *constraints, int nb_constraints, int k, tm_topology_t *topology, int depth, int N) N 526 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if(end-start > N/k){ N 528 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c fprintf(stderr, "Error in spliting constraint at step %d. N=%d k= %d, length = %d\n", i, N, k, end-start); N 720 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void kpartition_build_level_topology(tm_tree_t *cur_node, com_mat_t *com_mat, int N, int depth, N 745 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("Partitionning Matrix of size %d (problem size= %d) in %d partitions\n", com_mat->n, N, k); N 751 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c partition = kpartition(k, com_mat, N, constraints, nb_constraints); N 754 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c display_partition(partition, local_vertices, N, depth, k); N 758 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tab_com_mat = split_com_mat( com_mat, N, k, partition); N 761 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tab_local_vertices = split_vertices( local_vertices, N, k, partition); N 764 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab = split_constraints (constraints, nb_constraints, k, topology, depth, N); N 775 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c kpartition_build_level_topology ( tab_child[i], tab_com_mat[i], N/k, depth + 1, N 793 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tm_tree_t *kpartition_build_tree_from_topology(tm_topology_t *topology,double **comm,int N, int *constraints, int nb_constraints, double *obj_weight, double *com_speed) N 808 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("Number of constraints: %d, N=%d, nb_cores = %d, K=%d\n", nb_constraints, N, nb_cores, nb_cores-N); N 825 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if((K=nb_cores - N)>0){ N 827 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c complete_obj_weight(&obj_weight,N,K); N 835 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c com_mat.n = N; N 848 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c local_vertices = (int*) MALLOC (sizeof(int) * (K+N)); N 850 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = 0 ; i < MIN(N,nb_constraints) ; i++) N 852 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = MIN(N,nb_constraints) ;i < N + K ; i++) N 862 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c kpartition_build_level_topology(root, &com_mat, N+K, depth, topology, local_vertices, N 9 ompi/mca/topo/treematch/treematch/tm_kpartitioning.h tm_tree_t * kpartition_build_tree_from_topology(tm_topology_t *topology,double **com_mat,int N, int *constraints, int nb_constraints, double *obj_weight, double *com_speed); N 54 ompi/mca/topo/treematch/treematch/tm_mapping.c long int init_mat(char *filename,int N, double **mat, double *sum_row); N 59 ompi/mca/topo/treematch/treematch/tm_mapping.c void print_1D_tab(int *tab,int N); N 85 ompi/mca/topo/treematch/treematch/tm_mapping.c void print_1D_tab(int *tab,int N) N 88 ompi/mca/topo/treematch/treematch/tm_mapping.c for (i = 0; i < N; i++) { N 90 ompi/mca/topo/treematch/treematch/tm_mapping.c if( i < (N-1) ) N 100 ompi/mca/topo/treematch/treematch/tm_mapping.c int N = 0; N 109 ompi/mca/topo/treematch/treematch/tm_mapping.c N++; N 112 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("Number of lines of file %s = %d\n",filename,N); N 115 ompi/mca/topo/treematch/treematch/tm_mapping.c return N; N 120 ompi/mca/topo/treematch/treematch/tm_mapping.c long int init_mat(char *filename,int N, double **mat, double *sum_row){ N 154 ompi/mca/topo/treematch/treematch/tm_mapping.c if( j != N){ N 156 ompi/mca/topo/treematch/treematch/tm_mapping.c fprintf(stderr,"Error at %d %d (%d!=%d). Too many columns for %s\n",i,j,j,N,filename); N 163 ompi/mca/topo/treematch/treematch/tm_mapping.c if( i != N ){ N 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){ N 205 ompi/mca/topo/treematch/treematch/tm_mapping.c if( j != N){ N 207 ompi/mca/topo/treematch/treematch/tm_mapping.c fprintf(stderr,"Error at %d %d (%d!=%d). Wrong number of columns line %d for file %s\n",i ,j ,j ,N ,i+1, filename); N 217 ompi/mca/topo/treematch/treematch/tm_mapping.c static long int init_mat_mmap(char *filename,int N, double **mat, double *sum_row){ N 239 ompi/mca/topo/treematch/treematch/tm_mapping.c while(i<N){ N 240 ompi/mca/topo/treematch/treematch/tm_mapping.c data = parse_line(i, mat, sum_row, N, data, filename, &nnz); N 253 ompi/mca/topo/treematch/treematch/tm_mapping.c static long int init_mat_long(char *filename,int N, double **mat, double *sum_row){ N 267 ompi/mca/topo/treematch/treematch/tm_mapping.c while(i<N){ N 269 ompi/mca/topo/treematch/treematch/tm_mapping.c parse_line(i, mat, sum_row, N, line, filename, &nnz); N 462 ompi/mca/topo/treematch/treematch/tm_mapping.c int i,j,N,M,block_size; N 467 ompi/mca/topo/treematch/treematch/tm_mapping.c N = topology->nb_nodes[level]; N 471 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("level=%d, nodes_id=%p, N=%d\n",level,(void *)nodes_id,N); N 472 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("N=%d,nb_compute_units=%d\n",N,nb_compute_units); N 476 ompi/mca/topo/treematch/treematch/tm_mapping.c assert(N==nb_compute_units*topology->oversub_fact); N 482 ompi/mca/topo/treematch/treematch/tm_mapping.c block_size = M/N; N 486 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("M=%d, N=%d, BS=%d\n",M,N,block_size); N 504 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("M=%d, N=%d, BS=%d\n",M,N,block_size); N 14 ompi/mca/topo/treematch/treematch/tm_mapping.h long int init_mat(char *filename,int N, double **mat, double *sum_row); N 20 ompi/mca/topo/treematch/treematch/tm_mapping.h void print_1D_tab(int *tab,int N); N 60 ompi/mca/topo/treematch/treematch/tm_mt.c static unsigned long x[N]; /* the array for the state vector */ N 79 ompi/mca/topo/treematch/treematch/tm_mt.c for (i = 1; i < N; ++i) { N 105 ompi/mca/topo/treematch/treematch/tm_mt.c for (k = (N > key_length ? N : key_length); k; --k) { N 109 ompi/mca/topo/treematch/treematch/tm_mt.c if (++i >= N) { N 110 ompi/mca/topo/treematch/treematch/tm_mt.c x[0] = x[N - 1]; N 117 ompi/mca/topo/treematch/treematch/tm_mt.c for (k = N - 1; k; --k) { N 121 ompi/mca/topo/treematch/treematch/tm_mt.c if (++i >= N) { N 122 ompi/mca/topo/treematch/treematch/tm_mt.c x[0] = x[N - 1]; N 143 ompi/mca/topo/treematch/treematch/tm_mt.c if (pm == x + N) { N 146 ompi/mca/topo/treematch/treematch/tm_mt.c if (p1 == x + N) { N 22 ompi/mca/topo/treematch/treematch/tm_solution.c void map_Packed(tm_topology_t *topology, int N, int *sigma); N 23 ompi/mca/topo/treematch/treematch/tm_solution.c void map_RR(tm_topology_t * topology, int N, int *sigma); N 25 ompi/mca/topo/treematch/treematch/tm_solution.c int *generate_random_sol(tm_topology_t *topology,int N, int seed); N 26 ompi/mca/topo/treematch/treematch/tm_solution.c double eval_sol(int *sol,int N,double **comm, double **arch); N 28 ompi/mca/topo/treematch/treematch/tm_solution.c double gain_exchange(int *sol,int l,int m,double eval1,int N,double **comm, double **arch); N 29 ompi/mca/topo/treematch/treematch/tm_solution.c void select_max(int *l,int *m,double **gain,int N,int *state); N 30 ompi/mca/topo/treematch/treematch/tm_solution.c void compute_gain(int *sol,int N,double **gain,double **comm, double **arch); N 31 ompi/mca/topo/treematch/treematch/tm_solution.c void map_MPIPP(tm_topology_t *topology,int nb_seed,int N,int *sigma,double **comm, double **arch); N 93 ompi/mca/topo/treematch/treematch/tm_solution.c int N = aff_mat->order; N 98 ompi/mca/topo/treematch/treematch/tm_solution.c for ( i = 0 ; i < N ; i++ ) N 99 ompi/mca/topo/treematch/treematch/tm_solution.c for ( j = i+1 ; j < N ; j++){ N 112 ompi/mca/topo/treematch/treematch/tm_solution.c for (i = 0; i < N; i++) { N 114 ompi/mca/topo/treematch/treematch/tm_solution.c if(i<N-1) N 129 ompi/mca/topo/treematch/treematch/tm_solution.c int N = aff_mat->order; N 134 ompi/mca/topo/treematch/treematch/tm_solution.c for ( i = 0 ; i < N ; i++ ) N 135 ompi/mca/topo/treematch/treematch/tm_solution.c for ( j = i+1 ; j < N ; j++){ N 149 ompi/mca/topo/treematch/treematch/tm_solution.c for (i = 0; i < N; i++) { N 151 ompi/mca/topo/treematch/treematch/tm_solution.c if(i<N-1) N 165 ompi/mca/topo/treematch/treematch/tm_solution.c int N = aff_mat->order; N 168 ompi/mca/topo/treematch/treematch/tm_solution.c for ( i = 0 ; i < N ; i++ ) N 169 ompi/mca/topo/treematch/treematch/tm_solution.c for ( j = i+1 ; j < N ; j++){ N 177 ompi/mca/topo/treematch/treematch/tm_solution.c for (i = 0; i < N; i++) { N 179 ompi/mca/topo/treematch/treematch/tm_solution.c if(i<N-1) N 235 ompi/mca/topo/treematch/treematch/tm_solution.c int N = aff_mat->order; N 237 ompi/mca/topo/treematch/treematch/tm_solution.c sigma = (int*)MALLOC(sizeof(int)*N); N 239 ompi/mca/topo/treematch/treematch/tm_solution.c map_Packed(topology, N, sigma); N 243 ompi/mca/topo/treematch/treematch/tm_solution.c map_RR(topology, N, sigma); N 284 ompi/mca/topo/treematch/treematch/tm_solution.c void map_Packed(tm_topology_t *topology, int N, int *sigma) N 298 ompi/mca/topo/treematch/treematch/tm_solution.c if(j == N) N 304 ompi/mca/topo/treematch/treematch/tm_solution.c void map_RR(tm_topology_t *topology, int N,int *sigma) N 309 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++ ){ N 330 ompi/mca/topo/treematch/treematch/tm_solution.c int *generate_random_sol(tm_topology_t *topology,int N, int seed) N 339 ompi/mca/topo/treematch/treematch/tm_solution.c hash_tab = (hash_t*)MALLOC(sizeof(hash_t)*N); N 340 ompi/mca/topo/treematch/treematch/tm_solution.c sol = (int*)MALLOC(sizeof(int)*N); N 344 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++ ){ N 349 ompi/mca/topo/treematch/treematch/tm_solution.c qsort(hash_tab,N,sizeof(hash_t),hash_asc); N 350 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++ ) N 358 ompi/mca/topo/treematch/treematch/tm_solution.c double eval_sol(int *sol,int N,double **comm, double **arch) N 364 ompi/mca/topo/treematch/treematch/tm_solution.c for ( i = 0 ; i < N ; i++ ) N 365 ompi/mca/topo/treematch/treematch/tm_solution.c for ( j = i+1 ; j < N ; j++ ){ N 382 ompi/mca/topo/treematch/treematch/tm_solution.c double gain_exchange(int *sol,int l,int m,double eval1,int N,double **comm, double **arch) N 388 ompi/mca/topo/treematch/treematch/tm_solution.c eval2 = eval_sol(sol,N,comm,arch); N 394 ompi/mca/topo/treematch/treematch/tm_solution.c void select_max(int *l,int *m,double **gain,int N,int *state) N 401 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++ ) N 403 ompi/mca/topo/treematch/treematch/tm_solution.c for( j = 0 ; j < N ; j++ ) N 414 ompi/mca/topo/treematch/treematch/tm_solution.c void compute_gain(int *sol,int N,double **gain,double **comm, double **arch) N 419 ompi/mca/topo/treematch/treematch/tm_solution.c eval1 = eval_sol(sol,N,comm,arch); N 420 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++ ) N 422 ompi/mca/topo/treematch/treematch/tm_solution.c gain[i][j] = gain[j][i] = gain_exchange(sol,i,j,eval1,N,comm,arch); N 432 ompi/mca/topo/treematch/treematch/tm_solution.c void map_MPIPP(tm_topology_t *topology,int nb_seed,int N,int *sigma,double **comm, double **arch) N 442 ompi/mca/topo/treematch/treematch/tm_solution.c gain = (double**)MALLOC(sizeof(double*)*N); N 443 ompi/mca/topo/treematch/treematch/tm_solution.c history = (int**)MALLOC(sizeof(int*)*N); N 444 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++){ N 445 ompi/mca/topo/treematch/treematch/tm_solution.c gain[i] = (double*)MALLOC(sizeof(double)*N); N 449 ompi/mca/topo/treematch/treematch/tm_solution.c state = (int*)MALLOC(sizeof(int)*N); N 450 ompi/mca/topo/treematch/treematch/tm_solution.c temp = (double*)MALLOC(sizeof(double)*N); N 452 ompi/mca/topo/treematch/treematch/tm_solution.c sol = generate_random_sol(topology, N, seed++); N 453 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++) N 459 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++ ){ N 464 ompi/mca/topo/treematch/treematch/tm_solution.c compute_gain(sol,N,gain,comm,arch); N 469 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N/2 ; i++ ){ N 470 ompi/mca/topo/treematch/treematch/tm_solution.c select_max(&l,&m,gain,N,state); N 478 ompi/mca/topo/treematch/treematch/tm_solution.c compute_gain(sol,N,gain,comm,arch); N 484 ompi/mca/topo/treematch/treematch/tm_solution.c for(i = 0 ; i < N/2 ; i++ ){ N 493 ompi/mca/topo/treematch/treematch/tm_solution.c for( j = t+1 ; j < N/2 ; j++ ){ N 503 ompi/mca/topo/treematch/treematch/tm_solution.c eval = eval_sol(sol,N,comm,arch); N 506 ompi/mca/topo/treematch/treematch/tm_solution.c for(i = 0 ; i < N ; i++) N 512 ompi/mca/topo/treematch/treematch/tm_solution.c sol=generate_random_sol(topology, N, seed++); N 519 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < N ; i++){ N 14 ompi/mca/topo/treematch/treematch/tm_solution.h void map_Packed(tm_topology_t *topology, int N, int *sigma); N 15 ompi/mca/topo/treematch/treematch/tm_solution.h void map_RR(tm_topology_t *topology, int N, int *sigma); N 17 ompi/mca/topo/treematch/treematch/tm_solution.h int *generate_random_sol(tm_topology_t *topology,int N, int seed); N 18 ompi/mca/topo/treematch/treematch/tm_solution.h double eval_sol(int *sol,int N,double **comm, double **arch); N 20 ompi/mca/topo/treematch/treematch/tm_solution.h double gain_exchange(int *sol,int l,int m,double eval1,int N,double **comm, double **arch); N 21 ompi/mca/topo/treematch/treematch/tm_solution.h void select_max(int *l,int *m,double **gain,int N,int *state); N 22 ompi/mca/topo/treematch/treematch/tm_solution.h void compute_gain(int *sol,int N,double **gain,double **comm, double **arch); N 23 ompi/mca/topo/treematch/treematch/tm_solution.h void map_MPIPP(tm_topology_t *topology,int nb_seed,int N,int *sigma,double **comm, double **arch); N 22 ompi/mca/topo/treematch/treematch/tm_topology.c int topo_nb_proc(hwloc_topology_t topology,int N); N 124 ompi/mca/topo/treematch/treematch/tm_topology.c int topo_nb_proc(hwloc_topology_t topology,int N) N 129 ompi/mca/topo/treematch/treematch/tm_topology.c objs = (hwloc_obj_t*)MALLOC(sizeof(hwloc_obj_t)*N); N 131 ompi/mca/topo/treematch/treematch/tm_topology.c nb_proc = 1 + hwloc_get_closest_objs(topology,objs[0],objs+1,N-1); N 182 ompi/mca/topo/treematch/treematch/tm_topology.c int N = hwloc_get_nbobjs_by_depth(topology, depth); N 187 ompi/mca/topo/treematch/treematch/tm_topology.c for (i = 1; i < N; i++ ){ N 16 ompi/mca/topo/treematch/treematch/tm_topology.h int topo_nb_proc(hwloc_topology_t topology,int N); N 7 ompi/mca/topo/treematch/treematch/tm_tree.h void display_tab(double **tab,int N); N 2512 oshmem/mca/memheap/ptmalloc/malloc.c #define check_malloced_chunk(M,P,N) N 2521 oshmem/mca/memheap/ptmalloc/malloc.c #define check_malloced_chunk(M,P,N) do_check_malloced_chunk(M,P,N) N 2590 oshmem/mca/memheap/ptmalloc/malloc.c unsigned int N = ((Y - 0x100) >> 16) & 8;\ N 2591 oshmem/mca/memheap/ptmalloc/malloc.c unsigned int K = (((Y <<= N) - 0x1000) >> 16) & 4;\ N 2592 oshmem/mca/memheap/ptmalloc/malloc.c N += K;\ N 2593 oshmem/mca/memheap/ptmalloc/malloc.c N += K = (((Y <<= K) - 0x4000) >> 16) & 2;\ N 2594 oshmem/mca/memheap/ptmalloc/malloc.c K = 14 - N + ((Y <<= K) >> 15);\ N 2655 oshmem/mca/memheap/ptmalloc/malloc.c unsigned int N = K; Y >>= K;\ N 2656 oshmem/mca/memheap/ptmalloc/malloc.c N += K = Y >> (8-3) & 8; Y >>= K;\ N 2657 oshmem/mca/memheap/ptmalloc/malloc.c N += K = Y >> (4-2) & 4; Y >>= K;\ N 2658 oshmem/mca/memheap/ptmalloc/malloc.c N += K = Y >> (2-1) & 2; Y >>= K;\ N 2659 oshmem/mca/memheap/ptmalloc/malloc.c N += K = Y >> (1-0) & 1; Y >>= K;\ N 2660 oshmem/mca/memheap/ptmalloc/malloc.c I = (bindex_t)(N + Y);\ N 71 test/datatype/ddt_lib.c void print_double_mat( unsigned int N, double* mat ) N 76 test/datatype/ddt_lib.c for( i = 0; i < N; i++ ) { N 77 test/datatype/ddt_lib.c printf( "(%4d) :", i * N * (int)sizeof(double) ); N 78 test/datatype/ddt_lib.c pMat = mat + i * N; N 79 test/datatype/ddt_lib.c for( j = 0; j < N; j++ ) { N 87 test/datatype/ddt_lib.c int init_random_upper_matrix( unsigned int N, double* mat ) N 92 test/datatype/ddt_lib.c for( i = 0; i < N; i++ ) { N 94 test/datatype/ddt_lib.c for( j = i; j < N; j++ ) { N 102 test/datatype/ddt_lib.c int check_diag_matrix( unsigned int N, double* mat1, double* mat2 ) N 106 test/datatype/ddt_lib.c for( i = 0; i < N; i++ ) { N 109 test/datatype/ddt_lib.c for( j = i; j < N; j++ ) { N 51 test/datatype/ddt_lib.h extern void print_double_mat( unsigned int N, double* mat ); N 52 test/datatype/ddt_lib.h extern int init_random_upper_matrix( unsigned int N, double* mat ); N 53 test/datatype/ddt_lib.h extern int check_diag_matrix( unsigned int N, double* mat1, double* mat2 ); N 498 test/datatype/opal_ddt_lib.c int init_random_upper_matrix( unsigned int N, double* mat ) N 503 test/datatype/opal_ddt_lib.c for( i = 0; i < N; i++ ) { N 505 test/datatype/opal_ddt_lib.c for( j = i; j < N; j++ ) { N 513 test/datatype/opal_ddt_lib.c int check_diag_matrix( unsigned int N, double* mat1, double* mat2 ) N 517 test/datatype/opal_ddt_lib.c for( i = 0; i < N; i++ ) { N 520 test/datatype/opal_ddt_lib.c for( j = i; j < N; j++ ) { N 41 test/datatype/opal_ddt_lib.h extern int init_random_upper_matrix( unsigned int N, double* mat ); N 42 test/datatype/opal_ddt_lib.h extern int check_diag_matrix( unsigned int N, double* mat1, double* mat2 ); N 72 test/datatype/unpack_ooo.c for (j = 0; j < N; ++j) { N 86 test/datatype/unpack_ooo.c if( OPAL_SUCCESS != opal_convertor_prepare_for_recv( pConv, &(newtype->super), N, bar ) ) { N 113 test/datatype/unpack_ooo.c for (j = 0; j < N; ++j) { N 123 test/datatype/unpack_ooo.c N, j, (void*)&bar[j], N 259 test/datatype/unpack_ooo.c pbar = (struct pfoo_t *)malloc (N * sizeof(struct pfoo_t)); N 264 test/datatype/unpack_ooo.c bar = (struct foo_t *)malloc (N * sizeof(struct foo_t));