M 539 ompi/mca/topo/treematch/treematch/tm_bucket.c int arity,int M) M 572 ompi/mca/topo/treematch/treematch/tm_bucket.c while( l < M ){ M 585 ompi/mca/topo/treematch/treematch/tm_bucket.c while( l < M ){ M 601 ompi/mca/topo/treematch/treematch/tm_bucket.c while( nb_groups < M ){ M 616 ompi/mca/topo/treematch/treematch/tm_bucket.c if(M>512){ /* perform this part in parallel*/ M 631 ompi/mca/topo/treematch/treematch/tm_bucket.c inf[id]=id*M/nb_threads; M 632 ompi/mca/topo/treematch/treematch/tm_bucket.c sup[id]=(id+1)*M/nb_threads; M 633 ompi/mca/topo/treematch/treematch/tm_bucket.c if(id == nb_threads-1) sup[id]=M; M 660 ompi/mca/topo/treematch/treematch/tm_bucket.c for( l = 0 ; l < M ; l++ ){ M 32 ompi/mca/topo/treematch/treematch/tm_bucket.h int arity,int M); M 462 ompi/mca/topo/treematch/treematch/tm_mapping.c int i,j,N,M,block_size; M 465 ompi/mca/topo/treematch/treematch/tm_mapping.c M = nb_leaves(comm_tree); M 470 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("nb_leaves=%d\n",M); M 478 ompi/mca/topo/treematch/treematch/tm_mapping.c proc_list = (int*)MALLOC(sizeof(int)*M); M 482 ompi/mca/topo/treematch/treematch/tm_mapping.c block_size = M/N; M 486 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("M=%d, N=%d, BS=%d\n",M,N,block_size); M 492 ompi/mca/topo/treematch/treematch/tm_mapping.c for( i = 0 ; i < M ; i++ ) M 504 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("M=%d, N=%d, BS=%d\n",M,N,block_size); M 505 ompi/mca/topo/treematch/treematch/tm_mapping.c for( i = 0 ; i < M ; i++ ) M 85 ompi/mca/topo/treematch/treematch/tm_mt.c pm = x + M; M 216 ompi/mca/topo/treematch/treematch/tm_tree.c double *aggregate_obj_weight(tm_tree_t *new_tab_node, double *tab, int M) M 224 ompi/mca/topo/treematch/treematch/tm_tree.c res = (double*)MALLOC(M*sizeof(double)); M 226 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ){ M 243 ompi/mca/topo/treematch/treematch/tm_tree.c int M = *(int*)args[4]; M 261 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < M ; j++ ){ M 280 ompi/mca/topo/treematch/treematch/tm_tree.c static tm_affinity_mat_t *aggregate_aff_mat(tm_tree_t *tab_node, tm_affinity_mat_t *aff_mat, int M) M 287 ompi/mca/topo/treematch/treematch/tm_tree.c new_mat = (double**)MALLOC(M*sizeof(double*)); M 288 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ) M 289 ompi/mca/topo/treematch/treematch/tm_tree.c new_mat[i] = (double*)CALLOC((M), sizeof(double)); M 291 ompi/mca/topo/treematch/treematch/tm_tree.c sum_row = (double*)CALLOC(M, sizeof(double)); M 293 ompi/mca/topo/treematch/treematch/tm_tree.c if(M>512){ /* perform this part in parallel*/ M 301 ompi/mca/topo/treematch/treematch/tm_tree.c nb_threads = MIN(M/512, get_nb_threads()); M 308 ompi/mca/topo/treematch/treematch/tm_tree.c inf[id]=id*M/nb_threads; M 309 ompi/mca/topo/treematch/treematch/tm_tree.c sup[id]=(id+1)*M/nb_threads; M 310 ompi/mca/topo/treematch/treematch/tm_tree.c if(id == nb_threads-1) sup[id]=M; M 316 ompi/mca/topo/treematch/treematch/tm_tree.c args[4]=&M; M 342 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ) M 343 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < M ; j++ ){ M 361 ompi/mca/topo/treematch/treematch/tm_tree.c return new_affinity_mat(new_mat, sum_row, M, nnz); M 528 ompi/mca/topo/treematch/treematch/tm_tree.c void display_selection (group_list_t** selection, int M, int arity, double val) M 537 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ) { M 547 ompi/mca/topo/treematch/treematch/tm_tree.c void display_grouping (tm_tree_t *father, int M, int arity, double val) M 555 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ){ M 564 ompi/mca/topo/treematch/treematch/tm_tree.c int recurs_select_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection) M 572 ompi/mca/topo/treematch/treematch/tm_tree.c if( d == M ){ M 574 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(selection, M, arity, val); M 577 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ) M 591 ompi/mca/topo/treematch/treematch/tm_tree.c return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection); M 600 ompi/mca/topo/treematch/treematch/tm_tree.c int test_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection) M 604 ompi/mca/topo/treematch/treematch/tm_tree.c if( d == M ){ M 615 ompi/mca/topo/treematch/treematch/tm_tree.c return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection); M 682 ompi/mca/topo/treematch/treematch/tm_tree.c int select_independent_groups(group_list_t **tab_group, int n, int arity, int M, double *best_val, M 701 ompi/mca/topo/treematch/treematch/tm_tree.c selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*M); M 707 ompi/mca/topo/treematch/treematch/tm_tree.c recurs_select_independent_groups(tab_group, i+1, n, arity, 1, M, val, best_val, selection, best_selection); M 721 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(best_selection, M, arity, *best_val); M 1960 ompi/mca/topo/treematch/treematch/tm_tree.c int M, i; M 1964 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order+K; M 1965 ompi/mca/topo/treematch/treematch/tm_tree.c new_mat = (double**)MALLOC(M*sizeof(double*)); M 1966 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ) M 1967 ompi/mca/topo/treematch/treematch/tm_tree.c new_mat[i] = (double*)CALLOC((M), sizeof(double)); M 1969 ompi/mca/topo/treematch/treematch/tm_tree.c sum_row = (double*) CALLOC(M, sizeof(double)); M 1976 ompi/mca/topo/treematch/treematch/tm_tree.c *aff_mat = new_affinity_mat(new_mat, sum_row, M, (*aff_mat)->nnz); M 1982 ompi/mca/topo/treematch/treematch/tm_tree.c int M, i; M 1994 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order+K; M 1995 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab = (double*)MALLOC(M*sizeof(double)); M 1998 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ) M 2032 ompi/mca/topo/treematch/treematch/tm_tree.c int M, i; M 2039 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order+K; M 2040 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab = (tm_tree_t*)MALLOC(M*sizeof(tm_tree_t)); M 2043 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ) M 2082 ompi/mca/topo/treematch/treematch/tm_tree.c int i, K=0, M; /*M = mat_order/Arity: number the groups*/ M 2123 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order/arity; M 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); M 2129 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node = (tm_tree_t*)MALLOC(sizeof(tm_tree_t)*M); M 2131 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < M ; i++ ){ M 2145 ompi/mca/topo/treematch/treematch/tm_tree.c group_nodes(aff_mat, tab_node, new_tab_node, arity, M, obj_weight, speed); M 2149 ompi/mca/topo/treematch/treematch/tm_tree.c new_aff_mat = aggregate_aff_mat(new_tab_node, aff_mat, M); M 2157 ompi/mca/topo/treematch/treematch/tm_tree.c new_obj_weight = aggregate_obj_weight(new_tab_node, obj_weight, M); M 2359 oshmem/mca/memheap/ptmalloc/malloc.c #define is_global(M) ((M) == &_gm_) M 2363 oshmem/mca/memheap/ptmalloc/malloc.c #define is_initialized(M) ((M)->top != 0) M 2369 oshmem/mca/memheap/ptmalloc/malloc.c #define use_lock(M) ((M)->mflags & USE_LOCK_BIT) M 2370 oshmem/mca/memheap/ptmalloc/malloc.c #define enable_lock(M) ((M)->mflags |= USE_LOCK_BIT) M 2371 oshmem/mca/memheap/ptmalloc/malloc.c #define disable_lock(M) ((M)->mflags &= ~USE_LOCK_BIT) M 2373 oshmem/mca/memheap/ptmalloc/malloc.c #define use_mmap(M) ((M)->mflags & USE_MMAP_BIT) M 2374 oshmem/mca/memheap/ptmalloc/malloc.c #define enable_mmap(M) ((M)->mflags |= USE_MMAP_BIT) M 2375 oshmem/mca/memheap/ptmalloc/malloc.c #define disable_mmap(M) ((M)->mflags &= ~USE_MMAP_BIT) M 2377 oshmem/mca/memheap/ptmalloc/malloc.c #define use_noncontiguous(M) ((M)->mflags & USE_NONCONTIGUOUS_BIT) M 2378 oshmem/mca/memheap/ptmalloc/malloc.c #define disable_contiguous(M) ((M)->mflags |= USE_NONCONTIGUOUS_BIT) M 2380 oshmem/mca/memheap/ptmalloc/malloc.c #define set_lock(M,L)\ M 2381 oshmem/mca/memheap/ptmalloc/malloc.c ((M)->mflags = (L)?\ M 2382 oshmem/mca/memheap/ptmalloc/malloc.c ((M)->mflags | USE_LOCK_BIT) :\ M 2383 oshmem/mca/memheap/ptmalloc/malloc.c ((M)->mflags & ~USE_LOCK_BIT)) M 2434 oshmem/mca/memheap/ptmalloc/malloc.c #define should_trim(M,s) ((s) > (M)->trim_check) M 2436 oshmem/mca/memheap/ptmalloc/malloc.c #define should_trim(M,s) (0) M 2461 oshmem/mca/memheap/ptmalloc/malloc.c #define PREACTION(M) ((GLOBALLY_INITIALIZE() || use_lock(M))? ACQUIRE_LOCK(&(M)->mutex) : 0) M 2462 oshmem/mca/memheap/ptmalloc/malloc.c #define POSTACTION(M) { if (use_lock(M)) RELEASE_LOCK(&(M)->mutex); } M 2466 oshmem/mca/memheap/ptmalloc/malloc.c #define PREACTION(M) (0) M 2470 oshmem/mca/memheap/ptmalloc/malloc.c #define POSTACTION(M) M 2510 oshmem/mca/memheap/ptmalloc/malloc.c #define check_free_chunk(M,P) M 2511 oshmem/mca/memheap/ptmalloc/malloc.c #define check_inuse_chunk(M,P) M 2512 oshmem/mca/memheap/ptmalloc/malloc.c #define check_malloced_chunk(M,P,N) M 2513 oshmem/mca/memheap/ptmalloc/malloc.c #define check_mmapped_chunk(M,P) M 2514 oshmem/mca/memheap/ptmalloc/malloc.c #define check_malloc_state(M) M 2515 oshmem/mca/memheap/ptmalloc/malloc.c #define check_top_chunk(M,P) M 2518 oshmem/mca/memheap/ptmalloc/malloc.c #define check_free_chunk(M,P) do_check_free_chunk(M,P) M 2519 oshmem/mca/memheap/ptmalloc/malloc.c #define check_inuse_chunk(M,P) do_check_inuse_chunk(M,P) M 2520 oshmem/mca/memheap/ptmalloc/malloc.c #define check_top_chunk(M,P) do_check_top_chunk(M,P) M 2521 oshmem/mca/memheap/ptmalloc/malloc.c #define check_malloced_chunk(M,P,N) do_check_malloced_chunk(M,P,N) M 2522 oshmem/mca/memheap/ptmalloc/malloc.c #define check_mmapped_chunk(M,P) do_check_mmapped_chunk(M,P) M 2523 oshmem/mca/memheap/ptmalloc/malloc.c #define check_malloc_state(M) do_check_malloc_state(M) M 2547 oshmem/mca/memheap/ptmalloc/malloc.c #define smallbin_at(M, i) ((sbinptr)((char*)&((M)->smallbins[(i)<<1]))) M 2548 oshmem/mca/memheap/ptmalloc/malloc.c #define treebin_at(M,i) (&((M)->treebins[i])) M 2621 oshmem/mca/memheap/ptmalloc/malloc.c #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i)) M 2622 oshmem/mca/memheap/ptmalloc/malloc.c #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i)) M 2623 oshmem/mca/memheap/ptmalloc/malloc.c #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i)) M 2625 oshmem/mca/memheap/ptmalloc/malloc.c #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i)) M 2626 oshmem/mca/memheap/ptmalloc/malloc.c #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i)) M 2627 oshmem/mca/memheap/ptmalloc/malloc.c #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i)) M 2705 oshmem/mca/memheap/ptmalloc/malloc.c #define ok_address(M, a) ((char*)(a) >= (M)->least_addr) M 2714 oshmem/mca/memheap/ptmalloc/malloc.c #define ok_address(M, a) (1) M 2723 oshmem/mca/memheap/ptmalloc/malloc.c #define ok_magic(M) ((char *)(M) >= (char *)gm->least_addr && (M)->magic == mparams.magic) M 2725 oshmem/mca/memheap/ptmalloc/malloc.c #define ok_magic(M) (1) M 2744 oshmem/mca/memheap/ptmalloc/malloc.c #define mark_inuse_foot(M,p,s) M 2747 oshmem/mca/memheap/ptmalloc/malloc.c #define set_inuse(M,p,s)\ M 2752 oshmem/mca/memheap/ptmalloc/malloc.c #define set_inuse_and_pinuse(M,p,s)\ M 2757 oshmem/mca/memheap/ptmalloc/malloc.c #define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ M 2763 oshmem/mca/memheap/ptmalloc/malloc.c #define mark_inuse_foot(M,p,s)\ M 2764 oshmem/mca/memheap/ptmalloc/malloc.c (((mchunkptr)((char*)(p) + (s)))->prev_foot = ((size_t)(M) ^ mparams.magic)) M 2770 oshmem/mca/memheap/ptmalloc/malloc.c #define set_inuse(M,p,s)\ M 2773 oshmem/mca/memheap/ptmalloc/malloc.c mark_inuse_foot(M,p,s)) M 2775 oshmem/mca/memheap/ptmalloc/malloc.c #define set_inuse_and_pinuse(M,p,s)\ M 2778 oshmem/mca/memheap/ptmalloc/malloc.c mark_inuse_foot(M,p,s)) M 2780 oshmem/mca/memheap/ptmalloc/malloc.c #define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ M 2782 oshmem/mca/memheap/ptmalloc/malloc.c mark_inuse_foot(M, p, s)) M 3241 oshmem/mca/memheap/ptmalloc/malloc.c #define insert_small_chunk(M, P, S) {\ M 3243 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr B = smallbin_at(M, IDX);\ M 3246 oshmem/mca/memheap/ptmalloc/malloc.c if (!smallmap_is_marked(M, IDX))\ M 3247 oshmem/mca/memheap/ptmalloc/malloc.c mark_smallmap(M, IDX);\ M 3248 oshmem/mca/memheap/ptmalloc/malloc.c else if (RTCHECK(ok_address(M, B->fd)))\ M 3251 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3260 oshmem/mca/memheap/ptmalloc/malloc.c #define unlink_small_chunk(M, P, S) {\ M 3268 oshmem/mca/memheap/ptmalloc/malloc.c clear_smallmap(M, IDX);\ M 3269 oshmem/mca/memheap/ptmalloc/malloc.c else if (RTCHECK((F == smallbin_at(M,IDX) || ok_address(M, F)) &&\ M 3270 oshmem/mca/memheap/ptmalloc/malloc.c (B == smallbin_at(M,IDX) || ok_address(M, B)))) {\ M 3275 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3280 oshmem/mca/memheap/ptmalloc/malloc.c #define unlink_first_small_chunk(M, B, P, IDX) {\ M 3286 oshmem/mca/memheap/ptmalloc/malloc.c clear_smallmap(M, IDX);\ M 3287 oshmem/mca/memheap/ptmalloc/malloc.c else if (RTCHECK(ok_address(M, F))) {\ M 3292 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3298 oshmem/mca/memheap/ptmalloc/malloc.c #define replace_dv(M, P, S) {\ M 3299 oshmem/mca/memheap/ptmalloc/malloc.c size_t DVS = M->dvsize;\ M 3301 oshmem/mca/memheap/ptmalloc/malloc.c mchunkptr DV = M->dv;\ M 3303 oshmem/mca/memheap/ptmalloc/malloc.c insert_small_chunk(M, DV, DVS);\ M 3305 oshmem/mca/memheap/ptmalloc/malloc.c M->dvsize = S;\ M 3306 oshmem/mca/memheap/ptmalloc/malloc.c M->dv = P;\ M 3312 oshmem/mca/memheap/ptmalloc/malloc.c #define insert_large_chunk(M, X, S) {\ M 3316 oshmem/mca/memheap/ptmalloc/malloc.c H = treebin_at(M, IDX);\ M 3319 oshmem/mca/memheap/ptmalloc/malloc.c if (!treemap_is_marked(M, IDX)) {\ M 3320 oshmem/mca/memheap/ptmalloc/malloc.c mark_treemap(M, IDX);\ M 3334 oshmem/mca/memheap/ptmalloc/malloc.c else if (RTCHECK(ok_address(M, C))) {\ M 3341 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3347 oshmem/mca/memheap/ptmalloc/malloc.c if (RTCHECK(ok_address(M, T) && ok_address(M, F))) {\ M 3355 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3380 oshmem/mca/memheap/ptmalloc/malloc.c #define unlink_large_chunk(M, X) {\ M 3386 oshmem/mca/memheap/ptmalloc/malloc.c if (RTCHECK(ok_address(M, F))) {\ M 3391 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3403 oshmem/mca/memheap/ptmalloc/malloc.c if (RTCHECK(ok_address(M, RP)))\ M 3406 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3411 oshmem/mca/memheap/ptmalloc/malloc.c tbinptr* H = treebin_at(M, X->index);\ M 3414 oshmem/mca/memheap/ptmalloc/malloc.c clear_treemap(M, X->index);\ M 3416 oshmem/mca/memheap/ptmalloc/malloc.c else if (RTCHECK(ok_address(M, XP))) {\ M 3423 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3425 oshmem/mca/memheap/ptmalloc/malloc.c if (RTCHECK(ok_address(M, R))) {\ M 3429 oshmem/mca/memheap/ptmalloc/malloc.c if (RTCHECK(ok_address(M, C0))) {\ M 3434 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3437 oshmem/mca/memheap/ptmalloc/malloc.c if (RTCHECK(ok_address(M, C1))) {\ M 3442 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3446 oshmem/mca/memheap/ptmalloc/malloc.c CORRUPTION_ERROR_ACTION(M);\ M 3453 oshmem/mca/memheap/ptmalloc/malloc.c #define insert_chunk(M, P, S)\ M 3454 oshmem/mca/memheap/ptmalloc/malloc.c if (is_small(S)) insert_small_chunk(M, P, S)\ M 3455 oshmem/mca/memheap/ptmalloc/malloc.c else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); } M 3457 oshmem/mca/memheap/ptmalloc/malloc.c #define unlink_chunk(M, P, S)\ M 3458 oshmem/mca/memheap/ptmalloc/malloc.c if (is_small(S)) unlink_small_chunk(M, P, S)\ M 3459 oshmem/mca/memheap/ptmalloc/malloc.c else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); }