part 8 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus); part 9 ompi/mca/topo/treematch/treematch/k-partitioning.c void algo(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int * const deficit, int * const surplus); part 11 ompi/mca/topo/treematch/treematch/k-partitioning.c void balancing(int n, int deficit, int surplus, double ** const D, int * const part); part 25 ompi/mca/topo/treematch/treematch/k-partitioning.c int deficit, surplus, *part = NULL; part 28 ompi/mca/topo/treematch/treematch/k-partitioning.c part = build_p_vector(comm, n, k, greedy_trials, constraints, nb_constraints); part 34 ompi/mca/topo/treematch/treematch/k-partitioning.c initialization(part, comm, &Qpart, Q, Qinst, D, real_n, k, &deficit, &surplus); part 39 ompi/mca/topo/treematch/treematch/k-partitioning.c algo(part, comm, &Qpart, Q, Qinst, D, real_n, &deficit, &surplus); part 43 ompi/mca/topo/treematch/treematch/k-partitioning.c balancing(real_n, deficit, surplus, D, part); /*if partition isn't balanced we have to make one last move*/ part 48 ompi/mca/topo/treematch/treematch/k-partitioning.c return part; part 61 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus) part 83 ompi/mca/topo/treematch/treematch/k-partitioning.c D[i][part[j]] += matrice[i][j]; part 95 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_insert(&Q[part[i]], i, PQ_findMaxKey(&Qinst[i])-D[i][part[i]]); /*we insert in Q[part[i]] the vertex i with its highest possible gain*/ part 106 ompi/mca/topo/treematch/treematch/k-partitioning.c void algo(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int * const deficit, int * const surplus) part 114 ompi/mca/topo/treematch/treematch/k-partitioning.c *deficit = part[u]; /*p becomes the deficit */ part 119 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_delete(Qpart, part[u]); /*then we remove surplus from Qpart (note that u is from surplus so part[u] is surplus) */ part 121 ompi/mca/topo/treematch/treematch/k-partitioning.c d = PQ_findMaxKey(&Q[part[u]]); /*we get the next highest possible gain in part[u] (without taking u in account as we already removed it from Q[part[u])*/ part 122 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_insert(Qpart, part[u], d); /*we put part[u] back in Qpart with its new highest possible gain*/ part 133 ompi/mca/topo/treematch/treematch/k-partitioning.c j = part[u]; /*we set j to the starting subset */ part 139 ompi/mca/topo/treematch/treematch/k-partitioning.c d = PQ_findMaxKey(&Qinst[v]) - D[v][part[v]]; /*we compute v's new highest possible gain*/ part 140 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_adjustKey(&Q[part[v]], v, d); /*we update it in Q[p[v]]*/ part 141 ompi/mca/topo/treematch/treematch/k-partitioning.c d = PQ_findMaxKey(&Q[part[v]]); /*we get the highest possible gain in v's subset*/ part 142 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_adjustKey(Qpart, part[v], d); /*we update it in Qpart*/ part 144 ompi/mca/topo/treematch/treematch/k-partitioning.c part[u] = *surplus; /*we move u from i to j (here surplus has the value of j the arrival subset)*/ part 146 ompi/mca/topo/treematch/treematch/k-partitioning.c d = PQ_findMaxKey(&Qinst[u]) - D[u][part[u]]; /*we compute the new u's highest possible gain*/ part 148 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_insert(&Q[part[u]], u, d); /*we insert u in the Q queue of its new subset*/ part 149 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_adjustKey(Qpart, part[u], d); /*we update the new highest possible gain in u's subset*/ part 162 ompi/mca/topo/treematch/treematch/k-partitioning.c void balancing(int n, int deficit, int surplus, double ** const D, int * const part) part 171 ompi/mca/topo/treematch/treematch/k-partitioning.c if(part[i] == surplus) /*if i is from surplus*/ part 174 ompi/mca/topo/treematch/treematch/k-partitioning.c part[PQ_deleteMax(&moves)] = deficit; /*we put the i from moves with the highest gain in deficit*/ part 303 ompi/mca/topo/treematch/treematch/k-partitioning.c int * part = NULL; part 306 ompi/mca/topo/treematch/treematch/k-partitioning.c part = kpartition_greedy2(k, comm, n, greedy_trials, constraints, nb_constraints); part 314 ompi/mca/topo/treematch/treematch/k-partitioning.c part = malloc(sizeof(int) * n); part 318 ompi/mca/topo/treematch/treematch/k-partitioning.c part[nb_real_nodes+i] = i_part; part 328 ompi/mca/topo/treematch/treematch/k-partitioning.c part[i] = j; /*then we put the node in this part*/ part 338 ompi/mca/topo/treematch/treematch/k-partitioning.c return part; part 4142 opal/mca/event/libevent2022/libevent/http.c end_of_path(char *cp, enum uri_part part, unsigned flags) part 4150 opal/mca/event/libevent2022/libevent/http.c switch (part) { part 4174 opal/mca/event/libevent2022/libevent/http.c else if (*cp == '?' && part != PART_PATH) part 427 opal/mca/pmix/pmix4x/pmix/src/util/path.c struct mntent * part = NULL; part 430 opal/mca/pmix/pmix4x/pmix/src/util/path.c while (NULL != (part = getmntent(mtab))) { part 431 opal/mca/pmix/pmix4x/pmix/src/util/path.c if ((NULL != part->mnt_dir) && part 432 opal/mca/pmix/pmix4x/pmix/src/util/path.c (NULL != part->mnt_type) && part 433 opal/mca/pmix/pmix4x/pmix/src/util/path.c (0 == strcmp(part->mnt_dir, dev_path))) part 436 opal/mca/pmix/pmix4x/pmix/src/util/path.c return strdup(part->mnt_type); part 420 opal/util/path.c struct mntent * part = NULL; part 423 opal/util/path.c while (NULL != (part = getmntent(mtab))) { part 424 opal/util/path.c if ((NULL != part->mnt_dir) && part 425 opal/util/path.c (NULL != part->mnt_type) && part 426 opal/util/path.c (0 == strcmp(part->mnt_dir, dev_path))) part 429 opal/util/path.c return strdup(part->mnt_type);