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
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228 | /** \file iMOAB.cpp
*/
#include "moab/MOABConfig.h"
#include "moab/Core.hpp"
#ifdef MOAB_HAVE_MPI
#include "moab_mpi.h"
#include "moab/ParallelComm.hpp"
#include "moab/ParCommGraph.hpp"
#include "moab/ParallelMergeMesh.hpp"
#include "moab/IntxMesh/IntxUtils.hpp"
#endif
#include "DebugOutput.hpp"
#include "moab/iMOAB.h"
/* this is needed because of direct access to hdf5/mhdf */
#ifdef MOAB_HAVE_HDF5
#include "mhdf.h"
#include <H5Tpublic.h>
#endif
#include "moab/CartVect.hpp"
#include "MBTagConventions.hpp"
#include "moab/MeshTopoUtil.hpp"
#include "moab/ReadUtilIface.hpp"
#include "moab/MergeMesh.hpp"
#ifdef MOAB_HAVE_TEMPESTREMAP
#include "STLStringHelper.h"
#include "moab/IntxMesh/IntxUtils.hpp"
#include "moab/Remapping/TempestRemapper.hpp"
#include "moab/Remapping/TempestOnlineMap.hpp"
#endif
// C++ includes
#include <cassert>
#include <sstream>
#include <iostream>
using namespace moab;
// #define VERBOSE
// global variables ; should they be organized in a structure, for easier references?
// or how do we keep them global?
#ifdef __cplusplus
extern "C" {
#endif
#ifdef MOAB_HAVE_TEMPESTREMAP
struct TempestMapAppData
{
moab::TempestRemapper* remapper;
std::map< std::string, moab::TempestOnlineMap* > weightMaps;
iMOAB_AppID pid_src;
iMOAB_AppID pid_dest;
};
#endif
struct appData
{
EntityHandle file_set;
int global_id; // external component id, unique for application
std::string name;
Range all_verts;
Range local_verts; // it could include shared, but not owned at the interface
// these vertices would be all_verts if no ghosting was required
Range ghost_vertices; // locally ghosted from other processors
Range primary_elems;
Range owned_elems;
Range ghost_elems;
int dimension; // 2 or 3, dimension of primary elements (redundant?)
long num_global_elements; // reunion of all elements in primary_elements; either from hdf5
// reading or from reduce
long num_global_vertices; // reunion of all nodes, after sharing is resolved; it could be
// determined from hdf5 reading
Range mat_sets;
std::map< int, int > matIndex; // map from global block id to index in mat_sets
Range neu_sets;
Range diri_sets;
std::map< std::string, Tag > tagMap;
std::vector< Tag > tagList;
bool point_cloud;
bool is_fortran;
#ifdef MOAB_HAVE_MPI
// constructor for this ParCommGraph takes the joint comm and the MPI groups for each
// application
std::map< int, ParCommGraph* > pgraph; // map from context () to the parcommgraph*
#endif
#ifdef MOAB_HAVE_TEMPESTREMAP
TempestMapAppData tempestData;
#endif
};
struct GlobalContext
{
// are there reasons to have multiple moab inits? Is ref count needed?
Interface* MBI;
// we should also have the default tags stored, initialized
Tag material_tag, neumann_tag, dirichlet_tag,
globalID_tag; // material, neumann, dirichlet, globalID
int refCountMB;
int iArgc;
iMOAB_String* iArgv;
int unused_pid;
std::map< std::string, int > appIdMap; // from app string (uppercase) to app id
std::map< int, int > appIdCompMap; // from component id to app id
#ifdef MOAB_HAVE_MPI
std::vector< ParallelComm* > pcomms; // created in order of applications, one moab::ParallelComm for each
#endif
std::vector< appData > appDatas; // the same order as pcomms
int globalrank, worldprocs;
bool MPI_initialized;
GlobalContext()<--- Member variable 'GlobalContext::iArgc' is not initialized in the constructor.<--- Member variable 'GlobalContext::iArgv' is not initialized in the constructor.<--- Member variable 'GlobalContext::globalrank' is not initialized in the constructor.<--- Member variable 'GlobalContext::worldprocs' is not initialized in the constructor.<--- Member variable 'GlobalContext::MPI_initialized' is not initialized in the constructor.
{
MBI = 0;
refCountMB = 0;
unused_pid = 0;
}
};
static struct GlobalContext context;
ErrCode iMOAB_Initialize( int argc, iMOAB_String* argv )
{
if( argc ) IMOAB_CHECKPOINTER( argv, 1 );
context.iArgc = argc;
context.iArgv = argv; // shallow copy
if( 0 == context.refCountMB )
{
context.MBI = new( std::nothrow ) moab::Core;
// retrieve the default tags
const char* const shared_set_tag_names[] = { MATERIAL_SET_TAG_NAME, NEUMANN_SET_TAG_NAME,
DIRICHLET_SET_TAG_NAME, GLOBAL_ID_TAG_NAME };
// blocks, visible surfaceBC(neumann), vertexBC (Dirichlet), global id, parallel partition
Tag gtags[4];
for( int i = 0; i < 4; i++ )
{
ErrorCode rval =
context.MBI->tag_get_handle( shared_set_tag_names[i], 1, MB_TYPE_INTEGER, gtags[i], MB_TAG_ANY );MB_CHK_ERR( rval );
}
context.material_tag = gtags[0];
context.neumann_tag = gtags[1];
context.dirichlet_tag = gtags[2];
context.globalID_tag = gtags[3];
}
context.MPI_initialized = false;
#ifdef MOAB_HAVE_MPI
int flagInit;
MPI_Initialized( &flagInit );
if( flagInit && !context.MPI_initialized )
{
MPI_Comm_size( MPI_COMM_WORLD, &context.worldprocs );
MPI_Comm_rank( MPI_COMM_WORLD, &context.globalrank );
context.MPI_initialized = true;
}
#endif
context.refCountMB++;
return moab::MB_SUCCESS;
}
ErrCode iMOAB_InitializeFortran()<--- The function 'iMOAB_InitializeFortran' is never used.
{
return iMOAB_Initialize( 0, 0 );
}
ErrCode iMOAB_Finalize()
{
context.refCountMB--;
if( 0 == context.refCountMB )
{
delete context.MBI;
}
return MB_SUCCESS;
}
ErrCode iMOAB_RegisterApplication( const iMOAB_String app_name,
#ifdef MOAB_HAVE_MPI
MPI_Comm* comm,
#endif
int* compid,
iMOAB_AppID pid )
{
IMOAB_CHECKPOINTER( app_name, 1 );
#ifdef MOAB_HAVE_MPI
IMOAB_CHECKPOINTER( comm, 2 );
IMOAB_CHECKPOINTER( compid, 3 );
#else
IMOAB_CHECKPOINTER( compid, 2 );
#endif
// will create a parallel comm for this application too, so there will be a
// mapping from *pid to file set and to parallel comm instances
std::string name( app_name );
if( context.appIdMap.find( name ) != context.appIdMap.end() )
{
std::cout << " application " << name << " already registered \n";
return moab::MB_FAILURE;
}
*pid = context.unused_pid++;
context.appIdMap[name] = *pid;
int rankHere = 0;
#ifdef MOAB_HAVE_MPI
MPI_Comm_rank( *comm, &rankHere );
#endif
if( !rankHere ) std::cout << " application " << name << " with ID = " << *pid << " is registered now \n";
if( *compid <= 0 )
{
std::cout << " convention for external application is to have its id positive \n";
return moab::MB_FAILURE;
}
if( context.appIdCompMap.find( *compid ) != context.appIdCompMap.end() )
{
std::cout << " external application with comp id " << *compid << " is already registered\n";
return moab::MB_FAILURE;
}
context.appIdCompMap[*compid] = *pid;
// now create ParallelComm and a file set for this application
#ifdef MOAB_HAVE_MPI
if( *comm )
{
ParallelComm* pco = new ParallelComm( context.MBI, *comm );
#ifndef NDEBUG
int index = pco->get_id(); // it could be useful to get app id from pcomm instance ...
assert( index == *pid );
// here, we assert the the pid is the same as the id of the ParallelComm instance
// useful for writing in parallel
#endif
context.pcomms.push_back( pco );
}
else
{
context.pcomms.push_back( 0 );
}
#endif
// create now the file set that will be used for loading the model in
EntityHandle file_set;
ErrorCode rval = context.MBI->create_meshset( MESHSET_SET, file_set );MB_CHK_ERR( rval );
appData app_data;
app_data.file_set = file_set;
app_data.global_id = *compid; // will be used mostly for par comm graph
app_data.name = name; // save the name of application
#ifdef MOAB_HAVE_TEMPESTREMAP
app_data.tempestData.remapper = NULL; // Only allocate as needed
#endif
app_data.point_cloud = false;
app_data.is_fortran = false;
context.appDatas.push_back(
app_data ); // it will correspond to app_FileSets[*pid] will be the file set of interest
return moab::MB_SUCCESS;
}
ErrCode iMOAB_RegisterApplicationFortran( const iMOAB_String app_name,<--- The function 'iMOAB_RegisterApplicationFortran' is never used.
#ifdef MOAB_HAVE_MPI
int* comm,
#endif
int* compid,
iMOAB_AppID pid )
{
IMOAB_CHECKPOINTER( app_name, 1 );
#ifdef MOAB_HAVE_MPI
IMOAB_CHECKPOINTER( comm, 2 );
IMOAB_CHECKPOINTER( compid, 3 );
#else
IMOAB_CHECKPOINTER( compid, 2 );
#endif
ErrCode err;
assert( app_name != nullptr );
std::string name( app_name );
#ifdef MOAB_HAVE_MPI
MPI_Comm ccomm;
if( comm )
{
// convert from Fortran communicator to a C communicator
// see transfer of handles
// http://www.mpi-forum.org/docs/mpi-2.2/mpi22-report/node361.htm
ccomm = MPI_Comm_f2c( (MPI_Fint)*comm );
}
#endif
// now call C style registration function:
err = iMOAB_RegisterApplication( app_name,
#ifdef MOAB_HAVE_MPI
&ccomm,
#endif
compid, pid );
// Now that we have created the application context, store that
// the application being registered is from a Fortran context
context.appDatas[*pid].is_fortran = true;
return err;
}
ErrCode iMOAB_DeregisterApplication( iMOAB_AppID pid )
{
// the file set , parallel comm are all in vectors indexed by *pid
// assume we did not delete anything yet
// *pid will not be reused if we register another application
appData& data = context.appDatas[*pid];
int rankHere = 0;
#ifdef MOAB_HAVE_MPI
ParallelComm* pco = context.pcomms[*pid];
rankHere = pco->rank();<--- Null pointer dereference
#endif
if( !rankHere )
std::cout << " application with ID: " << *pid << " global id: " << data.global_id << " name: " << data.name
<< " is de-registered now \n";
EntityHandle fileSet = data.file_set;
// get all entities part of the file set
Range fileents;
ErrorCode rval = context.MBI->get_entities_by_handle( fileSet, fileents, /*recursive */ true );MB_CHK_ERR( rval );
fileents.insert( fileSet );
rval = context.MBI->get_entities_by_type( fileSet, MBENTITYSET, fileents );MB_CHK_ERR( rval ); // append all mesh sets
#ifdef MOAB_HAVE_TEMPESTREMAP
if( data.tempestData.remapper ) delete data.tempestData.remapper;
if( data.tempestData.weightMaps.size() ) data.tempestData.weightMaps.clear();
#endif
#ifdef MOAB_HAVE_MPI
// we could get the pco also with
// ParallelComm * pcomm = ParallelComm::get_pcomm(context.MBI, *pid);
std::map< int, ParCommGraph* >& pargs = data.pgraph;
// free the parallel comm graphs associated with this app
for( std::map< int, ParCommGraph* >::iterator mt = pargs.begin(); mt != pargs.end(); mt++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
ParCommGraph* pgr = mt->second;
delete pgr;
pgr = NULL;
}
if( pco ) delete pco;<--- Assuming that condition 'if(pco)' is not redundant
#endif
// delete first all except vertices
Range vertices = fileents.subset_by_type( MBVERTEX );
Range noverts = subtract( fileents, vertices );
rval = context.MBI->delete_entities( noverts );MB_CHK_ERR( rval );
// now retrieve connected elements that still exist (maybe in other sets, pids?)
Range adj_ents_left;
rval = context.MBI->get_adjacencies( vertices, 1, false, adj_ents_left, Interface::UNION );MB_CHK_ERR( rval );
rval = context.MBI->get_adjacencies( vertices, 2, false, adj_ents_left, Interface::UNION );MB_CHK_ERR( rval );
rval = context.MBI->get_adjacencies( vertices, 3, false, adj_ents_left, Interface::UNION );MB_CHK_ERR( rval );
if( !adj_ents_left.empty() )
{
Range conn_verts;
rval = context.MBI->get_connectivity( adj_ents_left, conn_verts );MB_CHK_ERR( rval );
vertices = subtract( vertices, conn_verts );
}
rval = context.MBI->delete_entities( vertices );MB_CHK_ERR( rval );
std::map< std::string, int >::iterator mit;
for( mit = context.appIdMap.begin(); mit != context.appIdMap.end(); mit++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
int pidx = mit->second;
if( *pid == pidx )
{
break;
}
}
context.appIdMap.erase( mit );
std::map< int, int >::iterator mit1;
for( mit1 = context.appIdCompMap.begin(); mit1 != context.appIdCompMap.end(); mit1++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
int pidx = mit1->second;
if( *pid == pidx )
{
break;
}
}
context.appIdCompMap.erase( mit1 );
context.unused_pid--; // we have to go backwards always TODO
context.appDatas.pop_back();
#ifdef MOAB_HAVE_MPI
context.pcomms.pop_back();
#endif
return moab::MB_SUCCESS;
}
ErrCode iMOAB_DeregisterApplicationFortran( iMOAB_AppID pid )<--- The function 'iMOAB_DeregisterApplicationFortran' is never used.
{
// release any Fortran specific allocations here before we pass it on
context.appDatas[*pid].is_fortran = false;
// release all datastructure allocations
return iMOAB_DeregisterApplication( pid );
}
// Utility function
static void split_tag_names( std::string input_names,
std::string& separator,
std::vector< std::string >& list_tag_names )
{
size_t pos = 0;
std::string token;
while( ( pos = input_names.find( separator ) ) != std::string::npos )
{
token = input_names.substr( 0, pos );
if( !token.empty() ) list_tag_names.push_back( token );
// std::cout << token << std::endl;
input_names.erase( 0, pos + separator.length() );
}
if( !input_names.empty() )
{
// if leftover something, or if not ended with delimiter
list_tag_names.push_back( input_names );
}
return;
}
ErrCode iMOAB_ReadHeaderInfo( const iMOAB_String filename,
int* num_global_vertices,
int* num_global_elements,
int* num_dimension,
int* num_parts )
{
IMOAB_CHECKPOINTER( filename, 1 );
IMOAB_ASSERT( strlen( filename ), "Invalid filename length." );
#ifdef MOAB_HAVE_HDF5
std::string filen( filename );
int edges = 0;
int faces = 0;
int regions = 0;
if( num_global_vertices ) *num_global_vertices = 0;
if( num_global_elements ) *num_global_elements = 0;
if( num_dimension ) *num_dimension = 0;
if( num_parts ) *num_parts = 0;
mhdf_FileHandle file;
mhdf_Status status;
unsigned long max_id;
struct mhdf_FileDesc* data;
file = mhdf_openFile( filen.c_str(), 0, &max_id, -1, &status );
if( mhdf_isError( &status ) )
{
fprintf( stderr, "%s: %s\n", filename, mhdf_message( &status ) );
return moab::MB_FAILURE;
}
data = mhdf_getFileSummary( file, H5T_NATIVE_ULONG, &status,
1 ); // will use extra set info; will get parallel partition tag info too!
if( mhdf_isError( &status ) )
{
fprintf( stderr, "%s: %s\n", filename, mhdf_message( &status ) );
return moab::MB_FAILURE;
}
if( num_dimension ) *num_dimension = data->nodes.vals_per_ent;
if( num_global_vertices ) *num_global_vertices = (int)data->nodes.count;
for( int i = 0; i < data->num_elem_desc; i++ )
{
struct mhdf_ElemDesc* el_desc = &( data->elems[i] );
struct mhdf_EntDesc* ent_d = &( el_desc->desc );
if( 0 == strcmp( el_desc->type, mhdf_EDGE_TYPE_NAME ) )
{
edges += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_TRI_TYPE_NAME ) )
{
faces += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_QUAD_TYPE_NAME ) )
{
faces += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_POLYGON_TYPE_NAME ) )
{
faces += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_TET_TYPE_NAME ) )
{
regions += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_PYRAMID_TYPE_NAME ) )
{
regions += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_PRISM_TYPE_NAME ) )
{
regions += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mdhf_KNIFE_TYPE_NAME ) )
{
regions += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mdhf_HEX_TYPE_NAME ) )
{
regions += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_POLYHEDRON_TYPE_NAME ) )
{
regions += ent_d->count;
}
if( 0 == strcmp( el_desc->type, mhdf_SEPTAHEDRON_TYPE_NAME ) )
{
regions += ent_d->count;
}
}
if( num_parts ) *num_parts = data->numEntSets[0];
// is this required?
if( edges > 0 )
{
if( num_dimension ) *num_dimension = 1; // I don't think it will ever return 1
if( num_global_elements ) *num_global_elements = edges;
}
if( faces > 0 )
{
if( num_dimension ) *num_dimension = 2;
if( num_global_elements ) *num_global_elements = faces;
}
if( regions > 0 )
{
if( num_dimension ) *num_dimension = 3;
if( num_global_elements ) *num_global_elements = regions;
}
mhdf_closeFile( file, &status );
free( data );
#else
std::cout << filename
<< ": Please reconfigure with HDF5. Cannot retrieve header information for file "
"formats other than a h5m file.\n";
if( num_global_vertices ) *num_global_vertices = 0;
if( num_global_elements ) *num_global_elements = 0;
if( num_dimension ) *num_dimension = 0;
if( num_parts ) *num_parts = 0;
#endif
return moab::MB_SUCCESS;
}
ErrCode iMOAB_LoadMesh( iMOAB_AppID pid,
const iMOAB_String filename,
const iMOAB_String read_options,
int* num_ghost_layers )
{
IMOAB_CHECKPOINTER( filename, 2 );
IMOAB_ASSERT( strlen( filename ), "Invalid filename length." );
// make sure we use the file set and pcomm associated with the *pid
std::ostringstream newopts;
if( read_options ) newopts << read_options;
#ifdef MOAB_HAVE_MPI
if( context.MPI_initialized )
{
if( context.worldprocs > 1 )
{
std::string opts( ( read_options ? read_options : "" ) );
std::string pcid( "PARALLEL_COMM=" );
std::size_t found = opts.find( pcid );
if( found != std::string::npos )
{
std::cerr << " cannot specify PARALLEL_COMM option, it is implicit \n";
return moab::MB_FAILURE;
}
// in serial, apply PARALLEL_COMM option only for h5m files; it does not work for .g
// files (used in test_remapping)
std::string filen( filename );
std::string::size_type idx = filen.rfind( '.' );
if( idx != std::string::npos )
{
std::string extension = filen.substr( idx + 1 );
if( extension == std::string( "h5m" ) ) newopts << ";;PARALLEL_COMM=" << *pid;
}
if( *num_ghost_layers >= 1 )
{
// if we want ghosts, we will want additional entities, the last .1
// because the addl ents can be edges, faces that are part of the neumann sets
std::string pcid2( "PARALLEL_GHOSTS=" );
std::size_t found2 = opts.find( pcid2 );
if( found2 != std::string::npos )
{
std::cout << " PARALLEL_GHOSTS option is already specified, ignore passed "
"number of layers \n";
}
else
{
// dimension of primary entities is 3 here, but it could be 2 for climate
// meshes; we would need to pass PARALLEL_GHOSTS explicitly for 2d meshes, for
// example: ";PARALLEL_GHOSTS=2.0.1"
newopts << ";PARALLEL_GHOSTS=3.0." << *num_ghost_layers << ".3";
}
}
}
}
#else
IMOAB_ASSERT( *num_ghost_layers == 0, "Cannot provide ghost layers in serial." );
#endif
// Now let us actually load the MOAB file with the appropriate read options
ErrorCode rval = context.MBI->load_file( filename, &context.appDatas[*pid].file_set, newopts.str().c_str() );MB_CHK_ERR( rval );
#ifdef VERBOSE
// some debugging stuff
std::ostringstream outfile;
#ifdef MOAB_HAVE_MPI
int rank = context.pcomms[*pid]->rank();
int nprocs = context.pcomms[*pid]->size();
outfile << "TaskMesh_n" << nprocs << "." << rank << ".h5m";
#else
outfile << "TaskMesh_n1.0.h5m";
#endif
// the mesh contains ghosts too, but they are not part of mat/neumann set
// write in serial the file, to see what tags are missing
rval = context.MBI->write_file( outfile.str().c_str() );MB_CHK_ERR( rval ); // everything on current task, written in serial
#endif
// Update mesh information
return iMOAB_UpdateMeshInfo( pid );
}
ErrCode iMOAB_WriteMesh( iMOAB_AppID pid, const iMOAB_String filename, const iMOAB_String write_options )
{
IMOAB_CHECKPOINTER( filename, 2 );
IMOAB_ASSERT( strlen( filename ), "Invalid filename length." );
appData& data = context.appDatas[*pid];
EntityHandle fileSet = data.file_set;
std::ostringstream newopts;
#ifdef MOAB_HAVE_MPI
std::string write_opts( ( write_options ? write_options : "" ) );
std::string pcid( "PARALLEL_COMM=" );
std::size_t found = write_opts.find( pcid );
if( found != std::string::npos )
{
std::cerr << " cannot specify PARALLEL_COMM option, it is implicit \n";
return moab::MB_FAILURE;
}
// if write in parallel, add pc option, to be sure about which ParallelComm instance is used
std::string pw( "PARALLEL=WRITE_PART" );
found = write_opts.find( pw );
if( found != std::string::npos )
{
newopts << "PARALLEL_COMM=" << *pid << ";";
}
#endif
if( write_options ) newopts << write_options;
std::vector< Tag > copyTagList = data.tagList;
// append Global ID and Parallel Partition
std::string gid_name_tag( "GLOBAL_ID" );
// export global id tag, we need it always
if( data.tagMap.find( gid_name_tag ) == data.tagMap.end() )
{
Tag gid = context.MBI->globalId_tag();
copyTagList.push_back( gid );
}
// also Parallel_Partition PARALLEL_PARTITION
std::string pp_name_tag( "PARALLEL_PARTITION" );
// write parallel part tag too, if it exists
if( data.tagMap.find( pp_name_tag ) == data.tagMap.end() )
{
Tag ptag;
context.MBI->tag_get_handle( pp_name_tag.c_str(), ptag );
if( ptag ) copyTagList.push_back( ptag );
}
// Now let us actually write the file to disk with appropriate options
ErrorCode rval = context.MBI->write_file( filename, 0, newopts.str().c_str(), &fileSet, 1, ©TagList[0],
(int)copyTagList.size() );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_WriteLocalMesh( iMOAB_AppID pid, iMOAB_String prefix )<--- The function 'iMOAB_WriteLocalMesh' is never used.
{
IMOAB_CHECKPOINTER( prefix, 2 );
IMOAB_ASSERT( strlen( prefix ), "Invalid prefix string length." );
std::ostringstream file_name;
int rank = 0, size = 1;
#ifdef MOAB_HAVE_MPI
rank = context.pcomms[*pid]->rank();
size = context.pcomms[*pid]->size();
#endif
file_name << prefix << "_" << size << "_" << rank << ".h5m";
// Now let us actually write the file to disk with appropriate options
ErrorCode rval = context.MBI->write_file( file_name.str().c_str(), 0, 0, &context.appDatas[*pid].file_set, 1 );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_UpdateMeshInfo( iMOAB_AppID pid )
{
// this will include ghost elements info
appData& data = context.appDatas[*pid];
EntityHandle fileSet = data.file_set;
// first clear all data ranges; this can be called after ghosting
data.all_verts.clear();
data.primary_elems.clear();
data.local_verts.clear();
data.ghost_vertices.clear();
data.owned_elems.clear();
data.ghost_elems.clear();
data.mat_sets.clear();
data.neu_sets.clear();
data.diri_sets.clear();
// Let us get all the vertex entities
ErrorCode rval = context.MBI->get_entities_by_type( fileSet, MBVERTEX, data.all_verts, true );MB_CHK_ERR( rval ); // recursive
// Let us check first entities of dimension = 3
data.dimension = 3;
rval = context.MBI->get_entities_by_dimension( fileSet, data.dimension, data.primary_elems, true );MB_CHK_ERR( rval ); // recursive
if( data.primary_elems.empty() )
{
// Now 3-D elements. Let us check entities of dimension = 2
data.dimension = 2;
rval = context.MBI->get_entities_by_dimension( fileSet, data.dimension, data.primary_elems, true );MB_CHK_ERR( rval ); // recursive
if( data.primary_elems.empty() )
{
// Now 3-D/2-D elements. Let us check entities of dimension = 1
data.dimension = 1;
rval = context.MBI->get_entities_by_dimension( fileSet, data.dimension, data.primary_elems, true );MB_CHK_ERR( rval ); // recursive
if( data.primary_elems.empty() )
{
// no elements of dimension 1 or 2 or 3; it could happen for point clouds
data.dimension = 0;
}
}
}
// check if the current mesh is just a point cloud
data.point_cloud = ( ( data.primary_elems.size() == 0 && data.all_verts.size() > 0 ) || data.dimension == 0 );
#ifdef MOAB_HAVE_MPI
if( context.MPI_initialized )
{
ParallelComm* pco = context.pcomms[*pid];
// filter ghost vertices, from local
rval = pco->filter_pstatus( data.all_verts, PSTATUS_GHOST, PSTATUS_NOT, -1, &data.local_verts );MB_CHK_ERR( rval );
// Store handles for all ghosted entities
data.ghost_vertices = subtract( data.all_verts, data.local_verts );
// filter ghost elements, from local
rval = pco->filter_pstatus( data.primary_elems, PSTATUS_GHOST, PSTATUS_NOT, -1, &data.owned_elems );MB_CHK_ERR( rval );
data.ghost_elems = subtract( data.primary_elems, data.owned_elems );
}
else
{
data.local_verts = data.all_verts;
data.owned_elems = data.primary_elems;
}
#else
data.local_verts = data.all_verts;
data.owned_elems = data.primary_elems;
#endif
// Get the references for some standard internal tags such as material blocks, BCs, etc
rval = context.MBI->get_entities_by_type_and_tag( fileSet, MBENTITYSET, &( context.material_tag ), 0, 1,
data.mat_sets, Interface::UNION );MB_CHK_ERR( rval );
rval = context.MBI->get_entities_by_type_and_tag( fileSet, MBENTITYSET, &( context.neumann_tag ), 0, 1,
data.neu_sets, Interface::UNION );MB_CHK_ERR( rval );
rval = context.MBI->get_entities_by_type_and_tag( fileSet, MBENTITYSET, &( context.dirichlet_tag ), 0, 1,
data.diri_sets, Interface::UNION );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetMeshInfo( iMOAB_AppID pid,
int* num_visible_vertices,
int* num_visible_elements,
int* num_visible_blocks,
int* num_visible_surfaceBC,
int* num_visible_vertexBC )
{
ErrorCode rval;
appData& data = context.appDatas[*pid];
EntityHandle fileSet = data.file_set;
// this will include ghost elements
// first clear all data ranges; this can be called after ghosting
if( num_visible_elements )
{
num_visible_elements[2] = static_cast< int >( data.primary_elems.size() );
// separate ghost and local/owned primary elements
num_visible_elements[0] = static_cast< int >( data.owned_elems.size() );
num_visible_elements[1] = static_cast< int >( data.ghost_elems.size() );
}
if( num_visible_vertices )
{
num_visible_vertices[2] = static_cast< int >( data.all_verts.size() );
num_visible_vertices[1] = static_cast< int >( data.ghost_vertices.size() );
// local are those that are not ghosts
num_visible_vertices[0] = num_visible_vertices[2] - num_visible_vertices[1];
}
if( num_visible_blocks )
{
rval = context.MBI->get_entities_by_type_and_tag( fileSet, MBENTITYSET, &( context.material_tag ), 0, 1,
data.mat_sets, Interface::UNION );MB_CHK_ERR( rval );
num_visible_blocks[2] = data.mat_sets.size();
num_visible_blocks[0] = num_visible_blocks[2];
num_visible_blocks[1] = 0;
}
if( num_visible_surfaceBC )
{
rval = context.MBI->get_entities_by_type_and_tag( fileSet, MBENTITYSET, &( context.neumann_tag ), 0, 1,
data.neu_sets, Interface::UNION );MB_CHK_ERR( rval );
num_visible_surfaceBC[2] = 0;
// count how many faces are in each neu set, and how many regions are
// adjacent to them;
int numNeuSets = (int)data.neu_sets.size();
for( int i = 0; i < numNeuSets; i++ )
{
Range subents;
EntityHandle nset = data.neu_sets[i];
rval = context.MBI->get_entities_by_dimension( nset, data.dimension - 1, subents );MB_CHK_ERR( rval );
for( Range::iterator it = subents.begin(); it != subents.end(); ++it )
{
EntityHandle subent = *it;
Range adjPrimaryEnts;
rval = context.MBI->get_adjacencies( &subent, 1, data.dimension, false, adjPrimaryEnts );MB_CHK_ERR( rval );
num_visible_surfaceBC[2] += (int)adjPrimaryEnts.size();
}
}
num_visible_surfaceBC[0] = num_visible_surfaceBC[2];
num_visible_surfaceBC[1] = 0;
}
if( num_visible_vertexBC )
{
rval = context.MBI->get_entities_by_type_and_tag( fileSet, MBENTITYSET, &( context.dirichlet_tag ), 0, 1,
data.diri_sets, Interface::UNION );MB_CHK_ERR( rval );
num_visible_vertexBC[2] = 0;
int numDiriSets = (int)data.diri_sets.size();
for( int i = 0; i < numDiriSets; i++ )
{
Range verts;
EntityHandle diset = data.diri_sets[i];
rval = context.MBI->get_entities_by_dimension( diset, 0, verts );MB_CHK_ERR( rval );
num_visible_vertexBC[2] += (int)verts.size();
}
num_visible_vertexBC[0] = num_visible_vertexBC[2];
num_visible_vertexBC[1] = 0;
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetVertexID( iMOAB_AppID pid, int* vertices_length, iMOAB_GlobalID* global_vertex_ID )
{
IMOAB_CHECKPOINTER( vertices_length, 2 );
IMOAB_CHECKPOINTER( global_vertex_ID, 3 );
const Range& verts = context.appDatas[*pid].all_verts;
// check for problems with array length
IMOAB_ASSERT( *vertices_length == static_cast< int >( verts.size() ), "Invalid vertices length provided" );
// global id tag is context.globalID_tag
return context.MBI->tag_get_data( context.globalID_tag, verts, global_vertex_ID );
}
ErrCode iMOAB_GetVertexOwnership( iMOAB_AppID pid, int* vertices_length, int* visible_global_rank_ID )
{
assert( vertices_length && *vertices_length );
assert( visible_global_rank_ID );
Range& verts = context.appDatas[*pid].all_verts;
int i = 0;
#ifdef MOAB_HAVE_MPI
ParallelComm* pco = context.pcomms[*pid];
for( Range::iterator vit = verts.begin(); vit != verts.end(); vit++, i++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
ErrorCode rval = pco->get_owner( *vit, visible_global_rank_ID[i] );MB_CHK_ERR( rval );
}
if( i != *vertices_length )
{
return moab::MB_FAILURE;
} // warning array allocation problem
#else
/* everything owned by proc 0 */
if( (int)verts.size() != *vertices_length )
{
return moab::MB_FAILURE;
} // warning array allocation problem
for( Range::iterator vit = verts.begin(); vit != verts.end(); vit++, i++ )
{
visible_global_rank_ID[i] = 0;
} // all vertices are owned by processor 0, as this is serial run
#endif
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetVisibleVerticesCoordinates( iMOAB_AppID pid, int* coords_length, double* coordinates )
{
Range& verts = context.appDatas[*pid].all_verts;
// interleaved coordinates, so that means deep copy anyway
if( *coords_length != 3 * (int)verts.size() )
{
return moab::MB_FAILURE;
}
ErrorCode rval = context.MBI->get_coords( verts, coordinates );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetBlockID( iMOAB_AppID pid, int* block_length, iMOAB_GlobalID* global_block_IDs )
{
// local id blocks? they are counted from 0 to number of visible blocks ...
// will actually return material set tag value for global
Range& matSets = context.appDatas[*pid].mat_sets;
if( *block_length != (int)matSets.size() )
{
return moab::MB_FAILURE;
}
// return material set tag gtags[0 is material set tag
ErrorCode rval = context.MBI->tag_get_data( context.material_tag, matSets, global_block_IDs );MB_CHK_ERR( rval );
// populate map with index
std::map< int, int >& matIdx = context.appDatas[*pid].matIndex;
for( unsigned i = 0; i < matSets.size(); i++ )
{
matIdx[global_block_IDs[i]] = i;
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetBlockInfo( iMOAB_AppID pid,
iMOAB_GlobalID* global_block_ID,
int* vertices_per_element,
int* num_elements_in_block )
{
assert( global_block_ID );
std::map< int, int >& matMap = context.appDatas[*pid].matIndex;
std::map< int, int >::iterator it = matMap.find( *global_block_ID );
if( it == matMap.end() )
{
return moab::MB_FAILURE;
} // error in finding block with id
int blockIndex = matMap[*global_block_ID];
EntityHandle matMeshSet = context.appDatas[*pid].mat_sets[blockIndex];
Range blo_elems;
ErrorCode rval = context.MBI->get_entities_by_handle( matMeshSet, blo_elems );
if( MB_SUCCESS != rval || blo_elems.empty() )
{
return moab::MB_FAILURE;
}
EntityType type = context.MBI->type_from_handle( blo_elems[0] );
if( !blo_elems.all_of_type( type ) )
{
return moab::MB_FAILURE;
} // not all of same type
const EntityHandle* conn = NULL;
int num_verts = 0;
rval = context.MBI->get_connectivity( blo_elems[0], conn, num_verts );MB_CHK_ERR( rval );
*vertices_per_element = num_verts;
*num_elements_in_block = (int)blo_elems.size();
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetVisibleElementsInfo( iMOAB_AppID pid,
int* num_visible_elements,
iMOAB_GlobalID* element_global_IDs,
int* ranks,
iMOAB_GlobalID* block_IDs )
{
appData& data = context.appDatas[*pid];
#ifdef MOAB_HAVE_MPI
ParallelComm* pco = context.pcomms[*pid];
#endif
ErrorCode rval = context.MBI->tag_get_data( context.globalID_tag, data.primary_elems, element_global_IDs );MB_CHK_ERR( rval );
int i = 0;
for( Range::iterator eit = data.primary_elems.begin(); eit != data.primary_elems.end(); ++eit, ++i )
{
#ifdef MOAB_HAVE_MPI
rval = pco->get_owner( *eit, ranks[i] );MB_CHK_ERR( rval );
#else
/* everything owned by task 0 */
ranks[i] = 0;
#endif
}
for( Range::iterator mit = data.mat_sets.begin(); mit != data.mat_sets.end(); ++mit )
{
EntityHandle matMeshSet = *mit;
Range elems;
rval = context.MBI->get_entities_by_handle( matMeshSet, elems );MB_CHK_ERR( rval );
int valMatTag;
rval = context.MBI->tag_get_data( context.material_tag, &matMeshSet, 1, &valMatTag );MB_CHK_ERR( rval );
for( Range::iterator eit = elems.begin(); eit != elems.end(); ++eit )
{
EntityHandle eh = *eit;
int index = data.primary_elems.index( eh );
if( -1 == index )
{
return moab::MB_FAILURE;
}
if( -1 >= *num_visible_elements )
{
return moab::MB_FAILURE;
}
block_IDs[index] = valMatTag;
}
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetBlockElementConnectivities( iMOAB_AppID pid,
iMOAB_GlobalID* global_block_ID,
int* connectivity_length,
int* element_connectivity )
{
assert( global_block_ID ); // ensure global block ID argument is not null
assert( connectivity_length ); // ensure connectivity length argument is not null
appData& data = context.appDatas[*pid];
std::map< int, int >& matMap = data.matIndex;
std::map< int, int >::iterator it = matMap.find( *global_block_ID );
if( it == matMap.end() )
{
return moab::MB_FAILURE;
} // error in finding block with id
int blockIndex = matMap[*global_block_ID];
EntityHandle matMeshSet = data.mat_sets[blockIndex];
std::vector< EntityHandle > elems;
ErrorCode rval = context.MBI->get_entities_by_handle( matMeshSet, elems );MB_CHK_ERR( rval );
if( elems.empty() )
{
return moab::MB_FAILURE;
}
std::vector< EntityHandle > vconnect;
rval = context.MBI->get_connectivity( &elems[0], elems.size(), vconnect );MB_CHK_ERR( rval );
if( *connectivity_length != (int)vconnect.size() )
{
return moab::MB_FAILURE;
} // mismatched sizes
for( int i = 0; i < *connectivity_length; i++ )
{
int inx = data.all_verts.index( vconnect[i] );
if( -1 == inx )
{
return moab::MB_FAILURE;
} // error, vertex not in local range
element_connectivity[i] = inx;
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetElementConnectivity( iMOAB_AppID pid,
iMOAB_LocalID* elem_index,
int* connectivity_length,
int* element_connectivity )
{
assert( elem_index ); // ensure element index argument is not null
assert( connectivity_length ); // ensure connectivity length argument is not null
appData& data = context.appDatas[*pid];
assert( ( *elem_index >= 0 ) && ( *elem_index < (int)data.primary_elems.size() ) );
int num_nodes;
const EntityHandle* conn;
EntityHandle eh = data.primary_elems[*elem_index];
ErrorCode rval = context.MBI->get_connectivity( eh, conn, num_nodes );MB_CHK_ERR( rval );
if( *connectivity_length < num_nodes )
{
return moab::MB_FAILURE;
} // wrong number of vertices
for( int i = 0; i < num_nodes; i++ )
{
int index = data.all_verts.index( conn[i] );
if( -1 == index )
{
return moab::MB_FAILURE;
}
element_connectivity[i] = index;
}
*connectivity_length = num_nodes;
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetElementOwnership( iMOAB_AppID pid,
iMOAB_GlobalID* global_block_ID,
int* num_elements_in_block,
int* element_ownership )
{
assert( global_block_ID ); // ensure global block ID argument is not null
assert( num_elements_in_block ); // ensure number of elements in block argument is not null
std::map< int, int >& matMap = context.appDatas[*pid].matIndex;
std::map< int, int >::iterator it = matMap.find( *global_block_ID );
if( it == matMap.end() )
{
return moab::MB_FAILURE;
} // error in finding block with id
int blockIndex = matMap[*global_block_ID];
EntityHandle matMeshSet = context.appDatas[*pid].mat_sets[blockIndex];
Range elems;
ErrorCode rval = context.MBI->get_entities_by_handle( matMeshSet, elems );MB_CHK_ERR( rval );
if( elems.empty() )
{
return moab::MB_FAILURE;
}
if( *num_elements_in_block != (int)elems.size() )
{
return moab::MB_FAILURE;
} // bad memory allocation
int i = 0;
#ifdef MOAB_HAVE_MPI
ParallelComm* pco = context.pcomms[*pid];
#endif
for( Range::iterator vit = elems.begin(); vit != elems.end(); vit++, i++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
#ifdef MOAB_HAVE_MPI
rval = pco->get_owner( *vit, element_ownership[i] );MB_CHK_ERR( rval );
#else
element_ownership[i] = 0; /* owned by 0 */
#endif
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetElementID( iMOAB_AppID pid,
iMOAB_GlobalID* global_block_ID,
int* num_elements_in_block,
iMOAB_GlobalID* global_element_ID,
iMOAB_LocalID* local_element_ID )
{
assert( global_block_ID ); // ensure global block ID argument is not null
assert( num_elements_in_block ); // ensure number of elements in block argument is not null
appData& data = context.appDatas[*pid];
std::map< int, int >& matMap = data.matIndex;
std::map< int, int >::iterator it = matMap.find( *global_block_ID );
if( it == matMap.end() )
{
return moab::MB_FAILURE;
} // error in finding block with id
int blockIndex = matMap[*global_block_ID];
EntityHandle matMeshSet = data.mat_sets[blockIndex];
Range elems;
ErrorCode rval = context.MBI->get_entities_by_handle( matMeshSet, elems );MB_CHK_ERR( rval );
if( elems.empty() )
{
return moab::MB_FAILURE;
}
if( *num_elements_in_block != (int)elems.size() )
{
return moab::MB_FAILURE;
} // bad memory allocation
rval = context.MBI->tag_get_data( context.globalID_tag, elems, global_element_ID );MB_CHK_ERR( rval );
// check that elems are among primary_elems in data
for( int i = 0; i < *num_elements_in_block; i++ )
{
local_element_ID[i] = data.primary_elems.index( elems[i] );
if( -1 == local_element_ID[i] )
{
return moab::MB_FAILURE;
} // error, not in local primary elements
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetPointerToSurfaceBC( iMOAB_AppID pid,
int* surface_BC_length,
iMOAB_LocalID* local_element_ID,
int* reference_surface_ID,
int* boundary_condition_value )
{
// we have to fill bc data for neumann sets;/
ErrorCode rval;
// it was counted above, in GetMeshInfo
appData& data = context.appDatas[*pid];
int numNeuSets = (int)data.neu_sets.size();
int index = 0; // index [0, surface_BC_length) for the arrays returned
for( int i = 0; i < numNeuSets; i++ )
{
Range subents;
EntityHandle nset = data.neu_sets[i];
rval = context.MBI->get_entities_by_dimension( nset, data.dimension - 1, subents );MB_CHK_ERR( rval );
int neuVal;
rval = context.MBI->tag_get_data( context.neumann_tag, &nset, 1, &neuVal );MB_CHK_ERR( rval );
for( Range::iterator it = subents.begin(); it != subents.end(); ++it )
{
EntityHandle subent = *it;
Range adjPrimaryEnts;
rval = context.MBI->get_adjacencies( &subent, 1, data.dimension, false, adjPrimaryEnts );MB_CHK_ERR( rval );
// get global id of the primary ents, and side number of the quad/subentity
// this is moab ordering
for( Range::iterator pit = adjPrimaryEnts.begin(); pit != adjPrimaryEnts.end(); pit++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
EntityHandle primaryEnt = *pit;
// get global id
/*int globalID;
rval = context.MBI->tag_get_data(gtags[3], &primaryEnt, 1, &globalID);
if (MB_SUCCESS!=rval)
return moab::MB_FAILURE;
global_element_ID[index] = globalID;*/
// get local element id
local_element_ID[index] = data.primary_elems.index( primaryEnt );
if( -1 == local_element_ID[index] )
{
return moab::MB_FAILURE;
} // did not find the element locally
int side_number, sense, offset;
rval = context.MBI->side_number( primaryEnt, subent, side_number, sense, offset );MB_CHK_ERR( rval );
reference_surface_ID[index] = side_number + 1; // moab is from 0 to 5, it needs 1 to 6
boundary_condition_value[index] = neuVal;
index++;
}
}
}
if( index != *surface_BC_length )
{
return moab::MB_FAILURE;
} // error in array allocations
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetPointerToVertexBC( iMOAB_AppID pid,
int* vertex_BC_length,
iMOAB_LocalID* local_vertex_ID,
int* boundary_condition_value )
{
ErrorCode rval;
// it was counted above, in GetMeshInfo
appData& data = context.appDatas[*pid];
int numDiriSets = (int)data.diri_sets.size();
int index = 0; // index [0, *vertex_BC_length) for the arrays returned
for( int i = 0; i < numDiriSets; i++ )
{
Range verts;
EntityHandle diset = data.diri_sets[i];
rval = context.MBI->get_entities_by_dimension( diset, 0, verts );MB_CHK_ERR( rval );
int diriVal;
rval = context.MBI->tag_get_data( context.dirichlet_tag, &diset, 1, &diriVal );MB_CHK_ERR( rval );
for( Range::iterator vit = verts.begin(); vit != verts.end(); ++vit )
{
EntityHandle vt = *vit;
/*int vgid;
rval = context.MBI->tag_get_data(gtags[3], &vt, 1, &vgid);
if (MB_SUCCESS!=rval)
return moab::MB_FAILURE;
global_vertext_ID[index] = vgid;*/
local_vertex_ID[index] = data.all_verts.index( vt );
if( -1 == local_vertex_ID[index] )
{
return moab::MB_FAILURE;
} // vertex was not found
boundary_condition_value[index] = diriVal;
index++;
}
}
if( *vertex_BC_length != index )
{
return moab::MB_FAILURE;
} // array allocation issue
return moab::MB_SUCCESS;
}
ErrCode iMOAB_DefineTagStorage( iMOAB_AppID pid,
const iMOAB_String tag_storage_name,
int* tag_type,
int* components_per_entity,
int* tag_index )
{
// see if the tag is already existing, and if yes, check the type, length
if( *tag_type < 0 || *tag_type > 5 )
{
return moab::MB_FAILURE;
} // we have 6 types of tags supported so far
DataType tagDataType;
TagType tagType;
void* defaultVal = NULL;
int* defInt = new int[*components_per_entity];
double* defDouble = new double[*components_per_entity];
EntityHandle* defHandle = new EntityHandle[*components_per_entity];
for( int i = 0; i < *components_per_entity; i++ )
{
defInt[i] = 0;
defDouble[i] = -1e+10;
defHandle[i] = (EntityHandle)0;
}
switch( *tag_type )
{
case 0:
tagDataType = MB_TYPE_INTEGER;
tagType = MB_TAG_DENSE;
defaultVal = defInt;
break;
case 1:
tagDataType = MB_TYPE_DOUBLE;
tagType = MB_TAG_DENSE;
defaultVal = defDouble;
break;
case 2:
tagDataType = MB_TYPE_HANDLE;
tagType = MB_TAG_DENSE;
defaultVal = defHandle;
break;
case 3:
tagDataType = MB_TYPE_INTEGER;
tagType = MB_TAG_SPARSE;
defaultVal = defInt;
break;
case 4:
tagDataType = MB_TYPE_DOUBLE;
tagType = MB_TAG_SPARSE;
defaultVal = defDouble;
break;
case 5:
tagDataType = MB_TYPE_HANDLE;
tagType = MB_TAG_SPARSE;
defaultVal = defHandle;
break;
default: {
delete[] defInt;
delete[] defDouble;
delete[] defHandle;
return moab::MB_FAILURE;
} // error
}
Tag tagHandle;
// split storage names if separated list
std::string tag_name( tag_storage_name );
// first separate the names of the tags
// we assume that there are separators ":" between the tag names
std::vector< std::string > tagNames;
std::string separator( ":" );
split_tag_names( tag_name, separator, tagNames );
ErrorCode rval = moab::MB_SUCCESS; // assume success already :)
appData& data = context.appDatas[*pid];
for( size_t i = 0; i < tagNames.size(); i++ )
{
rval = context.MBI->tag_get_handle( tagNames[i].c_str(), *components_per_entity, tagDataType, tagHandle,
tagType, defaultVal );
if( MB_TAG_NOT_FOUND == rval )
{
rval = context.MBI->tag_get_handle( tagNames[i].c_str(), *components_per_entity, tagDataType, tagHandle,
tagType | MB_TAG_CREAT, defaultVal );
}
if( MB_ALREADY_ALLOCATED == rval )
{
std::map< std::string, Tag >& mTags = data.tagMap;
std::map< std::string, Tag >::iterator mit = mTags.find( tag_name );
if( mit == mTags.end() )
{
// add it to the map
mTags[tagNames[i]] = tagHandle;
// push it to the list of tags, too
*tag_index = (int)data.tagList.size();
data.tagList.push_back( tagHandle );
}
rval = MB_SUCCESS;
}
else if( MB_SUCCESS == rval )
{
data.tagMap[tagNames[i]] = tagHandle;
*tag_index = (int)data.tagList.size();
data.tagList.push_back( tagHandle );
}
else
{
rval = moab::MB_FAILURE; // some tags were not created
}
}
// we don't need default values anymore, avoid leaks
delete[] defInt;
delete[] defDouble;
delete[] defHandle;
return rval;
}
ErrCode iMOAB_SetIntTagStorage( iMOAB_AppID pid,
const iMOAB_String tag_storage_name,
int* num_tag_storage_length,
int* ent_type,
int* tag_storage_data )
{
std::string tag_name( tag_storage_name );
// Get the application data
appData& data = context.appDatas[*pid];
if( data.tagMap.find( tag_name ) == data.tagMap.end() )
{
return moab::MB_FAILURE;
} // tag not defined
Tag tag = data.tagMap[tag_name];
int tagLength = 0;
ErrorCode rval = context.MBI->tag_get_length( tag, tagLength );MB_CHK_ERR( rval );
DataType dtype;
rval = context.MBI->tag_get_data_type( tag, dtype );
if( MB_SUCCESS != rval || dtype != MB_TYPE_INTEGER )
{
return moab::MB_FAILURE;
}
// set it on a subset of entities, based on type and length
Range* ents_to_set;
if( *ent_type == 0 ) // vertices
{
ents_to_set = &data.all_verts;
}
else // if (*ent_type == 1) // *ent_type can be 0 (vertices) or 1 (elements)
{
ents_to_set = &data.primary_elems;
}
int nents_to_be_set = *num_tag_storage_length / tagLength;
if( nents_to_be_set > (int)ents_to_set->size() || nents_to_be_set < 1 )
{
return moab::MB_FAILURE;
} // to many entities to be set or too few
// restrict the range; everything is contiguous; or not?
// Range contig_range ( * ( ents_to_set->begin() ), * ( ents_to_set->begin() + nents_to_be_set -
// 1 ) );
rval = context.MBI->tag_set_data( tag, *ents_to_set, tag_storage_data );MB_CHK_ERR( rval );
return moab::MB_SUCCESS; // no error
}
ErrCode iMOAB_GetIntTagStorage( iMOAB_AppID pid,
const iMOAB_String tag_storage_name,
int* num_tag_storage_length,
int* ent_type,
int* tag_storage_data )
{
ErrorCode rval;
std::string tag_name( tag_storage_name );
appData& data = context.appDatas[*pid];
if( data.tagMap.find( tag_name ) == data.tagMap.end() )
{
return moab::MB_FAILURE;
} // tag not defined
Tag tag = data.tagMap[tag_name];
int tagLength = 0;
rval = context.MBI->tag_get_length( tag, tagLength );MB_CHK_ERR( rval );
DataType dtype;
rval = context.MBI->tag_get_data_type( tag, dtype );MB_CHK_ERR( rval );
if( dtype != MB_TYPE_INTEGER )
{
return moab::MB_FAILURE;
}
// set it on a subset of entities, based on type and length
Range* ents_to_get;
if( *ent_type == 0 ) // vertices
{
ents_to_get = &data.all_verts;
}
else // if (*ent_type == 1)
{
ents_to_get = &data.primary_elems;
}
int nents_to_get = *num_tag_storage_length / tagLength;
if( nents_to_get > (int)ents_to_get->size() || nents_to_get < 1 )
{
return moab::MB_FAILURE;
} // to many entities to get, or too little
// restrict the range; everything is contiguous; or not?
// Range contig_range ( * ( ents_to_get->begin() ), * ( ents_to_get->begin() + nents_to_get - 1
// ) );
rval = context.MBI->tag_get_data( tag, *ents_to_get, tag_storage_data );MB_CHK_ERR( rval );
return moab::MB_SUCCESS; // no error
}
ErrCode iMOAB_SetDoubleTagStorage( iMOAB_AppID pid,
const iMOAB_String tag_storage_names,
int* num_tag_storage_length,
int* ent_type,
double* tag_storage_data )
{
ErrorCode rval;
std::string tag_names( tag_storage_names );
// exactly the same code as for int tag :) maybe should check the type of tag too
std::vector< std::string > tagNames;
std::vector< Tag > tagHandles;<--- Unused variable: tagHandles
std::string separator( ":" );
split_tag_names( tag_names, separator, tagNames );
appData& data = context.appDatas[*pid];
Range* ents_to_set = NULL;
if( *ent_type == 0 ) // vertices
{
ents_to_set = &data.all_verts;
}
else if( *ent_type == 1 )
{
ents_to_set = &data.primary_elems;
}
int nents_to_be_set = (int)( *ents_to_set ).size();
int position = 0;
for( size_t i = 0; i < tagNames.size(); i++ )
{
if( data.tagMap.find( tagNames[i] ) == data.tagMap.end() )
{
return moab::MB_FAILURE;
} // some tag not defined yet in the app
Tag tag = data.tagMap[tagNames[i]];
int tagLength = 0;
rval = context.MBI->tag_get_length( tag, tagLength );MB_CHK_ERR( rval );
DataType dtype;
rval = context.MBI->tag_get_data_type( tag, dtype );MB_CHK_ERR( rval );
if( dtype != MB_TYPE_DOUBLE )
{
return moab::MB_FAILURE;
}
// set it on the subset of entities, based on type and length
if( position + tagLength * nents_to_be_set > *num_tag_storage_length )
return moab::MB_FAILURE; // too many entity values to be set
rval = context.MBI->tag_set_data( tag, *ents_to_set, &tag_storage_data[position] );MB_CHK_ERR( rval );
// increment position to next tag
position = position + tagLength * nents_to_be_set;
}
return moab::MB_SUCCESS; // no error
}
ErrCode iMOAB_GetDoubleTagStorage( iMOAB_AppID pid,
const iMOAB_String tag_storage_names,
int* num_tag_storage_length,
int* ent_type,
double* tag_storage_data )
{
ErrorCode rval;
// exactly the same code, except tag type check
std::string tag_names( tag_storage_names );
// exactly the same code as for int tag :) maybe should check the type of tag too
std::vector< std::string > tagNames;
std::vector< Tag > tagHandles;<--- Unused variable: tagHandles
std::string separator( ":" );
split_tag_names( tag_names, separator, tagNames );
appData& data = context.appDatas[*pid];
// set it on a subset of entities, based on type and length
Range* ents_to_get = NULL;
if( *ent_type == 0 ) // vertices
{
ents_to_get = &data.all_verts;
}
else if( *ent_type == 1 )
{
ents_to_get = &data.primary_elems;
}
int nents_to_get = (int)ents_to_get->size();
int position = 0;
for( size_t i = 0; i < tagNames.size(); i++ )
{
if( data.tagMap.find( tagNames[i] ) == data.tagMap.end() )
{
return moab::MB_FAILURE;
} // tag not defined
Tag tag = data.tagMap[tagNames[i]];
int tagLength = 0;
rval = context.MBI->tag_get_length( tag, tagLength );MB_CHK_ERR( rval );
DataType dtype;
rval = context.MBI->tag_get_data_type( tag, dtype );MB_CHK_ERR( rval );
if( dtype != MB_TYPE_DOUBLE )
{
return moab::MB_FAILURE;
}
if( position + nents_to_get * tagLength > *num_tag_storage_length )
return moab::MB_FAILURE; // too many entity values to get
rval = context.MBI->tag_get_data( tag, *ents_to_get, &tag_storage_data[position] );MB_CHK_ERR( rval );
position = position + nents_to_get * tagLength;
}
return moab::MB_SUCCESS; // no error
}
ErrCode iMOAB_SynchronizeTags( iMOAB_AppID pid, int* num_tag, int* tag_indices, int* ent_type )
{
#ifdef MOAB_HAVE_MPI
appData& data = context.appDatas[*pid];
Range ent_exchange;
std::vector< Tag > tags;
for( int i = 0; i < *num_tag; i++ )
{
if( tag_indices[i] < 0 || tag_indices[i] >= (int)data.tagList.size() )
{
return moab::MB_FAILURE;
} // error in tag index
tags.push_back( data.tagList[tag_indices[i]] );
}
if( *ent_type == 0 )
{
ent_exchange = data.all_verts;
}
else if( *ent_type == 1 )
{
ent_exchange = data.primary_elems;
}
else
{
return moab::MB_FAILURE;
} // unexpected type
ParallelComm* pco = context.pcomms[*pid];
ErrorCode rval = pco->exchange_tags( tags, tags, ent_exchange );MB_CHK_ERR( rval );
#else
/* do nothing if serial */
// just silence the warning
// do not call sync tags in serial!
int k = *pid + *num_tag + *tag_indices + *ent_type;
k++;
#endif
return moab::MB_SUCCESS;
}
ErrCode iMOAB_ReduceTagsMax( iMOAB_AppID pid, int* tag_index, int* ent_type )
{
#ifdef MOAB_HAVE_MPI
appData& data = context.appDatas[*pid];
Range ent_exchange;
if( *tag_index < 0 || *tag_index >= (int)data.tagList.size() )
{
return moab::MB_FAILURE;
} // error in tag index
Tag tagh = data.tagList[*tag_index];
if( *ent_type == 0 )
{
ent_exchange = data.all_verts;
}
else if( *ent_type == 1 )
{
ent_exchange = data.primary_elems;
}
else
{
return moab::MB_FAILURE;
} // unexpected type
ParallelComm* pco = context.pcomms[*pid];
// we could do different MPI_Op; do not bother now, we will call from fortran
ErrorCode rval = pco->reduce_tags( tagh, MPI_MAX, ent_exchange );MB_CHK_ERR( rval );
#else
/* do nothing if serial */
// just silence the warning
// do not call sync tags in serial!
int k = *pid + *tag_index + *ent_type;
k++; // just do junk, to avoid complaints
#endif
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetNeighborElements( iMOAB_AppID pid,
iMOAB_LocalID* local_index,
int* num_adjacent_elements,
iMOAB_LocalID* adjacent_element_IDs )
{
ErrorCode rval;
// one neighbor for each subentity of dimension-1
MeshTopoUtil mtu( context.MBI );
appData& data = context.appDatas[*pid];
EntityHandle eh = data.primary_elems[*local_index];
Range adjs;
rval = mtu.get_bridge_adjacencies( eh, data.dimension - 1, data.dimension, adjs );MB_CHK_ERR( rval );
if( *num_adjacent_elements < (int)adjs.size() )
{
return moab::MB_FAILURE;
} // not dimensioned correctly
*num_adjacent_elements = (int)adjs.size();
for( int i = 0; i < *num_adjacent_elements; i++ )
{
adjacent_element_IDs[i] = data.primary_elems.index( adjs[i] );
}
return moab::MB_SUCCESS;
}
#if 0
ErrCode iMOAB_GetNeighborVertices ( iMOAB_AppID pid, iMOAB_LocalID* local_vertex_ID, int* num_adjacent_vertices, iMOAB_LocalID* adjacent_vertex_IDs )
{
return moab::MB_SUCCESS;
}
#endif
ErrCode iMOAB_CreateVertices( iMOAB_AppID pid, int* coords_len, int* dim, double* coordinates )
{
ErrorCode rval;
appData& data = context.appDatas[*pid];
if( !data.local_verts.empty() ) // we should have no vertices in the app
{
return moab::MB_FAILURE;
}
int nverts = *coords_len / *dim;
rval = context.MBI->create_vertices( coordinates, nverts, data.local_verts );MB_CHK_ERR( rval );
rval = context.MBI->add_entities( data.file_set, data.local_verts );MB_CHK_ERR( rval );
// also add the vertices to the all_verts range
data.all_verts.merge( data.local_verts );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_CreateElements( iMOAB_AppID pid,
int* num_elem,
int* type,
int* num_nodes_per_element,
int* connectivity,
int* block_ID )
{
// Create elements
appData& data = context.appDatas[*pid];
ReadUtilIface* read_iface;
ErrorCode rval = context.MBI->query_interface( read_iface );MB_CHK_ERR( rval );
EntityType mbtype = (EntityType)( *type );
EntityHandle actual_start_handle;
EntityHandle* array = NULL;
rval = read_iface->get_element_connect( *num_elem, *num_nodes_per_element, mbtype, 1, actual_start_handle, array );MB_CHK_ERR( rval );
// fill up with actual connectivity from input; assume the vertices are in order, and start
// vertex is the first in the current data vertex range
EntityHandle firstVertex = data.local_verts[0];
for( int j = 0; j < *num_elem * ( *num_nodes_per_element ); j++ )
{
array[j] = connectivity[j] + firstVertex - 1;
} // assumes connectivity uses 1 based array (from fortran, mostly)
Range new_elems( actual_start_handle, actual_start_handle + *num_elem - 1 );
rval = context.MBI->add_entities( data.file_set, new_elems );MB_CHK_ERR( rval );
data.primary_elems.merge( new_elems );
// add to adjacency
rval = read_iface->update_adjacencies( actual_start_handle, *num_elem, *num_nodes_per_element, array );MB_CHK_ERR( rval );
// organize all new elements in block, with the given block ID; if the block set is not
// existing, create a new mesh set;
Range sets;
int set_no = *block_ID;
const void* setno_ptr = &set_no;
rval = context.MBI->get_entities_by_type_and_tag( data.file_set, MBENTITYSET, &context.material_tag, &setno_ptr, 1,
sets );
EntityHandle block_set;
if( MB_FAILURE == rval || sets.empty() )
{
// create a new set, with this block ID
rval = context.MBI->create_meshset( MESHSET_SET, block_set );MB_CHK_ERR( rval );
rval = context.MBI->tag_set_data( context.material_tag, &block_set, 1, &set_no );MB_CHK_ERR( rval );
// add the material set to file set
rval = context.MBI->add_entities( data.file_set, &block_set, 1 );MB_CHK_ERR( rval );
}
else
{
block_set = sets[0];
} // first set is the one we want
/// add the new ents to the clock set
rval = context.MBI->add_entities( block_set, new_elems );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_SetGlobalInfo( iMOAB_AppID pid, int* num_global_verts, int* num_global_elems )
{
appData& data = context.appDatas[*pid];
data.num_global_vertices = *num_global_verts;
data.num_global_elements = *num_global_elems;
return moab::MB_SUCCESS;
}
ErrCode iMOAB_GetGlobalInfo( iMOAB_AppID pid, int* num_global_verts, int* num_global_elems )<--- The function 'iMOAB_GetGlobalInfo' is never used.
{
appData& data = context.appDatas[*pid];<--- Variable 'data' can be declared with const
if( NULL != num_global_verts )
{
*num_global_verts = data.num_global_vertices;
}
if( NULL != num_global_elems )
{
*num_global_elems = data.num_global_elements;
}
return moab::MB_SUCCESS;
}
#ifdef MOAB_HAVE_MPI
// this makes sense only for parallel runs
ErrCode iMOAB_ResolveSharedEntities( iMOAB_AppID pid, int* num_verts, int* marker )
{
appData& data = context.appDatas[*pid];
ParallelComm* pco = context.pcomms[*pid];
EntityHandle cset = data.file_set;
int dum_id = 0;
ErrorCode rval;
if( data.primary_elems.empty() )
{
// skip actual resolve, assume vertices are distributed already ,
// no need to share them
}
else
{
// create an integer tag for resolving ; maybe it can be a long tag in the future
// (more than 2 B vertices;)
Tag stag;
rval = context.MBI->tag_get_handle( "__sharedmarker", 1, MB_TYPE_INTEGER, stag, MB_TAG_CREAT | MB_TAG_DENSE,
&dum_id );MB_CHK_ERR( rval );
if( *num_verts > (int)data.local_verts.size() )
{
return moab::MB_FAILURE;
} // we are not setting the size
rval = context.MBI->tag_set_data( stag, data.local_verts, (void*)marker );MB_CHK_ERR( rval ); // assumes integer tag
rval = pco->resolve_shared_ents( cset, -1, -1, &stag );MB_CHK_ERR( rval );
rval = context.MBI->tag_delete( stag );MB_CHK_ERR( rval );
}
// provide partition tag equal to rank
Tag part_tag;
dum_id = -1;
rval = context.MBI->tag_get_handle( "PARALLEL_PARTITION", 1, MB_TYPE_INTEGER, part_tag,
MB_TAG_CREAT | MB_TAG_SPARSE, &dum_id );
if( part_tag == NULL || ( ( rval != MB_SUCCESS ) && ( rval != MB_ALREADY_ALLOCATED ) ) )
{
std::cout << " can't get par part tag.\n";
return moab::MB_FAILURE;
}
int rank = pco->rank();
rval = context.MBI->tag_set_data( part_tag, &cset, 1, &rank );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
// this assumes that this was not called before
ErrCode iMOAB_DetermineGhostEntities( iMOAB_AppID pid, int* ghost_dim, int* num_ghost_layers, int* bridge_dim )
{
ErrorCode rval;
// verify we have valid ghost layers input specified. If invalid, exit quick.
if( *num_ghost_layers <= 0 )
{
return moab::MB_SUCCESS;
} // nothing to do
appData& data = context.appDatas[*pid];
ParallelComm* pco = context.pcomms[*pid];
int addl_ents =
0; // maybe we should be passing this too; most of the time we do not need additional ents collective call
rval =
pco->exchange_ghost_cells( *ghost_dim, *bridge_dim, *num_ghost_layers, addl_ents, true, true, &data.file_set );MB_CHK_ERR( rval );
// now re-establish all mesh info; will reconstruct mesh info, based solely on what is in the file set
return iMOAB_UpdateMeshInfo( pid );
}
ErrCode iMOAB_SendMesh( iMOAB_AppID pid, MPI_Comm* join, MPI_Group* receivingGroup, int* rcompid, int* method )
{
assert( join != nullptr );
assert( receivingGroup != nullptr );
assert( rcompid != nullptr );
ErrorCode rval;
int ierr;
appData& data = context.appDatas[*pid];<--- Variable 'data' can be declared with const
ParallelComm* pco = context.pcomms[*pid];
MPI_Comm global = ( data.is_fortran ? MPI_Comm_f2c( *reinterpret_cast< MPI_Fint* >( join ) ) : *join );
MPI_Group recvGroup =
( data.is_fortran ? MPI_Group_f2c( *reinterpret_cast< MPI_Fint* >( receivingGroup ) ) : *receivingGroup );
MPI_Comm sender = pco->comm(); // the sender comm is obtained from parallel comm in moab; no need to pass it along
// first see what are the processors in each group; get the sender group too, from the sender communicator
MPI_Group senderGroup;
ierr = MPI_Comm_group( sender, &senderGroup );
if( ierr != 0 ) return moab::MB_FAILURE;
// instantiate the par comm graph
// ParCommGraph::ParCommGraph(MPI_Comm joincomm, MPI_Group group1, MPI_Group group2, int coid1,
// int coid2)
ParCommGraph* cgraph =
new ParCommGraph( global, senderGroup, recvGroup, context.appDatas[*pid].global_id, *rcompid );
// we should search if we have another pcomm with the same comp ids in the list already
// sort of check existing comm graphs in the map context.appDatas[*pid].pgraph
context.appDatas[*pid].pgraph[*rcompid] = cgraph;
int sender_rank = -1;
MPI_Comm_rank( sender, &sender_rank );
// decide how to distribute elements to each processor
// now, get the entities on local processor, and pack them into a buffer for various processors
// we will do trivial partition: first get the total number of elements from "sender"
std::vector< int > number_elems_per_part;
// how to distribute local elements to receiving tasks?
// trivial partition: compute first the total number of elements need to be sent
Range owned = context.appDatas[*pid].owned_elems;
if( owned.size() == 0 )
{
// must be vertices that we want to send then
owned = context.appDatas[*pid].local_verts;
// we should have some vertices here
}
if( *method == 0 ) // trivial partitioning, old method
{
int local_owned_elem = (int)owned.size();
int size = pco->size();
int rank = pco->rank();
number_elems_per_part.resize( size ); //
number_elems_per_part[rank] = local_owned_elem;
#if( MPI_VERSION >= 2 )
// Use "in place" option
ierr = MPI_Allgather( MPI_IN_PLACE, 0, MPI_DATATYPE_NULL, &number_elems_per_part[0], 1, MPI_INT, sender );
#else
{
std::vector< int > all_tmp( size );
ierr = MPI_Allgather( &number_elems_per_part[rank], 1, MPI_INT, &all_tmp[0], 1, MPI_INT, sender );
number_elems_per_part = all_tmp;
}
#endif
if( ierr != 0 )
{
return moab::MB_FAILURE;
}
// every sender computes the trivial partition, it is cheap, and we need to send it anyway
// to each sender
rval = cgraph->compute_trivial_partition( number_elems_per_part );MB_CHK_ERR( rval );
rval = cgraph->send_graph( global );MB_CHK_ERR( rval );
}
else // *method != 0, so it is either graph or geometric, parallel
{
// owned are the primary elements on this app
rval = cgraph->compute_partition( pco, owned, *method );MB_CHK_ERR( rval );
// basically, send the graph to the receiver side, with unblocking send
rval = cgraph->send_graph_partition( pco, global );MB_CHK_ERR( rval );
}
// pco is needed to pack, not for communication
rval = cgraph->send_mesh_parts( global, pco, owned );MB_CHK_ERR( rval );
// mark for deletion
MPI_Group_free( &senderGroup );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_ReceiveMesh( iMOAB_AppID pid, MPI_Comm* join, MPI_Group* sendingGroup, int* scompid )
{
assert( join != nullptr );
assert( sendingGroup != nullptr );
assert( scompid != nullptr );
ErrorCode rval;
appData& data = context.appDatas[*pid];
ParallelComm* pco = context.pcomms[*pid];
MPI_Comm receive = pco->comm();
EntityHandle local_set = data.file_set;
MPI_Comm global = ( data.is_fortran ? MPI_Comm_f2c( *reinterpret_cast< MPI_Fint* >( join ) ) : *join );
MPI_Group sendGroup =
( data.is_fortran ? MPI_Group_f2c( *reinterpret_cast< MPI_Fint* >( sendingGroup ) ) : *sendingGroup );
// first see what are the processors in each group; get the sender group too, from the sender
// communicator
MPI_Group receiverGroup;
int ierr = MPI_Comm_group( receive, &receiverGroup );CHK_MPI_ERR( ierr );
// instantiate the par comm graph
ParCommGraph* cgraph =
new ParCommGraph( global, sendGroup, receiverGroup, *scompid, context.appDatas[*pid].global_id );
// TODO we should search if we have another pcomm with the same comp ids in the list already
// sort of check existing comm graphs in the map context.appDatas[*pid].pgraph
context.appDatas[*pid].pgraph[*scompid] = cgraph;
int receiver_rank = -1;
MPI_Comm_rank( receive, &receiver_rank );
// first, receive from sender_rank 0, the communication graph (matrix), so each receiver
// knows what data to expect
std::vector< int > pack_array;
rval = cgraph->receive_comm_graph( global, pco, pack_array );MB_CHK_ERR( rval );
// senders across for the current receiver
int current_receiver = cgraph->receiver( receiver_rank );
std::vector< int > senders_local;
size_t n = 0;
while( n < pack_array.size() )
{
if( current_receiver == pack_array[n] )
{
for( int j = 0; j < pack_array[n + 1]; j++ )
{
senders_local.push_back( pack_array[n + 2 + j] );
}
break;
}
n = n + 2 + pack_array[n + 1];
}
#ifdef VERBOSE
std::cout << " receiver " << current_receiver << " at rank " << receiver_rank << " will receive from "
<< senders_local.size() << " tasks: ";
for( int k = 0; k < (int)senders_local.size(); k++ )
{
std::cout << " " << senders_local[k];
}
std::cout << "\n";
#endif
if( senders_local.empty() )
{
std::cout << " we do not have any senders for receiver rank " << receiver_rank << "\n";
}
rval = cgraph->receive_mesh( global, pco, local_set, senders_local );MB_CHK_ERR( rval );
// after we are done, we could merge vertices that come from different senders, but
// have the same global id
Tag idtag;
rval = context.MBI->tag_get_handle( "GLOBAL_ID", idtag );MB_CHK_ERR( rval );
// data.point_cloud = false;
Range local_ents;
rval = context.MBI->get_entities_by_handle( local_set, local_ents );MB_CHK_ERR( rval );
// do not do merge if point cloud
if( !local_ents.all_of_type( MBVERTEX ) )
{
if( (int)senders_local.size() >= 2 ) // need to remove duplicate vertices
// that might come from different senders
{
Range local_verts = local_ents.subset_by_type( MBVERTEX );
Range local_elems = subtract( local_ents, local_verts );
// remove from local set the vertices
rval = context.MBI->remove_entities( local_set, local_verts );MB_CHK_ERR( rval );
#ifdef VERBOSE
std::cout << "current_receiver " << current_receiver << " local verts: " << local_verts.size() << "\n";
#endif
MergeMesh mm( context.MBI );
rval = mm.merge_using_integer_tag( local_verts, idtag );MB_CHK_ERR( rval );
Range new_verts; // local elems are local entities without vertices
rval = context.MBI->get_connectivity( local_elems, new_verts );MB_CHK_ERR( rval );
#ifdef VERBOSE
std::cout << "after merging: new verts: " << new_verts.size() << "\n";
#endif
rval = context.MBI->add_entities( local_set, new_verts );MB_CHK_ERR( rval );
}
}
else
data.point_cloud = true;
if( !data.point_cloud )
{
// still need to resolve shared entities (in this case, vertices )
rval = pco->resolve_shared_ents( local_set, -1, -1, &idtag );MB_CHK_ERR( rval );
}
else
{
// if partition tag exists, set it to current rank; just to make it visible in VisIt
Tag densePartTag;
rval = context.MBI->tag_get_handle( "partition", densePartTag );
if( NULL != densePartTag && MB_SUCCESS == rval )
{
Range local_verts;
rval = context.MBI->get_entities_by_dimension( local_set, 0, local_verts );MB_CHK_ERR( rval );
std::vector< int > vals;
int rank = pco->rank();
vals.resize( local_verts.size(), rank );
rval = context.MBI->tag_set_data( densePartTag, local_verts, &vals[0] );MB_CHK_ERR( rval );
}
}
// set the parallel partition tag
Tag part_tag;
int dum_id = -1;
rval = context.MBI->tag_get_handle( "PARALLEL_PARTITION", 1, MB_TYPE_INTEGER, part_tag,
MB_TAG_CREAT | MB_TAG_SPARSE, &dum_id );
if( part_tag == NULL || ( ( rval != MB_SUCCESS ) && ( rval != MB_ALREADY_ALLOCATED ) ) )
{
std::cout << " can't get par part tag.\n";
return moab::MB_FAILURE;
}
int rank = pco->rank();
rval = context.MBI->tag_set_data( part_tag, &local_set, 1, &rank );MB_CHK_ERR( rval );
// populate the mesh with current data info
rval = iMOAB_UpdateMeshInfo( pid );MB_CHK_ERR( rval );
// mark for deletion
MPI_Group_free( &receiverGroup );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_SendElementTag( iMOAB_AppID pid, const iMOAB_String tag_storage_name, MPI_Comm* join, int* context_id )
{
appData& data = context.appDatas[*pid];
std::map< int, ParCommGraph* >::iterator mt = data.pgraph.find( *context_id );
if( mt == data.pgraph.end() )
{
return moab::MB_FAILURE;
}
ParCommGraph* cgraph = mt->second;
ParallelComm* pco = context.pcomms[*pid];
Range owned = data.owned_elems;
ErrorCode rval;
EntityHandle cover_set;
MPI_Comm global = ( data.is_fortran ? MPI_Comm_f2c( *reinterpret_cast< MPI_Fint* >( join ) ) : *join );
if( data.point_cloud )
{
owned = data.local_verts;
}
// another possibility is for par comm graph to be computed from iMOAB_ComputeCommGraph, for
// after atm ocn intx, from phys (case from imoab_phatm_ocn_coupler.cpp) get then the cover set
// from ints remapper
#ifdef MOAB_HAVE_TEMPESTREMAP
if( data.tempestData.remapper != NULL ) // this is the case this is part of intx;;
{
cover_set = data.tempestData.remapper->GetMeshSet( Remapper::CoveringMesh );
rval = context.MBI->get_entities_by_dimension( cover_set, 2, owned );MB_CHK_ERR( rval );
// should still have only quads ?
}
#else
// now, in case we are sending from intx between ocn and atm, we involve coverage set
// how do I know if this receiver already participated in an intersection driven by coupler?
// also, what if this was the "source" mesh in intx?
// in that case, the elements might have been instantiated in the coverage set locally, the
// "owned" range can be different the elements are now in tempestRemap coverage_set
cover_set = cgraph->get_cover_set(); // this will be non null only for intx app ?
if( 0 != cover_set )
{
rval = context.MBI->get_entities_by_dimension( cover_set, 2, owned );MB_CHK_ERR( rval );
}
#endif
std::string tag_name( tag_storage_name );
// basically, we assume everything is defined already on the tag,
// and we can get the tags just by its name
// we assume that there are separators ":" between the tag names
std::vector< std::string > tagNames;
std::vector< Tag > tagHandles;
std::string separator( ":" );
split_tag_names( tag_name, separator, tagNames );
for( size_t i = 0; i < tagNames.size(); i++ )
{
Tag tagHandle;
rval = context.MBI->tag_get_handle( tagNames[i].c_str(), tagHandle );
if( MB_SUCCESS != rval || NULL == tagHandle )
{
std::cout << " can't get tag handle for tag named:" << tagNames[i].c_str() << " at index " << i << "\n";MB_CHK_SET_ERR( rval, "can't get tag handle" );
}
tagHandles.push_back( tagHandle );
}
// pco is needed to pack, and for moab instance, not for communication!
// still use nonblocking communication, over the joint comm
rval = cgraph->send_tag_values( global, pco, owned, tagHandles );MB_CHK_ERR( rval );
// now, send to each corr_tasks[i] tag data for corr_sizes[i] primary entities
return moab::MB_SUCCESS;
}
ErrCode iMOAB_ReceiveElementTag( iMOAB_AppID pid, const iMOAB_String tag_storage_name, MPI_Comm* join, int* context_id )
{
appData& data = context.appDatas[*pid];
std::map< int, ParCommGraph* >::iterator mt = data.pgraph.find( *context_id );
if( mt == data.pgraph.end() )
{
return moab::MB_FAILURE;
}
ParCommGraph* cgraph = mt->second;
MPI_Comm global = ( data.is_fortran ? MPI_Comm_f2c( *reinterpret_cast< MPI_Fint* >( join ) ) : *join );
ParallelComm* pco = context.pcomms[*pid];
Range owned = data.owned_elems;
// how do I know if this receiver already participated in an intersection driven by coupler?
// also, what if this was the "source" mesh in intx?
// in that case, the elements might have been instantiated in the coverage set locally, the
// "owned" range can be different the elements are now in tempestRemap coverage_set
EntityHandle cover_set = cgraph->get_cover_set();
ErrorCode rval;
if( 0 != cover_set )
{
rval = context.MBI->get_entities_by_dimension( cover_set, 2, owned );MB_CHK_ERR( rval );
}
if( data.point_cloud )
{
owned = data.local_verts;
}
// another possibility is for par comm graph to be computed from iMOAB_ComputeCommGraph, for
// after atm ocn intx, from phys (case from imoab_phatm_ocn_coupler.cpp) get then the cover set
// from ints remapper
#ifdef MOAB_HAVE_TEMPESTREMAP
if( data.tempestData.remapper != NULL ) // this is the case this is part of intx;;
{
cover_set = data.tempestData.remapper->GetMeshSet( Remapper::CoveringMesh );
rval = context.MBI->get_entities_by_dimension( cover_set, 2, owned );MB_CHK_ERR( rval );
// should still have only quads ?
}
#endif
/*
* data_intx.remapper exists though only on the intersection application
* how do we get from here ( we know the pid that receives, and the commgraph used by migrate
* mesh )
*/
std::string tag_name( tag_storage_name );
// we assume that there are separators ";" between the tag names
std::vector< std::string > tagNames;
std::vector< Tag > tagHandles;
std::string separator( ":" );
split_tag_names( tag_name, separator, tagNames );
for( size_t i = 0; i < tagNames.size(); i++ )
{
Tag tagHandle;
rval = context.MBI->tag_get_handle( tagNames[i].c_str(), tagHandle );
if( MB_SUCCESS != rval || NULL == tagHandle )
{
std::cout << " can't get tag handle for tag named:" << tagNames[i].c_str() << " at index " << i << "\n";MB_CHK_SET_ERR( rval, "can't get tag handle" );
}
tagHandles.push_back( tagHandle );
}
#ifdef VERBOSE
std::cout << pco->rank() << ". Looking to receive data for tags: " << tag_name
<< " and file set = " << ( data.file_set ) << "\n";
#endif
// pco is needed to pack, and for moab instance, not for communication!
// still use nonblocking communication
rval = cgraph->receive_tag_values( global, pco, owned, tagHandles );MB_CHK_ERR( rval );
#ifdef VERBOSE
std::cout << pco->rank() << ". Looking to receive data for tags: " << tag_name << "\n";
#endif
return moab::MB_SUCCESS;
}
ErrCode iMOAB_FreeSenderBuffers( iMOAB_AppID pid, int* context_id )
{
// need first to find the pgraph that holds the information we need
// this will be called on sender side only
appData& data = context.appDatas[*pid];
std::map< int, ParCommGraph* >::iterator mt = data.pgraph.find( *context_id );
if( mt == data.pgraph.end() ) return moab::MB_FAILURE; // error
mt->second->release_send_buffers();
return moab::MB_SUCCESS;
}
/**
\brief compute a comm graph between 2 moab apps, based on ID matching
<B>Operations:</B> Collective
*/
//#define VERBOSE
ErrCode iMOAB_ComputeCommGraph( iMOAB_AppID pid1,
iMOAB_AppID pid2,
MPI_Comm* join,
MPI_Group* group1,
MPI_Group* group2,
int* type1,
int* type2,
int* comp1,
int* comp2 )
{
assert( join );
assert( group1 );
assert( group2 );
ErrorCode rval = MB_SUCCESS;
int localRank = 0, numProcs = 1;
appData& sData = context.appDatas[*pid1];
appData& tData = context.appDatas[*pid2];
MPI_Comm global =
( ( sData.is_fortran || tData.is_fortran ) ? MPI_Comm_f2c( *reinterpret_cast< MPI_Fint* >( join ) ) : *join );
MPI_Group srcGroup = ( sData.is_fortran ? MPI_Group_f2c( *reinterpret_cast< MPI_Fint* >( group1 ) ) : *group1 );
MPI_Group tgtGroup = ( tData.is_fortran ? MPI_Group_f2c( *reinterpret_cast< MPI_Fint* >( group2 ) ) : *group2 );
MPI_Comm_rank( global, &localRank );
MPI_Comm_size( global, &numProcs );
// instantiate the par comm graph
// ParCommGraph::ParCommGraph(MPI_Comm joincomm, MPI_Group group1, MPI_Group group2, int coid1,
// int coid2)
ParCommGraph* cgraph = NULL;
if( *pid1 >= 0 ) cgraph = new ParCommGraph( global, srcGroup, tgtGroup, *comp1, *comp2 );
ParCommGraph* cgraph_rev = NULL;
if( *pid2 >= 0 ) cgraph_rev = new ParCommGraph( global, tgtGroup, srcGroup, *comp2, *comp1 );
// we should search if we have another pcomm with the same comp ids in the list already
// sort of check existing comm graphs in the map context.appDatas[*pid].pgraph
if( *pid1 >= 0 ) sData.pgraph[*comp2] = cgraph; // the context will be the other comp
if( *pid2 >= 0 ) tData.pgraph[*comp1] = cgraph_rev; // from 2 to 1
// each model has a list of global ids that will need to be sent by gs to rendezvous the other
// model on the joint comm
TupleList TLcomp1;
TLcomp1.initialize( 2, 0, 0, 0, 0 ); // to proc, marker
TupleList TLcomp2;
TLcomp2.initialize( 2, 0, 0, 0, 0 ); // to proc, marker
// will push_back a new tuple, if needed
TLcomp1.enableWriteAccess();
// tags of interest are either GLOBAL_DOFS or GLOBAL_ID
Tag gdsTag;
// find the values on first cell
int lenTagType1 = 1;
if( 1 == *type1 || 1 == *type2 )
{
rval = context.MBI->tag_get_handle( "GLOBAL_DOFS", gdsTag );MB_CHK_ERR( rval );
rval = context.MBI->tag_get_length( gdsTag, lenTagType1 );MB_CHK_ERR( rval ); // usually it is 16
}
Tag tagType2 = context.MBI->globalId_tag();
std::vector< int > valuesComp1;
// populate first tuple
if( *pid1 >= 0 )
{
appData& data1 = context.appDatas[*pid1];
EntityHandle fset1 = data1.file_set;
// in case of tempest remap, get the coverage set
#ifdef MOAB_HAVE_TEMPESTREMAP
if( data1.tempestData.remapper != NULL ) // this is the case this is part of intx;;
{
fset1 = data1.tempestData.remapper->GetMeshSet( Remapper::CoveringMesh );
// should still have only quads ?
}
#endif
Range ents_of_interest;
if( *type1 == 1 )
{
assert( gdsTag );
rval = context.MBI->get_entities_by_type( fset1, MBQUAD, ents_of_interest );MB_CHK_ERR( rval );
valuesComp1.resize( ents_of_interest.size() * lenTagType1 );
rval = context.MBI->tag_get_data( gdsTag, ents_of_interest, &valuesComp1[0] );MB_CHK_ERR( rval );
}
else if( *type1 == 2 )
{
rval = context.MBI->get_entities_by_type( fset1, MBVERTEX, ents_of_interest );MB_CHK_ERR( rval );
valuesComp1.resize( ents_of_interest.size() );
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &valuesComp1[0] );MB_CHK_ERR( rval ); // just global ids
}
else if( *type1 == 3 ) // for FV meshes, just get the global id of cell
{
rval = context.MBI->get_entities_by_dimension( fset1, 2, ents_of_interest );MB_CHK_ERR( rval );
valuesComp1.resize( ents_of_interest.size() );
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &valuesComp1[0] );MB_CHK_ERR( rval ); // just global ids
}
else
{
MB_CHK_ERR( MB_FAILURE ); // we know only type 1 or 2 or 3
}
// now fill the tuple list with info and markers
// because we will send only the ids, order and compress the list
std::set< int > uniq( valuesComp1.begin(), valuesComp1.end() );
TLcomp1.resize( uniq.size() );
for( std::set< int >::iterator sit = uniq.begin(); sit != uniq.end(); sit++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
// to proc, marker, element local index, index in el
int marker = *sit;
int to_proc = marker % numProcs;
int n = TLcomp1.get_n();
TLcomp1.vi_wr[2 * n] = to_proc; // send to processor
TLcomp1.vi_wr[2 * n + 1] = marker;
TLcomp1.inc_n();
}
}
ProcConfig pc( global ); // proc config does the crystal router
pc.crystal_router()->gs_transfer( 1, TLcomp1,
0 ); // communication towards joint tasks, with markers
// sort by value (key 1)
#ifdef VERBOSE
std::stringstream ff1;
ff1 << "TLcomp1_" << localRank << ".txt";
TLcomp1.print_to_file( ff1.str().c_str() ); // it will append!
#endif
moab::TupleList::buffer sort_buffer;
sort_buffer.buffer_init( TLcomp1.get_n() );
TLcomp1.sort( 1, &sort_buffer );
sort_buffer.reset();
#ifdef VERBOSE
// after sorting
TLcomp1.print_to_file( ff1.str().c_str() ); // it will append!
#endif
// do the same, for the other component, number2, with type2
// start copy
TLcomp2.enableWriteAccess();
// populate second tuple
std::vector< int > valuesComp2;
if( *pid2 >= 0 )
{
appData& data2 = context.appDatas[*pid2];
EntityHandle fset2 = data2.file_set;
// in case of tempest remap, get the coverage set
#ifdef MOAB_HAVE_TEMPESTREMAP
if( data2.tempestData.remapper != NULL ) // this is the case this is part of intx;;
{
fset2 = data2.tempestData.remapper->GetMeshSet( Remapper::CoveringMesh );
// should still have only quads ?
}
#endif
Range ents_of_interest;
if( *type2 == 1 )
{
assert( gdsTag );
rval = context.MBI->get_entities_by_type( fset2, MBQUAD, ents_of_interest );MB_CHK_ERR( rval );
valuesComp2.resize( ents_of_interest.size() * lenTagType1 );
rval = context.MBI->tag_get_data( gdsTag, ents_of_interest, &valuesComp2[0] );MB_CHK_ERR( rval );
}
else if( *type2 == 2 )
{
rval = context.MBI->get_entities_by_type( fset2, MBVERTEX, ents_of_interest );MB_CHK_ERR( rval );
valuesComp2.resize( ents_of_interest.size() ); // stride is 1 here
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &valuesComp2[0] );MB_CHK_ERR( rval ); // just global ids
}
else if( *type2 == 3 )
{
rval = context.MBI->get_entities_by_dimension( fset2, 2, ents_of_interest );MB_CHK_ERR( rval );
valuesComp2.resize( ents_of_interest.size() ); // stride is 1 here
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &valuesComp2[0] );MB_CHK_ERR( rval ); // just global ids
}
else
{
MB_CHK_ERR( MB_FAILURE ); // we know only type 1 or 2
}
// now fill the tuple list with info and markers
std::set< int > uniq( valuesComp2.begin(), valuesComp2.end() );
TLcomp2.resize( uniq.size() );
for( std::set< int >::iterator sit = uniq.begin(); sit != uniq.end(); sit++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
// to proc, marker, element local index, index in el
int marker = *sit;
int to_proc = marker % numProcs;
int n = TLcomp2.get_n();
TLcomp2.vi_wr[2 * n] = to_proc; // send to processor
TLcomp2.vi_wr[2 * n + 1] = marker;
TLcomp2.inc_n();
}
}
pc.crystal_router()->gs_transfer( 1, TLcomp2,
0 ); // communication towards joint tasks, with markers
// sort by value (key 1)
#ifdef VERBOSE
std::stringstream ff2;
ff2 << "TLcomp2_" << localRank << ".txt";
TLcomp2.print_to_file( ff2.str().c_str() );
#endif
sort_buffer.buffer_reserve( TLcomp2.get_n() );
TLcomp2.sort( 1, &sort_buffer );
sort_buffer.reset();
// end copy
#ifdef VERBOSE
TLcomp2.print_to_file( ff2.str().c_str() );
#endif
// need to send back the info, from the rendezvous point, for each of the values
/* so go over each value, on local process in joint communicator
now have to send back the info needed for communication;
loop in in sync over both TLComp1 and TLComp2, in local process;
So, build new tuple lists, to send synchronous communication
populate them at the same time, based on marker, that is indexed
*/
TupleList TLBackToComp1;
TLBackToComp1.initialize( 3, 0, 0, 0, 0 ); // to proc, marker, from proc on comp2,
TLBackToComp1.enableWriteAccess();
TupleList TLBackToComp2;
TLBackToComp2.initialize( 3, 0, 0, 0, 0 ); // to proc, marker, from proc,
TLBackToComp2.enableWriteAccess();
int n1 = TLcomp1.get_n();
int n2 = TLcomp2.get_n();
int indexInTLComp1 = 0;
int indexInTLComp2 = 0; // advance both, according to the marker
if( n1 > 0 && n2 > 0 )
{
while( indexInTLComp1 < n1 && indexInTLComp2 < n2 ) // if any is over, we are done
{
int currentValue1 = TLcomp1.vi_rd[2 * indexInTLComp1 + 1];
int currentValue2 = TLcomp2.vi_rd[2 * indexInTLComp2 + 1];
if( currentValue1 < currentValue2 )
{
// we have a big problem; basically, we are saying that
// dof currentValue is on one model and not on the other
// std::cout << " currentValue1:" << currentValue1 << " missing in comp2" << "\n";
indexInTLComp1++;
continue;
}
if( currentValue1 > currentValue2 )
{
// std::cout << " currentValue2:" << currentValue2 << " missing in comp1" << "\n";
indexInTLComp2++;
continue;
}
int size1 = 1;
int size2 = 1;
while( indexInTLComp1 + size1 < n1 && currentValue1 == TLcomp1.vi_rd[2 * ( indexInTLComp1 + size1 ) + 1] )
size1++;
while( indexInTLComp2 + size2 < n2 && currentValue2 == TLcomp2.vi_rd[2 * ( indexInTLComp2 + size2 ) + 1] )
size2++;
// must be found in both lists, find the start and end indices
for( int i1 = 0; i1 < size1; i1++ )
{
for( int i2 = 0; i2 < size2; i2++ )
{
// send the info back to components
int n = TLBackToComp1.get_n();
TLBackToComp1.reserve();
TLBackToComp1.vi_wr[3 * n] =
TLcomp1.vi_rd[2 * ( indexInTLComp1 + i1 )]; // send back to the proc marker
// came from, info from comp2
TLBackToComp1.vi_wr[3 * n + 1] = currentValue1; // initial value (resend?)
TLBackToComp1.vi_wr[3 * n + 2] = TLcomp2.vi_rd[2 * ( indexInTLComp2 + i2 )]; // from proc on comp2
n = TLBackToComp2.get_n();
TLBackToComp2.reserve();
TLBackToComp2.vi_wr[3 * n] =
TLcomp2.vi_rd[2 * ( indexInTLComp2 + i2 )]; // send back info to original
TLBackToComp2.vi_wr[3 * n + 1] = currentValue1; // initial value (resend?)
TLBackToComp2.vi_wr[3 * n + 2] = TLcomp1.vi_rd[2 * ( indexInTLComp1 + i1 )]; // from proc on comp1
// what if there are repeated markers in TLcomp2? increase just index2
}
}
indexInTLComp1 += size1;
indexInTLComp2 += size2;
}
}
pc.crystal_router()->gs_transfer( 1, TLBackToComp1, 0 ); // communication towards original tasks, with info about
pc.crystal_router()->gs_transfer( 1, TLBackToComp2, 0 );
if( *pid1 >= 0 )
{
// we are on original comp 1 tasks
// before ordering
// now for each value in TLBackToComp1.vi_rd[3*i+1], on current proc, we know the
// processors it communicates with
#ifdef VERBOSE
std::stringstream f1;
f1 << "TLBack1_" << localRank << ".txt";
TLBackToComp1.print_to_file( f1.str().c_str() );
#endif
sort_buffer.buffer_reserve( TLBackToComp1.get_n() );
TLBackToComp1.sort( 1, &sort_buffer );
sort_buffer.reset();
#ifdef VERBOSE
TLBackToComp1.print_to_file( f1.str().c_str() );
#endif
// so we are now on pid1, we know now each marker were it has to go
// add a new method to ParCommGraph, to set up the involved_IDs_map
cgraph->settle_comm_by_ids( *comp1, TLBackToComp1, valuesComp1 );
}
if( *pid2 >= 0 )
{
// we are on original comp 1 tasks
// before ordering
// now for each value in TLBackToComp1.vi_rd[3*i+1], on current proc, we know the
// processors it communicates with
#ifdef VERBOSE
std::stringstream f2;
f2 << "TLBack2_" << localRank << ".txt";
TLBackToComp2.print_to_file( f2.str().c_str() );
#endif
sort_buffer.buffer_reserve( TLBackToComp2.get_n() );
TLBackToComp2.sort( 2, &sort_buffer );
sort_buffer.reset();
#ifdef VERBOSE
TLBackToComp2.print_to_file( f2.str().c_str() );
#endif
cgraph_rev->settle_comm_by_ids( *comp2, TLBackToComp2, valuesComp2 );
//
}
return moab::MB_SUCCESS;
}
//#undef VERBOSE
ErrCode iMOAB_MergeVertices( iMOAB_AppID pid )<--- The function 'iMOAB_MergeVertices' is never used.
{
appData& data = context.appDatas[*pid];
ParallelComm* pco = context.pcomms[*pid];
// collapse vertices and transform cells into triangles/quads /polys
// tags we care about: area, frac, global id
std::vector< Tag > tagsList;
Tag tag;
ErrorCode rval = context.MBI->tag_get_handle( "GLOBAL_ID", tag );
if( !tag || rval != MB_SUCCESS ) return moab::MB_FAILURE; // fatal error, abort
tagsList.push_back( tag );
rval = context.MBI->tag_get_handle( "area", tag );
if( tag && rval == MB_SUCCESS ) tagsList.push_back( tag );
rval = context.MBI->tag_get_handle( "frac", tag );
if( tag && rval == MB_SUCCESS ) tagsList.push_back( tag );
double tol = 1.0e-9;
rval = IntxUtils::remove_duplicate_vertices( context.MBI, data.file_set, tol, tagsList );MB_CHK_ERR( rval );
// clean material sets of cells that were deleted
rval = context.MBI->get_entities_by_type_and_tag( data.file_set, MBENTITYSET, &( context.material_tag ), 0, 1,
data.mat_sets, Interface::UNION );MB_CHK_ERR( rval );
if( !data.mat_sets.empty() )
{
EntityHandle matSet = data.mat_sets[0];
Range elems;
rval = context.MBI->get_entities_by_dimension( matSet, 2, elems );MB_CHK_ERR( rval );
rval = context.MBI->remove_entities( matSet, elems );MB_CHK_ERR( rval );
// put back only cells from data.file_set
elems.clear();
rval = context.MBI->get_entities_by_dimension( data.file_set, 2, elems );MB_CHK_ERR( rval );
rval = context.MBI->add_entities( matSet, elems );MB_CHK_ERR( rval );
}
rval = iMOAB_UpdateMeshInfo( pid );MB_CHK_ERR( rval );
ParallelMergeMesh pmm( pco, tol );
rval = pmm.merge( data.file_set,
/* do not do local merge*/ false,
/* 2d cells*/ 2 );MB_CHK_ERR( rval );
// assign global ids only for vertices, cells have them fine
rval = pco->assign_global_ids( data.file_set, /*dim*/ 0 );MB_CHK_ERR( rval );
// set the partition tag on the file set
Tag part_tag;
int dum_id = -1;
rval = context.MBI->tag_get_handle( "PARALLEL_PARTITION", 1, MB_TYPE_INTEGER, part_tag,
MB_TAG_CREAT | MB_TAG_SPARSE, &dum_id );
if( part_tag == NULL || ( ( rval != MB_SUCCESS ) && ( rval != MB_ALREADY_ALLOCATED ) ) )
{
std::cout << " can't get par part tag.\n";
return moab::MB_FAILURE;
}
int rank = pco->rank();
rval = context.MBI->tag_set_data( part_tag, &data.file_set, 1, &rank );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
#ifdef MOAB_HAVE_TEMPESTREMAP
// this call must be collective on the joint communicator
// intersection tasks on coupler will need to send to the components tasks the list of
// id elements that are relevant: they intersected some of the target elements (which are not needed
// here)
// in the intersection
ErrCode iMOAB_CoverageGraph( MPI_Comm* join,
iMOAB_AppID pid_src,
iMOAB_AppID pid_migr,
iMOAB_AppID pid_intx,
int* src_id,
int* migr_id,
int* context_id )
{
// first, based on the scompid and migrcomp, find the parCommGraph corresponding to this
// exchange
ErrorCode rval;
std::vector< int > srcSenders;
std::vector< int > receivers;
ParCommGraph* sendGraph = NULL;
int ierr;
int default_context_id = -1;
bool is_fortran_context = false;
// First, find the original graph between PE sets
// And based on this one, we will build the newly modified one for coverage
if( *pid_src >= 0 )
{
default_context_id = *migr_id; // the other one
assert( context.appDatas[*pid_src].global_id == *src_id );
is_fortran_context = context.appDatas[*pid_src].is_fortran || is_fortran_context;
sendGraph = context.appDatas[*pid_src].pgraph[default_context_id]; // maybe check if it does not exist
// report the sender and receiver tasks in the joint comm
srcSenders = sendGraph->senders();
receivers = sendGraph->receivers();
#ifdef VERBOSE
std::cout << "senders: " << srcSenders.size() << " first sender: " << srcSenders[0] << std::endl;
#endif
}
ParCommGraph* recvGraph = NULL; // will be non null on receiver tasks (intx tasks)
if( *pid_migr >= 0 )
{
is_fortran_context = context.appDatas[*pid_migr].is_fortran || is_fortran_context;
// find the original one
default_context_id = *src_id;
assert( context.appDatas[*pid_migr].global_id == *migr_id );
recvGraph = context.appDatas[*pid_migr].pgraph[default_context_id];
// report the sender and receiver tasks in the joint comm, from migrated mesh pt of view
srcSenders = recvGraph->senders();
receivers = recvGraph->receivers();
#ifdef VERBOSE
std::cout << "receivers: " << receivers.size() << " first receiver: " << receivers[0] << std::endl;
#endif
}
if( *pid_intx >= 0 ) is_fortran_context = context.appDatas[*pid_intx].is_fortran || is_fortran_context;
// loop over pid_intx elements, to see what original processors in joint comm have sent the
// coverage mesh;
// If we are on intx tasks, send coverage info towards original component tasks,
// about needed cells
TupleList TLcovIDs;
TLcovIDs.initialize( 2, 0, 0, 0, 0 ); // to proc, GLOBAL ID; estimate about 100 IDs to be sent
// will push_back a new tuple, if needed
TLcovIDs.enableWriteAccess();
// the crystal router will send ID cell to the original source, on the component task
// if we are on intx tasks, loop over all intx elements and
MPI_Comm global = ( is_fortran_context ? MPI_Comm_f2c( *reinterpret_cast< MPI_Fint* >( join ) ) : *join );
int currentRankInJointComm = -1;
ierr = MPI_Comm_rank( global, ¤tRankInJointComm );CHK_MPI_ERR( ierr );
// if currentRankInJointComm is in receivers list, it means that we are on intx tasks too, we
// need to send information towards component tasks
if( find( receivers.begin(), receivers.end(), currentRankInJointComm ) !=
receivers.end() ) // we are on receivers tasks, we can request intx info
{
// find the pcomm for the intx pid
if( *pid_intx >= (int)context.appDatas.size() ) return moab::MB_FAILURE;
appData& dataIntx = context.appDatas[*pid_intx];
Tag parentTag, orgSendProcTag;
rval = context.MBI->tag_get_handle( "SourceParent", parentTag );MB_CHK_ERR( rval ); // global id of the blue, source element
if( !parentTag ) return moab::MB_FAILURE; // fatal error, abort
rval = context.MBI->tag_get_handle( "orig_sending_processor", orgSendProcTag );MB_CHK_ERR( rval );
if( !orgSendProcTag ) return moab::MB_FAILURE; // fatal error, abort
// find the file set, red parents for intx cells, and put them in tuples
EntityHandle intxSet = dataIntx.file_set;
Range cells;
// get all entities from the set, and look at their RedParent
rval = context.MBI->get_entities_by_dimension( intxSet, 2, cells );MB_CHK_ERR( rval );
std::map< int, std::set< int > > idsFromProcs; // send that info back to enhance parCommGraph cache
for( Range::iterator it = cells.begin(); it != cells.end(); it++ )
{
EntityHandle intx_cell = *it;
int gidCell, origProc; // look at receivers
rval = context.MBI->tag_get_data( parentTag, &intx_cell, 1, &gidCell );MB_CHK_ERR( rval );
rval = context.MBI->tag_get_data( orgSendProcTag, &intx_cell, 1, &origProc );MB_CHK_ERR( rval );
// we have augmented the overlap set with ghost cells ; in that case, the
// orig_sending_processor is not set so it will be -1;
if( origProc < 0 ) continue;
std::set< int >& setInts = idsFromProcs[origProc];
setInts.insert( gidCell );
}
// if we have no intx cells, it means we are on point clouds; quick fix just use all cells
// from coverage set
if( cells.empty() )
{
// get coverage set
assert( *pid_intx >= 0 );
appData& dataIntx = context.appDatas[*pid_intx];
EntityHandle cover_set = dataIntx.tempestData.remapper->GetMeshSet( Remapper::CoveringMesh );
// get all cells from coverage set
Tag gidTag;
rval = context.MBI->tag_get_handle( "GLOBAL_ID", gidTag );MB_CHK_ERR( rval );
rval = context.MBI->get_entities_by_dimension( cover_set, 2, cells );MB_CHK_ERR( rval );
// look at their orig_sending_processor
for( Range::iterator it = cells.begin(); it != cells.end(); it++ )
{
EntityHandle covCell = *it;
int gidCell, origProc; // look at o
rval = context.MBI->tag_get_data( gidTag, &covCell, 1, &gidCell );MB_CHK_ERR( rval );
rval = context.MBI->tag_get_data( orgSendProcTag, &covCell, 1, &origProc );MB_CHK_ERR( rval );
// we have augmented the overlap set with ghost cells ; in that case, the
// orig_sending_processor is not set so it will be -1;
if( origProc < 0 ) // it cannot < 0, I think
continue;
std::set< int >& setInts = idsFromProcs[origProc];
setInts.insert( gidCell );
}
}
#ifdef VERBOSE
std::ofstream dbfile;
std::stringstream outf;
outf << "idsFromProc_0" << currentRankInJointComm << ".txt";
dbfile.open( outf.str().c_str() );
dbfile << "Writing this to a file.\n";
dbfile << " map size:" << idsFromProcs.size()
<< std::endl; // on the receiver side, these show how much data to receive
// from the sender (how many ids, and how much tag data later; we need to size up the
// receiver buffer) arrange in tuples , use map iterators to send the ids
for( std::map< int, std::set< int > >::iterator mt = idsFromProcs.begin(); mt != idsFromProcs.end(); mt++ )
{
std::set< int >& setIds = mt->second;
dbfile << "from id: " << mt->first << " receive " << setIds.size() << " cells \n";
int counter = 0;
for( std::set< int >::iterator st = setIds.begin(); st != setIds.end(); st++ )
{
int valueID = *st;
dbfile << " " << valueID;
counter++;
if( counter % 10 == 0 ) dbfile << "\n";
}
dbfile << "\n";
}
dbfile.close();
#endif
if( NULL != recvGraph )
{
ParCommGraph* recvGraph1 = new ParCommGraph( *recvGraph ); // just copy
recvGraph1->set_context_id( *context_id );
recvGraph1->SetReceivingAfterCoverage( idsFromProcs );
// this par comm graph will need to use the coverage set
// so we are for sure on intx pes (the receiver is the coupler mesh)
assert( *pid_intx >= 0 );
appData& dataIntx = context.appDatas[*pid_intx];
EntityHandle cover_set = dataIntx.tempestData.remapper->GetMeshSet( Remapper::CoveringMesh );
recvGraph1->set_cover_set( cover_set );
context.appDatas[*pid_migr].pgraph[*context_id] = recvGraph1;
}
for( std::map< int, std::set< int > >::iterator mit = idsFromProcs.begin(); mit != idsFromProcs.end(); mit++ )
{
int procToSendTo = mit->first;
std::set< int >& idSet = mit->second;
for( std::set< int >::iterator sit = idSet.begin(); sit != idSet.end(); sit++ )
{
int n = TLcovIDs.get_n();
TLcovIDs.reserve();
TLcovIDs.vi_wr[2 * n] = procToSendTo; // send to processor
TLcovIDs.vi_wr[2 * n + 1] = *sit; // global id needs index in the local_verts range
}
}
}
ProcConfig pc( global ); // proc config does the crystal router
pc.crystal_router()->gs_transfer( 1, TLcovIDs,
0 ); // communication towards component tasks, with what ids are needed
// for each task from receiver
// a test to know if we are on the sender tasks (original component, in this case, atmosphere)
if( NULL != sendGraph )
{
// collect TLcovIDs tuple, will set in a local map/set, the ids that are sent to each
// receiver task
ParCommGraph* sendGraph1 = new ParCommGraph( *sendGraph ); // just copy
sendGraph1->set_context_id( *context_id );
context.appDatas[*pid_src].pgraph[*context_id] = sendGraph1;
rval = sendGraph1->settle_send_graph( TLcovIDs );MB_CHK_ERR( rval );
}
return moab::MB_SUCCESS; // success
}
ErrCode iMOAB_DumpCommGraph( iMOAB_AppID pid, int* context_id, int* is_sender, const iMOAB_String prefix )
{
assert( prefix && strlen( prefix ) );
ParCommGraph* cgraph = context.appDatas[*pid].pgraph[*context_id];
std::string prefix_str( prefix );
if( NULL != cgraph )
cgraph->dump_comm_information( prefix_str, *is_sender );
else
{
std::cout << " cannot find ParCommGraph on app with pid " << *pid << " name: " << context.appDatas[*pid].name
<< " context: " << *context_id << "\n";
}
return moab::MB_SUCCESS;
}
#endif // #ifdef MOAB_HAVE_TEMPESTREMAP
#endif // #ifdef MOAB_HAVE_MPI
#ifdef MOAB_HAVE_TEMPESTREMAP
#ifdef MOAB_HAVE_NETCDF
ErrCode iMOAB_LoadMappingWeightsFromFile(
iMOAB_AppID pid_intersection,
iMOAB_AppID pid_cpl,
int* col_or_row,
int* type,
const iMOAB_String solution_weights_identifier, /* "scalar", "flux", "custom" */
const iMOAB_String remap_weights_filename )
{
ErrorCode rval;
bool row_based_partition = true;
if( *col_or_row == 1 ) row_based_partition = false; // do a column based partition;
// get the local degrees of freedom, from the pid_cpl and type of mesh
// Get the source and target data and pcomm objects
appData& data_intx = context.appDatas[*pid_intersection];
TempestMapAppData& tdata = data_intx.tempestData;
// Get the handle to the remapper object
if( tdata.remapper == NULL )
{
// Now allocate and initialize the remapper object
#ifdef MOAB_HAVE_MPI
ParallelComm* pco = context.pcomms[*pid_intersection];
tdata.remapper = new moab::TempestRemapper( context.MBI, pco );
#else
tdata.remapper = new moab::TempestRemapper( context.MBI );
#endif
tdata.remapper->meshValidate = true;
tdata.remapper->constructEdgeMap = true;
// Do not create new filesets; Use the sets from our respective applications
tdata.remapper->initialize( false );
tdata.remapper->GetMeshSet( moab::Remapper::OverlapMesh ) = data_intx.file_set;
}
// Setup loading of weights onto TempestOnlineMap
// Set the context for the remapping weights computation
tdata.weightMaps[std::string( solution_weights_identifier )] = new moab::TempestOnlineMap( tdata.remapper );
// Now allocate and initialize the remapper object
moab::TempestOnlineMap* weightMap = tdata.weightMaps[std::string( solution_weights_identifier )];
assert( weightMap != NULL );
if( *pid_cpl >= 0 ) // it means we are looking for how to distribute the degrees of freedom, new map reader
{
appData& data1 = context.appDatas[*pid_cpl];
EntityHandle fset1 = data1.file_set; // this is source or target, depending on direction
// tags of interest are either GLOBAL_DOFS or GLOBAL_ID
Tag gdsTag;
// find the values on first cell
int lenTagType1 = 1;
if( *type == 1 )
{
rval = context.MBI->tag_get_handle( "GLOBAL_DOFS", gdsTag );MB_CHK_ERR( rval );
rval = context.MBI->tag_get_length( gdsTag, lenTagType1 );MB_CHK_ERR( rval ); // usually it is 16
}
Tag tagType2 = context.MBI->globalId_tag();
std::vector< int > dofValues;
// populate first tuple
Range
ents_of_interest; // will be filled with entities on coupler, from which we will get the DOFs, based on type
int ndofPerEl = 1;
if( *type == 1 )
{
assert( gdsTag );
rval = context.MBI->get_entities_by_type( fset1, MBQUAD, ents_of_interest );MB_CHK_ERR( rval );
dofValues.resize( ents_of_interest.size() * lenTagType1 );
rval = context.MBI->tag_get_data( gdsTag, ents_of_interest, &dofValues[0] );MB_CHK_ERR( rval );
ndofPerEl = lenTagType1;
}
else if( *type == 2 )
{
rval = context.MBI->get_entities_by_type( fset1, MBVERTEX, ents_of_interest );MB_CHK_ERR( rval );
dofValues.resize( ents_of_interest.size() );
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &dofValues[0] );MB_CHK_ERR( rval ); // just global ids
}
else if( *type == 3 ) // for FV meshes, just get the global id of cell
{
rval = context.MBI->get_entities_by_dimension( fset1, 2, ents_of_interest );MB_CHK_ERR( rval );
dofValues.resize( ents_of_interest.size() );
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &dofValues[0] );MB_CHK_ERR( rval ); // just global ids
}
else
{
MB_CHK_ERR( MB_FAILURE ); // we know only type 1 or 2 or 3
}
// pass ordered dofs, and unique
std::vector< int > orderDofs( dofValues.begin(), dofValues.end() );
std::sort( orderDofs.begin(), orderDofs.end() );
orderDofs.erase( std::unique( orderDofs.begin(), orderDofs.end() ), orderDofs.end() ); // remove duplicates
rval = weightMap->ReadParallelMap( remap_weights_filename, orderDofs, row_based_partition );MB_CHK_ERR( rval );
// if we are on target mesh (row based partition)
if( row_based_partition )
{
tdata.pid_dest = pid_cpl;
tdata.remapper->SetMeshSet( Remapper::TargetMesh, fset1, ents_of_interest );
weightMap->SetDestinationNDofsPerElement( ndofPerEl );
weightMap->set_row_dc_dofs( dofValues ); // will set row_dtoc_dofmap
}
else
{
tdata.pid_src = pid_cpl;
tdata.remapper->SetMeshSet( Remapper::SourceMesh, fset1, ents_of_interest );
weightMap->SetSourceNDofsPerElement( ndofPerEl );
weightMap->set_col_dc_dofs( dofValues ); // will set col_dtoc_dofmap
}
}
else // old reader, trivial distribution by row
{
std::vector< int > tmp_owned_ids; // this will do a trivial row distribution
rval = weightMap->ReadParallelMap( remap_weights_filename, tmp_owned_ids, row_based_partition );MB_CHK_ERR( rval );
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_WriteMappingWeightsToFile(
iMOAB_AppID pid_intersection,
const iMOAB_String solution_weights_identifier, /* "scalar", "flux", "custom" */
const iMOAB_String remap_weights_filename )
{
assert( solution_weights_identifier && strlen( solution_weights_identifier ) );
assert( remap_weights_filename && strlen( remap_weights_filename ) );
ErrorCode rval;
// Get the source and target data and pcomm objects
appData& data_intx = context.appDatas[*pid_intersection];
TempestMapAppData& tdata = data_intx.tempestData;
// Get the handle to the remapper object
assert( tdata.remapper != NULL );
// Now get online weights object and ensure it is valid
moab::TempestOnlineMap* weightMap = tdata.weightMaps[std::string( solution_weights_identifier )];
assert( weightMap != NULL );
std::string filename = std::string( remap_weights_filename );
// Write the map file to disk in parallel using either HDF5 or SCRIP interface
rval = weightMap->WriteParallelMap( filename );MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
#ifdef MOAB_HAVE_MPI
ErrCode iMOAB_MigrateMapMesh( iMOAB_AppID pid1,
iMOAB_AppID pid2,
iMOAB_AppID pid3,
MPI_Comm* jointcomm,
MPI_Group* groupA,
MPI_Group* groupB,
int* type,
int* comp1,
int* comp2,
int* direction )
{
assert( jointcomm );
assert( groupA );
assert( groupB );
MPI_Comm joint_communicator =
( context.appDatas[*pid1].is_fortran ? MPI_Comm_f2c( *reinterpret_cast< MPI_Fint* >( jointcomm ) )
: *jointcomm );
MPI_Group group_first =
( context.appDatas[*pid1].is_fortran ? MPI_Group_f2c( *reinterpret_cast< MPI_Fint* >( groupA ) ) : *groupA );
MPI_Group group_second =
( context.appDatas[*pid1].is_fortran ? MPI_Group_f2c( *reinterpret_cast< MPI_Fint* >( groupB ) ) : *groupB );
ErrorCode rval = MB_SUCCESS;
int localRank = 0, numProcs = 1;
// Get the local rank and number of processes in the joint communicator
MPI_Comm_rank( joint_communicator, &localRank );
MPI_Comm_size( joint_communicator, &numProcs );
// Next instantiate the par comm graph
// here we need to look at direction
// this direction is good for atm source -> ocn target coupler example
ParCommGraph* cgraph = NULL;
if( *pid1 >= 0 ) cgraph = new ParCommGraph( joint_communicator, group_first, group_second, *comp1, *comp2 );
ParCommGraph* cgraph_rev = NULL;
if( *pid3 >= 0 ) cgraph_rev = new ParCommGraph( joint_communicator, group_second, group_first, *comp2, *comp1 );
// we should search if we have another pcomm with the same comp ids in the list already
// sort of check existing comm graphs in the map context.appDatas[*pid].pgraph
if( *pid1 >= 0 ) context.appDatas[*pid1].pgraph[*comp2] = cgraph; // the context will be the other comp
if( *pid3 >= 0 ) context.appDatas[*pid3].pgraph[*comp1] = cgraph_rev; // from 2 to 1
// each model has a list of global ids that will need to be sent by gs to rendezvous the other
// model on the joint_communicator
TupleList TLcomp1;
TLcomp1.initialize( 2, 0, 0, 0, 0 ); // to proc, marker
TupleList TLcomp2;
TLcomp2.initialize( 2, 0, 0, 0, 0 ); // to proc, marker
// will push_back a new tuple, if needed
TLcomp1.enableWriteAccess();
// tags of interest are either GLOBAL_DOFS or GLOBAL_ID
Tag gdsTag;
// find the values on first cell
int lenTagType1 = 1;
if( *type == 1 )
{
rval = context.MBI->tag_get_handle( "GLOBAL_DOFS", gdsTag );MB_CHK_ERR( rval );
rval = context.MBI->tag_get_length( gdsTag, lenTagType1 );MB_CHK_ERR( rval ); // usually it is 16
}
Tag tagType2 = context.MBI->globalId_tag();
std::vector< int > valuesComp1;
// populate first tuple
Range ents_of_interest; // will be filled with entities on pid1, that need to be distributed,
// rearranged in split_ranges map
if( *pid1 >= 0 )
{
appData& data1 = context.appDatas[*pid1];
EntityHandle fset1 = data1.file_set;
if( *type == 1 )
{
assert( gdsTag );
rval = context.MBI->get_entities_by_type( fset1, MBQUAD, ents_of_interest );MB_CHK_ERR( rval );
valuesComp1.resize( ents_of_interest.size() * lenTagType1 );
rval = context.MBI->tag_get_data( gdsTag, ents_of_interest, &valuesComp1[0] );MB_CHK_ERR( rval );
}
else if( *type == 2 )
{
rval = context.MBI->get_entities_by_type( fset1, MBVERTEX, ents_of_interest );MB_CHK_ERR( rval );
valuesComp1.resize( ents_of_interest.size() );
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &valuesComp1[0] );MB_CHK_ERR( rval ); // just global ids
}
else if( *type == 3 ) // for FV meshes, just get the global id of cell
{
rval = context.MBI->get_entities_by_dimension( fset1, 2, ents_of_interest );MB_CHK_ERR( rval );
valuesComp1.resize( ents_of_interest.size() );
rval = context.MBI->tag_get_data( tagType2, ents_of_interest, &valuesComp1[0] );MB_CHK_ERR( rval ); // just global ids
}
else
{
MB_CHK_ERR( MB_FAILURE ); // we know only type 1 or 2 or 3
}
// now fill the tuple list with info and markers
// because we will send only the ids, order and compress the list
std::set< int > uniq( valuesComp1.begin(), valuesComp1.end() );
TLcomp1.resize( uniq.size() );
for( std::set< int >::iterator sit = uniq.begin(); sit != uniq.end(); sit++ )
{
// to proc, marker, element local index, index in el
int marker = *sit;
int to_proc = marker % numProcs;
int n = TLcomp1.get_n();
TLcomp1.vi_wr[2 * n] = to_proc; // send to processor
TLcomp1.vi_wr[2 * n + 1] = marker;
TLcomp1.inc_n();
}
}
ProcConfig pc( joint_communicator ); // proc config does the crystal router
pc.crystal_router()->gs_transfer( 1, TLcomp1,
0 ); // communication towards joint tasks, with markers
// sort by value (key 1)
#ifdef VERBOSE
std::stringstream ff1;
ff1 << "TLcomp1_" << localRank << ".txt";
TLcomp1.print_to_file( ff1.str().c_str() ); // it will append!
#endif
moab::TupleList::buffer sort_buffer;
sort_buffer.buffer_init( TLcomp1.get_n() );
TLcomp1.sort( 1, &sort_buffer );
sort_buffer.reset();
#ifdef VERBOSE
// after sorting
TLcomp1.print_to_file( ff1.str().c_str() ); // it will append!
#endif
// do the same, for the other component, number2, with type2
// start copy
TLcomp2.enableWriteAccess();
moab::TempestOnlineMap* weightMap = NULL; // declare it outside, but it will make sense only for *pid >= 0
// we know that :) (or *pid2 >= 0, it means we are on the coupler PEs, read map exists, and coupler procs exist)
// populate second tuple with ids from read map: we need row_gdofmap and col_gdofmap
std::vector< int > valuesComp2;
if( *pid2 >= 0 ) // we are now on coupler, map side
{
appData& data2 = context.appDatas[*pid2];
TempestMapAppData& tdata = data2.tempestData;
// should be only one map, read from file
assert( tdata.weightMaps.size() == 1 );
// maybe we need to check it is the map we expect
weightMap = tdata.weightMaps.begin()->second;
// std::vector<int> ids_of_interest;
// do a deep copy of the ids of interest: row ids or col ids, target or source direction
if( *direction == 1 )
{
// we are interested in col ids, source
// new method from moab::TempestOnlineMap
rval = weightMap->fill_col_ids( valuesComp2 );MB_CHK_ERR( rval );
}
else if( *direction == 2 )
{
// we are interested in row ids, for target ids
rval = weightMap->fill_row_ids( valuesComp2 );MB_CHK_ERR( rval );
}
//
// now fill the tuple list with info and markers
std::set< int > uniq( valuesComp2.begin(), valuesComp2.end() );
TLcomp2.resize( uniq.size() );
for( std::set< int >::iterator sit = uniq.begin(); sit != uniq.end(); sit++ )
{
// to proc, marker, element local index, index in el
int marker = *sit;
int to_proc = marker % numProcs;
int n = TLcomp2.get_n();
TLcomp2.vi_wr[2 * n] = to_proc; // send to processor
TLcomp2.vi_wr[2 * n + 1] = marker;
TLcomp2.inc_n();
}
}
pc.crystal_router()->gs_transfer( 1, TLcomp2,
0 ); // communication towards joint tasks, with markers
// sort by value (key 1)
// in the rendez-vous approach, markers meet at meet point (rendez-vous) processor marker % nprocs
#ifdef VERBOSE
std::stringstream ff2;
ff2 << "TLcomp2_" << localRank << ".txt";
TLcomp2.print_to_file( ff2.str().c_str() );
#endif
sort_buffer.buffer_reserve( TLcomp2.get_n() );
TLcomp2.sort( 1, &sort_buffer );
sort_buffer.reset();
// end copy
#ifdef VERBOSE
TLcomp2.print_to_file( ff2.str().c_str() );
#endif
// need to send back the info, from the rendezvous point, for each of the values
/* so go over each value, on local process in joint communicator,
now have to send back the info needed for communication;
loop in in sync over both TLComp1 and TLComp2, in local process;
So, build new tuple lists, to send synchronous communication
populate them at the same time, based on marker, that is indexed
*/
TupleList TLBackToComp1;
TLBackToComp1.initialize( 3, 0, 0, 0, 0 ); // to proc, marker, from proc on comp2,
TLBackToComp1.enableWriteAccess();
TupleList TLBackToComp2;
TLBackToComp2.initialize( 3, 0, 0, 0, 0 ); // to proc, marker, from proc,
TLBackToComp2.enableWriteAccess();
int n1 = TLcomp1.get_n();
int n2 = TLcomp2.get_n();
int indexInTLComp1 = 0;
int indexInTLComp2 = 0; // advance both, according to the marker
if( n1 > 0 && n2 > 0 )
{
while( indexInTLComp1 < n1 && indexInTLComp2 < n2 ) // if any is over, we are done
{
int currentValue1 = TLcomp1.vi_rd[2 * indexInTLComp1 + 1];
int currentValue2 = TLcomp2.vi_rd[2 * indexInTLComp2 + 1];
if( currentValue1 < currentValue2 )
{
// we have a big problem; basically, we are saying that
// dof currentValue is on one model and not on the other
// std::cout << " currentValue1:" << currentValue1 << " missing in comp2" << "\n";
indexInTLComp1++;
continue;
}
if( currentValue1 > currentValue2 )
{
// std::cout << " currentValue2:" << currentValue2 << " missing in comp1" << "\n";
indexInTLComp2++;
continue;
}
int size1 = 1;
int size2 = 1;
while( indexInTLComp1 + size1 < n1 && currentValue1 == TLcomp1.vi_rd[2 * ( indexInTLComp1 + size1 ) + 1] )
size1++;
while( indexInTLComp2 + size2 < n2 && currentValue2 == TLcomp2.vi_rd[2 * ( indexInTLComp2 + size2 ) + 1] )
size2++;
// must be found in both lists, find the start and end indices
for( int i1 = 0; i1 < size1; i1++ )
{
for( int i2 = 0; i2 < size2; i2++ )
{
// send the info back to components
int n = TLBackToComp1.get_n();
TLBackToComp1.reserve();
TLBackToComp1.vi_wr[3 * n] =
TLcomp1.vi_rd[2 * ( indexInTLComp1 + i1 )]; // send back to the proc marker
// came from, info from comp2
TLBackToComp1.vi_wr[3 * n + 1] = currentValue1; // initial value (resend?)
TLBackToComp1.vi_wr[3 * n + 2] = TLcomp2.vi_rd[2 * ( indexInTLComp2 + i2 )]; // from proc on comp2
n = TLBackToComp2.get_n();
TLBackToComp2.reserve();
TLBackToComp2.vi_wr[3 * n] =
TLcomp2.vi_rd[2 * ( indexInTLComp2 + i2 )]; // send back info to original
TLBackToComp2.vi_wr[3 * n + 1] = currentValue1; // initial value (resend?)
TLBackToComp2.vi_wr[3 * n + 2] = TLcomp1.vi_rd[2 * ( indexInTLComp1 + i1 )]; // from proc on comp1
// what if there are repeated markers in TLcomp2? increase just index2
}
}
indexInTLComp1 += size1;
indexInTLComp2 += size2;
}
}
pc.crystal_router()->gs_transfer( 1, TLBackToComp1, 0 ); // communication towards original tasks, with info about
pc.crystal_router()->gs_transfer( 1, TLBackToComp2, 0 );
TupleList TLv; // vertices
TupleList TLc; // cells if needed (not type 2)
if( *pid1 >= 0 )
{
// we are on original comp 1 tasks
// before ordering
// now for each value in TLBackToComp1.vi_rd[3*i+1], on current proc, we know the
// processors it communicates with
#ifdef VERBOSE
std::stringstream f1;
f1 << "TLBack1_" << localRank << ".txt";
TLBackToComp1.print_to_file( f1.str().c_str() );
#endif
// so we are now on pid1, we know now each marker were it has to go
// add a new method to ParCommGraph, to set up the split_ranges and involved_IDs_map
rval = cgraph->set_split_ranges( *comp1, TLBackToComp1, valuesComp1, lenTagType1, ents_of_interest, *type );MB_CHK_ERR( rval );
// we can just send vertices and elements, with crystal routers;
// on the receiving end, make sure they are not duplicated, by looking at the global id
// if *type is 1, also send global_dofs tag in the element tuple
rval = cgraph->form_tuples_to_migrate_mesh( context.MBI, TLv, TLc, *type, lenTagType1 );MB_CHK_ERR( rval );
}
pc.crystal_router()->gs_transfer( 1, TLv, 0 ); // communication towards coupler tasks, with mesh vertices
if( *type != 2 ) pc.crystal_router()->gs_transfer( 1, TLc, 0 ); // those are cells
if( *pid3 >= 0 ) // will receive the mesh, on coupler pes!
{
appData& data3 = context.appDatas[*pid3];
EntityHandle fset3 = data3.file_set;
Range primary_ents3; // vertices for type 2, cells of dim 2 for type 1 or 3
std::vector< int > values_entities; // will be the size of primary_ents3 * lenTagType1
rval = cgraph_rev->form_mesh_from_tuples( context.MBI, TLv, TLc, *type, lenTagType1, fset3, primary_ents3,
values_entities );MB_CHK_ERR( rval );
iMOAB_UpdateMeshInfo( pid3 );
int ndofPerEl = 1;
if( 1 == *type ) ndofPerEl = (int)( sqrt( lenTagType1 ) );
// because we are on the coupler, we know that the read map pid2 exists
assert( *pid2 >= 0 );
appData& dataIntx = context.appDatas[*pid2];
TempestMapAppData& tdata = dataIntx.tempestData;
// if we are on source coverage, direction 1, we can set covering mesh, covering cells
if( 1 == *direction )
{
tdata.pid_src = pid3;
tdata.remapper->SetMeshSet( Remapper::CoveringMesh, fset3, primary_ents3 );
weightMap->SetSourceNDofsPerElement( ndofPerEl );
weightMap->set_col_dc_dofs( values_entities ); // will set col_dtoc_dofmap
}
// if we are on target, we can set the target cells
else
{
tdata.pid_dest = pid3;
tdata.remapper->SetMeshSet( Remapper::TargetMesh, fset3, primary_ents3 );
weightMap->SetDestinationNDofsPerElement( ndofPerEl );
weightMap->set_row_dc_dofs( values_entities ); // will set row_dtoc_dofmap
}
}
return moab::MB_SUCCESS;
}
#endif // #ifdef MOAB_HAVE_MPI
#endif // #ifdef MOAB_HAVE_NETCDF
#define USE_API
static ErrCode ComputeSphereRadius( iMOAB_AppID pid, double* radius )
{
ErrorCode rval;
moab::CartVect pos;
Range& verts = context.appDatas[*pid].all_verts;
moab::EntityHandle firstVertex = ( verts[0] );
// coordinate data
rval = context.MBI->get_coords( &( firstVertex ), 1, (double*)&( pos[0] ) );MB_CHK_ERR( rval );
// compute the distance from origin
// TODO: we could do this in a loop to verify if the pid represents a spherical mesh
*radius = pos.length();
return moab::MB_SUCCESS;
}
ErrCode iMOAB_ComputeMeshIntersectionOnSphere( iMOAB_AppID pid_src, iMOAB_AppID pid_tgt, iMOAB_AppID pid_intx )
{
ErrorCode rval;
ErrCode ierr;
bool validate = true;
double radius_source = 1.0;
double radius_target = 1.0;
const double epsrel = ReferenceTolerance; // ReferenceTolerance is defined in Defines.h in tempestremap source ;
const double boxeps = 1.e-6;
// Get the source and target data and pcomm objects
appData& data_src = context.appDatas[*pid_src];
appData& data_tgt = context.appDatas[*pid_tgt];
appData& data_intx = context.appDatas[*pid_intx];
#ifdef MOAB_HAVE_MPI
ParallelComm* pco_intx = context.pcomms[*pid_intx];
#endif
// Mesh intersection has already been computed; Return early.
TempestMapAppData& tdata = data_intx.tempestData;
if( tdata.remapper != NULL ) return moab::MB_SUCCESS; // nothing to do
bool is_parallel = false, is_root = true;
int rank = 0;
#ifdef MOAB_HAVE_MPI
if( pco_intx )
{
rank = pco_intx->rank();
is_parallel = ( pco_intx->size() > 1 );
is_root = ( rank == 0 );
rval = pco_intx->check_all_shared_handles();MB_CHK_ERR( rval );
}
#endif
moab::DebugOutput outputFormatter( std::cout, rank, 0 );
outputFormatter.set_prefix( "[iMOAB_ComputeMeshIntersectionOnSphere]: " );
ierr = iMOAB_UpdateMeshInfo( pid_src );MB_CHK_ERR( ierr );
ierr = iMOAB_UpdateMeshInfo( pid_tgt );MB_CHK_ERR( ierr );
// Rescale the radius of both to compute the intersection
ComputeSphereRadius( pid_src, &radius_source );
ComputeSphereRadius( pid_tgt, &radius_target );
#ifdef VERBOSE
if( is_root )
outputFormatter.printf( 0, "Radius of spheres: source = %12.14f, and target = %12.14f\n", radius_source,
radius_target );
#endif
/* Let make sure that the radius match for source and target meshes. If not, rescale now and
* unscale later. */
double defaultradius = 1.0;
if( fabs( radius_source - radius_target ) > 1e-10 )
{ /* the radii are different */
rval = IntxUtils::ScaleToRadius( context.MBI, data_src.file_set, defaultradius );MB_CHK_ERR( rval );
rval = IntxUtils::ScaleToRadius( context.MBI, data_tgt.file_set, defaultradius );MB_CHK_ERR( rval );
}
// Default area_method = lHuiller; Options: Girard, GaussQuadrature (if TR is available)
#ifdef MOAB_HAVE_TEMPESTREMAP
IntxAreaUtils areaAdaptor( IntxAreaUtils::GaussQuadrature );
#else
IntxAreaUtils areaAdaptor( IntxAreaUtils::lHuiller );
#endif
// print verbosely about the problem setting
bool use_kdtree_search = false;
double srctgt_areas[2], srctgt_areas_glb[2];
{
moab::Range rintxverts, rintxelems;
rval = context.MBI->get_entities_by_dimension( data_src.file_set, 0, rintxverts );MB_CHK_ERR( rval );
rval = context.MBI->get_entities_by_dimension( data_src.file_set, data_src.dimension, rintxelems );MB_CHK_ERR( rval );
rval = IntxUtils::fix_degenerate_quads( context.MBI, data_src.file_set );MB_CHK_ERR( rval );
rval = areaAdaptor.positive_orientation( context.MBI, data_src.file_set, defaultradius /*radius_source*/ );MB_CHK_ERR( rval );
srctgt_areas[0] = areaAdaptor.area_on_sphere( context.MBI, data_src.file_set, defaultradius /*radius_source*/ );
#ifdef VERBOSE
if( is_root )
outputFormatter.printf( 0, "The red set contains %d vertices and %d elements \n", rintxverts.size(),
rintxelems.size() );
#endif
moab::Range bintxverts, bintxelems;
rval = context.MBI->get_entities_by_dimension( data_tgt.file_set, 0, bintxverts );MB_CHK_ERR( rval );
rval = context.MBI->get_entities_by_dimension( data_tgt.file_set, data_tgt.dimension, bintxelems );MB_CHK_ERR( rval );
rval = IntxUtils::fix_degenerate_quads( context.MBI, data_tgt.file_set );MB_CHK_ERR( rval );
rval = areaAdaptor.positive_orientation( context.MBI, data_tgt.file_set, defaultradius /*radius_target*/ );MB_CHK_ERR( rval );
srctgt_areas[1] = areaAdaptor.area_on_sphere( context.MBI, data_tgt.file_set, defaultradius /*radius_target*/ );
#ifdef VERBOSE
if( is_root )
outputFormatter.printf( 0, "The blue set contains %d vertices and %d elements \n", bintxverts.size(),
bintxelems.size() );
#endif
#ifdef MOAB_HAVE_MPI
MPI_Allreduce( &srctgt_areas[0], &srctgt_areas_glb[0], 2, MPI_DOUBLE, MPI_SUM, pco_intx->comm() );
#else
srctgt_areas_glb[0] = srctgt_areas[0];
srctgt_areas_glb[1] = srctgt_areas[1];
#endif
use_kdtree_search = ( srctgt_areas_glb[0] < srctgt_areas_glb[1] );
}
data_intx.dimension = data_tgt.dimension;
// set the context for the source and destination applications
tdata.pid_src = pid_src;
tdata.pid_dest = pid_tgt;
// Now allocate and initialize the remapper object
#ifdef MOAB_HAVE_MPI
tdata.remapper = new moab::TempestRemapper( context.MBI, pco_intx );
#else
tdata.remapper = new moab::TempestRemapper( context.MBI );
#endif
tdata.remapper->meshValidate = true;
tdata.remapper->constructEdgeMap = true;
// Do not create new filesets; Use the sets from our respective applications
tdata.remapper->initialize( false );
tdata.remapper->GetMeshSet( moab::Remapper::SourceMesh ) = data_src.file_set;
tdata.remapper->GetMeshSet( moab::Remapper::TargetMesh ) = data_tgt.file_set;
tdata.remapper->GetMeshSet( moab::Remapper::OverlapMesh ) = data_intx.file_set;
rval = tdata.remapper->ConvertMeshToTempest( moab::Remapper::SourceMesh );MB_CHK_ERR( rval );
rval = tdata.remapper->ConvertMeshToTempest( moab::Remapper::TargetMesh );MB_CHK_ERR( rval );
// First, compute the covering source set.
rval = tdata.remapper->ConstructCoveringSet( epsrel, 1.0, 1.0, boxeps, false );MB_CHK_ERR( rval );
// Next, compute intersections with MOAB.
rval = tdata.remapper->ComputeOverlapMesh( use_kdtree_search, false );MB_CHK_ERR( rval );
// Mapping computation done
if( validate )
{
double local_area,
global_areas[3]; // Array for Initial area, and through Method 1 and Method 2
local_area = areaAdaptor.area_on_sphere( context.MBI, data_intx.file_set, radius_source );
global_areas[0] = srctgt_areas_glb[0];
global_areas[1] = srctgt_areas_glb[1];
#ifdef MOAB_HAVE_MPI
if( is_parallel )
{
MPI_Reduce( &local_area, &global_areas[2], 1, MPI_DOUBLE, MPI_SUM, 0, pco_intx->comm() );
}
else
{
global_areas[2] = local_area;
}
#else
global_areas[2] = local_area;
#endif
if( is_root )
{
outputFormatter.printf( 0,
"initial area: source mesh = %12.14f, target mesh = %12.14f, "
"overlap mesh = %12.14f\n",
global_areas[0], global_areas[1], global_areas[2] );
outputFormatter.printf( 0, " relative error w.r.t source = %12.14e, and target = %12.14e\n",
fabs( global_areas[0] - global_areas[2] ) / global_areas[0],
fabs( global_areas[1] - global_areas[2] ) / global_areas[1] );
}
}
return moab::MB_SUCCESS;
}
ErrCode iMOAB_ComputePointDoFIntersection( iMOAB_AppID pid_src, iMOAB_AppID pid_tgt, iMOAB_AppID pid_intx )
{
ErrorCode rval;
ErrCode ierr;
double radius_source = 1.0;
double radius_target = 1.0;
const double epsrel = ReferenceTolerance; // ReferenceTolerance is defined in Defines.h in tempestremap source ;
const double boxeps = 1.e-8;
// Get the source and target data and pcomm objects
appData& data_src = context.appDatas[*pid_src];
appData& data_tgt = context.appDatas[*pid_tgt];
appData& data_intx = context.appDatas[*pid_intx];
#ifdef MOAB_HAVE_MPI
ParallelComm* pco_intx = context.pcomms[*pid_intx];
#endif
// Mesh intersection has already been computed; Return early.
TempestMapAppData& tdata = data_intx.tempestData;
if( tdata.remapper != NULL ) return moab::MB_SUCCESS; // nothing to do
#ifdef MOAB_HAVE_MPI
if( pco_intx )
{
rval = pco_intx->check_all_shared_handles();MB_CHK_ERR( rval );
}
#endif
ierr = iMOAB_UpdateMeshInfo( pid_src );MB_CHK_ERR( ierr );
ierr = iMOAB_UpdateMeshInfo( pid_tgt );MB_CHK_ERR( ierr );
// Rescale the radius of both to compute the intersection
ComputeSphereRadius( pid_src, &radius_source );
ComputeSphereRadius( pid_tgt, &radius_target );
IntxAreaUtils areaAdaptor;
// print verbosely about the problem setting
{
moab::Range rintxverts, rintxelems;
rval = context.MBI->get_entities_by_dimension( data_src.file_set, 0, rintxverts );MB_CHK_ERR( rval );
rval = context.MBI->get_entities_by_dimension( data_src.file_set, 2, rintxelems );MB_CHK_ERR( rval );
rval = IntxUtils::fix_degenerate_quads( context.MBI, data_src.file_set );MB_CHK_ERR( rval );
rval = areaAdaptor.positive_orientation( context.MBI, data_src.file_set, radius_source );MB_CHK_ERR( rval );
#ifdef VERBOSE
std::cout << "The red set contains " << rintxverts.size() << " vertices and " << rintxelems.size()
<< " elements \n";
#endif
moab::Range bintxverts, bintxelems;
rval = context.MBI->get_entities_by_dimension( data_tgt.file_set, 0, bintxverts );MB_CHK_ERR( rval );
rval = context.MBI->get_entities_by_dimension( data_tgt.file_set, 2, bintxelems );MB_CHK_ERR( rval );
rval = IntxUtils::fix_degenerate_quads( context.MBI, data_tgt.file_set );MB_CHK_ERR( rval );
rval = areaAdaptor.positive_orientation( context.MBI, data_tgt.file_set, radius_target );MB_CHK_ERR( rval );
#ifdef VERBOSE
std::cout << "The blue set contains " << bintxverts.size() << " vertices and " << bintxelems.size()
<< " elements \n";
#endif
}
data_intx.dimension = data_tgt.dimension;
// set the context for the source and destination applications
// set the context for the source and destination applications
tdata.pid_src = pid_src;
tdata.pid_dest = pid_tgt;
data_intx.point_cloud = ( data_src.point_cloud || data_tgt.point_cloud );
assert( data_intx.point_cloud == true );
// Now allocate and initialize the remapper object
#ifdef MOAB_HAVE_MPI
tdata.remapper = new moab::TempestRemapper( context.MBI, pco_intx );
#else
tdata.remapper = new moab::TempestRemapper( context.MBI );
#endif
tdata.remapper->meshValidate = true;
tdata.remapper->constructEdgeMap = true;
// Do not create new filesets; Use the sets from our respective applications
tdata.remapper->initialize( false );
tdata.remapper->GetMeshSet( moab::Remapper::SourceMesh ) = data_src.file_set;
tdata.remapper->GetMeshSet( moab::Remapper::TargetMesh ) = data_tgt.file_set;
tdata.remapper->GetMeshSet( moab::Remapper::OverlapMesh ) = data_intx.file_set;
/* Let make sure that the radius match for source and target meshes. If not, rescale now and
* unscale later. */
if( fabs( radius_source - radius_target ) > 1e-10 )
{ /* the radii are different */
rval = IntxUtils::ScaleToRadius( context.MBI, data_src.file_set, 1.0 );MB_CHK_ERR( rval );
rval = IntxUtils::ScaleToRadius( context.MBI, data_tgt.file_set, 1.0 );MB_CHK_ERR( rval );
}
rval = tdata.remapper->ConvertMeshToTempest( moab::Remapper::SourceMesh );MB_CHK_ERR( rval );
rval = tdata.remapper->ConvertMeshToTempest( moab::Remapper::TargetMesh );MB_CHK_ERR( rval );
// First, compute the covering source set.
rval = tdata.remapper->ConstructCoveringSet( epsrel, 1.0, 1.0, boxeps, false );MB_CHK_ERR( rval );
#ifdef MOAB_HAVE_MPI
/* VSM: This context should be set on the data_src but it would overwrite the source
covering set context in case it is coupled to another APP as well.
This needs a redesign. */
// data_intx.covering_set = tdata.remapper->GetCoveringSet();
// data_src.covering_set = tdata.remapper->GetCoveringSet();
#endif
// Now let us re-convert the MOAB mesh back to Tempest representation
rval = tdata.remapper->ComputeGlobalLocalMaps();MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_ComputeScalarProjectionWeights(
iMOAB_AppID pid_intx,
const iMOAB_String solution_weights_identifier, /* "scalar", "flux", "custom" */
const iMOAB_String disc_method_source,
int* disc_order_source,
const iMOAB_String disc_method_target,
int* disc_order_target,
int* fNoBubble,
int* fMonotoneTypeID,
int* fVolumetric,
int* fInverseDistanceMap,
int* fNoConservation,
int* fValidate,
const iMOAB_String source_solution_tag_dof_name,
const iMOAB_String target_solution_tag_dof_name )
{
moab::ErrorCode rval;
assert( disc_order_source && disc_order_target && *disc_order_source > 0 && *disc_order_target > 0 );
assert( solution_weights_identifier && strlen( solution_weights_identifier ) );
assert( disc_method_source && strlen( disc_method_source ) );
assert( disc_method_target && strlen( disc_method_target ) );
assert( source_solution_tag_dof_name && strlen( source_solution_tag_dof_name ) );
assert( target_solution_tag_dof_name && strlen( target_solution_tag_dof_name ) );
// Get the source and target data and pcomm objects
appData& data_intx = context.appDatas[*pid_intx];
TempestMapAppData& tdata = data_intx.tempestData;
// Setup computation of weights
// Set the context for the remapping weights computation
tdata.weightMaps[std::string( solution_weights_identifier )] = new moab::TempestOnlineMap( tdata.remapper );
// Call to generate the remap weights with the tempest meshes
moab::TempestOnlineMap* weightMap = tdata.weightMaps[std::string( solution_weights_identifier )];
assert( weightMap != NULL );
GenerateOfflineMapAlgorithmOptions mapOptions;
mapOptions.nPin = *disc_order_source;
mapOptions.nPout = *disc_order_target;
mapOptions.fSourceConcave = false;
mapOptions.fTargetConcave = false;
mapOptions.strMethod = "";
if( fMonotoneTypeID )
{
switch( *fMonotoneTypeID )
{
case 0:
mapOptions.fMonotone = false;
break;
case 3:
mapOptions.strMethod += "mono3;";
break;
case 2:
mapOptions.strMethod += "mono2;";
break;
default:
mapOptions.fMonotone = true;
}
}
else
mapOptions.fMonotone = false;
mapOptions.fNoBubble = ( fNoBubble ? *fNoBubble : false );
mapOptions.fNoConservation = ( fNoConservation ? *fNoConservation > 0 : false );
mapOptions.fNoCorrectAreas = false;
mapOptions.fNoCheck = !( fValidate ? *fValidate : true );
if( fVolumetric && *fVolumetric ) mapOptions.strMethod += "volumetric;";
if( fInverseDistanceMap && *fInverseDistanceMap ) mapOptions.strMethod += "invdist;";
// Now let us compute the local-global mapping and store it in the context
// We need this mapping when computing matvec products and to do reductions in parallel
// Additionally, the call below will also compute weights with TempestRemap
rval = weightMap->GenerateRemappingWeights(
std::string( disc_method_source ), // const std::string& strInputType
std::string( disc_method_target ), // const std::string& strOutputType
mapOptions, // GenerateOfflineMapAlgorithmOptions& mapOptions
std::string( source_solution_tag_dof_name ), // const std::string& srcDofTagName = "GLOBAL_ID"
std::string( target_solution_tag_dof_name ) // const std::string& tgtDofTagName = "GLOBAL_ID"
);MB_CHK_ERR( rval );
return moab::MB_SUCCESS;
}
ErrCode iMOAB_ApplyScalarProjectionWeights(
iMOAB_AppID pid_intersection,
const iMOAB_String solution_weights_identifier, /* "scalar", "flux", "custom" */
const iMOAB_String source_solution_tag_name,
const iMOAB_String target_solution_tag_name )
{
assert( solution_weights_identifier && strlen( solution_weights_identifier ) );
assert( source_solution_tag_name && strlen( source_solution_tag_name ) );
assert( target_solution_tag_name && strlen( target_solution_tag_name ) );
moab::ErrorCode rval;
// Get the source and target data and pcomm objects
appData& data_intx = context.appDatas[*pid_intersection];
TempestMapAppData& tdata = data_intx.tempestData;
// Now allocate and initialize the remapper object
moab::TempestRemapper* remapper = tdata.remapper;
moab::TempestOnlineMap* weightMap = tdata.weightMaps[std::string( solution_weights_identifier )];
// we assume that there are separators ";" between the tag names
std::vector< std::string > srcNames;
std::vector< std::string > tgtNames;
std::vector< Tag > srcTagHandles;
std::vector< Tag > tgtTagHandles;
std::string separator( ":" );
std::string src_name( source_solution_tag_name );
std::string tgt_name( target_solution_tag_name );
split_tag_names( src_name, separator, srcNames );
split_tag_names( tgt_name, separator, tgtNames );
if( srcNames.size() != tgtNames.size() )
{
std::cout << " error in parsing source and target tag names. \n";
return moab::MB_FAILURE;
}
for( size_t i = 0; i < srcNames.size(); i++ )
{
Tag tagHandle;
rval = context.MBI->tag_get_handle( srcNames[i].c_str(), tagHandle );
if( MB_SUCCESS != rval || NULL == tagHandle )
{
return moab::MB_FAILURE;
}
srcTagHandles.push_back( tagHandle );
rval = context.MBI->tag_get_handle( tgtNames[i].c_str(), tagHandle );
if( MB_SUCCESS != rval || NULL == tagHandle )
{
return moab::MB_FAILURE;
}
tgtTagHandles.push_back( tagHandle );
}
std::vector< double > solSTagVals;
std::vector< double > solTTagVals;
moab::Range sents, tents;
if( data_intx.point_cloud )
{
appData& data_src = context.appDatas[*tdata.pid_src];
appData& data_tgt = context.appDatas[*tdata.pid_dest];
if( data_src.point_cloud )
{
moab::Range& covSrcEnts = remapper->GetMeshVertices( moab::Remapper::CoveringMesh );
solSTagVals.resize( covSrcEnts.size(), -1.0 );
sents = covSrcEnts;
}
else
{
moab::Range& covSrcEnts = remapper->GetMeshEntities( moab::Remapper::CoveringMesh );
solSTagVals.resize( covSrcEnts.size() * weightMap->GetSourceNDofsPerElement() *
weightMap->GetSourceNDofsPerElement(),
-1.0 );
sents = covSrcEnts;
}
if( data_tgt.point_cloud )
{
moab::Range& tgtEnts = remapper->GetMeshVertices( moab::Remapper::TargetMesh );
solTTagVals.resize( tgtEnts.size(), -1.0 );
tents = tgtEnts;
}
else
{
moab::Range& tgtEnts = remapper->GetMeshEntities( moab::Remapper::TargetMesh );
solTTagVals.resize( tgtEnts.size() * weightMap->GetDestinationNDofsPerElement() *
weightMap->GetDestinationNDofsPerElement(),
-1.0 );
tents = tgtEnts;
}
}
else
{
moab::Range& covSrcEnts = remapper->GetMeshEntities( moab::Remapper::CoveringMesh );
moab::Range& tgtEnts = remapper->GetMeshEntities( moab::Remapper::TargetMesh );
solSTagVals.resize(
covSrcEnts.size() * weightMap->GetSourceNDofsPerElement() * weightMap->GetSourceNDofsPerElement(), -1.0 );
solTTagVals.resize( tgtEnts.size() * weightMap->GetDestinationNDofsPerElement() *
weightMap->GetDestinationNDofsPerElement(),
-1.0 );
sents = covSrcEnts;
tents = tgtEnts;
}
for( size_t i = 0; i < srcTagHandles.size(); i++ )
{
// The tag data is np*np*n_el_src
Tag ssolnTag = srcTagHandles[i];
Tag tsolnTag = tgtTagHandles[i];
rval = context.MBI->tag_get_data( ssolnTag, sents, &solSTagVals[0] );MB_CHK_ERR( rval );
// Compute the application of weights on the suorce solution data and store it in the
// destination solution vector data Optionally, can also perform the transpose application
// of the weight matrix. Set the 3rd argument to true if this is needed
rval = weightMap->ApplyWeights( solSTagVals, solTTagVals, false );MB_CHK_ERR( rval );
// The tag data is np*np*n_el_dest
rval = context.MBI->tag_set_data( tsolnTag, tents, &solTTagVals[0] );MB_CHK_ERR( rval );
}
// #define VERBOSE
#ifdef VERBOSE
ParallelComm* pco_intx = context.pcomms[*pid_intersection];
int ivar = 0;
{
Tag ssolnTag = srcTagHandles[ivar];
std::stringstream sstr;
sstr << "covsrcTagData_" << *pid_intersection << "_" << ivar << "_" << pco_intx->rank() << ".txt";
std::ofstream output_file( sstr.str().c_str() );
for( unsigned i = 0; i < sents.size(); ++i )
{
EntityHandle elem = sents[i];
std::vector< double > locsolSTagVals( 16 );
rval = context.MBI->tag_get_data( ssolnTag, &elem, 1, &locsolSTagVals[0] );MB_CHK_ERR( rval );
output_file << "\n" << remapper->GetGlobalID( Remapper::CoveringMesh, i ) << "-- \n\t";
for( unsigned j = 0; j < 16; ++j )
output_file << locsolSTagVals[j] << " ";
}
output_file.flush(); // required here
output_file.close();
}
{
std::stringstream sstr;
sstr << "outputSrcDest_" << *pid_intersection << "_" << ivar << "_" << pco_intx->rank() << ".h5m";
EntityHandle sets[2] = { context.appDatas[*tdata.pid_src].file_set,
context.appDatas[*tdata.pid_dest].file_set };
rval = context.MBI->write_file( sstr.str().c_str(), NULL, "", sets, 2 );MB_CHK_ERR( rval );
}
{
std::stringstream sstr;
sstr << "outputCovSrcDest_" << *pid_intersection << "_" << ivar << "_" << pco_intx->rank() << ".h5m";
// EntityHandle sets[2] = {data_intx.file_set, data_intx.covering_set};
EntityHandle covering_set = remapper->GetCoveringSet();
EntityHandle sets[2] = { covering_set, context.appDatas[*tdata.pid_dest].file_set };
rval = context.MBI->write_file( sstr.str().c_str(), NULL, "", sets, 2 );MB_CHK_ERR( rval );
}
{
std::stringstream sstr;
sstr << "covMesh_" << *pid_intersection << "_" << pco_intx->rank() << ".vtk";
// EntityHandle sets[2] = {data_intx.file_set, data_intx.covering_set};
EntityHandle covering_set = remapper->GetCoveringSet();
rval = context.MBI->write_file( sstr.str().c_str(), NULL, "", &covering_set, 1 );MB_CHK_ERR( rval );
}
{
std::stringstream sstr;
sstr << "tgtMesh_" << *pid_intersection << "_" << pco_intx->rank() << ".vtk";
// EntityHandle sets[2] = {data_intx.file_set, data_intx.covering_set};
EntityHandle target_set = remapper->GetMeshSet( Remapper::TargetMesh );
rval = context.MBI->write_file( sstr.str().c_str(), NULL, "", &target_set, 1 );MB_CHK_ERR( rval );
}
{
std::stringstream sstr;
sstr << "colvector_" << *pid_intersection << "_" << ivar << "_" << pco_intx->rank() << ".txt";
std::ofstream output_file( sstr.str().c_str() );
for( unsigned i = 0; i < solSTagVals.size(); ++i )
output_file << i << " " << weightMap->col_dofmap[i] << " " << weightMap->col_gdofmap[i] << " "
<< solSTagVals[i] << "\n";
output_file.flush(); // required here
output_file.close();
}
#endif
// #undef VERBOSE
return moab::MB_SUCCESS;
}
#endif // MOAB_HAVE_TEMPESTREMAP
#ifdef __cplusplus
}
#endif
|