X 60 ompi/mca/coll/tuned/coll_tuned_dynamic_file.c int X, CI, NCS, CS, ALG, NMS, FANINOUT; X 104 ompi/mca/coll/tuned/coll_tuned_dynamic_file.c X = (int)getnext(fptr); X 105 ompi/mca/coll/tuned/coll_tuned_dynamic_file.c if (X<0) { X 109 ompi/mca/coll/tuned/coll_tuned_dynamic_file.c if (X>n_collectives) { X 110 ompi/mca/coll/tuned/coll_tuned_dynamic_file.c OPAL_OUTPUT((ompi_coll_tuned_stream,"Number of collectives in configuration file %d is greater than number of MPI collectives possible %d ??? error around line %d\n", X, n_collectives, fileline)); X 114 ompi/mca/coll/tuned/coll_tuned_dynamic_file.c for (x=0;x<X;x++) { /* for each collective */ X 2248 orte/orted/orted_submit.c #define DUMP_INT(X) fprintf(stderr, " %s = %d\n", # X, X); X 72 orte/test/mpi/parallel_r64.c printf(" global grid size: %dx%dx%d 4 byte integers (total %lu)\n",X,Y,Z,(unsigned long)X*Y*Z); X 139 orte/test/mpi/parallel_r64.c gsize[0] = X; X 180 orte/test/mpi/parallel_r64.c mbs = (((double)(LOOP*X*Y*Z)*sizeof(int)))/(1000000.0*(t2-t1)); X 72 orte/test/mpi/parallel_r8.c printf(" global grid size: %dx%dx%d 4 byte integers (total %lu)\n",X,Y,Z,(unsigned long)X*Y*Z); X 139 orte/test/mpi/parallel_r8.c gsize[0] = X; X 180 orte/test/mpi/parallel_r8.c mbs = (((double)(LOOP*X*Y*Z)*sizeof(int)))/(1000000.0*(t2-t1)); X 72 orte/test/mpi/parallel_w64.c printf(" global grid size: %dx%dx%d 4 byte integers (total %lu)\n",X,Y,Z,(unsigned long)X*Y*Z); X 144 orte/test/mpi/parallel_w64.c gsize[0] = X; X 186 orte/test/mpi/parallel_w64.c mbs = (((double)(LOOP*X*Y*Z)*sizeof(int)))/(1000000.0*(t2-t1)); X 71 orte/test/mpi/parallel_w8.c printf(" global grid size: %dx%dx%d 4 byte integers (total %lu)\n",X,Y,Z,(unsigned long)X*Y*Z); X 143 orte/test/mpi/parallel_w8.c gsize[0] = X; X 185 orte/test/mpi/parallel_w8.c mbs = (((double)(LOOP*X*Y*Z)*sizeof(int)))/(1000000.0*(t2-t1)); X 2554 oshmem/mca/memheap/ptmalloc/malloc.c unsigned int X = S >> TREEBIN_SHIFT;\ X 2555 oshmem/mca/memheap/ptmalloc/malloc.c if (X == 0)\ X 2557 oshmem/mca/memheap/ptmalloc/malloc.c else if (X > 0xFFFF)\ X 2561 oshmem/mca/memheap/ptmalloc/malloc.c __asm__("bsrl\t%1, %0\n\t" : "=r" (K) : "g" (X));\ X 2569 oshmem/mca/memheap/ptmalloc/malloc.c size_t X = S >> TREEBIN_SHIFT;\ X 2570 oshmem/mca/memheap/ptmalloc/malloc.c if (X == 0)\ X 2572 oshmem/mca/memheap/ptmalloc/malloc.c else if (X > 0xFFFF)\ X 2576 oshmem/mca/memheap/ptmalloc/malloc.c _BitScanReverse((DWORD *) &K, X);\ X 2583 oshmem/mca/memheap/ptmalloc/malloc.c size_t X = S >> TREEBIN_SHIFT;\ X 2584 oshmem/mca/memheap/ptmalloc/malloc.c if (X == 0)\ X 2586 oshmem/mca/memheap/ptmalloc/malloc.c else if (X > 0xFFFF)\ X 2589 oshmem/mca/memheap/ptmalloc/malloc.c unsigned int Y = (unsigned int)X;\ X 2632 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I)\ X 2635 oshmem/mca/memheap/ptmalloc/malloc.c __asm__("bsfl\t%1, %0\n\t" : "=r" (J) : "g" (X));\ X 2639 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I)\ X 2642 oshmem/mca/memheap/ptmalloc/malloc.c _BitScanForward((DWORD *) &J, X);\ X 2648 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I) I = ffs(X)-1 X 2651 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I)\ X 2653 oshmem/mca/memheap/ptmalloc/malloc.c unsigned int Y = X - 1;\ X 3312 oshmem/mca/memheap/ptmalloc/malloc.c #define insert_large_chunk(M, X, S) {\ X 3317 oshmem/mca/memheap/ptmalloc/malloc.c X->index = IDX;\ X 3318 oshmem/mca/memheap/ptmalloc/malloc.c X->child[0] = X->child[1] = 0;\ X 3321 oshmem/mca/memheap/ptmalloc/malloc.c *H = X;\ X 3322 oshmem/mca/memheap/ptmalloc/malloc.c X->parent = (tchunkptr)H;\ X 3323 oshmem/mca/memheap/ptmalloc/malloc.c X->fd = X->bk = X;\ X 3335 oshmem/mca/memheap/ptmalloc/malloc.c *C = X;\ X 3336 oshmem/mca/memheap/ptmalloc/malloc.c X->parent = T;\ X 3337 oshmem/mca/memheap/ptmalloc/malloc.c X->fd = X->bk = X;\ X 3348 oshmem/mca/memheap/ptmalloc/malloc.c T->fd = F->bk = X;\ X 3349 oshmem/mca/memheap/ptmalloc/malloc.c X->fd = F;\ X 3350 oshmem/mca/memheap/ptmalloc/malloc.c X->bk = T;\ X 3351 oshmem/mca/memheap/ptmalloc/malloc.c X->parent = 0;\ X 3380 oshmem/mca/memheap/ptmalloc/malloc.c #define unlink_large_chunk(M, X) {\ X 3381 oshmem/mca/memheap/ptmalloc/malloc.c tchunkptr XP = X->parent;\ X 3383 oshmem/mca/memheap/ptmalloc/malloc.c if (X->bk != X) {\ X 3384 oshmem/mca/memheap/ptmalloc/malloc.c tchunkptr F = X->fd;\ X 3385 oshmem/mca/memheap/ptmalloc/malloc.c R = X->bk;\ X 3396 oshmem/mca/memheap/ptmalloc/malloc.c if (((R = *(RP = &(X->child[1]))) != 0) ||\ X 3397 oshmem/mca/memheap/ptmalloc/malloc.c ((R = *(RP = &(X->child[0]))) != 0)) {\ X 3411 oshmem/mca/memheap/ptmalloc/malloc.c tbinptr* H = treebin_at(M, X->index);\ X 3412 oshmem/mca/memheap/ptmalloc/malloc.c if (X == *H) {\ X 3414 oshmem/mca/memheap/ptmalloc/malloc.c clear_treemap(M, X->index);\ X 3417 oshmem/mca/memheap/ptmalloc/malloc.c if (XP->child[0] == X) \ X 3428 oshmem/mca/memheap/ptmalloc/malloc.c if ((C0 = X->child[0]) != 0) {\ X 3436 oshmem/mca/memheap/ptmalloc/malloc.c if ((C1 = X->child[1]) != 0) {\