partition         288 ompi/mca/topo/treematch/treematch/k-partitioning.c double eval_cost2(int *partition, int n, double **comm)
partition         295 ompi/mca/topo/treematch/treematch/k-partitioning.c       if(partition[i] != partition[j])
partition         157 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int          *partition = (int *)MALLOC(sizeof(int) * n);
partition         271 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     FREE(partition);
partition         272 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     partition = kpartition_greedy(k, com_mat, n, constraints, nb_constraints);
partition         275 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       partition[i] = parttab [i];
partition         284 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   return partition;
partition         327 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c double eval_cost(int *partition, com_mat_t *com_mat)
partition         334 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if(partition[i] != partition[j])
partition         342 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int *partition = NULL, *best_partition=NULL, *size = NULL;
partition         374 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     partition = (int *)MALLOC(sizeof(int)*n);
partition         376 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       partition[i] = -1;
partition         406 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	  partition[dumb_id] = i;
partition         428 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       } while ( partition[j] != -1 );
partition         430 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       partition[j] = i;
partition         439 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if( partition[i] == -1)
partition         440 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	allocate_vertex(i, partition, com_mat, n, size, max_size);
partition         442 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     cost = eval_cost(partition,com_mat);
partition         450 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       best_partition=partition;
partition         452 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       FREE(partition);
partition         542 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c com_mat_t **split_com_mat(com_mat_t *com_mat, int n, int k, int *partition)
partition         553 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     printf("Partition: "); print_1D_tab(partition,n);
partition         569 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if ( partition[j] == cur_part )
partition         574 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	fprintf(stderr,"Partition: "); print_1D_tab(partition,n);
partition         612 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int **split_vertices( int *vertices, int n, int k, int *partition)
partition         623 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     printf("Partition: ");print_1D_tab(partition,n);
partition         632 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if ( partition[j] == cur_part )
partition         705 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c static void display_partition(int *partition, int *local_vertices, int n, int depth, int k){
partition         711 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if ( partition[j] == cur_part ){
partition         728 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int *partition = NULL;
partition         751 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   partition = kpartition(k, com_mat, N, constraints, nb_constraints);
partition         754 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     display_partition(partition, local_vertices, N, depth, k);
partition         758 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tab_com_mat = split_com_mat( com_mat, N, k, partition);
partition         761 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tab_local_vertices = split_vertices( local_vertices, N, k, partition);
partition         786 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   FREE(partition);
partition        1587 ompi/mca/topo/treematch/treematch/tm_tree.c   int *partition = NULL;
partition        1599 ompi/mca/topo/treematch/treematch/tm_tree.c   partition = kpartition(solution_size, &com_mat, n, NULL, 0);
partition        1606 ompi/mca/topo/treematch/treematch/tm_tree.c     i = partition[k];
partition        1620 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(partition);
partition         339 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define netloc_topology_iter_partitions(topology,partition) \
partition         340 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     for ((partition) = (char **)utarray_front(topology->partitions); \
partition         341 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h             (partition) != NULL; \
partition         342 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h             (partition) = (char **)utarray_next(topology->partitions, partition))
partition         411 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h int netloc_node_is_in_partition(netloc_node_t *node, int partition);
partition         441 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h int netloc_edge_is_in_partition(netloc_edge_t *edge, int partition);
partition         110 orte/test/system/orte_dfs.c     int64_t i64, length, offset, partition;
partition         264 orte/test/system/orte_dfs.c                 if (OPAL_SUCCESS != (rc = opal_dss.unpack(xfer, &partition, &cnt, OPAL_INT64))) {
partition         270 orte/test/system/orte_dfs.c                             (int)partition, (NULL == host) ? "NULL" : host, path, (int)length, (int)offset);
partition         273 orte/test/system/orte_dfs.c                 if (partition == (int64_t)ORTE_PROC_MY_NAME->vpid) {