36 . IXS,IXC,IXT,IXP,IXR,IXTG,IXS10,
37 . ADDCNEL,CNEL,TAG_NODE,TAG_ELEM )
54#include "implicit_f.inc"
64 TYPE(nodal_arrays_),
INTENT(inout) :: NODES
65 INTEGER,
INTENT(in) :: NB_EDGE
66 INTEGER,
DIMENSION(2*NB_EDGE),
INTENT(in) :: LIST_NODE
68 TYPE(intbuf_struct_),
DIMENSION(NINTER),
INTENT(inout) :: INTBUF_TAB
69 INTEGER,
DIMENSION(NINTER),
INTENT(inout) :: NEWFRONT
70 INTEGER,
DIMENSION(NIXS,NUMELS),
INTENT(in) :: IXS
71 INTEGER,
DIMENSION(NIXC,NUMELC),
INTENT(in) :: IXC
72 INTEGER,
DIMENSION(NIXT,NUMELT),
INTENT(in) :: IXT
73 INTEGER,
DIMENSION(NIXP,NUMELP),
INTENT(in) :: IXP
74 INTEGER,
DIMENSION(NIXR,NUMELR),
INTENT(in) :: IXR
75 INTEGER,
DIMENSION(NIXTG,NUMELTG),
INTENT(in) :: IXTG
76 INTEGER,
DIMENSION(6,NUMELS10)INTENT(in) :: IXS10
77 INTEGER,
DIMENSION(0:NUMNOD+1),
INTENT(in) :: ADDCNEL
78 INTEGER,
DIMENSION(NPARI,NINTER),
INTENT(in) :: IPARI
79 my_real,
DIMENSION(NPROPG,NUMGEO),
INTENT(in) :: geo
80 INTEGER,
DIMENSION(0:LCNEL),
INTENT(in) :: CNEL
81 INTEGER,
DIMENSION(NUMNOD),
INTENT(inout) :: TAG_NODE
82 INTEGER,
DIMENSION(NUMELS+NUMELQ+NUMELC+NUMELT+NUMELP+NUMELR+NUMELTG),
INTENT(inout) :: TAG_ELEM
86 INTEGER :: I,J,NODE_ID
88INTEGER :: NB_EDGE_R_PROC_M,NB_EDGE_R_PROC_S
89 INTEGER,
DIMENSION(2) :: LOCAL_NODE,GLOBAL_NODE
90 INTEGER,
DIMENSION(:),
ALLOCATABLE :: LIST_EDGE_R_PROC
93 INTEGER :: NB_RESULT_INTERSECT,NB_EDGE_1,NB_EDGE_2
94 INTEGER,
DIMENSION(:),
ALLOCATABLE :: ,INTERSECT_1,INTERSECT_2
95 INTEGER,
DIMENSION(:),
ALLOCATABLE :: TMP_ARRAY
100 ALLOCATE( list_edge_r_proc(4*nb_edge) )
106 ALLOCATE( result_intersect( shoot_struct%MAX_EDGE_NB ) )
107 ALLOCATE( intersect_1( shoot_struct%MAX_EDGE_NB ) )
108 ALLOCATE( intersect_2( shoot_struct%MAX_EDGE_NB ) )
112 global_node(1:2) = list_node( (i-1)*2+1:(i-1)*2+2)
114 local_node(j) = get_local_node_id(nodes,global_node(j))
119 node_id = local_node(1)
120 nb_edge_1 = shoot_struct%SHIFT_M_NODE_EDGE(node_id+1) - shoot_struct%SHIFT_M_NODE_EDGE
121 shift = shoot_struct%SHIFT_M_NODE_EDGE(node_id)
122 intersect_1(1:nb_edge_1) = shoot_struct%M_NODE_EDGE( shift+1:shift+nb_edge_1 )
125 node_id = local_node(2)
126 nb_edge_2 = shoot_struct%SHIFT_M_NODE_EDGE(node_id+1) - shoot_struct%SHIFT_M_NODE_EDGE(node_id)
127 shift = shoot_struct%SHIFT_M_NODE_EDGE(node_id)
128 intersect_2(1:nb_edge_2) = shoot_struct%M_NODE_EDGE( shift+1:shift+nb_edge_2 )
132 nb_result_intersect = 0
133 IF(nb_edge_1>0.AND.nb_edge_2>0)
THEN
134 CALL intersect_2_sorted_sets( intersect_1,nb_edge_1,
135 . intersect_2,nb_edge_2,
136 . result_intersect,nb_result_intersect )
138 nb_result_intersect = 0
143 IF(nb_edge_r_proc_m + nb_result_intersect >
SIZE(list_edge_r_proc) )
THEN
144 ALLOCATE( tmp_array(nb_edge_r_proc_m) )
145 tmp_array(1:nb_edge_r_proc_m) = list_edge_r_proc(1:nb_edge_r_proc_m)
146 DEALLOCATE( list_edge_r_proc )
147 ALLOCATE( list_edge_r_proc( (nb_edge_r_proc_m+nb_result_intersect
148 list_edge_r_proc(1:nb_edge_r_proc_m) = tmp_array(1:nb_edge_r_proc_m)
150 list_edge_r_proc(1+nb_edge_r_proc_m:1+nb_edge_r_proc_m+nb_result_intersect) =
152 nb_edge_r_proc_m = nb_edge_r_proc_m + nb_result_intersect
158 global_node(1:2) = list_node( (i-1)*2+1:(i-1)*2+2)
160 local_node(j) = get_local_node_id(nodes
165 node_id = local_node(1)
166 nb_edge_1 = shoot_struct%SHIFT_S_NODE_EDGE(node_id
167 shift = shoot_struct%SHIFT_S_NODE_EDGE(node_id)
168 intersect_1(1:nb_edge_1) = shoot_struct%S_NODE_EDGE( shift+1:shift+nb_edge_1 )
171 node_id = local_node(2)
172 nb_edge_2 = shoot_struct%SHIFT_S_NODE_EDGE
173 shift = shoot_struct%SHIFT_S_NODE_EDGE(node_id)
174 intersect_2(1:nb_edge_2) = shoot_struct%S_NODE_EDGE( shift+1:shift+nb_edge_2 )
178 nb_result_intersect = 0
179 IF(nb_edge_1>0.AND.nb_edge_2>0)
THEN
180 CALL intersect_2_sorted_sets( intersect_1,nb_edge_1,
181 . intersect_2,nb_edge_2,
182 . result_intersect,nb_result_intersect )
184 nb_result_intersect = 0
188 my_size = nb_edge_r_proc_s
189 IF(my_size + nb_result_intersect >
SIZE(list_edge_r_proc) )
THEN
190 ALLOCATE( tmp_array(my_size) )
191 tmp_array(1:my_size) = list_edge_r_proc(1:my_size)
192 DEALLOCATE( list_edge_r_proc )
193 ALLOCATE( list_edge_r_proc( (my_size+nb_result_intersect) * 2 ) )
194 list_edge_r_proc(1:my_size) = tmp_array(1:my_size)
195 DEALLOCATE( tmp_array )
197 list_edge_r_proc(1+my_size:my_size+nb_result_intersect) =
198 . result_intersect(1:nb_result_intersect)
199 nb_edge_r_proc_s = nb_edge_r_proc_s + nb_result_intersect
203 . list_edge_r_proc(1),list_edge_r_proc(1+nb_edge_r_proc_m),
204 . shoot_struct%SHIFT_INTERFACE,intbuf_tab,newfront,ipari,geo,
205 . ixs,ixc,ixt,ixp,ixr,ixtg,ixs10,
206 . addcnel,cnel,tag_node,tag_elem,shoot_struct )
208 DEALLOCATE( list_edge_r_proc )
209 DEALLOCATE( result_intersect )
210 DEALLOCATE( intersect_1 )
211 DEALLOCATE( intersect_2 )
subroutine check_edge_state(itask, m_edge_nb, s_edge_nb, m_edge_id, s_edge_id, shift_interface, intbuf_tab, newfront, ipari, geo, ixs, ixc, ixt, ixp, ixr, ixtg, ixs10, addcnel, cnel, tag_node, tag_elem, shoot_struct)
subroutine find_edge_from_remote_proc(shoot_struct, nb_edge, list_node, intbuf_tab, nodes, newfront, ipari, geo, ixs, ixc, ixt, ixp, ixr, ixtg, ixs10, addcnel, cnel, tag_node, tag_elem)