OpenRadioss 2025.1.11
OpenRadioss project
Loading...
Searching...
No Matches
i22buce.F File Reference
#include "implicit_f.inc"
#include "comlock.inc"
#include "units_c.inc"
#include "warn_c.inc"
#include "com01_c.inc"
#include "param_c.inc"
#include "lockon.inc"
#include "lockoff.inc"

Go to the source code of this file.

Functions/Subroutines

subroutine i22buce (x, irect, nsv, inacti, iskip, nmn, nshel_t, nsn, cand_e, cand_b, gap, noint, ii_stok, ncontact, bminma, tzinf, maxbox, minbox, mwag, curv_max, nb_n_b, eshift, ild, ifq, ifpen, stfn, nin, stf, igap, nshelr_l, ncont, renum, nsnrold, gapmin, gapmax, curv_max_max, num_imp, intth, itask, bgapsmx, i_mem, ixs, bufbric, nbric, itab, nshel_l, ale_connectivity, ipari)

Function/Subroutine Documentation

◆ i22buce()

subroutine i22buce ( x,
integer, dimension(4,*) irect,
integer, dimension(*) nsv,
integer inacti,
integer iskip,
integer nmn,
integer nshel_t,
integer nsn,
integer, dimension(*) cand_e,
integer, dimension(*) cand_b,
gap,
integer noint,
integer ii_stok,
integer ncontact,
bminma,
tzinf,
maxbox,
minbox,
integer, dimension(*) mwag,
curv_max,
integer nb_n_b,
integer eshift,
integer ild,
integer ifq,
integer, dimension(*) ifpen,
stfn,
integer nin,
stf,
integer igap,
integer nshelr_l,
integer ncont,
integer, dimension(*) renum,
integer nsnrold,
gapmin,
gapmax,
curv_max_max,
integer num_imp,
integer intth,
integer itask,
bgapsmx,
integer i_mem,
integer, dimension(nixs,*) ixs,
integer, dimension(nbric) bufbric,
integer nbric,
integer, dimension(*) itab,
integer nshel_l,
type(t_ale_connectivity), intent(in) ale_connectivity,
integer, dimension(npari) ipari )

Definition at line 43 of file i22buce.F.

55C============================================================================
56C cette routine est appelee par : I22MAINCT(/int7/i22mainct.F)
57C----------------------------------------------------------------------------
58C cette routine appelle : I22TRI(/int7/i22trivox.F)
59C ARRET(/sortie/arret.F)
60C============================================================================
61C M o d u l e s
62C-----------------------------------------------
63 USE tri7box
64 USE i22tri_mod
65 USE message_mod
66 USE i22edge_mod
67 USE i22bufbric_mod
68 USE ale_connectivity_mod
69C-----------------------------------------------
70C I m p l i c i t T y p e s
71C-----------------------------------------------
72#include "implicit_f.inc"
73#include "comlock.inc"
74C-----------------------------------------------
75C C o m m o n B l o c k s
76C-----------------------------------------------
77#include "units_c.inc"
78#include "warn_c.inc"
79#include "com01_c.inc"
80#include "param_c.inc"
81C-----------------------------------------------
82C D u m m y A r g u m e n t s
83C-----------------------------------------------
84 INTEGER IPARI(NPARI), ISKIP
85 INTEGER NMN, NSN, NOINT,IDT,INACTI,IFQ, NIN, NSNR,NSNROLD
86 INTEGER N_CAND_B
87 INTEGER IRECT(4,*),NSV(*),MWAG(*), RENUM(*),NUM_IMP, ITASK
88 INTEGER CAND_E(*),CAND_B(*),IFPEN(*), IXS(NIXS,*), BUFBRIC(NBRIC)
89 INTEGER NCONTACT,ESHIFT,ILD,NB_N_B,IGAP,NCONT,INTTH,I_MEM,NBRIC
90 INTEGER ITAB(*),NSHEL_T,NSHEL_L, NSHELR_L, II_STOK
91 my_real
92 . gap,tzinf,maxbox,minbox,curv_max_max,
93 . gapmin, gapmax, bminma(6),curv_max(nshel_t),bgapsmx
94 my_real
95 . x(3,*), stfn(*),
96 . stf(*)
97 INTEGER :: CANDB, CANDE, NB_SHORT, IPOS_, IREF,ILEN,IVAL
98 TYPE(t_ale_connectivity), INTENT(IN) :: ALE_CONNECTIVITY
99C-----------------------------------------------
100C L o c a l V a r i a b l e s
101C-----------------------------------------------
102 TYPE(BRICK_ENTITY), DIMENSION(:),ALLOCATABLE :: BRICK_GRID
103 TYPE(EDGE_ENTITY), DIMENSION(:),ALLOCATABLE :: EDGE_GRID
104
105 INTEGER I_ADD_MAX,ICUR
106 parameter(i_add_max = 1001)
107
108 INTEGER I, J, I_ADD, IP0, IP1, MAXSIZ,
109 . ADD(2,I_ADD_MAX), LOC_PROC, N, ISZNSNR,
110 . NSNFIOLD(NSPMD)
111
112 my_real marge, aaa, bid
113
114 CHARACTER*8 KEY
115
116 INTEGER :: NCAND, NBF, NBL, SOMB, SOME, IPA
117 INTEGER :: TMP1, TMP2, IPOS
118 INTEGER, ALLOCATABLE, DIMENSION(:) :: IFIRST, ILAST
119 CHARACTER*12 ::filename
120
121 INTEGER, ALLOCATABLE, DIMENSION(:) :: order, VALUE
122
123 INTEGER R2,MIN2
124
125C-----------------------------------------------
126C PROV
127C-----------------------------------------------
128 INTEGER NBX,NBY,NBZ
129 INTEGER (KIND=8) :: NBX8,NBY8,NBZ8,RES8,LVOXEL8
130C-----------------------------------------------
131C S o u r c e L i n e s
132C-----------------------------------------------
133 ip0 = 1
134 isznsnr = 0
135 i_mem = 0
136 marge = 1.1 * tzinf-gap
137
138 aaa = sqrt(nmn /
139 . ((bminma(1)-bminma(4))*(bminma(2)-bminma(5))
140 . +(bminma(2)-bminma(5))*(bminma(3)-bminma(6))
141 . +(bminma(3)-bminma(6))*(bminma(1)-bminma(4))))
142
143 aaa = 0.75*aaa
144
145 nbx = nint(aaa*(bminma(1)-bminma(4)))
146 nby = nint(aaa*(bminma(2)-bminma(5)))
147 nbz = nint(aaa*(bminma(3)-bminma(6)))
148 nbx = max(nbx,1)+2
149 nby = max(nby,1)+2
150 nbz = max(nbz,1)+2
151
152 nbx8=nbx
153 nby8=nby
154 nbz8=nbz
155 res8=(nbx8+2)*(nby8+2)*(nbz8+2)
156 lvoxel8 = lvoxel
157
158 IF(res8 > lvoxel8) THEN
159 if(itask==0.and.ibug22_tri==1)print *, "redim Voxel"
160 aaa = lvoxel
161 aaa = aaa/((nbx8+2)*(nby8+2)*(nbz8+2))
162 aaa = aaa**(third)
163 nbx = int((nbx+2)*aaa)-2
164 nby = int((nby+2)*aaa)-2
165 nbz = int((nbz+2)*aaa)-2
166 nbx = max(nbx,1)
167 nby = max(nby,1)
168 nbz = max(nbz,1)
169 ENDIF
170
171 nbx8=nbx
172 nby8=nby
173 nbz8=nbz
174 res8=(nbx8+2)*(nby8+2)*(nbz8+2)
175
176 IF(res8 > lvoxel8) THEN
177 nbx = min(100,max(nbx8,1))
178 nby = min(100,max(nby8,1))
179 nbz = min(100,max(nbz8,1))
180 print *, "stop 678"
181c stop 678
182 end if
183
184 ! initialisation complete de VOXEL
185 ! (en // SMP il y a possibilite de redondance de traitement mais no pb)
186 DO i=inivoxel,(nbx+2)*(nby+2)*(nbz+2)
187 voxel1(i)=0 !---reset voxel brick---!
188 ENDDO
189
190 inivoxel = max(inivoxel,(nbx+2)*(nby+2)*(nbz+2)+1)
191
192 if(itask==0.and.ibug22_tri==1)print *, "call i22trivox"
193
194 CALL i22trivox(
195 1 nsn ,renum ,nshelr_l ,isznsnr ,i_mem ,
196 2 irect ,x ,stf ,stfn ,bminma ,
197 3 nsv ,ii_stok ,cand_b ,eshift ,cand_e ,
198 4 ncontact,noint ,tzinf ,
199 5 voxel1 ,nbx ,nby ,nbz ,
200 6 bid ,
201 7 nshel_t ,
202 8 marge ,
203 9 nin ,itask ,ixs ,bufbric ,
204 a nbric ,itab ,nshel_l )
205
206C I_MEM = 1 ==> PAS ASSEZ DE MEMOIRE PILE
207C I_MEM = 2 ==> PAS ASSEZ DE MEMOIRE CANDIDATS
208C I_MEM = 3 ==> TROP NIVEAUX PILE
209 IF(i_mem==1)THEN
210 nb_n_b = nb_n_b + 1
211 IF ( nb_n_b > ncont) THEN
212 CALL ancmsg(msgid=85,anmode=aninfo,
213 . i1=noint)
214 CALL arret(2)
215 ENDIF
216 ild = 1
217 iskip=1
218 ELSEIF(i_mem==2) THEN
219 IF(debug(1)>=1) THEN
220 iwarn = iwarn+1
221#include "lockon.inc"
222 WRITE(istdo,*)' **WARNING INTERFACE/MEMORY'
223 WRITE(iout,*)' **WARNING INTERFACE NB:',noint
224 WRITE(iout,*)' TOO MANY POSSIBLE IMPACTS'
225 WRITE(iout,*)' SIZE OF INFLUENCE ZONE IS'
226 WRITE(iout,*)' EXAPNDED'
227#include "lockoff.inc"
228 ENDIF
229C TZINF = THREE_OVER_4*TZINF !non sinon on perd les candidates voisines
230 ild = 1
231 iskip=1
232 ELSEIF(i_mem==3)THEN
233 nb_n_b = nb_n_b + 1
234 IF ( nb_n_b > ncont) THEN
235 CALL ancmsg(msgid=100,anmode=aninfo,
236 . i1=noint)
237 CALL arret(2)
238 ENDIF
239 ild = 1
240 iskip=1
241 ENDIF
242
243
244!-----------------debug
245 if(itask==0.and.ibug22_tri==1)then
246 print *, " |------------i22buce.F----------|"
247 print *, " | LISTE DES CANDIDATS |"
248 print *, " |-------------------------------|"
249 allocate(order(ii_stok) ,value(ii_stok))
250 min2 = minval(abs(cand_e(1:ii_stok)))
251 r2 = maxval(abs(cand_e(1:ii_stok)))-min2
252 DO i=1,ii_stok
253 value(i) = cand_b(i)*(r2+1)+abs(cand_e(i))-min2
254 ENDDO
255 order=0
256 !CALL QUICKSORT_I2 !(ORDER,II_STOK,VALUE)
257 DO i=1,ii_stok
258 if(cand_e(order(i))>0)then
259 print *,i,ixs(11,bufbric(cand_b(order(i)))),
260 . "avec+",nint(irect_l(1:4,iabs(cand_e(order(i))))) !negative value means that there is no intersection at all for this couple.
261 else
262 print *,i,ixs(11,bufbric(cand_b(order(i)))),
263 . "avec-",nint(irect_l(1:4,iabs(cand_e(order(i))))) !negative value means that there is no intersection at all for this couple.
264 endif
265 END DO
266 deallocate(order,value)
267 end if
268!-----------------debug
269
270!exemple de liste de candidats
271! II_STOK IXS(11,bufbric(CAND_B(I))) ) CAND_B(I) NINT(IRECT_L(1:4,IABS(CAND_E(I))) CAND_E(I) OCCURENCE BRIQUE
272! 01 39 (3) avec- 1176806 1176814 1176859 1176876 (12) <- IFIRST = 01
273! 02 39 (3) avec- 1176941 1176789 1176791 1176934 (11) <- ilast = 02
274! 03 40 (5) avec- 211 210 1176779 1176777 (02) <- IFIRST = 01
275! 04 40 (5) avec+ 1176874 1176777 1176779 1176841 (06) .
276! 05 40 (5) avec+ 1176874 1176841 1176814 1176806 (14) .
277! 06 40 (5) avec+ 1176806 1176814 1176859 1176876 (12) .
278! 07 40 (5) avec+ 1176876 1176859 207 206 (03) .
279! 08 40 (5) avec- 209 1176772 1176774 208 (01) <- ILAST = 08
280 !
281! NCAND = 8 (II_STOK)
282! LIST_B = {3,5} , NCANDB = 2
283! LIST_E = {1,2,3,6,11,12,14} , NCANDE = 7
284!
285!
286 CALL my_barrier
287
288 IF(iskip==1)THEN
289 nb=ncandb
290 RETURN
291 ENDIF
292
293 ! ##########################################
294 ! # CREATING BRICK LIST IDs #
295 ! # fill LIST_B #
296 ! # fill IADF,IADL #
297 ! ##########################################
298 ! II_STOK est le nombre de couple candidats, y compris les facettes non intersectante dans le voisinage
299 ! Ces derniers sont necessaires pour pouvoir y charger les forces de contact appropriees.
300 IF(itask==0)THEN
301 ALLOCATE(itagb(1:nbric))
302 ALLOCATE(ifirst(1:nbric)) !premiere occurence de la brique dans la liste des candidats
303 ALLOCATE(ilast(1:nbric)) !derniere occurence de la brique dans la liste des candidats
304 itagb(:) = 0
305 ifirst(:) = 0
306 ilast(:) = 0
307 !boucle sur la liste des candidats et tag des briques presentes
308 DO i=1,ii_stok
309 !pas encore marque
310 IF(itagb(cand_b(i)) == 0)THEN
311 ifirst(cand_b(i)) = i
312 ilast(cand_b(i)) = i !premier et dernier si aucune autre occurence
313 itagb(cand_b(i)) = 1
314 !deja marque
315 ELSE
316 ilast(cand_b(i)) = i
317 ENDIF
318 enddo!next I
319 ncandb = sum(itagb(:)) !toutes les briques intersectees ou non sans occurence multiple
320 ALLOCATE(list_b(ncandb))
321 ALLOCATE(iadf(ncandb)) !adresse debut dans CAND_B
322 ALLOCATE(iadl(ncandb)) !adresse fin dans CAND_B
323 ipos = 0
324 DO i=1,nbric
325 IF(itagb(i) == 0)cycle
326 ipos = ipos + 1
327 list_b(ipos) = i
328 iadf(ipos) = ifirst(i)
329 iadl(ipos) = ilast(i)
330 ENDDO
331 endif!(ITASK==0)THEN
332
333 ! ##########################################
334 ! # CREATING FACE LIST IDs #
335 ! # fill LIST_E #
336 ! ##########################################
337 ! II_STOK est le nombre de couple candidats, y compris les facettes non intersectante dans le voisinage
338 ! Ces derniers sont necessaires pour pouvoir y charger les forces de contact appropriees.
339 ! Les ids de facettes negatives designe des facette non intersectante pour la brique concernee
340 IF(itask==0)THEN
341 ALLOCATE(itage(1:nirect_l))
342 itage(:) = 0
343 !boucle sur la liste des candidats et tag des briques presentes
344 DO i=1,ii_stok
345 itage(iabs(cand_e(i))) = 1
346 ENDDO
347 ncande = sum(itage(:)) !toutes les briques intersectees ou non sans occurence multiple
348 ALLOCATE(list_e(ncande))
349 ipos = 0
350 DO i=1,nirect_l
351 IF(itage(i) == 0)cycle
352 ipos = ipos + 1
353 list_e(ipos) = i
354 itage(i) = ipos !le tag traite devient la position dans LIST_E
355 ENDDO
356 endif!(ITASK==0)THEN
357
358
359! La liste des candidats (CAND_B,CAND_E) contient des occurences multiples et desordonnees de CAND_E.
360! La liste LIST_E est la liste ordonne sans repetition.
361! pour un couple de candidat donne (input index IDX1) , on associe la position dans LIST_E correspondante ( resultat index IDX2)
362!
363! II_STOK GET_LIST_E_POS_FROM_CAND_E_POS CAND_E(I)
364! 01 pos 6 DANS LIST_E(:) <--- (12)
365! 02 pos 5 DANS LIST_E(:) <--- (11)
366! 03 pos 2 DANS LIST_E(:) <--- (02)
367! 04 pos 4 DANS LIST_E(:) <--- (06)
368! 05 pos 7 DANS LIST_E(:) <--- (14)
369! 06 pos 6 DANS LIST_E(:) <--- (12)
370! 07 pos 3 dans list_e(:) <--- (03)
371! 08 pos 1 DANS LIST_E(:) <--- (01)
372
373! CAND_E 12 11 02 06 12 14 03 01
374! ITAG_E 01 02 03 04 05 06 07 08 09 10 11 12 13 14
375! x x x x x x x
376! LIST_E 01 02 03 06 11 12 14
377!
378!GET_LIST_E_POS_FROM_CAND_E_POS 06 05 02 04 07 06 03 01
379
380
381 ! ##########################################
382 ! # SURJECTIVE APP IDX1 |-> IDX2 #
383 ! # LINK CAND_E(IDX1) TO LIST_E(IDX2) #
384 ! ##########################################
385 IF(itask==0)THEN
386 ALLOCATE(get_list_e_pos_from_cand_e_pos(ii_stok))
387 DO i=1,ii_stok
388 get_list_e_pos_from_cand_e_pos(i) = itage(iabs(cand_e(i)))
389 ENDDO
390 endif!(ITASK==0)THEN
391
392 CALL my_barrier
393
394 ncand = ii_stok
395
396 if(itask==0.AND.ibug22_tri==1)then
397
398 allocate(order(ncandb) ,value(ncandb))
399 order = 0
400 !CALL QUICKSORT_I2 !(ORDER,NCANDB,list_b)
401
402 print *, ""
403 print *, " |------------i22buce.F----------|"
404 print *, " | SYNTHESE DES CANDIDATS |"
405 print *, " |-------------------------------|"
406 print *, ncand , "couples candidats avec :"
407 print *, ncandb , "briques differentes, et"
408 print *, ncande , "facettes differentes."
409 print *, ""
410 print *, " |------------i22buce.F----------|"
411 print *, " | BRIQUES RETENUES |"
412 print *, " | FOR CUT CELL BUFFER |"
413 print *, " |-------------------------------|"
414 print *, (ixs(11,bufbric(list_b(order(j)))),j=1,ncandb)
415 print *, ""
416 !print *, " |------------i22buce.F----------|"
417 !print *, " | ADRESSES DANS CAND_B |"
418 !print *, " |-------------------------------|"
419 !print *, " iadf=", IADF
420 !print *, " iadl=", IADL
421 !print *, ""
422 deallocate(order,VALUE)
423
424 end if
425
426 !NCANDB is now the number of bricks in CAND_B(1:NCAND)
427 !LIST_B is now the list of these bricks
428 !IADF(I)- IADL(I) is index spectra of a given brick from list_b inside candidate list 1:II_STOK
429 ! from IADF(J) to IADL(J) CAND_B(:) is the same one (see lock on/off in i22sto)
430
431
432C -------------------------------------------------------------
433C RECUPERATION DES DONNEES DE LA CUT CELL DU CYCLE PRECEDENT
434C Indispensable d'avoir un historique pour le calcul de
435C certaines evolutions ou le suivi topologique par exemple.
436C -------------------------------------------------------------
437
438 CALL i22get_prev_data(
439 1 x ,ii_stok ,cand_b ,cand_e ,itask ,
440 2 nbric ,itab ,bufbric ,ncand ,
441 3 ixs ,nin)
442
443 !This block must be after I22GET_PREV_DATA OTHERWISE OLD BUFFER IS ERASED
444
445 !s'assurer que cela soit fait dans i22intersect
446! IF(ITASK==0)THEN
447! DO I=1,NCANDB_ADD
448! BRICK_LIST(NIN,NCANDB+I)%ID = BUFBRIC(LIST_B_ADD(I))
449! BRICK_LIST(NIN,NCANDB+I)%ICODE = 0
450! BRICK_LIST(NIN,NCANDB+I)%IDBLE = 0
451! BRICK_LIST(NIN,NCANDB+I)%NBCUT = 0
452! DO J=1,12
453! brick_list(nin,ncandb+i)%EDGE(j)%NBCUT = 0
454! ENDDO
455! ENDDO
456! ENDIF
457
458 CALL my_barrier
459
460
461C -------------------------------------------------------------
462C CALCUL DES POINTS D'INTERSECTION
463C on peut prendre la liste des candidats II_STOK telle quelle
464C et la traiter en multi-threading.s
465C -------------------------------------------------------------
466 ! ##########################################
467 ! # POINTS INTERSECTIONS #
468 ! ##########################################
469 CALL i22intersect(
470 1 x ,ii_stok ,cand_b ,cand_e ,itask ,
471 2 nbric ,itab ,bufbric ,ncand ,
472 3 ixs ,nin)
473
474 CALL my_barrier
475
476 ! ##########################################
477 ! # INTERPRETATIONS DU PARTITIONNEMENT #
478 ! ##########################################
479 CALL i22ident(
480 1 ixs ,x ,itask, nin, bufbric)
481
482 nb = ncandb
483 CALL my_barrier
484
485
486 ! ##########################################
487 ! # DECHARGEMENT MEMOIRE #
488 ! ##########################################
489 IF(itask==0)THEN
490 DEALLOCATE(itagb)
491 DEALLOCATE(itage)
492 DEALLOCATE(ifirst)
493 DEALLOCATE(ilast)
494 DEALLOCATE(iadf)
495 DEALLOCATE(iadl)
496 DEALLOCATE(list_b)
497 DEALLOCATE(list_e)
498 DEALLOCATE(get_list_e_pos_from_cand_e_pos)
499 ENDIF
500
501
502
503 999 CONTINUE
504
505
506 RETURN
my_real
#define my_real
Definition cppsort.cpp:32
i22get_prev_data
subroutine i22get_prev_data(x, ii_stok, cand_b, cand_e, itask, nbric, itab, bufbric, ncand, ixs, nin)
Definition i22get_prev_data.F:37
i22ident
subroutine i22ident(ixs, x, itask, nin, bufbric)
Definition i22ident.F:38
i22intersect
subroutine i22intersect(x, ii_stok, cand_b, cand_e, itask, nbric, itab, bufbric, ncand, ixs, nin)
Definition i22intersect.F:41
i22trivox
subroutine i22trivox(nsn, renum, nshelr_l, isznsnr, i_mem, irect, x, stf, stfn, bminma, nsv, ii_stok, cand_b, eshift, cand_e, mulnsn, noint, tzinf, voxel, nbx, nby, nbz, cand_p, nshel_t, marge, nin, itask, ixs, bufbric, nbric, itab, nshel_l)
Definition i22trivox.F:49
min
#define min(a, b)
Definition macros.h:20
max
#define max(a, b)
Definition macros.h:21
ale_connectivity_mod
Definition ale_connectivity_mod.F:223
i22bufbric_mod
Definition cut-cell-search_mod.F:95
i22bufbric_mod::brick_list
type(brick_entity), dimension(:,:), allocatable, target brick_list
Definition cut-cell-search_mod.F:105
i22edge_mod
Definition cut-cell-buffer_mod.F:48
i22tri_mod
Definition cut-cell-search_mod.F:212
i22tri_mod::nb
integer nb
Definition cut-cell-search_mod.F:487
i22tri_mod::ibug22_tri
integer ibug22_tri
Definition cut-cell-search_mod.F:231
i22tri_mod::nirect_l
integer nirect_l
Definition cut-cell-search_mod.F:447
i22tri_mod::list_e
integer, dimension(:), allocatable list_e
Definition cut-cell-search_mod.F:495
i22tri_mod::iadf
integer, dimension(:), allocatable iadf
Definition cut-cell-search_mod.F:495
i22tri_mod::get_list_e_pos_from_cand_e_pos
integer, dimension(:), allocatable get_list_e_pos_from_cand_e_pos
Definition cut-cell-search_mod.F:495
i22tri_mod::itage
integer, dimension(:), allocatable itage
Definition cut-cell-search_mod.F:502
i22tri_mod::iadl
integer, dimension(:), allocatable iadl
Definition cut-cell-search_mod.F:495
i22tri_mod::itagb
integer, dimension(:), allocatable itagb
Definition cut-cell-search_mod.F:502
i22tri_mod::list_b
integer, dimension(:), allocatable list_b
Definition cut-cell-search_mod.F:495
i22tri_mod::ncande
integer ncande
Definition cut-cell-search_mod.F:499
i22tri_mod::ncandb
integer ncandb
Definition cut-cell-search_mod.F:499
message_mod
Definition message_mod.F:1249
tri7box::voxel1
integer, dimension(lvoxel) voxel1
Definition tri7box.F:53
tri7box::inivoxel
integer inivoxel
Definition tri7box.F:53
tri7box::lvoxel
integer lvoxel
Definition tri7box.F:51
ancmsg
subroutine ancmsg(msgid, msgtype, anmode, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14, i15, i16, i17, i18, i19, i20, r1, r2, r3, r4, r5, r6, r7, r8, r9, c1, c2, c3, c4, c5, c6, c7, c8, c9, prmode)
Definition message.F:889
arret
subroutine arret(nn)
Definition arret.F:87
my_barrier
subroutine my_barrier
Definition machine.F:31