1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
|
! Copyright (C) 2006 Imperial College London and others.
!
! Please see the AUTHORS file in the main source directory for a full list
! of copyright holders.
!
! Prof. C Pain
! Applied Modelling and Computation Group
! Department of Earth Science and Engineering
! Imperial College London
!
! amcgsoftware@imperial.ac.uk
!
! This library is free software; you can redistribute it and/or
! modify it under the terms of the GNU Lesser General Public
! License as published by the Free Software Foundation; either
! version 2.1 of the License, or (at your option) any later version.
!
! This library is distributed in the hope that it will be useful,
! but WITHOUT ANY WARRANTY; without even the implied warranty of
! MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
! Lesser General Public License for more details.
!
! You should have received a copy of the GNU Lesser General Public
! License along with this library; if not, write to the Free Software
! Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
! USA
#include "fdebug.h"
module adapt_state_module
! these 5 need to be on top and in this order, so as not to confuse silly old intel compiler
use quadrature
use elements
use sparse_tools
use fields
use state_module
!
use adaptivity_1d
use adapt_integration, only : adapt_mesh_3d => adapt_mesh
use adaptive_timestepping
use checkpoint
use diagnostic_fields_wrapper
use discrete_properties_module
use edge_length_module
use eventcounter
use field_options
use global_parameters, only : OPTION_PATH_LEN, periodic_boundary_option_path, adaptivity_mesh_name, domain_bbox, topology_mesh_name
use hadapt_extrude
use hadapt_metric_based_extrude
use halos
use interpolation_manager
use interpolation_module
use mba_adapt_module
use mba2d_integration
use mba3d_integration
use metric_assemble
use anisotropic_gradation, only: use_anisotropic_gradation
use parallel_tools
use boundary_conditions
use boundary_conditions_from_options
use populate_state_module
use project_metric_to_surface_module
use reserve_state_module
use sam_integration
use tictoc
use timeloop_utilities
use fields_halos
use data_structures
use detector_data_types
use detector_parallel
use diagnostic_variables
use intersection_finder_module
use diagnostic_variables
use diagnostic_fields_wrapper_new, only : calculate_diagnostic_variables_new => calculate_diagnostic_variables
use pickers
#ifdef HAVE_ZOLTAN
use zoltan_integration
use mpi_interfaces
#endif
use mesh_files
implicit none
private
public :: adapt_mesh, adapt_state, adapt_state_first_timestep
public :: insert_metric_for_interpolation, extract_and_remove_metric, sam_options
public :: adapt_state_module_check_options
interface adapt_state
module procedure adapt_state_single, adapt_state_multiple
end interface adapt_state
contains
subroutine adapt_mesh_simple(old_positions, metric, new_positions, node_ownership, force_preserve_regions, &
lock_faces, allow_boundary_elements)
type(vector_field), intent(in) :: old_positions
type(tensor_field), intent(inout) :: metric
type(vector_field), intent(out) :: new_positions
integer, dimension(:), pointer, optional :: node_ownership
logical, intent(in), optional :: force_preserve_regions
type(integer_set), intent(in), optional :: lock_faces
logical, intent(in), optional :: allow_boundary_elements
assert(.not. mesh_periodic(old_positions))
select case(old_positions%dim)
case(1)
call adapt_mesh_1d(old_positions, metric, new_positions, &
& node_ownership = node_ownership, force_preserve_regions = force_preserve_regions)
case(2)
call adapt_mesh_mba2d(old_positions, metric, new_positions, &
& force_preserve_regions=force_preserve_regions, lock_faces=lock_faces, &
& allow_boundary_elements=allow_boundary_elements)
case(3)
if(have_option("/mesh_adaptivity/hr_adaptivity/adaptivity_library/libmba3d")) then
assert(.not. present(lock_faces))
call adapt_mesh_mba3d(old_positions, metric, new_positions, &
force_preserve_regions=force_preserve_regions)
else
call adapt_mesh_3d(old_positions, metric, new_positions, node_ownership = node_ownership, &
force_preserve_regions=force_preserve_regions, lock_faces=lock_faces)
end if
case default
FLAbort("Mesh adaptivity requires a 1D, 2D or 3D mesh")
end select
end subroutine adapt_mesh_simple
subroutine adapt_mesh_periodic(old_positions, metric, new_positions, force_preserve_regions)
type(vector_field), intent(in) :: old_positions
type(tensor_field), intent(inout) :: metric
type(vector_field), intent(out) :: new_positions
logical, intent(in), optional :: force_preserve_regions
! Periodic adaptivity variables
integer :: no_bcs, bc, i, j, k, l
type(integer_set) :: lock_faces, surface_ids
type(vector_field) :: unwrapped_positions_A, unwrapped_positions_B, intermediate_positions
integer, dimension(2) :: shape_option
integer, dimension(:), allocatable :: surface_id
type(tensor_field) :: unwrapped_metric_A, unwrapped_metric_B, intermediate_metric
integer :: stat
type(csr_sparsity), pointer :: eelist, nelist, periodic_eelist
type(scalar_field) :: front_field
integer :: ele, ele2, node, face
integer, dimension(:), pointer :: neighbours, eles, periodic_neighbours, neighbours2
integer :: new_physical_colour, new_aliased_colour
integer :: face_count, existing_face_count
integer, dimension(:), allocatable :: sndgln, boundary_ids, element_owners, fnodes
integer :: floc
integer, dimension(:), allocatable :: physical_colours, aliased_colours
type(integer_set) :: nodes_to_move, periodic_nodes_to_move, extra_nodes_to_move
real, dimension(:,:), allocatable:: aliased_positions, physical_positions
character(len=OPTION_PATH_LEN) :: periodic_mapping_python
type(integer_hash_table) :: aliased_to_new_node_number
integer, dimension(:), pointer :: nodes, faces
real, dimension(:, :), allocatable :: tmp_bbox
type(integer_set) :: new_aliased_faces, new_physical_faces, old_physical_nodes
type(integer_set) :: front_contained_nodes, front_face_nodes
type(integer_set) :: other_surface_ids
integer :: dim, sid
integer, save :: delete_me = 1
assert(mesh_periodic(metric))
assert(all(metric%dim == old_positions%dim))
dim = metric%dim(1)
no_bcs = option_count(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions')
intermediate_positions = old_positions
call incref(intermediate_positions)
intermediate_metric = metric
call incref(metric)
! As written, this is quadratic in the number of boundary conditions. I'm not too stressed
! about that
do bc=0,no_bcs-1
shape_option = option_shape(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/physical_boundary_ids')
allocate(physical_colours(shape_option(1)))
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/physical_boundary_ids', physical_colours)
shape_option = option_shape(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/aliased_boundary_ids')
allocate(aliased_colours(shape_option(1)))
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/aliased_boundary_ids', aliased_colours)
! Step a). Unwrap the periodic input.
unwrapped_positions_A = make_mesh_unperiodic_from_options(intermediate_positions, trim(periodic_boundary_option_path(dim)))
call allocate(unwrapped_metric_A, unwrapped_positions_A%mesh, trim(metric%name))
call remap_field(intermediate_metric, unwrapped_metric_A)
! We don't need the periodic mesh anymore
call deallocate(intermediate_positions)
call deallocate(intermediate_metric)
! Step b). Collect all the faces that need to be locked through the adapt
call allocate(lock_faces)
call allocate(surface_ids)
call allocate(other_surface_ids)
! Collect all the relevant surface labels
do j=0,no_bcs-1
! Physical ...
shape_option = option_shape(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/physical_boundary_ids')
allocate(surface_id(shape_option(1)))
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/physical_boundary_ids', surface_id)
call insert(surface_ids, surface_id)
if (j /= bc) then
call insert(other_surface_ids, surface_id)
end if
deallocate(surface_id)
! and aliased
shape_option = option_shape(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/aliased_boundary_ids')
allocate(surface_id(shape_option(1)))
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/aliased_boundary_ids', surface_id)
call insert(surface_ids, surface_id)
if (j /= bc) then
call insert(other_surface_ids, surface_id)
end if
deallocate(surface_id)
end do
! With the relevant surface labels, loop through the mesh and fetch the information from them
do j=1,surface_element_count(unwrapped_positions_A)
if (has_value(surface_ids, surface_element_id(unwrapped_positions_A, j))) then
call insert(lock_faces, j)
end if
end do
call deallocate(surface_ids)
! Step c). Adapt the mesh, locking appropriately, and interpolate the metric
! mesh_0: incoming unwrapped mesh
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 0, position=unwrapped_positions_A, model=unwrapped_positions_A%mesh)
call vtk_write_surface_mesh("surface", 0, unwrapped_positions_A)
end if
call adapt_mesh_simple(unwrapped_positions_A, unwrapped_metric_A, unwrapped_positions_B, &
& force_preserve_regions=force_preserve_regions, &
& lock_faces=lock_faces, allow_boundary_elements=.true.)
! mesh_1: first adapted mesh
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 1, position=unwrapped_positions_B, model=unwrapped_positions_B%mesh)
call vtk_write_surface_mesh("surface", 1, unwrapped_positions_B)
end if
call allocate(unwrapped_metric_B, unwrapped_positions_B%mesh, trim(metric%name))
call linear_interpolation(unwrapped_metric_A, unwrapped_positions_A, unwrapped_metric_B, unwrapped_positions_B)
call deallocate(lock_faces)
call deallocate(unwrapped_positions_A)
call deallocate(unwrapped_metric_A)
! Step d). Reperiodise
intermediate_positions = make_mesh_periodic_from_options(unwrapped_positions_B, periodic_boundary_option_path(dim))
intermediate_positions%mesh%name = "TmpMesh"
intermediate_positions%mesh%option_path = periodic_boundary_option_path(dim)
call allocate(intermediate_metric, intermediate_positions%mesh, trim(metric%name))
call remap_field(unwrapped_metric_B, intermediate_metric, stat=stat)
assert(stat /= REMAP_ERR_DISCONTINUOUS_CONTINUOUS)
assert(stat /= REMAP_ERR_HIGHER_LOWER_CONTINUOUS)
! mesh_2: first adapted mesh, periodised
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 2, position=intermediate_positions, model=intermediate_positions%mesh)
call vtk_write_surface_mesh("surface", 2, intermediate_positions)
end if
! Step e). Advance a front in the new mesh using the unwrapped nelist from the aliased boundary
! until the front contains no nodes on the boundary; this forms the new cut
nelist => extract_nelist(unwrapped_positions_B)
shape_option = option_shape(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/aliased_boundary_ids')
allocate(surface_id(shape_option(1)))
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/aliased_boundary_ids', surface_id)
call allocate(nodes_to_move)
call allocate(periodic_nodes_to_move)
! start from the nodes on the aliased boundary
do j=1,surface_element_count(unwrapped_positions_B)
if (any(surface_id == surface_element_id(unwrapped_positions_B, j))) then
call insert(nodes_to_move, face_global_nodes(unwrapped_positions_B, j))
call insert(periodic_nodes_to_move, face_global_nodes(intermediate_positions, j))
end if
end do
deallocate(surface_id)
! if any nodes on the other periodic are in the elements directly
! adjacent move them too
if (key_count(other_surface_ids)>0) then
call allocate(extra_nodes_to_move)
do i=1, key_count(nodes_to_move)
node = fetch(nodes_to_move, i)
neighbours => row_m_ptr(nelist, node)
do j=1, size(neighbours)
ele = neighbours(j)
faces => ele_faces(unwrapped_positions_B, ele)
do k=1, size(faces)
face = faces(k)
if (face>surface_element_count(unwrapped_positions_B)) cycle
sid = surface_element_id(unwrapped_positions_B, face)
if (has_value(other_surface_ids, sid)) then
call insert(nodes_to_move, face_global_nodes(unwrapped_positions_B, face))
! work out face on the other side
periodic_neighbours => ele_neigh(intermediate_positions, ele)
face = ele_face(intermediate_positions, periodic_neighbours(k), ele)
call insert(extra_nodes_to_move, face_global_nodes(unwrapped_positions_B, face))
end if
end do
end do
end do
call insert(nodes_to_move, set2vector(extra_nodes_to_move))
call deallocate(extra_nodes_to_move)
end if
! the new cut now consists of the faces in the elements adjacent
! to the nodes to move that are not in "nodes_to_move" itself
! the nodes on the cut will in fact not be moved as they will retain
! their aliased position in the periodic position field
call allocate(new_physical_faces)
call allocate(new_aliased_faces)
do i=1, key_count(nodes_to_move)
node = fetch(nodes_to_move, i)
neighbours => row_m_ptr(nelist, node)
do j=1, size(neighbours)
ele = neighbours(j)
call insert(periodic_nodes_to_move, ele_nodes(intermediate_positions, ele))
faces => ele_faces(unwrapped_positions_B, ele)
neighbours2 => ele_neigh(unwrapped_positions_B, ele)
do k=1, size(faces)
face = faces(k)
ele2 = neighbours2(k)
if (ele2<=0) cycle
if (.not. any(has_value(nodes_to_move,face_global_nodes(unwrapped_positions_B, face))) &
.and. .not. any(has_value(nodes_to_move,ele_nodes(unwrapped_positions_B, ele2))) &
) then
call insert(new_physical_faces, face)
! opposite face becomes aliased
face = ele_face(unwrapped_positions_B, ele2, ele)
call insert(new_aliased_faces, face)
end if
end do
end do
end do
call deallocate(nodes_to_move)
! don't want to move nodes on the new cut, as they'll retain
! their original before-aliasing position
floc = face_loc(intermediate_positions, 1)
allocate(fnodes(1:floc))
do j=1, key_count(new_physical_faces)
face = fetch(new_physical_faces, j)
fnodes = face_global_nodes(intermediate_positions, face)
do k=1, floc
node = fnodes(k)
if (has_value(periodic_nodes_to_move, node)) then
call remove(periodic_nodes_to_move, node)
end if
end do
end do
deallocate(fnodes)
! now move the nodes in the periodic positions field
allocate(aliased_positions(intermediate_positions%dim, key_count(periodic_nodes_to_move)))
allocate(physical_positions(intermediate_positions%dim, key_count(periodic_nodes_to_move)))
do j=1,key_count(periodic_nodes_to_move)
node = fetch(periodic_nodes_to_move, j)
aliased_positions(:, j) = node_val(intermediate_positions, node)
end do
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/coordinate_map', periodic_mapping_python)
call set_from_python_function(physical_positions, periodic_mapping_python, aliased_positions, time=0.0)
do j=1,key_count(periodic_nodes_to_move)
node = fetch(periodic_nodes_to_move, j)
call set(intermediate_positions, node, physical_positions(:, j))
end do
deallocate(physical_positions)
deallocate(aliased_positions)
call deallocate(periodic_nodes_to_move)
! Step f). Colour those faces on either side of the new cut
! Choose a new colour that isn't used
new_physical_colour = maxval(physical_colours)
new_aliased_colour = maxval(aliased_colours)
! the only forward-compatible way of doing this is to fetch the information from
! the current faces into the primitive data structures, and then re-call add_faces
! fixme: for mixed meshes
! note well: we /lose/ the old faces, as we don't need that cut anymore
! (and can't retain it through the adapt anyway)
! first things first: find out how many faces we have
face_count = key_count(new_physical_faces) + key_count(new_aliased_faces)
do j=1,surface_element_count(intermediate_positions)
if (.not. (any(surface_element_id(intermediate_positions, j) == physical_colours) .or. &
& any(surface_element_id(intermediate_positions, j) == aliased_colours))) then
face_count = face_count + 1
end if
end do
allocate(boundary_ids(face_count))
allocate(element_owners(face_count))
allocate(sndgln(face_count * floc))
! fetch the existing information
l = 0
do j=1,surface_element_count(intermediate_positions)
if (.not. (any(surface_element_id(intermediate_positions, j) == physical_colours) .or. &
& any(surface_element_id(intermediate_positions, j) == aliased_colours))) then
l = l + 1
boundary_ids(l) = surface_element_id(intermediate_positions, j)
element_owners(l) = face_ele(intermediate_positions, j)
sndgln( (l-1)*floc + 1:l*floc ) = face_global_nodes(intermediate_positions, j)
end if
end do
! and now fetch the information for the faces we are adding
do j=1, key_count(new_physical_faces)
l = l + 1
face = fetch(new_physical_faces, j)
boundary_ids(l) = new_physical_colour
element_owners(l) = face_ele(unwrapped_positions_B, face)
sndgln( (l-1)*floc + 1:l*floc ) = face_global_nodes(intermediate_positions, face)
end do
call deallocate(new_physical_faces)
do j=1, key_count(new_aliased_faces)
l = l + 1
face = fetch(new_aliased_faces, j)
boundary_ids(l) = new_aliased_colour
element_owners(l) = face_ele(unwrapped_positions_B, face)
sndgln( (l-1)*floc + 1:l*floc ) = face_global_nodes(intermediate_positions, face)
end do
call deallocate(new_aliased_faces)
assert(l == face_count)
! deallocate the old faces, and rebuild
! mesh_3: first adapted mesh, periodised with moving front nodes moved over
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 3, position=intermediate_positions, model=intermediate_positions%mesh)
call vtk_write_surface_mesh("surface", 3, intermediate_positions)
end if
call deallocate_faces(intermediate_positions%mesh)
call add_faces(intermediate_positions%mesh, sndgln=sndgln, element_owner=element_owners, boundary_ids=boundary_ids)
intermediate_metric%mesh = intermediate_positions%mesh
! mesh_4: first adapted mesh, periodised with moving front nodes moved over and surface mesh relabeled
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 4, position=intermediate_positions, model=intermediate_positions%mesh)
call vtk_write_surface_mesh("surface", 4, intermediate_positions)
end if
deallocate(sndgln)
deallocate(element_owners)
deallocate(boundary_ids)
! Step g). Unwrap again
! We need to fiddle with the options tree to mark the aliased and physical surface IDs appropriately
unwrapped_positions_A = make_mesh_unperiodic_from_options(intermediate_positions, trim(periodic_boundary_option_path(dim)), &
aliased_to_new_node_number=aliased_to_new_node_number, stat=stat)
! mesh_5: adapted once, moved up, ready to adapt again
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 5, position=unwrapped_positions_A, model=unwrapped_positions_A%mesh)
call vtk_write_surface_mesh("surface", 5, unwrapped_positions_A)
end if
call allocate(unwrapped_metric_A, unwrapped_positions_A%mesh, trim(metric%name))
call remap_field(intermediate_metric, unwrapped_metric_A)
call deallocate(intermediate_positions)
call deallocate(intermediate_metric)
assert(has_faces(unwrapped_positions_A%mesh))
call deallocate(unwrapped_positions_B)
call deallocate(unwrapped_metric_B)
! Step h). Adapt again
call allocate(lock_faces)
call allocate(surface_ids)
! Collect all the relevant surface labels
do j=0,no_bcs-1
! Physical ...
shape_option = option_shape(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/physical_boundary_ids')
allocate(surface_id(shape_option(1)))
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/physical_boundary_ids', surface_id)
call insert(surface_ids, surface_id)
deallocate(surface_id)
! and aliased
shape_option = option_shape(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/aliased_boundary_ids')
allocate(surface_id(shape_option(1)))
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(j)//']/aliased_boundary_ids', surface_id)
call insert(surface_ids, surface_id)
deallocate(surface_id)
end do
! With the relevant surface labels, loop through the mesh and fetch the information from them
do j=1,surface_element_count(unwrapped_positions_A)
if (has_value(surface_ids, surface_element_id(unwrapped_positions_A, j))) then
call insert(lock_faces, j)
end if
end do
call deallocate(surface_ids)
call adapt_mesh_simple(unwrapped_positions_A, unwrapped_metric_A, unwrapped_positions_B, &
& force_preserve_regions=force_preserve_regions, &
& lock_faces=lock_faces, allow_boundary_elements=.true.)
call deallocate(lock_faces)
! mesh_7: after second adapt
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 7, position=unwrapped_positions_B, model=unwrapped_positions_B%mesh)
call vtk_write_surface_mesh("surface", 7, unwrapped_positions_B)
end if
call allocate(unwrapped_metric_B, unwrapped_positions_B%mesh, trim(metric%name))
call linear_interpolation(unwrapped_metric_A, unwrapped_positions_A, unwrapped_metric_B, unwrapped_positions_B)
call deallocate(unwrapped_positions_A)
call deallocate(unwrapped_metric_A)
! Step i). Reperiodise for the next go around!
intermediate_positions = make_mesh_periodic_from_options(unwrapped_positions_B, periodic_boundary_option_path(dim))
intermediate_positions%mesh%option_path = periodic_boundary_option_path(dim)
call allocate(intermediate_metric, intermediate_positions%mesh, trim(metric%name))
call remap_field(unwrapped_metric_B, intermediate_metric, stat=stat)
assert(stat /= REMAP_ERR_DISCONTINUOUS_CONTINUOUS)
assert(stat /= REMAP_ERR_HIGHER_LOWER_CONTINUOUS)
! Step j). If the user has specified an inverse coordinate map, then let's loop through the nodes in the mesh
! and map them back to inside the bounding box of the domain
if (have_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/inverse_coordinate_map')) then
! nodes_to_move stores the potential nodes to map.
! The rule is: we map any element which contains any node such that:
! the node's location is not inside the original bounding box, and
! the image of the node under the inverse mapping is inside the original bounding box
! So first let's find the nodes outside the bounding box
call allocate(nodes_to_move)
allocate(tmp_bbox(unwrapped_positions_B%dim, 2))
do j=1, node_count(unwrapped_positions_B)
tmp_bbox(:, 1) = node_val(unwrapped_positions_B, j)
tmp_bbox(:, 2) = node_val(unwrapped_positions_B, j)
if (.not. bbox_predicate(domain_bbox(1:unwrapped_positions_B%dim, :), tmp_bbox)) then
call insert(nodes_to_move, j)
end if
end do
allocate(aliased_positions(intermediate_positions%dim, key_count(nodes_to_move)))
allocate(physical_positions(intermediate_positions%dim, key_count(nodes_to_move)))
do j=1,key_count(nodes_to_move)
physical_positions(:, j) = node_val(unwrapped_positions_B, fetch(nodes_to_move, j))
end do
! and map those nodes
call get_option(trim(periodic_boundary_option_path(dim)) // '/from_mesh/periodic_boundary_conditions['//int2str(bc)//']/inverse_coordinate_map', periodic_mapping_python)
call set_from_python_function(aliased_positions, periodic_mapping_python, physical_positions, time=0.0)
! now let's loop through those nodes, and if the image is inside the bounding box, mark
! the elements to map
front_field = piecewise_constant_field(intermediate_positions%mesh, "AdvancingFront")
call zero(front_field)
nelist => extract_nelist(unwrapped_positions_B)
eelist => extract_eelist(unwrapped_positions_B)
periodic_eelist => extract_eelist(intermediate_positions)
do j=1,key_count(nodes_to_move)
tmp_bbox(:, 1) = aliased_positions(:, j)
tmp_bbox(:, 2) = aliased_positions(:, j)
if (bbox_predicate(domain_bbox(1:unwrapped_positions_B%dim, :), tmp_bbox)) then
eles => row_m_ptr(nelist, fetch(nodes_to_move, j))
do k=1,size(eles)
call set(front_field, eles(k), 1.0)
end do
end if
end do
deallocate(physical_positions)
deallocate(aliased_positions)
call deallocate(nodes_to_move)
deallocate(tmp_bbox)
! For doubly periodic, we need to make sure that the front is "periodic" in some sense.
! Otherwise, bad things can happen where the node on one side of the other BC wants to be
! mapped, but the other node doesn't, and there's no consistent solution.
do ele=1,ele_count(front_field)
if (node_val(front_field, ele) == 1.0) then
neighbours => ele_neigh(intermediate_positions, ele)
do j=1,size(neighbours)
face = ele_face(intermediate_positions, ele, neighbours(j))
if (face > surface_element_count(intermediate_positions)) cycle
if (has_value(other_surface_ids, surface_element_id(intermediate_positions, face))) then
call set(front_field, neighbours(j), 1.0)
end if
end do
end if
end do
! mesh_8: after second adapt, showing elements to be moved back into bounding box
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 8, position=unwrapped_positions_B, model=unwrapped_positions_B%mesh, sfields=(/front_field/))
call vtk_write_surface_mesh("surface", 8, unwrapped_positions_B)
end if
! mesh_8: same thing periodised
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 9, position=intermediate_positions, model=intermediate_positions%mesh, sfields=(/front_field/))
call vtk_write_surface_mesh("surface", 9, intermediate_positions)
end if
! OK. Now we know which elements we are mapping, it is very similar to the shuffling
! around we did earlier. The two main subtasks are to
! a) update the positions of the periodic nodes appropriately
! b) change the faces of the periodic mesh
! First thing: let's build two sets
! that store the current lists of physical and aliased faces.
call allocate(new_aliased_faces)
call allocate(new_physical_faces)
call allocate(old_physical_nodes)
existing_face_count = 0
do j=1,surface_element_count(intermediate_positions)
if (surface_element_id(intermediate_positions, j) == new_physical_colour) then
call insert(new_physical_faces, j)
call insert(old_physical_nodes, face_global_nodes(intermediate_positions, j))
else if (surface_element_id(intermediate_positions, j) == new_aliased_colour) then
call insert(new_aliased_faces, j)
else
existing_face_count = existing_face_count + 1
end if
end do
call allocate(front_contained_nodes)
call allocate(front_face_nodes)
do ele=1,ele_count(front_field)
if (node_val(front_field, ele) == 1.0) then
call insert(front_contained_nodes, ele_nodes(intermediate_positions, ele))
neighbours => row_m_ptr(eelist, ele)
periodic_neighbours => row_m_ptr(periodic_eelist, ele)
faces => ele_faces(intermediate_positions, ele)
neighbourloop: do k=1,size(neighbours)
j = neighbours(k)
face = faces(k)
if (has_value(new_physical_faces, face)) then
call insert(front_face_nodes, face_global_nodes(intermediate_positions, face))
call remove(new_physical_faces, face)
call remove(new_aliased_faces, ele_face(intermediate_positions, periodic_neighbours(k), ele))
end if
if (j > 0) then
if (node_val(front_field, j) /= 1.0) then
face = ele_face(intermediate_positions, ele, j)
call insert(new_aliased_faces, face)
face = ele_face(intermediate_positions, j, ele)
call insert(new_physical_faces, face)
end if
end if
end do neighbourloop
nodes => ele_nodes(intermediate_positions, ele)
do k=1,size(nodes)
if (has_value(old_physical_nodes, nodes(k))) then
call insert(front_face_nodes, nodes(k))
end if
end do
end if
end do
call deallocate(old_physical_nodes)
! Now pack into the primitive data structures
allocate(boundary_ids(existing_face_count + 2 * key_count(new_physical_faces)))
allocate(element_owners(existing_face_count + 2 * key_count(new_physical_faces)))
allocate(sndgln(floc * (existing_face_count + 2 * key_count(new_physical_faces))))
l = 1
do j=1,surface_element_count(intermediate_positions)
if (surface_element_id(intermediate_positions, j) == new_physical_colour) then
cycle
else if (surface_element_id(intermediate_positions, j) == new_aliased_colour) then
cycle
else
boundary_ids(l) = surface_element_id(intermediate_positions, j)
element_owners(l) = face_ele(intermediate_positions, j)
sndgln( (l-1)*floc + 1:l*floc ) = face_global_nodes(intermediate_positions, j)
l = l + 1
end if
end do
assert(l == existing_face_count + 1)
do j=1,key_count(new_physical_faces)
face = fetch(new_physical_faces, j)
boundary_ids(l) = new_physical_colour
element_owners(l) = face_ele(intermediate_positions, face)
sndgln( (l-1)*floc + 1:l*floc ) = face_global_nodes(intermediate_positions, face)
l = l + 1
face = fetch(new_aliased_faces, j)
boundary_ids(l) = new_aliased_colour
element_owners(l) = face_ele(intermediate_positions, face)
sndgln( (l-1)*floc + 1:l*floc ) = face_global_nodes(intermediate_positions, face)
l = l + 1
end do
assert(l == size(boundary_ids) + 1)
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_internal_face_mesh("surface", 11, unwrapped_positions_B, face_sets=(/new_physical_faces, new_aliased_faces/))
end if
assert(key_count(new_physical_faces) == key_count(new_aliased_faces))
call deallocate(new_physical_faces)
call deallocate(new_aliased_faces)
! deallocate the old faces, and rebuild
call deallocate_faces(intermediate_positions%mesh)
call add_faces(intermediate_positions%mesh, sndgln=sndgln, element_owner=element_owners, boundary_ids=boundary_ids)
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_surface_mesh("surface", 12, intermediate_positions)
end if
intermediate_metric%mesh = intermediate_positions%mesh
deallocate(sndgln)
deallocate(element_owners)
deallocate(boundary_ids)
call set_minus(nodes_to_move, front_contained_nodes, front_face_nodes)
call deallocate(front_contained_nodes)
call deallocate(front_face_nodes)
allocate(aliased_positions(intermediate_positions%dim, key_count(nodes_to_move)))
allocate(physical_positions(intermediate_positions%dim, key_count(nodes_to_move)))
do j=1,key_count(nodes_to_move)
physical_positions(:, j) = node_val(intermediate_positions, fetch(nodes_to_move, j))
end do
call set_from_python_function(aliased_positions, periodic_mapping_python, physical_positions, time=0.0)
allocate(tmp_bbox(intermediate_positions%dim, 2))
do j=1,key_count(nodes_to_move)
tmp_bbox(:, 1) = aliased_positions(:, j)
tmp_bbox(:, 2) = aliased_positions(:, j)
call set(intermediate_positions, fetch(nodes_to_move, j), aliased_positions(:, j))
end do
deallocate(tmp_bbox)
deallocate(physical_positions)
deallocate(aliased_positions)
call deallocate(nodes_to_move)
call deallocate(front_field)
end if
call deallocate(unwrapped_positions_B)
call deallocate(unwrapped_metric_B)
deallocate(physical_colours)
deallocate(aliased_colours)
! mesh_10: final mesh
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("mesh", 10, position=intermediate_positions, model=intermediate_positions%mesh)
call vtk_write_surface_mesh("surface", 10, intermediate_positions)
end if
call deallocate(other_surface_ids)
end do
new_positions = intermediate_positions
new_positions%option_path = old_positions%option_path
new_positions%mesh%option_path = old_positions%mesh%option_path
new_positions%name = old_positions%name
new_positions%mesh%name = old_positions%mesh%name
call deallocate(intermediate_metric)
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("adapted_mesh", delete_me, position=new_positions, model=new_positions%mesh)
end if
unwrapped_positions_A = make_mesh_unperiodic_from_options(intermediate_positions, trim(periodic_boundary_option_path(dim)))
if(have_option("/mesh_adaptivity/hr_adaptivity/debug/write_periodic_adapted_mesh")) then
call vtk_write_fields("adapted_mesh_unwrapped", delete_me, position=unwrapped_positions_A, model=unwrapped_positions_A%mesh)
call vtk_write_surface_mesh("adapted_surface_unwrapped", delete_me, unwrapped_positions_A)
end if
call deallocate(unwrapped_positions_A)
delete_me = delete_me + 1
end subroutine adapt_mesh_periodic
subroutine adapt_mesh(old_positions, metric, new_positions, node_ownership, force_preserve_regions)
!!< A wrapper to select the appropriate adapt_mesh routine.
!!< If the input is periodic, then apply the algorithm for adapting periodic meshes.
type(vector_field), intent(in) :: old_positions
type(tensor_field), intent(inout) :: metric
type(vector_field), intent(out) :: new_positions
integer, dimension(:), pointer, optional :: node_ownership
logical, intent(in), optional :: force_preserve_regions
#ifdef DDEBUG
if(present(node_ownership)) then
assert(.not. associated(node_ownership))
end if
#endif
! Periodic case
if (mesh_periodic(old_positions)) then
call adapt_mesh_periodic(old_positions, metric, new_positions, force_preserve_regions=force_preserve_regions)
! Nonperiodic case
else
call adapt_mesh_simple(old_positions, metric, new_positions, node_ownership=node_ownership, force_preserve_regions=force_preserve_regions)
end if
end subroutine adapt_mesh
subroutine adapt_state_single(state, metric, initialise_fields)
type(state_type), intent(inout) :: state
type(tensor_field), intent(inout) :: metric
!! If present and .true., initialise fields rather than interpolate them
logical, optional, intent(in) :: initialise_fields
type(state_type), dimension(1) :: states
states = (/state/)
call adapt_state(states, metric, initialise_fields = initialise_fields)
state = states(1)
end subroutine adapt_state_single
subroutine adapt_state_multiple(states, metric, initialise_fields)
type(state_type), dimension(:), intent(inout) :: states
type(tensor_field), intent(inout) :: metric
!! If present and .true., initialise fields rather than interpolate them
logical, optional, intent(in) :: initialise_fields
call tictoc_clear(TICTOC_ID_SERIAL_ADAPT)
call tictoc_clear(TICTOC_ID_DATA_MIGRATION)
call tictoc_clear(TICTOC_ID_DATA_REMAP)
call tictoc_clear(TICTOC_ID_ADAPT)
call tic(TICTOC_ID_ADAPT)
call adapt_state_internal(states, metric, initialise_fields = initialise_fields)
call toc(TICTOC_ID_ADAPT)
call tictoc_report(2, TICTOC_ID_SERIAL_ADAPT)
call tictoc_report(2, TICTOC_ID_DATA_MIGRATION)
call tictoc_report(2, TICTOC_ID_DATA_REMAP)
call tictoc_report(2, TICTOC_ID_ADAPT)
end subroutine adapt_state_multiple
subroutine adapt_state_first_timestep(states)
!!< Subroutine to adapt the supplied states at the simulation start
type(state_type), dimension(:), intent(inout) :: states
character(len = *), parameter :: base_path = "/mesh_adaptivity/hr_adaptivity/adapt_at_first_timestep"
integer :: adapt_iterations, i
type(mesh_type), pointer :: old_mesh
type(tensor_field) :: metric
type(vector_field), pointer :: output_positions
real :: dt
ewrite(1, *) "In adapt_state_first_timestep"
call get_option(trim(base_path) // "/number_of_adapts", adapt_iterations)
do i = 1, adapt_iterations
ewrite(2, "(a,i0,a,i0)") "Performing first timestep adapt ", i, " of ", adapt_iterations
! Recalculate diagnostics, as error metric formulations may need them
call allocate_and_insert_auxilliary_fields(states)
call copy_to_stored_values(states,"Old")
call copy_to_stored_values(states,"Iterated")
call relax_to_nonlinear(states)
call calculate_diagnostic_variables(states)
call calculate_diagnostic_variables_new(states)
call enforce_discrete_properties(states)
if(have_option("/timestepping/adaptive_timestep/at_first_timestep")) then
! doing this here helps metric advection get the right amount of advection
call get_option("/timestepping/timestep", dt)
call calc_cflnumber_field_based_dt(states, dt, force_calculation = .true.)
call set_option("/timestepping/timestep", dt)
end if
! Form the new metric
old_mesh => extract_mesh(states(1), "CoordinateMesh")
call allocate(metric, old_mesh, "ErrorMetric")
call assemble_metric(states, metric)
! Adapt state, initialising fields from the options tree rather than
! interpolating them
call adapt_state(states, metric, initialise_fields = .true.)
end do
if(have_option(trim(base_path) // "/output_adapted_mesh")) then
output_positions => extract_vector_field(states(1), "Coordinate")
if(isparallel()) then
call write_mesh_files(parallel_filename("first_timestep_adapted_mesh"), output_positions)
call write_halos("first_timestep_adapted_mesh", output_positions%mesh)
else
call write_mesh_files("first_timestep_adapted_mesh", output_positions)
end if
end if
ewrite(1, *) "Exiting adapt_state_first_timestep"
end subroutine adapt_state_first_timestep
subroutine adapt_state_internal(states, metric, initialise_fields)
!!< Adapt the supplied states according to the supplied metric. In parallel,
!!< additionally re-load-balance with libsam. metric is deallocated by this
!!< routine. Based on adapt_state_2d.
type(state_type), dimension(:), intent(inout) :: states
type(tensor_field), intent(inout) :: metric
!! If present and .true., re-initialise fields with their initial condition.
!! This means that the fields are not interpolated but rather reinitialise
!! according to the specified initial condition in the options tree, except
!! if these fields are initialised from_file (checkpointed).
logical, optional, intent(in) :: initialise_fields
character(len = FIELD_NAME_LEN) :: metric_name
integer :: i, j, k, max_adapt_iteration
integer :: zoltan_min_adapt_iterations, zoltan_max_adapt_iterations, zoltan_additional_adapt_iterations
logical :: finished_adapting, final_adapt_iteration
integer, dimension(:), pointer :: node_ownership
type(state_type), dimension(size(states)) :: interpolate_states
type(mesh_type), pointer :: old_linear_mesh
type(vector_field) :: old_positions, new_positions
logical :: vertical_only
! Vertically structured adaptivity stuff
type(vector_field) :: extruded_positions
type(tensor_field) :: full_metric
logical :: vertically_structured_adaptivity
! Zoltan with detectors stuff
integer :: my_num_detectors, total_num_detectors_before_zoltan, total_num_detectors_after_zoltan
integer :: ierr
type(detector_list_ptr), dimension(:), pointer :: detector_list_array => null()
type(detector_type), pointer :: detector => null()
real :: global_min_quality, quality_tolerance
ewrite(1, *) "In adapt_state_internal"
nullify(node_ownership)
max_adapt_iteration = adapt_iterations()
vertically_structured_adaptivity = have_option( &
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity")
vertical_only = have_option(&
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity/inhomogenous_vertical_resolution/adapt_in_vertical_only")
! Don't need to strip the level 2 halo with Zoltan .. in fact, we don't want to
#ifndef HAVE_ZOLTAN
if(isparallel()) then
! In parallel, strip off the level 2 halo (expected by libsam). The level
! 2 halo is restored on the final adapt iteration by libsam.
call strip_level_2_halo(states, metric, initialise_fields=initialise_fields)
end if
#endif
#ifdef HAVE_ZOLTAN
call get_option("/mesh_adaptivity/hr_adaptivity/zoltan_options/additional_adapt_iterations", &
& zoltan_additional_adapt_iterations, default = 0)
if (zoltan_additional_adapt_iterations < 0) then
FLExit("Zoltan additional adapt iterations must not be negative.")
end if
call get_option("/mesh_adaptivity/hr_adaptivity/zoltan_options/element_quality_cutoff", &
& quality_tolerance, default = 0.6)
zoltan_min_adapt_iterations = adapt_iterations()
zoltan_max_adapt_iterations = zoltan_min_adapt_iterations + zoltan_additional_adapt_iterations
#endif
finished_adapting = .false.
if (max_adapt_iteration == 1) then
final_adapt_iteration = .true.
else
final_adapt_iteration = .false.
end if
i = 1
do while (.not. finished_adapting)
if(max_adapt_iteration > 1) then
ewrite(2, "(a,i0)") "Performing adapt ", i
end if
! Select mesh to adapt. Has to be linear and continuous.
! For vertically_structured_adaptivity, this is the horizontal mesh!
call find_mesh_to_adapt(states(1), old_linear_mesh)
ewrite(2, *) "External mesh to be adapted: " // trim(old_linear_mesh%name)
if (mesh_periodic(old_linear_mesh)) then
old_positions = extract_vector_field(states(1), trim(old_linear_mesh%name) // "Coordinate")
call incref(old_positions)
else
! Extract the mesh field to be adapted (takes a reference)
old_positions = get_coordinate_field(states(1), old_linear_mesh)
end if
ewrite(2, *) "Mesh field to be adapted: " // trim(old_positions%name)
call prepare_vertically_structured_adaptivity(states, metric, full_metric, &
old_positions, extruded_positions)
call initialise_boundcount(old_linear_mesh, old_positions)
do j = 1, size(states)
! Reference fields to be interpolated in interpolate_states
! (if initialise_fields then leave out those fields that can be reinitialised)
call select_fields_to_interpolate(states(j), interpolate_states(j), &
& first_time_step = initialise_fields)
end do
do j = 1, size(states)
call deallocate(states(j))
end do
if(isparallel()) then
! Update the fields to be interpolated, just in case
call halo_update(interpolate_states)
end if
! Before we start allocating any new objects we tag all references to
! current objects before the adapt so we can later on check they have all
! been deallocated
call tag_references()
! Generate a new mesh field based on the current mesh field and the input
! metric
if (.not. vertical_only) then
call adapt_mesh(old_positions, metric, new_positions, node_ownership = node_ownership, &
& force_preserve_regions=initialise_fields)
else
call allocate(new_positions,old_positions%dim,old_positions%mesh,name=trim(old_positions%name))
call set(new_positions,old_positions)
end if
! Insert the new mesh field and linear mesh into all states
call insert(states, new_positions%mesh, name = new_positions%mesh%name)
call insert(states, new_positions, name = new_positions%name)
if(associated(node_ownership)) then
call perform_vertically_inhomogenous_step(states, new_positions, old_positions, &
full_metric, extruded_positions, &
map=node_ownership)
else
call perform_vertically_inhomogenous_step(states, new_positions, old_positions, &
full_metric, extruded_positions)
end if
! We're done with old_positions, so we may deallocate it
call deallocate(old_positions)
! Insert meshes from reserve states
call restore_reserved_meshes(states)
! Next we recreate all derived meshes
call insert_derived_meshes(states)
if(vertically_structured_adaptivity) then
call deallocate(metric)
call deallocate(new_positions)
metric = full_metric
new_positions = get_coordinate_field(states(1), extract_mesh(states(1), topology_mesh_name))
if(associated(node_ownership)) then
! Deallocate the node ownership mapping since it's for the lower dimensional mesh
deallocate(node_ownership)
nullify(node_ownership)
end if
end if
if (get_num_detector_lists()>0) then
! Update detector element and local_coords for every detector in all lists
call get_registered_detector_lists(detector_list_array)
do j = 1, size(detector_list_array)
call search_for_detectors(detector_list_array(j)%ptr, new_positions)
end do
#ifdef DDEBUG
! Sanity check that all local detectors are owned
call get_registered_detector_lists(detector_list_array)
do j = 1, size(detector_list_array)
detector=>detector_list_array(j)%ptr%first
do k = 1, detector_list_array(j)%ptr%length
assert(detector%element>0)
detector=>detector%next
end do
end do
#endif
end if
! Then reallocate all fields
call allocate_and_insert_fields(states)
! Insert fields from reserve states
call restore_reserved_fields(states)
! Add on the boundary conditions again
call populate_boundary_conditions(states)
! Set their values
call set_boundary_conditions_values(states)
if((.not. final_adapt_iteration) .or. isparallel()) then
! If there are remaining adapt iterations, or we will be calling
! sam_drive or zoltan_drive, insert the old metric into interpolate_states(1) and a
! new metric into states(1), for interpolation
call insert_metric_for_interpolation(metric, new_positions%mesh, &
interpolate_states(1), states(1), &
metric_name = metric_name)
end if
! We're done with the old metric, so we may deallocate it / drop our
! reference
call deallocate(metric)
! We're done with the new_positions, so we may drop our reference
call deallocate(new_positions)
! Interpolate fields
if(associated(node_ownership)) then
call interpolate(interpolate_states, states, map = node_ownership)
else
call interpolate(interpolate_states, states)
end if
! Deallocate the old fields used for interpolation, referenced in
! interpolate_states
do j = 1, size(states)
call deallocate(interpolate_states(j))
end do
if(associated(node_ownership)) then
! Deallocate the node ownership mapping
deallocate(node_ownership)
nullify(node_ownership)
end if
if((.not. final_adapt_iteration) .or. isparallel()) then
! If there are remaining adapt iterations, extract the new metric for
! the next adapt iteration. If we will be calling sam_drive, always
! extract the new metric.
metric = extract_and_remove_metric(states(1), metric_name)
end if
if(present_and_true(initialise_fields)) then
! Reinitialise the prognostic fields (where possible)
call initialise_prognostic_fields(states)
! Prescribed fields are recalculated
! NOTE: we don't have exclude_interpolated, as the only prescribed
! fields that are interpolated are from_file which will be skipped
! anyway because initial_mesh = .false., and the routine doesn't know
! we're not interpolating other prescribed fields with interpolation
! options
call set_prescribed_field_values(states)
else
! Prescribed fields are recalculated (except those with interpolation
! options)
call set_prescribed_field_values(states, exclude_interpolated = .true.)
end if
! If strong bc or weak that overwrite then enforce the bc on the fields
call set_dirichlet_consistent(states)
! Insert aliased fields in state
call alias_fields(states)
default_stat%zoltan_drive_call=.false.
if(isparallel()) then
#ifdef HAVE_ZOLTAN
#ifdef DDEBUG
! Re-load-balance using zoltan
my_num_detectors = default_stat%detector_list%length
call MPI_ALLREDUCE(my_num_detectors, total_num_detectors_before_zoltan, 1, getPINTEGER(), &
MPI_SUM, MPI_COMM_FEMTOOLS, ierr)
assert(ierr == MPI_SUCCESS)
#endif
if(vertically_structured_adaptivity) then
! if we're doing vertically strucvtured adaptivity then we need to pass zoltan the
! horizontal metric, so let's derive that again but this time off the full metric
! we just interpolated...
! first we need the horizontal coordinates (called old_positions here)
call find_mesh_to_adapt(states(1), old_linear_mesh)
if (mesh_periodic(old_linear_mesh)) then
old_positions = extract_vector_field(states(1), trim(old_linear_mesh%name) // "Coordinate")
call incref(old_positions)
else
! Extract the mesh field to be adapted (takes a reference)
old_positions = get_coordinate_field(states(1), old_linear_mesh)
end if
! now collapse metric to a 2d version (saving the metric as full_metric in the meantime)
call prepare_vertically_structured_adaptivity(states, metric, full_metric, &
old_positions)
! we're done with the horizontal coordinates (out here at least)
call deallocate(old_positions)
! call zoltan now but we need to pass in both the 2d metric (metric) and the 3d full metric (full_metric)
! the first is needed to define the element qualities while the second must be interpolated to the newly
! decomposed mesh
if (zoltan_additional_adapt_iterations .gt. 0) then
call zoltan_drive(states, final_adapt_iteration, global_min_quality = global_min_quality, metric = metric, full_metric = full_metric)
else
call zoltan_drive(states, final_adapt_iteration, metric = metric, full_metric = full_metric)
end if
default_stat%zoltan_drive_call=.true.
! now we can deallocate the horizontal metric and point metric back at the full metric again
call deallocate(metric)
metric = full_metric
else
if (zoltan_additional_adapt_iterations .gt. 0) then
call zoltan_drive(states, final_adapt_iteration, global_min_quality = global_min_quality, metric = metric)
else
call zoltan_drive(states, final_adapt_iteration, metric = metric)
end if
default_stat%zoltan_drive_call=.true.
end if
#ifdef DDEBUG
my_num_detectors = default_stat%detector_list%length
call MPI_ALLREDUCE(my_num_detectors, total_num_detectors_after_zoltan, 1, getPINTEGER(), &
MPI_SUM, MPI_COMM_FEMTOOLS, ierr)
assert(ierr == MPI_SUCCESS)
assert(total_num_detectors_before_zoltan == total_num_detectors_after_zoltan)
#endif
#else
! Re-load-balance using libsam
call sam_drive(states, sam_options(i, max_adapt_iteration), metric = metric)
#endif
if(final_adapt_iteration) then
! On the last adapt iteration the metric was interpolated
! only for re-load-balancing, hence it must be deallocated
call deallocate(metric)
end if
end if
if(vertical_only) then
ewrite(2,*) "Using vertical_only adaptivity, so skipping the printing of references"
else if (no_reserved_meshes()) then
ewrite(2, *) "Tagged references remaining:"
call print_tagged_references(0)
else
ewrite(2, *) "There are reserved meshes, so skipping printing of references."
end if
call write_adapt_state_debug_output(states, final_adapt_iteration, &
& initialise_fields = initialise_fields)
call incrementeventcounter(EVENT_ADAPTIVITY)
call incrementeventcounter(EVENT_MESH_MOVEMENT)
! if this was the final adapt iteration we've now finished adapting
if (final_adapt_iteration) then
ewrite(2,*) "Finished adapting."
finished_adapting = .true.
else
! check whether the next iteration should be the last iteration
i = i + 1
#ifdef HAVE_ZOLTAN
if (i .eq. zoltan_max_adapt_iterations) then
! Only print out message if additional adapt iterations have been switched on
if (zoltan_additional_adapt_iterations .gt. 0) then
ewrite(2,*) "The next iteration will be final adapt iteration else we'll go over the maximum adapt iterations."
end if
if (zoltan_additional_adapt_iterations .gt. 0) then
if (global_min_quality .le. quality_tolerance) then
ewrite(-1,*) "Mesh contains elements with quality below element quality tolerance. May need to increase number of adapt iterations to ensure good quality mesh."
ewrite(-1,*) "min_quality = ", global_min_quality
ewrite(-1,*) "quality_tolerance = ", quality_tolerance
end if
end if
final_adapt_iteration = .true.
else
! Only check to allow an early exit if additional adapt iterations have been switched on
if (zoltan_additional_adapt_iterations .gt. 0) then
if((global_min_quality .gt. quality_tolerance) .and. (i .ge. zoltan_min_adapt_iterations)) then
ewrite(2,*) "The next iteration will be final adapt iteration as the mesh is of high enough quality and we have done the minimum number of adapt iterations."
final_adapt_iteration = .true.
end if
end if
end if
#else
if (i .eq. max_adapt_iteration) then
final_adapt_iteration = .true.
end if
#endif
end if
end do
if(isparallel()) then
call compute_domain_statistics(states)
end if
ewrite(1, *) "Exiting adapt_state_internal"
end subroutine adapt_state_internal
subroutine insert_metric_for_interpolation(metric, new_mesh, old_state, new_state, metric_name)
!!< Insert the old metric into old_states and a new metric into new_states,
!!< for interpolation
type(tensor_field), intent(in) :: metric
type(mesh_type), intent(in) :: new_mesh
type(state_type), intent(inout) :: old_state
type(state_type), intent(inout) :: new_state
character(len = *), optional, intent(out) :: metric_name
type(tensor_field) :: new_metric
assert(.not. has_tensor_field(old_state, metric%name))
call insert(old_state, metric, metric%name)
call allocate(new_metric, new_mesh, metric%name)
assert(.not. has_tensor_field(new_state, new_metric%name))
call insert(new_state, new_metric, new_metric%name)
if(present(metric_name)) metric_name = new_metric%name
call deallocate(new_metric)
end subroutine insert_metric_for_interpolation
function extract_and_remove_metric(state, metric_name) result(metric)
!!< Extract and remove the metric from the supplied state. metric takes
!!< a reference in this routine.
type(state_type), intent(inout) :: state
character(len = *), intent(in) :: metric_name
type(tensor_field) :: metric
type(tensor_field), pointer :: metric_ptr
! Extract the metric
metric_ptr => extract_tensor_field(state, metric_name)
metric = metric_ptr
#ifdef DDEBUG
! Check the metric
call check_metric(metric)
#endif
! Take a reference to the metric
call incref(metric)
! and remove it from state
call remove_tensor_field(state, metric%name)
end function extract_and_remove_metric
function adapt_iterations()
!!< Return the number of adapt / re-load-balance iterations
integer :: adapt_iterations
integer :: adapt_iterations_default
if(isparallel()) then
adapt_iterations_default = 3
else
adapt_iterations_default = 1
end if
call get_option('/mesh_adaptivity/hr_adaptivity/adapt_iterations', adapt_iterations, &
default=adapt_iterations_default)
end function adapt_iterations
pure function sam_options(adapt_iteration, max_adapt_iteration)
!!< Return sam options array
integer, intent(in) :: adapt_iteration
integer, intent(in) :: max_adapt_iteration
integer, dimension(10) :: sam_options
sam_options = 0
! Target number of partitions - 0 indicates size of MPI_COMM_FEMTOOLS
sam_options(1) = 0
! Graph partitioning options:
!sam_options(2) = 1 ! Clean partitioning to optimise the length of the
! interface boundary.
if(adapt_iteration < max_adapt_iteration) then
! Diffusive method -- fast partitioning, small partition movement
! thus edges are weighed to avoid areas of high activity.
! sam_options(2) = 2 ! Local diffusion
sam_options(2) = 3 ! Directed diffusion
else
! Clean partitioning to optimise the length of the interface boundary.
! This partitioning is then remapped onto the original partitioning to
! maximise overlap and therefore the volume of data migration.
sam_options(2) = 4
end if
! Heterogerious options (disabled)
sam_options(3) = 1
! Node and edge weight options
if(adapt_iteration < max_adapt_iteration) then
! Node weights are based on an estimate of the density of nodes in the
! region of a node after adaption
sam_options(4) = 2
! Calculate edge weights as being the maximum length in metric space of
! any element surrounding the edge. This should give high weights to
! elements that are likely to be involved in adaption.
sam_options(5) = 2
! Mixed formulation options
sam_options(6) = 1 ! Disabled
! Do not restore the level 2 halo
else
! No node weights
sam_options(4) = 1
! No edge weights
sam_options(5) = 1
! Mixed formulation options
sam_options(6) = 2 ! Enabled
! Restore the level 2 halo
end if
end function sam_options
subroutine prepare_vertically_structured_adaptivity(states, metric, full_metric, &
old_positions, extruded_positions)
type(state_type), dimension(:), intent(inout) :: states
! the metric will be collapsed, and the uncollapsed full_metric stored in full_metric
type(tensor_field), intent(inout) :: metric, full_metric
! old positions of the horizontal mesh
type(vector_field), intent(in) :: old_positions
type(vector_field), intent(inout), optional :: extruded_positions
integer, save:: adaptcnt=0
logical :: vertically_structured_adaptivity
logical :: vertically_inhomogenous_adaptivity
logical :: include_bottom_metric
logical :: split_gradation
type(scalar_field) :: edge_lengths
vertically_structured_adaptivity = have_option( &
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity")
vertically_inhomogenous_adaptivity = have_option( &
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity/inhomogenous_vertical_resolution")
include_bottom_metric = have_option( &
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity/include_bottom_metric")
split_gradation = have_option( &
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity/split_gradation")
if (vertically_structured_adaptivity) then
! project full mesh metric to horizontal surface mesh metric
full_metric=metric
call project_metric_to_surface(full_metric, old_positions, metric)
! include the components of the full_metric that are tangential to the bathymetry
! in the surface metric
! state only required for DistanceToBottom and Coordinate so states(1) is fine
if(include_bottom_metric) call incorporate_bathymetric_metric(states(1), full_metric, old_positions, metric)
if(split_gradation) then
call halo_update(metric)
! apply gradation just to the horizontal metric for now
call apply_horizontal_gradation(states(1), metric, full_metric, old_positions)
call halo_update(metric)
end if
! apply limiting to enforce maximum number of nodes
call limit_metric(old_positions, metric)
if (have_option('/mesh_adaptivity/hr_adaptivity/debug/write_metric_stages')) then
call allocate(edge_lengths, metric%mesh, "EdgeLengths")
call get_edge_lengths(metric, edge_lengths)
call vtk_write_fields('horizontal_metric', adaptcnt, &
old_positions, old_positions%mesh, &
sfields=(/ edge_lengths /), tfields=(/ metric /) )
adaptcnt=adaptcnt+1
call deallocate(edge_lengths)
end if
if (vertically_inhomogenous_adaptivity.and.present(extruded_positions)) then
! we need the position field later on for vertical adaptivity
! this takes a reference so that it's prevented from the big deallocate in adapt_state
extruded_positions = get_coordinate_field(states(1), full_metric%mesh)
end if
end if
end subroutine prepare_vertically_structured_adaptivity
subroutine perform_vertically_inhomogenous_step(states, new_positions, old_positions, full_metric, extruded_positions, map)
type(state_type), intent(inout), dimension(:) :: states
type(vector_field), intent(inout) :: new_positions, old_positions
type(tensor_field), intent(inout) :: full_metric
type(vector_field), intent(inout) :: extruded_positions
!! Map from new nodes to old elements
integer, dimension(:), optional, intent(in) :: map
logical :: vertically_inhomogenous_adaptivity
type(vector_field) :: full_metric_positions
type(tensor_field) :: gradation_full_metric
logical :: split_gradation
vertically_inhomogenous_adaptivity = have_option( &
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity/inhomogenous_vertical_resolution")
if (vertically_inhomogenous_adaptivity) then
! save the positions that the full_metric is on in case we're doing iterations of the 1d
! adaptivity process
full_metric_positions = extruded_positions
call incref(full_metric_positions)
call deallocate(extruded_positions) ! deallocate these to make space for the new extruded positions
split_gradation = have_option( &
& "/mesh_adaptivity/hr_adaptivity/vertically_structured_adaptivity/split_gradation")
if(split_gradation) then
! if we're applying gradation then apply it now to the full metric
! to see if this helps the linear interpolation pick things up
! (however, we don't want to modify the metric so let's take a copy)
call allocate(gradation_full_metric, full_metric%mesh, name="VerticalGradationFullMetric")
call set(gradation_full_metric, full_metric)
call apply_vertical_gradation(states(1), gradation_full_metric, full_metric_positions, old_positions)
else
gradation_full_metric = full_metric
call incref(gradation_full_metric)
end if
! extrude with adaptivity, computes new extruded_positions
call metric_based_extrude(new_positions, old_positions, extruded_positions, &
gradation_full_metric, full_metric_positions, map=map)
! insert the new positions in state:
! give it a generic temporary name, so that it'll be picked up and
! adjusted by insert_derived meshes later on:
extruded_positions%name="AdaptedExtrudedPositions"
call insert(states, extruded_positions, name="AdaptedExtrudedPositions")
! and drop our reference:
call deallocate(extruded_positions)
! and everything to do with the old metric and mesh too:
call deallocate(full_metric_positions)
call deallocate(gradation_full_metric)
end if
end subroutine perform_vertically_inhomogenous_step
subroutine write_adapt_state_debug_output(states, final_adapt_iteration, initialise_fields)
!!< Diagnostic output for mesh adaptivity
type(state_type), dimension(:), intent(in) :: states
!! Whether this is the final iteration of the adapt-re-load-balance loop
logical, intent(in) :: final_adapt_iteration
!! If present and .true., initialise fields rather than interpolate them
logical, optional, intent(in) :: initialise_fields
character(len = FIELD_NAME_LEN) :: file_name
character(len = *), parameter :: base_path = "/mesh_adaptivity/hr_adaptivity/debug"
integer :: max_output, stat
type(mesh_type), pointer :: mesh
type(vector_field) :: positions
integer, save :: cp_no = 0, mesh_dump_no = 0, state_dump_no = 0
if(.not. have_option(base_path)) then
! No debug output options
return
end if
if(have_option(base_path // "/write_adapted_mesh")) then
! Debug mesh output. These are output on every adapt iteration.
file_name = adapt_state_debug_file_name("adapted_mesh", mesh_dump_no)
call find_mesh_to_adapt(states(1), mesh)
positions = get_coordinate_field(states(1), mesh)
call write_mesh_files(file_name, positions)
if(isparallel()) then
file_name = adapt_state_debug_file_name("adapted_mesh", mesh_dump_no, add_parallel = .false.) ! parallel extension is added by write_halos
call write_halos(file_name, positions%mesh)
end if
call deallocate(positions)
mesh_dump_no = mesh_dump_no + 1
end if
if(have_option(base_path // "/write_adapted_state")) then
! Debug vtu output. These are output on every adapt iteration.
call vtk_write_state("adapted_state", index=state_dump_no, state = states, write_region_ids=.true.)
state_dump_no = state_dump_no + 1
end if
if(final_adapt_iteration .and. have_option(base_path // "/checkpoint")) then
! Debug checkpointing. These are only output on the final adapt iteration.
if(present_and_true(initialise_fields)) then
! If we're adapting with field initialisation rather than interpolation
! then we probably don't want to overwrite the field initialisation
! options by checkpointing, as any subsequent adapt with field
! initialisation will read (and consistently interpolate) the debug
! checkpoint. Applies to first timestep adapts.
ewrite(1, *) "Adapt checkpoint skipped, as adapt performed with field initialisation"
else
ewrite(1, "(a,i0)") "Performing adapt checkpoint ", cp_no
call checkpoint_simulation(states, postfix = "adapt_checkpoint", cp_no = cp_no)
cp_no = cp_no + 1
call get_option(base_path // "/checkpoint/max_checkpoint_count", max_output, stat = stat)
if(stat == SPUD_NO_ERROR) cp_no = modulo(cp_no, max_output)
end if
end if
contains
function adapt_state_debug_file_name(base_name, dump_no, add_parallel) result(file_name)
!!< Form an adapt diagnostic output filename
!! Filename base
character(len = *), intent(in) :: base_name
integer, intent(in) :: dump_no
!! If present and .false., do not convert into a parallel file_name
logical, optional, intent(in) :: add_parallel
character(len = len_trim(base_name) + 1 + int2str_len(dump_no) + 1 + parallel_filename_len("")) :: file_name
file_name = trim(base_name) // "_" // int2str(dump_no)
if(.not. present_and_false(add_parallel) .and. isparallel()) file_name = parallel_filename(file_name)
end function adapt_state_debug_file_name
end subroutine write_adapt_state_debug_output
subroutine adapt_state_module_check_options
integer :: max_output, stat
call get_option("/mesh_adaptivity/hr_adaptivity/debug/checkpoint/max_checkpoint_count", max_output, stat = stat)
if(stat == SPUD_NO_ERROR) then
if(max_output <= 0) then
FLExit("Max adaptivity debug checkpoint count must be positive")
end if
end if
end subroutine adapt_state_module_check_options
end module adapt_state_module
|