OpenRadioss 2025.1.11
OpenRadioss project
Loading...
Searching...
No Matches
dana_aux_par.F
Go to the documentation of this file.
1C
2C This file is part of MUMPS 5.5.1, released
3C on Tue Jul 12 13:17:24 UTC 2022
4C
5C
6C Copyright 1991-2022 CERFACS, CNRS, ENS Lyon, INP Toulouse, Inria,
7C Mumps Technologies, University of Bordeaux.
8C
9C This version of MUMPS is provided to you free of charge. It is
10C released under the CeCILL-C license
11C (see doc/CeCILL-C_V1-en.txt, doc/CeCILL-C_V1-fr.txt, and
12C https://cecill.info/licences/Licence_CeCILL-C_V1-en.html)
13C
14 MODULE dmumps_parallel_analysis
15 USE dmumps_struc_def
16 USE mumps_memory_mod
17 USE mumps_ana_ord_wrappers
18 include 'mpif.h'
19 PUBLIC dmumps_ana_f_par
20 INTERFACE dmumps_ana_f_par
21 MODULE PROCEDURE dmumps_ana_f_par
22 END INTERFACE
23 PRIVATE
24 TYPE ord_type
25 INTEGER :: cblknbr, n
26 INTEGER, POINTER :: permtab(:) => null()
27 INTEGER, POINTER :: peritab(:) => null()
28 INTEGER, POINTER :: rangtab(:) => null()
29 INTEGER, POINTER :: treetab(:) => null()
30 INTEGER, POINTER :: brother(:) => null()
31 INTEGER, POINTER :: son(:) => null()
32 INTEGER, POINTER :: nw(:) => null()
33 INTEGER, POINTER :: FIRST(:) => null()
34 INTEGER, POINTER :: last(:) => null()
35 INTEGER, POINTER :: topnodes(:) => null()
36 INTEGER :: comm, comm_nodes, nprocs, nslaves, myid
37 INTEGER :: topstrat, substrat, ordtool, topvars
38 LOGICAL :: ido
39 END TYPE ord_type
40 TYPE graph_type
41 INTEGER(8) :: nz_loc
42 INTEGER :: n, comm
43 INTEGER, POINTER :: irn_loc(:) => null()
44 INTEGER, POINTER :: jcn_loc(:) => null()
45 END TYPE graph_type
46 TYPE arrpnt
47 INTEGER, POINTER :: buf(:) => null()
48 END TYPE arrpnt
49 INTEGER :: mp, mpg, lp, NRL, toprows
50 INTEGER(8) :: memcnt, maxmem
51 LOGICAL :: prok, prokg, lpok
52 CONTAINS
53 SUBROUTINE dmumps_ana_f_par(id, WORK1, WORK2, NFSIZ, FILS,
54 & FRERE)
55 USE dmumps_struc_def
56 IMPLICIT NONE
57 TYPE(dmumps_struc) :: id
58 INTEGER, TARGET :: WORK1(:), WORK2(:)
59 INTEGER :: NFSIZ(:), FILS(:), FRERE(:)
60 TYPE(ord_type) :: ord
61 INTEGER, POINTER :: IPE(:), NV(:),
62 & ne(:), na(:), node(:),
63 & nd(:), subord(:), namalg(:),
64 & ips(:), cumul(:),
65 & saveirn(:), savejcn(:)
66 INTEGER :: MYID, NPROCS, IERR, NEMIN, LDIAG
67 LOGICAL :: SPLITROOT
68 INTEGER(8), PARAMETER :: K79REF=12000000_8
69 INTEGER, PARAMETER :: LIDUMMY = 1
70 INTEGER :: IDUMMY(1)
71 DOUBLE PRECISION :: TIMEB
72 nullify(ipe, nv, ne, na, node, nd, subord, namalg, ips,
73 & cumul, saveirn, savejcn)
74 CALL mpi_comm_rank (id%COMM, myid, ierr)
75 CALL mpi_comm_size (id%COMM, nprocs, ierr)
76 lp = id%ICNTL(1)
77 mp = id%ICNTL(2)
78 mpg = id%ICNTL(3)
79 prok = (mp.GT.0)
80 prokg = (mpg.GT.0) .AND. (myid .EQ. 0)
81 lpok = (lp.GT.0) .AND. (id%ICNTL(4).GE.1)
82 ldiag = id%ICNTL(4)
83 ord%PERMTAB => work1(1 : id%N)
84 ord%PERITAB => work1(id%N+1 : 2*id%N)
85 ord%TREETAB => work1(2*id%N+1 : 3*id%N)
86 IF(id%KEEP(54) .NE. 3) THEN
87 IF(myid.EQ.0) THEN
88 saveirn => id%IRN_loc
89 savejcn => id%JCN_loc
90 id%IRN_loc => id%IRN
91 id%JCN_loc => id%JCN
92 id%KEEP8(29) = id%KEEP8(28)
93 ELSE
94 id%KEEP8(29)=0_8
95 END IF
96 END IF
97 maxmem=0
98 IF(memcnt .GT. maxmem) maxmem=memcnt
99 CALL dmumps_set_par_ord(id, ord)
100 id%INFOG(7) = id%KEEP(245)
101 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
102 & id%COMM, id%MYID )
103 IF ( id%INFO(1) .LT. 0 ) RETURN
104 IF (prokg) CALL mumps_secdeb( timeb )
105 CALL dmumps_do_par_ord(id, ord, work2)
106 IF (prokg) THEN
107 CALL mumps_secfin( timeb )
108 WRITE(mpg,
109 & '(" ELAPSED time in parallel ordering =",F12.4)')
110 & timeb
111 ENDIF
112 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
113 & id%COMM, id%MYID )
114 IF ( id%INFO(1) .LT. 0 ) RETURN
115 IF(id%MYID .EQ. 0) THEN
116 CALL mumps_realloc(ipe, id%N, id%INFO, lp, force=.false.,
117 & copy=.false., string='',
118 & memcnt=memcnt, errcode=-7)
119 CALL mumps_realloc(nv, id%N, id%INFO, lp,
120 & memcnt=memcnt, errcode=-7)
121 IF(memcnt .GT. maxmem) maxmem=memcnt
122 END IF
123 ord%SUBSTRAT = 0
124 ord%TOPSTRAT = 0
125 CALL dmumps_parsymfact(id, ord, ipe, nv, work2)
126 IF(id%KEEP(54) .NE. 3) THEN
127 IF(myid.EQ.0) THEN
128 id%IRN_loc => saveirn
129 id%JCN_loc => savejcn
130 END IF
131 END IF
132 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
133 & id%COMM, id%MYID )
134 IF ( id%INFO(1) .LT. 0 ) RETURN
135 NULLIFY(ord%PERMTAB)
136 NULLIFY(ord%PERITAB)
137 NULLIFY(ord%TREETAB)
138 CALL mumps_idealloc(ord%FIRST, ord%LAST, memcnt=memcnt)
139 IF (myid .EQ. 0) THEN
140 ips => work1(1:id%N)
141 ne => work1(id%N+1 : 2*id%N)
142 na => work1(2*id%N+1 : 3*id%N)
143 node => work2(1 : id%N )
144 nd => work2(id%N+1 : 2*id%N)
145 subord => work2(2*id%N+1 : 3*id%N)
146 namalg => work2(3*id%N+1 : 4*id%N)
147 CALL mumps_realloc(cumul, id%N, id%INFO, lp,
148 & string='CUMUL', memcnt=memcnt, errcode=-7)
149 IF(memcnt .GT. maxmem) maxmem=memcnt
150 nemin = id%KEEP(1)
151 CALL dmumps_ana_lnew(id%N, ipe(1), nv(1), ips(1), ne(1),
152 & na(1), nfsiz(1), node(1), id%INFOG(6), fils(1), frere(1),
153 & nd(1), nemin, subord(1), id%KEEP(60), id%KEEP(20),
154 & id%KEEP(38), namalg(1), id%KEEP(104), cumul(1),
155 & id%KEEP(50), id%ICNTL(13), id%KEEP(37), id%KEEP(197),
156 & id%NSLAVES, id%KEEP(250).EQ.1, .false., idummy, lidummy)
157 CALL mumps_dealloc(cumul, nv, ipe, memcnt=memcnt)
158 CALL dmumps_ana_m(ne(1), nd(1), id%INFOG(6), id%INFOG(5),
159 & id%KEEP(2), id%KEEP(50), id%KEEP8(101), id%KEEP(108),
160 & id%KEEP(5), id%KEEP(6), id%KEEP(226), id%KEEP(253))
161 IF ( id%KEEP(53) .NE. 0 ) THEN
162 CALL mumps_make1root(id%N, frere(1), fils(1), nfsiz(1),
163 & id%KEEP(20))
164 END IF
165 IF ( (id%KEEP(48) == 4 .AND. id%KEEP8(21).GT.0_8)
166 & .OR.
167 & (id%KEEP (48)==5 .AND. id%KEEP8(21) .GT. 0_8 )
168 & .OR.
169 & (id%KEEP(24).NE.0.AND.id%KEEP8(21).GT.0_8) ) THEN
170 CALL dmumps_set_k821_surface(id%KEEP8(21), id%KEEP(2),
171 & id%KEEP(48), id%KEEP(50), id%NSLAVES)
172 END IF
173 IF ((id%KEEP(210).LT.0) .OR. (id%KEEP(210).GT.2))
174 & id%KEEP(210)=0
175 IF ((id%KEEP(210).EQ.0) .AND. (id%KEEP(201).GT.0))
176 & id%KEEP(210)=1
177 IF ((id%KEEP(210).EQ.0) .AND. (id%KEEP(201).EQ.0))
178 & id%KEEP(210)=2
179 IF (id%KEEP(210).EQ.2) id%KEEP8(79)=huge(id%KEEP8(79))
180 IF ((id%KEEP(210).EQ.1) .AND. (id%KEEP8(79).LE.0_8)) THEN
181 id%KEEP8(79)=k79ref * int(id%NSLAVES,8)
182 ENDIF
183 IF ( (id%KEEP(79).EQ.0).OR.(id%KEEP(79).EQ.2).OR.
184 & (id%KEEP(79).EQ.3).OR.(id%KEEP(79).EQ.5).OR.
185 & (id%KEEP(79).EQ.6)
186 & ) THEN
187 IF (id%KEEP(210).EQ.1) THEN
188 splitroot = .false.
189 IF ( id%KEEP(62).GE.1) THEN
190 idummy(1) = -1
191 CALL dmumps_cutnodes(id%N, frere(1), fils(1),
192 & nfsiz(1), idummy, lidummy, id%INFOG(6),
193 & id%NSLAVES, id%KEEP(1), id%KEEP8(1), splitroot,
194 & mp, ldiag, id%INFOG(1), id%INFOG(2))
195 IF (id%INFOG(1).LT.0) RETURN
196 ENDIF
197 ENDIF
198 ENDIF
199 splitroot = (((id%ICNTL(13).GT.0) .AND.
200 & (id%NSLAVES.GT.id%ICNTL(13))) .OR.
201 & (id%ICNTL(13).EQ.-1)) .AND. (id%KEEP(60).EQ.0)
202 IF (splitroot) THEN
203 idummy(1) = -1
204 CALL dmumps_cutnodes(id%N, frere(1), fils(1), nfsiz(1),
205 & idummy, lidummy, id%INFOG(6),
206 & id%NSLAVES, id%KEEP(1), id%KEEP8(1),
207 & splitroot, mp, ldiag, id%INFOG(1), id%INFOG(2))
208 IF (id%INFOG(1).LT.0) RETURN
209 ENDIF
210 END IF
211 RETURN
212 END SUBROUTINE dmumps_ana_f_par
213 SUBROUTINE dmumps_set_par_ord(id, ord)
214 TYPE(DMUMPS_STRUC) :: id
215 TYPE(ord_type) :: ord
216 INTEGER :: IERR
217#if defined(parmetis) || defined(parmetis3)
218 INTEGER :: I, COLOR, BASE, WORKERS
219 LOGICAL :: IDO
220#endif
221 IF(id%MYID .EQ. 0) id%KEEP(245) = id%ICNTL(29)
222 CALL mpi_bcast( id%KEEP(245), 1,
223 & mpi_integer, 0, id%COMM, ierr )
224 IF ((id%KEEP(245) .LT. 0) .OR. (id%KEEP(245) .GT. 2)) THEN
225 id%KEEP(245) = 0
226 END IF
227 IF (id%KEEP(245) .EQ. 0) THEN
228#if defined(ptscotch)
229 IF(id%NSLAVES .LT. 2) THEN
230 IF(prokg) WRITE(mpg,'("Warning: older versions
231 &of PT-SCOTCH require at least 2 processors.")')
232 END IF
233 ord%ORDTOOL = 1
234 ord%TOPSTRAT = 0
235 ord%SUBSTRAT = 0
236 ord%COMM = id%COMM
237 ord%COMM_NODES = id%COMM_NODES
238 ord%NPROCS = id%NPROCS
239 ord%NSLAVES = id%NSLAVES
240 ord%MYID = id%MYID
241 ord%IDO = (id%MYID .GE. 1) .OR. (id%KEEP(46) .EQ. 1)
242 id%KEEP(245) = 1
243 IF(prokg) WRITE(mpg,
244 & '("Parallel ordering tool set to PT-SCOTCH.")')
245 RETURN
246#endif
247#if defined(parmetis) || defined(parmetis3)
248 IF(id%N.LE.100) THEN
249 workers = 2
250 ELSE
251 workers = min(id%NSLAVES,id%N/16)
252 END IF
253 i=1
254 DO
255 IF (i .GT. workers) EXIT
256 ord%NSLAVES = i
257 i = i*2
258 END DO
259 base = id%NPROCS-id%NSLAVES
260 ord%NPROCS = ord%NSLAVES + base
261 ido = (id%MYID .GE. base) .AND.
262 & (id%MYID .LE. base+ord%NSLAVES-1)
263 ord%IDO = ido
264 IF ( ido ) THEN
265 color = 1
266 ELSE
267 color = mpi_undefined
268 END IF
269 CALL mpi_comm_split( id%COMM, color, 0,
270 & ord%COMM_NODES, ierr )
271 ord%ORDTOOL = 2
272 ord%TOPSTRAT = 0
273 ord%SUBSTRAT = 0
274 ord%MYID = id%MYID
275 IF(prokg) WRITE(mpg,
276 & '("Parallel ordering tool set to ParMETIS.")')
277 id%KEEP(245) = 2
278 RETURN
279#endif
280 id%INFO(1) = -38
281 id%INFOG(1) = -38
282 IF(id%MYID .EQ.0 ) THEN
283 WRITE(lp,
284 & '("No parallel ordering tools available.")')
285 WRITE(lp,
286 & '("Please install PT-SCOTCH or ParMETIS.")')
287 END IF
288 RETURN
289 ELSE IF (id%KEEP(245) .EQ. 1) THEN
290#if defined(ptscotch)
291 IF(id%NSLAVES .LT. 2) THEN
292 IF(prokg) WRITE(mpg,'("Warning: older versions
293 &of PT-SCOTCH require at least 2 processors.")')
294 END IF
295 ord%ORDTOOL = 1
296 ord%TOPSTRAT = 0
297 ord%SUBSTRAT = 0
298 ord%COMM = id%COMM
299 ord%COMM_NODES = id%COMM_NODES
300 ord%NPROCS = id%NPROCS
301 ord%NSLAVES = id%NSLAVES
302 ord%MYID = id%MYID
303 ord%IDO = (id%MYID .GE. 1) .OR. (id%KEEP(46) .EQ. 1)
304 IF(prokg) WRITE(mpg,
305 & '(" Using PT-SCOTCH for parallel ordering")')
306 RETURN
307#else
308 id%INFOG(1) = -38
309 id%INFO(1) = -38
310 IF(id%MYID .EQ.0 ) WRITE(lp,
311 & '(" PT-SCOTCH not available")')
312 RETURN
313#endif
314 ELSE IF (id%KEEP(245) .EQ. 2) THEN
315#if defined(parmetis) || defined(parmetis3)
316 IF(id%N.LE.100) THEN
317 workers = 2
318 ELSE
319 workers = min(id%NSLAVES,id%N/16)
320 END IF
321 i=1
322 DO
323 IF (i .GT. workers) EXIT
324 ord%NSLAVES = i
325 i = i*2
326 END DO
327 base = id%NPROCS-id%NSLAVES
328 ord%NPROCS = ord%NSLAVES + base
329 ido = (id%MYID .GE. base) .AND.
330 & (id%MYID .LE. base+ord%NSLAVES-1)
331 ord%IDO = ido
332 IF ( ido ) THEN
333 color = 1
334 ELSE
335 color = mpi_undefined
336 END IF
337 CALL mpi_comm_split( id%COMM, color, 0, ord%COMM_NODES,
338 & ierr )
339 ord%ORDTOOL = 2
340 ord%TOPSTRAT = 0
341 ord%SUBSTRAT = 0
342 ord%MYID = id%MYID
343 IF(prokg) WRITE(mpg,
344 & '(" Using ParMETIS for parallel ordering")')
345 RETURN
346#else
347 id%INFOG(1) = -38
348 id%INFO(1) = -38
349 IF(id%MYID .EQ.0 ) WRITE(lp,
350 & '(" ParMETIS not available.")')
351 RETURN
352#endif
353 END IF
354 END SUBROUTINE dmumps_set_par_ord
355 SUBROUTINE dmumps_do_par_ord(id, ord, WORK)
356 IMPLICIT NONE
357 TYPE(dmumps_struc) :: id
358 TYPE(ord_type) :: ord
359 INTEGER :: WORK(:)
360#if defined(parmetis) || defined(parmetis3)
361 INTEGER :: IERR
362#endif
363 IF (ord%ORDTOOL .EQ. 1) THEN
364#if defined(ptscotch)
365 CALL dmumps_ptscotch_ord(id, ord, work)
366#else
367 id%INFOG(1) = -38
368 id%INFO(1) = -38
369 WRITE(lp,*)'PT-SCOTCH not available. Aborting...'
370 CALL mumps_abort()
371#endif
372 ELSE IF (ord%ORDTOOL .EQ. 2) THEN
373#if defined(parmetis) || defined(parmetis3)
374 CALL dmumps_parmetis_ord(id, ord, work)
375 if(ord%IDO) CALL mpi_comm_free(ord%COMM_NODES, ierr)
376#else
377 id%INFOG(1) = -38
378 id%INFO(1) = -38
379 WRITE(lp,*)'ParMETIS not available. Aborting...'
380 CALL mumps_abort()
381#endif
382 END IF
383 RETURN
384 END SUBROUTINE dmumps_do_par_ord
385#if defined(parmetis) || defined(parmetis3)
386 SUBROUTINE dmumps_parmetis_ord(id, ord, WORK)
387 IMPLICIT NONE
388 TYPE(dmumps_struc) :: id
389 TYPE(ord_type) :: ord
390 INTEGER, TARGET :: WORK(:)
391 INTEGER :: I, MYID, NPROCS, IERR, BASE, METIS_IDX_SIZE
392 INTEGER, POINTER :: FIRST(:),
393 & last(:), swork(:)
394 INTEGER :: BASEVAL, VERTLOCNBR,
395 & options(10)
396 INTEGER(8), POINTER :: VERTLOCTAB(:)
397 INTEGER, POINTER :: EDGELOCTAB(:), RCVCNTS(:)
398 INTEGER(8) :: EDGELOCNBR
399 INTEGER, POINTER :: SIZES(:), ORDER(:)
400 nullify(first, last, swork, vertloctab, edgeloctab, rcvcnts,
401 & sizes, order)
402 CALL mpi_comm_rank (id%COMM, myid, ierr)
403 CALL mpi_comm_size (id%COMM, nprocs, ierr)
404 ierr=0
405 IF(size(work) .LT. id%N*3) THEN
406 WRITE(lp,
407 & '("Insufficient workspace inside DMUMPS_PARMETIS_ORD")')
408 CALL mumps_abort()
409 END IF
410 IF(memcnt .GT. maxmem) maxmem=memcnt
411 baseval = 1
412 base = id%NPROCS-id%NSLAVES
413 CALL mumps_realloc(first, nprocs+1, id%INFO, lp,
414 & memcnt=memcnt, errcode=-7)
415 CALL mumps_realloc(last, nprocs+1, id%INFO, lp,
416 & memcnt=memcnt, errcode=-7)
417 IF(memcnt .GT. maxmem) maxmem=memcnt
418 CALL dmumps_graph_dist(id, ord, first,
419 & last, base, nprocs, work(1: 2*id%N), type=2)
420 vertlocnbr = last(myid+1)-first(myid+1) + 1
421 CALL mumps_i8realloc(vertloctab, vertlocnbr+1, id%INFO,
422 & lp, string='VERTLOCTAB', memcnt=memcnt, errcode=-7)
423 IF(memcnt .GT. maxmem) maxmem=memcnt
424 swork => work(id%N+1:3*id%N)
425 CALL dmumps_build_dist_graph(id, first, last, vertloctab,
426 & edgeloctab, swork)
427 IF(id%INFO(1).LT.0) RETURN
428 edgelocnbr = vertloctab(vertlocnbr+1)-1_8
429 options(:) = 0
430 order => work(1:id%N)
431 CALL mumps_realloc(sizes, 2*ord%NSLAVES, id%INFO, lp,
432 & memcnt=memcnt, errcode=-7)
433 IF(memcnt .GT. maxmem) maxmem=memcnt
434 IF(ord%IDO) THEN
435 CALL mumps_metis_idxsize(metis_idx_size)
436 IF (metis_idx_size.EQ.32) THEN
437 IF (id%KEEP(10).EQ.1) THEN
438 id%INFO(1) = -52
439 id%INFO(2) = 1
440 ELSE
441 CALL mumps_parmetis_mixedto32(id, base, vertlocnbr, first,
442 & vertloctab, edgeloctab, baseval, options, order,
443 & sizes, ord%COMM_NODES, ierr)
444 ENDIF
445 ELSE IF (metis_idx_size.EQ.64) THEN
446 CALL mumps_parmetis_mixedto64
447 & (id, base, vertlocnbr, first,
448 & vertloctab, edgeloctab, baseval, options, order,
449 & sizes, ord%COMM_NODES, ierr)
450 ELSE
451 WRITE(*,*)
452 & "Internal error in PARMETIS wrappers, METIS_IDX_SIZE=",
453 & metis_idx_size
454 CALL mumps_abort()
455 END IF
456 END IF
457 CALL mumps_idealloc(edgeloctab, memcnt=memcnt)
458 IF(memcnt .GT. maxmem) maxmem=memcnt
459 CALL mumps_i8dealloc(vertloctab)
460 IF(ierr.GT.0) THEN
461 id%INFO(1:2) = -50
462 END IF
463 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
464 & id%COMM, id%MYID )
465 IF ( id%INFO(1) .LT. 0 ) GOTO 20
466 CALL mpi_bcast(sizes(1), 2*ord%NSLAVES, mpi_integer,
467 & base, id%COMM, ierr)
468 ord%CBLKNBR = 2*ord%NSLAVES-1
469 CALL mumps_realloc(rcvcnts, id%NPROCS, id%INFO, lp,
470 & memcnt=memcnt, errcode=-7)
471 IF(memcnt .GT. maxmem) maxmem=memcnt
472 DO i=1, id%NPROCS
473 rcvcnts(i) = max(last(i)-first(i)+1,0)
474 END DO
475 first = first-1
476 IF(first(1) .LT. 0) THEN
477 first(1) = 0
478 END IF
479 CALL mpi_allgatherv ( order(1), vertlocnbr, mpi_integer,
480 & ord%PERMTAB(1),
481 & rcvcnts(1), first(1), mpi_integer, id%COMM, ierr )
482 DO i=1, id%N
483 ord%PERITAB(ord%PERMTAB(i)) = i
484 END DO
485 CALL mumps_realloc(ord%RANGTAB, 2*ord%NSLAVES, id%INFO,
486 & lp, string='RANGTAB', memcnt=memcnt, errcode=-7)
487 IF(memcnt .GT. maxmem) maxmem=memcnt
488 CALL dmumps_build_treetab(ord%TREETAB, ord%RANGTAB,
489 & sizes, ord%CBLKNBR)
490 CALL mumps_dealloc(sizes, first, last,
491 & rcvcnts, memcnt=memcnt)
492 CALL mumps_realloc(ord%SON, ord%CBLKNBR, id%INFO,
493 & lp, string='SON', memcnt=memcnt, errcode=-7)
494 CALL mumps_realloc(ord%BROTHER, ord%CBLKNBR, id%INFO,
495 & lp, string='BROTHER', memcnt=memcnt, errcode=-7)
496 CALL mumps_realloc(ord%NW, ord%CBLKNBR, id%INFO,
497 & lp, string='NW', memcnt=memcnt, errcode=-7)
498 IF(memcnt .GT. maxmem) maxmem=memcnt
499 CALL dmumps_build_tree(ord)
500 ord%N = id%N
501 ord%COMM = id%COMM
502 RETURN
503 20 CONTINUE
504 CALL mumps_dealloc(first , memcnt=memcnt)
505 CALL mumps_dealloc(last , memcnt=memcnt)
506 CALL mumps_dealloc(sizes , memcnt=memcnt)
507 CALL mumps_dealloc(ord%RANGTAB, memcnt=memcnt)
508 RETURN
509 END SUBROUTINE dmumps_parmetis_ord
510#endif
511#if defined(ptscotch)
512 SUBROUTINE dmumps_ptscotch_ord(id, ord, WORK)
513!$ USE omp_lib
514 IMPLICIT NONE
515 include 'ptscotchf.h'
516 TYPE(dmumps_struc) :: id
517 TYPE(ord_type) :: ord
518 INTEGER, TARGET :: WORK(:)
519 INTEGER :: MYID, NPROCS, IERR
520 INTEGER, POINTER :: FIRST(:),
521 & last(:), swork(:)
522 INTEGER :: BASEVAL, VERTLOCNBR,
523 & base, scotch_int_size
524 INTEGER(8) :: EDGELOCNBR
525 INTEGER(8), POINTER :: VERTLOCTAB(:)
526 INTEGER, POINTER :: EDGELOCTAB(:)
527 INTEGER :: PTHREAD_NUMBER, NOMP
528 nullify(first, last, swork, vertloctab, edgeloctab)
529 IF (size(work) .LT. id%N*3) THEN
530 WRITE(lp,
531 & '("Insufficient workspace inside DMUMPS_PTSCOTCH_ORD")')
532 CALL mumps_abort()
533 END IF
534 CALL mpi_barrier(id%COMM, ierr)
535 CALL mpi_comm_rank (id%COMM, myid, ierr)
536 CALL mpi_comm_size (id%COMM, nprocs, ierr)
537 base = id%NPROCS-id%NSLAVES
538 baseval = 1
539 CALL mumps_realloc(first, nprocs+1, id%INFO, lp,
540 & memcnt=memcnt, errcode=-7)
541 CALL mumps_realloc(last, nprocs+1, id%INFO, lp,
542 & memcnt=memcnt, errcode=-7)
543 IF(memcnt .GT. maxmem) maxmem=memcnt
544 CALL dmumps_graph_dist(id, ord, first,
545 & last, base, nprocs, work(1: 2*id%N), type=2)
546 vertlocnbr = last(myid+1)-first(myid+1) + 1
547 CALL mumps_i8realloc(vertloctab, vertlocnbr+1, id%INFO,
548 & lp, string='VERTLOCTAB', memcnt=memcnt, errcode=-7)
549 IF(memcnt .GT. maxmem) maxmem=memcnt
550 swork => work(id%N+1:3*id%N)
551 CALL dmumps_build_dist_graph(id, first, last, vertloctab,
552 & edgeloctab, swork)
553 IF(id%INFO(1).LT.0) RETURN
554 edgelocnbr = vertloctab(vertlocnbr+1)-1_8
555 CALL mumps_realloc(ord%PERMTAB, id%N, id%INFO,
556 & lp, string='PERMTAB', memcnt=memcnt, errcode=-7)
557 CALL mumps_realloc(ord%PERITAB, id%N, id%INFO,
558 & lp, string='PERITAB', memcnt=memcnt, errcode=-7)
559 CALL mumps_realloc(ord%RANGTAB, id%N+1, id%INFO,
560 & lp, string='RANGTAB', memcnt=memcnt, errcode=-7)
561 CALL mumps_realloc(ord%TREETAB, id%N, id%INFO,
562 & lp, string='TREETAB', memcnt=memcnt, errcode=-7)
563 IF(memcnt .GT. maxmem) maxmem=memcnt
564 IF(ord%IDO) THEN
565 CALL mumps_scotch_intsize(scotch_int_size)
566 nomp=0
567!$ NOMP=omp_get_max_threads()
568 IF (nomp .GT. 0) THEN
569 CALL mumps_scotch_get_pthread_number (pthread_number)
570 CALL mumps_scotch_set_pthread_number (nomp)
571 ENDIF
572 IF(scotch_int_size.EQ.32) THEN
573 IF (id%KEEP(10).EQ.1) THEN
574 id%INFO(1) = -52
575 id%INFO(2) = 2
576 ELSE
577 CALL mumps_ptscotch_mixedto32(id, ord,
578 & baseval,
579 & vertlocnbr, vertloctab,
580 & edgelocnbr, edgeloctab,
581 & ierr)
582 ENDIF
583 ELSE
584 CALL mumps_ptscotch_mixedto64(id, ord,
585 & baseval,
586 & vertlocnbr, vertloctab,
587 & edgelocnbr, edgeloctab,
588 & ierr)
589 END IF
590 IF (nomp .GT. 0) THEN
591 CALL mumps_scotch_set_pthread_number (pthread_number)
592 ENDIF
593 END IF
594 IF(ierr.NE.0) THEN
595 id%INFO(1:2) = -50
596 END IF
597 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
598 & id%COMM, id%MYID )
599 IF ( id%INFO(1) .LT. 0 ) GOTO 11
600 CALL mpi_bcast (ord%CBLKNBR, 1, mpi_integer,
601 & base, id%COMM, ierr)
602 CALL mpi_bcast (ord%PERMTAB(1), id%N, mpi_integer,
603 & base, id%COMM, ierr)
604 CALL mpi_bcast (ord%PERITAB(1), id%N, mpi_integer,
605 & base, id%COMM, ierr)
606 CALL mpi_bcast (ord%RANGTAB(1), id%N+1, mpi_integer,
607 & base, id%COMM, ierr)
608 CALL mpi_bcast (ord%TREETAB(1), id%N, mpi_integer,
609 & base, id%COMM, ierr)
610 CALL mumps_realloc(ord%SON, ord%CBLKNBR, id%INFO,
611 & lp, string='SON', memcnt=memcnt, errcode=-7)
612 CALL mumps_realloc(ord%BROTHER, ord%CBLKNBR, id%INFO,
613 & lp, string='BROTHER', memcnt=memcnt, errcode=-7)
614 CALL mumps_realloc(ord%NW, ord%CBLKNBR, id%INFO,
615 & lp, string='NW', memcnt=memcnt, errcode=-7)
616 CALL dmumps_build_tree(ord)
617 IF(memcnt .GT. maxmem) maxmem=memcnt
618 ord%N = id%N
619 ord%COMM = id%COMM
620 CALL mumps_dealloc(edgeloctab, memcnt=memcnt)
621 CALL mumps_dealloc(first , memcnt=memcnt)
622 CALL mumps_dealloc(last , memcnt=memcnt)
623 CALL mumps_i8dealloc(vertloctab, memcnt=memcnt)
624 RETURN
625 11 CONTINUE
626 CALL mumps_dealloc(first , memcnt=memcnt)
627 CALL mumps_dealloc(last , memcnt=memcnt)
628 CALL mumps_dealloc(ord%RANGTAB, memcnt=memcnt)
629 CALL mumps_dealloc(edgeloctab, memcnt=memcnt)
630 RETURN
631 END SUBROUTINE dmumps_ptscotch_ord
632#endif
633 FUNCTION dmumps_stop_descent(id, ord, NACTIVE, ANODE, RPROC,
634 & ALIST, LIST, PEAKMEM, NNODES, CHECKMEM)
635 IMPLICIT NONE
636 LOGICAL :: DMUMPS_STOP_DESCENT
637 INTEGER :: nactive, rproc, anode, peakmem, nnodes
638 INTEGER :: alist(nnodes), list(nnodes)
639 TYPE(ord_type) :: ord
640 TYPE(dmumps_struc) :: id
641 LOGICAL, OPTIONAL :: checkmem
642 INTEGER :: ipeakmem, big, max_nrows, min_nrows
643 INTEGER :: toprows, nrl, hostmem, submem
644 INTEGER :: I, nz_row, weight
645 LOGICAL :: icheckmem
646 INTEGER :: nz4
647 IF(present(checkmem)) THEN
648 icheckmem = checkmem
649 ELSE
650 icheckmem = .false.
651 END IF
652 dmumps_stop_descent = .false.
653 IF(nactive .GE. rproc) THEN
654 dmumps_stop_descent = .true.
655 RETURN
656 END IF
657 IF(nactive .EQ. 0) THEN
658 dmumps_stop_descent = .true.
659 RETURN
660 END IF
661 IF(.NOT. icheckmem) RETURN
662 big = alist(nactive)
663 IF(nactive .GT. 1) THEN
664 max_nrows = ord%NW(alist(nactive-1))
665 min_nrows = ord%NW(alist(1))
666 ELSE
667 max_nrows = 0
668 min_nrows = id%N
669 END IF
670 DO i=1, anode
671 weight = ord%NW(list(i))
672 IF(weight .GT. max_nrows) max_nrows = weight
673 IF(weight .LT. min_nrows) min_nrows = weight
674 END DO
675 i = ord%SON(big)
676 DO
677 weight = ord%NW(i)
678 IF(weight .GT. max_nrows) max_nrows = weight
679 IF(weight .LT. min_nrows) min_nrows = weight
680 IF(ord%BROTHER(i) .EQ. -1) EXIT
681 i = ord%BROTHER(i)
682 END DO
683 toprows = ord%TOPNODES(2)+ord%RANGTAB(big+1)-ord%RANGTAB(big)
684 submem = 7 *id%N
685 hostmem = 12*id%N
686 nz4=int(id%KEEP8(28))
687 nz_row = 2*(nz4/id%N)
688 IF(id%KEEP(46) .EQ. 0) THEN
689 nrl = 0
690 ELSE
691 nrl = min_nrows
692 END IF
693 hostmem = hostmem + 2*toprows*nz_row
694 hostmem = hostmem +nrl
695 hostmem = hostmem + max(nrl,toprows)*(nz_row+2)
696 hostmem = hostmem + 6*max(nrl,toprows)
697 hostmem = hostmem + 3*toprows
698 nrl = max_nrows
699 submem = submem +nrl
700 submem = submem + nrl*(nz_row+2)
701 submem = submem + 6*nrl
702 ipeakmem = max(hostmem, submem)
703 IF((ipeakmem .GT. peakmem) .AND.
704 & (peakmem .NE. 0)) THEN
705 dmumps_stop_descent = .true.
706 RETURN
707 ELSE
708 dmumps_stop_descent = .false.
709 peakmem = ipeakmem
710 RETURN
711 END IF
712 END FUNCTION dmumps_stop_descent
713 FUNCTION dmumps_cnt_kids(NODE, ord)
714 IMPLICIT NONE
715 INTEGER :: dmumps_cnt_kids
716 INTEGER :: node
717 TYPE(ord_type) :: ord
718 INTEGER :: curr
719 dmumps_cnt_kids = 0
720 IF(ord%SON(node) .EQ. -1) THEN
721 RETURN
722 ELSE
723 dmumps_cnt_kids = 1
724 curr = ord%SON(node)
725 DO
726 IF(ord%BROTHER(curr) .NE. -1) THEN
727 dmumps_cnt_kids = dmumps_cnt_kids+1
728 curr = ord%BROTHER(curr)
729 ELSE
730 EXIT
731 END IF
732 END DO
733 END IF
734 RETURN
735 END FUNCTION dmumps_cnt_kids
736 SUBROUTINE dmumps_get_subtrees(ord, id)
737 IMPLICIT NONE
738 TYPE(ord_type) :: ord
739 TYPE(dmumps_struc) :: id
740 INTEGER, ALLOCATABLE :: ALIST(:), AWEIGHTS(:), LIST(:), WORK(:)
741 INTEGER :: NNODES, BIG, CURR, ND, NACTIVE, RPROC, ANODE, BASE, I,
742 & nk, peakmem, allocok
743 LOGICAL :: SD
744 NNODES = ord%NSLAVES
745 CALL mumps_realloc(ord%TOPNODES, 2*max(nnodes,2), id%INFO, lp,
746 & memcnt=memcnt, errcode=-7)
747 CALL mumps_realloc(ord%FIRST, id%NPROCS, id%INFO, lp,
748 & memcnt=memcnt, errcode=-7)
749 CALL mumps_realloc(ord%LAST, id%NPROCS, id%INFO, lp,
750 & memcnt=memcnt, errcode=-7)
751 IF(memcnt .GT. maxmem) maxmem=memcnt
752 ALLOCATE(alist(nnodes), aweights(nnodes), list(nnodes),
753 & work(0:nnodes+1), stat=allocok)
754 IF(allocok.GT.0) THEN
755 id%INFO(1)=-13
756 id%INFO(2)=4*nnodes+2
757 ENDIF
758 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1), id%COMM, id%MYID )
759 IF ( id%INFO(1) .LT. 0 ) GO TO 90
760 nactive = 0
761 DO i=1, ord%CBLKNBR
762 IF (ord%TREETAB(i).EQ.-1) THEN
763 nactive = nactive+1
764 IF(nactive.LE.nnodes) THEN
765 alist(nactive) = i
766 aweights(nactive) = ord%NW(i)
767 END IF
768 END IF
769 END DO
770 IF((ord%CBLKNBR .EQ. 1) .OR.
771 & (nactive.GT.nnodes) .OR.
772 & ( nnodes .LT. dmumps_cnt_kids(ord%CBLKNBR, ord) )) THEN
773 ord%TOPNODES(1) = 1
774 ord%TOPNODES(2) = ord%RANGTAB(ord%CBLKNBR+1) - ord%RANGTAB(1)
775 ord%TOPNODES(3) = ord%RANGTAB(1)
776 ord%TOPNODES(4) = ord%RANGTAB(ord%CBLKNBR+1)-1
777 ord%FIRST = 0
778 ord%LAST = -1
779 RETURN
780 END IF
781 CALL dmumps_mergesort(nactive, aweights(1:nactive),
782 & work(0:nactive+1))
783 CALL dmumps_mergeswap(nactive, work(0:nactive+1),
784 & aweights(1:nactive),
785 & alist(1:nactive))
786 rproc = nnodes
787 anode = 0
788 peakmem = 0
789 ord%TOPNODES = 0
790 DO
791 IF(nactive .EQ. 0) EXIT
792 big = alist(nactive)
793 nk = dmumps_cnt_kids(big, ord)
794 IF((nk .GT. (rproc-nactive+1)) .OR. (nk .EQ. 0)) THEN
795 anode = anode+1
796 list(anode) = big
797 nactive = nactive-1
798 rproc = rproc-1
799 cycle
800 END IF
801 sd = dmumps_stop_descent(id, ord, nactive, anode,
802 & rproc, alist, list, peakmem, nnodes, checkmem=.true.)
803 IF ( sd )
804 & THEN
805 IF(nactive.GT.0) THEN
806 list(anode+1:anode+nactive) = alist(1:nactive)
807 anode = anode+nactive
808 END IF
809 EXIT
810 END IF
811 ord%TOPNODES(1) = ord%TOPNODES(1)+1
812 ord%TOPNODES(2) = ord%TOPNODES(2) +
813 & ord%RANGTAB(big+1) - ord%RANGTAB(big)
814 ord%TOPNODES(2+2*(ord%TOPNODES(1)-1)+1) = ord%RANGTAB(big)
815 ord%TOPNODES(2+2*(ord%TOPNODES(1)-1)+2) =
816 & ord%RANGTAB(big+1)-1
817 curr = ord%SON(big)
818 alist(nactive) = curr
819 aweights(nactive) = ord%NW(curr)
820 DO
821 IF(ord%BROTHER(curr) .EQ. -1) EXIT
822 nactive = nactive+1
823 curr = ord%BROTHER(curr)
824 alist(nactive) = curr
825 aweights(nactive) = ord%NW(curr)
826 END DO
827 CALL dmumps_mergesort(nactive, aweights(1:nactive),
828 & work(0:nactive+1))
829 CALL dmumps_mergeswap(nactive, work(0:nactive+1),
830 & aweights(1:nactive),
831 & alist(1:nactive))
832 END DO
833 DO i=1, anode
834 aweights(i) = ord%NW(list(i))
835 END DO
836 CALL dmumps_mergesort(anode, aweights(1:anode), work(0:anode+1))
837 CALL dmumps_mergeswap(anode, work(0:anode+1), aweights(1:anode),
838 & alist(1:anode))
839 IF (id%KEEP(46) .EQ. 1) THEN
840 base = 0
841 ELSE
842 ord%FIRST(1) = 0
843 ord%LAST(1) = -1
844 base = 1
845 END IF
846 DO i=1, anode
847 curr = list(i)
848 nd = curr
849 IF(ord%SON(nd) .NE. -1) THEN
850 nd = ord%SON(nd)
851 DO
852 IF((ord%SON(nd) .EQ. -1) .AND.
853 & (ord%BROTHER(nd).EQ.-1)) THEN
854 EXIT
855 ELSE IF(ord%BROTHER(nd) .EQ. -1) THEN
856 nd = ord%SON(nd)
857 ELSE
858 nd = ord%BROTHER(nd)
859 END IF
860 END DO
861 END IF
862 ord%FIRST(base+i) = ord%RANGTAB(nd)
863 ord%LAST(base+i) = ord%RANGTAB(curr+1)-1
864 END DO
865 DO i=anode+1, id%NSLAVES
866 ord%FIRST(base+i) = id%N+1
867 ord%LAST(base+i) = id%N
868 END DO
869 DEALLOCATE(list, alist, aweights, work)
870 90 continue
871 RETURN
872 END SUBROUTINE dmumps_get_subtrees
873 SUBROUTINE dmumps_parsymfact(id, ord, GPE, GNV, WORK)
874 IMPLICIT NONE
875 TYPE(dmumps_struc) :: id
876 TYPE(ord_type) :: ord
877 INTEGER, POINTER :: GPE(:), GNV(:)
878 INTEGER, TARGET :: WORK(:)
879 TYPE(graph_type) :: top_graph
880 INTEGER(8), POINTER :: IPE(:), IPET(:),
881 & buf_pe1(:), buf_pe2(:), tmp1(:)
882 INTEGER, POINTER :: PE(:),
883 & LENG(:), I_HALO_MAP(:)
884 INTEGER, POINTER :: NDENSE(:), LAST(:),
885 & DEGREE(:), W(:), PERM(:),
886 & listvar_schur(:), next(:),
887 & head(:), nv(:), elen(:),
888 & lstvar(:)
889 INTEGER, POINTER :: MYLIST(:),
890 & LPERM(:),
891 & liperm(:),
892 & nvt(:), buf_nv1(:),
893 & buf_nv2(:), rootperm(:),
894 & tmp2(:), bwork(:), ncliques(:)
895 INTEGER :: MYNCLIQUES, MYMAXVARS, ICLIQUES,
896 & TOTNCLIQUES
897 INTEGER(8) :: MYNVARS, TOTNVARS
898 INTEGER(8), POINTER :: LVARPT(:)
899 INTEGER :: HIDX, NCMPA, I, J, SIZE_SCHUR, MYID,
900 & nprocs, ierr, nrows_loc, glob_idx, tmp,
901 & ntvar, tgsize, maxs, rhandpe,
902 & rhandnv, ridx, proc, job, k
903 INTEGER(8) :: PFREES, PFS_SAVE, PELEN, PFREET, PFT_SAVE
904 INTEGER :: STATUSPE(MPI_STATUS_SIZE)
905 INTEGER :: STATUSNV(MPI_STATUS_SIZE)
906 INTEGER :: STATUSCLIQUES(MPI_STATUS_SIZE)
907 INTEGER, PARAMETER :: ITAG=30
908 LOGICAL :: AGG6
909 INTEGER :: THRESH
910 nullify(pe, ipe, leng, i_halo_map, ncliques)
911 nullify(ndense, last, degree, w, perm, listvar_schur,
912 & next, head, nv, elen, lstvar)
913 nullify(mylist, lvarpt,
914 & lperm, liperm, ipet, nvt, buf_pe1, buf_pe2,
915 & buf_nv1, buf_nv2, rootperm, tmp1, tmp2, bwork)
916 CALL mpi_comm_rank (id%COMM, myid, ierr)
917 CALL mpi_comm_size (id%COMM, nprocs, ierr)
918 IF(size(work) .LT. 4*id%N) THEN
919 WRITE(lp,*)'Insufficient workspace in DMUMPS_PARSYMFACT'
920 CALL mumps_abort()
921 ELSE
922 head => work( 1 : id%N)
923 elen => work( id%N+1 : 2*id%N)
924 leng => work(2*id%N+1 : 3*id%N)
925 perm => work(3*id%N+1 : 4*id%N)
926 END IF
927 CALL dmumps_get_subtrees(ord, id)
928 CALL mumps_idealloc(ord%SON, ord%BROTHER, ord%NW,
929 & ord%RANGTAB, memcnt=memcnt)
930 nrows_loc = ord%LAST(myid+1)-ord%FIRST(myid+1)+1
931 nrl = nrows_loc
932 toprows = ord%TOPNODES(2)
933 bwork => work(1 : 2*id%N)
934 CALL dmumps_build_loc_graph(id, ord, hidx, ipe, pe, leng,
935 & i_halo_map, top_graph, bwork)
936 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
937 & id%COMM, id%MYID )
938 IF(id%INFO(1).lt.0) RETURN
939 tmp = id%N
940 DO i=1, nprocs
941 tmp = tmp-(ord%LAST(i)-ord%FIRST(i)+1)
942 END DO
943 tmp = ceiling(dble(tmp)*1.10d0)
944 IF(myid .EQ. 0) THEN
945 tmp = max(max(tmp, hidx),1)
946 ELSE
947 tmp = max(hidx,1)
948 END IF
949 size_schur = hidx - nrows_loc
950 CALL mumps_realloc(ndense, tmp, id%INFO, lp,
951 & memcnt=memcnt, errcode=-7)
952 CALL mumps_realloc(last, tmp, id%INFO, lp,
953 & memcnt=memcnt, errcode=-7)
954 CALL mumps_realloc(next, tmp, id%INFO, lp,
955 & memcnt=memcnt, errcode=-7)
956 CALL mumps_realloc(degree, tmp, id%INFO, lp,
957 & memcnt=memcnt, errcode=-7)
958 CALL mumps_realloc(w, tmp, id%INFO, lp,
959 & memcnt=memcnt, errcode=-7)
960 CALL mumps_realloc(nv, tmp, id%INFO, lp,
961 & memcnt=memcnt, errcode=-7)
962 CALL mumps_realloc(listvar_schur, max(size_schur,1), id%INFO, lp,
963 & memcnt=memcnt, errcode=-7)
964 IF(memcnt .GT. maxmem) maxmem=memcnt
965 DO i=1, size_schur
966 listvar_schur(i) = nrows_loc+i
967 END DO
968 thresh = -1
969 agg6 = .false.
970 pfrees = ipe(nrows_loc+1)
971 pfs_save = pfrees
972 pelen = pfrees-1 + 2_8*int(nrows_loc+ord%TOPNODES(2),8)
973 DO i=1, hidx
974 perm(i) = i
975 END DO
976 IF(size_schur.EQ.0) THEN
977 job = 0
978 ELSE
979 job = 1
980 END IF
981 IF(hidx .GT.0) CALL mumps_symqamd_new(job, thresh, ndense(1),
982 & hidx, pelen, ipe(1), pfrees, leng(1), pe(1), nv(1),
983 & elen(1), last(1), ncmpa, degree(1), head(1), next(1),
984 & w(1), perm(1), listvar_schur(1), size_schur, agg6)
985 myncliques = 0
986 mynvars = 0
987 mymaxvars = 0
988 DO i=1, hidx
989 IF(ipe(i) .GT. 0) THEN
990 mymaxvars = max(mymaxvars,leng(i))
991 mynvars = mynvars+leng(i)
992 myncliques = myncliques+1
993 END IF
994 END DO
995 CALL mpi_reduce(mynvars, totnvars, 1, mpi_integer8,
996 & mpi_sum, 0, id%COMM, ierr)
997 CALL mumps_realloc(ncliques, nprocs, id%INFO,
998 & lp, string='NCLIQUES', memcnt=memcnt, errcode=-7)
999 CALL mpi_gather(myncliques, 1, mpi_integer, ncliques(1), 1,
1000 & mpi_integer, 0, id%COMM, ierr)
1001 IF(id%MYID.EQ.0) THEN
1002 totncliques = sum(ncliques)
1003 CALL mumps_i8realloc(lvarpt, totncliques+1, id%INFO,
1004 & lp, string='LVARPT', memcnt=memcnt, errcode=-7)
1005 CALL mumps_irealloc8(lstvar, totnvars, id%INFO,
1006 & lp, string='LSTVAR', memcnt=memcnt, errcode=-7)
1007 lvarpt(1) = 1_8
1008 icliques = 0
1009 DO i=1, hidx
1010 IF(ipe(i) .GT. 0) THEN
1011 icliques = icliques+1
1012 lvarpt(icliques+1) = lvarpt(icliques)+leng(i)
1013 DO j=0, leng(i)-1
1014 lstvar(lvarpt(icliques)+j) =
1015 & i_halo_map(pe(ipe(i)+j)-nrows_loc)
1016 END DO
1017 END IF
1018 END DO
1019 DO proc=1, nprocs-1
1020 DO i=1, ncliques(proc+1)
1021 icliques = icliques+1
1022 CALL mpi_recv(k, 1, mpi_integer, proc, itag, id%COMM,
1023 & statuscliques, ierr)
1024 lvarpt(icliques+1) = lvarpt(icliques)+k
1025 CALL mpi_recv(lstvar(lvarpt(icliques)), k, mpi_integer,
1026 & proc, itag, id%COMM, statuscliques, ierr)
1027 END DO
1028 END DO
1029 lperm => work(3*id%N+1 : 4*id%N)
1030 ntvar = ord%TOPNODES(2)
1031 CALL dmumps_make_loc_idx(id, ord%TOPNODES, lperm, liperm, ord)
1032 CALL dmumps_assemble_top_graph(id, ord%TOPNODES(2), lperm,
1033 & top_graph, totncliques, lstvar, lvarpt, ipet, pe,
1034 & leng, elen)
1035 tgsize = ord%TOPNODES(2)+totncliques
1036 pfreet = ipet(tgsize+1)
1037 pft_save = pfreet
1038 nullify(lperm)
1039 ELSE
1040 CALL mumps_realloc(mylist, mymaxvars, id%INFO,
1041 & lp, string='MYLIST', memcnt=memcnt, errcode=-7)
1042 IF(memcnt .GT. maxmem) maxmem=memcnt
1043 DO i=1, hidx
1044 IF(ipe(i) .GT. 0) THEN
1045 DO j=1, leng(i)
1046 mylist(j) = i_halo_map(pe(ipe(i)+j-1)-nrows_loc)
1047 END DO
1048 CALL mpi_send(leng(i), 1, mpi_integer, 0, itag,
1049 & id%COMM, ierr)
1050 CALL mpi_send(mylist(1), leng(i), mpi_integer, 0, itag,
1051 & id%COMM, ierr)
1052 END IF
1053 END DO
1054 END IF
1055 CALL mumps_idealloc(top_graph%IRN_LOC,
1056 & top_graph%JCN_LOC, ord%TOPNODES, memcnt=memcnt)
1057 IF(myid .EQ. 0) THEN
1058 CALL mumps_irealloc8(pe, max(pfreet+int(tgsize,8),1_8),id%INFO,
1059 & lp, copy=.true., string='J2:PE', memcnt=memcnt,
1060 & errcode=-7)
1061 CALL mumps_realloc(ndense, max(tgsize,1), id%INFO, lp,
1062 & string='J2:NDENSE', memcnt=memcnt, errcode=-7)
1063 CALL mumps_realloc(nvt, max(tgsize,1), id%INFO, lp,
1064 & string='J2:NVT', memcnt=memcnt, errcode=-7)
1065 CALL mumps_realloc(last, max(tgsize,1), id%INFO, lp,
1066 & string='J2:LAST', memcnt=memcnt, errcode=-7)
1067 CALL mumps_realloc(degree, max(tgsize,1), id%INFO, lp,
1068 & string='J2:DEGREE', memcnt=memcnt, errcode=-7)
1069 CALL mumps_realloc(next, max(tgsize,1), id%INFO, lp,
1070 & string='J2:NEXT', memcnt=memcnt, errcode=-7)
1071 CALL mumps_realloc(w, max(tgsize,1), id%INFO, lp,
1072 & string='J2:W', memcnt=memcnt, errcode=-7)
1073 CALL mumps_realloc(listvar_schur, max(totncliques,1), id%INFO,
1074 & lp, string='J2:LVSCH', memcnt=memcnt, errcode=-7)
1075 IF(memcnt .GT. maxmem) maxmem=memcnt
1076 DO i=1, totncliques
1077 listvar_schur(i) = ntvar+i
1078 END DO
1079 thresh = -1
1080 CALL mumps_realloc(head, max(tgsize,1), id%INFO,
1081 & lp, string='J2:HEAD', memcnt=memcnt, errcode=-7)
1082 CALL mumps_realloc(perm, max(tgsize,1), id%INFO,
1083 & lp, copy=.true., string='J2:PERM',
1084 & memcnt=memcnt, errcode=-7)
1085 IF(memcnt .GT. maxmem) maxmem=memcnt
1086 DO i=1, tgsize
1087 perm(i) = i
1088 END DO
1089 pelen = max(pfreet+int(tgsize,8),1_8)
1090 IF(tgsize.GT.0) CALL mumps_symqamd_new(2, -1, ndense(1),
1091 & tgsize, pelen, ipet(1), pfreet, leng(1), pe(1),
1092 & nvt(1), elen(1), last(1), ncmpa, degree(1), head(1),
1093 & next(1), w(1), perm(1), listvar_schur(1), totncliques,
1094 & agg6)
1095 END IF
1096 CALL mpi_barrier(id%COMM, ierr)
1097 CALL mpi_barrier(id%COMM, ierr)
1098 CALL mumps_dealloc(listvar_schur, memcnt=memcnt)
1099 CALL mumps_dealloc(pe, memcnt=memcnt)
1100 IF(myid .EQ. 0) THEN
1101 maxs = nrows_loc
1102 DO i=2, nprocs
1103 IF((ord%LAST(i)-ord%FIRST(i)+1) .GT. maxs)
1104 & maxs = (ord%LAST(i)-ord%FIRST(i)+1)
1105 END DO
1106 CALL mumps_i8realloc(buf_pe1, max(maxs,1), id%INFO,
1107 & lp, string='BUF_PE1', memcnt=memcnt, errcode=-7)
1108 CALL mumps_i8realloc(buf_pe2, max(maxs,1), id%INFO,
1109 & lp, string='BUF_PE2', memcnt=memcnt, errcode=-7)
1110 CALL mumps_realloc(buf_nv1, max(maxs,1), id%INFO,
1111 & lp, string='BUF_NV1', memcnt=memcnt, errcode=-7)
1112 CALL mumps_realloc(buf_nv2, max(maxs,1), id%INFO,
1113 & lp, string='BUF_NV2', memcnt=memcnt, errcode=-7)
1114 CALL mumps_realloc(gpe, id%N, id%INFO,
1115 & lp, string='GPE', memcnt=memcnt, errcode=-7)
1116 CALL mumps_realloc(gnv, id%N, id%INFO,
1117 & lp, string='GNV', memcnt=memcnt, errcode=-7)
1118 CALL mumps_realloc(rootperm, totncliques, id%INFO,
1119 & lp, string='ROOTPERM', memcnt=memcnt, errcode=-7)
1120 IF(memcnt .GT. maxmem) maxmem=memcnt
1121 ridx = 0
1122 tmp1 => buf_pe1
1123 tmp2 => buf_nv1
1124 NULLIFY(buf_pe1, buf_nv1)
1125 buf_pe1 => ipe
1126 buf_nv1 => nv
1127 DO proc=0, nprocs-2
1128 CALL mpi_irecv(buf_pe2(1), ord%LAST(proc+2)-
1129 & ord%FIRST(proc+2)+1, mpi_integer8, proc+1, proc+1,
1130 & id%COMM, rhandpe, ierr)
1131 CALL mpi_irecv(buf_nv2(1), ord%LAST(proc+2)-
1132 & ord%FIRST(proc+2)+1, mpi_integer, proc+1, proc+1,
1133 & id%COMM, rhandnv, ierr)
1134 DO i=1, ord%LAST(proc+1)-ord%FIRST(proc+1)+1
1135 glob_idx = ord%PERITAB(i+ord%FIRST(proc+1)-1)
1136 IF(buf_pe1(i) .GT. 0) THEN
1137 ridx=ridx+1
1138 rootperm(ridx) = glob_idx
1139 gnv(glob_idx) = buf_nv1(i)
1140 ELSE IF (buf_pe1(i) .EQ. 0) THEN
1141 gpe(glob_idx) = 0
1142 gnv(glob_idx) = buf_nv1(i)
1143 ELSE
1144 gpe(glob_idx) = -ord%PERITAB(-buf_pe1(i)+
1145 & ord%FIRST(proc+1)-1)
1146 gnv(glob_idx) = buf_nv1(i)
1147 END IF
1148 END DO
1149 CALL mpi_wait(rhandpe, statuspe, ierr)
1150 CALL mpi_wait(rhandnv, statusnv, ierr)
1151 IF(proc .NE. 0) THEN
1152 tmp1 => buf_pe1
1153 tmp2 => buf_nv1
1154 END IF
1155 buf_pe1 => buf_pe2
1156 buf_nv1 => buf_nv2
1157 NULLIFY(buf_pe2, buf_nv2)
1158 buf_pe2 => tmp1
1159 buf_nv2 => tmp2
1160 NULLIFY(tmp1, tmp2)
1161 END DO
1162 DO i=1, ord%LAST(proc+1)-ord%FIRST(proc+1)+1
1163 glob_idx = ord%PERITAB(i+ord%FIRST(proc+1)-1)
1164 IF(buf_pe1(i) .GT. 0) THEN
1165 ridx=ridx+1
1166 rootperm(ridx) = glob_idx
1167 gnv(glob_idx) = buf_nv1(i)
1168 ELSE IF (buf_pe1(i) .EQ. 0) THEN
1169 gpe(glob_idx) = 0
1170 gnv(glob_idx) = buf_nv1(i)
1171 ELSE
1172 gpe(glob_idx) = -ord%PERITAB(-buf_pe1(i)+
1173 & ord%FIRST(proc+1)-1)
1174 gnv(glob_idx) = buf_nv1(i)
1175 END IF
1176 END DO
1177 DO i=1, ntvar
1178 glob_idx = liperm(i)
1179 IF(ipet(i) .EQ. 0) THEN
1180 gpe(glob_idx) = 0
1181 gnv(glob_idx) = nvt(i)
1182 ELSE
1183 gpe(glob_idx) = -liperm(-ipet(i))
1184 gnv(glob_idx) = nvt(i)
1185 END IF
1186 END DO
1187 DO i=1, totncliques
1188 glob_idx = rootperm(i)
1189 gpe(glob_idx) = -liperm(-ipet(ntvar+i))
1190 END DO
1191 ELSE
1192 CALL mpi_send(ipe(1), ord%LAST(myid+1)-ord%FIRST(myid+1)+1,
1193 & mpi_integer8, 0, myid, id%COMM, ierr)
1194 CALL mpi_send(nv(1), ord%LAST(myid+1)-ord%FIRST(myid+1)+1,
1195 & mpi_integer, 0, myid, id%COMM, ierr)
1196 END IF
1197 CALL mumps_dealloc(buf_nv1, buf_nv2, memcnt=memcnt)
1198 CALL mumps_i8dealloc(buf_pe1, buf_pe2, ipe, ipet,
1199 & tmp1, lvarpt, memcnt=memcnt)
1200 CALL mumps_dealloc(pe, i_halo_map, ndense,
1201 & last, degree, memcnt=memcnt)
1202 CALL mumps_dealloc(w, listvar_schur, next,
1203 & nv, memcnt=memcnt)
1204 CALL mumps_dealloc(lstvar, ncliques, mylist,
1205 & memcnt=memcnt)
1206 CALL mumps_dealloc(lperm, liperm, nvt, memcnt=memcnt)
1207 CALL mumps_dealloc(rootperm, tmp2, memcnt=memcnt)
1208 NULLIFY(head, elen, leng, perm)
1209 RETURN
1210 END SUBROUTINE dmumps_parsymfact
1211 SUBROUTINE dmumps_make_loc_idx(id, TOPNODES, LPERM, LIPERM, ord)
1212 IMPLICIT NONE
1213 TYPE(dmumps_struc) :: id
1214 INTEGER, POINTER :: TOPNODES(:), LPERM(:), LIPERM(:)
1215 TYPE(ord_type) :: ord
1216 INTEGER :: I, J, K, GIDX
1217 CALL mumps_realloc(lperm , ord%N, id%INFO,
1218 & lp, string='LIDX:LPERM', memcnt=memcnt, errcode=-7)
1219 CALL mumps_realloc(liperm, topnodes(2), id%INFO,
1220 & lp, string='LIDX:LIPERM', memcnt=memcnt, errcode=-7)
1221 IF(memcnt .GT. maxmem) maxmem=memcnt
1222 lperm = 0
1223 k = 1
1224 DO i=topnodes(1), 1, -1
1225 DO j=topnodes(2*i+1), topnodes(2*i+2)
1226 gidx = ord%PERITAB(j)
1227 lperm(gidx) = k
1228 liperm(k) = gidx
1229 k = k+1
1230 END DO
1231 END DO
1232 RETURN
1233 END SUBROUTINE dmumps_make_loc_idx
1234 SUBROUTINE dmumps_assemble_top_graph(id, NLOCVARS, LPERM,
1235 & top_graph, NCLIQUES, LSTVAR, LVARPT, IPE, PE, LENG, ELEN)
1236 IMPLICIT NONE
1237 TYPE(dmumps_struc) :: id
1238 TYPE(GRAPH_TYPE) :: top_graph
1239 INTEGER, POINTER :: LPERM(:), LSTVAR(:),
1240 & pe(:), leng(:), elen(:)
1241 INTEGER(8) :: LVARPT(:)
1242 INTEGER :: NCLIQUES
1243 INTEGER(8), POINTER :: IPE(:)
1244 INTEGER :: I, IDX, NLOCVARS
1245 INTEGER(8) :: INNZ, PNT, SAVEPNT
1246 CALL mumps_realloc(leng, max(nlocvars+ncliques,1) , id%INFO,
1247 & lp, string='ATG:LENG', memcnt=memcnt, errcode=-7)
1248 CALL mumps_realloc(elen, max(nlocvars+ncliques,1) , id%INFO,
1249 & lp, string='ATG:ELEN', memcnt=memcnt, errcode=-7)
1250 CALL mumps_i8realloc(ipe , nlocvars+ncliques+1, id%INFO,
1251 & lp, string='ATG:IPE', memcnt=memcnt, errcode=-7)
1252 IF(memcnt .GT. maxmem) maxmem=memcnt
1253 leng = 0
1254 elen = 0
1255 DO innz=1, top_graph%NZ_LOC
1256 IF((lperm(top_graph%JCN_LOC(innz)) .NE. 0) .AND.
1257 & (top_graph%JCN_LOC(innz) .NE. top_graph%IRN_LOC(innz)))
1258 & THEN
1259 leng(lperm(top_graph%IRN_LOC(innz))) =
1260 & leng(lperm(top_graph%IRN_LOC(innz))) + 1
1261 END IF
1262 END DO
1263 DO i=1, ncliques
1264 DO innz=lvarpt(i), lvarpt(i+1)-1
1265 elen(lperm(lstvar(innz))) = elen(lperm(lstvar(innz)))+1
1266 leng(nlocvars+i) = leng(nlocvars+i)+1
1267 END DO
1268 END DO
1269 ipe(1) = 1
1270 DO i=1, nlocvars+ncliques
1271 ipe(i+1) = ipe(i)+int(leng(i),8)+int(elen(i),8)
1272 END DO
1273 CALL mumps_irealloc8(pe, ipe(nlocvars+ncliques+1)+
1274 & int(nlocvars,8)+int(ncliques,8),
1275 & id%INFO, lp, string='ATG:PE', memcnt=memcnt, errcode=-7)
1276 IF(memcnt .GT. maxmem) maxmem=memcnt
1277 leng = 0
1278 elen = 0
1279 DO i=1, ncliques
1280 DO innz=lvarpt(i), lvarpt(i+1)-1
1281 idx = lperm(lstvar(innz))
1282 pe(ipe(idx)+int(elen(idx),8)) = nlocvars+i
1283 pe(ipe(nlocvars+i)+int(leng(nlocvars+i),8)) = idx
1284 elen(lperm(lstvar(innz))) = elen(lperm(lstvar(innz)))+1
1285 leng(nlocvars+i) = leng(nlocvars+i)+1
1286 end do
1287 end do
1288 DO innz=1, top_graph%NZ_LOC
1289 IF((lperm(top_graph%JCN_LOC(innz)) .NE. 0) .AND.
1290 & (top_graph%JCN_LOC(innz) .NE. top_graph%IRN_LOC(innz)))
1291 & THEN
1292 pe(ipe(lperm(top_graph%IRN_LOC(innz)))+
1293 & elen(lperm(top_graph%IRN_LOC(innz))) +
1294 & leng(lperm(top_graph%IRN_LOC(innz)))) =
1295 & lperm(top_graph%JCN_LOC(innz))
1296 leng(lperm(top_graph%IRN_LOC(innz))) =
1297 & leng(lperm(top_graph%IRN_LOC(innz))) + 1
1298 END IF
1299 END DO
1300 DO i=1, nlocvars+ncliques
1301 leng(i) = leng(i)+elen(i)
1302 END DO
1303 savepnt = 1
1304 pnt = 0
1305 lperm(1:nlocvars+ncliques) = 0
1306 DO i=1, nlocvars+ncliques
1307 DO innz=ipe(i), ipe(i+1)-1
1308 IF(lperm(pe(innz)) .EQ. i) THEN
1309 leng(i) = leng(i)-1
1310 ELSE
1311 lperm(pe(innz)) = i
1312 pnt = pnt+1
1313 pe(pnt) = pe(innz)
1314 END IF
1315 END DO
1316 ipe(i) = savepnt
1317 savepnt = pnt+1
1318 END DO
1319 ipe(nlocvars+ncliques+1) = savepnt
1320 RETURN
1321 END SUBROUTINE dmumps_assemble_top_graph
1322#if defined(parmetis) || defined(parmetis3)
1323 SUBROUTINE dmumps_build_treetab(TREETAB, RANGTAB, SIZES, CBLKNBR)
1324 INTEGER, POINTER :: TREETAB(:), RANGTAB(:), SIZES(:)
1325 INTEGER :: CBLKNBR,allocok
1326 INTEGER :: LCHILD, RCHILD, K, I
1327 INTEGER, POINTER :: PERM(:)
1328 ALLOCATE(perm(cblknbr),stat=allocok)
1329 if(allocok.GT.0) then
1330 write(*,*) "Allocation error of PERM in DMUMPS_BUILD_TREETAB"
1331 return
1332 endif
1333 treetab(cblknbr) = -1
1334 IF(cblknbr .EQ. 1) THEN
1335 DEALLOCATE(perm)
1336 treetab(1) = -1
1337 rangtab(1) = 1
1338 rangtab(2)= sizes(1)+1
1339 RETURN
1340 END IF
1341 lchild = cblknbr - (cblknbr+1)/2
1342 rchild = cblknbr-1
1343 k = 1
1344 perm(cblknbr) = cblknbr
1345 perm(lchild) = cblknbr+1 - (2*k+1)
1346 perm(rchild) = cblknbr+1 - (2*k)
1347 treetab(rchild) = cblknbr
1348 treetab(lchild) = cblknbr
1349 IF(cblknbr .GT. 3) THEN
1350 CALL rec_treetab(treetab, perm, (cblknbr-1)/2,
1351 & lchild, cblknbr, 2*k+1)
1352 CALL rec_treetab(treetab, perm, (cblknbr-1)/2,
1353 & rchild, cblknbr, 2*k)
1354 END IF
1355 rangtab(1)=1
1356 DO i=1, cblknbr
1357 rangtab(i+1) = rangtab(i)+sizes(perm(i))
1358 END DO
1359 DEALLOCATE(perm)
1360 RETURN
1361 CONTAINS
1362 RECURSIVE SUBROUTINE rec_treetab(TREETAB, PERM, SUBNODES,
1363 & ROOTN, CBLKNBR, K)
1364 INTEGER, POINTER :: TREETAB(:), PERM(:)
1365 INTEGER :: SUBNODES, ROOTN, K, CBLKNBR
1366 INTEGER :: LCHILD, RCHILD
1367 LCHILD = rootn - (subnodes+1)/2
1368 rchild = rootn-1
1369 perm(lchild) = cblknbr+1 - (2*k+1)
1370 perm(rchild) = cblknbr+1 - (2*k)
1371 treetab(rchild) = rootn
1372 treetab(lchild) = rootn
1373 IF(subnodes .GT. 3) THEN
1374 CALL rec_treetab(treetab, perm, (subnodes-1)/2, lchild,
1375 & cblknbr, 2*k+1)
1376 CALL rec_treetab(treetab, perm, (subnodes-1)/2, rchild,
1377 & cblknbr, 2*k)
1378 END IF
1379 END SUBROUTINE rec_treetab
1380 END SUBROUTINE dmumps_build_treetab
1381#endif
1382#if defined(ptscotch) || defined(parmetis) || defined(parmetis3)
1383 SUBROUTINE dmumps_build_dist_graph(id, FIRST, LAST, IPE,
1384 & PE, WORK)
1385 IMPLICIT NONE
1386 TYPE(dmumps_struc) :: id
1387 INTEGER(8), POINTER :: IPE(:)
1388 INTEGER, POINTER :: FIRST(:), LAST(:), PE(:),
1389 & WORK(:)
1390 INTEGER :: IERR, MYID, NPROCS
1391 INTEGER :: I, PROC, J, LOC_ROW
1392 INTEGER(8) :: LOCNNZ, INNZ, NEW_LOCNNZ, OFFDIAG,
1393 & rcvpnt, pnt, savepnt, dups, totdups
1394 INTEGER :: NROWS_LOC
1395 INTEGER :: STATUS(MPI_STATUS_SIZE)
1396 INTEGER, POINTER :: MAPTAB(:)
1397 INTEGER(8), POINTER :: MSGCNT(:), SNDCNT(:), RCVCNT(:)
1398 INTEGER, POINTER :: RDISPL(:), BUFLEVEL(:),
1399 & sipes(:,:), leng(:)
1400 INTEGER, POINTER :: TSENDI(:),
1401 & tsendj(:), rcvbuf(:)
1402 TYPE(arrpnt), POINTER :: APNT(:)
1403 INTEGER :: BUFSIZE, SOURCE, MAXS, allocok
1404 INTEGER, PARAMETER :: ITAG=30
1405 LOGICAL :: FLAG
1406 DOUBLE PRECISION :: SYMMETRY
1407 INTEGER(KIND=8) :: TLEN
1408#if defined(DETERMINISTIC_PARALLEL_GRAPH)
1409 INTEGER :: L
1410#endif
1411 nullify(maptab, sndcnt, rcvcnt)
1412 nullify(rdispl, msgcnt, sipes, leng, buflevel)
1413 nullify(tsendi, tsendj, rcvbuf, apnt)
1414 CALL mpi_comm_rank (id%COMM, myid, ierr)
1415 CALL mpi_comm_size (id%COMM, nprocs, ierr)
1416 IF(mumps_getsize(work) .LT. id%N*2) THEN
1417 WRITE(lp,
1418 & '("Insufficient workspace inside BUILD_SCOTCH_GRAPH")')
1419 CALL mumps_abort()
1420 END IF
1421 CALL mumps_i8realloc(sndcnt, nprocs, id%INFO, lp,
1422 & memcnt=memcnt, errcode=-7)
1423 CALL mumps_i8realloc(rcvcnt, nprocs, id%INFO, lp,
1424 & memcnt=memcnt, errcode=-7)
1425 CALL mumps_i8realloc(msgcnt, nprocs, id%INFO, lp,
1426 & memcnt=memcnt, errcode=-7)
1427 CALL mumps_realloc(rdispl, nprocs, id%INFO, lp,
1428 & memcnt=memcnt, errcode=-7)
1429 IF(memcnt .GT. maxmem) maxmem=memcnt
1430 ALLOCATE(apnt(nprocs), stat=allocok)
1431 IF(allocok.GT.0) THEN
1432 id%INFO(1)=-13
1433 id%INFO(2)=nprocs
1434 ENDIF
1435 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1), id%COMM, id%MYID )
1436 IF ( id%INFO(1) .LT. 0 ) GO TO 90
1437 sndcnt = 0
1438 bufsize = 1000
1439 bufsize = id%KEEP(39)
1440 locnnz = id%KEEP8(29)
1441 nrows_loc = last(myid+1)-first(myid+1)+1
1442 maptab => work( 1 : id%N)
1443 leng => work(id%N+1 : 2*id%N)
1444 maxs = 0
1445 DO i=1, nprocs
1446 IF((last(i)-first(i)+1) .GT. maxs) THEN
1447 maxs = last(i)-first(i)+1
1448 END IF
1449 DO j=first(i), last(i)
1450 maptab(j) = i
1451 END DO
1452 END DO
1453 ALLOCATE(sipes(max(1,maxs), nprocs), stat=allocok)
1454 IF(allocok.GT.0) THEN
1455 id%INFO(1)=-13
1456 id%INFO(2)=max(1,maxs)*nprocs
1457 ENDIF
1458 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1), id%COMM, id%MYID )
1459 IF ( id%INFO(1) .LT. 0 ) GO TO 90
1460 offdiag=0
1461 sipes=0
1462 DO innz=1, locnnz
1463 IF(id%IRN_loc(innz) .NE. id%JCN_loc(innz)) THEN
1464 offdiag = offdiag+1
1465 proc = maptab(id%IRN_loc(innz))
1466 loc_row = id%IRN_loc(innz)-first(proc)+1
1467 sipes(loc_row, proc) = sipes(loc_row, proc)+1
1468 sndcnt(proc) = sndcnt(proc)+1
1469 proc = maptab(id%JCN_loc(innz))
1470 loc_row = id%JCN_loc(innz)-first(proc)+1
1471 sipes(loc_row, proc) = sipes(loc_row, proc)+1
1472 sndcnt(proc) = sndcnt(proc)+1
1473 END IF
1474 END DO
1475 CALL mpi_allreduce (offdiag, id%KEEP8(127), 1, mpi_integer8,
1476 & mpi_sum, id%COMM, ierr)
1477 id%KEEP8(127) = id%KEEP8(127)+3*id%N
1478 id%KEEP8(126) = id%KEEP8(127)-2*id%N
1479 CALL mpi_alltoall(sndcnt(1), 1, mpi_integer8, rcvcnt(1), 1,
1480 & mpi_integer8, id%COMM, ierr)
1481 CALL mumps_i8dealloc(sndcnt, memcnt=memcnt)
1482 rdispl(:) = maxs
1483 CALL mpi_reduce_scatter ( sipes(1,1), leng(1), rdispl(1),
1484 & mpi_integer, mpi_sum, id%COMM, ierr )
1485 DEALLOCATE(sipes)
1486 tlen = 0_8
1487 ipe(1) = 1_8
1488 DO i=1, nrows_loc
1489 ipe(i+1) = ipe(i) + int(leng(i),8)
1490 tlen = tlen+int(leng(i),8)
1491 END DO
1492 CALL mumps_irealloc8(pe, max(ipe(nrows_loc+1)-1_8,1_8), id%INFO,
1493 & lp, string='PE', memcnt=memcnt, errcode=-7)
1494 IF(memcnt .GT. maxmem) maxmem=memcnt
1495 leng(:) = 0
1496 CALL mumps_realloc(buflevel, nprocs, id%INFO, lp,
1497 & memcnt=memcnt, errcode=-7)
1498 CALL dmumps_send_buf(apnt, proc, nprocs, bufsize, ipe, pe, leng,
1499 & rcvbuf, msgcnt, buflevel, id%COMM)
1500 new_locnnz = 0
1501 DO i=1, nprocs
1502 new_locnnz = new_locnnz+rcvcnt(i)
1503 msgcnt(i) = rcvcnt(i)/int(bufsize,8)
1504 END DO
1505 rcvpnt = 1
1506 buflevel = 0
1507 DO innz=1, locnnz
1508 IF(mod(innz,int(bufsize,8)/10_8) .EQ. 0) THEN
1509 CALL mpi_iprobe( mpi_any_source, itag, id%COMM,
1510 & flag, status, ierr )
1511 IF(flag) THEN
1512 source = status(mpi_source)
1513 CALL mpi_recv(rcvbuf(1), 2*bufsize, mpi_integer, source,
1514 & itag, id%COMM, status, ierr)
1515 CALL dmumps_assemble_msg(bufsize, rcvbuf, ipe, pe, leng)
1516 msgcnt(source+1)=msgcnt(source+1)-1
1517 rcvpnt = rcvpnt + bufsize
1518 END IF
1519 END IF
1520 IF(id%IRN_loc(innz) .NE. id%JCN_loc(innz)) THEN
1521 proc = maptab(id%IRN_loc(innz))
1522 apnt(proc)%BUF(2*buflevel(proc)+1) = id%IRN_loc(innz)-
1523 & first(proc)+1
1524 apnt(proc)%BUF(2*buflevel(proc)+2) = id%JCN_loc(innz)
1525 buflevel(proc) = buflevel(proc)+1
1526 IF(buflevel(proc) .EQ. bufsize) THEN
1527 CALL dmumps_send_buf(apnt, proc, nprocs, bufsize, ipe,
1528 & pe, leng, rcvbuf, msgcnt, buflevel, id%COMM)
1529 END IF
1530 proc = maptab(id%JCN_loc(innz))
1531 apnt(proc)%BUF(2*buflevel(proc)+1) = id%JCN_loc(innz)-
1532 & first(proc)+1
1533 apnt(proc)%BUF(2*buflevel(proc)+2) = id%IRN_loc(innz)
1534 buflevel(proc) = buflevel(proc)+1
1535 IF(buflevel(proc) .EQ. bufsize) THEN
1536 CALL dmumps_send_buf(apnt, proc, nprocs, bufsize, ipe,
1537 & pe, leng, rcvbuf, msgcnt, buflevel, id%COMM)
1538 END IF
1539 END IF
1540 END DO
1541 CALL dmumps_send_buf(apnt, -1, nprocs, bufsize, ipe, pe, leng,
1542 & rcvbuf, msgcnt, buflevel, id%COMM)
1543 dups = 0
1544 pnt = 0
1545 savepnt = 1
1546 maptab = 0
1547 DO i=1, nrows_loc
1548 DO innz=ipe(i),ipe(i+1)-1
1549 IF(maptab(pe(innz)) .EQ. i) THEN
1550 dups = dups+1
1551 ELSE
1552 maptab(pe(innz)) = i
1553 pnt = pnt+1
1554 pe(pnt) = pe(innz)
1555 END IF
1556 END DO
1557 ipe(i) = savepnt
1558 savepnt = pnt+1
1559 END DO
1560 CALL mpi_reduce( dups, totdups, 1, mpi_integer8, mpi_sum,
1561 & 0, id%COMM, ierr )
1562 IF(myid .EQ. 0) THEN
1563 symmetry = dble(totdups)/(dble(id%KEEP8(28))-dble(id%N))
1564 symmetry = min(symmetry,1.0d0)
1565 IF(id%KEEP(50) .GE. 1) symmetry = 1.d0
1566 IF(prokg) WRITE(mpg,'(" Structural symmetry is:",i3,"%")')
1567 & ceiling(symmetry*100.d0)
1568 id%INFOG(8) = ceiling(symmetry*100.0d0)
1569 END IF
1570 ipe(nrows_loc+1) = savepnt
1571 CALL mumps_dealloc(buflevel, rdispl, memcnt=memcnt)
1572 CALL mumps_i8dealloc(msgcnt, sndcnt, rcvcnt, memcnt=memcnt)
1573 DEALLOCATE(apnt)
1574#if defined(DETERMINISTIC_PARALLEL_GRAPH)
1575 DO i=1, last(myid+1)-first(myid+1)+1
1576 l = int(ipe(i+1)-ipe(i))
1577 CALL dmumps_mergesort(l,
1578 & pe(ipe(i):ipe(i+1)-1),
1579 & work(:))
1580 CALL dmumps_mergeswap1(l, work(:),
1581 & pe(ipe(i):ipe(i+1)-1))
1582 END DO
1583#endif
1584 90 continue
1585 RETURN
1586 END SUBROUTINE dmumps_build_dist_graph
1587#endif
1588 SUBROUTINE dmumps_build_loc_graph(id, ord, GSIZE, IPE, PE, LENG,
1589 & I_HALO_MAP, top_graph, WORK)
1590 IMPLICIT NONE
1591 TYPE(dmumps_struc) :: id
1592 TYPE(ord_type) :: ord
1593 TYPE(GRAPH_TYPE) :: top_graph
1594 INTEGER(8), POINTER :: IPE(:)
1595 INTEGER, POINTER :: PE(:), LENG(:),
1596 & i_halo_map(:), work(:)
1597 INTEGER :: GSIZE
1598 INTEGER :: IERR, MYID, NPROCS
1599 INTEGER :: I, PROC, J, LOC_ROW
1600 INTEGER(8) :: LOCNNZ, INNZ, NEW_LOCNNZ, TOP_CNT, TIDX,
1601 & rcvpnt
1602 INTEGER :: IIDX,JJDX
1603 INTEGER :: HALO_SIZE, NROWS_LOC, DUPS
1604 INTEGER :: STATUS(MPI_STATUS_SIZE)
1605 INTEGER(8), POINTER :: MSGCNT(:), SNDCNT(:), RCVCNT(:)
1606 INTEGER, POINTER :: MAPTAB(:),
1607 & HALO_MAP(:), BUFLEVEL(:)
1608 INTEGER, POINTER :: RDISPL(:),
1609 & sipes(:,:)
1610 INTEGER, POINTER :: TSENDI(:),
1611 & tsendj(:), rcvbuf(:)
1612 TYPE(arrpnt), POINTER :: APNT(:)
1613 INTEGER :: BUFSIZE, SOURCE, MAXS, allocok
1614 INTEGER(8) :: PNT, SAVEPNT
1615 INTEGER, PARAMETER :: ITAG=30
1616 INTEGER(KIND=8) :: TLEN
1617 LOGICAL :: FLAG
1618 nullify(maptab, sndcnt, rcvcnt, halo_map)
1619 nullify(rdispl, msgcnt, sipes, buflevel)
1620 nullify(tsendi, tsendj, rcvbuf, apnt)
1621 CALL mpi_comm_rank (id%COMM, myid, ierr)
1622 CALL mpi_comm_size (id%COMM, nprocs, ierr)
1623 IF(mumps_getsize(work) .LT. id%N*2) THEN
1624 WRITE(lp,
1625 & '("Insufficient workspace inside BUILD_LOC_GRAPH")')
1626 CALL mumps_abort()
1627 END IF
1628 maptab => work( 1 : id%N)
1629 halo_map => work(id%N+1 : 2*id%N)
1630 CALL mumps_i8realloc(sndcnt, nprocs, id%INFO, lp,
1631 & memcnt=memcnt, errcode=-7)
1632 CALL mumps_i8realloc(rcvcnt, nprocs, id%INFO, lp,
1633 & memcnt=memcnt, errcode=-7)
1634 CALL mumps_i8realloc(msgcnt, nprocs, id%INFO, lp,
1635 & memcnt=memcnt, errcode=-7)
1636 CALL mumps_realloc(rdispl, nprocs, id%INFO, lp,
1637 & memcnt=memcnt, errcode=-7)
1638 IF(memcnt .GT. maxmem) maxmem=memcnt
1639 ALLOCATE(apnt(nprocs), stat=allocok)
1640 IF(allocok.GT.0) THEN
1641 id%INFO(1)=-13
1642 id%INFO(2)=nprocs
1643 ENDIF
1644 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1), id%COMM, id%MYID )
1645 IF ( id%INFO(1) .LT. 0 ) GO TO 90
1646 sndcnt = 0
1647 top_cnt = 0
1648 bufsize = 10000
1649 locnnz = id%KEEP8(29)
1650 nrows_loc = ord%LAST(myid+1)-ord%FIRST(myid+1)+1
1651 maptab = 0
1652 maxs = 0
1653 DO i=1, nprocs
1654 IF((ord%LAST(i)-ord%FIRST(i)+1) .GT. maxs) THEN
1655 maxs = ord%LAST(i)-ord%FIRST(i)+1
1656 END IF
1657 DO j=ord%FIRST(i), ord%LAST(i)
1658 maptab(ord%PERITAB(j)) = i
1659 END DO
1660 END DO
1661 ALLOCATE(sipes(max(1,maxs), nprocs), stat=allocok)
1662 IF(allocok.GT.0) THEN
1663 id%INFO(1)=-13
1664 id%INFO(2)=max(1,maxs)*nprocs
1665 ENDIF
1666 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1), id%COMM, id%MYID )
1667 IF ( id%INFO(1) .LT. 0 ) GO TO 90
1668 sipes(:,:) = 0
1669 top_cnt = 0
1670 DO innz=1, locnnz
1671 IF(id%IRN_loc(innz) .NE. id%JCN_loc(innz)) THEN
1672 proc = maptab(id%IRN_loc(innz))
1673 IF(proc .EQ. 0) THEN
1674 top_cnt = top_cnt+1
1675 ELSE
1676 iidx = ord%PERMTAB(id%IRN_loc(innz))
1677 loc_row = iidx-ord%FIRST(proc)+1
1678 sipes(loc_row, proc) = sipes(loc_row, proc)+1
1679 sndcnt(proc) = sndcnt(proc)+1
1680 END IF
1681 proc = maptab(id%JCN_loc(innz))
1682 IF(proc .EQ. 0) THEN
1683 top_cnt = top_cnt+1
1684 ELSE
1685 iidx = ord%PERMTAB(id%JCN_loc(innz))
1686 loc_row = iidx-ord%FIRST(proc)+1
1687 sipes(loc_row, proc) = sipes(loc_row, proc)+1
1688 sndcnt(proc) = sndcnt(proc)+1
1689 END IF
1690 END IF
1691 END DO
1692 CALL mpi_alltoall(sndcnt(1), 1, mpi_integer8, rcvcnt(1), 1,
1693 & mpi_integer8, id%COMM, ierr)
1694 i = ceiling(dble(maxs)*1.20d0)
1695 CALL mumps_realloc(leng, max(i,1), id%INFO,
1696 & lp, string='B_L_G:LENG', memcnt=memcnt, errcode=-7)
1697 IF(memcnt .GT. maxmem) maxmem=memcnt
1698 CALL mumps_i8dealloc(sndcnt, memcnt=memcnt)
1699 rdispl(:) = maxs
1700 CALL mpi_reduce_scatter ( sipes(1,1), leng(1), rdispl(1),
1701 & mpi_integer, mpi_sum, id%COMM, ierr )
1702 DEALLOCATE(sipes)
1703 i = ceiling(dble(nrows_loc+1)*1.20d0)
1704 CALL mumps_i8realloc(ipe, max(i,1), id%INFO,
1705 & lp, string='B_L_G:IPE', memcnt=memcnt, errcode=-7)
1706 IF(memcnt .GT. maxmem) maxmem=memcnt
1707 tlen = 0_8
1708 ipe(1) = 1_8
1709 DO i=1, nrows_loc
1710 ipe(i+1) = ipe(i) + int(leng(i),8)
1711 tlen = tlen+int(leng(i),8)
1712 END DO
1713 CALL mumps_irealloc8(tsendi, max(top_cnt,1_8), id%INFO, lp,
1714 & memcnt=memcnt, errcode=-7)
1715 CALL mumps_irealloc8(tsendj, max(top_cnt,1_8), id%INFO, lp,
1716 & memcnt=memcnt, errcode=-7)
1717 IF(memcnt .GT. maxmem) maxmem=memcnt
1718 leng(:) = 0
1719 CALL mumps_realloc(buflevel, nprocs, id%INFO, lp,
1720 & memcnt=memcnt, errcode=-7)
1721 CALL dmumps_send_buf(apnt, proc, nprocs, bufsize, ipe, pe,
1722 & leng, rcvbuf, msgcnt, buflevel, id%COMM)
1723 new_locnnz = 0
1724 DO i=1, nprocs
1725 new_locnnz = new_locnnz + rcvcnt(i)
1726 msgcnt(i) = rcvcnt(i)/int(bufsize,8)
1727 END DO
1728 CALL mumps_irealloc8(pe, max(new_locnnz+
1729 & 2_8*int(nrows_loc+ord%TOPNODES(2),8),1_8),
1730 & id%INFO, lp, string='B_L_G:PE', memcnt=memcnt, errcode=-7)
1731 IF(memcnt .GT. maxmem) maxmem=memcnt
1732 rcvpnt = 1
1733 buflevel = 0
1734 tidx = 0
1735 DO innz=1, locnnz
1736 IF(mod(innz,int(bufsize/10,8)) .EQ. 0) THEN
1737 CALL mpi_iprobe( mpi_any_source, itag, id%COMM,
1738 & flag, status, ierr )
1739 IF(flag) THEN
1740 source = status(mpi_source)
1741 CALL mpi_recv(rcvbuf(1), 2*bufsize, mpi_integer, source,
1742 & itag, id%COMM, status, ierr)
1743 CALL dmumps_assemble_msg(bufsize, rcvbuf, ipe, pe, leng)
1744 msgcnt(source+1)=msgcnt(source+1)-1
1745 rcvpnt = rcvpnt + bufsize
1746 END IF
1747 END IF
1748 IF(id%IRN_loc(innz) .NE. id%JCN_loc(innz)) THEN
1749 proc = maptab(id%IRN_loc(innz))
1750 IF((maptab(id%JCN_loc(innz)).NE.proc) .AND.
1751 & (maptab(id%JCN_loc(innz)).NE.0) .AND.
1752 & (proc.NE.0)) THEN
1753 ierr = -50
1754 id%INFO(1) = ierr
1755 END IF
1756 IF(proc .EQ. 0) THEN
1757 tidx = tidx+1
1758 tsendi(tidx) = id%IRN_loc(innz)
1759 tsendj(tidx) = id%JCN_loc(innz)
1760 ELSE
1761 iidx = ord%PERMTAB(id%IRN_loc(innz))
1762 jjdx = ord%PERMTAB(id%JCN_loc(innz))
1763 apnt(proc)%BUF(2*buflevel(proc)+1)=iidx-ord%FIRST(proc)+1
1764 IF( (jjdx .GE. ord%FIRST(proc)) .AND.
1765 & (jjdx .LE. ord%LAST(proc)) ) THEN
1766 apnt(proc)%BUF(2*buflevel(proc)+2) =
1767 & jjdx-ord%FIRST(proc)+1
1768 ELSE
1769 apnt(proc)%BUF(2*buflevel(proc)+2) = -id%JCN_loc(innz)
1770 END IF
1771 buflevel(proc) = buflevel(proc)+1
1772 IF(buflevel(proc) .EQ. bufsize) THEN
1773 CALL dmumps_send_buf(apnt, proc, nprocs, bufsize, ipe,
1774 & pe, leng, rcvbuf, msgcnt, buflevel, id%COMM)
1775 END IF
1776 END IF
1777 proc = maptab(id%JCN_loc(innz))
1778 IF(proc .EQ. 0) THEN
1779 tidx = tidx+1
1780 tsendi(tidx) = id%JCN_loc(innz)
1781 tsendj(tidx) = id%IRN_loc(innz)
1782 ELSE
1783 iidx = ord%PERMTAB(id%JCN_loc(innz))
1784 jjdx = ord%PERMTAB(id%IRN_loc(innz))
1785 apnt(proc)%BUF(2*buflevel(proc)+1) =
1786 & iidx-ord%FIRST(proc)+1
1787 IF( (jjdx .GE. ord%FIRST(proc)) .AND.
1788 & (jjdx .LE. ord%LAST(proc)) ) THEN
1789 apnt(proc)%BUF(2*buflevel(proc)+2) =
1790 & jjdx-ord%FIRST(proc)+1
1791 ELSE
1792 apnt(proc)%BUF(2*buflevel(proc)+2) = -id%IRN_loc(innz)
1793 END IF
1794 buflevel(proc) = buflevel(proc)+1
1795 IF(buflevel(proc) .EQ. bufsize) THEN
1796 CALL dmumps_send_buf(apnt, proc, nprocs, bufsize, ipe,
1797 & pe, leng, rcvbuf, msgcnt, buflevel, id%COMM)
1798 END IF
1799 END IF
1800 END IF
1801 END DO
1802 CALL dmumps_send_buf(apnt, -1, nprocs, bufsize, ipe, pe, leng,
1803 & rcvbuf, msgcnt, buflevel, id%COMM)
1804 dups = 0
1805 pnt = 0
1806 savepnt = 1
1807 maptab(:) = 0
1808 halo_map(:) = 0
1809 halo_size = 0
1810 DO i=1, nrows_loc
1811 DO innz=ipe(i),ipe(i+1)-1
1812 IF(pe(innz) .LT. 0) THEN
1813 IF(halo_map(-pe(innz)) .EQ. 0) THEN
1814 halo_size = halo_size+1
1815 halo_map(-pe(innz)) = nrows_loc+halo_size
1816 END IF
1817 pe(innz) = halo_map(-pe(innz))
1818 END IF
1819 IF(maptab(pe(innz)) .EQ. i) THEN
1820 dups = dups+1
1821 leng(i) = leng(i)-1
1822 ELSE
1823 maptab(pe(innz)) = i
1824 pnt = pnt+1
1825 pe(pnt) = pe(innz)
1826 END IF
1827 END DO
1828 ipe(i) = savepnt
1829 savepnt = pnt+1
1830 END DO
1831 ipe(nrows_loc+1) = savepnt
1832 CALL mumps_realloc(i_halo_map, halo_size, id%INFO, lp,
1833 & memcnt=memcnt, errcode=-7)
1834 IF(memcnt .GT. maxmem) maxmem=memcnt
1835 j=0
1836 DO i=1, id%N
1837 IF(halo_map(i) .GT. 0) THEN
1838 j = j+1
1839 i_halo_map(halo_map(i)-nrows_loc) = i
1840 END IF
1841 IF(j .EQ. halo_size) EXIT
1842 END DO
1843 CALL mumps_realloc(leng, max(nrows_loc+halo_size,1), id%INFO,
1844 & lp, copy=.true.,
1845 & string='lcgrph:leng', memcnt=memcnt, errcode=-7)
1846 leng(nrows_loc+1:nrows_loc+halo_size) = 0
1847 CALL mumps_i8realloc(ipe, nrows_loc+halo_size+1, id%INFO,
1848 & lp, copy=.true.,
1849 & string='lcgrph:ipe', memcnt=memcnt, errcode=-7)
1850 IF(memcnt .GT. maxmem) maxmem=memcnt
1851 ipe(nrows_loc+2:nrows_loc+halo_size+1) = ipe(nrows_loc+1)
1852 gsize = nrows_loc + halo_size
1853 CALL mpi_gather(top_cnt, 1, mpi_integer8, rcvcnt(1), 1,
1854 & mpi_integer8, 0, id%COMM, ierr)
1855 IF(myid.EQ.0) THEN
1856 new_locnnz = sum(rcvcnt)
1857 top_graph%NZ_LOC = new_locnnz
1858 top_graph%COMM = id%COMM
1859 CALL mumps_irealloc8(top_graph%IRN_LOC, max(1_8,new_locnnz),
1860 & id%INFO, lp, memcnt=memcnt, errcode=-7)
1861 CALL mumps_irealloc8(top_graph%JCN_LOC, max(1_8,new_locnnz),
1862 & id%INFO, lp, memcnt=memcnt, errcode=-7)
1863 IF(memcnt .GT. maxmem) maxmem=memcnt
1864 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1), id%COMM, id%MYID)
1865 IF ( id%INFO(1) .LT. 0 ) GO TO 90
1866 ELSE
1867 ALLOCATE(top_graph%IRN_LOC(1), top_graph%JCN_LOC(1),
1868 & stat=allocok)
1869 IF(allocok.GT.0) THEN
1870 id%INFO(1)=-13
1871 id%INFO(2)=2
1872 ENDIF
1873 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1), id%COMM, id%MYID)
1874 IF ( id%INFO(1) .LT. 0 ) GO TO 90
1875 END IF
1876 IF(myid.EQ.0) THEN
1877 top_graph%IRN_LOC(1:top_cnt) = tsendi(1:top_cnt)
1878 top_graph%JCN_LOC(1:top_cnt) = tsendj(1:top_cnt)
1879 DO proc=2, nprocs
1880 DO WHILE (rcvcnt(proc) .GT. 0)
1881 i = int(min(int(bufsize,8), rcvcnt(proc)))
1882 CALL mpi_recv(top_graph%IRN_LOC(top_cnt+1), i,
1883 & mpi_integer, proc-1, itag, id%COMM, status, ierr)
1884 CALL mpi_recv(top_graph%JCN_LOC(top_cnt+1), i,
1885 & mpi_integer, proc-1, itag, id%COMM, status, ierr)
1886 rcvcnt(proc) = rcvcnt(proc)-i
1887 top_cnt = top_cnt+i
1888 END DO
1889 END DO
1890 ELSE
1891 DO WHILE (top_cnt .GT. 0)
1892 i = int(min(int(bufsize,8), top_cnt))
1893 CALL mpi_send(tsendi(top_cnt-i+1), i,
1894 & mpi_integer, 0, itag, id%COMM, ierr)
1895 CALL mpi_send(tsendj(top_cnt-i+1), i,
1896 & mpi_integer, 0, itag, id%COMM, ierr)
1897 top_cnt = top_cnt-i
1898 END DO
1899 END IF
1900 CALL mumps_dealloc(buflevel, rdispl, tsendi,
1901 & tsendj, memcnt=memcnt)
1902 CALL mumps_i8dealloc(msgcnt, sndcnt, rcvcnt, memcnt=memcnt)
1903 DEALLOCATE(apnt)
1904 90 continue
1905 RETURN
1906 END SUBROUTINE dmumps_build_loc_graph
1907 SUBROUTINE dmumps_send_buf(APNT, PROC, NPROCS, BUFSIZE, IPE, PE,
1908 & LENG, RCVBUF, MSGCNT, SNDCNT, COMM)
1909 IMPLICIT NONE
1910 INTEGER :: NPROCS, PROC, COMM, allocok
1911 TYPE(ARRPNT) :: APNT(:)
1912 INTEGER :: BUFSIZE
1913 INTEGER, POINTER :: RCVBUF(:), LENG(:), PE(:)
1914 INTEGER :: SNDCNT(:)
1915 INTEGER(8) :: MSGCNT(:), IPE(:)
1916 LOGICAL, SAVE :: INIT = .true.
1917 INTEGER, POINTER, SAVE :: SPACE(:,:,:)
1918 LOGICAL, POINTER, SAVE :: PENDING(:)
1919 INTEGER, POINTER, SAVE :: REQ(:), CPNT(:)
1920 INTEGER :: IERR, MYID, I, SOURCE
1921 INTEGER(8) :: TOTMSG
1922 LOGICAL :: FLAG, TFLAG
1923 INTEGER :: STATUS(MPI_STATUS_SIZE)
1924 INTEGER :: TSTATUS(MPI_STATUS_SIZE)
1925 INTEGER, PARAMETER :: ITAG=30, ftag=31
1926 INTEGER, POINTER :: TMPI(:), RCVCNT(:)
1927 CALL mpi_comm_rank (comm, myid, ierr)
1928 CALL mpi_comm_size (comm, nprocs, ierr)
1929 IF(init) THEN
1930 ALLOCATE(space(2*bufsize, 2, nprocs), stat=allocok)
1931 IF(allocok.GT.0) THEN
1932 write(*,*) "Allocation error of SPACE in DMUMPS_SEND_BUF"
1933 return
1934 ENDIF
1935 ALLOCATE(rcvbuf(2*bufsize), stat=allocok)
1936 IF(allocok.GT.0) THEN
1937 write(*,*) "Allocation error of RCVBUF in DMUMPS_SEND_BUF"
1938 return
1939 ENDIF
1940 ALLOCATE(pending(nprocs), cpnt(nprocs), stat=allocok)
1941 IF(allocok.GT.0) THEN
1942 write(*,*) "Allocation error of PENDING/CPNT"
1943 & ," in DMUMPS_SEND_BUF"
1944 return
1945 ENDIF
1946 ALLOCATE(req(nprocs), stat=allocok)
1947 IF(allocok.GT.0) THEN
1948 write(*,*) "Allocation error of REQ in DMUMPS_SEND_BUF"
1949 return
1950 ENDIF
1951 pending = .false.
1952 DO i=1, nprocs
1953 apnt(i)%BUF => space(:,1,i)
1954 cpnt(i) = 1
1955 END DO
1956 init = .false.
1957 RETURN
1958 END IF
1959 IF(proc .EQ. -1) THEN
1960 totmsg = sum(msgcnt)
1961 DO
1962 IF(totmsg .EQ. 0) EXIT
1963 CALL mpi_recv(rcvbuf(1), 2*bufsize, mpi_integer,
1964 & mpi_any_source, itag, comm, status, ierr)
1965 CALL dmumps_assemble_msg(bufsize, rcvbuf, ipe, pe, leng)
1966 source = status(mpi_source)
1967 totmsg = totmsg-1
1968 msgcnt(source+1)=msgcnt(source+1)-1
1969 END DO
1970 DO i=1, nprocs
1971 IF(pending(i)) THEN
1972 CALL mpi_wait(req(i), tstatus, ierr)
1973 END IF
1974 END DO
1975 ALLOCATE(rcvcnt(nprocs), stat=allocok)
1976 IF(allocok.GT.0) THEN
1977 write(*,*) "Allocation error of RCVCNT in DMUMPS_SEND_BUF"
1978 return
1979 ENDIF
1980 CALL mpi_alltoall(sndcnt(1), 1, mpi_integer, rcvcnt(1), 1,
1981 & mpi_integer, comm, ierr)
1982 DO i=1, nprocs
1983 IF(sndcnt(i) .GT. 0) THEN
1984 tmpi => apnt(i)%BUF(:)
1985 CALL mpi_isend(tmpi(1), 2*sndcnt(i), mpi_integer, i-1,
1986 & ftag, comm, req(i), ierr)
1987 END IF
1988 END DO
1989 DO i=1, nprocs
1990 IF(rcvcnt(i) .GT. 0) THEN
1991 CALL mpi_recv(rcvbuf(1), 2*rcvcnt(i), mpi_integer, i-1,
1992 & ftag, comm, status, ierr)
1993 CALL dmumps_assemble_msg(rcvcnt(i), rcvbuf,
1994 & ipe, pe, leng)
1995 END IF
1996 END DO
1997 DO i=1, nprocs
1998 IF(sndcnt(i) .GT. 0) THEN
1999 CALL mpi_wait(req(i), tstatus, ierr)
2000 END IF
2001 END DO
2002 DEALLOCATE(space)
2003 DEALLOCATE(pending, cpnt)
2004 DEALLOCATE(req)
2005 DEALLOCATE(rcvbuf, rcvcnt)
2006 nullify(space, pending, cpnt, req, rcvbuf, rcvcnt)
2007 init = .true.
2008 RETURN
2009 END IF
2010 IF(pending(proc)) THEN
2011 DO
2012 CALL mpi_test(req(proc), tflag, tstatus, ierr)
2013 IF(tflag) THEN
2014 pending(proc) = .false.
2015 EXIT
2016 ELSE
2017 CALL mpi_iprobe( mpi_any_source, itag, comm,
2018 & flag, status, ierr )
2019 IF(flag) THEN
2020 source = status(mpi_source)
2021 CALL mpi_recv(rcvbuf(1), 2*bufsize, mpi_integer,
2022 & source, itag, comm, status, ierr)
2023 CALL dmumps_assemble_msg(bufsize, rcvbuf, ipe,
2024 & pe, leng)
2025 msgcnt(source+1)=msgcnt(source+1)-1
2026 END IF
2027 END IF
2028 END DO
2029 END IF
2030 tmpi => apnt(proc)%BUF(:)
2031 CALL mpi_isend(tmpi(1), 2*bufsize, mpi_integer, proc-1,
2032 & itag, comm, req(proc), ierr)
2033 pending(proc) = .true.
2034 cpnt(proc) = mod(cpnt(proc),2)+1
2035 apnt(proc)%BUF => space(:,cpnt(proc),proc)
2036 sndcnt(proc) = 0
2037 RETURN
2038 END SUBROUTINE dmumps_send_buf
2039 SUBROUTINE dmumps_assemble_msg(BUFSIZE, RCVBUF, IPE, PE, LENG)
2040 IMPLICIT NONE
2041 INTEGER :: BUFSIZE
2042 INTEGER :: RCVBUF(:), PE(:), LENG(:)
2043 INTEGER(8) :: IPE(:)
2044 INTEGER :: I, ROW, COL
2045 DO i=1, 2*bufsize, 2
2046 row = rcvbuf(i)
2047 col = rcvbuf(i+1)
2048 pe(ipe(row)+leng(row)) = col
2049 leng(row) = leng(row) + 1
2050 END DO
2051 RETURN
2052 END SUBROUTINE dmumps_assemble_msg
2053#if defined(ptscotch) || defined(parmetis) || defined(parmetis3)
2054 SUBROUTINE dmumps_build_tree(ord)
2055 TYPE(ord_type) :: ord
2056 INTEGER :: I
2057 ord%SON = -1
2058 ord%BROTHER = -1
2059 ord%NW = 0
2060 DO i=1, ord%CBLKNBR
2061 ord%NW(i) = ord%NW(i)+ord%RANGTAB(i+1) - ord%RANGTAB(i)
2062 IF (ord%TREETAB(i) .NE. -1) THEN
2063 IF (ord%SON(ord%TREETAB(i)) .EQ. -1) THEN
2064 ord%SON(ord%TREETAB(i)) = i
2065 ELSE
2066 ord%BROTHER(i) = ord%SON(ord%TREETAB(i))
2067 ord%SON(ord%TREETAB(i)) = i
2068 END IF
2069 ord%NW(ord%TREETAB(i)) = ord%NW(ord%TREETAB(i))+ ord%NW(i)
2070 END IF
2071 END DO
2072 RETURN
2073 END SUBROUTINE dmumps_build_tree
2074 SUBROUTINE dmumps_graph_dist(id, ord, FIRST,
2075 & LAST, BASE, NPROCS, WORK, TYPE)
2076 IMPLICIT NONE
2077 TYPE(dmumps_struc) :: id
2078 TYPE(ord_type) :: ord
2079 INTEGER :: FIRST(:), LAST(:), BASE, NPROCS, TYPE
2080 INTEGER, TARGET :: WORK(:)
2081 INTEGER, POINTER :: TMP(:), NZ_ROW(:)
2082 INTEGER :: I, IERR, P, F, J
2083 INTEGER(8) :: LOCNNZ, INNZ, LOCOFFDIAG,
2084 & offdiag, t, share
2085 DO i=0, base-1
2086 first(i+1) = 0
2087 last(i+1) = -1
2088 END DO
2089 IF(type.EQ.1) THEN
2090 share = int(id%N/ord%NSLAVES,8)
2091 DO i=1, ord%NSLAVES
2092 first(base+i) = (i-1)*int(share)+1
2093 last (base+i) = (i)*int(share)
2094 END DO
2095 last(base+ord%NSLAVES) = max(last(base+ord%NSLAVES), id%N)
2096 DO i = ord%NSLAVES+1, id%NSLAVES+1
2097 first(base+i) = id%N+1
2098 last(base+i) = id%N
2099 END DO
2100 ELSE IF (type.EQ.2) THEN
2101 tmp => work(1:id%N)
2102 nz_row => work(id%N+1:2*id%N)
2103 tmp = 0
2104 locoffdiag = 0_8
2105 locnnz = id%KEEP8(29)
2106 DO innz=1, locnnz
2107 IF(id%IRN_loc(innz) .NE. id%JCN_loc(innz)) THEN
2108 tmp(id%IRN_loc(innz)) = tmp(id%IRN_loc(innz))+1
2109 locoffdiag = locoffdiag+1
2110 IF(id%SYM.GT.0) THEN
2111 tmp(id%JCN_loc(innz)) = tmp(id%JCN_loc(innz))+1
2112 locoffdiag = locoffdiag+1
2113 END IF
2114 END IF
2115 END DO
2116 CALL mpi_allreduce(tmp(1), nz_row(1), id%N,
2117 & mpi_integer, mpi_sum, id%COMM, ierr)
2118 CALL mpi_allreduce(locoffdiag, offdiag, 1,
2119 & mpi_integer8, mpi_sum, id%COMM, ierr)
2120 nullify(tmp)
2121 share = (offdiag-1_8)/int(ord%NSLAVES,8) + 1_8
2122 p = 0
2123 t = 0_8
2124 f = 1
2125 DO i=1, id%N
2126 t = t+int(nz_row(i),8)
2127 IF (
2128 & (t .GE. share) .OR.
2129 & ((id%N-i).EQ.(ord%NSLAVES-p-1)) .OR.
2130 & (i.EQ.id%N)
2131 & ) THEN
2132 p = p+1
2133 IF(p.EQ.ord%NSLAVES) THEN
2134 first(base+p) = f
2135 last(base+p) = id%N
2136 EXIT
2137 ELSE
2138 first(base+p) = f
2139 last(base+p) = i
2140 f = i+1
2141 t = 0_8
2142 END IF
2143 END IF
2144 END DO
2145 DO j=p+1, nprocs+1-base
2146 first(base+j) = id%N+1
2147 last(base+j) = id%N
2148 END DO
2149 END IF
2150 RETURN
2151 END SUBROUTINE dmumps_graph_dist
2152#endif
2153 SUBROUTINE dmumps_mergeswap(N, L, A1, A2)
2154 INTEGER :: I, LP, ISWAP, N
2155 INTEGER :: L(0:), A1(:), A2(:)
2156 lp = l(0)
2157 i = 1
2158 DO
2159 IF ((lp==0).OR.(i>n)) EXIT
2160 DO
2161 IF (lp >= i) EXIT
2162 lp = l(lp)
2163 END DO
2164 iswap = a1(lp)
2165 a1(lp) = a1(i)
2166 a1(i) = iswap
2167 iswap = a2(lp)
2168 a2(lp) = a2(i)
2169 a2(i) = iswap
2170 iswap = l(lp)
2171 l(lp) = l(i)
2172 l(i) = lp
2173 lp = iswap
2174 i = i + 1
2175 ENDDO
2176 END SUBROUTINE dmumps_mergeswap
2177#if defined(DETERMINISTIC_PARALLEL_GRAPH)
2178 SUBROUTINE dmumps_mergeswap1(N, L, A)
2179 INTEGER :: I, LP, ISWAP, N
2180 INTEGER :: L(0:), A(:)
2181 lp = l(0)
2182 i = 1
2183 DO
2184 IF ((lp==0).OR.(i>n)) EXIT
2185 DO
2186 IF (lp >= i) EXIT
2187 lp = l(lp)
2188 END DO
2189 iswap = a(lp)
2190 a(lp) = a(i)
2191 a(i) = iswap
2192 iswap = l(lp)
2193 l(lp) = l(i)
2194 l(i) = lp
2195 lp = iswap
2196 i = i + 1
2197 ENDDO
2198 END SUBROUTINE dmumps_mergeswap1
2199#endif
2200 SUBROUTINE dmumps_mergesort(N, K, L)
2201 INTEGER :: N
2202 INTEGER :: K(:), L(0:)
2203 INTEGER :: P, Q, S, T
2204 CONTINUE
2205 l(0) = 1
2206 t = n + 1
2207 DO p = 1,n - 1
2208 IF (k(p) <= k(p+1)) THEN
2209 l(p) = p + 1
2210 ELSE
2211 l(t) = - (p+1)
2212 t = p
2213 END IF
2214 END DO
2215 l(t) = 0
2216 l(n) = 0
2217 IF (l(n+1) == 0) THEN
2218 RETURN
2219 ELSE
2220 l(n+1) = iabs(l(n+1))
2221 END IF
2222 200 CONTINUE
2223 s = 0
2224 t = n+1
2225 p = l(s)
2226 q = l(t)
2227 IF(q .EQ. 0) RETURN
2228 300 CONTINUE
2229 IF(k(p) .GT. k(q)) GOTO 600
2230 CONTINUE
2231 l(s) = sign(p,l(s))
2232 s = p
2233 p = l(p)
2234 IF (p .GT. 0) GOTO 300
2235 CONTINUE
2236 l(s) = q
2237 s = t
2238 DO
2239 t = q
2240 q = l(q)
2241 IF (q .LE. 0) EXIT
2242 END DO
2243 GOTO 800
2244 600 CONTINUE
2245 l(s) = sign(q, l(s))
2246 s = q
2247 q = l(q)
2248 IF (q .GT. 0) GOTO 300
2249 CONTINUE
2250 l(s) = p
2251 s = t
2252 DO
2253 t = p
2254 p = l(p)
2255 IF (p .LE. 0) EXIT
2256 END DO
2257 800 CONTINUE
2258 p = -p
2259 q = -q
2260 IF(q.EQ.0) THEN
2261 l(s) = sign(p, l(s))
2262 l(t) = 0
2263 GOTO 200
2264 END IF
2265 GOTO 300
2266 END SUBROUTINE dmumps_mergesort
2267 FUNCTION mumps_getsize(A)
2268 INTEGER, POINTER :: a(:)
2269 INTEGER :: mumps_getsize
2270 IF(associated(a)) THEN
2271 mumps_getsize = size(a)
2272 ELSE
2273 mumps_getsize = 0_8
2274 END IF
2275 RETURN
2276 END FUNCTION mumps_getsize
2277#if defined(parmetis) || defined(parmetis3)
2278 SUBROUTINE mumps_parmetis_mixedto32(id, BASE, VERTLOCNBR, FIRST,
2279 & VERTLOCTAB, EDGELOCTAB, BASEVAL, OPTIONS, ORDER,
2280 & SIZES, COMM, IERR)
2281 IMPLICIT NONE
2282 TYPE(dmumps_struc) :: id
2283 INTEGER :: first(:), edgeloctab(:), options(:)
2284 INTEGER :: sizes(:), order(:)
2285 INTEGER(8) :: vertloctab(:)
2286 INTEGER :: vertlocnbr, baseval, ierr, comm, base
2287 INTEGER, POINTER :: vertloctab_i4(:)
2288 IF( vertloctab(vertlocnbr+1).GT.huge(vertlocnbr)) THEN
2289 id%INFO(1) = -51
2290 CALL mumps_set_ierror(
2291 & vertloctab(vertlocnbr+1), id%INFO(2))
2292 RETURN
2293 END IF
2294 nullify(vertloctab_i4)
2295 CALL mumps_realloc(vertloctab_i4, vertlocnbr+1, id%INFO,
2296 & id%ICNTL(1), memcnt=memcnt, errcode=-7)
2297 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2298 & comm, id%MYID )
2299 IF ( id%INFO(1) .LT. 0 ) RETURN
2300 CALL mumps_icopy_64to32(vertloctab(1),
2301 & vertlocnbr+1, vertloctab_i4(1))
2302 CALL mumps_parmetis(first(1+base), vertloctab_i4(1),
2303 & edgeloctab(1), baseval, options(1), order(1),
2304 & sizes(1), comm, ierr)
2305 IF(ierr.NE.0) THEN
2306 id%INFO(1:2) = -50
2307 END IF
2308 CALL mumps_dealloc(vertloctab_i4, memcnt=memcnt)
2309 RETURN
2310 END SUBROUTINE mumps_parmetis_mixedto32
2311 SUBROUTINE mumps_parmetis_mixedto64
2312 & (id, base, vertlocnbr, first,
2313 & vertloctab, edgeloctab, baseval, options, order,
2314 & sizes, comm, ierr)
2315 IMPLICIT NONE
2316 TYPE(dmumps_struc) :: id
2317 INTEGER :: first(:), edgeloctab(:), options(:)
2318 INTEGER :: sizes(:), order(:)
2319 INTEGER(8) :: vertloctab(:)
2320 INTEGER :: vertlocnbr, baseval, ierr, comm, base
2321 INTEGER(8), POINTER :: first_i8(:), edgeloctab_i8(:),
2322 & sizes_i8(:), order_i8(:)
2323#if defined(parmetis)
2324 INTEGER(8), POINTER :: options_i8(:)
2325 INTEGER(8) :: baseval_i8
2326 nullify(options_i8)
2327 IF (id%KEEP(10).NE.1) THEN
2328 CALL mumps_i8realloc(options_i8, size(options), id%INFO,
2329 & id%ICNTL(1), memcnt=memcnt, errcode=-7)
2330 IF ( id%INFO(1) .LT. 0 ) RETURN
2331 CALL mumps_icopy_32to64(options(1), size(options)
2332 & , options_i8(1))
2333 baseval_i8 = int(baseval,8)
2334 END IF
2335#endif
2336 nullify(first_i8, edgeloctab_i8, sizes_i8, order_i8)
2337 IF (id%KEEP(10).EQ.1) THEN
2338 CALL mumps_parmetis_64(first(1+base), vertloctab(1),
2339 & edgeloctab(1),
2340 & baseval, options(1),
2341 & order(1),
2342 & sizes(1), comm, ierr)
2343 ELSE
2344 CALL mumps_i8realloc(first_i8, size(first), id%INFO,
2345 & id%ICNTL(1), memcnt=memcnt, errcode=-7)
2346 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2347 CALL mumps_i8realloc8(edgeloctab_i8,
2348 & vertloctab(vertlocnbr+1)-1_8,
2349 & id%INFO, id%ICNTL(1), memcnt=memcnt, errcode=-7)
2350 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2351 CALL mumps_i8realloc(sizes_i8, size(sizes), id%INFO,
2352 & id%ICNTL(1), memcnt=memcnt, errcode=-7)
2353 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2354 CALL mumps_i8realloc(order_i8, size(order), id%INFO,
2355 & id%ICNTL(1), memcnt=memcnt, errcode=-7)
2356 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2357 5 CONTINUE
2358 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2359 & comm, id%MYID )
2360 IF ( id%INFO(1) .LT. 0 ) RETURN
2361 CALL mumps_icopy_32to64(first(1), size(first), first_i8(1))
2362 CALL mumps_icopy_32to64_64c(edgeloctab(1),
2363 & vertloctab(vertlocnbr+1)-1_8, edgeloctab_i8(1))
2364 CALL mumps_parmetis_64(first_i8(1+base), vertloctab(1),
2365 & edgeloctab_i8(1),
2366#if defined(parmetis3)
2367 & baseval, options(1),
2368#else
2369 & baseval_i8, options_i8(1),
2370#endif
2371 & order_i8(1),
2372 & sizes_i8(1), comm, ierr)
2373 END IF
2374 IF(ierr.NE.0) THEN
2375 id%INFO(1:2) = -50
2376 END IF
2377 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2378 & comm, id%MYID )
2379 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2380 IF ( id%KEEP(10) .NE. 1 ) THEN
2381 CALL mumps_icopy_64to32(order_i8(1),
2382 & size(order), order(1))
2383 CALL mumps_icopy_64to32(sizes_i8(1),
2384 & size(sizes), sizes(1))
2385 ENDIF
2386 10 CONTINUE
2387 CALL mumps_i8dealloc(first_i8, memcnt=memcnt)
2388 CALL mumps_i8dealloc(sizes_i8, memcnt=memcnt)
2389 CALL mumps_i8dealloc(edgeloctab_i8, memcnt=memcnt)
2390 CALL mumps_i8dealloc(order_i8, memcnt=memcnt)
2391#if defined(parmetis)
2392 CALL mumps_i8dealloc(options_i8, memcnt=memcnt)
2393#endif
2394 RETURN
2395 END SUBROUTINE mumps_parmetis_mixedto64
2396#endif
2397#if defined(ptscotch)
2398 SUBROUTINE mumps_ptscotch_mixedto32(id, ord,
2399 & BASEVAL,
2400 & VERTLOCNBR, VERTLOCTAB,
2401 & EDGELOCNBR, EDGELOCTAB,
2402 & IERR)
2403 IMPLICIT NONE
2404 include 'ptscotchf.h'
2405 TYPE(dmumps_struc) :: id
2406 TYPE(ord_type) :: ord
2407 INTEGER :: baseval, vertlocnbr
2408 INTEGER(8) :: edgelocnbr
2409 INTEGER(8) :: vertloctab(:)
2410 INTEGER :: edgeloctab(:)
2411 INTEGER :: ierr
2412 INTEGER, POINTER :: vertloctab_i4(:)
2413 INTEGER :: edgelocnbr_i4, myworkid
2414 DOUBLE PRECISION :: graphdat(scotch_dgraphdim),
2415 & ordedat(scotch_dorderdim), stradat(scotch_stratdim),
2416 & cordedat(scotch_orderdim)
2417 CHARACTER strstring*1024
2418 nullify(vertloctab_i4)
2419 CALL mumps_realloc(vertloctab_i4, vertlocnbr+1, id%INFO, lp,
2420 & memcnt=memcnt, errcode=-7)
2421 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2422 & ord%COMM_NODES, id%MYID )
2423 IF ( id%INFO(1) .LT. 0 ) RETURN
2424 CALL mumps_icopy_64to32(vertloctab(1),
2425 & vertlocnbr+1, vertloctab_i4(1))
2426 edgelocnbr_i4 = int(edgelocnbr)
2427 IF(ord%SUBSTRAT .NE. 0) THEN
2428 strstring='n{sep=m{asc=b{width=3,strat=q{strat=f}},'//
2429 & 'low=q{strat=h},vert=1000,dvert=100,dlevl=0,'//
2430 & 'proc=1,seq=q{strat=m{type=h,vert=100,'//
2431 & 'low=h{pass=10},asc=b{width=3,bnd=f{bal=0.2},'//
2432 & 'org=h{pass=10}f{bal=0.2}}}}},ole=s,ose=s,osq=s}'
2433 END IF
2434 IF(ord%IDO) THEN
2435 CALL mpi_comm_rank (ord%COMM_NODES, myworkid, ierr)
2436 ELSE
2437 myworkid = -1
2438 END IF
2439 CALL mumps_dgraphinit(graphdat, ord%COMM_NODES, ierr)
2440 IF(ierr.NE.0) THEN
2441 id%INFO(1:2) = -50
2442 END IF
2443 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2444 & ord%COMM_NODES, id%MYID )
2445 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2446 CALL scotchfdgraphbuild(graphdat, baseval, vertlocnbr,
2447 & vertlocnbr, vertloctab_i4(1), vertloctab_i4(2),
2448 & vertloctab_i4(1), vertloctab_i4(1), edgelocnbr_i4,
2449 & edgelocnbr_i4, edgeloctab(1), edgeloctab(1),
2450 & edgeloctab(1), ierr)
2451 IF(ierr.NE.0) THEN
2452 id%INFO(1:2) = -50
2453 END IF
2454 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2455 & ord%COMM_NODES, id%MYID )
2456 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2457 CALL scotchfstratinit(stradat, ierr)
2458 IF(ierr.NE.0) THEN
2459 id%INFO(1:2) = -50
2460 END IF
2461 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2462 & ord%COMM_NODES, id%MYID )
2463 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2464 IF(ord%SUBSTRAT .NE. 0) THEN
2465 CALL scotchfstratdgraphorder(stradat, strstring, ierr)
2466 END IF
2467 IF(ierr.NE.0) THEN
2468 id%INFO(1:2) = -50
2469 END IF
2470 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2471 & ord%COMM_NODES, id%MYID )
2472 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2473 CALL scotchfdgraphorderinit(graphdat, ordedat, ierr)
2474 IF(ierr.NE.0) THEN
2475 id%INFO(1:2) = -50
2476 END IF
2477 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2478 & ord%COMM_NODES, id%MYID )
2479 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2480 CALL scotchfdgraphordercompute(graphdat, ordedat, stradat,
2481 & ierr)
2482 IF(ierr.NE.0) THEN
2483 id%INFO(1:2) = -50
2484 END IF
2485 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2486 & ord%COMM_NODES, id%MYID )
2487 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2488 IF(myworkid .EQ. 0) THEN
2489 CALL scotchfdgraphcorderinit(graphdat, cordedat,
2490 & ord%PERMTAB(1), ord%PERITAB(1), ord%CBLKNBR,
2491 & ord%RANGTAB(1), ord%TREETAB(1), ierr)
2492 IF(ierr.NE.0) THEN
2493 id%INFO(1:2) = -50
2494 END IF
2495 END IF
2496 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2497 & ord%COMM_NODES, id%MYID )
2498 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2499 IF(myworkid .EQ. 0) THEN
2500 CALL scotchfdgraphordergather(graphdat, ordedat,
2501 & cordedat, ierr)
2502 IF(ierr.NE.0) THEN
2503 id%INFO(1:2) = -50
2504 END IF
2505 ELSE
2506 CALL scotchfdgraphordergather(graphdat, ordedat,
2507 & ordedat, ierr)
2508 IF(ierr.NE.0) THEN
2509 id%INFO(1:2) = -50
2510 END IF
2511 END IF
2512 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2513 & ord%COMM_NODES, id%MYID )
2514 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2515 IF(myworkid .EQ. 0)
2516 & CALL scotchfdgraphcorderexit(graphdat, cordedat)
2517 CALL scotchfdgraphorderexit(graphdat, ordedat)
2518 CALL scotchfstratexit(stradat)
2519 CALL scotchfdgraphexit(graphdat)
2520 10 CONTINUE
2521 CALL mumps_dealloc(vertloctab_i4, memcnt=memcnt)
2522 RETURN
2523 END SUBROUTINE mumps_ptscotch_mixedto32
2524 SUBROUTINE mumps_ptscotch_mixedto64(id, ord,
2525 & BASEVAL,
2526 & VERTLOCNBR, VERTLOCTAB,
2527 & EDGELOCNBR, EDGELOCTAB,
2528 & IERR)
2529 IMPLICIT NONE
2530 include 'ptscotchf.h'
2531 TYPE(dmumps_struc) :: id
2532 TYPE(ord_type) :: ord
2533 INTEGER :: baseval, vertlocnbr
2534 INTEGER(8) :: EDGELOCNBR
2535 INTEGER(8) :: vertloctab(:)
2536 INTEGER :: edgeloctab(:)
2537 INTEGER :: ierr
2538 INTEGER :: myworkid
2539 DOUBLE PRECISION :: graphdat(scotch_dgraphdim),
2540 & ordedat(scotch_dorderdim), stradat(scotch_stratdim),
2541 & cordedat(scotch_orderdim)
2542 CHARACTER strstring*1024
2543 INTEGER(8), POINTER :: edgeloctab_i8(:), permtab_i8(:),
2544 & peritab_i8(:), rangtab_i8(:), treetab_i8(:)
2545 INTEGER(8) :: cblknbr_i8, vertlocnbr_i8, baseval_i8
2546 if(ord%substrat .NE. 0) then
2547 strstring='n{sep=m{asc=b{width=3,strat=q{strat=f}},'//
2548 & 'low=q{strat=h},vert=1000,dvert=100,dlevl=0,'//
2549 & 'proc=1,seq=q{strat=m{type=h,vert=100,'//
2550 & 'low=h{pass=10},asc=b{width=3,bnd=f{bal=0.2},'//
2551 & 'org=h{pass=10}f{bal=0.2}}}}},ole=s,ose=s,osq=s}'
2552 END IF
2553 IF(ord%IDO) THEN
2554 CALL mpi_comm_rank (ord%COMM_NODES, myworkid, ierr)
2555 ELSE
2556 myworkid = -1
2557 END IF
2558 nullify(edgeloctab_i8, permtab_i8, peritab_i8,
2559 & rangtab_i8, treetab_i8)
2560 IF (id%KEEP(10).NE.1) THEN
2561 CALL mumps_i8realloc8(edgeloctab_i8,
2562 & vertloctab(vertlocnbr+1)-1_8,
2563 & id%INFO, id%ICNTL(1), memcnt=memcnt, errcode=-7)
2564 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2565 IF (myworkid .EQ. 0) THEN
2566 CALL mumps_i8realloc(permtab_i8, size(ord%PERMTAB),
2567 & id%INFO, id%ICNTL(1), memcnt=memcnt, errcode=-7)
2568 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2569 CALL mumps_i8realloc(peritab_i8, size(ord%PERITAB),
2570 & id%INFO, id%ICNTL(1), memcnt=memcnt, errcode=-7)
2571 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2572 CALL mumps_i8realloc(treetab_i8, size(ord%TREETAB),
2573 & id%INFO, id%ICNTL(1), memcnt=memcnt, errcode=-7)
2574 IF ( id%INFO(1) .LT. 0 ) GOTO 5
2575 CALL mumps_i8realloc(rangtab_i8, size(ord%RANGTAB),
2576 & id%INFO, id%ICNTL(1), memcnt=memcnt, errcode=-7)
2577 END IF
2578 5 CONTINUE
2579 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2580 & ord%COMM_NODES, id%MYID )
2581 IF ( id%INFO(1) .LT. 0 ) RETURN
2582 CALL mumps_icopy_32to64_64c(edgeloctab(1),
2583 & vertloctab(vertlocnbr+1)-1_8, edgeloctab_i8(1))
2584 baseval_i8 = int(baseval,8)
2585 vertlocnbr_i8 = int(vertlocnbr,8)
2586 ENDIF
2587 CALL mumps_dgraphinit(graphdat, ord%COMM_NODES, ierr)
2588 IF(ierr.NE.0) THEN
2589 id%INFO(1:2) = -50
2590 END IF
2591 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2592 & ord%COMM_NODES, id%MYID )
2593 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2594 IF (id%KEEP(10).NE.1) THEN
2595 CALL scotchfdgraphbuild(graphdat, baseval_i8, vertlocnbr_i8,
2596 & vertlocnbr_i8, vertloctab(1), vertloctab(2),
2597 & vertloctab(1), vertloctab(1), edgelocnbr,
2598 & edgelocnbr, edgeloctab_i8(1), edgeloctab_i8(1),
2599 & edgeloctab_i8(1), ierr)
2600 ELSE
2601 CALL scotchfdgraphbuild(graphdat, baseval, vertlocnbr,
2602 & vertlocnbr, vertloctab(1), vertloctab(2),
2603 & vertloctab(1), vertloctab(1), edgelocnbr,
2604 & edgelocnbr, edgeloctab(1), edgeloctab(1),
2605 & edgeloctab(1), ierr)
2606 ENDIF
2607 IF(ierr.NE.0) THEN
2608 id%INFO(1:2) = -50
2609 END IF
2610 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2611 & ord%COMM_NODES, id%MYID )
2612 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2613 CALL scotchfstratinit(stradat, ierr)
2614 IF(ierr.NE.0) THEN
2615 id%INFO(1:2) = -50
2616 END IF
2617 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2618 & ord%COMM_NODES, id%MYID )
2619 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2620 IF(ord%SUBSTRAT .NE. 0) THEN
2621 CALL scotchfstratdgraphorder(stradat, strstring, ierr)
2622 END IF
2623 IF(ierr.NE.0) THEN
2624 id%INFO(1:2) = -50
2625 END IF
2626 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2627 & ord%COMM_NODES, id%MYID )
2628 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2629 CALL scotchfdgraphorderinit(graphdat, ordedat, ierr)
2630 IF(ierr.NE.0) THEN
2631 id%INFO(1:2) = -50
2632 END IF
2633 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2634 & ord%COMM_NODES, id%MYID )
2635 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2636 CALL scotchfdgraphordercompute(graphdat, ordedat, stradat,
2637 & ierr)
2638 IF(ierr.NE.0) THEN
2639 id%INFO(1:2) = -50
2640 END IF
2641 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2642 & ord%COMM_NODES, id%MYID )
2643 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2644 IF(myworkid .EQ. 0) THEN
2645 IF (id%KEEP(10).NE.1) THEN
2646 CALL scotchfdgraphcorderinit(graphdat, cordedat,
2647 & permtab_i8(1), peritab_i8(1), cblknbr_i8, rangtab_i8(1),
2648 & treetab_i8(1), ierr)
2649 ELSE
2650 CALL scotchfdgraphcorderinit(graphdat, cordedat,
2651 & ord%PERMTAB(1), ord%PERITAB(1), ord%CBLKNBR,
2652 & ord%RANGTAB(1),ord%TREETAB(1), ierr)
2653 ENDIF
2654 IF(ierr.NE.0) THEN
2655 id%INFO(1:2) = -50
2656 END IF
2657 END IF
2658 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2659 & ord%COMM_NODES, id%MYID )
2660 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2661 IF(myworkid .EQ. 0) THEN
2662 CALL scotchfdgraphordergather(graphdat, ordedat,
2663 & cordedat, ierr)
2664 IF(ierr.NE.0) THEN
2665 id%INFO(1:2) = -50
2666 END IF
2667 ELSE
2668 CALL scotchfdgraphordergather(graphdat, ordedat,
2669 & ordedat, ierr)
2670 IF(ierr.NE.0) THEN
2671 id%INFO(1:2) = -50
2672 END IF
2673 END IF
2674 CALL mumps_propinfo( id%ICNTL(1), id%INFO(1),
2675 & ord%COMM_NODES, id%MYID )
2676 IF ( id%INFO(1) .LT. 0 ) GOTO 10
2677 CALL scotchfdgraphorderexit(graphdat, ordedat)
2678 CALL scotchfstratexit(stradat)
2679 CALL scotchfdgraphexit(graphdat)
2680 10 CONTINUE
2681 IF (id%KEEP(10).NE.1) THEN
2682 CALL mumps_i8dealloc(edgeloctab_i8, memcnt=memcnt)
2683 IF(myworkid .EQ. 0) THEN
2684 CALL scotchfdgraphcorderexit(graphdat, cordedat)
2685 CALL mumps_icopy_64to32(permtab_i8(1),
2686 & size(ord%PERMTAB), ord%PERMTAB(1))
2687 CALL mumps_icopy_64to32(peritab_i8(1),
2688 & size(ord%PERITAB), ord%PERITAB(1))
2689 CALL mumps_icopy_64to32(treetab_i8(1),
2690 & size(ord%TREETAB), ord%TREETAB(1))
2691 CALL mumps_icopy_64to32(rangtab_i8(1),
2692 & size(ord%RANGTAB), ord%RANGTAB(1))
2693 ord%CBLKNBR = int(cblknbr_i8)
2694 CALL mumps_i8dealloc(permtab_i8, memcnt=memcnt)
2695 CALL mumps_i8dealloc(peritab_i8, memcnt=memcnt)
2696 CALL mumps_i8dealloc(rangtab_i8, memcnt=memcnt)
2697 CALL mumps_i8dealloc(treetab_i8, memcnt=memcnt)
2698 END IF
2699 ENDIF
2700 RETURN
2701 END SUBROUTINE mumps_ptscotch_mixedto64
2702#endif
2703 END MODULE
mumps_abort
#define mumps_abort
Definition VE_Metis.h:25
mumps_symqamd_new
subroutine mumps_symqamd_new(job, thresh, ndense, n, iwlen, pe, pfree, len, iw, nv, elen, last, ncmpa, degree, head, next, w, perm, complem_list, size_complem_list, agg6)
Definition ana_AMDMF.F:20
mumps_propinfo
subroutine mumps_propinfo(icntl, info, comm, id)
Definition bcast_errors.F:15
dmumps_ana_m
subroutine dmumps_ana_m(ne, nd, nsteps, maxfr, maxelim, k50, sizefac_tot, maxnpiv, k5, k6, panel_size, k253)
Definition dana_aux.F:2780
dmumps_cutnodes
subroutine dmumps_cutnodes(n, frere, fils, nfsiz, sizeofblocks, lsizeofblocks, nsteps, nslaves, keep, keep8, splitroot, mp, ldiag, info1, info2)
Definition dana_aux.F:2919
dmumps_set_k821_surface
subroutine dmumps_set_k821_surface(keep821, keep2, keep48, keep50, nslaves)
Definition dana_aux.F:3554
dmumps_ana_lnew
subroutine dmumps_ana_lnew(n, ipe, nv, ips, ne, na, nfsiz, node, nsteps, fils, frere, nd, nemin, subord, keep60, keep20, keep38, namalg, namalgmax, cumul, keep50, icntl13, keep37, keep197, nslaves, allow_amalg_tiny_nodes, blkon, sizeofblocks, lsizeofblocks)
Definition dana_aux.F:2412
if
if(complex_arithmetic) id
dmumps_parallel_analysis::dmumps_ana_f_par
Definition dana_aux_par.F:20
mumps_memory_mod::mumps_dealloc
Definition mumps_memory_mod.F:15
mumps_memory_mod::mumps_realloc
Definition mumps_memory_mod.F:18
min
#define min(a, b)
Definition macros.h:20
max
#define max(a, b)
Definition macros.h:21
mpi_recv
subroutine mpi_recv(buf, cnt, datatype, source, tag, comm, status, ierr)
Definition mpi.f:461
mpi_isend
subroutine mpi_isend(buf, cnt, datatype, dest, tag, comm, ireq, ierr)
Definition mpi.f:382
mpi_test
subroutine mpi_test(ireq, flag, status, ierr)
Definition mpi.f:502
mpi_iprobe
subroutine mpi_iprobe(source, tag, comm, flag, status, ierr)
Definition mpi.f:360
mpi_wait
subroutine mpi_wait(ireq, status, ierr)
Definition mpi.f:525
mpi_reduce
subroutine mpi_reduce(sendbuf, recvbuf, cnt, datatype, op, root, comm, ierr)
Definition mpi.f:120
mpi_comm_split
subroutine mpi_comm_split(comm, color, key, comm2, ierr)
Definition mpi.f:272
mpi_send
subroutine mpi_send(buf, cnt, datatype, dest, tag, comm, ierr)
Definition mpi.f:480
mpi_allreduce
subroutine mpi_allreduce(sendbuf, recvbuf, cnt, datatype, operation, comm, ierr)
Definition mpi.f:103
mpi_alltoall
subroutine mpi_alltoall(sendbuf, sendcnt, sendtype, recvbuf, recvcnt, recvtype, comm, ierr)
Definition mpi.f:161
mpi_reduce_scatter
subroutine mpi_reduce_scatter(sendbuf, recvbuf, rcvcnt, datatype, op, comm, ierr)
Definition mpi.f:137
mpi_barrier
subroutine mpi_barrier(comm, ierr)
Definition mpi.f:188
mpi_comm_size
subroutine mpi_comm_size(comm, size, ierr)
Definition mpi.f:263
mpi_bcast
subroutine mpi_bcast(buffer, cnt, datatype, root, comm, ierr)
Definition mpi.f:205
mpi_gather
subroutine mpi_gather(sendbuf, cnt, datatype, recvbuf, reccnt, rectype, root, comm, ierr)
Definition mpi.f:56
mpi_comm_free
subroutine mpi_comm_free(comm, ierr)
Definition mpi.f:238
mpi_irecv
subroutine mpi_irecv(buf, cnt, datatype, source, tag, comm, ireq, ierr)
Definition mpi.f:372
mpi_comm_rank
subroutine mpi_comm_rank(comm, rank, ierr)
Definition mpi.f:254
id
initmumps id
Definition multiplerhs_example.m:4
dmumps_parallel_analysis
Definition dana_aux_par.F:14
dmumps_parallel_analysis::mp
integer mp
Definition dana_aux_par.F:49
dmumps_parallel_analysis::dmumps_get_subtrees
subroutine dmumps_get_subtrees(ord, id)
Definition dana_aux_par.F:737
dmumps_parallel_analysis::dmumps_do_par_ord
subroutine dmumps_do_par_ord(id, ord, work)
Definition dana_aux_par.F:356
dmumps_parallel_analysis::mpg
integer mpg
Definition dana_aux_par.F:49
dmumps_parallel_analysis::dmumps_stop_descent
logical function dmumps_stop_descent(id, ord, nactive, anode, rproc, alist, list, peakmem, nnodes, checkmem)
Definition dana_aux_par.F:635
dmumps_parallel_analysis::dmumps_send_buf
subroutine dmumps_send_buf(apnt, proc, nprocs, bufsize, ipe, pe, leng, rcvbuf, msgcnt, sndcnt, comm)
Definition dana_aux_par.F:1909
dmumps_parallel_analysis::toprows
integer toprows
Definition dana_aux_par.F:49
dmumps_parallel_analysis::dmumps_build_loc_graph
subroutine dmumps_build_loc_graph(id, ord, gsize, ipe, pe, leng, i_halo_map, top_graph, work)
Definition dana_aux_par.F:1590
dmumps_parallel_analysis::dmumps_set_par_ord
subroutine dmumps_set_par_ord(id, ord)
Definition dana_aux_par.F:214
dmumps_parallel_analysis::dmumps_cnt_kids
integer function dmumps_cnt_kids(node, ord)
Definition dana_aux_par.F:714
dmumps_parallel_analysis::dmumps_make_loc_idx
subroutine dmumps_make_loc_idx(id, topnodes, lperm, liperm, ord)
Definition dana_aux_par.F:1212
dmumps_parallel_analysis::prokg
logical prokg
Definition dana_aux_par.F:51
dmumps_parallel_analysis::dmumps_mergeswap
subroutine dmumps_mergeswap(n, l, a1, a2)
Definition dana_aux_par.F:2154
dmumps_parallel_analysis::mumps_getsize
integer function mumps_getsize(a)
Definition dana_aux_par.F:2268
dmumps_parallel_analysis::lpok
logical lpok
Definition dana_aux_par.F:51
dmumps_parallel_analysis::dmumps_assemble_msg
subroutine dmumps_assemble_msg(bufsize, rcvbuf, ipe, pe, leng)
Definition dana_aux_par.F:2040
dmumps_parallel_analysis::memcnt
integer(8) memcnt
Definition dana_aux_par.F:50
dmumps_parallel_analysis::lp
integer lp
Definition dana_aux_par.F:49
dmumps_parallel_analysis::prok
logical prok
Definition dana_aux_par.F:51
dmumps_parallel_analysis::dmumps_parsymfact
subroutine dmumps_parsymfact(id, ord, gpe, gnv, work)
Definition dana_aux_par.F:874
dmumps_parallel_analysis::dmumps_assemble_top_graph
subroutine dmumps_assemble_top_graph(id, nlocvars, lperm, top_graph, ncliques, lstvar, lvarpt, ipe, pe, leng, elen)
Definition dana_aux_par.F:1236
dmumps_parallel_analysis::dmumps_mergesort
subroutine dmumps_mergesort(n, k, l)
Definition dana_aux_par.F:2201
dmumps_parallel_analysis::maxmem
integer(8) maxmem
Definition dana_aux_par.F:50
dmumps_parallel_analysis::nrl
integer nrl
Definition dana_aux_par.F:49
dmumps_struc_def
Definition dmumps_struc_def.F:14
mumps_ana_ord_wrappers
Definition ana_orderings_wrappers_m.F:19
mumps_memory_mod
Definition mumps_memory_mod.F:14
mumps_memory_mod::mumps_i8realloc8
subroutine mumps_i8realloc8(array, minsize, info, lp, force, copy, string, memcnt, errcode)
Definition mumps_memory_mod.F:339
mumps_memory_mod::mumps_i8realloc
subroutine mumps_i8realloc(array, minsize, info, lp, force, copy, string, memcnt, errcode)
Definition mumps_memory_mod.F:141
mumps_memory_mod::mumps_idealloc
subroutine mumps_idealloc(a1, a2, a3, a4, a5, a6, a7, memcnt)
Definition mumps_memory_mod.F:833
mumps_memory_mod::mumps_i8dealloc
subroutine mumps_i8dealloc(a1, a2, a3, a4, a5, a6, a7, memcnt)
Definition mumps_memory_mod.F:890
mumps_memory_mod::mumps_irealloc8
subroutine mumps_irealloc8(array, minsize, info, lp, force, copy, string, memcnt, errcode)
Definition mumps_memory_mod.F:240
dmumps_parallel_analysis::arrpnt
Definition dana_aux_par.F:46
dmumps_parallel_analysis::graph_type
Definition dana_aux_par.F:40
dmumps_parallel_analysis::ord_type
Definition dana_aux_par.F:24
mumps_secfin
subroutine mumps_secfin(t)
Definition tools_common.F:277
mumps_icopy_32to64_64c
subroutine mumps_icopy_32to64_64c(intab, sizetab8, outtab8)
Definition tools_common.F:1159
mumps_set_ierror
subroutine mumps_set_ierror(size8, ierror)
Definition tools_common.F:865
mumps_icopy_64to32
subroutine mumps_icopy_64to32(intab8, sizetab, outtab)
Definition tools_common.F:1201
mumps_secdeb
subroutine mumps_secdeb(t)
Definition tools_common.F:270
mumps_icopy_32to64
subroutine mumps_icopy_32to64(intab, sizetab, outtab8)
Definition tools_common.F:1149
mumps_make1root
subroutine mumps_make1root(n, frere, fils, nfsiz, theroot)
Definition tools_common.F:32