/dports/net/mpich2/mpich2-1.5/test/mpi/topo/ |
H A D | dims2.c | 25 int dims[4], nnodes; in main() local 30 for (nnodes=1; nnodes <= 32; nnodes = nnodes * 2) { in main() 32 dims[1] = nnodes; in main() 39 nnodes ); in main() 45 dims[1] = nnodes; in main() 51 nnodes ); in main() 57 for (nnodes=4; nnodes <= 32; nnodes = nnodes * 2) { in main() 59 dims[1] = nnodes/2; in main() 69 nnodes/2 ); in main() 75 dims[1] = nnodes/2; in main() [all …]
|
H A D | dims1.c | 49 nnodes, ndims ); in main() 55 nnodes, ndims ); in main() 60 nnodes = 2*7; in main() 67 nnodes, ndims ); in main() 73 nnodes, ndims ); in main() 83 nnodes, ndims ); in main() 89 nnodes, ndims ); in main() 92 nnodes = 11; in main() 99 nnodes, ndims ); in main() 105 nnodes, ndims ); in main() [all …]
|
/dports/net/mpich/mpich-3.4.3/test/mpi/topo/ |
H A D | dims2.c | 25 int dims[4], nnodes; in main() local 30 for (nnodes = 1; nnodes <= 32; nnodes = nnodes * 2) { in main() 32 dims[1] = nnodes; in main() 34 MPI_Dims_create(nnodes, 2, dims); in main() 35 if (prodof(2, dims) != nnodes) { in main() 44 dims[1] = nnodes; in main() 45 MPI_Dims_create(nnodes, 2, dims); in main() 46 if (prodof(2, dims) != nnodes) { in main() 54 for (nnodes = 4; nnodes <= 32; nnodes = nnodes * 2) { in main() 56 dims[1] = nnodes / 2; in main() [all …]
|
H A D | dims1.c | 36 int dims[4], nnodes, ndims; in main() local 42 nnodes = 2 * 3 * 5 * 7 * 11; in main() 45 MPI_Dims_create(nnodes, ndims, dims); in main() 46 if (prodof(ndims, dims) != nnodes) { in main() 59 nnodes = 2 * 7; in main() 63 if (prodof(ndims, dims) != nnodes) { in main() 74 nnodes = 2 * 2 * 3 * 3 * 5 * 7 * 11; in main() 78 if (prodof(ndims, dims) != nnodes) { in main() 89 nnodes = 11; in main() 104 nnodes = 5 * 7 * 11; in main() [all …]
|
/dports/math/dsdp/DSDP5.8/pdsdp/ScaLAPACK/ |
H A D | maxcut.c | 27 int *node1,*node2,nedges,nnodes; in main() local 63 info = DSDPCreate(nnodes,&dsdp); in MaxCut() 79 for (i=0;i<nnodes;i++){ in MaxCut() 84 for (i=0;i<nnodes;i++){ in MaxCut() 113 info = SDPConeSetASparseVecMat(sdpcone,0,0,nnodes,1.0,0,indd,val,nedges+nnodes); in MaxCut() 116 info = SDPConeAddASparseVecMat(sdpcone,0,0,nnodes,1.0,0,indd+nedges,val+nedges,nnodes); in MaxCut() 123 for (i=0;i<nnodes; i++){ in MaxCut() 155 info=DSDPGetY(dsdp,y,nnodes); in MaxCut() 188 for (i=0;i<nnodes;i++){ in MaxCutRandomized() 193 info=SDPConeAddXVAV(sdpcone,0,tt,nnodes,cc,nnodes+2); in MaxCutRandomized() [all …]
|
/dports/math/dsdp/DSDP5.8/examples/ |
H A D | maxcut.c | 26 int *node1,*node2,nedges,nnodes; in main() local 60 info = DSDPCreate(nnodes,&dsdp); in MaxCut() 76 for (i=0;i<nnodes;i++){ in MaxCut() 81 for (i=0;i<nnodes;i++){ in MaxCut() 93 for (i=0;i<nnodes;i++){yy[i]=0.0;} in MaxCut() 110 info = SDPConeSetASparseVecMat(sdpcone,0,0,nnodes,1.0,0,indd,val,nedges+nnodes); in MaxCut() 113 info = SDPConeAddASparseVecMat(sdpcone,0,0,nnodes,1.0,0,indd+nedges,val+nedges,nnodes); in MaxCut() 120 for (i=0;i<nnodes; i++){ in MaxCut() 183 for (i=0;i<nnodes;i++){ in MaxCutRandomized() 188 info=SDPConeAddXVAV(sdpcone,0,tt,nnodes,cc,nnodes+2); in MaxCutRandomized() [all …]
|
H A D | stable.c | 42 int info,kk,nedges,nnodes; in StableSet() local 109 int i,ii,info,nnodes=nodes+1; in SetStableSetData() local 115 iptr=(int*)malloc(nnodes*sizeof(int)); in SetStableSetData() 116 iptr2=(int*)malloc(nnodes*sizeof(int)); in SetStableSetData() 119 for (i=0;i<nnodes;i++){ in SetStableSetData() 128 for (i=0;i<nnodes;i++){ in SetStableSetData() 140 info = SDPConeAddARankOneMat(sdpcone,0,i+nnodes+1,nnodes,1.0,0,Edge[i].indd,Edge[i].v,3); in SetStableSetData() 165 int i,j,derror,info,nnodes=nodes+1; in StableRandomized() local 173 for (i=0;i<nnodes;i++){ in StableRandomized() 188 info=SDPConeAddXVAV(sdpcone,0,tt,nnodes,cc,edges+nnodes+2); in StableRandomized() [all …]
|
H A D | color.c | 42 int *node1,*node2,nedges,nnodes; in MinColoring() local 72 for (i=0;i<nnodes;i++){ in MinColoring() 76 for (i=0;i<nnodes;i++){ in MinColoring() 83 bb=2-2.0/nnodes; in MinColoring() 92 vari=nnodes+i+1; in MinColoring() 184 for (i=0;i<nnodes;i++) iwork[i]=0; in HighDegree() 193 int i,nmax=nnodes; in First() 194 for (i=0;i<nnodes;i++){ in First() 223 maxvertex=First(color,nnodes); in RandomizedColor() 233 for (i=0;i<nnodes;i++){ in RandomizedColor() [all …]
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | negf_integr_utils.F | 49 INTEGER, INTENT(in) :: nnodes 58 CPASSERT(nnodes >= 1) 60 rscale = (b - a)/REAL(nnodes - 1, kind=dp) 61 DO i = 1, nnodes 72 COMPLEX(kind=dp), DIMENSION(nnodes), INTENT(out), & 93 ALLOCATE (tnodes_angle(nnodes)) 96 CALL rescale_nodes_pi_phi(a, b, nnodes, tnodes_angle) 104 DO i = 1, nnodes 226 DO i = 1, nnodes 238 SUBROUTINE rescale_nodes_cos(nnodes, tnodes) argument [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | negf_integr_utils.F | 49 INTEGER, INTENT(in) :: nnodes 58 CPASSERT(nnodes >= 1) 60 rscale = (b-a)/REAL(nnodes-1, kind=dp) 61 DO i = 1, nnodes 72 COMPLEX(kind=dp), DIMENSION(nnodes), INTENT(out), & 93 ALLOCATE (tnodes_angle(nnodes)) 96 CALL rescale_nodes_pi_phi(a, b, nnodes, tnodes_angle) 104 DO i = 1,nnodes 226 DO i = 1,nnodes 238 SUBROUTINE rescale_nodes_cos(nnodes, tnodes) argument [all …]
|
/dports/math/parmetis/parmetis-4.0.3/metis/GKlib/ |
H A D | gk_mkpqueue.h | 35 queue->nnodes = 0;\ 54 queue->nnodes = 0;\ 103 i = queue->nnodes++;\ 143 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) {\ 161 nnodes = queue->nnodes;\ 223 nnodes = queue->nnodes;\ 270 queue->nnodes--;\ 384 size_t nnodes;\ 390 nnodes = queue->nnodes;\ 392 if (nnodes == 0)\ [all …]
|
/dports/math/py-PyMetis/PyMetis-2020.1/src/metis/GKlib/ |
H A D | gk_mkpqueue.h | 35 queue->nnodes = 0;\ 54 queue->nnodes = 0;\ 103 i = queue->nnodes++;\ 143 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) {\ 161 nnodes = queue->nnodes;\ 223 nnodes = queue->nnodes;\ 270 queue->nnodes--;\ 384 size_t nnodes;\ 390 nnodes = queue->nnodes;\ 392 if (nnodes == 0)\ [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/GKlib/ |
H A D | gk_mkpqueue.h | 35 queue->nnodes = 0;\ 54 queue->nnodes = 0;\ 103 i = queue->nnodes++;\ 143 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) {\ 161 nnodes = queue->nnodes;\ 223 nnodes = queue->nnodes;\ 270 queue->nnodes--;\ 384 size_t nnodes;\ 390 nnodes = queue->nnodes;\ 392 if (nnodes == 0)\ [all …]
|
/dports/math/libmesh/libmesh-1.6.2/contrib/metis/GKlib/ |
H A D | gk_mkpqueue.h | 35 queue->nnodes = 0;\ 54 queue->nnodes = 0;\ 103 i = queue->nnodes++;\ 143 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) {\ 161 nnodes = queue->nnodes;\ 223 nnodes = queue->nnodes;\ 270 queue->nnodes--;\ 384 size_t nnodes;\ 390 nnodes = queue->nnodes;\ 392 if (nnodes == 0)\ [all …]
|
/dports/science/octopus/octopus-10.5/external_libs/metis-5.1/GKlib/ |
H A D | gk_mkpqueue.h | 34 queue->nnodes = 0;\ 53 queue->nnodes = 0;\ 102 i = queue->nnodes++;\ 142 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) {\ 160 nnodes = queue->nnodes;\ 222 nnodes = queue->nnodes;\ 269 queue->nnodes--;\ 383 size_t nnodes;\ 389 nnodes = queue->nnodes;\ 391 if (nnodes == 0)\ [all …]
|
/dports/math/metis/metis-5.1.0/GKlib/ |
H A D | gk_mkpqueue.h | 35 queue->nnodes = 0;\ 54 queue->nnodes = 0;\ 103 i = queue->nnodes++;\ 143 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) {\ 161 nnodes = queue->nnodes;\ 223 nnodes = queue->nnodes;\ 270 queue->nnodes--;\ 384 size_t nnodes;\ 390 nnodes = queue->nnodes;\ 392 if (nnodes == 0)\ [all …]
|
/dports/net/mpich/mpich-3.4.3/src/mpi/topo/ |
H A D | graphcreate.c | 39 int MPIR_Graph_create(MPIR_Comm * comm_ptr, int nnodes, in MPIR_Graph_create() argument 80 nedges = indx[nnodes - 1]; in MPIR_Graph_create() 85 graph_ptr->topo.graph.nnodes = nnodes; in MPIR_Graph_create() 91 for (i = 0; i < nnodes; i++) in MPIR_Graph_create() 198 if (nnodes > 0) { in MPI_Graph_create() 216 if (nnodes > comm_size) { in MPI_Graph_create() 234 for (i = 0; i < nnodes; i++) { in MPI_Graph_create() 256 if (nnodes > 0) { in MPI_Graph_create() 257 for (i = 0; i < indx[nnodes - 1]; i++) { in MPI_Graph_create() 279 if (nnodes == 0) { in MPI_Graph_create() [all …]
|
/dports/net/mpich2/mpich2-1.5/src/mpi/topo/ |
H A D | graphcreate.c | 85 nedges = indx[nnodes-1]; in MPIR_Graph_create() 90 graph_ptr->topo.graph.nnodes = nnodes; in MPIR_Graph_create() 96 for (i=0; i<nnodes; i++) in MPIR_Graph_create() 122 nnodes, indx, in MPIR_Graph_create() 207 if (nnodes > 0) { in MPI_Graph_create() 225 if (nnodes > comm_size) { in MPI_Graph_create() 231 nnodes, comm_size ); in MPI_Graph_create() 242 for (i=0; i<nnodes; i++) { in MPI_Graph_create() 263 if (nnodes > 0) { in MPI_Graph_create() 264 for (i=0; i<indx[nnodes-1]; i++) { in MPI_Graph_create() [all …]
|
/dports/databases/grass7/grass-7.8.6/lib/vector/neta/ |
H A D | centrality.c | 37 for (i = 1; i <= nnodes; i++) in NetA_degree_centrality() 57 int i, iter, nnodes; in NetA_eigenvector_centrality() local 68 for (i = 1; i <= nnodes; i++) in NetA_eigenvector_centrality() 71 for (i = 1; i <= nnodes; i++) in NetA_eigenvector_centrality() 95 for (i = 2; i <= nnodes; i++) in NetA_eigenvector_centrality() 98 for (i = 1; i <= nnodes; i++) { in NetA_eigenvector_centrality() 162 G_percent(count++, nnodes, 1); in NetA_betweenness_closeness() 168 for (i = 1; i <= nnodes; i++) in NetA_betweenness_closeness() 170 for (i = 1; i <= nnodes; i++) { in NetA_betweenness_closeness() 217 for (i = 1; i <= nnodes; i++) in NetA_betweenness_closeness() [all …]
|
/dports/math/SCIP/scip-7.0.3/applications/Coloring/src/ |
H A D | heur_init.c | 130 for( i = 0; i < nnodes; i++) in hasUncoloredNode() 152 int nnodes; in greedyStableSet() local 176 for( i = 0; i < nnodes; i++ ) in greedyStableSet() 188 for( i = 1; i < nnodes; i++) in greedyStableSet() 232 int nnodes; in greedyInitialColoring() local 241 assert(nnodes > 0); in greedyInitialColoring() 243 for( i = 0; i < nnodes; i++ ) in greedyInitialColoring() 270 int nnodes; in getNViolatedEdges() local 311 int nnodes; in runTabuCol() local 406 minvalue = nnodes * nnodes; in runTabuCol() [all …]
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/topo/base/ |
H A D | topo_base_graph_create.c | 45 int nnodes, in mca_topo_base_graph_create() argument 60 if( num_procs < nnodes ) { in mca_topo_base_graph_create() 63 if( num_procs > nnodes ) { in mca_topo_base_graph_create() 64 num_procs = nnodes; in mca_topo_base_graph_create() 66 if( new_rank > (nnodes - 1) ) { in mca_topo_base_graph_create() 69 nnodes = 0; in mca_topo_base_graph_create() 76 graph->nnodes = nnodes; in mca_topo_base_graph_create() 87 graph->index = (int*)malloc(sizeof(int) * nnodes); in mca_topo_base_graph_create() 92 memcpy(graph->index, index, nnodes * sizeof(int)); in mca_topo_base_graph_create() 119 new_comm = ompi_comm_allocate(nnodes, 0); in mca_topo_base_graph_create() [all …]
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/base/ |
H A D | topo_base_graph_create.c | 45 int nnodes, in mca_topo_base_graph_create() argument 60 if( num_procs < nnodes ) { in mca_topo_base_graph_create() 63 if( num_procs > nnodes ) { in mca_topo_base_graph_create() 64 num_procs = nnodes; in mca_topo_base_graph_create() 66 if( new_rank > (nnodes - 1) ) { in mca_topo_base_graph_create() 69 nnodes = 0; in mca_topo_base_graph_create() 76 graph->nnodes = nnodes; in mca_topo_base_graph_create() 87 graph->index = (int*)malloc(sizeof(int) * nnodes); in mca_topo_base_graph_create() 92 memcpy(graph->index, index, nnodes * sizeof(int)); in mca_topo_base_graph_create() 119 new_comm = ompi_comm_allocate(nnodes, 0); in mca_topo_base_graph_create() [all …]
|
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Metis/metis-4.0/Lib/ |
H A D | pqueue.c | 27 queue->nnodes = 0; in PQueueInit() 83 queue->nnodes = 0; in PQueueReset() 131 return queue->nnodes; in PQueueGetSize() 149 queue->nnodes++; in PQueueInsert() 209 queue->nnodes--; in PQueueDelete() 239 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) { in PQueueDelete() 450 queue->nnodes--; in PQueueGetMax() 553 int i, j, nnodes; in CheckHeap() local 559 nnodes = queue->nnodes; in CheckHeap() 561 if (nnodes == 0) in CheckHeap() [all …]
|
/dports/graphics/colmap/colmap-3.6/lib/Graclus/metisLib/ |
H A D | pqueue.c | 27 queue->nnodes = 0; in PQueueInit() 83 queue->nnodes = 0; in PQueueReset() 131 return queue->nnodes; in PQueueGetSize() 149 queue->nnodes++; in PQueueInsert() 209 queue->nnodes--; in PQueueDelete() 239 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) { in PQueueDelete() 450 queue->nnodes--; in PQueueGetMax() 553 int i, j, nnodes; in CheckHeap() local 559 nnodes = queue->nnodes; in CheckHeap() 561 if (nnodes == 0) in CheckHeap() [all …]
|
/dports/science/siconos/siconos-4.4.0/externals/lbl/metis4/ |
H A D | pqueue.c | 27 queue->nnodes = 0; in PQueueInit() 83 queue->nnodes = 0; in PQueueReset() 131 return queue->nnodes; in PQueueGetSize() 149 queue->nnodes++; in PQueueInsert() 209 queue->nnodes--; in PQueueDelete() 239 if (--queue->nnodes > 0 && heap[queue->nnodes].val != node) { in PQueueDelete() 450 queue->nnodes--; in PQueueGetMax() 553 int i, j, nnodes; in CheckHeap() local 559 nnodes = queue->nnodes; in CheckHeap() 561 if (nnodes == 0) in CheckHeap() [all …]
|