OpenRadioss 2025.1.11
OpenRadioss project
Loading...
Searching...
No Matches
ssol_c.F File Reference

Go to the source code of this file.

Functions/Subroutines

subroutine smumps_sol_c (root, n, a, la, iw, liw, w, lwc, iwcb, liww, nrhs, na, lna, ne_steps, w2, mtype, icntl, from_pp, step, frere, dad, fils, ptrist, ptrfac, iw1, liw1, ptracb, liwk_ptracb, procnode_steps, slavef, info, keep, keep8, dkeep, comm_nodes, myid, myid_nodes, bufr, lbufr, lbufr_bytes, istep_to_iniv2, tab_pos_in_pere, ibeg_root_def, iend_root_def, iroot_def_rhs_col1, rhs_root, lrhs_root, size_root, master_root, rhscomp, lrhscomp, posinrhscomp_fwd, posinrhscomp_bwd, nz_rhs, nbcol_inbloc, nrhs_orig, jbeg_rhs, step2node, lstep2node, irhs_sparse, irhs_ptr, size_perm_rhs, perm_rhs, size_uns_perm_inv, uns_perm_inv, nb_fs_in_rhscomp_f, nb_fs_in_rhscomp_tot, do_nbsparse, rhs_bounds, lrhs_bounds, ipool_b_l0_omp, lpool_b_l0_omp, ipool_a_l0_omp, lpool_a_l0_omp, l_virt_l0_omp, virt_l0_omp, l_phys_l0_omp, phys_l0_omp, perm_l0_omp, ptr_leafs_l0_omp, l0_omp_mapping, ll0_omp_mapping, l0_omp_factors, ll0_omp_factors)
subroutine smumps_gather_solution (nslaves, n, myid, comm, nrhs, mtype, rhs, lrhs, ncol_rhs, jbeg_rhs, ptrist, keep, keep8, procnode_steps, iw, liw, step, buffer, size_buf, size_buf_bytes, cwork, lcwork, lscal, scaling, lscaling, rhscomp, lrhscomp, ncol_rhscomp, posinrhscomp, lpos_n, perm_rhs, size_perm_rhs)
subroutine smumps_npiv_block_add (on_master)
subroutine smumps_npiv_block_send ()
subroutine smumps_gather_solution_am1 (nslaves, n, myid, comm, nrhs, rhscomp, lrhscomp, nrhscomp_col, keep, buffer, size_buf, size_buf_bytes, lscal, scaling, lscaling, irhs_ptr_copy, lirhs_ptr_copy, irhs_sparse_copy, lirhs_sparse_copy, rhs_sparse_copy, lrhs_sparse_copy, uns_perm_inv, luns_perm_inv, posinrhscomp, lpos_row, nb_fs_in_rhscomp)
subroutine smumps_am1_block_add (scale_only)
subroutine smumps_am1_block_send ()
subroutine smumps_distsol_indices (mtype, isol_loc, ptrist, keep, keep8, iw, liw_passed, myid_nodes, n, step, procnode, nslaves, scaling_data, lscal, irhs_loc_meaningful, irhs_loc, nloc_rhs)
subroutine smumps_distributed_solution (slavef, n, myid_nodes, mtype, rhscomp, lrhscomp, nbrhs_eff, posinrhscomp, isol_loc, sol_loc, nrhs, beg_rhs, lsol_loc, ptrist, procnode_steps, keep, keep8, iw, liw, step, scaling_data, lscal, nb_rhsskipped, perm_rhs, size_perm_rhs)
subroutine smumps_scatter_rhs (nslaves, n, myid, comm, mtype, rhs, lrhs, ncol_rhs, nrhs, rhscomp, lrhscomp, ncol_rhscomp, posinrhscomp_fwd, nb_fs_in_rhscomp_f, ptrist, keep, keep8, procnode_steps, iw, liw, step, icntl, info)
subroutine smumps_get_buf_indx_rhs ()
subroutine smumps_build_posinrhscomp (nslaves, n, myid_nodes, ptrist, keep, keep8, procnode_steps, iw, liw, step, posinrhscomp_row, posinrhscomp_col, posinrhscomp_col_alloc, mtype, nbent_rhscomp, nb_fs_in_rhscomp)
subroutine smumps_build_posinrhscomp_am1 (nslaves, n, myid_nodes, ptrist, dad, keep, keep8, procnode_steps, iw, liw, step, posinrhscomp_row, posinrhscomp_col, posinrhscomp_col_alloc, mtype, irhs_ptr, nbcol_inbloc, irhs_sparse, nz_rhs, perm_rhs, size_perm_rhs, jbeg_rhs, nbent_rhscomp, nb_fs_in_rhscomp_fwd, nb_fs_in_rhscomp_tot, uns_perm_inv, size_uns_perm_inv)

Function/Subroutine Documentation

◆ smumps_am1_block_add()

subroutine smumps_gather_solution_am1::smumps_am1_block_add ( logical, intent(in) scale_only)
private

Definition at line 1602 of file ssol_c.F.

1603 LOGICAL, intent(in) :: SCALE_ONLY
1604 INTEGER III
1605 IF (scale_only) THEN
1606 iii = i
1607 IF (keep(23).NE.0) iii = uns_perm_inv(i)
1608 IF (lscal) THEN
1609 rhs_sparse_copy(iz)=rhs_sparse_copy(iz)*scaling(iii)
1610 ENDIF
1611 RETURN
1612 ENDIF
1613 CALL mpi_pack(j, 1, mpi_integer, buffer,
1614 & size_buf_bytes, pos_buf, comm, ierr )
1615 CALL mpi_pack(i, 1, mpi_integer, buffer,
1616 & size_buf_bytes, pos_buf, comm, ierr )
1617 CALL mpi_pack(rhs_sparse_copy(iz), 1, mpi_real,
1618 & buffer, size_buf_bytes, pos_buf, comm,
1619 & ierr)
1620 n2send=n2send+1
1621 IF ( pos_buf + record_size_p_1 > size_buf_bytes ) THEN
1622 CALL smumps_am1_block_send()
1623 END IF
1624 RETURN
mpi_pack
subroutine mpi_pack(inbuf, incnt, datatype, outbuf, outcnt, position, comm, ierr)
Definition mpi.f:428
smumps_am1_block_send
subroutine smumps_am1_block_send()
Definition ssol_c.F:1627

◆ smumps_am1_block_send()

subroutine smumps_gather_solution_am1::smumps_am1_block_send
private

Definition at line 1626 of file ssol_c.F.

1627 IF (n2send .NE. 0) THEN
1628 CALL mpi_pack(fin, 1, mpi_integer, buffer,
1629 & size_buf_bytes, pos_buf, comm, ierr )
1630 CALL mpi_send(buffer, pos_buf, mpi_packed, master,
1631 & gathersol, comm, ierr)
1632 ENDIF
1633 pos_buf=0
1634 n2send=0
1635 RETURN
mpi_send
subroutine mpi_send(buf, cnt, datatype, dest, tag, comm, ierr)
Definition mpi.f:480

◆ smumps_build_posinrhscomp()

subroutine smumps_build_posinrhscomp ( integer, intent(in) nslaves,
integer, intent(in) n,
integer, intent(in) myid_nodes,
integer, dimension(keep(28)), intent(in) ptrist,
integer, dimension(500), intent(in) keep,
integer(8), dimension(150), intent(in) keep8,
integer, dimension(keep(28)), intent(in) procnode_steps,
integer, dimension(liw), intent(in) iw,
integer, intent(in) liw,
integer, dimension(n), intent(in) step,
integer, dimension(n), intent(out) posinrhscomp_row,
integer, dimension(n), intent(out) posinrhscomp_col,
logical, intent(in) posinrhscomp_col_alloc,
integer, intent(in) mtype,
integer, intent(out) nbent_rhscomp,
integer, intent(out) nb_fs_in_rhscomp )

Definition at line 2059 of file ssol_c.F.

2067 IMPLICIT NONE
2068 include 'mpif.h'
2069 include 'mumps_tags.h'
2070 INTEGER, intent(in) :: NSLAVES, N, MYID_NODES, LIW
2071 INTEGER, intent(in) :: KEEP(500)
2072 INTEGER(8), intent(in) :: KEEP8(150)
2073 INTEGER, intent(in) :: PTRIST(KEEP(28)), PROCNODE_STEPS(KEEP(28))
2074 INTEGER, intent(in) :: IW(LIW), STEP(N)
2075 INTEGER, intent(in) :: MTYPE
2076 LOGICAL, intent(in) :: POSINRHSCOMP_COL_ALLOC
2077 INTEGER, intent(out):: POSINRHSCOMP_ROW(N),POSINRHSCOMP_COL(N)
2078 INTEGER, intent(out):: NBENT_RHSCOMP, NB_FS_IN_RHSCOMP
2079 INTEGER ISTEP
2080 INTEGER NPIV
2081 INTEGER IPOS, LIELL
2082 INTEGER JJ, J1, JCOL
2083 INTEGER IPOSINRHSCOMP, IPOSINRHSCOMP_COL
2084 include 'mumps_headers.h'
2085 INTEGER MUMPS_PROCNODE
2086 EXTERNAL mumps_procnode
2087 posinrhscomp_row = 0
2088 IF (posinrhscomp_col_alloc) posinrhscomp_col = 0
2089 iposinrhscomp = 1
2090 DO istep = 1, keep(28)
2091 IF (myid_nodes == mumps_procnode(procnode_steps(istep),
2092 & keep(199))) THEN
2093 CALL mumps_sol_get_npiv_liell_ipos( istep, keep, npiv, liell,
2094 & ipos, iw, liw, ptrist, step, n )
2095 IF (mtype.eq.1 .OR. keep(50).NE.0) THEN
2096 j1=ipos+1
2097 ELSE
2098 j1=ipos+1+liell
2099 END IF
2100 IF ( mtype .EQ. 1 .AND. keep(50).EQ.0 ) THEN
2101 jcol = ipos+1+liell
2102 ELSE
2103 jcol = ipos+1
2104 ENDIF
2105 DO jj = j1, j1+npiv-1
2106 posinrhscomp_row(iw(jj)) = iposinrhscomp+jj-j1
2107 ENDDO
2108 IF (posinrhscomp_col_alloc) THEN
2109 DO jj = jcol, jcol+npiv-1
2110 posinrhscomp_col(iw(jj)) = iposinrhscomp+jj-jcol
2111 ENDDO
2112 ENDIF
2113 iposinrhscomp = iposinrhscomp + npiv
2114 ENDIF
2115 ENDDO
2116 nb_fs_in_rhscomp = iposinrhscomp -1
2117 IF (posinrhscomp_col_alloc) iposinrhscomp_col=iposinrhscomp
2118 IF (iposinrhscomp.GT.n) GOTO 500
2119 DO istep = 1, keep(28)
2120 IF (myid_nodes == mumps_procnode(procnode_steps(istep),
2121 & keep(199))) THEN
2122 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
2123 & npiv, liell, ipos, iw, liw, ptrist, step, n )
2124 IF (mtype.eq.1 .OR. keep(50).NE.0) THEN
2125 j1=ipos+1
2126 ELSE
2127 j1=ipos+1+liell
2128 END IF
2129 IF ( mtype .EQ. 1 .AND. keep(50).EQ.0 ) THEN
2130 jcol = ipos+1+liell
2131 ELSE
2132 jcol = ipos+1
2133 ENDIF
2134 IF (posinrhscomp_col_alloc) THEN
2135 DO jj = npiv, liell-1-keep(253)
2136 IF (posinrhscomp_row(iw(j1+jj)).EQ.0) THEN
2137 posinrhscomp_row(iw(j1+jj)) = - iposinrhscomp
2138 iposinrhscomp = iposinrhscomp + 1
2139 ENDIF
2140 IF (posinrhscomp_col(iw(jcol+jj)).EQ.0) THEN
2141 posinrhscomp_col(iw(jcol+jj)) = - iposinrhscomp_col
2142 iposinrhscomp_col = iposinrhscomp_col + 1
2143 ENDIF
2144 ENDDO
2145 ELSE
2146 DO jj = j1+npiv, j1+liell-1-keep(253)
2147 IF (posinrhscomp_row(iw(jj)).EQ.0) THEN
2148 posinrhscomp_row(iw(jj)) = - iposinrhscomp
2149 iposinrhscomp = iposinrhscomp + 1
2150 ENDIF
2151 ENDDO
2152 ENDIF
2153 ENDIF
2154 ENDDO
2155 500 nbent_rhscomp = iposinrhscomp - 1
2156 IF (posinrhscomp_col_alloc)
2157 & nbent_rhscomp = max(nbent_rhscomp, iposinrhscomp_col-1)
2158 RETURN
max
#define max(a, b)
Definition macros.h:21
mumps_sol_get_npiv_liell_ipos
subroutine mumps_sol_get_npiv_liell_ipos(istep, keep, npiv, liell, ipos, iw, liw, ptrist, step, n)
Definition sol_common.F:16
mumps_procnode
integer function mumps_procnode(procinfo_inode, k199)
Definition tools_common.F:151

◆ smumps_build_posinrhscomp_am1()

subroutine smumps_build_posinrhscomp_am1 ( integer, intent(in) nslaves,
integer, intent(in) n,
integer, intent(in) myid_nodes,
integer, dimension(keep(28)), intent(in) ptrist,
integer, dimension(keep(28)), intent(inout) dad,
integer, dimension(500), intent(in) keep,
integer(8), dimension(150), intent(in) keep8,
integer, dimension(keep(28)), intent(in) procnode_steps,
integer, dimension(liw), intent(in) iw,
integer, intent(in) liw,
integer, dimension(n), intent(in) step,
integer, dimension(n), intent(out) posinrhscomp_row,
integer, dimension(n), intent(out) posinrhscomp_col,
logical, intent(in) posinrhscomp_col_alloc,
integer, intent(in) mtype,
integer, dimension(nbcol_inbloc+1), intent(in) irhs_ptr,
integer, intent(in) nbcol_inbloc,
integer, dimension(nz_rhs), intent(in) irhs_sparse,
integer, intent(in) nz_rhs,
integer, dimension(size_perm_rhs), intent(in) perm_rhs,
integer, intent(in) size_perm_rhs,
integer, intent(in) jbeg_rhs,
integer, intent(out) nbent_rhscomp,
integer, intent(out) nb_fs_in_rhscomp_fwd,
integer, intent(out) nb_fs_in_rhscomp_tot,
integer, dimension(size_uns_perm_inv), intent(in) uns_perm_inv,
integer, intent(in) size_uns_perm_inv )

Definition at line 2160 of file ssol_c.F.

2173 IMPLICIT NONE
2174 include 'mpif.h'
2175 include 'mumps_tags.h'
2176 INTEGER, intent(in) :: NSLAVES, N, MYID_NODES, LIW,
2177 & SIZE_UNS_PERM_INV
2178 INTEGER, intent(in) :: KEEP(500)
2179 INTEGER(8), intent(in) :: KEEP8(150)
2180 INTEGER, intent(in) :: PTRIST(KEEP(28)), PROCNODE_STEPS(KEEP(28))
2181 INTEGER, intent(inout) :: DAD(KEEP(28))
2182 INTEGER, intent(in) :: IW(LIW), STEP(N)
2183 INTEGER, intent(in) :: NBCOL_INBLOC, IRHS_PTR(NBCOL_INBLOC+1)
2184 INTEGER, intent(in) :: NZ_RHS, IRHS_SPARSE(NZ_RHS)
2185 INTEGER, intent(in) :: SIZE_PERM_RHS, PERM_RHS(SIZE_PERM_RHS)
2186 INTEGER, intent(in) :: JBEG_RHS
2187 INTEGER, intent(in) :: MTYPE
2188 LOGICAL, intent(in) :: POSINRHSCOMP_COL_ALLOC
2189 INTEGER, intent(out):: POSINRHSCOMP_ROW(N),POSINRHSCOMP_COL(N)
2190 INTEGER, intent(out):: NBENT_RHSCOMP
2191 INTEGER, intent(out):: NB_FS_IN_RHSCOMP_FWD, NB_FS_IN_RHSCOMP_TOT
2192 INTEGER, intent(in) :: UNS_PERM_INV(SIZE_UNS_PERM_INV)
2193 INTEGER I, JAM1
2194 INTEGER ISTEP, OLDISTEP
2195 INTEGER NPIV
2196 INTEGER IPOS, LIELL
2197 INTEGER JJ, J1, JCOL, ABSJCOL
2198 INTEGER IPOSINRHSCOMP_ROW, IPOSINRHSCOMP_COL
2199 INTEGER NBENT_RHSCOMP_ROW, NBENT_RHSCOMP_COL
2200 LOGICAL GO_UP
2201 include 'mumps_headers.h'
2202 INTEGER MUMPS_PROCNODE
2203 EXTERNAL mumps_procnode
2204 IF(keep(237).EQ.0) THEN
2205 WRITE(*,*)'BUILD_POSINRHSCOMP_SPARSE available for A-1 only !'
2206 CALL mumps_abort()
2207 END IF
2208 posinrhscomp_row = 0
2209 IF (posinrhscomp_col_alloc) posinrhscomp_col = 0
2210 iposinrhscomp_row = 0
2211 iposinrhscomp_col = 0
2212 DO i = 1, nbcol_inbloc
2213 IF ((irhs_ptr(i+1)-irhs_ptr(i)).EQ.0) cycle
2214 IF (keep(242).NE.0) THEN
2215 jam1 = perm_rhs(jbeg_rhs+i-1)
2216 ELSE
2217 jam1 = jbeg_rhs+i-1
2218 END IF
2219 istep = abs(step(jam1))
2220 go_up = .true.
2221 DO WHILE(go_up)
2222 IF(myid_nodes.EQ.
2223 & mumps_procnode(procnode_steps(istep),keep(199))) THEN
2224 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
2225 & npiv, liell, ipos, iw, liw, ptrist, step, n )
2226 IF (mtype.eq.1 .OR. keep(50).NE.0) THEN
2227 j1=ipos+1
2228 ELSE
2229 j1=ipos+1+liell
2230 END IF
2231 IF ( mtype .EQ. 1 .AND. keep(50).EQ.0 ) THEN
2232 jcol = ipos+1+liell
2233 ELSE
2234 jcol = ipos+1
2235 ENDIF
2236 IF(npiv.GT.0) THEN
2237 IF(posinrhscomp_row(iw(j1)).EQ.0) THEN
2238 DO jj = j1, j1+npiv-1
2239 posinrhscomp_row(iw(jj))
2240 & = iposinrhscomp_row + jj - j1 + 1
2241 ENDDO
2242 iposinrhscomp_row = iposinrhscomp_row + npiv
2243 IF (posinrhscomp_col_alloc) THEN
2244 DO jj = jcol, jcol+npiv-1
2245 posinrhscomp_col(iw(jj))
2246 & = - n - (iposinrhscomp_col + jj - jcol + 1)
2247 ENDDO
2248 iposinrhscomp_col = iposinrhscomp_col + npiv
2249 ENDIF
2250 ELSE
2251 go_up = .false.
2252 END IF
2253 END IF
2254 END IF
2255 IF(dad(istep).NE.0) THEN
2256 istep = step(dad(istep))
2257 ELSE
2258 go_up = .false.
2259 END IF
2260 END DO
2261 END DO
2262 nb_fs_in_rhscomp_fwd = iposinrhscomp_row
2263 IF(posinrhscomp_col_alloc) THEN
2264 DO i =1, nz_rhs
2265 jam1 = irhs_sparse(i)
2266 IF (keep(23).NE.0) jam1 = uns_perm_inv(jam1)
2267 istep = abs(step(jam1))
2268 go_up = .true.
2269 DO WHILE(go_up)
2270 IF(myid_nodes.EQ.
2271 & mumps_procnode(procnode_steps(istep),keep(199))) THEN
2272 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
2273 & npiv, liell, ipos, iw, liw, ptrist, step, n )
2274 IF (mtype.eq.1 .OR. keep(50).NE.0) THEN
2275 j1=ipos+1
2276 ELSE
2277 j1=ipos+1+liell
2278 END IF
2279 IF ( mtype .EQ. 1 .AND. keep(50).EQ.0 ) THEN
2280 jcol = ipos+1+liell
2281 ELSE
2282 jcol = ipos+1
2283 ENDIF
2284 absjcol = abs(iw(jcol))
2285 IF(npiv.GT.0) THEN
2286 IF(posinrhscomp_col(absjcol).EQ.0) THEN
2287 DO jj = jcol, jcol+npiv-1
2288 posinrhscomp_col(abs(iw(jj))) =
2289 & iposinrhscomp_col+jj-jcol+1
2290 END DO
2291 iposinrhscomp_col = iposinrhscomp_col + npiv
2292 ELSE IF (posinrhscomp_col(absjcol).LT.-n) THEN
2293 DO jj = jcol, jcol+npiv-1
2294 posinrhscomp_col(abs(iw(jj)))=
2295 & -(n+posinrhscomp_col(abs(iw(jj))))
2296 END DO
2297 ELSE IF ((posinrhscomp_col(absjcol).LT.0).AND.
2298 & (posinrhscomp_col(absjcol).GE.-n))THEN
2299 WRITE(*,*)'Internal error 7 in BUILD...SPARSE'
2300 CALL mumps_abort()
2301 ELSE
2302 go_up = .false.
2303 END IF
2304 END IF
2305 END IF
2306 IF(dad(istep).NE.0) THEN
2307 istep = step(dad(istep))
2308 ELSE
2309 go_up = .false.
2310 END IF
2311 END DO
2312 END DO
2313 END IF
2314 nb_fs_in_rhscomp_tot = iposinrhscomp_col
2315 IF (nslaves.NE.1) THEN
2316 DO i = 1, nbcol_inbloc
2317 IF ((irhs_ptr(i+1)-irhs_ptr(i)).EQ.0) cycle
2318 IF (keep(242).NE.0) THEN
2319 jam1 = perm_rhs(jbeg_rhs+i-1)
2320 ELSE
2321 jam1 = jbeg_rhs+i-1
2322 END IF
2323 istep = abs(step(jam1))
2324 go_up = .true.
2325 DO WHILE(go_up)
2326 IF(myid_nodes.EQ.
2327 & mumps_procnode(procnode_steps(istep),keep(199))) THEN
2328 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
2329 & npiv, liell, ipos, iw, liw, ptrist, step, n )
2330 IF (mtype.eq.1 .OR. keep(50).NE.0) THEN
2331 j1=ipos+1
2332 ELSE
2333 j1=ipos+1+liell
2334 END IF
2335 IF ( mtype .EQ. 1 .AND. keep(50).EQ.0 ) THEN
2336 jcol = ipos+1+liell
2337 ELSE
2338 jcol = ipos+1
2339 ENDIF
2340 DO jj = npiv, liell-1-keep(253)
2341 IF(posinrhscomp_row(iw(j1+jj)).EQ.0) THEN
2342 iposinrhscomp_row = iposinrhscomp_row + 1
2343 posinrhscomp_row(iw(jj+j1))
2344 & = -iposinrhscomp_row
2345 END IF
2346 END DO
2347 END IF
2348 IF(dad(istep).GT.0) THEN
2349 oldistep=istep
2350 istep = step(dad(istep))
2351 dad(oldistep)=-dad(oldistep)
2352 ELSE
2353 go_up = .false.
2354 END IF
2355 END DO
2356 END DO
2357 dad=abs(dad)
2358 IF(posinrhscomp_col_alloc) THEN
2359 DO i =1, nz_rhs
2360 jam1 = irhs_sparse(i)
2361 IF (keep(23).NE.0) jam1 = uns_perm_inv(jam1)
2362 istep = abs(step(jam1))
2363 go_up = .true.
2364 DO WHILE(go_up)
2365 IF(myid_nodes.EQ.
2366 & mumps_procnode(procnode_steps(istep),keep(199))) THEN
2367 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
2368 & npiv, liell, ipos, iw, liw, ptrist, step, n )
2369 IF (mtype.eq.1 .OR. keep(50).NE.0) THEN
2370 j1=ipos+1
2371 ELSE
2372 j1=ipos+1+liell
2373 END IF
2374 IF ( mtype .EQ. 1 .AND. keep(50).EQ.0 ) THEN
2375 jcol = ipos+1+liell
2376 ELSE
2377 jcol = ipos+1
2378 ENDIF
2379 IF (keep(23).NE.0) jam1 = uns_perm_inv(jam1)
2380 DO jj = npiv, liell-1-keep(253)
2381 IF(posinrhscomp_col(iw(jcol+jj)).EQ.0) THEN
2382 iposinrhscomp_col = iposinrhscomp_col + 1
2383 posinrhscomp_col(iw(jcol+jj))
2384 & = -iposinrhscomp_col
2385 ELSE IF (posinrhscomp_col(iw(jcol+jj)).LT.-n) THEN
2386 iposinrhscomp_col = iposinrhscomp_col + 1
2387 posinrhscomp_col(iw(jcol+jj))
2388 & = posinrhscomp_col(iw(jcol+jj)) + n
2389 END IF
2390 END DO
2391 END IF
2392 IF(dad(istep).GT.0) THEN
2393 oldistep=istep
2394 istep = step(dad(istep))
2395 dad(oldistep)=-dad(oldistep)
2396 ELSE
2397 go_up = .false.
2398 END IF
2399 END DO
2400 END DO
2401 dad=abs(dad)
2402 END IF
2403 ENDIF
2404 nbent_rhscomp_row = iposinrhscomp_row
2405 nbent_rhscomp_col = iposinrhscomp_col
2406 nbent_rhscomp = max(nbent_rhscomp_row,nbent_rhscomp_col)
2407 RETURN
mumps_abort
#define mumps_abort
Definition VE_Metis.h:25

◆ smumps_distributed_solution()

subroutine smumps_distributed_solution ( integer slavef,
integer n,
integer myid_nodes,
integer mtype,
real, dimension( lrhscomp, nbrhs_eff ) rhscomp,
integer lrhscomp,
integer nbrhs_eff,
integer, dimension(n) posinrhscomp,
integer, dimension(lsol_loc) isol_loc,
real, dimension( lsol_loc, nrhs ) sol_loc,
integer, intent(in) nrhs,
integer beg_rhs,
integer lsol_loc,
integer, dimension(keep(28)) ptrist,
integer, dimension(keep(28)) procnode_steps,
integer, dimension(500) keep,
integer(8), dimension(150) keep8,
integer, dimension(liw) iw,
integer liw,
integer, dimension(n) step,
type (scaling_data_t) scaling_data,
logical lscal,
integer nb_rhsskipped,
integer, dimension( size_perm_rhs ), intent(in) perm_rhs,
integer, intent(in) size_perm_rhs )

Definition at line 1709 of file ssol_c.F.

1719 IMPLICIT NONE
1720 include 'mpif.h'
1721 include 'mumps_tags.h'
1722 type scaling_data_t
1723 sequence
1724 REAL, dimension(:), pointer :: SCALING
1725 REAL, dimension(:), pointer :: SCALING_LOC
1726 end type scaling_data_t
1727 TYPE (scaling_data_t) :: scaling_data
1728 LOGICAL LSCAL
1729 INTEGER SLAVEF, N, MYID_NODES, LIW, MTYPE, NBRHS_EFF, LRHSCOMP
1730 INTEGER POSINRHSCOMP(N), NB_RHSSKIPPED
1731 INTEGER LSOL_LOC, BEG_RHS
1732 INTEGER ISOL_LOC(LSOL_LOC)
1733 INTEGER, INTENT(in) :: NRHS
1734 REAL SOL_LOC( LSOL_LOC, NRHS )
1735 REAL RHSCOMP( LRHSCOMP, NBRHS_EFF )
1736 INTEGER KEEP(500)
1737 INTEGER(8) KEEP8(150)
1738 INTEGER PTRIST(KEEP(28)), PROCNODE_STEPS(KEEP(28))
1739 INTEGER IW(LIW), STEP(N)
1740 INTEGER, INTENT(in) :: SIZE_PERM_RHS
1741 INTEGER, INTENT(in) :: PERM_RHS( SIZE_PERM_RHS )
1742 INTEGER :: JJ, J1, ISTEP, K, KLOC, IPOSINRHSCOMP, JEMPTY
1743 INTEGER :: JCOL, JCOL_PERM
1744 INTEGER :: IPOS, LIELL, NPIV, JEND
1745 LOGICAL :: ROOT
1746!$ LOGICAL :: OMP_FLAG
1747 REAL, PARAMETER :: ZERO = 0.0e0
1748 include 'mumps_headers.h'
1749 INTEGER MUMPS_PROCNODE
1750 EXTERNAL mumps_procnode
1751 k=0
1752 jempty = beg_rhs+nb_rhsskipped-1
1753 jend = beg_rhs+nb_rhsskipped+nbrhs_eff-1
1754 DO istep = 1, keep(28)
1755 IF (myid_nodes == mumps_procnode(procnode_steps(istep),
1756 & keep(199))) THEN
1757 root=.false.
1758 IF (keep(38).ne.0) root = step(keep(38))==istep
1759 IF (keep(20).ne.0) root = step(keep(20))==istep
1760 IF ( root ) THEN
1761 ipos = ptrist(istep) + keep(ixsz)
1762 liell = iw(ipos+3)
1763 npiv = liell
1764 ipos= ptrist(istep)+5+keep(ixsz)
1765 ELSE
1766 ipos = ptrist(istep) + 2 +keep(ixsz)
1767 liell = iw(ipos-2)+iw(ipos+1)
1768 ipos= ipos+1
1769 npiv = iw(ipos)
1770 ipos= ipos+1
1771 ipos= ipos+1+iw( ptrist(istep) + 5 +keep(ixsz))
1772 END IF
1773 IF (mtype.eq.1 .AND. keep(50).EQ.0) THEN
1774 j1=ipos+1+liell
1775 ELSE
1776 j1=ipos+1
1777 END IF
1778 IF (nb_rhsskipped.GT.0) THEN
1779 DO jcol = beg_rhs, jempty
1780 IF (keep(242) .NE. 0) THEN
1781 jcol_perm = perm_rhs(jcol)
1782 ELSE
1783 jcol_perm = jcol
1784 ENDIF
1785 kloc=k
1786 DO jj=j1,j1+npiv-1
1787 kloc=kloc+1
1788 sol_loc(kloc, jcol_perm) = zero
1789 ENDDO
1790 ENDDO
1791 ENDIF
1792!$ OMP_FLAG = ( JEND-JEMPTY.GE.KEEP(362) .AND.
1793!$ & (NPIV*(JEND-JEMPTY) .GE. KEEP(363)/2 ) )
1794!$OMP PARALLEL DO PRIVATE(JCOL,JCOL_PERM,KLOC,JJ,IPOSINRHSCOMP)
1795!$OMP& IF(OMP_FLAG)
1796 DO jcol = jempty+1, jend
1797 IF (keep(242) .NE. 0) THEN
1798 jcol_perm = perm_rhs(jcol)
1799 ELSE
1800 jcol_perm = jcol
1801 ENDIF
1802 DO jj=j1,j1+npiv-1
1803 kloc=k + jj-j1 + 1
1804 iposinrhscomp = posinrhscomp(iw(jj))
1805 IF (lscal) THEN
1806 sol_loc(kloc,jcol_perm) =
1807 & scaling_data%SCALING_LOC(kloc)*
1808 & rhscomp(iposinrhscomp,jcol-jempty)
1809 ELSE
1810 sol_loc(kloc,jcol_perm) =
1811 & rhscomp(iposinrhscomp,jcol-jempty)
1812 ENDIF
1813 ENDDO
1814 ENDDO
1815!$OMP END PARALLEL DO
1816 k=k+npiv
1817 ENDIF
1818 ENDDO
1819 RETURN

◆ smumps_distsol_indices()

subroutine smumps_distsol_indices ( integer mtype,
integer, dimension(keep(89)) isol_loc,
integer, dimension(keep(28)) ptrist,
integer, dimension(500) keep,
integer(8), dimension(150) keep8,
integer, dimension(liw_passed) iw,
integer liw_passed,
integer myid_nodes,
integer n,
integer, dimension(n) step,
integer, dimension(keep(28)) procnode,
integer nslaves,
type (scaling_data_t) scaling_data,
logical lscal,
logical irhs_loc_meaningful,
integer, dimension(nloc_rhs) irhs_loc,
integer nloc_rhs )

Definition at line 1638 of file ssol_c.F.

1644 IMPLICIT NONE
1645 INTEGER MTYPE, MYID_NODES, N, NSLAVES
1646 INTEGER KEEP(500)
1647 INTEGER(8) KEEP8(150)
1648 INTEGER PTRIST(KEEP(28)), PROCNODE(KEEP(28))
1649 INTEGER ISOL_LOC(KEEP(89))
1650 INTEGER LIW_PASSED
1651 INTEGER IW(LIW_PASSED)
1652 INTEGER STEP(N)
1653 LOGICAL LSCAL
1654 LOGICAL :: IRHS_loc_MEANINGFUL
1655 INTEGER :: Nloc_RHS
1656 INTEGER :: IRHS_loc(Nloc_RHS)
1657 type scaling_data_t
1658 sequence
1659 REAL, dimension(:), pointer :: SCALING
1660 REAL, dimension(:), pointer :: SCALING_LOC
1661 end type scaling_data_t
1662 type (scaling_data_t) :: scaling_data
1663 INTEGER MUMPS_PROCNODE
1664 EXTERNAL mumps_procnode
1665 INTEGER ISTEP, K
1666 INTEGER J1, IPOS, LIELL, NPIV, JJ
1667 LOGICAL :: CHECK_IRHS_loc
1668 INTEGER(8) :: DIFF_ADDR
1669 include 'mumps_headers.h'
1670 check_irhs_loc=.false.
1671 IF ( irhs_loc_meaningful ) THEN
1672 IF (nloc_rhs .GT. 0) THEN
1673 CALL mumps_size_c( irhs_loc(1), isol_loc(1),
1674 & diff_addr )
1675 IF (diff_addr .EQ. 0_8) THEN
1676 check_irhs_loc=.true.
1677 ENDIF
1678 ENDIF
1679 ENDIF
1680 k=0
1681 DO istep=1, keep(28)
1682 IF ( myid_nodes == mumps_procnode( procnode(istep),
1683 & keep(199))) THEN
1684 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
1685 & npiv, liell, ipos, iw, liw_passed, ptrist, step, n)
1686 IF (mtype.eq.1 .AND. keep(50).EQ.0) THEN
1687 j1=ipos+1+liell
1688 ELSE
1689 j1=ipos+1
1690 END IF
1691 DO jj=j1,j1+npiv-1
1692 k=k+1
1693 IF (check_irhs_loc) THEN
1694 IF (k.LE.nloc_rhs) THEN
1695 IF ( iw(jj) .NE.irhs_loc(k) ) THEN
1696 ENDIF
1697 ENDIF
1698 ENDIF
1699 isol_loc(k)=iw(jj)
1700 IF (lscal) THEN
1701 scaling_data%SCALING_LOC(k)=
1702 & scaling_data%SCALING(iw(jj))
1703 ENDIF
1704 ENDDO
1705 ENDIF
1706 ENDDO
1707 RETURN

◆ smumps_gather_solution()

subroutine smumps_gather_solution ( integer nslaves,
integer n,
integer myid,
integer comm,
integer nrhs,
integer mtype,
real, dimension (lrhs, ncol_rhs) rhs,
integer lrhs,
integer ncol_rhs,
integer, intent(in) jbeg_rhs,
integer, dimension(keep(28)) ptrist,
integer, dimension(500) keep,
integer(8), dimension(150) keep8,
integer, dimension(keep(28)) procnode_steps,
integer, dimension(liw) iw,
integer liw,
integer, dimension(n) step,
integer, dimension(size_buf) buffer,
integer size_buf,
integer size_buf_bytes,
real, dimension(lcwork) cwork,
integer lcwork,
logical, intent(in) lscal,
real, dimension(lscaling), intent(in) scaling,
integer, intent(in) lscaling,
real, dimension(lrhscomp, ncol_rhscomp), intent(in) rhscomp,
integer lrhscomp,
integer ncol_rhscomp,
integer, dimension(lpos_n) posinrhscomp,
integer lpos_n,
integer, dimension(size_perm_rhs), intent(in) perm_rhs,
integer, intent(in) size_perm_rhs )

Definition at line 1075 of file ssol_c.F.

1083!$ USE OMP_LIB
1084 IMPLICIT NONE
1085 include 'mpif.h'
1086 include 'mumps_tags.h'
1087 INTEGER NSLAVES, N, MYID, COMM, LIW, MTYPE, NCOL_RHS
1088 INTEGER NRHS, LRHS, LCWORK, LPOS_N, NCOL_RHSCOMP
1089 REAL RHS (LRHS, NCOL_RHS)
1090 INTEGER, INTENT(in) :: JBEG_RHS
1091 INTEGER KEEP(500)
1092 INTEGER(8) KEEP8(150)
1093 REAL :: CWORK(LCWORK)
1094 INTEGER PTRIST(KEEP(28)), PROCNODE_STEPS(KEEP(28))
1095 INTEGER IW(LIW), STEP(N)
1096 INTEGER SIZE_BUF, SIZE_BUF_BYTES
1097 INTEGER BUFFER(SIZE_BUF)
1098 INTEGER LRHSCOMP, POSINRHSCOMP(LPOS_N)
1099 REAL, intent(in) :: RHSCOMP(LRHSCOMP, NCOL_RHSCOMP)
1100 LOGICAL, intent(in) :: LSCAL
1101 INTEGER, intent(in) :: LSCALING
1102 REAL, intent(in) :: SCALING(LSCALING)
1103 INTEGER, INTENT(in) :: SIZE_PERM_RHS
1104 INTEGER, INTENT(in) :: PERM_RHS(SIZE_PERM_RHS)
1105 INTEGER I, II, J, J1, ISTEP, MASTER,
1106 & MYID_NODES, TYPE_PARAL, N2RECV
1107 INTEGER LIELL, IPOS, NPIV, MAXNPIV_estim, MAXSurf
1108 INTEGER :: STATUS(MPI_STATUS_SIZE)
1109 INTEGER :: IERR, allocok
1110 parameter(master=0)
1111 LOGICAL I_AM_SLAVE
1112 INTEGER RECORD_SIZE_P_1, SIZE1, SIZE2
1113 INTEGER POS_BUF, N2SEND, IPOSINRHSCOMP
1114 INTEGER :: JCOL_RHS
1115 INTEGER :: K242
1116 LOGICAL :: OMP_FLAG
1117!$ INTEGER :: CHUNK, NOMP
1118 INTEGER, PARAMETER :: FIN = -1
1119 REAL ZERO
1120 parameter( zero = 0.0e0 )
1121 INTEGER, ALLOCATABLE, DIMENSION(:) :: IROWlist
1122 include 'mumps_headers.h'
1123 INTEGER, EXTERNAL :: MUMPS_PROCNODE
1124 type_paral = keep(46)
1125 i_am_slave = myid .ne. master .OR. type_paral .eq. 1
1126 IF ( type_paral == 1 ) THEN
1127 myid_nodes = myid
1128 ELSE
1129 myid_nodes = myid-1
1130 ENDIF
1131 IF (nslaves.EQ.1 .AND. type_paral.EQ.1) THEN
1132 IF (lscal) THEN
1133 omp_flag = .false.
1134 IF (keep(350).EQ.2) THEN
1135 k242 = keep(242)
1136!$ NOMP = OMP_GET_MAX_THREADS()
1137!$ CHUNK = max(N/2,1)
1138!$ IF (int(nrhs,8) * int(n,8) .GE. int(keep(363),8)) THEN
1139!$ OMP_FLAG = .TRUE.
1140!$ CHUNK=int((int(N,8)*int(NRHS,8)+int(NOMP-1,8))/int(NOMP,8))
1141!$ CHUNK = min(CHUNK,(N+KEEP(362)-1)/KEEP(362))
1142!$ CHUNK = max(KEEP(363)/2,CHUNK)
1143!$ ENDIF
1144 ENDIF
1145 IF (omp_flag) THEN
1146!$OMP PARALLEL FIRSTPRIVATE(JBEG_RHS,N,K242)
1147!$OMP& PRIVATE(J,IPOSINRHSCOMP,I,JCOL_RHS)
1148 DO j=1, nrhs
1149 IF (k242.EQ.0) THEN
1150 jcol_rhs = j+jbeg_rhs-1
1151 ELSE
1152 jcol_rhs = perm_rhs(j+jbeg_rhs-1)
1153 ENDIF
1154!$OMP DO SCHEDULE(DYNAMIC,CHUNK)
1155 DO i=1, n
1156 iposinrhscomp = posinrhscomp(i)
1157 IF (iposinrhscomp.GT.0) THEN
1158 rhs(i,jcol_rhs) =
1159 & rhscomp(iposinrhscomp,j)*scaling(i)
1160 ELSE
1161 rhs(i,jcol_rhs) = zero
1162 ENDIF
1163 ENDDO
1164!$OMP END DO NOWAIT
1165 ENDDO
1166!$OMP END PARALLEL
1167 ELSE
1168 DO j=1, nrhs
1169 IF (keep(242).EQ.0) THEN
1170 jcol_rhs = j+jbeg_rhs-1
1171 ELSE
1172 jcol_rhs = perm_rhs(j+jbeg_rhs-1)
1173 ENDIF
1174 DO i=1, n
1175 iposinrhscomp = posinrhscomp(i)
1176 IF (iposinrhscomp.GT.0) THEN
1177 rhs(i,jcol_rhs) =
1178 & rhscomp(iposinrhscomp,j)*scaling(i)
1179 ELSE
1180 rhs(i,jcol_rhs) = zero
1181 ENDIF
1182 ENDDO
1183 ENDDO
1184 ENDIF
1185 ELSE
1186 omp_flag = .false.
1187 IF (keep(350).EQ.2) THEN
1188 k242 = keep(242)
1189!$ NOMP = OMP_GET_MAX_THREADS()
1190!$ OMP_FLAG = .FALSE.
1191!$ CHUNK = max(N/2,1)
1192!$ IF (NRHS * N .GE. KEEP(363)) THEN
1193!$ OMP_FLAG = .TRUE.
1194!$ CHUNK=int((int(N,8)*int(NRHS,8)+int(NOMP-1,8))/int(NOMP,8))
1195!$ CHUNK = min(CHUNK,(N+KEEP(362)-1)/KEEP(362))
1196!$ CHUNK = max(KEEP(363)/2,CHUNK)
1197!$ ENDIF
1198 ENDIF
1199 IF (omp_flag) THEN
1200!$OMP PARALLEL FIRSTPRIVATE(JBEG_RHS,N,K242)
1201!$OMP& PRIVATE(IPOSINRHSCOMP,I,JCOL_RHS) IF (OMP_FLAG)
1202 DO j=1, nrhs
1203 IF (k242.EQ.0) THEN
1204 jcol_rhs = j+jbeg_rhs-1
1205 ELSE
1206 jcol_rhs = perm_rhs(j+jbeg_rhs-1)
1207 ENDIF
1208!$OMP DO SCHEDULE(DYNAMIC,CHUNK)
1209 DO i=1, n
1210 iposinrhscomp = posinrhscomp(i)
1211 IF (iposinrhscomp.GT.0) THEN
1212 rhs(i,jcol_rhs) = rhscomp(iposinrhscomp,j)
1213 ELSE
1214 rhs(i,jcol_rhs) = zero
1215 ENDIF
1216 ENDDO
1217!$OMP END DO NOWAIT
1218 ENDDO
1219!$OMP END PARALLEL
1220 ELSE
1221 DO j=1, nrhs
1222 IF (keep(242).EQ.0) THEN
1223 jcol_rhs = j+jbeg_rhs-1
1224 ELSE
1225 jcol_rhs = perm_rhs(j+jbeg_rhs-1)
1226 ENDIF
1227 DO i=1, n
1228 iposinrhscomp = posinrhscomp(i)
1229 IF (iposinrhscomp.GT.0) THEN
1230 rhs(i,jcol_rhs) = rhscomp(iposinrhscomp,j)
1231 ELSE
1232 rhs(i,jcol_rhs) = zero
1233 ENDIF
1234 ENDDO
1235 ENDDO
1236 ENDIF
1237 ENDIF
1238 RETURN
1239 ENDIF
1240 maxnpiv_estim = max(keep(246), keep(247))
1241 maxsurf = maxnpiv_estim*nrhs
1242 IF (lcwork .LT. maxnpiv_estim) THEN
1243 WRITE(*,*) myid,
1244 & ": Internal error 2 in SMUMPS_GATHER_SOLUTION:",
1245 & type_paral, lcwork, keep(247), nrhs
1246 CALL mumps_abort()
1247 ENDIF
1248 IF (myid.EQ.master) THEN
1249 ALLOCATE(irowlist(keep(247)),stat=allocok)
1250 IF(allocok.GT.0) THEN
1251 WRITE(*,*)'Problem with allocation of IROWlist'
1252 CALL mumps_abort()
1253 ENDIF
1254 ENDIF
1255 IF (nslaves .EQ. 1 .AND. type_paral .EQ. 1) THEN
1256 CALL mumps_abort()
1257 ENDIF
1258 size1=0
1259 CALL mpi_pack_size(maxnpiv_estim+2,mpi_integer, comm,
1260 & size1, ierr)
1261 size2=0
1262 CALL mpi_pack_size(maxsurf,mpi_real, comm,
1263 & size2, ierr)
1264 record_size_p_1= size1+size2
1265 IF (record_size_p_1.GT.size_buf_bytes) THEN
1266 write(6,*) myid,
1267 & ' Internal error 3 in SMUMPS_GATHER_SOLUTION '
1268 write(6,*) myid, ' RECORD_SIZE_P_1, SIZE_BUF_BYTES=',
1269 & record_size_p_1, size_buf_bytes
1270 CALL mumps_abort()
1271 ENDIF
1272 n2send =0
1273 n2recv =n
1274 pos_buf =0
1275 IF (i_am_slave) THEN
1276 pos_buf = 0
1277 DO istep = 1, keep(28)
1278 IF (myid_nodes == mumps_procnode(procnode_steps(istep),
1279 & keep(199))) THEN
1280 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
1281 & npiv, liell, ipos, iw, liw, ptrist, step, n)
1282 IF (mtype.eq.1 .AND. keep(50).EQ.0) THEN
1283 j1=ipos+1+liell
1284 ELSE
1285 j1=ipos+1
1286 END IF
1287 IF (myid .EQ. master) THEN
1288 n2recv=n2recv-npiv
1289 IF (npiv.GT.0)
1290 & CALL smumps_npiv_block_add ( .true. )
1291 ELSE
1292 IF (npiv.GT.0)
1293 & CALL smumps_npiv_block_add ( .false.)
1294 ENDIF
1295 ENDIF
1296 ENDDO
1297 CALL smumps_npiv_block_send()
1298 ENDIF
1299 IF ( myid .EQ. master ) THEN
1300 DO WHILE (n2recv .NE. 0)
1301 CALL mpi_recv( buffer, size_buf_bytes, mpi_packed,
1302 & mpi_any_source,
1303 & gathersol, comm, status, ierr )
1304 pos_buf = 0
1305 CALL mpi_unpack( buffer,size_buf_bytes, pos_buf,
1306 & npiv, 1, mpi_integer, comm, ierr)
1307 DO WHILE (npiv.NE.fin)
1308 CALL mpi_unpack( buffer,size_buf_bytes, pos_buf,
1309 & irowlist, npiv, mpi_integer, comm, ierr)
1310 DO j=1, nrhs
1311 IF (keep(242).EQ.0) THEN
1312 jcol_rhs=j+jbeg_rhs-1
1313 ELSE
1314 jcol_rhs=perm_rhs(j+jbeg_rhs-1)
1315 ENDIF
1316 CALL mpi_unpack(buffer, size_buf_bytes, pos_buf,
1317 & cwork, npiv, mpi_real,
1318 & comm, ierr)
1319 IF (lscal) THEN
1320 DO i=1,npiv
1321 rhs(irowlist(i),jcol_rhs)=cwork(i)*scaling(irowlist(i))
1322 ENDDO
1323 ELSE
1324 DO i=1,npiv
1325 rhs(irowlist(i),jcol_rhs)=cwork(i)
1326 ENDDO
1327 ENDIF
1328 ENDDO
1329 n2recv=n2recv-npiv
1330 CALL mpi_unpack( buffer, size_buf_bytes, pos_buf,
1331 & npiv, 1, mpi_integer, comm, ierr)
1332 ENDDO
1333 ENDDO
1334 DEALLOCATE(irowlist)
1335 ENDIF
1336 RETURN
1337 CONTAINS
1338 SUBROUTINE smumps_npiv_block_add ( ON_MASTER )
1339 LOGICAL, intent(in) :: ON_MASTER
1340 INTEGER :: JPOS, K242
1341 LOGICAL :: LOCAL_LSCAL
1342 IF (on_master) THEN
1343 IF (keep(350).EQ.2
1344 & .AND. (nrhs.EQ.1.OR.((npiv*nrhs*2*keep(16)).GE.keep(364)))) THEN
1345 local_lscal = lscal
1346 k242 = keep(242)
1347 DO j=1, nrhs
1348 IF (k242.EQ.0) THEN
1349 jpos = j+jbeg_rhs-1
1350 ELSE
1351 jpos = perm_rhs(j+jbeg_rhs-1)
1352 ENDIF
1353 DO ii=1,npiv
1354 i=iw(j1+ii-1)
1355 iposinrhscomp= posinrhscomp(i)
1356 IF (local_lscal) THEN
1357 rhs(i,jpos) = rhscomp(iposinrhscomp,j)*scaling(i)
1358 ELSE
1359 rhs(i,jpos) = rhscomp(iposinrhscomp,j)
1360 ENDIF
1361 ENDDO
1362 ENDDO
1363 ELSE
1364 IF (keep(242).EQ.0) THEN
1365 IF (lscal) THEN
1366 DO ii=1,npiv
1367 i=iw(j1+ii-1)
1368 iposinrhscomp= posinrhscomp(i)
1369 DO j=1, nrhs
1370 rhs(i,j+jbeg_rhs-1) =
1371 & rhscomp(iposinrhscomp,j)*scaling(i)
1372 ENDDO
1373 ENDDO
1374 ELSE
1375 DO ii=1,npiv
1376 i=iw(j1+ii-1)
1377 iposinrhscomp= posinrhscomp(i)
1378 DO j=1, nrhs
1379 rhs(i,j+jbeg_rhs-1) = rhscomp(iposinrhscomp,j)
1380 ENDDO
1381 ENDDO
1382 ENDIF
1383 ELSE
1384 IF (lscal) THEN
1385 DO ii=1,npiv
1386 i=iw(j1+ii-1)
1387 iposinrhscomp= posinrhscomp(i)
1388!DIR$ NOVECTOR
1389 DO j=1, nrhs
1390 rhs(i,perm_rhs(j+jbeg_rhs-1)) =
1391 & rhscomp(iposinrhscomp,j)*scaling(i)
1392 ENDDO
1393 ENDDO
1394 ELSE
1395 DO ii=1,npiv
1396 i=iw(j1+ii-1)
1397 iposinrhscomp= posinrhscomp(i)
1398!DIR$ NOVECTOR
1399 DO j=1, nrhs
1400 rhs(i,perm_rhs(j+jbeg_rhs-1)) =
1401 & rhscomp(iposinrhscomp,j)
1402 ENDDO
1403 ENDDO
1404 ENDIF
1405 ENDIF
1406 ENDIF
1407 RETURN
1408 ENDIF
1409 CALL mpi_pack(npiv, 1, mpi_integer, buffer,
1410 & size_buf_bytes, pos_buf, comm, ierr )
1411 CALL mpi_pack(iw(j1), npiv, mpi_integer, buffer,
1412 & size_buf_bytes, pos_buf, comm, ierr )
1413 iposinrhscomp= posinrhscomp(iw(j1))
1414 DO j=1,nrhs
1415 CALL mpi_pack(rhscomp(iposinrhscomp,j), npiv,
1416 & mpi_real,
1417 & buffer, size_buf_bytes, pos_buf, comm,
1418 & ierr)
1419 ENDDO
1420 n2send=n2send+npiv
1421 IF ( pos_buf + record_size_p_1 > size_buf_bytes ) THEN
1422 CALL smumps_npiv_block_send()
1423 END IF
1424 RETURN
1425 END SUBROUTINE smumps_npiv_block_add
1426 SUBROUTINE smumps_npiv_block_send()
1427 IF (n2send .NE. 0) THEN
1428 CALL mpi_pack(fin, 1, mpi_integer, buffer,
1429 & size_buf_bytes, pos_buf, comm, ierr )
1430 CALL mpi_send(buffer, pos_buf, mpi_packed, master,
1431 & gathersol, comm, ierr)
1432 ENDIF
1433 pos_buf=0
1434 n2send=0
1435 RETURN
1436 END SUBROUTINE smumps_npiv_block_send
mpi_recv
subroutine mpi_recv(buf, cnt, datatype, source, tag, comm, status, ierr)
Definition mpi.f:461
mpi_pack_size
subroutine mpi_pack_size(incnt, datatype, comm, size, ierr)
Definition mpi.f:439
mpi_unpack
subroutine mpi_unpack(inbuf, insize, position, outbuf, outcnt, datatype, comm, ierr)
Definition mpi.f:514
smumps_npiv_block_send
subroutine smumps_npiv_block_send()
Definition ssol_c.F:1427
smumps_npiv_block_add
subroutine smumps_npiv_block_add(on_master)
Definition ssol_c.F:1339

◆ smumps_gather_solution_am1()

subroutine smumps_gather_solution_am1 ( integer nslaves,
integer n,
integer myid,
integer comm,
integer nrhs,
real, dimension (lrhscomp, nrhscomp_col), intent(in) rhscomp,
integer lrhscomp,
integer nrhscomp_col,
integer, dimension(500) keep,
integer, dimension(size_buf) buffer,
integer size_buf,
integer size_buf_bytes,
logical, intent(in) lscal,
real, dimension(lscaling), intent(in) scaling,
integer, intent(in) lscaling,
integer, dimension(lirhs_ptr_copy) irhs_ptr_copy,
integer, intent(in) lirhs_ptr_copy,
integer, dimension(lirhs_sparse_copy) irhs_sparse_copy,
integer, intent(in) lirhs_sparse_copy,
real, dimension(lrhs_sparse_copy) rhs_sparse_copy,
integer, intent(in) lrhs_sparse_copy,
integer, dimension(luns_perm_inv) uns_perm_inv,
integer, intent(in) luns_perm_inv,
integer, dimension(lpos_row) posinrhscomp,
integer lpos_row,
integer, intent(in) nb_fs_in_rhscomp )

Definition at line 1438 of file ssol_c.F.

1448 IMPLICIT NONE
1449 include 'mpif.h'
1450 include 'mumps_tags.h'
1451 INTEGER NSLAVES, N, MYID, COMM
1452 INTEGER NRHS, LRHSCOMP, NRHSCOMP_COL
1453 REAL, intent(in) :: RHSCOMP (LRHSCOMP, NRHSCOMP_COL)
1454 INTEGER KEEP(500)
1455 INTEGER SIZE_BUF, SIZE_BUF_BYTES, LPOS_ROW
1456 INTEGER BUFFER(SIZE_BUF)
1457 INTEGER, intent(in) :: LIRHS_PTR_COPY, LIRHS_SPARSE_COPY,
1458 & LRHS_SPARSE_COPY, LUNS_PERM_INV,
1459 & NB_FS_IN_RHSCOMP
1460 INTEGER :: IRHS_SPARSE_COPY(LIRHS_SPARSE_COPY),
1461 & IRHS_PTR_COPY(LIRHS_PTR_COPY),
1462 & UNS_PERM_INV(LUNS_PERM_INV),
1463 & POSINRHSCOMP(LPOS_ROW)
1464 REAL :: RHS_SPARSE_COPY(LRHS_SPARSE_COPY)
1465 LOGICAL, intent(in) :: LSCAL
1466 INTEGER, intent(in) :: LSCALING
1467 REAL, intent(in) :: SCALING(LSCALING)
1468 INTEGER COLSIZE, K, IZ, IPREV, NBCOL_INBLOC
1469 INTEGER I, II, J, MASTER,
1470 & TYPE_PARAL, N2RECV, IPOSINRHSCOMP
1471 INTEGER :: STATUS(MPI_STATUS_SIZE)
1472 INTEGER :: IERR
1473 parameter(master=0)
1474 LOGICAL I_AM_SLAVE
1475 INTEGER RECORD_SIZE_P_1, SIZE1, SIZE2
1476 INTEGER POS_BUF, N2SEND
1477 INTEGER, PARAMETER :: FIN = -1
1478 include 'mumps_headers.h'
1479 type_paral = keep(46)
1480 i_am_slave = myid .ne. master .OR. type_paral .eq. 1
1481 nbcol_inbloc = size(irhs_ptr_copy)-1
1482 IF (nslaves.EQ.1 .AND. type_paral.EQ.1) THEN
1483 k=1
1484 DO j = 1, nbcol_inbloc
1485 colsize = irhs_ptr_copy(j+1) - irhs_ptr_copy(j)
1486 IF (colsize.EQ.0) cycle
1487 DO iz=irhs_ptr_copy(j), irhs_ptr_copy(j+1)-1
1488 i = irhs_sparse_copy(iz)
1489 IF (keep(23).NE.0) i = uns_perm_inv(i)
1490 iposinrhscomp = posinrhscomp(i)
1491 IF (iposinrhscomp.GT.0) THEN
1492 IF (lscal) THEN
1493 rhs_sparse_copy(iz)=
1494 & rhscomp(iposinrhscomp,k)*scaling(i)
1495 ELSE
1496 rhs_sparse_copy(iz)=rhscomp(iposinrhscomp,k)
1497 ENDIF
1498 ENDIF
1499 ENDDO
1500 k = k + 1
1501 ENDDO
1502 RETURN
1503 ENDIF
1504 IF (i_am_slave) THEN
1505 k=1
1506 DO j = 1, nbcol_inbloc
1507 colsize = irhs_ptr_copy(j+1) - irhs_ptr_copy(j)
1508 IF (colsize.EQ.0) cycle
1509 DO iz=irhs_ptr_copy(j), irhs_ptr_copy(j+1)-1
1510 i = irhs_sparse_copy(iz)
1511 IF (keep(23).NE.0) i = uns_perm_inv(i)
1512 iposinrhscomp = posinrhscomp(i)
1513 IF (iposinrhscomp.GT.0) THEN
1514 rhs_sparse_copy(iz)=rhscomp(iposinrhscomp,k)
1515 ENDIF
1516 ENDDO
1517 k = k + 1
1518 ENDDO
1519 ENDIF
1520 size1=0
1521 CALL mpi_pack_size(3,mpi_integer, comm,
1522 & size1, ierr)
1523 size2=0
1524 CALL mpi_pack_size(1,mpi_real, comm,
1525 & size2, ierr)
1526 record_size_p_1= size1+size2
1527 IF (record_size_p_1.GT.size_buf_bytes) THEN
1528 write(6,*) myid,
1529 & ' Internal error 3 in SMUMPS_GATHER_SOLUTION_AM1 '
1530 write(6,*) myid, ' RECORD_SIZE_P_1, SIZE_BUF_BYTES=',
1531 & record_size_p_1, size_buf_bytes
1532 CALL mumps_abort()
1533 ENDIF
1534 n2send =0
1535 n2recv =size(irhs_sparse_copy)
1536 pos_buf =0
1537 IF (i_am_slave) THEN
1538 DO j = 1, nbcol_inbloc
1539 colsize = irhs_ptr_copy(j+1) - irhs_ptr_copy(j)
1540 IF (colsize.LE.0) cycle
1541 k = 0
1542 DO iz=irhs_ptr_copy(j), irhs_ptr_copy(j+1)-1
1543 i = irhs_sparse_copy(iz)
1544 ii = i
1545 IF (keep(23).NE.0) ii = uns_perm_inv(i)
1546 iposinrhscomp = posinrhscomp(ii)
1547 IF (iposinrhscomp.GT.0) THEN
1548 IF (myid .EQ. master) THEN
1549 n2recv=n2recv-1
1550 IF (lscal)
1551 & CALL smumps_am1_block_add ( .true. )
1552 irhs_sparse_copy( irhs_ptr_copy(j) + k) =
1553 & i
1554 rhs_sparse_copy( irhs_ptr_copy(j) + k) =
1555 & rhs_sparse_copy(iz)
1556 k = k+1
1557 ELSE
1558 CALL smumps_am1_block_add ( .false. )
1559 ENDIF
1560 ENDIF
1561 ENDDO
1562 IF (myid.EQ.master)
1563 & irhs_ptr_copy(j) = irhs_ptr_copy(j) + k
1564 ENDDO
1565 CALL smumps_am1_block_send()
1566 ENDIF
1567 IF ( myid .EQ. master ) THEN
1568 DO WHILE (n2recv .NE. 0)
1569 CALL mpi_recv( buffer, size_buf_bytes, mpi_packed,
1570 & mpi_any_source,
1571 & gathersol, comm, status, ierr )
1572 pos_buf = 0
1573 CALL mpi_unpack( buffer,size_buf_bytes, pos_buf,
1574 & j, 1, mpi_integer, comm, ierr)
1575 DO WHILE (j.NE.fin)
1576 iz = irhs_ptr_copy(j)
1577 CALL mpi_unpack( buffer,size_buf_bytes, pos_buf,
1578 & i, 1, mpi_integer, comm, ierr)
1579 irhs_sparse_copy(iz) = i
1580 CALL mpi_unpack(buffer, size_buf_bytes, pos_buf,
1581 & rhs_sparse_copy(iz), 1, mpi_real,
1582 & comm, ierr)
1583 IF (lscal) THEN
1584 IF (keep(23).NE.0) i = uns_perm_inv(i)
1585 rhs_sparse_copy(iz) = rhs_sparse_copy(iz)*scaling(i)
1586 ENDIF
1587 n2recv=n2recv-1
1588 irhs_ptr_copy(j) = irhs_ptr_copy(j) + 1
1589 CALL mpi_unpack( buffer, size_buf_bytes, pos_buf,
1590 & j, 1, mpi_integer, comm, ierr)
1591 ENDDO
1592 ENDDO
1593 iprev = 1
1594 DO j=1, size(irhs_ptr_copy)-1
1595 i= irhs_ptr_copy(j)
1596 irhs_ptr_copy(j) = iprev
1597 iprev = i
1598 ENDDO
1599 ENDIF
1600 RETURN
1601 CONTAINS
1602 SUBROUTINE smumps_am1_block_add ( SCALE_ONLY )
1603 LOGICAL, intent(in) :: SCALE_ONLY
1604 INTEGER III
1605 IF (scale_only) THEN
1606 iii = i
1607 IF (keep(23).NE.0) iii = uns_perm_inv(i)
1608 IF (lscal) THEN
1609 rhs_sparse_copy(iz)=rhs_sparse_copy(iz)*scaling(iii)
1610 ENDIF
1611 RETURN
1612 ENDIF
1613 CALL mpi_pack(j, 1, mpi_integer, buffer,
1614 & size_buf_bytes, pos_buf, comm, ierr )
1615 CALL mpi_pack(i, 1, mpi_integer, buffer,
1616 & size_buf_bytes, pos_buf, comm, ierr )
1617 CALL mpi_pack(rhs_sparse_copy(iz), 1, mpi_real,
1618 & buffer, size_buf_bytes, pos_buf, comm,
1619 & ierr)
1620 n2send=n2send+1
1621 IF ( pos_buf + record_size_p_1 > size_buf_bytes ) THEN
1622 CALL smumps_am1_block_send()
1623 END IF
1624 RETURN
1625 END SUBROUTINE smumps_am1_block_add
1626 SUBROUTINE smumps_am1_block_send()
1627 IF (n2send .NE. 0) THEN
1628 CALL mpi_pack(fin, 1, mpi_integer, buffer,
1629 & size_buf_bytes, pos_buf, comm, ierr )
1630 CALL mpi_send(buffer, pos_buf, mpi_packed, master,
1631 & gathersol, comm, ierr)
1632 ENDIF
1633 pos_buf=0
1634 n2send=0
1635 RETURN
1636 END SUBROUTINE smumps_am1_block_send
smumps_am1_block_add
subroutine smumps_am1_block_add(scale_only)
Definition ssol_c.F:1603

◆ smumps_get_buf_indx_rhs()

subroutine smumps_scatter_rhs::smumps_get_buf_indx_rhs
private

Definition at line 2019 of file ssol_c.F.

2020 CALL mpi_send(buf_indx, buf_effsize, mpi_integer,
2021 & master, scatterrhsi, comm, ierr )
2022 IF (keep(350).EQ.2) THEN
2023 CALL mpi_recv(buf_rhs_2, buf_effsize*nrhs,
2024 & mpi_real,
2025 & master,
2026 & scatterrhsr, comm, status, ierr )
2027!$ OMP_FLAG = .FALSE.
2028!$ CHUNK = NRHS
2029!$ IF (BUF_EFFSIZE*NRHS .GE. KEEP(363)) THEN
2030!$ OMP_FLAG = .TRUE.
2031!$ CHUNK = max((BUF_EFFSIZE*NRHS+NOMP-1)/NOMP,KEEP(363)/2)
2032!$ ENDIF
2033!$OMP PARALLEL DO COLLAPSE(2) SCHEDULE(STATIC,CHUNK) PRIVATE(INDX)
2034!$OMP& IF (OMP_FLAG)
2035 DO k = 1, nrhs
2036 DO i = 1, buf_effsize
2037 indx = posinrhscomp_fwd(buf_indx(i))
2038 rhscomp( indx, k ) =
2039 & buf_rhs_2( i+(k-1)*buf_effsize)
2040 ENDDO
2041 ENDDO
2042!$OMP END PARALLEL DO
2043 ELSE
2044 CALL mpi_recv(buf_rhs, buf_effsize*nrhs,
2045 & mpi_real,
2046 & master,
2047 & scatterrhsr, comm, status, ierr )
2048 DO i = 1, buf_effsize
2049 indx = posinrhscomp_fwd(buf_indx(i))
2050 DO k = 1, nrhs
2051 rhscomp( indx, k ) = buf_rhs( k, i )
2052 ENDDO
2053 ENDDO
2054 END IF
2055 buf_effsize = 0
2056 RETURN

◆ smumps_npiv_block_add()

subroutine smumps_gather_solution::smumps_npiv_block_add ( logical, intent(in) on_master)
private

Definition at line 1338 of file ssol_c.F.

1339 LOGICAL, intent(in) :: ON_MASTER
1340 INTEGER :: JPOS, K242
1341 LOGICAL :: LOCAL_LSCAL
1342 IF (on_master) THEN
1343 IF (keep(350).EQ.2
1344 & .AND. (nrhs.EQ.1.OR.((npiv*nrhs*2*keep(16)).GE.keep(364)))) THEN
1345 local_lscal = lscal
1346 k242 = keep(242)
1347 DO j=1, nrhs
1348 IF (k242.EQ.0) THEN
1349 jpos = j+jbeg_rhs-1
1350 ELSE
1351 jpos = perm_rhs(j+jbeg_rhs-1)
1352 ENDIF
1353 DO ii=1,npiv
1354 i=iw(j1+ii-1)
1355 iposinrhscomp= posinrhscomp(i)
1356 IF (local_lscal) THEN
1357 rhs(i,jpos) = rhscomp(iposinrhscomp,j)*scaling(i)
1358 ELSE
1359 rhs(i,jpos) = rhscomp(iposinrhscomp,j)
1360 ENDIF
1361 ENDDO
1362 ENDDO
1363 ELSE
1364 IF (keep(242).EQ.0) THEN
1365 IF (lscal) THEN
1366 DO ii=1,npiv
1367 i=iw(j1+ii-1)
1368 iposinrhscomp= posinrhscomp(i)
1369 DO j=1, nrhs
1370 rhs(i,j+jbeg_rhs-1) =
1371 & rhscomp(iposinrhscomp,j)*scaling(i)
1372 ENDDO
1373 ENDDO
1374 ELSE
1375 DO ii=1,npiv
1376 i=iw(j1+ii-1)
1377 iposinrhscomp= posinrhscomp(i)
1378 DO j=1, nrhs
1379 rhs(i,j+jbeg_rhs-1) = rhscomp(iposinrhscomp,j)
1380 ENDDO
1381 ENDDO
1382 ENDIF
1383 ELSE
1384 IF (lscal) THEN
1385 DO ii=1,npiv
1386 i=iw(j1+ii-1)
1387 iposinrhscomp= posinrhscomp(i)
1388!DIR$ NOVECTOR
1389 DO j=1, nrhs
1390 rhs(i,perm_rhs(j+jbeg_rhs-1)) =
1391 & rhscomp(iposinrhscomp,j)*scaling(i)
1392 ENDDO
1393 ENDDO
1394 ELSE
1395 DO ii=1,npiv
1396 i=iw(j1+ii-1)
1397 iposinrhscomp= posinrhscomp(i)
1398!DIR$ NOVECTOR
1399 DO j=1, nrhs
1400 rhs(i,perm_rhs(j+jbeg_rhs-1)) =
1401 & rhscomp(iposinrhscomp,j)
1402 ENDDO
1403 ENDDO
1404 ENDIF
1405 ENDIF
1406 ENDIF
1407 RETURN
1408 ENDIF
1409 CALL mpi_pack(npiv, 1, mpi_integer, buffer,
1410 & size_buf_bytes, pos_buf, comm, ierr )
1411 CALL mpi_pack(iw(j1), npiv, mpi_integer, buffer,
1412 & size_buf_bytes, pos_buf, comm, ierr )
1413 iposinrhscomp= posinrhscomp(iw(j1))
1414 DO j=1,nrhs
1415 CALL mpi_pack(rhscomp(iposinrhscomp,j), npiv,
1416 & mpi_real,
1417 & buffer, size_buf_bytes, pos_buf, comm,
1418 & ierr)
1419 ENDDO
1420 n2send=n2send+npiv
1421 IF ( pos_buf + record_size_p_1 > size_buf_bytes ) THEN
1422 CALL smumps_npiv_block_send()
1423 END IF
1424 RETURN

◆ smumps_npiv_block_send()

subroutine smumps_gather_solution::smumps_npiv_block_send
private

Definition at line 1426 of file ssol_c.F.

1427 IF (n2send .NE. 0) THEN
1428 CALL mpi_pack(fin, 1, mpi_integer, buffer,
1429 & size_buf_bytes, pos_buf, comm, ierr )
1430 CALL mpi_send(buffer, pos_buf, mpi_packed, master,
1431 & gathersol, comm, ierr)
1432 ENDIF
1433 pos_buf=0
1434 n2send=0
1435 RETURN

◆ smumps_scatter_rhs()

subroutine smumps_scatter_rhs ( integer nslaves,
integer n,
integer myid,
integer comm,
integer mtype,
real, dimension (lrhs, ncol_rhs), intent(in) rhs,
integer lrhs,
integer ncol_rhs,
integer nrhs,
real, dimension(lrhscomp, ncol_rhscomp), intent(out) rhscomp,
integer lrhscomp,
integer ncol_rhscomp,
integer, dimension(n), intent(in) posinrhscomp_fwd,
integer, intent(in) nb_fs_in_rhscomp_f,
integer, dimension(keep(28)) ptrist,
integer, dimension(500) keep,
integer(8), dimension(150) keep8,
integer, dimension(keep(28)) procnode_steps,
integer, dimension(liw) iw,
integer liw,
integer, dimension(n) step,
integer, dimension(60) icntl,
integer, dimension(80) info )

Definition at line 1821 of file ssol_c.F.

1829!$ USE OMP_LIB
1830 IMPLICIT NONE
1831 include 'mpif.h'
1832 include 'mumps_tags.h'
1833 INTEGER NSLAVES, N, MYID, COMM, LIW, MTYPE
1834 INTEGER NRHS, LRHS, NCOL_RHS, LRHSCOMP, NCOL_RHSCOMP
1835 INTEGER ICNTL(60), INFO(80)
1836 REAL, intent(in) :: RHS (LRHS, NCOL_RHS)
1837 REAL, intent(out) :: RHSCOMP(LRHSCOMP, NCOL_RHSCOMP)
1838 INTEGER, intent(in) :: POSINRHSCOMP_FWD(N), NB_FS_IN_RHSCOMP_F
1839 INTEGER KEEP(500)
1840 INTEGER(8) KEEP8(150)
1841 INTEGER PTRIST(KEEP(28)), PROCNODE_STEPS(KEEP(28))
1842 INTEGER IW(LIW), STEP(N)
1843 INTEGER BUF_MAXSIZE, BUF_MAXREF
1844 parameter(buf_maxref=200000)
1845 INTEGER, ALLOCATABLE, DIMENSION(:) :: BUF_INDX
1846 REAL, ALLOCATABLE, DIMENSION(:,:) :: BUF_RHS
1847 REAL, ALLOCATABLE, DIMENSION(:) :: BUF_RHS_2
1848 INTEGER ENTRIES_2_PROCESS, PROC_WHO_ASKS, BUF_EFFSIZE
1849 INTEGER INDX
1850 INTEGER allocok
1851 REAL ZERO
1852 parameter( zero = 0.0e0 )
1853 INTEGER I, J, K, JJ, J1, ISTEP, MASTER,
1854 & MYID_NODES, TYPE_PARAL
1855 INTEGER LIELL, IPOS, NPIV
1856 INTEGER :: STATUS(MPI_STATUS_SIZE)
1857 INTEGER :: IERR
1858 parameter(master=0)
1859 LOGICAL I_AM_SLAVE
1860!$ INTEGER :: CHUNK, NOMP
1861!$ LOGICAL :: OMP_FLAG
1862 include 'mumps_headers.h'
1863 INTEGER MUMPS_PROCNODE
1864 EXTERNAL mumps_procnode
1865 type_paral = keep(46)
1866 i_am_slave = myid .ne. 0 .OR. type_paral .eq. 1
1867 IF ( type_paral == 1 ) THEN
1868 myid_nodes = myid
1869 ELSE
1870 myid_nodes = myid-1
1871 ENDIF
1872 buf_effsize = 0
1873 buf_maxsize = max(min(buf_maxref,int(2000000/nrhs)),2000)
1874 IF ( keep(350).EQ.2 ) THEN
1875!$ NOMP = OMP_GET_MAX_THREADS()
1876 ALLOCATE (buf_indx(buf_maxsize),
1877 & buf_rhs_2(buf_maxsize*nrhs),
1878 & stat=allocok)
1879 ELSE
1880 ALLOCATE (buf_indx(buf_maxsize),
1881 & buf_rhs(nrhs,buf_maxsize),
1882 & stat=allocok)
1883 END IF
1884 IF (allocok .GT. 0) THEN
1885 info(1)=-13
1886 info(2)=buf_maxsize*(nrhs+1)
1887 ENDIF
1888 CALL mumps_propinfo(icntl, info, comm, myid )
1889 IF (info(1).LT.0) RETURN
1890 IF (myid.EQ.master) THEN
1891 entries_2_process = n - keep(89)
1892 IF (type_paral.EQ.1.AND.entries_2_process.NE.0) THEN
1893 IF (nb_fs_in_rhscomp_f.LT.lrhscomp) THEN
1894 DO k=1, ncol_rhscomp
1895 DO i = nb_fs_in_rhscomp_f +1, lrhscomp
1896 rhscomp(i, k) = zero
1897 ENDDO
1898 ENDDO
1899 ENDIF
1900 ENDIF
1901 IF ( keep(350).EQ.2 ) THEN
1902 DO WHILE ( entries_2_process .NE. 0)
1903 CALL mpi_recv( buf_indx, buf_maxsize, mpi_integer,
1904 & mpi_any_source,
1905 & scatterrhsi, comm, status, ierr )
1906 CALL mpi_get_count(status,mpi_integer,buf_effsize,ierr)
1907 proc_who_asks = status(mpi_source)
1908!$ OMP_FLAG = .FALSE.
1909!$ CHUNK = NRHS
1910!$ IF (BUF_EFFSIZE*NRHS .GE. KEEP(363)) THEN
1911!$ OMP_FLAG = .TRUE.
1912!$ CHUNK = max((BUF_EFFSIZE*NRHS+NOMP-1)/NOMP,KEEP(363)/2)
1913!$ ENDIF
1914!$OMP PARALLEL DO COLLAPSE(2) SCHEDULE(STATIC,CHUNK) PRIVATE(INDX)
1915!$OMP& IF (OMP_FLAG)
1916 DO k = 1, nrhs
1917 DO i = 1, buf_effsize
1918 indx = buf_indx( i )
1919 buf_rhs_2( i+(k-1)*buf_effsize) = rhs( indx, k )
1920 ENDDO
1921 ENDDO
1922!$OMP END PARALLEL DO
1923 CALL mpi_send( buf_rhs_2,
1924 & nrhs*buf_effsize,
1925 & mpi_real, proc_who_asks,
1926 & scatterrhsr, comm, ierr)
1927 entries_2_process = entries_2_process - buf_effsize
1928 ENDDO
1929 buf_effsize= 0
1930 ELSE
1931 DO WHILE ( entries_2_process .NE. 0)
1932 CALL mpi_recv( buf_indx, buf_maxsize, mpi_integer,
1933 & mpi_any_source,
1934 & scatterrhsi, comm, status, ierr )
1935 CALL mpi_get_count( status, mpi_integer,buf_effsize,ierr)
1936 proc_who_asks = status(mpi_source)
1937 DO i = 1, buf_effsize
1938 indx = buf_indx( i )
1939 DO k = 1, nrhs
1940 buf_rhs( k, i ) = rhs( indx, k )
1941 ENDDO
1942 ENDDO
1943 CALL mpi_send( buf_rhs, nrhs*buf_effsize,
1944 & mpi_real, proc_who_asks,
1945 & scatterrhsr, comm, ierr)
1946 entries_2_process = entries_2_process - buf_effsize
1947 ENDDO
1948 buf_effsize= 0
1949 ENDIF
1950 ENDIF
1951 IF (i_am_slave) THEN
1952 IF (myid.NE.master) THEN
1953 IF (nb_fs_in_rhscomp_f.LT.lrhscomp) THEN
1954 DO k=1, ncol_rhscomp
1955 DO i = nb_fs_in_rhscomp_f +1, lrhscomp
1956 rhscomp(i, k) = zero
1957 ENDDO
1958 ENDDO
1959 ENDIF
1960 ENDIF
1961 DO istep = 1, keep(28)
1962 IF (myid_nodes == mumps_procnode(procnode_steps(istep),
1963 & keep(199))) THEN
1964 CALL mumps_sol_get_npiv_liell_ipos( istep, keep,
1965 & npiv, liell, ipos, iw, liw, ptrist, step, n )
1966 IF (mtype.eq.1 .OR. keep(50).NE.0) THEN
1967 j1=ipos+1
1968 ELSE
1969 j1=ipos+1+liell
1970 END IF
1971 IF (myid.EQ.master) THEN
1972 indx = posinrhscomp_fwd(iw(j1))
1973 IF (keep(350).EQ.2 .AND.
1974 & (nrhs.EQ.1.OR.((npiv*nrhs*2*keep(16)).GE.keep(364)))) THEN
1975!$ OMP_FLAG = .FALSE.
1976!$ CHUNK = NRHS
1977!$ IF (NPIV*NRHS .GE. KEEP(363)) THEN
1978!$ OMP_FLAG = .TRUE.
1979!$ CHUNK = max((NPIV*NRHS+NOMP-1)/NOMP,KEEP(363)/2)
1980!$ ENDIF
1981!$OMP PARALLEL DO COLLAPSE(2) SCHEDULE(STATIC,CHUNK) PRIVATE(J,JJ)
1982!$OMP& FIRSTPRIVATE(INDX) IF (OMP_FLAG)
1983 DO k = 1, nrhs
1984 DO jj=j1,j1+npiv-1
1985 j=iw(jj)
1986 rhscomp( indx+jj-j1, k ) = rhs( j, k )
1987 ENDDO
1988 ENDDO
1989!$OMP END PARALLEL DO
1990 ELSE
1991 DO jj=j1,j1+npiv-1
1992 j=iw(jj)
1993 DO k = 1, nrhs
1994 rhscomp( indx+jj-j1, k ) = rhs( j, k )
1995 ENDDO
1996 ENDDO
1997 END IF
1998 ELSE
1999 DO jj=j1,j1+npiv-1
2000 buf_effsize = buf_effsize + 1
2001 buf_indx(buf_effsize) = iw(jj)
2002 IF (buf_effsize + 1 .GT. buf_maxsize) THEN
2003 CALL smumps_get_buf_indx_rhs()
2004 ENDIF
2005 ENDDO
2006 ENDIF
2007 ENDIF
2008 ENDDO
2009 IF ( buf_effsize .NE. 0 .AND. myid.NE.master )
2010 & CALL smumps_get_buf_indx_rhs()
2011 ENDIF
2012 IF (keep(350).EQ.2) THEN
2013 DEALLOCATE (buf_indx, buf_rhs_2)
2014 ELSE
2015 DEALLOCATE (buf_indx, buf_rhs)
2016 ENDIF
2017 RETURN
2018 CONTAINS
2019 SUBROUTINE smumps_get_buf_indx_rhs()
2020 CALL mpi_send(buf_indx, buf_effsize, mpi_integer,
2021 & master, scatterrhsi, comm, ierr )
2022 IF (keep(350).EQ.2) THEN
2023 CALL mpi_recv(buf_rhs_2, buf_effsize*nrhs,
2024 & mpi_real,
2025 & master,
2026 & scatterrhsr, comm, status, ierr )
2027!$ OMP_FLAG = .FALSE.
2028!$ CHUNK = NRHS
2029!$ IF (BUF_EFFSIZE*NRHS .GE. KEEP(363)) THEN
2030!$ OMP_FLAG = .TRUE.
2031!$ CHUNK = max((BUF_EFFSIZE*NRHS+NOMP-1)/NOMP,KEEP(363)/2)
2032!$ ENDIF
2033!$OMP PARALLEL DO COLLAPSE(2) SCHEDULE(STATIC,CHUNK) PRIVATE(INDX)
2034!$OMP& IF (OMP_FLAG)
2035 DO k = 1, nrhs
2036 DO i = 1, buf_effsize
2037 indx = posinrhscomp_fwd(buf_indx(i))
2038 rhscomp( indx, k ) =
2039 & buf_rhs_2( i+(k-1)*buf_effsize)
2040 ENDDO
2041 ENDDO
2042!$OMP END PARALLEL DO
2043 ELSE
2044 CALL mpi_recv(buf_rhs, buf_effsize*nrhs,
2045 & mpi_real,
2046 & master,
2047 & scatterrhsr, comm, status, ierr )
2048 DO i = 1, buf_effsize
2049 indx = posinrhscomp_fwd(buf_indx(i))
2050 DO k = 1, nrhs
2051 rhscomp( indx, k ) = buf_rhs( k, i )
2052 ENDDO
2053 ENDDO
2054 END IF
2055 buf_effsize = 0
2056 RETURN
2057 END SUBROUTINE smumps_get_buf_indx_rhs
mumps_propinfo
subroutine mumps_propinfo(icntl, info, comm, id)
Definition bcast_errors.F:15
min
#define min(a, b)
Definition macros.h:20
mpi_get_count
subroutine mpi_get_count(status, datatype, cnt, ierr)
Definition mpi.f:296
smumps_get_buf_indx_rhs
subroutine smumps_get_buf_indx_rhs()
Definition ssol_c.F:2020

◆ smumps_sol_c()

subroutine smumps_sol_c ( type ( smumps_root_struc ) root,
integer n,
real, dimension(la) a,
integer(8) la,
integer, dimension(liw) iw,
integer liw,
real, dimension(lwc) w,
integer(8) lwc,
integer, dimension(liww) iwcb,
integer liww,
integer nrhs,
integer, dimension(lna) na,
integer lna,
integer, dimension(keep(28)) ne_steps,
real, dimension(keep(133)) w2,
integer mtype,
integer, dimension(60) icntl,
logical, intent(in) from_pp,
integer, dimension(n) step,
integer, dimension(keep(28)) frere,
integer, dimension(keep(28)) dad,
integer, dimension(n) fils,
integer, dimension(keep(28)) ptrist,
integer(8), dimension(keep(28)) ptrfac,
integer, dimension(liw1) iw1,
integer liw1,
integer(8), dimension(liwk_ptracb) ptracb,
integer liwk_ptracb,
integer, dimension(keep(28)) procnode_steps,
integer slavef,
integer, dimension(80) info,
integer, dimension(500) keep,
integer(8), dimension(150) keep8,
real, dimension(230), intent(inout) dkeep,
integer comm_nodes,
integer myid,
integer myid_nodes,
integer, dimension(lbufr) bufr,
integer lbufr,
integer lbufr_bytes,
integer, dimension(keep(71)) istep_to_iniv2,
integer, dimension(slavef+2,max(1,keep(56))) tab_pos_in_pere,
integer ibeg_root_def,
integer iend_root_def,
integer iroot_def_rhs_col1,
real, dimension(lrhs_root) rhs_root,
integer(8) lrhs_root,
integer size_root,
integer master_root,
real, dimension(lrhscomp,nrhs) rhscomp,
integer lrhscomp,
integer, dimension(n) posinrhscomp_fwd,
integer, dimension(n) posinrhscomp_bwd,
integer, intent(in) nz_rhs,
integer, intent(in) nbcol_inbloc,
integer, intent(in) nrhs_orig,
integer, intent(in) jbeg_rhs,
integer, dimension(lstep2node), intent(in) step2node,
integer, intent(in) lstep2node,
integer, dimension(nz_rhs), intent(in) irhs_sparse,
integer, dimension(nbcol_inbloc+1), intent(in) irhs_ptr,
integer, intent(in) size_perm_rhs,
integer, dimension(size_perm_rhs), intent(in) perm_rhs,
integer, intent(in) size_uns_perm_inv,
integer, dimension(size_uns_perm_inv), intent(in) uns_perm_inv,
integer nb_fs_in_rhscomp_f,
integer nb_fs_in_rhscomp_tot,
logical, intent(in) do_nbsparse,
integer, dimension (lrhs_bounds), intent(inout) rhs_bounds,
integer, intent(in) lrhs_bounds,
integer, dimension( lpool_b_l0_omp ), intent(in) ipool_b_l0_omp,
integer, intent(in) lpool_b_l0_omp,
integer, dimension( lpool_a_l0_omp ), intent(in) ipool_a_l0_omp,
integer, intent(in) lpool_a_l0_omp,
integer, intent(in) l_virt_l0_omp,
integer, dimension( l_virt_l0_omp ), intent(in) virt_l0_omp,
integer, intent(in) l_phys_l0_omp,
integer, dimension( l_phys_l0_omp ), intent(inout) phys_l0_omp,
integer, dimension( l_phys_l0_omp ), intent(in) perm_l0_omp,
integer, dimension( l_phys_l0_omp + 1), intent(in) ptr_leafs_l0_omp,
integer, dimension( ll0_omp_mapping ), intent(in) l0_omp_mapping,
integer, intent(in) ll0_omp_mapping,
type (smumps_l0ompfac_t), dimension(ll0_omp_factors), intent(in) l0_omp_factors,
integer, intent(in) ll0_omp_factors )

Definition at line 14 of file ssol_c.F.

31 USE smumps_ooc
32 USE smumps_sol_es
33 USE smumps_sol_l0omp_m, ONLY : smumps_sol_l0omp_r,
34 & smumps_sol_l0omp_s
35 USE smumps_struc_def, ONLY : smumps_root_struc
36 & , smumps_l0ompfac_t
37 IMPLICIT NONE
38#if defined(V_T)
39 include 'VT.inc'
40#endif
41 TYPE ( SMUMPS_ROOT_STRUC ) :: root
42 INTEGER(8) :: LA
43 INTEGER(8) :: LWC
44 INTEGER :: N,LIW,MTYPE,LIW1,LIWW,LNA
45 INTEGER ICNTL(60),INFO(80), KEEP(500)
46 REAL, intent(inout) :: DKEEP(230)
47 INTEGER(8) KEEP8(150)
48 INTEGER IW(LIW),IW1(LIW1),NA(LNA),NE_STEPS(KEEP(28)),IWCB(LIWW)
49 INTEGER STEP(N), FRERE(KEEP(28)), FILS(N), PTRIST(KEEP(28)),
50 & DAD(KEEP(28))
51 INTEGER(8) :: PTRFAC(KEEP(28))
52 INTEGER :: LIWK_PTRACB
53 INTEGER(8) :: PTRACB(LIWK_PTRACB)
54 INTEGER NRHS, LRHSCOMP, NB_FS_IN_RHSCOMP_F, NB_FS_IN_RHSCOMP_TOT
55 REAL A(LA), W(LWC),
56 & W2(KEEP(133))
57 REAL :: RHSCOMP(LRHSCOMP,NRHS)
58 INTEGER SLAVEF, COMM_NODES, MYID, MYID_NODES
59 INTEGER PROCNODE_STEPS(KEEP(28)), POSINRHSCOMP_FWD(N),
60 & POSINRHSCOMP_BWD(N)
61 INTEGER LBUFR, LBUFR_BYTES
62 INTEGER BUFR(LBUFR)
63 INTEGER ISTEP_TO_INIV2(KEEP(71)),
64 & TAB_POS_IN_PERE(SLAVEF+2,max(1,KEEP(56)))
65 INTEGER IBEG_ROOT_DEF, IEND_ROOT_DEF, IROOT_DEF_RHS_COL1
66 INTEGER SIZE_ROOT, MASTER_ROOT
67 INTEGER(8) :: LRHS_ROOT
68 REAL RHS_ROOT(LRHS_ROOT)
69 LOGICAL, intent(in) :: FROM_PP
70 INTEGER, intent(in) :: NZ_RHS, NBCOL_INBLOC, NRHS_ORIG
71 INTEGER, intent(in) :: SIZE_UNS_PERM_INV
72 INTEGER, intent(in) :: SIZE_PERM_RHS
73 INTEGER, intent(in) :: JBEG_RHS
74 INTEGER, intent(in) :: IRHS_SPARSE(NZ_RHS)
75 INTEGER, intent(in) :: IRHS_PTR(NBCOL_INBLOC+1)
76 INTEGER, intent(in) :: PERM_RHS(SIZE_PERM_RHS)
77 INTEGER, intent(in) :: UNS_PERM_INV(SIZE_UNS_PERM_INV)
78 INTEGER, intent(in) :: LStep2node
79 INTEGER, intent(in) :: Step2node(LStep2node)
80 LOGICAL, intent(in) :: DO_NBSPARSE
81 INTEGER, intent(in) :: LRHS_BOUNDS
82 INTEGER, intent(inout) :: RHS_BOUNDS (LRHS_BOUNDS)
83 INTEGER, INTENT (IN) :: LPOOL_B_L0_OMP
84 INTEGER, INTENT (IN) :: IPOOL_B_L0_OMP( LPOOL_B_L0_OMP )
85 INTEGER, INTENT (IN) :: LPOOL_A_L0_OMP
86 INTEGER, INTENT (IN) :: IPOOL_A_L0_OMP( LPOOL_A_L0_OMP )
87 INTEGER, INTENT (IN) :: L_PHYS_L0_OMP
88 INTEGER, INTENT (INOUT) :: PHYS_L0_OMP( L_PHYS_L0_OMP )
89 INTEGER, INTENT (IN) :: L_VIRT_L0_OMP
90 INTEGER, INTENT (IN) :: VIRT_L0_OMP( L_VIRT_L0_OMP )
91 INTEGER, INTENT (IN) :: PERM_L0_OMP( L_PHYS_L0_OMP )
92 INTEGER, INTENT (IN) :: PTR_LEAFS_L0_OMP( L_PHYS_L0_OMP + 1)
93 INTEGER, INTENT (IN) :: LL0_OMP_MAPPING
94 INTEGER, INTENT (IN) :: L0_OMP_MAPPING( LL0_OMP_MAPPING )
95 INTEGER, INTENT (IN) :: LL0_OMP_FACTORS
96 TYPE (SMUMPS_L0OMPFAC_T), INTENT(IN) ::
97 & L0_OMP_FACTORS(LL0_OMP_FACTORS)
98 INTEGER MP, LP, LDIAG
99 INTEGER K,I,II
100 INTEGER allocok
101 INTEGER LPOOL,MYLEAF,MYROOT,NBROOT,LPANEL_POS
102 INTEGER MYLEAF_NOT_PRUNED
103 INTEGER NSTK_S,IPOOL,IPANEL_POS,PTRICB
104 INTEGER MTYPE_LOC
105 INTEGER MODE_RHS_BOUNDS
106 INTEGER IERR
107 INTEGER(8) :: IAPOS
108 INTEGER IOLDPS,
109 & LOCAL_M,
110 & LOCAL_N
111#if defined(V_T)
112 INTEGER soln_c_class, forw_soln, back_soln, root_soln
113#endif
114 LOGICAL DOFORWARD, DOROOT, DOBACKWARD
115 LOGICAL :: DO_L0OMP_FWD, DO_L0OMP_BWD
116 LOGICAL I_WORKED_ON_ROOT, SPECIAL_ROOT_REACHED
117 INTEGER IROOT
118 LOGICAL DOROOT_FWD_OOC, DOROOT_BWD_PANEL
119 LOGICAL SWITCH_OFF_ES
120 LOGICAL DUMMY_BOOL
121 INTEGER :: IDUMMY
122 INTEGER :: NBROOT_UNDER_L0
123 REAL, PARAMETER :: ZERO = 0.0e0
124 include 'mumps_headers.h'
125 INTEGER, DIMENSION(:), ALLOCATABLE :: nodes_RHS
126 INTEGER nb_nodes_RHS
127 INTEGER nb_prun_leaves
128 INTEGER, DIMENSION(:), ALLOCATABLE :: Pruned_Leaves
129 INTEGER, DIMENSION(:), ALLOCATABLE :: Pruned_List
130 INTEGER nb_prun_nodes
131 INTEGER nb_prun_roots, JAM1
132 INTEGER, DIMENSION(:), ALLOCATABLE :: Pruned_SONS, Pruned_Roots
133 INTEGER :: SIZE_TO_PROCESS
134 LOGICAL, DIMENSION(:), ALLOCATABLE :: TO_PROCESS
135 INTEGER ISTEP, INODE_PRINC
136 INTEGER :: INODE, ICHILD
137 LOGICAL AM1, DO_PRUN
138 LOGICAL Exploit_Sparsity
139 LOGICAL DO_NBSPARSE_BWD, PRUN_BELOW_BWD
140 INTEGER :: OOC_FCT_TYPE_TMP
141 INTEGER :: MUMPS_OOC_GET_FCT_TYPE
142 EXTERNAL :: mumps_ooc_get_fct_type
143 DOUBLE PRECISION TIME_FWD,TIME_BWD,TIME_SpecialRoot
144 INTEGER :: nb_sparse
145 INTEGER, EXTERNAL :: MUMPS_PROCNODE
146 LOGICAL, EXTERNAL :: MUMPS_IN_OR_ROOT_SSARBR
147 myleaf = -1
148 lp = icntl(1)
149 mp = icntl(2)
150 ldiag = icntl(4)
151#if defined(V_T)
152 CALL vtclassdef( 'soln_c',soln_c_class,ierr)
153 CALL VTFUNCDEF( 'forw_soln',soln_c_class,forw_soln,ierr)
154 CALL VTFUNCDEF( 'back_soln',soln_c_class,back_soln,ierr)
155 CALL VTFUNCDEF( 'root_soln',soln_c_class,root_soln,ierr)
156#endif
157.NOT. IF ( FROM_PP) THEN
158 CALL MUMPS_SECDEB(TIME_FWD)
159 ENDIF
160 NSTK_S = 1
161 PTRICB = NSTK_S + KEEP(28)
162 IPOOL = PTRICB + KEEP(28)
163 LPOOL = NA(1) + 1
164 IPANEL_POS = IPOOL + LPOOL
165.EQ. IF (KEEP(201)1) THEN
166 LPANEL_POS = KEEP(228)+1
167 ELSE
168 LPANEL_POS = 1
169 ENDIF
170.ne. IF (IPANEL_POS + LPANEL_POS -1 LIW1 ) THEN
171 WRITE(*,*) MYID, ": Internal Error 1 in SMUMPS_SOL_C",
172 & IPANEL_POS, LPANEL_POS, LIW1
173 CALL MUMPS_ABORT()
174 ENDIF
175 DOFORWARD = .TRUE.
176 DOBACKWARD= .TRUE.
177 SPECIAL_ROOT_REACHED = .TRUE.
178 SWITCH_OFF_ES = .FALSE.
179.NE..OR..NE. IF ( KEEP(111)0 KEEP(252)0 ) THEN
180 DOFORWARD = .FALSE.
181 ENDIF
182.eq. IF (KEEP(221)1) DOBACKWARD = .FALSE.
183.eq. IF (KEEP(221)2) DOFORWARD = .FALSE.
184.EQ..AND. IF ( KEEP(60)0
185 & (
186.NE..AND. & (KEEP(38)0 root%yes)
187.OR. &
188.NE..AND..EQ. & (KEEP(20)0 MYID_NODESMASTER_ROOT)
189 & )
190.AND..EQ. & KEEP(252)0
191 & )
192 &THEN
193 DOROOT = .TRUE.
194 ELSE
195 DOROOT = .FALSE.
196 ENDIF
197.AND..NE..AND..EQ. DOROOT_BWD_PANEL = DOROOT MTYPE1 KEEP(50)0
198.AND..EQ. & KEEP(201)1
199.AND..NOT. DOROOT_FWD_OOC = DOROOT DOROOT_BWD_PANEL
200.NE. AM1 = (KEEP(237) 0)
201.NE..AND..NOT. Exploit_Sparsity = (KEEP(235) 0) ( AM1)
202.OR. DO_PRUN = (Exploit_SparsityAM1)
203 IF (FROM_PP) THEN
204 Exploit_Sparsity = .FALSE.
205 DO_PRUN = .FALSE.
206 IF ( AM1 ) THEN
207 WRITE(*,*) "Internal error 2 in SMUMPS_SOL_C"
208 CALL MUMPS_ABORT()
209 ENDIF
210 ENDIF
211.GT..AND..GT. DO_L0OMP_FWD= ( (KEEP(401)0)(KEEP(400)0)
212.AND. & DOFORWARD )
213.AND..EQ. DO_L0OMP_FWD = DO_L0OMP_FWD KEEP(201)0
214.GT..AND..GT. DO_L0OMP_BWD = ( (KEEP(401)0)(KEEP(400)0)
215.AND. & DOBACKWARD )
216.AND..EQ. DO_L0OMP_BWD = DO_L0OMP_BWD KEEP(201)0
217 IF ( DO_PRUN ) THEN
218 ALLOCATE (Pruned_SONS(KEEP(28)), stat=I)
219.GT. IF(I0) THEN
220 INFO(1)=-13
221 INFO(2)=KEEP(28)
222 END IF
223 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
224.LT. IF(INFO(1)0) GOTO 500
225 ENDIF
226 IF ( DO_PRUN
227.OR. & DO_L0OMP_BWD
228 & ) THEN
229 SIZE_TO_PROCESS = KEEP(28)
230 ELSE
231 SIZE_TO_PROCESS = 1
232 ENDIF
233 ALLOCATE (TO_PROCESS(SIZE_TO_PROCESS), stat=I)
234.GT. IF(I0) THEN
235 INFO(1)=-13
236 INFO(2)=KEEP(28)
237 END IF
238 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
239.LT. IF(INFO(1)0) GOTO 500
240.AND. IF ( DOFORWARD DO_PRUN ) THEN
241 nb_prun_nodes = 0
242 nb_prun_roots = 0
243 Pruned_SONS(:) = -1
244 IF ( Exploit_Sparsity ) THEN
245 nb_nodes_RHS = 0
246 DO I = 1, NZ_RHS
247 ISTEP = abs( STEP(IRHS_SPARSE(I)) )
248 INODE_PRINC = Step2node( ISTEP )
249.eq. IF ( Pruned_SONS(ISTEP) -1) THEN
250 nb_nodes_RHS = nb_nodes_RHS +1
251 Pruned_SONS(ISTEP) = 0
252 ENDIF
253 ENDDO
254 ALLOCATE(nodes_RHS(nb_nodes_RHS), STAT = allocok)
255.GT. IF(allocok0) THEN
256 INFO(1)=-13
257 INFO(2)=nb_nodes_RHS
258 END IF
259 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
260.LT. IF(INFO(1)0) GOTO 500
261 nb_nodes_RHS = 0
262 Pruned_SONS = -1
263 DO I = 1, NZ_RHS
264 ISTEP = abs( STEP(IRHS_SPARSE(I)) )
265 INODE_PRINC = Step2node( ISTEP )
266.eq. IF ( Pruned_SONS(ISTEP) -1) THEN
267 nb_nodes_RHS = nb_nodes_RHS +1
268 nodes_RHS(nb_nodes_RHS) = INODE_PRINC
269 Pruned_SONS(ISTEP) = 0
270 ENDIF
271 ENDDO
272 ELSE IF ( AM1 ) THEN
273 nb_nodes_RHS = 0
274 DO I = 1, NBCOL_INBLOC
275.EQ. IF ( (IRHS_PTR(I+1)-IRHS_PTR(I))0) CYCLE
276.NE..OR..NE. IF ( (KEEP(242) 0 ) (KEEP(243)0) ) THEN
277 JAM1 = PERM_RHS(JBEG_RHS+I-1)
278 ELSE
279 JAM1 = JBEG_RHS+I-1
280 ENDIF
281 ISTEP = abs(STEP(JAM1))
282 INODE_PRINC = Step2node(ISTEP)
283.eq. IF ( Pruned_SONS(ISTEP) -1) THEN
284 nb_nodes_RHS = nb_nodes_RHS +1
285 Pruned_SONS(ISTEP) = 0
286 ENDIF
287 ENDDO
288 ALLOCATE(nodes_RHS(nb_nodes_RHS), STAT = allocok)
289.GT. IF(allocok0) THEN
290 INFO(1)=-13
291 INFO(2)=nb_nodes_RHS
292 END IF
293 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
294.LT. IF(INFO(1)0) GOTO 500
295 nb_nodes_RHS = 0
296 Pruned_SONS = -1
297 DO I = 1, NBCOL_INBLOC
298.EQ. IF ( (IRHS_PTR(I+1)-IRHS_PTR(I))0) CYCLE
299.NE..OR..NE. IF ( (KEEP(242) 0 ) (KEEP(243)0) ) THEN
300 JAM1 = PERM_RHS(JBEG_RHS+I-1)
301 ELSE
302 JAM1 = JBEG_RHS+I-1
303 ENDIF
304 ISTEP = abs(STEP(JAM1))
305 INODE_PRINC = Step2node(ISTEP)
306.eq. IF ( Pruned_SONS(ISTEP) -1) THEN
307 nb_nodes_RHS = nb_nodes_RHS +1
308 nodes_RHS(nb_nodes_RHS) = INODE_PRINC
309 Pruned_SONS(ISTEP) = 0
310 ENDIF
311 ENDDO
312 ENDIF
313 CALL SMUMPS_CHAIN_PRUN_NODES(
314 & .FALSE.,
315 & DAD, KEEP(28),
316 & STEP, N,
317 & nodes_RHS, nb_nodes_RHS,
318 & Pruned_SONS, TO_PROCESS,
319 & nb_prun_nodes, nb_prun_roots,
320 & nb_prun_leaves )
321 ALLOCATE(Pruned_List(nb_prun_nodes), STAT=allocok)
322.GT. IF(allocok0) THEN
323 INFO(1)=-13
324 INFO(2)=nb_prun_nodes
325 END IF
326 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
327.LT. IF(INFO(1)0) GOTO 500
328 ALLOCATE(Pruned_Roots(nb_prun_roots), STAT=allocok)
329.GT. IF(allocok0) THEN
330 INFO(1)=-13
331 INFO(2)=nb_prun_roots
332 END IF
333 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
334.LT. IF(INFO(1)0) GOTO 500
335 ALLOCATE(Pruned_Leaves(nb_prun_leaves), STAT=allocok)
336.GT. IF(allocok0) THEN
337 INFO(1)=-13
338 INFO(2)=nb_prun_leaves
339 END IF
340 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
341.LT. IF(INFO(1)0) GOTO 500
342 CALL SMUMPS_CHAIN_PRUN_NODES(
343 & .TRUE.,
344 & DAD, KEEP(28),
345 & STEP, N,
346 & nodes_RHS, nb_nodes_RHS,
347 & Pruned_SONS, TO_PROCESS,
348 & nb_prun_nodes, nb_prun_roots, nb_prun_leaves,
349 & Pruned_List, Pruned_Roots, Pruned_Leaves )
350 IF(allocated(nodes_RHS)) DEALLOCATE(nodes_RHS)
351 CALL SMUMPS_OOC_SET_STATES_ES(N,
352 & KEEP(201), Pruned_List, nb_prun_nodes,
353 & STEP)
354.GT. IF ( KEEP(201) 0) THEN
355 OOC_FCT_TYPE_TMP=MUMPS_OOC_GET_FCT_TYPE
356 & ('f',MTYPE,KEEP(201),KEEP(50))
357 ELSE
358 OOC_FCT_TYPE_TMP = -5959
359 ENDIF
360 CALL SMUMPS_CHAIN_PRUN_NODES_STATS(
361 & MYID_NODES, N, KEEP(28), KEEP(201), KEEP(485),
362 & KEEP8(31)+KEEP8(64),
363 & STEP, Pruned_List, nb_prun_nodes, OOC_FCT_TYPE_TMP
364 & )
365 IF (DO_NBSPARSE) THEN
366 nb_sparse = max(1,KEEP(497))
367 MODE_RHS_BOUNDS = 0
368 IF (Exploit_Sparsity) MODE_RHS_BOUNDS = 2
369 CALL SMUMPS_INITIALIZE_RHS_BOUNDS(
370 & STEP, N,
371 & IRHS_PTR, NBCOL_INBLOC, IRHS_SPARSE, NZ_RHS,
372 & JBEG_RHS, PERM_RHS, SIZE_PERM_RHS, KEEP(242), KEEP(243),
373 & UNS_PERM_INV, SIZE_UNS_PERM_INV, KEEP(23),
374 & RHS_BOUNDS, KEEP(28),
375 & nb_sparse, MYID_NODES,
376 & MODE_RHS_BOUNDS)
377 CALL SMUMPS_PROPAGATE_RHS_BOUNDS(
378 & Pruned_Leaves, nb_prun_leaves,
379 & STEP, N, Pruned_SONS,
380 & DAD, RHS_BOUNDS, KEEP(28),
381 & MYID_NODES, COMM_NODES, KEEP(485),
382 & IW, LIW, PTRIST,KEEP(IXSZ),OOC_FCT_TYPE_TMP,0,
383 & KEEP(50), KEEP(38))
384 END IF
385 SPECIAL_ROOT_REACHED = .FALSE.
386 DO I= 1, nb_prun_roots
387.EQ..OR. IF ( (Pruned_Roots(I)KEEP(38))
388.EQ. & (Pruned_Roots(I)KEEP(20)) ) THEN
389 SPECIAL_ROOT_REACHED = .TRUE.
390 EXIT
391 ENDIF
392 ENDDO
393 DEALLOCATE(Pruned_List)
394 ENDIF
395.GT. IF (KEEP(201)0) THEN
396.OR. IF (DOFORWARD DOROOT_FWD_OOC) THEN
397 CALL SMUMPS_SOLVE_INIT_OOC_FWD(PTRFAC,KEEP(28),MTYPE,
398 & A,LA,DOFORWARD,IERR)
399.LT. IF(IERR0)THEN
400 INFO(1)=IERR
401 INFO(2)=0
402 CALL MUMPS_ABORT()
403 ENDIF
404 ENDIF
405 ENDIF
406 IF (DOFORWARD) THEN
407.eq. IF ( KEEP( 50 ) 0 ) THEN
408 MTYPE_LOC = MTYPE
409 ELSE
410 MTYPE_LOC = 1
411 ENDIF
412#if defined(V_T)
413 CALL VTBEGIN(forw_soln,ierr)
414#endif
415.NOT. IF ( DO_PRUN ) THEN
416 CALL MUMPS_INIT_NROOT_DIST(N, NBROOT, MYROOT, MYID_NODES,
417 & SLAVEF, NA, LNA, KEEP, STEP, PROCNODE_STEPS)
418 DO ISTEP =1, KEEP(28)
419 IW1(NSTK_S+ISTEP-1) = NE_STEPS(ISTEP)
420 ENDDO
421 ELSE
422 CALL MUMPS_NBLOCAL_ROOTS_OR_LEAVES( N,
423 & nb_prun_roots, Pruned_Roots,
424 & MYROOT, MYID_NODES, SLAVEF, KEEP, STEP,
425 & PROCNODE_STEPS )
426 IF (AM1) THEN
427 DEALLOCATE(Pruned_Roots)
428 END IF
429.AND..EQ. IF ((Exploit_Sparsity)(nb_prun_rootsNA(2))) THEN
430 DEALLOCATE(Pruned_Roots)
431 SWITCH_OFF_ES = .TRUE.
432 ENDIF
433 DO ISTEP = 1, KEEP(28)
434 IW1(NSTK_S+ISTEP-1) = Pruned_SONS(ISTEP)
435 ENDDO
436 ENDIF
437 IF ( DO_L0OMP_FWD ) THEN
438 CALL SMUMPS_SOL_L0OMP_R( N, MTYPE_LOC, NRHS, LIW, IW,
439 & IW1(PTRICB), RHSCOMP, LRHSCOMP, POSINRHSCOMP_FWD,
440 & STEP, FRERE, DAD, FILS, IW1(NSTK_S),
441 & PTRIST, PTRFAC, INFO,
442 & KEEP, KEEP8, DKEEP, PROCNODE_STEPS, SLAVEF,
443 & COMM_NODES, MYID_NODES,
444 & BUFR, LBUFR, LBUFR_BYTES,
445 & RHS_ROOT, LRHS_ROOT,
446 & ISTEP_TO_INIV2, TAB_POS_IN_PERE,
447 & RHS_BOUNDS, LRHS_BOUNDS, DO_NBSPARSE,
448 & FROM_PP,
449 & NBROOT_UNDER_L0,
450 & LPOOL_B_L0_OMP, IPOOL_B_L0_OMP,
451 & L_VIRT_L0_OMP, VIRT_L0_OMP,
452 & L_PHYS_L0_OMP, PHYS_L0_OMP,
453 & PERM_L0_OMP, PTR_LEAFS_L0_OMP,
454 & L0_OMP_MAPPING, LL0_OMP_MAPPING,
455 & L0_OMP_FACTORS, LL0_OMP_FACTORS,
456 & DO_PRUN, TO_PROCESS
457 & )
458 MYROOT = MYROOT - NBROOT_UNDER_L0
459 IF ( DO_PRUN ) THEN
460 MYLEAF_NOT_PRUNED = IPOOL_A_L0_OMP(LPOOL_A_L0_OMP)
461 DO I=1, MYLEAF_NOT_PRUNED
462 IF ( TO_PROCESS( STEP( IPOOL_A_L0_OMP(I) ))) THEN
463 IW1(IPOOL+MYLEAF-1) = IPOOL_A_L0_OMP(I)
464 IW1(NSTK_S+STEP(IPOOL_A_L0_OMP(I))-1) = -99
465 ENDIF
466 ENDDO
467 DO I = 1, nb_prun_leaves
468 INODE = Pruned_Leaves(I)
469 IF ( MUMPS_PROCNODE(PROCNODE_STEPS(STEP(INODE)),KEEP(199))
470.EQ. & MYID_NODES ) THEN
471.EQ. IF (L0_OMP_MAPPING( STEP(INODE) ) 0) THEN
472 IW1(NSTK_S+STEP(INODE)-1) = -99
473 ENDIF
474 ENDIF
475 ENDDO
476 DO I = 1, L_PHYS_L0_OMP
477 INODE = DAD(STEP(PHYS_L0_OMP(I)))
478.NE. IF (INODE 0) THEN
479 IF ( TO_PROCESS( STEP( INODE ))) THEN
480.EQ. IF ( IW1(NSTK_S+STEP(INODE)-1) 0 ) THEN
481 IW1(NSTK_S+STEP(INODE)-1) = -99
482 ENDIF
483 ENDIF
484 ENDIF
485 ENDDO
486 MYLEAF = 0
487 DO ISTEP = KEEP(28), 1, -1
488 INODE=Step2Node(ISTEP)
489.EQ. IF (IW1(NSTK_S+STEP(INODE)-1)-99) THEN
490 MYLEAF = MYLEAF + 1
491 IW1(IPOOL+MYLEAF-1) = INODE
492 IW1(NSTK_S+STEP(INODE)-1) = 0
493 ENDIF
494 ENDDO
495 DEALLOCATE(Pruned_Leaves)
496 ELSE
497 MYLEAF = IPOOL_A_L0_OMP(LPOOL_A_L0_OMP)
498 DO I=1, MYLEAF
499 IW1(IPOOL+I-1) = IPOOL_A_L0_OMP(I)
500 ENDDO
501 ENDIF
502 ELSE
503 IF ( DO_PRUN ) THEN
504 CALL MUMPS_INIT_POOL_DIST_NONA( N, MYLEAF, MYID_NODES,
505 & nb_prun_leaves, Pruned_Leaves, KEEP, KEEP8,
506 & STEP, PROCNODE_STEPS, IW1(IPOOL), LPOOL )
507 MYLEAF = MYLEAF - 1
508 DEALLOCATE(Pruned_Leaves)
509 ELSE
510 CALL MUMPS_INIT_POOL_DIST( N, MYLEAF, MYID_NODES,
511 & SLAVEF, NA, LNA, KEEP, KEEP8, STEP,
512 & PROCNODE_STEPS, IW1(IPOOL), LPOOL )
513 MYLEAF = MYLEAF - 1
514 ENDIF
515 ENDIF
516 CALL SMUMPS_SOL_R(N, A(1), LA, IW(1), LIW, W(1),
517 & LWC, NRHS,
518 & IW1(PTRICB), IWCB, LIWW,
519 & RHSCOMP,LRHSCOMP,POSINRHSCOMP_FWD,
520 & STEP, FRERE,DAD,FILS,
521 & IW1(NSTK_S),IW1(IPOOL),LPOOL,PTRIST,PTRFAC,
522 & MYLEAF, MYROOT, INFO,
523 & KEEP, KEEP8, DKEEP,
524 & PROCNODE_STEPS, SLAVEF, COMM_NODES, MYID_NODES,
525 & BUFR, LBUFR, LBUFR_BYTES,
526 & RHS_ROOT, LRHS_ROOT, MTYPE_LOC,
527 &
528 & ISTEP_TO_INIV2, TAB_POS_IN_PERE
529 & , RHS_BOUNDS, LRHS_BOUNDS, DO_NBSPARSE, FROM_PP
530 & , L0_OMP_MAPPING, LL0_OMP_MAPPING,
531 & L0_OMP_FACTORS, LL0_OMP_FACTORS
532 & )
533 IF (DO_PRUN) THEN
534 MYLEAF = -1
535 ENDIF
536#if defined(V_T)
537 CALL VTEND(forw_soln,ierr)
538#endif
539 ENDIF
540 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
541.LT. IF ( INFO(1) 0 ) THEN
542.GT. IF ( LP 0 ) THEN
543 WRITE(LP,*) MYID,
544 & ': ** error RETURN from smumps_sol_r,info(1:2)=',
545 & INFO(1:2)
546 END IF
547 GOTO 500
548 END IF
549 CALL MPI_BARRIER( COMM_NODES, IERR )
550.NOT. IF (FROM_PP) THEN
551 CALL MUMPS_SECFIN(TIME_FWD)
552 DKEEP(117)=real(TIME_FWD) + DKEEP(117)
553 ENDIF
554.AND. IF (DO_PRUNSWITCH_OFF_ES) THEN
555 DO_PRUN = .FALSE.
556 Exploit_Sparsity = .FALSE.
557.NOT. IF ( DO_L0OMP_BWD ) THEN
558.AND..NE. IF ( allocated(TO_PROCESS) SIZE_TO_PROCESS1 ) THEN
559 DEALLOCATE (TO_PROCESS)
560 SIZE_TO_PROCESS = 1
561 ALLOCATE(TO_PROCESS(SIZE_TO_PROCESS),stat=I)
562 ENDIF
563 ENDIF
564 ENDIF
565.AND. IF ( DOBACKWARD DO_PRUN ) THEN
566 nb_prun_leaves = 0
567.AND..EQ. IF ( Exploit_Sparsity (KEEP(111)0) ) THEN
568 nb_nodes_RHS = nb_prun_roots
569 ALLOCATE(nodes_RHS(nb_nodes_RHS), STAT = allocok)
570.GT. IF(allocok0) THEN
571 WRITE(*,*)'problem with allocation of nodes_rhs'
572 INFO(1) = -13
573 INFO(2) = nb_nodes_RHS
574 CALL MUMPS_ABORT()
575 END IF
576 nodes_RHS(1:nb_prun_roots)=Pruned_Roots(1:nb_prun_roots)
577 DEALLOCATE(Pruned_Roots)
578 ELSE
579 nb_nodes_RHS = 0
580 Pruned_SONS(:) = -1
581 DO II = 1, NZ_RHS
582 I = IRHS_SPARSE(II)
583.NE. IF (KEEP(23)0) I = UNS_PERM_INV(I)
584 ISTEP = abs(STEP(I))
585.eq. IF ( Pruned_SONS(ISTEP) -1) THEN
586 nb_nodes_RHS = nb_nodes_RHS +1
587 Pruned_SONS(ISTEP) = 0
588 ENDIF
589 ENDDO
590 ALLOCATE(nodes_RHS(nb_nodes_RHS), STAT = allocok)
591.GT. IF(allocok0) THEN
592 WRITE(*,*)'problem with allocation of nodes_rhs'
593 INFO(1) = -13
594 INFO(2) = nb_nodes_RHS
595 CALL MUMPS_ABORT()
596 END IF
597 nb_nodes_RHS = 0
598 Pruned_SONS(:) = -1
599 DO II = 1, NZ_RHS
600 I = IRHS_SPARSE(II)
601.NE. IF (KEEP(23)0) I = UNS_PERM_INV(I)
602 ISTEP = abs(STEP(I))
603 INODE_PRINC = Step2node(ISTEP)
604.eq. IF ( Pruned_SONS(ISTEP) -1) THEN
605 nb_nodes_RHS = nb_nodes_RHS +1
606 nodes_RHS(nb_nodes_RHS) = INODE_PRINC
607 Pruned_SONS(ISTEP) = 0
608 ENDIF
609 ENDDO
610 ENDIF
611 IF ( Exploit_Sparsity ) THEN
612 CALL SMUMPS_TREE_PRUN_NODES(
613 & .FALSE.,
614 & DAD, NE_STEPS, FRERE, KEEP(28),
615 & FILS, STEP, N,
616 & nodes_RHS, nb_nodes_RHS,
617 & TO_PROCESS,
618 & nb_prun_nodes, nb_prun_roots, nb_prun_leaves
619 & )
620 ALLOCATE(Pruned_List(nb_prun_nodes), STAT=allocok)
621.GT. IF(allocok0) THEN
622 INFO(1)=-13
623 INFO(2)=nb_prun_nodes
624 END IF
625 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
626.LT. IF(INFO(1)0) GOTO 500
627 ALLOCATE(Pruned_Roots(nb_prun_roots), STAT=allocok)
628.GT. IF(allocok0) THEN
629 INFO(1)=-13
630 INFO(2)=nb_prun_roots
631 END IF
632 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
633.LT. IF(INFO(1)0) GOTO 500
634 ALLOCATE(Pruned_Leaves(nb_prun_leaves), STAT=allocok)
635.GT. IF(allocok0) THEN
636 INFO(1)=-13
637 INFO(2)=nb_prun_leaves
638 END IF
639 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
640.LT. IF(INFO(1)0) GOTO 500
641 CALL SMUMPS_TREE_PRUN_NODES(
642 & .TRUE.,
643 & DAD, NE_STEPS, FRERE, KEEP(28),
644 & FILS, STEP, N,
645 & nodes_RHS, nb_nodes_RHS,
646 & TO_PROCESS,
647 & nb_prun_nodes, nb_prun_roots, nb_prun_leaves,
648 & Pruned_List, Pruned_Roots, Pruned_Leaves
649 & )
650 CALL SMUMPS_OOC_SET_STATES_ES(N,
651 & KEEP(201), Pruned_List, nb_prun_nodes,
652 & STEP)
653 IF(allocated(nodes_RHS)) DEALLOCATE(nodes_RHS)
654.GT. IF (KEEP(201)0) THEN
655 OOC_FCT_TYPE_TMP=MUMPS_OOC_GET_FCT_TYPE
656 & ('b',MTYPE,KEEP(201),KEEP(50))
657 ELSE
658 OOC_FCT_TYPE_TMP = -5959
659 ENDIF
660 CALL SMUMPS_TREE_PRUN_NODES_STATS(
661 & MYID_NODES, N, KEEP(28), KEEP(201),
662 & KEEP8(31)+KEEP8(64),
663 & STEP,
664 & Pruned_List,
665 & nb_prun_nodes, OOC_FCT_TYPE_TMP)
666 ENDIF
667 ENDIF
668.EQ..AND. IF(KEEP(201)1DOROOT_BWD_PANEL) THEN
669 I_WORKED_ON_ROOT = .FALSE.
670 CALL SMUMPS_SOLVE_INIT_OOC_BWD(PTRFAC,KEEP(28),MTYPE,
671 & I_WORKED_ON_ROOT, IROOT, A, LA, IERR)
672.LT. IF (IERR 0) THEN
673 INFO(1) = -90
674 INFO(2) = IERR
675 ENDIF
676 ENDIF
677.EQ. IF (KEEP(201)1) THEN
678 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
679.LT. IF ( INFO(1) 0 ) GOTO 500
680 ENDIF
681.NE..AND..EQ. IF (KEEP(60)0 KEEP(221)0
682.AND..EQ. & MYID_NODES MASTER_ROOT) THEN
683 RHS_ROOT(1:NRHS*SIZE_ROOT) = ZERO
684 ENDIF
685.NOT. IF ( FROM_PP) THEN
686 CALL MUMPS_SECDEB(TIME_SpecialRoot)
687 ENDIF
688.NE..AND. IF ( ( KEEP( 38 ) 0 ) SPECIAL_ROOT_REACHED ) THEN
689.EQ..AND..EQ. IF ( KEEP(60) 0 KEEP(252) 0 ) THEN
690 IF ( root%yes ) THEN
691.GT. IF (KEEP(201)0) THEN
692.AND..NE..and. IF ( (Exploit_Sparsity(KEEP(111)0))
693.eq. & (OOC_STATE_NODE(STEP(KEEP(38)))-6) ) THEN
694 GOTO 1010
695 ENDIF
696 ENDIF
697 IOLDPS = PTRIST(STEP(KEEP(38)))
698 LOCAL_M = IW( IOLDPS + 2 + KEEP(IXSZ))
699 LOCAL_N = IW( IOLDPS + 1 + KEEP(IXSZ))
700.GT. IF (KEEP(201)0) THEN
701 CALL SMUMPS_SOLVE_GET_OOC_NODE(
702 & KEEP(38),PTRFAC,KEEP,A,LA,
703 & STEP,KEEP8,N,DUMMY_BOOL,IERR)
704.LT. IF(IERR0)THEN
705 INFO(1)=IERR
706 INFO(2)=0
707 WRITE(*,*) '** error after smumps_solve_get_ooc_node',
708 & INFO(1)
709 call MUMPS_ABORT()
710 ENDIF
711 ENDIF
712 IAPOS = PTRFAC(IW( IOLDPS + 4 + KEEP(IXSZ)))
713.EQ. IF (LOCAL_M * LOCAL_N 0) THEN
714 IAPOS = min(IAPOS, LA)
715 ENDIF
716#if defined(V_T)
717 CALL VTBEGIN(root_soln,ierr)
718#endif
719 CALL SMUMPS_ROOT_SOLVE( NRHS, root%DESCRIPTOR(1),
720 & root%CNTXT_BLACS, LOCAL_M, LOCAL_N,
721 & root%MBLOCK, root%NBLOCK,
722 & root%IPIV(1), root%LPIV, MASTER_ROOT, MYID_NODES,
723 & COMM_NODES,
724 & RHS_ROOT(1),
725 & root%TOT_ROOT_SIZE, A( IAPOS ),
726 & INFO(1), MTYPE, KEEP(50), FROM_PP)
727.GT. IF(KEEP(201)0)THEN
728 CALL SMUMPS_FREE_FACTORS_FOR_SOLVE(KEEP(38),
729 & PTRFAC,KEEP(28),A,LA,.FALSE.,IERR)
730.LT. IF(IERR0)THEN
731 INFO(1)=IERR
732 INFO(2)=0
733 WRITE(*,*)
734 & '** error after smumps_free_factors_for_solve ',
735 & INFO(1)
736 call MUMPS_ABORT()
737 ENDIF
738 ENDIF
739 ENDIF
740 ENDIF
741.NE..AND. ELSE IF ( ( KEEP(20) 0) SPECIAL_ROOT_REACHED ) THEN
742.eq. IF ( MYID_NODES MASTER_ROOT ) THEN
743 END IF
744 END IF
745.NOT. IF (FROM_PP) THEN
746 CALL MUMPS_SECFIN(TIME_SpecialRoot)
747 DKEEP(119)=real(TIME_SpecialRoot) + DKEEP(119)
748 ENDIF
749#if defined(V_T)
750 CALL VTEND(root_soln,ierr)
751#endif
752 1010 CONTINUE
753 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
754.LT. IF ( INFO(1) 0 ) RETURN
755 IF (DOBACKWARD) THEN
756.GT..AND..NOT. IF ( KEEP(201)0 DOROOT_BWD_PANEL )
757 & THEN
758 I_WORKED_ON_ROOT = DOROOT
759.gt. IF (KEEP(38)0 ) THEN
760.AND..EQ. IF ( ( Exploit_Sparsity(KEEP(111)0) )
761.OR. & AM1 ) THEN
762.eq. IF (OOC_STATE_NODE(STEP(KEEP(38)))-6) THEN
763 OOC_STATE_NODE(STEP(KEEP(38)))=-4
764 ENDIF
765 ENDIF
766.AND..NE. IF (Exploit_Sparsity(KEEP(111)0)) THEN
767.eq. IF (OOC_STATE_NODE(STEP(KEEP(38)))-6) THEN
768 I_WORKED_ON_ROOT = .FALSE.
769 ENDIF
770 ENDIF
771 ENDIF
772 ENDIF
773.NOT. IF (AM1) THEN
774 DO_NBSPARSE_BWD = .FALSE.
775 ELSE
776 DO_NBSPARSE_BWD = DO_NBSPARSE
777 ENDIF
778 PRUN_BELOW_BWD = AM1
779.OR. PRUN_BELOW_BWD = PRUN_BELOW_BWD DO_L0OMP_BWD
780 IF ( AM1 ) THEN
781 CALL SMUMPS_CHAIN_PRUN_NODES(
782 & .FALSE.,
783 & DAD, KEEP(28),
784 & STEP, N,
785 & nodes_RHS, nb_nodes_RHS,
786 & Pruned_SONS, TO_PROCESS,
787 & nb_prun_nodes, nb_prun_roots,
788 & nb_prun_leaves)
789 ALLOCATE(Pruned_List(nb_prun_nodes), STAT=allocok)
790.GT. IF(allocok0) THEN
791 INFO(1)=-13
792 INFO(2)=nb_prun_nodes
793 END IF
794 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
795.LT. IF(INFO(1)0) GOTO 500
796 ALLOCATE(Pruned_Roots(nb_prun_roots), STAT=allocok)
797.GT. IF(allocok0) THEN
798 INFO(1)=-13
799 INFO(2)=nb_prun_roots
800 END IF
801 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
802.LT. IF(INFO(1)0) GOTO 500
803 ALLOCATE(Pruned_Leaves(nb_prun_leaves), STAT=allocok)
804.GT. IF(allocok0) THEN
805 INFO(1)=-13
806 INFO(2)=nb_prun_leaves
807 END IF
808 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
809.LT. IF(INFO(1)0) GOTO 500
810 CALL SMUMPS_CHAIN_PRUN_NODES(
811 & .TRUE.,
812 & DAD, KEEP(28),
813 & STEP, N,
814 & nodes_RHS, nb_nodes_RHS,
815 & Pruned_SONS, TO_PROCESS,
816 & nb_prun_nodes, nb_prun_roots, nb_prun_leaves,
817 & Pruned_List, Pruned_Roots, Pruned_Leaves )
818 CALL SMUMPS_OOC_SET_STATES_ES(N,
819 & KEEP(201), Pruned_List, nb_prun_nodes,
820 & STEP)
821.GT. IF (KEEP(201)0) THEN
822 OOC_FCT_TYPE_TMP=MUMPS_OOC_GET_FCT_TYPE
823 & ('b',MTYPE,KEEP(201),KEEP(50))
824 ELSE
825 OOC_FCT_TYPE_TMP = -5959
826 ENDIF
827 CALL SMUMPS_CHAIN_PRUN_NODES_STATS(
828 & MYID_NODES, N, KEEP(28), KEEP(201), KEEP(485), KEEP8(31),
829 & STEP, Pruned_List, nb_prun_nodes, OOC_FCT_TYPE_TMP
830 & )
831 IF (DO_NBSPARSE_BWD) THEN
832 nb_sparse = max(1,KEEP(497))
833 CALL SMUMPS_INITIALIZE_RHS_BOUNDS(
834 & STEP, N,
835 & IRHS_PTR, NBCOL_INBLOC, IRHS_SPARSE, NZ_RHS,
836 & JBEG_RHS, PERM_RHS, SIZE_PERM_RHS, KEEP(242), KEEP(243),
837 & UNS_PERM_INV, SIZE_UNS_PERM_INV, KEEP(23),
838 & RHS_BOUNDS, KEEP(28),
839 & nb_sparse, MYID_NODES,
840 & 1)
841 CALL SMUMPS_PROPAGATE_RHS_BOUNDS(
842 & Pruned_Leaves, nb_prun_leaves,
843 & STEP, N, Pruned_SONS,
844 & DAD, RHS_BOUNDS, KEEP(28),
845 & MYID_NODES, COMM_NODES, KEEP(485),
846 & IW, LIW, PTRIST,KEEP(IXSZ),OOC_FCT_TYPE_TMP,1,
847 & KEEP(50), KEEP(38))
848 END IF
849 ENDIF
850.GT. IF ( KEEP(201)0 ) THEN
851 IROOT = max(KEEP(20),KEEP(38))
852 CALL SMUMPS_SOLVE_INIT_OOC_BWD(PTRFAC,KEEP(28),MTYPE,
853 & I_WORKED_ON_ROOT, IROOT, A, LA, IERR)
854 ENDIF
855.eq. IF ( KEEP( 50 ) 0 ) THEN
856 MTYPE_LOC = MTYPE
857 ELSE
858 MTYPE_LOC = 0
859 ENDIF
860#if defined(V_T)
861 CALL VTBEGIN(back_soln,ierr)
862#endif
863.NOT. IF (FROM_PP) THEN
864 CALL MUMPS_SECDEB(TIME_BWD)
865 ENDIF
866.NOT. IF ( SPECIAL_ROOT_REACHED ) THEN
867 RHS_ROOT(1:NRHS*SIZE_ROOT) = ZERO
868 ENDIF
869.AND..NE. IF (AM1(NB_FS_IN_RHSCOMP_FNB_FS_IN_RHSCOMP_TOT)) THEN
870 DO I =1, N
871 II = POSINRHSCOMP_BWD(I)
872.GT..AND..GT. IF ((II0)(IINB_FS_IN_RHSCOMP_F)) THEN
873 DO K=1,NRHS
874 RHSCOMP(II, K) = ZERO
875 ENDDO
876 ENDIF
877 ENDDO
878 ENDIF
879.NOT. IF ( DO_PRUN ) THEN
880.NOT. IF ( DO_L0OMP_BWD ) THEN
881 IF (DO_L0OMP_FWD) THEN
882 MYLEAF = -1
883 ENDIF
884 ENDIF
885 IF ( DO_L0OMP_BWD ) THEN
886 TO_PROCESS(:) = .TRUE.
887 DO I=1, L_PHYS_L0_OMP
888 TO_PROCESS( STEP(PHYS_L0_OMP( I )))
889 & = .FALSE.
890 ENDDO
891.EQ. IF (MYLEAF -1) THEN
892 MYLEAF = IPOOL_A_L0_OMP(LPOOL_A_L0_OMP)
893 ENDIF
894 CALL MUMPS_INIT_POOL_DIST_NA_BWD_L0( N, MYROOT, MYID_NODES,
895 & NA, LNA, KEEP, KEEP8, STEP, PROCNODE_STEPS,
896 & IW1(IPOOL), LPOOL, L0_OMP_MAPPING )
897 ELSE
898 CALL MUMPS_INIT_POOL_DIST_NA_BWD( N, MYROOT, MYID_NODES,
899 & NA, LNA, KEEP, KEEP8, STEP, PROCNODE_STEPS,
900 & IW1(IPOOL), LPOOL )
901.EQ. IF (MYLEAF -1) THEN
902 CALL MUMPS_NBLOCAL_ROOTS_OR_LEAVES( N,
903 & NA(1),
904 & NA(3),
905 & MYLEAF, MYID_NODES, SLAVEF, KEEP, STEP,
906 & PROCNODE_STEPS )
907 ENDIF
908 ENDIF
909 ELSE
910 IF ( DO_L0OMP_BWD ) THEN
911 DO I=1, L_PHYS_L0_OMP
912 IF ( TO_PROCESS( STEP(PHYS_L0_OMP( I ))) ) THEN
913 TO_PROCESS( STEP(PHYS_L0_OMP( I ))) = .FALSE.
914 PHYS_L0_OMP( I ) = -PHYS_L0_OMP( I )
915 ENDIF
916 ENDDO
917 MYLEAF=0
918 DO ISTEP = 1, KEEP(28)
919 IF ( MUMPS_PROCNODE(PROCNODE_STEPS(ISTEP),KEEP(199))
920.NE. & MYID_NODES ) THEN
921 CYCLE
922 ENDIF
923.NE. IF ( L0_OMP_MAPPING( ISTEP ) 0 ) THEN
924 CYCLE
925 ENDIF
926.NOT. IF ( TO_PROCESS( ISTEP ) ) THEN
927 CYCLE
928 ENDIF
929 I = Step2Node( ISTEP )
930 ICHILD = FILS ( I )
931.GT. DO WHILE ( ICHILD 0 )
932 ICHILD = FILS( ICHILD )
933 END DO
934.LT. IF ( ICHILD 0 ) THEN
935 ICHILD = -ICHILD
936.GT. DO WHILE ( ICHILD 0 )
937.EQ..AND. IF ( L0_OMP_MAPPING( STEP( ICHILD ) ) 0
938 & TO_PROCESS(STEP( ICHILD )) ) THEN
939 GOTO 10
940 ENDIF
941 ICHILD = FRERE( STEP( ICHILD ) )
942 ENDDO
943 ENDIF
944 MYLEAF = MYLEAF + 1
945 10 CONTINUE
946 ENDDO
947 CALL MUMPS_INIT_POOL_DIST_NA_BWDL0ES( N, MYROOT,
948 & MYID_NODES,
949 & NA, LNA, KEEP, KEEP8, STEP, PROCNODE_STEPS,
950 & IW1(IPOOL), LPOOL, L0_OMP_MAPPING, TO_PROCESS )
951 ELSE
952 CALL MUMPS_INIT_POOL_DIST_BWD(N, nb_prun_roots,
953 & Pruned_Roots,
954 & MYROOT, MYID_NODES, KEEP, KEEP8, STEP, PROCNODE_STEPS,
955 & IW1(IPOOL), LPOOL)
956 CALL MUMPS_NBLOCAL_ROOTS_OR_LEAVES( N,
957 & nb_prun_leaves, Pruned_Leaves,
958 & MYLEAF, MYID_NODES, SLAVEF, KEEP, STEP,
959 & PROCNODE_STEPS )
960 ENDIF
961 ENDIF
962 IF ( DO_L0OMP_BWD
963 & ) THEN
964 KEEP(31) = 1
965 ELSE
966 KEEP(31) = 0
967 ENDIF
968.EQ. IF (KEEP(31) 1) THEN
969 DO I = 1, KEEP(28)
970.EQ. IF (MUMPS_PROCNODE(PROCNODE_STEPS(I),KEEP(199))
971 & MYID_NODES) THEN
972.NOT. IF ( MUMPS_IN_OR_ROOT_SSARBR(PROCNODE_STEPS(I),
973 & KEEP(199)) ) THEN
974.EQ. IF ( L0_OMP_MAPPING(I) 0 ) THEN
975 IF ( DO_PRUN
976.OR. & DO_L0OMP_BWD
977 & ) THEN
978 IF ( TO_PROCESS(I) ) THEN
979 KEEP(31) = KEEP(31) + 1
980 ENDIF
981 ELSE
982 KEEP(31) = KEEP(31) + 1
983 ENDIF
984 ENDIF
985 ENDIF
986 ENDIF
987 ENDDO
988 ENDIF
989 CALL SMUMPS_SOL_S( N, A, LA, IW, LIW, W(1), LWC,
990 & NRHS,
991 & RHSCOMP, LRHSCOMP, POSINRHSCOMP_BWD,
992 & IW1(PTRICB),PTRACB,IWCB,LIWW, W2,
993 & NE_STEPS,
994 & STEP, FRERE,DAD,FILS,
995 & IW1(IPOOL),LPOOL,PTRIST,PTRFAC,MYLEAF,MYROOT,ICNTL,INFO,
996 & PROCNODE_STEPS, SLAVEF, COMM_NODES, MYID_NODES,
997 & BUFR, LBUFR, LBUFR_BYTES, KEEP, KEEP8, DKEEP,
998 & RHS_ROOT, LRHS_ROOT,
999 & MTYPE_LOC,
1000 & ISTEP_TO_INIV2, TAB_POS_IN_PERE, IW1(IPANEL_POS),
1001 & LPANEL_POS, PRUN_BELOW_BWD, TO_PROCESS, SIZE_TO_PROCESS
1002 & , RHS_BOUNDS, LRHS_BOUNDS, DO_NBSPARSE_BWD
1003 & , FROM_PP
1004 & , L0_OMP_MAPPING, LL0_OMP_MAPPING,
1005 & L0_OMP_FACTORS, LL0_OMP_FACTORS
1006 & )
1007.AND. IF ( DO_L0OMP_BWD DO_PRUN ) THEN
1008 DO I = 1, L_PHYS_L0_OMP
1009.LT. IF ( PHYS_L0_OMP( I ) 0 ) THEN
1010 PHYS_L0_OMP( I ) = -PHYS_L0_OMP( I )
1011 TO_PROCESS(STEP(PHYS_L0_OMP( I ) )) = .TRUE.
1012 ENDIF
1013 ENDDO
1014 ENDIF
1015.AND..GE. IF (DO_L0OMP_BWD INFO(1) 0) THEN
1016 KEEP(31) = 0
1017 PRUN_BELOW_BWD = AM1
1018 CALL SMUMPS_SOL_L0OMP_S(N, MTYPE_LOC, NRHS, LIW, IW,
1019 & IW1(PTRICB), PTRACB, RHSCOMP, LRHSCOMP, POSINRHSCOMP_BWD,
1020 & STEP, FRERE, FILS, NE_STEPS, PTRIST, PTRFAC, INFO,
1021 & KEEP, KEEP8, DKEEP, PROCNODE_STEPS, SLAVEF,
1022 & COMM_NODES, MYID_NODES, BUFR, LBUFR, LBUFR_BYTES,
1023 & RHS_ROOT, LRHS_ROOT, ISTEP_TO_INIV2, TAB_POS_IN_PERE,
1024 & IW1(IPANEL_POS), LPANEL_POS,
1025 & PRUN_BELOW_BWD, TO_PROCESS, SIZE_TO_PROCESS,
1026 & RHS_BOUNDS, LRHS_BOUNDS, DO_NBSPARSE_BWD,
1027 & FROM_PP,
1028 & LPOOL_B_L0_OMP,
1029 & L_VIRT_L0_OMP, VIRT_L0_OMP,
1030 & L_PHYS_L0_OMP, PHYS_L0_OMP,
1031 & PERM_L0_OMP, PTR_LEAFS_L0_OMP,
1032 & L0_OMP_MAPPING, LL0_OMP_MAPPING,
1033 & L0_OMP_FACTORS, LL0_OMP_FACTORS )
1034 ENDIF
1035 CALL SMUMPS_CLEAN_PENDING( INFO(1), KEEP,
1036 & BUFR, LBUFR,LBUFR_BYTES,
1037 & COMM_NODES, IDUMMY,
1038 & SLAVEF, .TRUE., .FALSE. )
1039 CALL MUMPS_PROPINFO(ICNTL, INFO, COMM_NODES, MYID )
1040#if defined(V_T)
1041 CALL VTEND(back_soln,ierr)
1042#endif
1043.NOT. IF (FROM_PP) THEN
1044 CALL MUMPS_SECFIN(TIME_BWD)
1045 DKEEP(118)=real(TIME_BWD)+DKEEP(118)
1046 ENDIF
1047 ENDIF
1048.GT..AND..GT. IF (LDIAG2 MP0) THEN
1049 IF (DOFORWARD) THEN
1050 K = min0(10,size(RHSCOMP,1))
1051.EQ. IF (LDIAG4) K = size(RHSCOMP,1)
1052.NOT. IF ( FROM_PP) THEN
1053 WRITE (MP,99992)
1054.GT. IF (size(RHSCOMP,1)0)
1055 & WRITE (MP,99993) (RHSCOMP(I,1),I=1,K)
1056.GT..and. IF (size(RHSCOMP,1)0NRHS>1)
1057 & WRITE (MP,99994) (RHSCOMP(I,2),I=1,K)
1058 ENDIF
1059 ENDIF
1060 ENDIF
1061500 CONTINUE
1062 IF ( allocated(TO_PROCESS)) DEALLOCATE (TO_PROCESS)
1063.OR..OR. IF (Exploit_SparsityAM1SWITCH_OFF_ES) THEN
1064 IF ( allocated(nodes_RHS)) DEALLOCATE (nodes_RHS)
1065 IF ( allocated(Pruned_SONS)) DEALLOCATE (Pruned_SONS)
1066 IF ( allocated(Pruned_Roots)) DEALLOCATE (Pruned_Roots)
1067 IF ( allocated(Pruned_List)) DEALLOCATE (Pruned_List)
1068 IF ( allocated(Pruned_Leaves)) DEALLOCATE (Pruned_Leaves)
1069 ENDIF
1070 RETURN
107199993 FORMAT (' rhs(internal, first column)'/(1X,1P,5E14.6))
107299994 FORMAT (' rhs(internal, 2 nd column)'/(1X,1P,5E14.6))
107399992 FORMAT (//' leaving solve(smumps_sol_c) with')
mumps_ooc_get_fct_type
integer function mumps_ooc_get_fct_type(fwdorbwd, mtype, k201, k50)
Definition mumps_ooc_common.F:97
smumps_ooc
Definition smumps_ooc.F:14
smumps_ooc::smumps_free_factors_for_solve
subroutine smumps_free_factors_for_solve(inode, ptrfac, nsteps, a, la, flag, ierr)
Definition smumps_ooc.F:1204
smumps_sol_es
Definition smumps_sol_es.F:14
smumps_sol_l0omp_m
Definition ssol_omp_m.F:14
smumps_sol_l0omp_m::smumps_sol_l0omp_s
subroutine smumps_sol_l0omp_s(n, mtype, nrhs, liw, iw, ptricb, ptracb, rhscomp, lrhscomp, posinrhscomp_bwd, step, frere, fils, ne_steps, ptrist, ptrfac, info, keep, keep8, dkeep, procnode_steps, slavef, comm, myid, bufr, lbufr, lbufr_bytes, rhs_root, lrhs_root, istep_to_iniv2, tab_pos_in_pere, panel_pos, lpanel_pos, prun_below_bwd, to_process, size_to_process, rhs_bounds, lrhs_bounds, do_nbsparse, from_pp, lpool_b_l0_omp, l_virt_l0_omp, virt_l0_omp, l_phys_l0_omp, phys_l0_omp, perm_l0_omp, ptr_leafs_l0_omp, l0_omp_mapping, ll0_omp_mapping, l0_omp_factors, ll0_omp_factors)
Definition ssol_omp_m.F:299
smumps_sol_l0omp_m::smumps_sol_l0omp_r
subroutine smumps_sol_l0omp_r(n, mtype, nrhs, liw, iw, ptricb, rhscomp, lrhscomp, posinrhscomp_fwd, step, frere, dad, fils, nstk, ptrist, ptrfac, info, keep, keep8, dkeep, procnode_steps, slavef, comm, myid, bufr, lbufr, lbufr_bytes, rhs_root, lrhs_root, istep_to_iniv2, tab_pos_in_pere, rhs_bounds, lrhs_bounds, do_nbsparse, from_pp, nbroot_under_l0, lpool_b_l0_omp, ipool_b_l0_omp, l_virt_l0_omp, virt_l0_omp, l_phys_l0_omp, phys_l0_omp, perm_l0_omp, ptr_leafs_l0_omp, l0_omp_mapping, ll0_omp_mapping, l0_omp_factors, ll0_omp_factors, do_prun, to_process)
Definition ssol_omp_m.F:62
smumps_struc_def
Definition smumps_struc_def.F:14
smumps_solve_get_ooc_node
subroutine smumps_solve_get_ooc_node(inode, ptrfac, keep, a, la, step, keep8, n, must_be_permuted, ierr)
Definition ssol_aux.F:732
smumps_sol_c
subroutine smumps_sol_c(root, n, a, la, iw, liw, w, lwc, iwcb, liww, nrhs, na, lna, ne_steps, w2, mtype, icntl, from_pp, step, frere, dad, fils, ptrist, ptrfac, iw1, liw1, ptracb, liwk_ptracb, procnode_steps, slavef, info, keep, keep8, dkeep, comm_nodes, myid, myid_nodes, bufr, lbufr, lbufr_bytes, istep_to_iniv2, tab_pos_in_pere, ibeg_root_def, iend_root_def, iroot_def_rhs_col1, rhs_root, lrhs_root, size_root, master_root, rhscomp, lrhscomp, posinrhscomp_fwd, posinrhscomp_bwd, nz_rhs, nbcol_inbloc, nrhs_orig, jbeg_rhs, step2node, lstep2node, irhs_sparse, irhs_ptr, size_perm_rhs, perm_rhs, size_uns_perm_inv, uns_perm_inv, nb_fs_in_rhscomp_f, nb_fs_in_rhscomp_tot, do_nbsparse, rhs_bounds, lrhs_bounds, ipool_b_l0_omp, lpool_b_l0_omp, ipool_a_l0_omp, lpool_a_l0_omp, l_virt_l0_omp, virt_l0_omp, l_phys_l0_omp, phys_l0_omp, perm_l0_omp, ptr_leafs_l0_omp, l0_omp_mapping, ll0_omp_mapping, l0_omp_factors, ll0_omp_factors)
Definition ssol_c.F:31
smumps_sol_r
subroutine smumps_sol_r(n, a, la, iw, liw, wcb, lwcb, nrhs, ptricb, iwcb, liwcb, rhscomp, lrhscomp, posinrhscomp_fwd, step, frere, dad, fils, nstk, ipool, lpool, ptrist, ptrfac, myleaf, myroot, info, keep, keep8, dkeep, procnode_steps, slavef, comm, myid, bufr, lbufr, lbufr_bytes, rhs_root, lrhs_root, mtype, istep_to_iniv2, tab_pos_in_pere, rhs_bounds, lrhs_bounds, do_nbsparse, from_pp, l0_omp_mapping, ll0_omp_mapping, l0_omp_factors, ll0_omp_factors)
Definition ssol_fwd.F:32