K                 795 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int depth,i, K;
K                 825 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   if((K=nb_cores - N)>0){
K                 827 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     complete_obj_weight(&obj_weight,N,K);
K                 828 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   } else if( K < 0){
K                 848 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   local_vertices = (int*) MALLOC (sizeof(int) * (K+N));
K                 852 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for( i = MIN(N,nb_constraints) ;i < N + K ; i++)
K                 862 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   kpartition_build_level_topology(root, &com_mat, N+K,  depth, topology, local_vertices,
K                1957 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_aff_mat(tm_affinity_mat_t **aff_mat , int mat_order, int K)
K                1964 ompi/mca/topo/treematch/treematch/tm_tree.c   M = mat_order+K;
K                1979 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_obj_weight(double **tab, int mat_order, int K)
K                1994 ompi/mca/topo/treematch/treematch/tm_tree.c   M = mat_order+K;
K                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)
K                2034 ompi/mca/topo/treematch/treematch/tm_tree.c   if( K == 0 )
K                2039 ompi/mca/topo/treematch/treematch/tm_tree.c   M = mat_order+K;
K                2082 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, K=0, M; /*M = mat_order/Arity: number the groups*/
K                2104 ompi/mca/topo/treematch/treematch/tm_tree.c     K = arity*((mat_order/arity)+1)-mat_order;
K                2107 ompi/mca/topo/treematch/treematch/tm_tree.c       printf("****mat_order=%d arity=%d K=%d\n", mat_order, arity, K);
K                2110 ompi/mca/topo/treematch/treematch/tm_tree.c     complete_aff_mat(&aff_mat, mat_order, K);
K                2112 ompi/mca/topo/treematch/treematch/tm_tree.c     complete_obj_weight(&obj_weight, mat_order, K);
K                2115 ompi/mca/topo/treematch/treematch/tm_tree.c     complete_tab_node(&tab_node, mat_order, K, depth, topology);
K                2117 ompi/mca/topo/treematch/treematch/tm_tree.c     mat_order += K; /*increase the number of nodes accordingly*/
K                2163 ompi/mca/topo/treematch/treematch/tm_tree.c   for( i = mat_order-K ; i < mat_order ; i++ )
K                2560 oshmem/mca/memheap/ptmalloc/malloc.c     unsigned int K;\
K                2561 oshmem/mca/memheap/ptmalloc/malloc.c     __asm__("bsrl\t%1, %0\n\t" : "=r" (K) : "g"  (X));\
K                2562 oshmem/mca/memheap/ptmalloc/malloc.c     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
K                2575 oshmem/mca/memheap/ptmalloc/malloc.c     unsigned int K;\
K                2576 oshmem/mca/memheap/ptmalloc/malloc.c     _BitScanReverse((DWORD *) &K, X);\
K                2577 oshmem/mca/memheap/ptmalloc/malloc.c     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
K                2591 oshmem/mca/memheap/ptmalloc/malloc.c     unsigned int K = (((Y <<= N) - 0x1000) >> 16) & 4;\
K                2592 oshmem/mca/memheap/ptmalloc/malloc.c     N += K;\
K                2593 oshmem/mca/memheap/ptmalloc/malloc.c     N += K = (((Y <<= K) - 0x4000) >> 16) & 2;\
K                2594 oshmem/mca/memheap/ptmalloc/malloc.c     K = 14 - N + ((Y <<= K) >> 15);\
K                2595 oshmem/mca/memheap/ptmalloc/malloc.c     I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\
K                2654 oshmem/mca/memheap/ptmalloc/malloc.c   unsigned int K = Y >> (16-4) & 16;\
K                2655 oshmem/mca/memheap/ptmalloc/malloc.c   unsigned int N = K;        Y >>= K;\
K                2656 oshmem/mca/memheap/ptmalloc/malloc.c   N += K = Y >> (8-3) &  8;  Y >>= K;\
K                2657 oshmem/mca/memheap/ptmalloc/malloc.c   N += K = Y >> (4-2) &  4;  Y >>= K;\
K                2658 oshmem/mca/memheap/ptmalloc/malloc.c   N += K = Y >> (2-1) &  2;  Y >>= K;\
K                2659 oshmem/mca/memheap/ptmalloc/malloc.c   N += K = Y >> (1-0) &  1;  Y >>= K;\
K                3327 oshmem/mca/memheap/ptmalloc/malloc.c     size_t K = S << leftshift_for_tree_index(IDX);\
K                3330 oshmem/mca/memheap/ptmalloc/malloc.c         tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
K                3331 oshmem/mca/memheap/ptmalloc/malloc.c         K <<= 1;\