D 246 ompi/mca/pml/ob1/pml_ob1.h #define MCA_PML_OB1_ADD_FIN_TO_PENDING(P, D, Sz, B, O, S) \ D 252 ompi/mca/pml/ob1/pml_ob1.h (D).lval, (Sz)); \ D 408 ompi/mca/pml/ob1/pml_ob1_recvreq.h #define MCA_PML_OB1_ADD_ACK_TO_PENDING(P, S, D, O, Sz) \ D 415 ompi/mca/pml/ob1/pml_ob1_recvreq.h _pckt->hdr.hdr_ack.hdr_dst_req.pval = (D); \ D 7 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k); D 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); D 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); D 11 ompi/mca/topo/treematch/treematch/k-partitioning.c void balancing(int n, int deficit, int surplus, double ** const D, int * const part); D 12 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k); D 24 ompi/mca/topo/treematch/treematch/k-partitioning.c double **D = NULL; D 30 ompi/mca/topo/treematch/treematch/k-partitioning.c memory_allocation(&Q, &Qinst, &D, real_n, k); D 34 ompi/mca/topo/treematch/treematch/k-partitioning.c initialization(part, comm, &Qpart, Q, Qinst, D, real_n, k, &deficit, &surplus); D 39 ompi/mca/topo/treematch/treematch/k-partitioning.c algo(part, comm, &Qpart, Q, Qinst, D, real_n, &deficit, &surplus); D 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*/ D 46 ompi/mca/topo/treematch/treematch/k-partitioning.c destruction(&Qpart, Q, Qinst, D, real_n, k); D 51 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k) D 56 ompi/mca/topo/treematch/treematch/k-partitioning.c *D = malloc(sizeof(double *) * n); /*D's size is n * k*/ D 58 ompi/mca/topo/treematch/treematch/k-partitioning.c (*D)[i] = calloc(k, sizeof(double)); D 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) D 83 ompi/mca/topo/treematch/treematch/k-partitioning.c D[i][part[j]] += matrice[i][j]; D 91 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_insert(&Qinst[i], j, D[i][j]); /*we insert the corresponding D(i,j) value in Qinst[i]*/ D 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*/ D 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) D 134 ompi/mca/topo/treematch/treematch/k-partitioning.c D[v][j]= D[v][j] - matrice[u][v]; /*we compute the new D[v, i] (here j has the value of the starting subset of u, that's why we say i) */ D 135 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_adjustKey(&Qinst[v], j, D[v][j]); /*we update this gain in Qinst[v]*/ D 137 ompi/mca/topo/treematch/treematch/k-partitioning.c D[v][j] = D[v][j] + matrice[u][v]; /*matrice[u][v]; we compute the new D[v, j]*/ D 138 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_adjustKey(&Qinst[v], j, D[v][j]);/*we update this gain in Qinst[v]*/ D 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*/ D 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*/ D 162 ompi/mca/topo/treematch/treematch/k-partitioning.c void balancing(int n, int deficit, int surplus, double ** const D, int * const part) D 172 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_insert(&moves, i, D[i][deficit]-D[i][surplus]); /*we insert i in moves with the gain we get from moving i from surplus to deficit as key */ D 179 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k) D 193 ompi/mca/topo/treematch/treematch/k-partitioning.c free(D[i]); D 194 ompi/mca/topo/treematch/treematch/k-partitioning.c free(D); D 742 ompi/mpi/java/java/Struct.java protected final <S extends Struct, D extends Struct.Data> D 743 ompi/mpi/java/java/Struct.java D getData(S struct, int field) D 758 ompi/mpi/java/java/Struct.java protected final <S extends Struct, D extends Struct.Data> D 759 ompi/mpi/java/java/Struct.java D getData(S struct, int field, int index) D 41 orte/test/mpi/parallel_r64.c int gsize[D],distrib[D],dargs[D],psize[D]; D 42 orte/test/mpi/parallel_r64.c int dims[D],periods[D],reorder; D 119 orte/test/mpi/parallel_r64.c for ( i=0; i<D; i++ ) D 130 orte/test/mpi/parallel_r64.c MPI_Cart_create(MPI_COMM_WORLD, D, dims, periods, reorder, &new_comm); D 132 orte/test/mpi/parallel_r64.c for ( i=0; i<D; i++ ) D 153 orte/test/mpi/parallel_r64.c MPI_Type_create_darray(npes, rank, D, gsize, distrib, dargs, psize, MPI_ORDER_FORTRAN, MPI_INT, &filetype); D 41 orte/test/mpi/parallel_r8.c int gsize[D],distrib[D],dargs[D],psize[D]; D 42 orte/test/mpi/parallel_r8.c int dims[D],periods[D],reorder; D 119 orte/test/mpi/parallel_r8.c for ( i=0; i<D; i++ ) D 130 orte/test/mpi/parallel_r8.c MPI_Cart_create(MPI_COMM_WORLD, D, dims, periods, reorder, &new_comm); D 132 orte/test/mpi/parallel_r8.c for ( i=0; i<D; i++ ) D 153 orte/test/mpi/parallel_r8.c MPI_Type_create_darray(npes, rank, D, gsize, distrib, dargs, psize, MPI_ORDER_FORTRAN, MPI_INT, &filetype); D 41 orte/test/mpi/parallel_w64.c int gsize[D],distrib[D],dargs[D],psize[D]; D 42 orte/test/mpi/parallel_w64.c int dims[D],periods[D],reorder; D 124 orte/test/mpi/parallel_w64.c for ( i=0; i<D; i++ ) D 135 orte/test/mpi/parallel_w64.c MPI_Cart_create(MPI_COMM_WORLD, D, dims, periods, reorder, &new_comm); D 137 orte/test/mpi/parallel_w64.c for ( i=0; i<D; i++ ) D 158 orte/test/mpi/parallel_w64.c MPI_Type_create_darray(npes, rank, D, gsize, distrib, dargs, psize, MPI_ORDER_FORTRAN, MPI_INT, &filetype); D 40 orte/test/mpi/parallel_w8.c int gsize[D],distrib[D],dargs[D],psize[D]; D 41 orte/test/mpi/parallel_w8.c int dims[D],periods[D],reorder; D 123 orte/test/mpi/parallel_w8.c for ( i=0; i<D; i++ ) D 134 orte/test/mpi/parallel_w8.c MPI_Cart_create(MPI_COMM_WORLD, D, dims, periods, reorder, &new_comm); D 136 orte/test/mpi/parallel_w8.c for ( i=0; i<D; i++ ) D 157 orte/test/mpi/parallel_w8.c MPI_Type_create_darray(npes, rank, D, gsize, distrib, dargs, psize, MPI_ORDER_FORTRAN, MPI_INT, &filetype);