Home
last modified time | relevance | path

Searched refs:commu (Results 1 – 25 of 52) sorted by relevance

123

/phasta/svLS/
H A DCOMMU.f41 SUBROUTINE svLS_COMMU_CREATE(commu, commi) argument
45 TYPE(svLS_commuType), INTENT(INOUT) :: commu local
51 IF (commu%foC) THEN
56 commu%foC = .TRUE.
57 commu%comm = commi
61 CALL MPI_COMM_RANK(comm, commu%task, ierr)
62 CALL MPI_COMM_SIZE(comm, commu%nTasks, ierr)
64 CALL MPI_ALLREDUCE(commu%task, commu%master, 1, mpint, MPI_MIN,
67 IF (commu%master .NE. 0) THEN
73 commu%masF = .FALSE.
[all …]
H A DCGRAD.f41 SUBROUTINE CGRAD(nFaces, dof, nNo, nnz, mynNo, commu, cS, face, argument
47 TYPE(svLS_commuType), INTENT(IN) :: commu local
48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
66 errO = NORMS(mynNo, commu, R)
81 CALL SPARMULSV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
86 CALL ADDBCMUL(BCOP_TYPE_PRE, nFaces, dof, nNo, mynNo, commu,
90 CALL SPARMULVS(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
93 CALL SPARMULSS( nNo, nnz, commu, cS, rowPtr, colPtr,
97 alpha = errO/DOTS(mynNo, commu, P, SP)
100 err = NORMS(mynNo, commu, R)
[all …]
H A DNORM.f41 FUNCTION NORMV(dof, nNo, commu, U)
46 TYPE(svLS_commuType), INTENT(IN) :: commu local
77 IF (commu%nTasks .NE. 1) THEN
79 2 commu%comm, ierr)
90 FUNCTION NORMS(nNo, commu, U)
95 TYPE(svLS_commuType), INTENT(IN) :: commu local
106 IF (commu%nTasks .NE. 1) THEN
108 2 commu%comm, ierr)
H A DDOT.f41 FUNCTION DOTV(dof, nNo, commu, U, V)
46 TYPE(svLS_commuType), INTENT(IN) :: commu local
77 IF (commu%nTasks .EQ. 1) RETURN
79 CALL MPI_ALLREDUCE(DOTV, tmp, 1, mpreal, MPI_SUM, commu%comm,
89 FUNCTION DOTS(nNo, commu, U, V)
94 TYPE(svLS_commuType), INTENT(IN) :: commu local
105 IF (commu%nTasks .EQ. 1) RETURN
107 CALL MPI_ALLREDUCE(DOTS, tmp, 1, mpreal, MPI_SUM, commu%comm,
H A DGMRES.f41 SUBROUTINE GMRES(nFaces, dof, nNo, nnz, mynNo, commu, cS, face, argument
47 TYPE(svLS_commuType), INTENT(IN) :: commu local
48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
73 CALL SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
76 CALL ADDBCMUL(BCOP_TYPE_ADD, nFaces, dof, nNo, mynNo, commu,
83 CALL ADDBCMUL(BCOP_TYPE_PRE, nFaces, dof, nNo, mynNo, commu,
87 err(1) = NORMV(dof, mynNo, commu, u(:,:,1))
103 CALL SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
106 CALL ADDBCMUL(BCOP_TYPE_ADD, nFaces, dof, nNo, mynNo, commu,
112 2 commu, face, unCondU, u(:,:,i+1))
[all …]
H A DNSSOLVER.f41 SUBROUTINE NSSOLVER(nFaces, gnNo, dof, nNo, nnz, mynNo, commu, argument
48 TYPE(svLS_commuType), INTENT(IN) :: commu local
49 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
76 eps = SQRT(NORMV(nsd, mynNo, commu, Rm)**2D0
77 2 + NORMS( mynNo, commu, Rc)**2D0)
95 CALL GMRES(nFaces, nsd, nNo, nnz, mynNo, commu, cS, face,
98 CALL SPARMULVS(nsd, nNo, nnz, commu, cS,
102 CALL CGRAD(nFaces, nsd, nNo, nnz, mynNo, commu, cS, face,
105 CALL SPARMULSV(nsd, nNo, nnz, commu, cS,
109 CALL GMRES(nFaces, nsd, nNo, nnz, mynNo, commu, cS, face,
[all …]
H A DINCOMMU.f41 SUBROUTINE COMMUV(dof, nNo, commu, cS, R) argument
46 TYPE(svLS_commuType), INTENT(IN) :: commu local
47 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
54 IF (commu%nTasks .EQ. 1) RETURN
56 nTasks = commu%nTasks
57 tF = commu%tF
58 comm = commu%comm
129 SUBROUTINE COMMUS(nNo, commu, cS, R) argument
134 TYPE(svLS_commuType), INTENT(IN) :: commu local
135 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
[all …]
H A DSPARMUL.f41 SUBROUTINE SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
47 TYPE(svLS_commuType), INTENT(IN) :: commu local
48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
110 CALL COMMUV(dof, nNo, commu, cS, KU)
117 SUBROUTINE SPARMULVS(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
123 TYPE(svLS_commuType), INTENT(IN) :: commu local
124 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
170 CALL COMMUS(nNo, commu, cS, KU)
177 SUBROUTINE SPARMULSV(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
183 TYPE(svLS_commuType), INTENT(IN) :: commu local
[all …]
H A Ddummy_prototypes.f41 SUBROUTINE svLS_COMMU_CREATE(commu, commi) argument
43 TYPE(svLS_commuType), INTENT(INOUT) :: commu local
47 SUBROUTINE svLS_COMMU_FREE(commu) argument
49 TYPE(svLS_commuType), INTENT(INOUT) :: commu local
52 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz, argument
56 TYPE(svLS_commuType), INTENT(IN) :: commu local
H A DSOLVE.f89 CALL COMMUV(dof, nNo, lhs%commu, lhs%cS, R)
90 CALL PRECOND(nFaces, dof, nNo, nnz, lhs%commu, lhs%cS,
96 2 lhs%commu, lhs%cS, lhs%face, ls, lhs%rowPtr, lhs%colPtr,
99 CALL GMRESV(nFaces, dof, nNo, nnz, lhs%mynNo, lhs%commu,
103 CALL CGRADS(nNo, nnz, lhs%mynNo, lhs%commu, lhs%cS,
106 CALL CGRADV(dof, nNo, nnz, lhs%mynNo, lhs%commu, lhs%cS,
H A DsvLS_API_c.h44 void svls_commu_create_(svLS_commuType *commu, int *commi);
45 void svls_commu_free_(svLS_commuType *commu);
47 void svls_lhs_create_c_(void **lhs, svLS_commuType *commu, int *gnNo, int *nNo, int *nnz, int *gNod…
H A DLHS.f41 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz, gNodes, argument
47 TYPE(svLS_commuType), INTENT(IN) :: commu local
68 lhs%commu = commu
71 nTasks = commu%nTasks
72 comm = commu%comm
73 tF = commu%tF
287 DO i=1, lhs%commu%nTasks
307 SUBROUTINE svLS_LHS_CREATE_C(pLHS, commu, gnNo, nNo, nnz, gNodes, argument
313 TYPE(svLS_commuType), INTENT(IN) :: commu local
320 CALL svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz, gNodes,
H A DADDBCMUL.f41 SUBROUTINE ADDBCMUL(op_Type, nFaces, dof, nNo, mynNo, commu, face, argument
47 TYPE(svLS_commuType), INTENT(IN) :: commu local
79 S = coef(faIn)*DOTV(dof, mynNo, commu, v, X)
H A DsvLS_API.h41 SUBROUTINE svLS_COMMU_CREATE(commu, commi)
43 TYPE(svLS_commuType), INTENT(INOUT) :: commu
46 SUBROUTINE svLS_COMMU_FREE(commu)
48 TYPE(svLS_commuType), INTENT(INOUT) :: commu
51 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz,
55 TYPE(svLS_commuType), INTENT(IN) :: commu
H A DBC.f90 IF (lhs%commu%nTasks .GT. 1) THEN
94 2 MPI_SUM, lhs%commu%comm, i)
103 CALL COMMUV(dof, lhs%nNo, lhs%commu, lhs%cS, v)
H A DPRECOND.f41 SUBROUTINE PRECOND(nFaces, dof, nNo, nnz, commu, cS, face, argument
47 TYPE(svLS_commuType), INTENT(IN) :: commu local
48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
91 CALL COMMUV(dof, nNo, commu, cS, W)
/phasta/phSolver/incompressible/
H A Dbflux.f205 call commu (flxres, ilwork, nflow, 'in ')
206 call commu (flxLHS, ilwork, 1 , 'in ')
207 call commu (flxnrm, ilwork, nsd , 'in ')
243 call commu (flxres, ilwork, nflow, 'in ')
244 call commu (flxLHS, ilwork, 1 , 'in ')
245 call commu (flxnrm, ilwork, nsd , 'in ')
274 call commu (flxres, ilwork, nflow, 'out')
275 call commu (flxLHS, ilwork, 1 , 'out')
276 call commu (flxnrm, ilwork, nsd , 'out')
307 call commu (flxres, ilwork, nflow, 'out')
[all …]
H A Ditrbc.f114 call commu (y, ilwork, nflow, 'out')
115 call commu (ac, ilwork, nflow, 'out')
182 call commu (T, ilwork, 1, 'out')
185 call commu (T, ilwork, 1, 'out')
H A DsolveGradV.f22 call commu (qres , ilwork, nsdsq , 'in ')
55 call commu (qres, ilwork, nsdsq, 'out')
H A Derrsmooth.f68 call commu (rerrsm , ilwork, 10 , 'in ')
69 call commu (rmass , ilwork, 1 , 'in ')
98 call commu (rerrsm, ilwork, 10, 'out')
/phasta/phSolver/common/
H A Dqpbc.f37 call commu (qres , ilwork, idflx , 'in ')
38 call commu (rmass , ilwork, 1 , 'in ')
90 call commu (qres, ilwork, idflx, 'out')
141 call commu (qres , ilwork, nsd , 'in ')
142 call commu (rmass , ilwork, 1 , 'in ')
173 call commu (qres, ilwork, nsd, 'out')
H A Dsolvecon.f82 call commu (v_lambda1 , ilwork, 1 , 'in ')
83 call commu (v_lambda2 , ilwork, 1 , 'in ')
84 call commu (hprime , ilwork, 1 , 'in ')
85 call commu (rmass , ilwork, 1 , 'in ')
122 call commu (v_lambda, ilwork, 1, 'out')
H A Derrorsmooth.f67 call commu (rerrsm , ilwork, 10 , 'in ')
68 call commu (rmass , ilwork, 1 , 'in ')
97 call commu (rerrsm, ilwork, 10, 'out')
/phasta/phSolver/compressible/
H A Dau1gmr.f30 call commu (uBrg, ilwork, nflow , 'out')
77 call commu (uBrg , ilwork, nflow , 'in ')
137 call commu (uBrg, ilwork, 1, 'out')
173 call commu (uBrg , ilwork, 1, 'in ')
H A Ditrbc.f183 call commu (y, ilwork, nflow, 'out')
184 if(ires.ne.2) call commu (ac, ilwork, nflow, 'out')
248 call commu (T, ilwork, 1, 'out')
251 call commu (T, ilwork, 1, 'out')

123