Home
last modified time | relevance | path

Searched refs:nTasks (Results 1 – 13 of 13) sorted by relevance

/phasta/svLS/
H A DINCOMMU.f47 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
50 INTEGER i, j, k, s, e, ierr, nTasks, tF, stat(MPI_STATUS_SIZE) local
54 IF (commu%nTasks .EQ. 1) RETURN
56 nTasks = commu%nTasks
66 DO i=1, nTasks
103 DO i=1, nTasks
118 DO i=1, nTasks
135 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
138 INTEGER i, j, k, s, e, ierr, nTasks, tF, stat(MPI_STATUS_SIZE) local
142 IF (commu%nTasks .EQ. 1) RETURN
[all …]
H A DLHS.f52 INTEGER i, j, k, a, Ac, ai, s, e, nTasks, tF, maxnNo, ierr, local
71 nTasks = commu%nTasks
76 2 lhs%map(nNo), lhs%cS(nTasks), lhs%face(nFaces))
78 IF (nTasks .EQ. 1) THEN
105 ALLOCATE(aNodes(maxnNo,nTasks), part(maxnNo), sCount(nTasks),
106 2 disp(nTasks), gtlPtr(gnNo), ltg(nNo))
111 DO i=1, nTasks
125 DO i=nTasks, 1, -1
146 DO i=1, nTasks
167 lhs%cS(i)%tag = nTasks*i + tF
[all …]
H A DNORM.f77 IF (commu%nTasks .NE. 1) THEN
106 IF (commu%nTasks .NE. 1) THEN
H A DDOT.f77 IF (commu%nTasks .EQ. 1) RETURN
105 IF (commu%nTasks .EQ. 1) RETURN
H A DsvLS_STRUCT_c.h61 int nTasks; // Total number of tasks (USE) member
H A DSPARMUL.f48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
124 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
184 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
248 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
H A DCOMMU.f62 CALL MPI_COMM_SIZE(comm, commu%nTasks, ierr)
H A DCGRAD.f48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
124 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
183 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
H A DBC.f90 IF (lhs%commu%nTasks .GT. 1) THEN
H A DGMRES.f48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
170 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
H A DNSSOLVER.f49 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
320 WRITE(fid,*) gnNo, commu%nTasks, i
H A DPRECOND.f48 TYPE(svLS_cSType), INTENT(IN) :: cS(commu%nTasks)
H A DsvLS_STRUCT.h60 INTEGER :: nTasks