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
|
<center><a href="ParallelMapping.hh">Actual source code: ParallelMapping.hh</a></center><br>
<html>
<head>
<title></title>
<meta name="generator" content="c2html 0.9.5">
<meta name="date" content="2010-04-08T19:57:40+00:00">
</head>
<body bgcolor="#FFFFFF">
<pre width="80"><a name="line1"> 1: </a><font color="#A020F0">#ifndef included_ALE_ParallelMapping_hh</font>
<a name="line2"> 2: </a><strong><font color="#228B22">#define included_ALE_ParallelMapping_hh</font></strong>
<a name="line4"> 4: </a><font color="#A020F0">#ifndef included_ALE_IField_hh</font>
<a name="line5"> 5: </a><font color="#A020F0">#include <IField.hh></font>
<a name="line6"> 6: </a><font color="#A020F0">#endif</font>
<a name="line8"> 8: </a><font color="#A020F0">#ifndef included_ALE_Sections_hh</font>
<a name="line9"> 9: </a><font color="#A020F0">#include <Sections.hh></font>
<a name="line10"> 10: </a><font color="#A020F0">#endif</font>
<a name="line12"> 12: </a><font color="#A020F0">#include <functional></font>
<a name="line16"> 16: </a>namespace ALE {
<a name="line17"> 17: </a> template<class _Tp>
<a name="line18"> 18: </a> <font color="#4169E1">struct Identity</font> : public std::unary_function<_Tp,_Tp>
<a name="line19"> 19: </a> {
<a name="line20"> 20: </a> _Tp& operator()(_Tp& x) const {<font color="#4169E1">return</font> x;}
<a name="line21"> 21: </a> const _Tp& operator()(const _Tp& x) const {<font color="#4169E1">return</font> x;}
<a name="line22"> 22: </a> };
<a name="line24"> 24: </a> template<class _Tp>
<a name="line25"> 25: </a> <font color="#4169E1">struct IsEqual</font> : public std::unary_function<_Tp, bool>, public std::binary_function<_Tp, _Tp, bool>
<a name="line26"> 26: </a> {
<a name="line27"> 27: </a> const _Tp& x;
<a name="line28"> 28: </a> IsEqual(const _Tp& x) : x(x) {};
<a name="line29"> 29: </a> bool operator()(_Tp& y) const {<font color="#4169E1">return</font> x == y;}
<a name="line30"> 30: </a> const bool operator()(const _Tp& y) const {<font color="#4169E1">return</font> x == y;}
<a name="line31"> 31: </a> bool operator()(_Tp& y, _Tp& dummy) const {<font color="#4169E1">return</font> x == y;}
<a name="line32"> 32: </a> const bool operator()(const _Tp& y, const _Tp& dummy) const {<font color="#4169E1">return</font> x == y;}
<a name="line33"> 33: </a> };
<a name="line35"> 35: </a> // Creates new global point names and renames local points globally
<a name="line36"> 36: </a> template<typename Point>
<a name="line37"> 37: </a> class PointFactory : ALE::ParallelObject {
<a name="line38"> 38: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line39"> 39: </a> <font color="#4169E1">typedef</font> Point point_type;
<a name="line40"> 40: </a> <font color="#4169E1">typedef</font> std::map<point_type,point_type> renumbering_type;
<a name="line41"> 41: </a> <font color="#4169E1">typedef</font> std::map<int,std::map<point_type,point_type> > remote_renumbering_type;
<a name="line42"> 42: </a><strong><font color="#FF0000"> protected:</font></strong>
<a name="line43"> 43: </a> point_type originalMax;
<a name="line44"> 44: </a> point_type currentMax;
<a name="line45"> 45: </a> renumbering_type renumbering;
<a name="line46"> 46: </a> renumbering_type invRenumbering;
<a name="line47"> 47: </a> remote_renumbering_type remoteRenumbering;
<a name="line48"> 48: </a><strong><font color="#FF0000"> protected:</font></strong>
<a name="line49"> 49: </a> PointFactory(<A href="../../docs/manualpages/Sys/MPI_Comm.html#MPI_Comm">MPI_Comm</A> comm, const int debug = 0) : ALE::ParallelObject(comm, debug), originalMax(-1) {};
<a name="line50"> 50: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line51"> 51: </a> ~PointFactory() {};
<a name="line52"> 52: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line53"> 53: </a> static PointFactory& singleton(<A href="../../docs/manualpages/Sys/MPI_Comm.html#MPI_Comm">MPI_Comm</A> comm, const point_type& maxPoint, const int debug = 0, bool cleanup = false) {
<a name="line54"> 54: </a> static PointFactory *_singleton = NULL;
<a name="line56"> 56: </a> <font color="#4169E1">if</font> (cleanup) {
<a name="line57"> 57: </a> <font color="#4169E1">if</font> (debug) {std::cout << <font color="#666666">"Destroying PointFactory"</font> << std::endl;}
<a name="line58"> 58: </a> <font color="#4169E1">if</font> (_singleton) {delete _singleton;}
<a name="line59"> 59: </a> _singleton = NULL;
<a name="line60"> 60: </a> } <font color="#4169E1">else</font> <font color="#4169E1">if</font> (_singleton == NULL) {
<a name="line61"> 61: </a> <font color="#4169E1">if</font> (debug) {std::cout << <font color="#666666">"Creating new PointFactory"</font> << std::endl;}
<a name="line62"> 62: </a> _singleton = new PointFactory(comm, debug);
<a name="line63"> 63: </a> _singleton->setMax(maxPoint);
<a name="line64"> 64: </a> }
<a name="line65"> 65: </a> <font color="#4169E1">return</font> *_singleton;
<a name="line66"> 66: </a> };
<a name="line67"> 67: </a> void setMax(const point_type& maxPoint) {
<a name="line68"> 68: </a> <A href="../../docs/manualpages/Sys/PetscErrorCode.html#PetscErrorCode">PetscErrorCode</A> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Allreduce.html#MPI_Allreduce">MPI_Allreduce</A>((void *) &maxPoint, &this->originalMax, 1, MPI_INT, MPI_MAX, this->comm());<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line69"> 69: </a> ++this->originalMax;
<a name="line70"> 70: </a> this->currentMax = this->originalMax;
<a name="line71"> 71: </a> };
<a name="line72"> 72: </a> void clear() {
<a name="line73"> 73: </a> this->currentMax = this->originalMax;
<a name="line74"> 74: </a> this->renumbering.clear();
<a name="line75"> 75: </a> this->invRenumbering.clear();
<a name="line76"> 76: </a> };
<a name="line77"> 77: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line78"> 78: </a> template<typename Iterator>
<a name="line79"> 79: </a> void renumberPoints(const Iterator& begin, const Iterator& end) {
<a name="line80"> 80: </a> renumberPoints(begin, end, Identity<typename Iterator::value_type>());
<a name="line81"> 81: </a> };
<a name="line82"> 82: </a> template<typename Iterator, typename KeyExtractor>
<a name="line83"> 83: </a> void renumberPoints(const Iterator& begin, const Iterator& end, const KeyExtractor& ex) {
<a name="line84"> 84: </a> int numPoints = 0, numGlobalPoints, firstPoint;
<a name="line86"> 86: </a> <font color="#4169E1">for</font>(Iterator p_iter = begin; p_iter != end; ++p_iter) ++numPoints;
<a name="line87"> 87: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Allreduce.html#MPI_Allreduce">MPI_Allreduce</A>(&numPoints, &numGlobalPoints, 1, MPI_INT, MPI_SUM, this->comm());
<a name="line88"> 88: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Scan.html#MPI_Scan">MPI_Scan</A>(&numPoints, &firstPoint, 1, MPI_INT, MPI_SUM, this->comm());
<a name="line89"> 89: </a> firstPoint += this->currentMax - numPoints;
<a name="line90"> 90: </a> this->currentMax += numGlobalPoints;
<a name="line91"> 91: </a> <font color="#4169E1">for</font>(Iterator p_iter = begin; p_iter != end; ++p_iter, ++firstPoint) {
<a name="line92"> 92: </a> <font color="#4169E1">if</font> (this->debug()) {std::cout << <font color="#666666">"["</font><<this->commRank()<<<font color="#666666">"]: New point "</font> << ex(*p_iter) << <font color="#666666">" --> "</font> << firstPoint << std::endl;}
<a name="line93"> 93: </a> this->renumbering[firstPoint] = ex(*p_iter);
<a name="line94"> 94: </a> this->invRenumbering[ex(*p_iter)] = firstPoint;
<a name="line95"> 95: </a> }
<a name="line96"> 96: </a> };
<a name="line97"> 97: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line98"> 98: </a> void constructRemoteRenumbering() {
<a name="line99"> 99: </a> const int localSize = this->renumbering.size();
<a name="line100">100: </a> int *remoteSizes = new int[this->commSize()];
<a name="line101">101: </a> int *localMap = new int[localSize*2];
<a name="line102">102: </a> int *recvCounts = new int[this->commSize()];
<a name="line103">103: </a> int *displs = new int[this->commSize()];
<a name="line105">105: </a> // Populate arrays
<a name="line106">106: </a> int r = 0;
<a name="line107">107: </a> <font color="#4169E1">for</font>(typename renumbering_type::const_iterator r_iter = renumbering.begin(); r_iter != renumbering.end(); ++r_iter, ++r) {
<a name="line108">108: </a> localMap[r*2+0] = r_iter->first;
<a name="line109">109: </a> localMap[r*2+1] = r_iter->second;
<a name="line110">110: </a> }
<a name="line111">111: </a> // Communicate renumbering sizes
<a name="line112">112: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Allgather.html#MPI_Allgather">MPI_Allgather</A>((void*) &localSize, 1, MPI_INT, remoteSizes, 1, MPI_INT, this->comm());
<a name="line113">113: </a> <font color="#4169E1">for</font>(int p = 0; p < this->commSize(); ++p) {
<a name="line114">114: </a> recvCounts[p] = remoteSizes[p]*2;
<a name="line115">115: </a> <font color="#4169E1">if</font> (p == 0) {
<a name="line116">116: </a> displs[p] = 0;
<a name="line117">117: </a> } <font color="#4169E1">else</font> {
<a name="line118">118: </a> displs[p] = displs[p-1] + recvCounts[p-1];
<a name="line119">119: </a> }
<a name="line120">120: </a> }
<a name="line121">121: </a> int *remoteMaps = new int[displs[this->commSize()-1]+recvCounts[this->commSize()-1]];
<a name="line122">122: </a> // Communicate renumberings
<a name="line123">123: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Allgatherv.html#MPI_Allgatherv">MPI_Allgatherv</A>(localMap, localSize*2, MPI_INT, remoteMaps, recvCounts, displs, MPI_INT, this->comm());
<a name="line124">124: </a> // Populate maps
<a name="line125">125: </a> <font color="#4169E1">for</font>(int p = 0; p < this->commSize(); ++p) {
<a name="line126">126: </a> <font color="#4169E1">if</font> (p == this->commRank()) <font color="#4169E1">continue</font>;
<a name="line127">127: </a> int offset = displs[p];
<a name="line129">129: </a> <font color="#4169E1">for</font>(int r = 0; r < remoteSizes[p]; ++r) {
<a name="line130">130: </a> this->remoteRenumbering[p][remoteMaps[r*2+0+offset]] = remoteMaps[r*2+1+offset];
<a name="line131">131: </a> <font color="#4169E1">if</font> (this->debug()) {std::cout << <font color="#666666">"["</font><<this->commRank()<<<font color="#666666">"]: Remote renumbering["</font><<p<<<font color="#666666">"] "</font> << remoteMaps[r*2+0+offset] << <font color="#666666">" --> "</font> << remoteMaps[r*2+1+offset] << std::endl;}
<a name="line132">132: </a> }
<a name="line133">133: </a> }
<a name="line134">134: </a> // Cleanup
<a name="line135">135: </a> delete [] recvCounts;
<a name="line136">136: </a> delete [] displs;
<a name="line137">137: </a> delete [] localMap;
<a name="line138">138: </a> delete [] remoteMaps;
<a name="line139">139: </a> delete [] remoteSizes;
<a name="line140">140: </a> };
<a name="line141">141: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line142">142: </a> // global point --> local point
<a name="line143">143: </a> renumbering_type& getRenumbering() {
<a name="line144">144: </a> <font color="#4169E1">return</font> this->renumbering;
<a name="line145">145: </a> };
<a name="line146">146: </a> // local point --> global point
<a name="line147">147: </a> renumbering_type& getInvRenumbering() {
<a name="line148">148: </a> <font color="#4169E1">return</font> this->invRenumbering;
<a name="line149">149: </a> };
<a name="line150">150: </a> // rank --> global point --> local point
<a name="line151">151: </a> remote_renumbering_type& getRemoteRenumbering() {
<a name="line152">152: </a> <font color="#4169E1">return</font> this->remoteRenumbering;
<a name="line153">153: </a> };
<a name="line154">154: </a> };
<a name="line156">156: </a> // TODO: Check MPI <font color="#4169E1">return</font> values and status of Waits
<a name="line157">157: </a> template<typename Value_>
<a name="line158">158: </a> class MPIMover : public ALE::ParallelObject {
<a name="line159">159: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line160">160: </a> <font color="#4169E1">typedef</font> Value_ value_type;
<a name="line161">161: </a> <font color="#4169E1">typedef</font> size_t num_type;
<a name="line162">162: </a> <font color="#4169E1">typedef</font> std::pair<num_type, const value_type*> move_type;
<a name="line163">163: </a> <font color="#4169E1">typedef</font> std::map<int, move_type> moves_type;
<a name="line164">164: </a> <font color="#4169E1">typedef</font> std::vector<MPI_Request> requests_type;
<a name="line165">165: </a><strong><font color="#FF0000"> protected:</font></strong>
<a name="line166">166: </a> bool _createdType;
<a name="line167">167: </a> int _tag;
<a name="line168">168: </a> MPI_Datatype _datatype;
<a name="line169">169: </a> moves_type _sends;
<a name="line170">170: </a> moves_type _recvs;
<a name="line171">171: </a> requests_type _requests;
<a name="line172">172: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line173">173: </a> MPIMover(<A href="../../docs/manualpages/Sys/MPI_Comm.html#MPI_Comm">MPI_Comm</A> comm, const int debug = 0) : ParallelObject(comm, debug), _createdType(0) {
<a name="line174">174: </a> this->_tag = this->getNewTag();
<a name="line175">175: </a> this->_datatype = this->getMPIDatatype();
<a name="line176">176: </a> };
<a name="line177">177: </a> MPIMover(<A href="../../docs/manualpages/Sys/MPI_Comm.html#MPI_Comm">MPI_Comm</A> comm, const int tag, const int debug) : ParallelObject(comm, debug), _createdType(0), _tag(tag) {
<a name="line178">178: </a> this->_datatype = this->getMPIDatatype();
<a name="line179">179: </a> };
<a name="line180">180: </a> MPIMover(<A href="../../docs/manualpages/Sys/MPI_Comm.html#MPI_Comm">MPI_Comm</A> comm, const MPI_Datatype datatype, const int tag, const int debug) : ParallelObject(comm, debug), _createdType(0) {
<a name="line181">181: </a> <font color="#4169E1">if</font> (tag == MPI_UNDEFINED) {
<a name="line182">182: </a> this->_tag = this->getNewTag();
<a name="line183">183: </a> } <font color="#4169E1">else</font> {
<a name="line184">184: </a> this->_tag = tag;
<a name="line185">185: </a> }
<a name="line186">186: </a> <font color="#4169E1">if</font> (datatype == MPI_DATATYPE_NULL) {
<a name="line187">187: </a> this->_datatype = this->getMPIDatatype();
<a name="line188">188: </a> } <font color="#4169E1">else</font> {
<a name="line189">189: </a> this->_datatype = datatype;
<a name="line190">190: </a> }
<a name="line191">191: </a> };
<a name="line192">192: </a> ~MPIMover() {
<a name="line193">193: </a> <font color="#4169E1">if</font> (_createdType) {
<a name="line194">194: </a> int <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Type_free.html#MPI_Type_free">MPI_Type_free</A>(&this->_datatype);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line195">195: </a> }
<a name="line196">196: </a> };
<a name="line197">197: </a><strong><font color="#FF0000"> protected:</font></strong>
<a name="line198">198: </a> // TODO: Can rewrite this with template specialization?
<a name="line199">199: </a> MPI_Datatype getMPIDatatype() {
<a name="line200">200: </a> <font color="#4169E1">if</font> (<font color="#4169E1">sizeof</font>(value_type) == 1) {
<a name="line201">201: </a> <font color="#4169E1">return</font> MPI_BYTE;
<a name="line202">202: </a> } <font color="#4169E1">else</font> <font color="#4169E1">if</font> (<font color="#4169E1">sizeof</font>(value_type) == 2) {
<a name="line203">203: </a> <font color="#4169E1">return</font> MPI_SHORT;
<a name="line204">204: </a> } <font color="#4169E1">else</font> <font color="#4169E1">if</font> (<font color="#4169E1">sizeof</font>(value_type) == 4) {
<a name="line205">205: </a> <font color="#4169E1">return</font> MPI_INT;
<a name="line206">206: </a> } <font color="#4169E1">else</font> <font color="#4169E1">if</font> (<font color="#4169E1">sizeof</font>(value_type) == 8) {
<a name="line207">207: </a> <font color="#4169E1">return</font> MPI_DOUBLE;
<a name="line208">208: </a> } <font color="#4169E1">else</font> <font color="#4169E1">if</font> (<font color="#4169E1">sizeof</font>(value_type) == 28) {
<a name="line209">209: </a> int blen[2], ierr;
<a name="line210">210: </a> MPI_Aint indices[2];
<a name="line211">211: </a> MPI_Datatype oldtypes[2], newtype;
<a name="line212">212: </a> blen[0] = 1; indices[0] = 0; oldtypes[0] = MPI_INT;
<a name="line213">213: </a> blen[1] = 3; indices[1] = <font color="#4169E1">sizeof</font>(int); oldtypes[1] = MPI_DOUBLE;
<a name="line214">214: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Type_struct.html#MPI_Type_struct">MPI_Type_struct</A>(2, blen, indices, oldtypes, &newtype);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line215">215: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Type_commit.html#MPI_Type_commit">MPI_Type_commit</A>(&newtype);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line216">216: </a> this->_createdType = true;
<a name="line217">217: </a> <font color="#4169E1">return</font> newtype;
<a name="line218">218: </a> } <font color="#4169E1">else</font> <font color="#4169E1">if</font> (<font color="#4169E1">sizeof</font>(value_type) == 32) {
<a name="line219">219: </a> int blen[2], ierr;
<a name="line220">220: </a> MPI_Aint indices[2];
<a name="line221">221: </a> MPI_Datatype oldtypes[2], newtype;
<a name="line222">222: </a> blen[0] = 1; indices[0] = 0; oldtypes[0] = MPI_DOUBLE;
<a name="line223">223: </a> blen[1] = 3; indices[1] = <font color="#4169E1">sizeof</font>(int); oldtypes[1] = MPI_DOUBLE;
<a name="line224">224: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Type_struct.html#MPI_Type_struct">MPI_Type_struct</A>(2, blen, indices, oldtypes, &newtype);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line225">225: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Type_commit.html#MPI_Type_commit">MPI_Type_commit</A>(&newtype);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line226">226: </a> this->_createdType = true;
<a name="line227">227: </a> <font color="#4169E1">return</font> newtype;
<a name="line228">228: </a> }
<a name="line229">229: </a> ostringstream msg;
<a name="line231">231: </a> msg << <font color="#666666">"Cannot determine MPI type for value type with size "</font> << <font color="#4169E1">sizeof</font>(value_type);
<a name="line232">232: </a> throw PETSc::Exception(msg.str().c_str());
<a name="line233">233: </a> };
<a name="line234">234: </a> int getNewTag() const {
<a name="line235">235: </a> static int tagKeyval = MPI_KEYVAL_INVALID;
<a name="line236">236: </a> int *tagvalp = NULL, *maxval, flg, ierr;
<a name="line238">238: </a> <font color="#4169E1">if</font> (tagKeyval == MPI_KEYVAL_INVALID) {
<a name="line239">239: </a> tagvalp = (int *) malloc(<font color="#4169E1">sizeof</font>(int));
<a name="line240">240: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Keyval_create.html#MPI_Keyval_create">MPI_Keyval_create</A>(<A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_NULL_COPY_FN.html#MPI_NULL_COPY_FN">MPI_NULL_COPY_FN</A>, Mesh_DelTag, &tagKeyval, (void *) NULL);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line241">241: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Attr_put.html#MPI_Attr_put">MPI_Attr_put</A>(this->comm(), tagKeyval, tagvalp);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line242">242: </a> tagvalp[0] = 0;
<a name="line243">243: </a> }
<a name="line244">244: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Attr_get.html#MPI_Attr_get">MPI_Attr_get</A>(this->comm(), tagKeyval, (void **) &tagvalp, &flg);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line245">245: </a> <font color="#4169E1">if</font> (tagvalp[0] < 1) {
<a name="line246">246: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Attr_get.html#MPI_Attr_get">MPI_Attr_get</A>(MPI_COMM_WORLD, MPI_TAG_UB, (void **) &maxval, &flg);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line247">247: </a> tagvalp[0] = *maxval - 128; // hope that any still active tags were issued right at the beginning of the run
<a name="line248">248: </a> }
<a name="line249">249: </a> <font color="#4169E1">if</font> (this->debug()) {
<a name="line250">250: </a><strong><font color="#FF0000"> std:</font></strong>:cout << <font color="#666666">"["</font> << this->commRank() << <font color="#666666">"]Got new tag "</font> << tagvalp[0] << std::endl;
<a name="line251">251: </a> }
<a name="line252">252: </a> <font color="#4169E1">return</font> tagvalp[0]--;
<a name="line253">253: </a> };
<a name="line254">254: </a> void constructRequests() {
<a name="line255">255: </a> this->_requests.clear();
<a name="line257">257: </a> <font color="#4169E1">for</font>(typename moves_type::const_iterator s_iter = this->_sends.begin(); s_iter != this->_sends.end(); ++s_iter) {
<a name="line258">258: </a> const int rank = s_iter->first;
<a name="line259">259: </a> const int num = s_iter->second.first;
<a name="line260">260: </a> void *data = (void *) s_iter->second.second;
<a name="line261">261: </a> MPI_Request request;
<a name="line262">262: </a> int ierr;
<a name="line264">264: </a> <font color="#4169E1">if</font> (this->_debug) {std::cout <<<font color="#666666">"["</font><<this->commRank()<<<font color="#666666">"] Sending data ("</font> << num << <font color="#666666">") to "</font> << rank << <font color="#666666">" tag "</font> << this->_tag << std::endl;}
<a name="line265">265: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Send_init.html#MPI_Send_init">MPI_Send_init</A>(data, num, this->_datatype, rank, this->_tag, this->comm(), &request);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line266">266: </a> this->_requests.push_back(request);
<a name="line267">267: </a><font color="#A020F0">#if defined(PETSC_USE_LOG)</font>
<a name="line268">268: </a> // PETSc logging
<a name="line269">269: </a> isend_ct++;
<a name="line270">270: </a> TypeSize(&isend_len, num, this->_datatype);
<a name="line271">271: </a><font color="#A020F0">#endif</font>
<a name="line272">272: </a> }
<a name="line273">273: </a> <font color="#4169E1">for</font>(typename moves_type::const_iterator r_iter = this->_recvs.begin(); r_iter != this->_recvs.end(); ++r_iter) {
<a name="line274">274: </a> const int rank = r_iter->first;
<a name="line275">275: </a> const int num = r_iter->second.first;
<a name="line276">276: </a> void *data = (void *) r_iter->second.second;
<a name="line277">277: </a> MPI_Request request;
<a name="line278">278: </a> int ierr;
<a name="line280">280: </a> <font color="#4169E1">if</font> (this->_debug) {std::cout <<<font color="#666666">"["</font><<this->commRank()<<<font color="#666666">"] Receiving data ("</font> << num << <font color="#666666">") from "</font> << rank << <font color="#666666">" tag "</font> << this->_tag << std::endl;}
<a name="line281">281: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Recv_init.html#MPI_Recv_init">MPI_Recv_init</A>(data, num, this->_datatype, rank, this->_tag, this->comm(), &request);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line282">282: </a> this->_requests.push_back(request);
<a name="line283">283: </a><font color="#A020F0">#if defined(PETSC_USE_LOG)</font>
<a name="line284">284: </a> // PETSc logging
<a name="line285">285: </a> irecv_ct++;
<a name="line286">286: </a> TypeSize(&irecv_len, num, this->_datatype);
<a name="line287">287: </a><font color="#A020F0">#endif</font>
<a name="line288">288: </a> }
<a name="line289">289: </a> };
<a name="line290">290: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line291">291: </a> void send(const int rank, const int num, const value_type *data) {
<a name="line292">292: </a> this->_sends[rank] = move_type(num, data);
<a name="line293">293: </a> };
<a name="line294">294: </a> void recv(const int rank, const int num, const value_type *data) {
<a name="line295">295: </a> this->_recvs[rank] = move_type(num, data);
<a name="line296">296: </a> };
<a name="line297">297: </a> void start() {
<a name="line298">298: </a> this->constructRequests();
<a name="line299">299: </a> <font color="#4169E1">for</font>(typename requests_type::const_iterator r_iter = this->_requests.begin(); r_iter != this->_requests.end(); ++r_iter) {
<a name="line300">300: </a> MPI_Request request = *r_iter;
<a name="line302">302: </a> int <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Start.html#MPI_Start">MPI_Start</A>(&request);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line303">303: </a> }
<a name="line304">304: </a> };
<a name="line305">305: </a> void end() {
<a name="line306">306: </a> MPI_Status status;
<a name="line308">308: </a> <font color="#4169E1">for</font>(typename requests_type::const_iterator r_iter = this->_requests.begin(); r_iter != this->_requests.end(); ++r_iter) {
<a name="line309">309: </a> MPI_Request request = *r_iter;
<a name="line311">311: </a> int <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Wait.html#MPI_Wait">MPI_Wait</A>(&request, &status);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line312">312: </a> }
<a name="line313">313: </a> <font color="#4169E1">for</font>(typename requests_type::const_iterator r_iter = this->_requests.begin(); r_iter != this->_requests.end(); ++r_iter) {
<a name="line314">314: </a> MPI_Request request = *r_iter;
<a name="line316">316: </a> int <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Request_free.html#MPI_Request_free">MPI_Request_free</A>(&request);<A href="../../docs/manualpages/Sys/CHKERRXX.html#CHKERRXX">CHKERRXX</A>(ierr);
<a name="line317">317: </a> }
<a name="line318">318: </a> };
<a name="line319">319: </a> };
<a name="line320">320: </a> template<typename Alloc_ = malloc_allocator<int> >
<a name="line321">321: </a> class OverlapBuilder {
<a name="line322">322: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line323">323: </a> <font color="#4169E1">typedef</font> Alloc_ alloc_type;
<a name="line324">324: </a><strong><font color="#FF0000"> protected:</font></strong>
<a name="line325">325: </a> template<typename T>
<a name="line326">326: </a> <font color="#4169E1">struct lessPair</font>: public std::binary_function<std::pair<T,T>, std::pair<T,T>, bool> {
<a name="line327">327: </a> bool operator()(const std::pair<T,T>& x, const std::pair<T,T>& y) const {
<a name="line328">328: </a> <font color="#4169E1">return</font> x.first < y.first;
<a name="line329">329: </a> }
<a name="line330">330: </a> };
<a name="line331">331: </a> template<typename T>
<a name="line332">332: </a> <font color="#4169E1">struct mergePair</font>: public std::binary_function<std::pair<T,T>, std::pair<T,T>, bool> {
<a name="line333">333: </a><strong><font color="#FF0000"> std:</font></strong>:pair<T,std::pair<T,T> > operator()(const std::pair<T,T>& x, const std::pair<T,T>& y) const {
<a name="line334">334: </a> <font color="#4169E1">return</font> std::pair<T,std::pair<T,T> >(x.first, std::pair<T,T>(x.second, y.second));
<a name="line335">335: </a> }
<a name="line336">336: </a> };
<a name="line337">337: </a> template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare, typename _Merge>
<a name="line338">338: </a> static _OutputIterator set_intersection_merge(_InputIterator1 __first1, _InputIterator1 __last1,
<a name="line339">339: </a> _InputIterator2 __first2, _InputIterator2 __last2,
<a name="line340">340: </a> _OutputIterator __result, _Compare __comp, _Merge __merge)
<a name="line341">341: </a> {
<a name="line342">342: </a> <font color="#4169E1">while</font>(__first1 != __last1 && __first2 != __last2) {
<a name="line343">343: </a> <font color="#4169E1">if</font> (__comp(*__first1, *__first2))
<a name="line344">344: </a> ++__first1;
<a name="line345">345: </a> <font color="#4169E1">else</font> <font color="#4169E1">if</font> (__comp(*__first2, *__first1))
<a name="line346">346: </a> ++__first2;
<a name="line347">347: </a> <font color="#4169E1">else</font>
<a name="line348">348: </a> {
<a name="line349">349: </a> *__result = __merge(*__first1, *__first2);
<a name="line350">350: </a> ++__first1;
<a name="line351">351: </a> ++__first2;
<a name="line352">352: </a> ++__result;
<a name="line353">353: </a> }
<a name="line354">354: </a> }
<a name="line355">355: </a> <font color="#4169E1">return</font> __result;
<a name="line356">356: </a> };
<a name="line357">357: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line358">358: </a> template<typename Sequence, typename Renumbering, typename SendOverlap, typename RecvOverlap>
<a name="line359">359: </a> static void constructOverlap(const Sequence& points, Renumbering& renumbering, const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap) {
<a name="line360">360: </a> <font color="#4169E1">typedef</font> typename SendOverlap::source_type point_type;
<a name="line361">361: </a> <font color="#4169E1">typedef</font> std::pair<point_type,point_type> pointPair;
<a name="line362">362: </a> <font color="#4169E1">typedef</font> std::pair<point_type,pointPair> pointTriple;
<a name="line363">363: </a> alloc_type allocator;
<a name="line364">364: </a> typename alloc_type::template rebind<point_type>::other point_allocator;
<a name="line365">365: </a> typename alloc_type::template rebind<pointPair>::other pointPair_allocator;
<a name="line366">366: </a> const <A href="../../docs/manualpages/Sys/MPI_Comm.html#MPI_Comm">MPI_Comm</A> comm = sendOverlap->comm();
<a name="line367">367: </a> const int commSize = sendOverlap->commSize();
<a name="line368">368: </a> const int commRank = sendOverlap->commRank();
<a name="line369">369: </a> point_type *sendBuf = point_allocator.allocate(points.size()*2);
<a name="line370">370: </a> <font color="#4169E1">for</font>(size_t i = 0; i < points.size()*2; ++i) {point_allocator.construct(sendBuf+i, point_type());}
<a name="line371">371: </a> int size = 0;
<a name="line372">372: </a> const int debug = sendOverlap->debug();
<a name="line373">373: </a> <font color="#4169E1">for</font>(typename Sequence::const_iterator l_iter = points.begin(); l_iter != points.end(); ++l_iter) {
<a name="line374">374: </a> <font color="#4169E1">if</font> (debug) {std::cout << <font color="#666666">"["</font><<commRank<<<font color="#666666">"]Send point["</font><<size<<<font color="#666666">"]: "</font> << *l_iter << <font color="#666666">" "</font> << renumbering[*l_iter] << std::endl;}
<a name="line375">375: </a> sendBuf[size++] = *l_iter;
<a name="line376">376: </a> sendBuf[size++] = renumbering[*l_iter];
<a name="line377">377: </a> }
<a name="line378">378: </a> int *sizes = allocator.allocate(commSize*3+2); // [size] The number of points coming from each process
<a name="line379">379: </a> <font color="#4169E1">for</font>(int i = 0; i < commSize*3+2; ++i) {allocator.construct(sizes+i, 0);}
<a name="line380">380: </a> int *offsets = sizes+commSize; // [size+1] Prefix sums <font color="#4169E1">for</font> sizes
<a name="line381">381: </a> int *oldOffs = offsets+commSize+1; // [size+1] Temporary storage
<a name="line382">382: </a> pointPair *remotePoints = NULL; // The points from each process
<a name="line383">383: </a> int *remoteRanks = NULL; // The rank and number of overlap points of each process that overlaps another
<a name="line384">384: </a> int numRemotePoints = 0;
<a name="line385">385: </a> int numRemoteRanks = 0;
<a name="line387">387: </a> // Change to Allgather() <font color="#4169E1">for</font> the correct binning algorithm
<a name="line388">388: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Gather.html#MPI_Gather">MPI_Gather</A>(&size, 1, MPI_INT, sizes, 1, MPI_INT, 0, comm);
<a name="line389">389: </a> <font color="#4169E1">if</font> (commRank == 0) {
<a name="line390">390: </a> offsets[0] = 0;
<a name="line391">391: </a> <font color="#4169E1">for</font>(int p = 1; p <= commSize; p++) {
<a name="line392">392: </a> offsets[p] = offsets[p-1] + sizes[p-1];
<a name="line393">393: </a> }
<a name="line394">394: </a> numRemotePoints = offsets[commSize];
<a name="line395">395: </a> remotePoints = pointPair_allocator.allocate(numRemotePoints/2);
<a name="line396">396: </a> <font color="#4169E1">for</font>(int i = 0; i < numRemotePoints/2; ++i) {pointPair_allocator.construct(remotePoints+i, pointPair());}
<a name="line397">397: </a> }
<a name="line398">398: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Gatherv.html#MPI_Gatherv">MPI_Gatherv</A>(sendBuf, size, MPI_INT, remotePoints, sizes, offsets, MPI_INT, 0, comm);
<a name="line399">399: </a> <font color="#4169E1">for</font>(size_t i = 0; i < points.size(); ++i) {point_allocator.destroy(sendBuf+i);}
<a name="line400">400: </a> point_allocator.deallocate(sendBuf, points.size());
<a name="line401">401: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, std::map<int, std::set<pointTriple> > > overlapInfo; // Maps (p,q) to their set of overlap points
<a name="line403">403: </a> <font color="#4169E1">if</font> (commRank == 0) {
<a name="line404">404: </a> <font color="#4169E1">for</font>(int p = 0; p <= commSize; p++) {
<a name="line405">405: </a> offsets[p] /= 2;
<a name="line406">406: </a> }
<a name="line407">407: </a> <font color="#4169E1">for</font>(int p = 0; p < commSize; p++) {
<a name="line408">408: </a><strong><font color="#FF0000"> std:</font></strong>:sort(&remotePoints[offsets[p]], &remotePoints[offsets[p+1]], lessPair<point_type>());
<a name="line409">409: </a> }
<a name="line410">410: </a> <font color="#4169E1">for</font>(int p = 0; p <= commSize; p++) {
<a name="line411">411: </a> oldOffs[p] = offsets[p];
<a name="line412">412: </a> }
<a name="line413">413: </a> <font color="#4169E1">for</font>(int p = 0; p < commSize; p++) {
<a name="line414">414: </a> <font color="#4169E1">for</font>(int q = 0; q < commSize; q++) {
<a name="line415">415: </a> <font color="#4169E1">if</font> (p == q) <font color="#4169E1">continue</font>;
<a name="line416">416: </a> set_intersection_merge(&remotePoints[oldOffs[p]], &remotePoints[oldOffs[p+1]],
<a name="line417">417: </a> &remotePoints[oldOffs[q]], &remotePoints[oldOffs[q+1]],
<a name="line418">418: </a><strong><font color="#FF0000"> std:</font></strong>:insert_iterator<std::set<pointTriple> >(overlapInfo[p][q], overlapInfo[p][q].begin()),
<a name="line419">419: </a> lessPair<point_type>(), mergePair<point_type>());
<a name="line420">420: </a> }
<a name="line421">421: </a> sizes[p] = overlapInfo[p].size()*2;
<a name="line422">422: </a> offsets[p+1] = offsets[p] + sizes[p];
<a name="line423">423: </a> }
<a name="line424">424: </a> numRemoteRanks = offsets[commSize];
<a name="line425">425: </a> remoteRanks = allocator.allocate(numRemoteRanks);
<a name="line426">426: </a> <font color="#4169E1">for</font>(int i = 0; i < numRemoteRanks; ++i) {allocator.construct(remoteRanks+i, 0);}
<a name="line427">427: </a> int k = 0;
<a name="line428">428: </a> <font color="#4169E1">for</font>(int p = 0; p < commSize; p++) {
<a name="line429">429: </a> <font color="#4169E1">for</font>(typename std::map<int, std::set<pointTriple> >::iterator r_iter = overlapInfo[p].begin(); r_iter != overlapInfo[p].end(); ++r_iter) {
<a name="line430">430: </a> remoteRanks[k*2] = r_iter->first;
<a name="line431">431: </a> remoteRanks[k*2+1] = r_iter->second.size();
<a name="line432">432: </a> k++;
<a name="line433">433: </a> }
<a name="line434">434: </a> }
<a name="line435">435: </a> }
<a name="line436">436: </a> int numOverlaps; // The number of processes overlapping this process
<a name="line437">437: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Scatter.html#MPI_Scatter">MPI_Scatter</A>(sizes, 1, MPI_INT, &numOverlaps, 1, MPI_INT, 0, comm);
<a name="line438">438: </a> int *overlapRanks = allocator.allocate(numOverlaps); // The rank and overlap size <font color="#4169E1">for</font> each overlapping process
<a name="line439">439: </a> <font color="#4169E1">for</font>(int i = 0; i < numOverlaps; ++i) {allocator.construct(overlapRanks+i, 0);}
<a name="line440">440: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Scatterv.html#MPI_Scatterv">MPI_Scatterv</A>(remoteRanks, sizes, offsets, MPI_INT, overlapRanks, numOverlaps, MPI_INT, 0, comm);
<a name="line441">441: </a> point_type *sendPoints = NULL; // The points to send to each process
<a name="line442">442: </a> int numSendPoints = 0;
<a name="line443">443: </a> <font color="#4169E1">if</font> (commRank == 0) {
<a name="line444">444: </a> <font color="#4169E1">for</font>(int p = 0, k = 0; p < commSize; p++) {
<a name="line445">445: </a> sizes[p] = 0;
<a name="line446">446: </a> <font color="#4169E1">for</font>(int r = 0; r < (int) overlapInfo[p].size(); r++) {
<a name="line447">447: </a> sizes[p] += remoteRanks[k*2+1]*2;
<a name="line448">448: </a> k++;
<a name="line449">449: </a> }
<a name="line450">450: </a> offsets[p+1] = offsets[p] + sizes[p];
<a name="line451">451: </a> }
<a name="line452">452: </a> numSendPoints = offsets[commSize];
<a name="line453">453: </a> sendPoints = point_allocator.allocate(numSendPoints*2);
<a name="line454">454: </a> <font color="#4169E1">for</font>(int i = 0; i < numSendPoints*2; ++i) {point_allocator.construct(sendPoints+i, point_type());}
<a name="line455">455: </a> <font color="#4169E1">for</font>(int p = 0, k = 0; p < commSize; p++) {
<a name="line456">456: </a> <font color="#4169E1">for</font>(typename std::map<int, std::set<pointTriple> >::const_iterator r_iter = overlapInfo[p].begin(); r_iter != overlapInfo[p].end(); ++r_iter) {
<a name="line457">457: </a> int rank = r_iter->first;
<a name="line458">458: </a> <font color="#4169E1">for</font>(typename std::set<pointTriple>::const_iterator p_iter = (overlapInfo[p][rank]).begin(); p_iter != (overlapInfo[p][rank]).end(); ++p_iter) {
<a name="line459">459: </a> sendPoints[k++] = p_iter->first;
<a name="line460">460: </a> sendPoints[k++] = p_iter->second.second;
<a name="line461">461: </a> <font color="#4169E1">if</font> (debug) {std::cout << <font color="#666666">"["</font><<commRank<<<font color="#666666">"]Sending points "</font> << p_iter->first << <font color="#666666">" "</font> << p_iter->second.second << <font color="#666666">" to rank "</font> << rank << std::endl;}
<a name="line462">462: </a> }
<a name="line463">463: </a> }
<a name="line464">464: </a> }
<a name="line465">465: </a> }
<a name="line466">466: </a> int numOverlapPoints = 0;
<a name="line467">467: </a> <font color="#4169E1">for</font>(int r = 0; r < numOverlaps/2; r++) {
<a name="line468">468: </a> numOverlapPoints += overlapRanks[r*2+1];
<a name="line469">469: </a> }
<a name="line470">470: </a> point_type *overlapPoints = point_allocator.allocate(numOverlapPoints*2);
<a name="line471">471: </a> <font color="#4169E1">for</font>(int i = 0; i < numOverlapPoints*2; ++i) {point_allocator.construct(overlapPoints+i, point_type());}
<a name="line472">472: </a> <A href="http://www.mcs.anl.gov/mpi/www/www3/MPI_Scatterv.html#MPI_Scatterv">MPI_Scatterv</A>(sendPoints, sizes, offsets, MPI_INT, overlapPoints, numOverlapPoints*2, MPI_INT, 0, comm);
<a name="line474">474: </a> <font color="#4169E1">for</font>(int r = 0, k = 0; r < numOverlaps/2; r++) {
<a name="line475">475: </a> int rank = overlapRanks[r*2];
<a name="line477">477: </a> <font color="#4169E1">for</font>(int p = 0; p < overlapRanks[r*2+1]; p++) {
<a name="line478">478: </a> point_type point = overlapPoints[k++];
<a name="line479">479: </a> point_type remotePoint = overlapPoints[k++];
<a name="line481">481: </a> <font color="#4169E1">if</font> (debug) {std::cout << <font color="#666666">"["</font><<commRank<<<font color="#666666">"]Matched up remote point "</font> << remotePoint << <font color="#666666">"("</font><<point<<<font color="#666666">") to local "</font> << renumbering[point] << std::endl;}
<a name="line482">482: </a> sendOverlap->addArrow(renumbering[point], rank, remotePoint);
<a name="line483">483: </a> recvOverlap->addArrow(rank, renumbering[point], remotePoint);
<a name="line484">484: </a> }
<a name="line485">485: </a> }
<a name="line487">487: </a> <font color="#4169E1">for</font>(int i = 0; i < numOverlapPoints; ++i) {point_allocator.destroy(overlapPoints+i);}
<a name="line488">488: </a> point_allocator.deallocate(overlapPoints, numOverlapPoints);
<a name="line489">489: </a> <font color="#4169E1">for</font>(int i = 0; i < numOverlaps; ++i) {allocator.destroy(overlapRanks+i);}
<a name="line490">490: </a> allocator.deallocate(overlapRanks, numOverlaps);
<a name="line491">491: </a> <font color="#4169E1">for</font>(int i = 0; i < commSize*3+2; ++i) {allocator.destroy(sizes+i);}
<a name="line492">492: </a> allocator.deallocate(sizes, commSize*3+2);
<a name="line493">493: </a> <font color="#4169E1">if</font> (commRank == 0) {
<a name="line494">494: </a> <font color="#4169E1">for</font>(int i = 0; i < numRemoteRanks; ++i) {allocator.destroy(remoteRanks+i);}
<a name="line495">495: </a> allocator.deallocate(remoteRanks, numRemoteRanks);
<a name="line496">496: </a> <font color="#4169E1">for</font>(int i = 0; i < numRemotePoints; ++i) {pointPair_allocator.destroy(remotePoints+i);}
<a name="line497">497: </a> pointPair_allocator.deallocate(remotePoints, numRemotePoints);
<a name="line498">498: </a> <font color="#4169E1">for</font>(int i = 0; i < numSendPoints; ++i) {point_allocator.destroy(sendPoints+i);}
<a name="line499">499: </a> point_allocator.deallocate(sendPoints, numSendPoints);
<a name="line500">500: </a> }
<a name="line501">501: </a> };
<a name="line502">502: </a> };
<a name="line503">503: </a> namespace Pullback {
<a name="line504">504: </a> class SimpleCopy {
<a name="line505">505: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line506">506: </a> // Copy the overlap section to the related processes
<a name="line507">507: </a> // This version is <font color="#4169E1">for</font> Constant sections, meaning the same, single value over all points
<a name="line508">508: </a> template<typename SendOverlap, typename RecvOverlap, typename SendSection, typename RecvSection>
<a name="line509">509: </a> static void copyConstant(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<SendSection>& sendSection, const Obj<RecvSection>& recvSection) {
<a name="line510">510: </a> MPIMover<char> pMover(sendSection->comm(), sendSection->debug());
<a name="line511">511: </a> MPIMover<typename SendSection::value_type> vMover(sendSection->comm(), sendSection->debug());
<a name="line512">512: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, char *> sendPoints;
<a name="line513">513: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, char *> recvPoints;
<a name="line514">514: </a> typename SendSection::alloc_type::template rebind<char>::other sendAllocator;
<a name="line515">515: </a> typename RecvSection::alloc_type::template rebind<char>::other recvAllocator;
<a name="line517">517: </a> const Obj<typename SendOverlap::traits::baseSequence> sRanks = sendOverlap->base();
<a name="line518">518: </a> const typename SendOverlap::traits::baseSequence::iterator sEnd = sRanks->end();
<a name="line519">519: </a> const typename SendSection::value_type *sValues = sendSection->restrictSpace();
<a name="line521">521: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line522">522: </a> const Obj<typename SendOverlap::coneSequence>& points = sendOverlap->cone(*r_iter);
<a name="line523">523: </a> const int pSize = points->size();
<a name="line524">524: </a> const typename SendOverlap::coneSequence::iterator pEnd = points->end();
<a name="line525">525: </a> char *v = sendAllocator.allocate(points->size());
<a name="line526">526: </a> int k = 0;
<a name="line528">528: </a> <font color="#4169E1">for</font>(int i = 0; i < pSize; ++i) {sendAllocator.construct(v+i, 0);}
<a name="line529">529: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator p_iter = points->begin(); p_iter != pEnd; ++p_iter, ++k) {
<a name="line530">530: </a> v[k] = (char) sendSection->hasPoint(*p_iter);
<a name="line531">531: </a> }
<a name="line532">532: </a> sendPoints[*r_iter] = v;
<a name="line533">533: </a> pMover.send(*r_iter, pSize, sendPoints[*r_iter]);
<a name="line534">534: </a> vMover.send(*r_iter, 2, sValues);
<a name="line535">535: </a> }
<a name="line536">536: </a> const Obj<typename RecvOverlap::traits::capSequence> rRanks = recvOverlap->cap();
<a name="line537">537: </a> const typename RecvOverlap::traits::capSequence::iterator rEnd = rRanks->end();
<a name="line538">538: </a> const typename RecvSection::value_type *rValues = recvSection->restrictSpace();
<a name="line540">540: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line541">541: </a> const Obj<typename RecvOverlap::traits::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line542">542: </a> const int pSize = points->size();
<a name="line543">543: </a> char *v = recvAllocator.allocate(pSize);
<a name="line545">545: </a> <font color="#4169E1">for</font>(int i = 0; i < pSize; ++i) {recvAllocator.construct(v+i, 0);}
<a name="line546">546: </a> recvPoints[*r_iter] = v;
<a name="line547">547: </a> pMover.recv(*r_iter, pSize, recvPoints[*r_iter]);
<a name="line548">548: </a> vMover.recv(*r_iter, 2, rValues);
<a name="line549">549: </a> }
<a name="line550">550: </a> pMover.start();
<a name="line551">551: </a> pMover.end();
<a name="line552">552: </a> vMover.start();
<a name="line553">553: </a> vMover.end();
<a name="line554">554: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line555">555: </a> const Obj<typename RecvOverlap::traits::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line556">556: </a> const typename RecvOverlap::traits::supportSequence::iterator pEnd = points->end();
<a name="line557">557: </a> const char *v = recvPoints[*r_iter];
<a name="line558">558: </a> int k = 0;
<a name="line560">560: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::supportSequence::iterator s_iter = points->begin(); s_iter != pEnd; ++s_iter, ++k) {
<a name="line561">561: </a> <font color="#4169E1">if</font> (v[k]) {recvSection->addPoint(typename RecvSection::point_type(*r_iter, s_iter.color()));}
<a name="line562">562: </a> }
<a name="line563">563: </a> }
<a name="line564">564: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line565">565: </a> sendAllocator.deallocate(sendPoints[*r_iter], sendOverlap->cone(*r_iter)->size());
<a name="line566">566: </a> }
<a name="line567">567: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line568">568: </a> recvAllocator.deallocate(recvPoints[*r_iter], recvOverlap->support(*r_iter)->size());
<a name="line569">569: </a> }
<a name="line570">570: </a> };
<a name="line571">571: </a> // Specialize to ArrowSection
<a name="line572">572: </a> template<typename SendOverlap, typename RecvOverlap, typename SendSection, typename RecvSection>
<a name="line573">573: </a> static void copyConstantArrow(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<SendSection>& sendSection, const Obj<RecvSection>& recvSection) {
<a name="line574">574: </a> MPIMover<char> pMover(sendSection->comm(), sendSection->debug());
<a name="line575">575: </a> MPIMover<typename SendSection::value_type> vMover(sendSection->comm(), sendSection->debug());
<a name="line576">576: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, char *> sendPoints;
<a name="line577">577: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, char *> recvPoints;
<a name="line578">578: </a> typename SendSection::alloc_type::template rebind<char>::other sendAllocator;
<a name="line579">579: </a> typename RecvSection::alloc_type::template rebind<char>::other recvAllocator;
<a name="line581">581: </a> const Obj<typename SendOverlap::traits::baseSequence> sRanks = sendOverlap->base();
<a name="line582">582: </a> const typename SendOverlap::traits::baseSequence::iterator sEnd = sRanks->end();
<a name="line583">583: </a> const typename SendSection::value_type *sValues = sendSection->restrictSpace();
<a name="line585">585: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line586">586: </a> const Obj<typename SendOverlap::coneSequence>& points = sendOverlap->cone(*r_iter);
<a name="line587">587: </a> const int pSize = points->size();
<a name="line588">588: </a> const typename SendOverlap::coneSequence::iterator pBegin = points->begin();
<a name="line589">589: </a> const typename SendOverlap::coneSequence::iterator pEnd = points->end();
<a name="line590">590: </a> char *v = sendAllocator.allocate(pSize*pSize);
<a name="line591">591: </a> int k = 0;
<a name="line593">593: </a> <font color="#4169E1">for</font>(size_t i = 0; i < pSize*pSize; ++i) {sendAllocator.construct(v+i, 0);}
<a name="line594">594: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator p_iter = pBegin; p_iter != pEnd; ++p_iter) {
<a name="line595">595: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator q_iter = pBegin; q_iter != pEnd; ++q_iter, ++k) {
<a name="line596">596: </a> v[k] = (char) sendSection->hasPoint(typename SendSection::point_type(*p_iter,*q_iter));
<a name="line597">597: </a> }
<a name="line598">598: </a> }
<a name="line599">599: </a> sendPoints[*r_iter] = v;
<a name="line600">600: </a> pMover.send(*r_iter, pSize*pSize, sendPoints[*r_iter]);
<a name="line601">601: </a> vMover.send(*r_iter, 2, sValues);
<a name="line602">602: </a> }
<a name="line603">603: </a> const Obj<typename RecvOverlap::traits::capSequence> rRanks = recvOverlap->cap();
<a name="line604">604: </a> const typename RecvOverlap::traits::capSequence::iterator rEnd = rRanks->end();
<a name="line605">605: </a> const typename RecvSection::value_type *rValues = recvSection->restrictSpace();
<a name="line607">607: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line608">608: </a> const Obj<typename RecvOverlap::traits::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line609">609: </a> const int pSize = points->size();
<a name="line610">610: </a> char *v = recvAllocator.allocate(points->size()*points->size());
<a name="line612">612: </a> <font color="#4169E1">for</font>(size_t i = 0; i < pSize*pSize; ++i) {recvAllocator.construct(v+i, 0);}
<a name="line613">613: </a> recvPoints[*r_iter] = v;
<a name="line614">614: </a> pMover.recv(*r_iter, pSize*pSize, recvPoints[*r_iter]);
<a name="line615">615: </a> vMover.recv(*r_iter, 2, rValues);
<a name="line616">616: </a> }
<a name="line617">617: </a> pMover.start();
<a name="line618">618: </a> pMover.end();
<a name="line619">619: </a> vMover.start();
<a name="line620">620: </a> vMover.end();
<a name="line621">621: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line622">622: </a> const Obj<typename RecvOverlap::traits::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line623">623: </a> const typename RecvOverlap::traits::supportSequence::iterator pBegin = points->begin();
<a name="line624">624: </a> const typename RecvOverlap::traits::supportSequence::iterator pEnd = points->end();
<a name="line625">625: </a> const char *v = recvPoints[*r_iter];
<a name="line626">626: </a> int k = 0;
<a name="line628">628: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::supportSequence::iterator s_iter = pBegin; s_iter != pEnd; ++s_iter) {
<a name="line629">629: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::supportSequence::iterator t_iter = pBegin; t_iter != pEnd; ++t_iter, ++k) {
<a name="line630">630: </a> <font color="#4169E1">if</font> (v[k]) {recvSection->addPoint(typename RecvSection::point_type(s_iter.color(),t_iter.color()));}
<a name="line631">631: </a> }
<a name="line632">632: </a> }
<a name="line633">633: </a> }
<a name="line634">634: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line635">635: </a> sendAllocator.deallocate(sendPoints[*r_iter], sendOverlap->cone(*r_iter)->size()*sendOverlap->cone(*r_iter)->size());
<a name="line636">636: </a> }
<a name="line637">637: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line638">638: </a> recvAllocator.deallocate(recvPoints[*r_iter], recvOverlap->support(*r_iter)->size()*recvOverlap->support(*r_iter)->size());
<a name="line639">639: </a> }
<a name="line640">640: </a> };
<a name="line641">641: </a> // Copy the overlap section to the related processes
<a name="line642">642: </a> // This version is <font color="#4169E1">for</font> IConstant sections, meaning the same, single value over all points
<a name="line643">643: </a> template<typename SendOverlap, typename RecvOverlap, typename SendSection, typename RecvSection>
<a name="line644">644: </a> static void copyIConstant(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<SendSection>& sendSection, const Obj<RecvSection>& recvSection) {
<a name="line645">645: </a> MPIMover<typename SendSection::point_type> pMover(sendSection->comm(), sendSection->debug());
<a name="line646">646: </a> MPIMover<typename SendSection::value_type> vMover(sendSection->comm(), sendSection->debug());
<a name="line647">647: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, typename SendSection::point_type *> sendPoints;
<a name="line648">648: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, typename SendSection::point_type *> recvPoints;
<a name="line649">649: </a> typename SendSection::alloc_type::template rebind<typename SendSection::point_type>::other sendAllocator;
<a name="line650">650: </a> typename RecvSection::alloc_type::template rebind<typename SendSection::point_type>::other recvAllocator;
<a name="line652">652: </a> const Obj<typename SendOverlap::traits::baseSequence> sRanks = sendOverlap->base();
<a name="line653">653: </a> const typename SendOverlap::traits::baseSequence::iterator sEnd = sRanks->end();
<a name="line654">654: </a> const typename SendSection::value_type *sValues = sendSection->restrictSpace();
<a name="line656">656: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line657">657: </a> typename SendSection::point_type *v = sendAllocator.allocate(2);
<a name="line659">659: </a> <font color="#4169E1">for</font>(size_t i = 0; i < 2; ++i) {sendAllocator.construct(v+i, 0);}
<a name="line660">660: </a> v[0] = sendSection->getChart().min();
<a name="line661">661: </a> v[1] = sendSection->getChart().max();
<a name="line662">662: </a> sendPoints[*r_iter] = v;
<a name="line663">663: </a> pMover.send(*r_iter, 2, sendPoints[*r_iter]);
<a name="line664">664: </a> vMover.send(*r_iter, 2, sValues);
<a name="line665">665: </a> ///std::cout << <font color="#666666">"["</font><<sendOverlap->commRank()<<<font color="#666666">"]Sending chart ("</font> << v[0] << <font color="#666666">", "</font> << v[1] << <font color="#666666">") with values ("</font> << sValues[0] << <font color="#666666">", "</font> << sValues[1] << <font color="#666666">") to process "</font> << *r_iter << std::endl;
<a name="line666">666: </a> }
<a name="line667">667: </a> const Obj<typename RecvOverlap::traits::capSequence> rRanks = recvOverlap->cap();
<a name="line668">668: </a> const typename RecvOverlap::traits::capSequence::iterator rEnd = rRanks->end();
<a name="line669">669: </a> const typename RecvSection::value_type *rValues = recvSection->restrictSpace();
<a name="line671">671: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line672">672: </a> typename SendSection::point_type *v = recvAllocator.allocate(2);
<a name="line674">674: </a> <font color="#4169E1">for</font>(size_t i = 0; i < 2; ++i) {recvAllocator.construct(v+i, 0);}
<a name="line675">675: </a> recvPoints[*r_iter] = v;
<a name="line676">676: </a> pMover.recv(*r_iter, 2, recvPoints[*r_iter]);
<a name="line677">677: </a> vMover.recv(*r_iter, 2, rValues);
<a name="line678">678: </a> }
<a name="line679">679: </a> pMover.start();
<a name="line680">680: </a> pMover.end();
<a name="line681">681: </a> vMover.start();
<a name="line682">682: </a> vMover.end();
<a name="line684">684: </a> typename SendSection::point_type min = -1;
<a name="line685">685: </a> typename SendSection::point_type max = -1;
<a name="line687">687: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line688">688: </a> const typename RecvSection::point_type *v = recvPoints[*r_iter];
<a name="line689">689: </a> typename SendSection::point_type newMin = v[0];
<a name="line690">690: </a> typename SendSection::point_type newMax = v[1]-1;
<a name="line691">691: </a> //int pSize = 0;
<a name="line693">693: </a> ///std::cout << <font color="#666666">"["</font><<recvOverlap->commRank()<<<font color="#666666">"]Received chart ("</font> << v[0] << <font color="#666666">", "</font> << v[1] << <font color="#666666">") from process "</font> << *r_iter << std::endl;
<a name="line694">694: </a><font color="#A020F0">#if 0</font>
<a name="line695">695: </a> // Translate to local numbering
<a name="line696">696: </a> <font color="#4169E1">if</font> (recvOverlap->support(*r_iter)->size()) {
<a name="line697">697: </a> <font color="#4169E1">while</font>(!pSize) {
<a name="line698">698: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter, newMin);
<a name="line699">699: </a> pSize = points->size();
<a name="line700">700: </a> <font color="#4169E1">if</font> (pSize) {
<a name="line701">701: </a> newMin = *points->begin();
<a name="line702">702: </a> } <font color="#4169E1">else</font> {
<a name="line703">703: </a> newMin++;
<a name="line704">704: </a> }
<a name="line705">705: </a> }
<a name="line706">706: </a> pSize = 0;
<a name="line707">707: </a> <font color="#4169E1">while</font>(!pSize) {
<a name="line708">708: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter, newMax);
<a name="line709">709: </a> pSize = points->size();
<a name="line710">710: </a> <font color="#4169E1">if</font> (pSize) {
<a name="line711">711: </a> newMax = *points->begin();
<a name="line712">712: </a> } <font color="#4169E1">else</font> {
<a name="line713">713: </a> newMax--;
<a name="line714">714: </a> }
<a name="line715">715: </a> }
<a name="line716">716: </a> }
<a name="line717">717: </a><strong><font color="#FF0000"> std:</font></strong>:cout << <font color="#666666">"["</font><<recvOverlap->commRank()<<<font color="#666666">"]Translated to chart ("</font> << newMin << <font color="#666666">", "</font> << newMax+1 << <font color="#666666">") from process "</font> << *r_iter << std::endl;
<a name="line718">718: </a><font color="#A020F0">#endif</font>
<a name="line719">719: </a> // Update chart
<a name="line720">720: </a> <font color="#4169E1">if</font> (min < 0) {
<a name="line721">721: </a> min = newMin;
<a name="line722">722: </a> max = newMax+1;
<a name="line723">723: </a> } <font color="#4169E1">else</font> {
<a name="line724">724: </a> min = std::min(min, newMin);
<a name="line725">725: </a> max = std::max(max, (typename SendSection::point_type) (newMax+1));
<a name="line726">726: </a> }
<a name="line727">727: </a> }
<a name="line728">728: </a> <font color="#4169E1">if</font> (!rRanks->size()) {min = max = 0;}
<a name="line729">729: </a> recvSection->setChart(typename RecvSection::chart_type(min, max));
<a name="line730">730: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line731">731: </a> sendAllocator.deallocate(sendPoints[*r_iter], 2);
<a name="line732">732: </a> }
<a name="line733">733: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line734">734: </a> recvAllocator.deallocate(recvPoints[*r_iter], 2);
<a name="line735">735: </a> }
<a name="line736">736: </a> };
<a name="line737">737: </a> // Copy the overlap section to the related processes
<a name="line738">738: </a> // This version is <font color="#4169E1">for</font> different sections, possibly with different data types
<a name="line739">739: </a> // TODO: Can cache MPIMover objects (like a <A href="../../docs/manualpages/Vec/VecScatter.html#VecScatter">VecScatter</A>)
<a name="line740">740: </a> template<typename SendOverlap, typename RecvOverlap, typename SendSection, typename RecvSection>
<a name="line741">741: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<SendSection>& sendSection, const Obj<RecvSection>& recvSection, const MPI_Datatype datatype = MPI_DATATYPE_NULL) {
<a name="line742">742: </a> <font color="#4169E1">typedef</font> std::pair<int, typename SendSection::value_type *> allocPair;
<a name="line743">743: </a> <font color="#4169E1">typedef</font> typename RecvSection::point_type recv_point_type;
<a name="line744">744: </a> const Obj<typename SendSection::atlas_type>& sendAtlas = sendSection->getAtlas();
<a name="line745">745: </a> const Obj<typename RecvSection::atlas_type>& recvAtlas = recvSection->getAtlas();
<a name="line746">746: </a> MPIMover<typename SendSection::value_type> vMover(sendSection->comm(), datatype, MPI_UNDEFINED, sendSection->debug());
<a name="line747">747: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, allocPair> sendValues;
<a name="line748">748: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, allocPair> recvValues;
<a name="line749">749: </a> typename SendSection::alloc_type sendAllocator;
<a name="line750">750: </a> typename RecvSection::alloc_type recvAllocator;
<a name="line752">752: </a> copy(sendOverlap, recvOverlap, sendAtlas, recvAtlas);
<a name="line753">753: </a> const Obj<typename SendOverlap::traits::baseSequence> sRanks = sendOverlap->base();
<a name="line754">754: </a> const typename SendOverlap::traits::baseSequence::iterator sEnd = sRanks->end();
<a name="line756">756: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line757">757: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line758">758: </a> const Obj<typename SendOverlap::coneSequence>& points = sendOverlap->cone(*r_iter);
<a name="line759">759: </a> const typename SendOverlap::coneSequence::iterator pEnd = points->end();
<a name="line760">760: </a> int numVals = 0;
<a name="line762">762: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line763">763: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator c_iter = points->begin(); c_iter != pEnd; ++c_iter) {
<a name="line764">764: </a> numVals += sendSection->getFiberDimension(*c_iter);
<a name="line765">765: </a> }
<a name="line766">766: </a> typename SendSection::value_type *v = sendAllocator.allocate(numVals);
<a name="line767">767: </a> int k = 0;
<a name="line769">769: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {sendAllocator.construct(v+i, 0);}
<a name="line770">770: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator c_iter = points->begin(); c_iter != pEnd; ++c_iter) {
<a name="line771">771: </a> const typename SendSection::value_type *vals = sendSection->restrictPoint(*c_iter);
<a name="line773">773: </a> <font color="#4169E1">for</font>(int i = 0; i < sendSection->getFiberDimension(*c_iter); ++i, ++k) v[k] = vals[i];
<a name="line774">774: </a> }
<a name="line775">775: </a> sendValues[*r_iter] = allocPair(numVals, v);
<a name="line776">776: </a> vMover.send(*r_iter, numVals, v);
<a name="line777">777: </a> }
<a name="line778">778: </a> const Obj<typename RecvOverlap::traits::capSequence> rRanks = recvOverlap->cap();
<a name="line779">779: </a> const typename RecvOverlap::traits::capSequence::iterator rEnd = rRanks->end();
<a name="line781">781: </a> recvSection->allocatePoint();
<a name="line782">782: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line783">783: </a> int maxVals = 0;
<a name="line784">784: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line785">785: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line786">786: </a> const typename RecvOverlap::supportSequence::iterator pEnd = points->end();
<a name="line787">787: </a> int numVals = 0;
<a name="line789">789: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line790">790: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator s_iter = points->begin(); s_iter != pEnd; ++s_iter) {
<a name="line791">791: </a> numVals += recvSection->getFiberDimension(recv_point_type(*r_iter, s_iter.color()));
<a name="line792">792: </a> }
<a name="line793">793: </a> typename SendSection::value_type *v = sendAllocator.allocate(numVals);
<a name="line795">795: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {sendAllocator.construct(v+i, 0);}
<a name="line796">796: </a> recvValues[*r_iter] = allocPair(numVals, v);
<a name="line797">797: </a> vMover.recv(*r_iter, numVals, v);
<a name="line798">798: </a> maxVals = std::max(maxVals, numVals);
<a name="line799">799: </a> }
<a name="line800">800: </a> vMover.start();
<a name="line801">801: </a> vMover.end();
<a name="line802">802: </a> typename RecvSection::value_type *convertedValues = recvAllocator.allocate(maxVals);
<a name="line803">803: </a> <font color="#4169E1">for</font>(int i = 0; i < maxVals; ++i) {recvAllocator.construct(convertedValues+i, 0);}
<a name="line804">804: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line805">805: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line806">806: </a> const typename RecvOverlap::supportSequence::iterator pEnd = points->end();
<a name="line807">807: </a> typename SendSection::value_type *v = recvValues[*r_iter].second;
<a name="line808">808: </a> const int numVals = recvValues[*r_iter].first;
<a name="line809">809: </a> int k = 0;
<a name="line811">811: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator s_iter = points->begin(); s_iter != pEnd; ++s_iter) {
<a name="line812">812: </a> const int size = recvSection->getFiberDimension(recv_point_type(*r_iter, s_iter.color()));
<a name="line814">814: </a> <font color="#4169E1">for</font>(int i = 0; i < size; ++i) {convertedValues[i] = (typename RecvSection::value_type) v[k+i];}
<a name="line815">815: </a> <font color="#4169E1">if</font> (size) {recvSection->updatePoint(recv_point_type(*r_iter, s_iter.color()), convertedValues);}
<a name="line816">816: </a> k += size;
<a name="line817">817: </a> }
<a name="line818">818: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {sendAllocator.destroy(v+i);}
<a name="line819">819: </a> }
<a name="line820">820: </a> <font color="#4169E1">for</font>(int i = 0; i < maxVals; ++i) {recvAllocator.destroy(convertedValues+i);}
<a name="line821">821: </a> recvAllocator.deallocate(convertedValues, maxVals);
<a name="line822">822: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line823">823: </a> typename SendSection::value_type *v = sendValues[*r_iter].second;
<a name="line824">824: </a> const int numVals = sendValues[*r_iter].first;
<a name="line826">826: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {sendAllocator.destroy(v+i);}
<a name="line827">827: </a> sendAllocator.deallocate(v, numVals);
<a name="line828">828: </a> }
<a name="line829">829: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line830">830: </a> typename SendSection::value_type *v = recvValues[*r_iter].second;
<a name="line831">831: </a> const int numVals = recvValues[*r_iter].first;
<a name="line833">833: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {sendAllocator.destroy(v+i);}
<a name="line834">834: </a> sendAllocator.deallocate(v, numVals);
<a name="line835">835: </a> }
<a name="line836">836: </a> //recvSection->view(<font color="#666666">"After copy"</font>);
<a name="line837">837: </a> };
<a name="line838">838: </a> // Copy the overlap section to the related processes
<a name="line839">839: </a> // This version is <font color="#4169E1">for</font> sections with the same type
<a name="line840">840: </a> template<typename SendOverlap, typename RecvOverlap, typename Section>
<a name="line841">841: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<Section>& sendSection, const Obj<Section>& recvSection, const MPI_Datatype datatype = MPI_DATATYPE_NULL) {
<a name="line842">842: </a> <font color="#4169E1">typedef</font> std::pair<int, typename Section::value_type *> allocPair;
<a name="line843">843: </a> const Obj<typename Section::atlas_type>& sendAtlas = sendSection->getAtlas();
<a name="line844">844: </a> const Obj<typename Section::atlas_type>& recvAtlas = recvSection->getAtlas();
<a name="line845">845: </a> MPIMover<typename Section::value_type> vMover(sendSection->comm(), datatype, MPI_UNDEFINED, sendSection->debug());
<a name="line846">846: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, allocPair> sendValues;
<a name="line847">847: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, allocPair> recvValues;
<a name="line848">848: </a> typename Section::alloc_type allocator;
<a name="line850">850: </a> ///sendAtlas->view(<font color="#666666">"Send Atlas in same type copy()"</font>);
<a name="line851">851: </a> copy(sendOverlap, recvOverlap, sendAtlas, recvAtlas);
<a name="line852">852: </a> ///recvAtlas->view(<font color="#666666">"Recv Atlas after same type copy()"</font>);
<a name="line853">853: </a> const Obj<typename SendOverlap::traits::baseSequence> sRanks = sendOverlap->base();
<a name="line854">854: </a> const typename SendOverlap::traits::baseSequence::iterator sEnd = sRanks->end();
<a name="line856">856: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line857">857: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line858">858: </a> const Obj<typename SendOverlap::coneSequence>& points = sendOverlap->cone(*r_iter);
<a name="line859">859: </a> const typename SendOverlap::coneSequence::iterator pEnd = points->end();
<a name="line860">860: </a> int numVals = 0;
<a name="line862">862: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line863">863: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator c_iter = points->begin(); c_iter != pEnd; ++c_iter) {
<a name="line864">864: </a> numVals += sendSection->getFiberDimension(*c_iter);
<a name="line865">865: </a> }
<a name="line866">866: </a> typename Section::value_type *v = allocator.allocate(numVals);
<a name="line867">867: </a> int k = 0;
<a name="line869">869: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.construct(v+i, 0);}
<a name="line870">870: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator c_iter = points->begin(); c_iter != pEnd; ++c_iter) {
<a name="line871">871: </a> const typename Section::value_type *vals = sendSection->restrictPoint(*c_iter);
<a name="line872">872: </a> const int dim = sendSection->getFiberDimension(*c_iter);
<a name="line874">874: </a> <font color="#4169E1">for</font>(int i = 0; i < dim; ++i, ++k) v[k] = vals[i];
<a name="line875">875: </a> }
<a name="line876">876: </a> sendValues[*r_iter] = allocPair(numVals, v);
<a name="line877">877: </a> vMover.send(*r_iter, numVals, v);
<a name="line878">878: </a> }
<a name="line879">879: </a> const Obj<typename RecvOverlap::traits::capSequence> rRanks = recvOverlap->cap();
<a name="line880">880: </a> const typename RecvOverlap::traits::capSequence::iterator rEnd = rRanks->end();
<a name="line882">882: </a> recvSection->allocatePoint();
<a name="line883">883: </a> ///recvSection->view(<font color="#666666">"Recv Section after same type copy() allocation"</font>);
<a name="line884">884: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line885">885: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line886">886: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line887">887: </a> const typename RecvOverlap::supportSequence::iterator pEnd = points->end();
<a name="line888">888: </a> int numVals = 0;
<a name="line890">890: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line891">891: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator s_iter = points->begin(); s_iter != pEnd; ++s_iter) {
<a name="line892">892: </a> numVals += recvSection->getFiberDimension(s_iter.color());
<a name="line893">893: </a> }
<a name="line894">894: </a> typename Section::value_type *v = allocator.allocate(numVals);
<a name="line896">896: </a> recvValues[*r_iter] = allocPair(numVals, v);
<a name="line897">897: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.construct(v+i, 0);}
<a name="line898">898: </a> vMover.recv(*r_iter, numVals, v);
<a name="line899">899: </a> }
<a name="line900">900: </a> vMover.start();
<a name="line901">901: </a> vMover.end();
<a name="line902">902: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line903">903: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line904">904: </a> const typename RecvOverlap::supportSequence::iterator pEnd = points->end();
<a name="line905">905: </a> typename Section::value_type *v = recvValues[*r_iter].second;
<a name="line906">906: </a> const int numVals = recvValues[*r_iter].first;
<a name="line907">907: </a> int k = 0;
<a name="line909">909: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator s_iter = points->begin(); s_iter != pEnd; ++s_iter) {
<a name="line910">910: </a> const int size = recvSection->getFiberDimension(s_iter.color());
<a name="line912">912: </a> <font color="#4169E1">if</font> (size) {recvSection->updatePoint(s_iter.color(), &v[k]);}
<a name="line913">913: </a> k += size;
<a name="line914">914: </a> }
<a name="line915">915: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.destroy(v+i);}
<a name="line916">916: </a> allocator.deallocate(v, numVals);
<a name="line917">917: </a> }
<a name="line918">918: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line919">919: </a> typename Section::value_type *v = sendValues[*r_iter].second;
<a name="line920">920: </a> const int numVals = sendValues[*r_iter].first;
<a name="line922">922: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.destroy(v+i);}
<a name="line923">923: </a> allocator.deallocate(v, numVals);
<a name="line924">924: </a> }
<a name="line925">925: </a> //recvSection->view(<font color="#666666">"After copy"</font>);
<a name="line926">926: </a> };
<a name="line927">927: </a> // Specialize to ArrowSection
<a name="line928">928: </a> template<typename SendOverlap, typename RecvOverlap>
<a name="line929">929: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<UniformSection<MinimalArrow<int,int>,int> >& sendSection, const Obj<UniformSection<MinimalArrow<int,int>,int> >& recvSection, const MPI_Datatype datatype = MPI_DATATYPE_NULL) {
<a name="line930">930: </a> <font color="#4169E1">typedef</font> UniformSection<MinimalArrow<int,int>,int> Section;
<a name="line931">931: </a> <font color="#4169E1">typedef</font> std::pair<int, typename Section::value_type *> allocPair;
<a name="line932">932: </a> const Obj<typename Section::atlas_type>& sendAtlas = sendSection->getAtlas();
<a name="line933">933: </a> const Obj<typename Section::atlas_type>& recvAtlas = recvSection->getAtlas();
<a name="line934">934: </a> MPIMover<typename Section::value_type> vMover(sendSection->comm(), datatype, MPI_UNDEFINED, sendSection->debug());
<a name="line935">935: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, allocPair> sendValues;
<a name="line936">936: </a><strong><font color="#FF0000"> std:</font></strong>:map<int, allocPair> recvValues;
<a name="line937">937: </a> typename Section::alloc_type allocator;
<a name="line939">939: </a> copy(sendOverlap, recvOverlap, sendAtlas, recvAtlas);
<a name="line940">940: </a> const Obj<typename SendOverlap::traits::baseSequence> sRanks = sendOverlap->base();
<a name="line941">941: </a> const typename SendOverlap::traits::baseSequence::iterator sEnd = sRanks->end();
<a name="line943">943: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line944">944: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line945">945: </a> const Obj<typename SendOverlap::coneSequence>& points = sendOverlap->cone(*r_iter);
<a name="line946">946: </a> const typename SendOverlap::coneSequence::iterator pBegin = points->begin();
<a name="line947">947: </a> const typename SendOverlap::coneSequence::iterator pEnd = points->end();
<a name="line948">948: </a> int numVals = 0;
<a name="line950">950: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line951">951: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator c_iter = pBegin; c_iter != pEnd; ++c_iter) {
<a name="line952">952: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator d_iter = pBegin; d_iter != pEnd; ++d_iter) {
<a name="line953">953: </a> numVals += sendSection->getFiberDimension(typename Section::point_type(*c_iter, *d_iter));
<a name="line954">954: </a> }
<a name="line955">955: </a> }
<a name="line956">956: </a> typename Section::value_type *v = allocator.allocate(numVals);
<a name="line957">957: </a> int k = 0;
<a name="line959">959: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.construct(v+i, 0);}
<a name="line960">960: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator c_iter = pBegin; c_iter != pEnd; ++c_iter) {
<a name="line961">961: </a> <font color="#4169E1">for</font>(typename SendOverlap::coneSequence::iterator d_iter = pBegin; d_iter != pEnd; ++d_iter) {
<a name="line962">962: </a> const typename Section::point_type arrow(*c_iter, *d_iter);
<a name="line963">963: </a> const typename Section::value_type *vals = sendSection->restrictPoint(arrow);
<a name="line964">964: </a> const int dim = sendSection->getFiberDimension(arrow);
<a name="line966">966: </a> <font color="#4169E1">for</font>(int i = 0; i < dim; ++i, ++k) v[k] = vals[i];
<a name="line967">967: </a> }
<a name="line968">968: </a> }
<a name="line969">969: </a> sendValues[*r_iter] = allocPair(numVals, v);
<a name="line970">970: </a> vMover.send(*r_iter, numVals, v);
<a name="line971">971: </a> }
<a name="line972">972: </a> const Obj<typename RecvOverlap::traits::capSequence> rRanks = recvOverlap->cap();
<a name="line973">973: </a> const typename RecvOverlap::traits::capSequence::iterator rEnd = rRanks->end();
<a name="line975">975: </a> recvSection->allocatePoint();
<a name="line976">976: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line977">977: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line978">978: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line979">979: </a> const typename RecvOverlap::supportSequence::iterator pBegin = points->begin();
<a name="line980">980: </a> const typename RecvOverlap::supportSequence::iterator pEnd = points->end();
<a name="line981">981: </a> int numVals = 0;
<a name="line983">983: </a> // TODO: This should be const_iterator, but Sifter sucks
<a name="line984">984: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator s_iter = pBegin; s_iter != pEnd; ++s_iter) {
<a name="line985">985: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator t_iter = pBegin; t_iter != pEnd; ++t_iter) {
<a name="line986">986: </a> numVals += recvSection->getFiberDimension(typename Section::point_type(s_iter.color(), t_iter.color()));
<a name="line987">987: </a> }
<a name="line988">988: </a> }
<a name="line989">989: </a> typename Section::value_type *v = allocator.allocate(numVals);
<a name="line991">991: </a> recvValues[*r_iter] = allocPair(numVals, v);
<a name="line992">992: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.construct(v+i, 0);}
<a name="line993">993: </a> vMover.recv(*r_iter, numVals, v);
<a name="line994">994: </a> }
<a name="line995">995: </a> vMover.start();
<a name="line996">996: </a> vMover.end();
<a name="line997">997: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::capSequence::iterator r_iter = rRanks->begin(); r_iter != rEnd; ++r_iter) {
<a name="line998">998: </a> const Obj<typename RecvOverlap::supportSequence>& points = recvOverlap->support(*r_iter);
<a name="line999">999: </a> const typename RecvOverlap::supportSequence::iterator pBegin = points->begin();
<a name="line1000">1000: </a> const typename RecvOverlap::supportSequence::iterator pEnd = points->end();
<a name="line1001">1001: </a> typename Section::value_type *v = recvValues[*r_iter].second;
<a name="line1002">1002: </a> const int numVals = recvValues[*r_iter].first;
<a name="line1003">1003: </a> int k = 0;
<a name="line1005">1005: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator s_iter = pBegin; s_iter != pEnd; ++s_iter) {
<a name="line1006">1006: </a> <font color="#4169E1">for</font>(typename RecvOverlap::supportSequence::iterator t_iter = pBegin; t_iter != pEnd; ++t_iter) {
<a name="line1007">1007: </a> const typename Section::point_type arrow(s_iter.color(), t_iter.color());
<a name="line1008">1008: </a> const int size = recvSection->getFiberDimension(arrow);
<a name="line1010">1010: </a> <font color="#4169E1">if</font> (size) {recvSection->updatePoint(arrow, &v[k]);}
<a name="line1011">1011: </a> k += size;
<a name="line1012">1012: </a> }
<a name="line1013">1013: </a> }
<a name="line1014">1014: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.destroy(v+i);}
<a name="line1015">1015: </a> allocator.deallocate(v, numVals);
<a name="line1016">1016: </a> }
<a name="line1017">1017: </a> <font color="#4169E1">for</font>(typename SendOverlap::traits::baseSequence::iterator r_iter = sRanks->begin(); r_iter != sEnd; ++r_iter) {
<a name="line1018">1018: </a> typename Section::value_type *v = sendValues[*r_iter].second;
<a name="line1019">1019: </a> const int numVals = sendValues[*r_iter].first;
<a name="line1021">1021: </a> <font color="#4169E1">for</font>(int i = 0; i < numVals; ++i) {allocator.destroy(v+i);}
<a name="line1022">1022: </a> allocator.deallocate(v, numVals);
<a name="line1023">1023: </a> }
<a name="line1024">1024: </a> //recvSection->view(<font color="#666666">"After copy"</font>);
<a name="line1025">1025: </a> };
<a name="line1026">1026: </a> // Specialize to a ConstantSection
<a name="line1027">1027: </a><font color="#A020F0">#if 0</font>
<a name="line1028">1028: </a> template<typename SendOverlap, typename RecvOverlap, typename Value>
<a name="line1029">1029: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<ConstantSection<typename SendOverlap::source_type, Value> >& sendSection, const Obj<ConstantSection<typename SendOverlap::source_type, Value> >& recvSection) {
<a name="line1030">1030: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1031">1031: </a> };
<a name="line1032">1032: </a> template<typename SendOverlap, typename RecvOverlap, typename Value>
<a name="line1033">1033: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<IConstantSection<typename SendOverlap::source_type, Value> >& sendSection, const Obj<ConstantSection<typename SendOverlap::source_type, Value> >& recvSection) {
<a name="line1034">1034: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1035">1035: </a> };
<a name="line1036">1036: </a><font color="#A020F0">#else</font>
<a name="line1037">1037: </a> template<typename SendOverlap, typename RecvOverlap, typename Value>
<a name="line1038">1038: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<ConstantSection<typename SendOverlap::source_type, Value> >& sendSection, const Obj<ConstantSection<ALE::Pair<int, typename SendOverlap::source_type>, Value> >& recvSection) {
<a name="line1039">1039: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1040">1040: </a> };
<a name="line1041">1041: </a> template<typename SendOverlap, typename RecvOverlap, typename Value>
<a name="line1042">1042: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<IConstantSection<typename SendOverlap::source_type, Value> >& sendSection, const Obj<ConstantSection<ALE::Pair<int, typename SendOverlap::source_type>, Value> >& recvSection) {
<a name="line1043">1043: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1044">1044: </a> };
<a name="line1045">1045: </a><font color="#A020F0">#endif</font>
<a name="line1046">1046: </a> // Specialize to an IConstantSection
<a name="line1047">1047: </a> template<typename SendOverlap, typename RecvOverlap, typename Value>
<a name="line1048">1048: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<IConstantSection<typename SendOverlap::source_type, Value> >& sendSection, const Obj<IConstantSection<typename SendOverlap::source_type, Value> >& recvSection) {
<a name="line1049">1049: </a> // Why doesn't this work?
<a name="line1050">1050: </a> // This supposed to be a copy, BUT filtered through the sendOverlap
<a name="line1051">1051: </a> // However, an IConstant section does not allow filtration of its
<a name="line1052">1052: </a> // chart. Therefore, you end up with either
<a name="line1053">1053: </a> //
<a name="line1054">1054: </a> // a) Too many items in the chart, copied from the remote sendSection
<a name="line1055">1055: </a> // b) A chart mapped to the local numbering, which we <font color="#4169E1">do</font> not want
<a name="line1056">1056: </a> copyIConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1057">1057: </a> };
<a name="line1058">1058: </a> // Specialize to an BaseSection/ConstantSection pair
<a name="line1059">1059: </a><font color="#A020F0">#if 0</font>
<a name="line1060">1060: </a> template<typename SendOverlap, typename RecvOverlap, typename Sieve_>
<a name="line1061">1061: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<BaseSection<Sieve_> >& sendSection, const Obj<ConstantSection<typename SendOverlap::source_type, int> >& recvSection) {
<a name="line1062">1062: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1063">1063: </a> };
<a name="line1064">1064: </a><font color="#A020F0">#else</font>
<a name="line1065">1065: </a> template<typename SendOverlap, typename RecvOverlap, typename Sieve_>
<a name="line1066">1066: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<BaseSection<Sieve_> >& sendSection, const Obj<ConstantSection<ALE::Pair<int, typename SendOverlap::source_type>, int> >& recvSection) {
<a name="line1067">1067: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1068">1068: </a> };
<a name="line1069">1069: </a><font color="#A020F0">#endif</font>
<a name="line1070">1070: </a> // Specialize to an BaseSectionV/ConstantSection pair
<a name="line1071">1071: </a><font color="#A020F0">#if 0</font>
<a name="line1072">1072: </a> template<typename SendOverlap, typename RecvOverlap, typename Sieve_>
<a name="line1073">1073: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<BaseSectionV<Sieve_> >& sendSection, const Obj<ConstantSection<typename SendOverlap::source_type, int> >& recvSection) {
<a name="line1074">1074: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1075">1075: </a> };
<a name="line1076">1076: </a><font color="#A020F0">#else</font>
<a name="line1077">1077: </a> template<typename SendOverlap, typename RecvOverlap, typename Sieve_>
<a name="line1078">1078: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<BaseSectionV<Sieve_> >& sendSection, const Obj<ConstantSection<ALE::Pair<int, typename SendOverlap::source_type>, int> >& recvSection) {
<a name="line1079">1079: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1080">1080: </a> };
<a name="line1081">1081: </a><font color="#A020F0">#endif</font>
<a name="line1082">1082: </a> // Specialize to an LabelBaseSection/ConstantSection pair
<a name="line1083">1083: </a><font color="#A020F0">#if 0</font>
<a name="line1084">1084: </a> template<typename SendOverlap, typename RecvOverlap, typename Sieve_, typename Label_>
<a name="line1085">1085: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<LabelBaseSection<Sieve_, Label_> >& sendSection, const Obj<ConstantSection<typename SendOverlap::source_type, int> >& recvSection) {
<a name="line1086">1086: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1087">1087: </a> };
<a name="line1088">1088: </a><font color="#A020F0">#else</font>
<a name="line1089">1089: </a> template<typename SendOverlap, typename RecvOverlap, typename Sieve_, typename Label_>
<a name="line1090">1090: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<LabelBaseSection<Sieve_, Label_> >& sendSection, const Obj<ConstantSection<ALE::Pair<int, typename SendOverlap::source_type>, int> >& recvSection) {
<a name="line1091">1091: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1092">1092: </a> };
<a name="line1093">1093: </a><font color="#A020F0">#endif</font>
<a name="line1094">1094: </a> template<typename SendOverlap, typename RecvOverlap, typename Sieve_, typename Label_>
<a name="line1095">1095: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<LabelBaseSectionV<Sieve_, Label_> >& sendSection, const Obj<ConstantSection<ALE::Pair<int, typename SendOverlap::source_type>, int> >& recvSection) {
<a name="line1096">1096: </a> copyConstant(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1097">1097: </a> };
<a name="line1098">1098: </a> // Specialize to a ConstantSection <font color="#4169E1">for</font> ArrowSection
<a name="line1099">1099: </a> template<typename SendOverlap, typename RecvOverlap, typename Value>
<a name="line1100">1100: </a> static void copy(const Obj<SendOverlap>& sendOverlap, const Obj<RecvOverlap>& recvOverlap, const Obj<ConstantSection<MinimalArrow<typename SendOverlap::source_type,typename SendOverlap::source_type>, Value> >& sendSection, const Obj<ConstantSection<MinimalArrow<typename SendOverlap::source_type,typename SendOverlap::source_type>, Value> >& recvSection) {
<a name="line1101">1101: </a> copyConstantArrow(sendOverlap, recvOverlap, sendSection, recvSection);
<a name="line1102">1102: </a> };
<a name="line1103">1103: </a> };
<a name="line1104">1104: </a> class BinaryFusion {
<a name="line1105">1105: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line1106">1106: </a> template<typename OverlapSection, typename RecvOverlap, typename Section, typename Function>
<a name="line1107">1107: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, const Obj<Section>& section, Function binaryOp) {
<a name="line1108">1108: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1109">1109: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1111">1111: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1112">1112: </a> // TODO: This must become a more general iterator over colors
<a name="line1113">1113: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1114">1114: </a> // Just taking the first value
<a name="line1115">1115: </a> const typename Section::point_type& localPoint = *p_iter;
<a name="line1116">1116: </a> const typename OverlapSection::point_type& remotePoint = points->begin().color();
<a name="line1117">1117: </a> const typename OverlapSection::value_type *overlapValues = overlapSection->restrictPoint(remotePoint);
<a name="line1118">1118: </a> const typename Section::value_type *localValues = section->restrictPoint(localPoint);
<a name="line1119">1119: </a> const int dim = section->getFiberDimension(localPoint);
<a name="line1120">1120: </a> // TODO: optimize allocation
<a name="line1121">1121: </a> typename Section::value_type *values = new typename Section::value_type[dim];
<a name="line1123">1123: </a> <font color="#4169E1">for</font>(int d = 0; d < dim; ++d) {
<a name="line1124">1124: </a> values[d] = binaryOp(overlapValues[d], localValues[d]);
<a name="line1125">1125: </a> }
<a name="line1126">1126: </a> section->updatePoint(localPoint, values);
<a name="line1127">1127: </a> delete [] values;
<a name="line1128">1128: </a> }
<a name="line1129">1129: </a> };
<a name="line1130">1130: </a> };
<a name="line1131">1131: </a> class ReplacementBinaryFusion {
<a name="line1132">1132: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line1133">1133: </a> template<typename OverlapSection, typename RecvOverlap, typename Section>
<a name="line1134">1134: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, const Obj<Section>& section) {
<a name="line1135">1135: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1136">1136: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1138">1138: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1139">1139: </a> // TODO: This must become a more general iterator over colors
<a name="line1140">1140: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1141">1141: </a> // Just taking the first value
<a name="line1142">1142: </a> const typename Section::point_type& localPoint = *p_iter;
<a name="line1143">1143: </a> const typename OverlapSection::point_type& remotePoint = points->begin().color();
<a name="line1145">1145: </a> section->update(localPoint, overlapSection->restrictPoint(remotePoint));
<a name="line1146">1146: </a> }
<a name="line1147">1147: </a> };
<a name="line1148">1148: </a> };
<a name="line1149">1149: </a> class AdditiveBinaryFusion {
<a name="line1150">1150: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line1151">1151: </a> template<typename OverlapSection, typename RecvOverlap, typename Section>
<a name="line1152">1152: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, const Obj<Section>& section) {
<a name="line1153">1153: </a> <font color="#4169E1">typedef</font> typename Section::point_type point_type;
<a name="line1154">1154: </a> <font color="#4169E1">typedef</font> typename OverlapSection::point_type overlap_point_type;
<a name="line1155">1155: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1156">1156: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1158">1158: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1159">1159: </a> // TODO: This must become a more general iterator over colors
<a name="line1160">1160: </a> const typename Section::point_type& localPoint = *p_iter;
<a name="line1161">1161: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1162">1162: </a> const typename RecvOverlap::coneSequence::iterator cEnd = points->end();
<a name="line1164">1164: </a> <font color="#4169E1">for</font>(typename RecvOverlap::coneSequence::iterator c_iter = points->begin(); c_iter != cEnd; ++c_iter) {
<a name="line1165">1165: </a> const int rank = *c_iter;
<a name="line1166">1166: </a> const point_type& remotePoint = c_iter.color();
<a name="line1168">1168: </a> section->updateAddPoint(localPoint, overlapSection->restrictPoint(overlap_point_type(rank, remotePoint)));
<a name="line1169">1169: </a> }
<a name="line1170">1170: </a> }
<a name="line1171">1171: </a> };
<a name="line1172">1172: </a> };
<a name="line1173">1173: </a> class InsertionBinaryFusion {
<a name="line1174">1174: </a><strong><font color="#FF0000"> public:</font></strong>
<a name="line1175">1175: </a> // Insert the overlapSection values into section along recvOverlap
<a name="line1176">1176: </a> template<typename OverlapSection, typename RecvOverlap, typename Section>
<a name="line1177">1177: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, const Obj<Section>& section) {
<a name="line1178">1178: </a> <font color="#4169E1">typedef</font> typename Section::point_type point_type;
<a name="line1179">1179: </a> <font color="#4169E1">typedef</font> typename OverlapSection::point_type overlap_point_type;
<a name="line1180">1180: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1181">1181: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1183">1183: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1184">1184: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1185">1185: </a> const point_type& localPoint = *p_iter;
<a name="line1186">1186: </a> const int rank = *points->begin();
<a name="line1187">1187: </a> const point_type& remotePoint = points->begin().color();
<a name="line1189">1189: </a> <font color="#4169E1">if</font> (overlapSection->hasPoint(overlap_point_type(rank, remotePoint))) {
<a name="line1190">1190: </a> <font color="#4169E1">if</font> (!section->hasPoint(localPoint)) {
<a name="line1191">1191: </a><strong><font color="#FF0000"> std:</font></strong>:cout <<<font color="#666666">"["</font><<section->commRank()<<<font color="#666666">"]: Destination section does not have local point "</font> << localPoint << <font color="#666666">" remote point "</font> << remotePoint << <font color="#666666">" fiber dim "</font> << overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint)) << std::endl;
<a name="line1192">1192: </a> }
<a name="line1193">1193: </a> section->setFiberDimension(localPoint, overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint)));
<a name="line1194">1194: </a> }
<a name="line1195">1195: </a> }
<a name="line1196">1196: </a> <font color="#4169E1">if</font> (rPoints->size()) {section->allocatePoint();}
<a name="line1197">1197: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1198">1198: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1199">1199: </a> const point_type& localPoint = *p_iter;
<a name="line1200">1200: </a> const int rank = *points->begin();
<a name="line1201">1201: </a> const point_type& remotePoint = points->begin().color();
<a name="line1203">1203: </a> <font color="#4169E1">if</font> (overlapSection->hasPoint(overlap_point_type(rank, remotePoint))) {
<a name="line1204">1204: </a> section->updatePoint(localPoint, overlapSection->restrictPoint(overlap_point_type(rank, remotePoint)));
<a name="line1205">1205: </a> }
<a name="line1206">1206: </a> }
<a name="line1207">1207: </a> };
<a name="line1208">1208: </a> // Specialize to ArrowSection
<a name="line1209">1209: </a> template<typename OverlapSection, typename RecvOverlap>
<a name="line1210">1210: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, const Obj<UniformSection<MinimalArrow<int,int>,int> >& section) {
<a name="line1211">1211: </a> <font color="#4169E1">typedef</font> UniformSection<MinimalArrow<int,int>,int> Section;
<a name="line1212">1212: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1213">1213: </a> const typename RecvOverlap::traits::baseSequence::iterator rBegin = rPoints->begin();
<a name="line1214">1214: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1216">1216: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rBegin; p_iter != rEnd; ++p_iter) {
<a name="line1217">1217: </a> const Obj<typename RecvOverlap::coneSequence>& sources = recvOverlap->cone(*p_iter);
<a name="line1218">1218: </a> const typename RecvOverlap::target_type localSource = *p_iter;
<a name="line1219">1219: </a> const typename RecvOverlap::target_type remoteSource = sources->begin().color();
<a name="line1221">1221: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator q_iter = rBegin; q_iter != rEnd; ++q_iter) {
<a name="line1222">1222: </a> const Obj<typename RecvOverlap::coneSequence>& targets = recvOverlap->cone(*q_iter);
<a name="line1223">1223: </a> const typename RecvOverlap::target_type localTarget = *q_iter;
<a name="line1224">1224: </a> const typename RecvOverlap::target_type remoteTarget = targets->begin().color();
<a name="line1225">1225: </a> const typename Section::point_type localPoint(localSource, localTarget);
<a name="line1226">1226: </a> const typename OverlapSection::point_type remotePoint(remoteSource, remoteTarget);
<a name="line1228">1228: </a> <font color="#4169E1">if</font> (overlapSection->hasPoint(remotePoint)) {section->setFiberDimension(localPoint, overlapSection->getFiberDimension(remotePoint));}
<a name="line1229">1229: </a> }
<a name="line1230">1230: </a> }
<a name="line1231">1231: </a> <font color="#4169E1">if</font> (rPoints->size()) {section->allocatePoint();}
<a name="line1232">1232: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rBegin; p_iter != rEnd; ++p_iter) {
<a name="line1233">1233: </a> const Obj<typename RecvOverlap::coneSequence>& sources = recvOverlap->cone(*p_iter);
<a name="line1234">1234: </a> const typename RecvOverlap::target_type localSource = *p_iter;
<a name="line1235">1235: </a> const typename RecvOverlap::target_type remoteSource = sources->begin().color();
<a name="line1237">1237: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator q_iter = rBegin; q_iter != rEnd; ++q_iter) {
<a name="line1238">1238: </a> const Obj<typename RecvOverlap::coneSequence>& targets = recvOverlap->cone(*q_iter);
<a name="line1239">1239: </a> const typename RecvOverlap::target_type localTarget = *q_iter;
<a name="line1240">1240: </a> const typename RecvOverlap::target_type remoteTarget = targets->begin().color();
<a name="line1241">1241: </a> const typename Section::point_type localPoint(localSource, localTarget);
<a name="line1242">1242: </a> const typename OverlapSection::point_type remotePoint(remoteSource, remoteTarget);
<a name="line1243">1243: </a>
<a name="line1244">1244: </a> <font color="#4169E1">if</font> (overlapSection->hasPoint(remotePoint)) {section->updatePoint(localPoint, overlapSection->restrictPoint(remotePoint));}
<a name="line1245">1245: </a> }
<a name="line1246">1246: </a> }
<a name="line1247">1247: </a> };
<a name="line1248">1248: </a> // Specialize to the Sieve
<a name="line1249">1249: </a> template<typename OverlapSection, typename RecvOverlap, typename Renumbering, typename Point>
<a name="line1250">1250: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, Renumbering& renumbering, const Obj<Sieve<Point,Point,int> >& sieve) {
<a name="line1251">1251: </a> <font color="#4169E1">typedef</font> typename OverlapSection::point_type overlap_point_type;
<a name="line1252">1252: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1253">1253: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1255">1255: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1256">1256: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1257">1257: </a> const Point& localPoint = *p_iter;
<a name="line1258">1258: </a> const int rank = *points->begin();
<a name="line1259">1259: </a> const Point& remotePoint = points->begin().color();
<a name="line1260">1260: </a> const int size = overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint));
<a name="line1261">1261: </a> const typename OverlapSection::value_type *values = overlapSection->restrictPoint(overlap_point_type(rank, remotePoint));
<a name="line1262">1262: </a> int c = 0;
<a name="line1264">1264: </a> sieve->clearCone(localPoint);
<a name="line1265">1265: </a> <font color="#4169E1">for</font>(int i = 0; i < size; ++i, ++c) {sieve->addCone(renumbering[values[i]], localPoint, c);}
<a name="line1266">1266: </a> }
<a name="line1267">1267: </a> };
<a name="line1268">1268: </a> // Specialize to the ISieve
<a name="line1269">1269: </a> template<typename OverlapSection, typename RecvOverlap, typename Renumbering, typename Point>
<a name="line1270">1270: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, Renumbering& renumbering, const Obj<IFSieve<Point> >& sieve) {
<a name="line1271">1271: </a> <font color="#4169E1">typedef</font> typename OverlapSection::point_type overlap_point_type;
<a name="line1272">1272: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1273">1273: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1274">1274: </a> int maxSize = 0;
<a name="line1276">1276: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1277">1277: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1278">1278: </a> const Point& localPoint = *p_iter;
<a name="line1279">1279: </a> const int rank = *points->begin();
<a name="line1280">1280: </a> const Point& remotePoint = points->begin().color();
<a name="line1281">1281: </a> const int size = overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint));
<a name="line1282">1282: </a> const typename OverlapSection::value_type *values = overlapSection->restrictPoint(overlap_point_type(rank, remotePoint));
<a name="line1284">1284: </a> sieve->setConeSize(localPoint, size);
<a name="line1285">1285: </a> ///<font color="#4169E1">for</font>(int i = 0; i < size; ++i) {sieve->addSupportSize(renumbering[values[i]], 1);}
<a name="line1286">1286: </a> <font color="#4169E1">for</font>(int i = 0; i < size; ++i) {sieve->addSupportSize(renumbering[values[i].first], 1);}
<a name="line1287">1287: </a> maxSize = std::max(maxSize, size);
<a name="line1288">1288: </a> }
<a name="line1289">1289: </a> sieve->allocate();
<a name="line1290">1290: </a> ///typename OverlapSection::value_type *localValues = new typename OverlapSection::value_type[maxSize];
<a name="line1291">1291: </a> typename OverlapSection::value_type::first_type *localValues = new typename OverlapSection::value_type::first_type[maxSize];
<a name="line1292">1292: </a> typename OverlapSection::value_type::second_type *localOrientation = new typename OverlapSection::value_type::second_type[maxSize];
<a name="line1294">1294: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1295">1295: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1296">1296: </a> const Point& localPoint = *p_iter;
<a name="line1297">1297: </a> const int rank = *points->begin();
<a name="line1298">1298: </a> const Point& remotePoint = points->begin().color();
<a name="line1299">1299: </a> const int size = overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint));
<a name="line1300">1300: </a> const typename OverlapSection::value_type *values = overlapSection->restrictPoint(overlap_point_type(rank, remotePoint));
<a name="line1302">1302: </a> ///<font color="#4169E1">for</font>(int i = 0; i < size; ++i) {localValues[i] = renumbering[values[i]];}
<a name="line1303">1303: </a> <font color="#4169E1">for</font>(int i = 0; i < size; ++i) {
<a name="line1304">1304: </a> localValues[i] = renumbering[values[i].first];
<a name="line1305">1305: </a> localOrientation[i] = values[i].second;
<a name="line1306">1306: </a> }
<a name="line1307">1307: </a> sieve->setCone(localValues, localPoint);
<a name="line1308">1308: </a> sieve->setConeOrientation(localOrientation, localPoint);
<a name="line1309">1309: </a> }
<a name="line1310">1310: </a> delete [] localValues;
<a name="line1311">1311: </a> delete [] localOrientation;
<a name="line1312">1312: </a> };
<a name="line1313">1313: </a> template<typename OverlapSection, typename RecvOverlap, typename Point>
<a name="line1314">1314: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, const Obj<IFSieve<Point> >& sieve) {
<a name="line1315">1315: </a> <font color="#4169E1">typedef</font> typename OverlapSection::point_type overlap_point_type;
<a name="line1316">1316: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1317">1317: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1318">1318: </a> int maxSize = 0;
<a name="line1320">1320: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1321">1321: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1322">1322: </a> const Point& localPoint = *p_iter;
<a name="line1323">1323: </a> const int rank = *points->begin();
<a name="line1324">1324: </a> const Point& remotePoint = points->begin().color();
<a name="line1325">1325: </a> const int size = overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint));
<a name="line1326">1326: </a> const typename OverlapSection::value_type *values = overlapSection->restrictPoint(overlap_point_type(rank, remotePoint));
<a name="line1328">1328: </a> sieve->setConeSize(localPoint, size);
<a name="line1329">1329: </a> <font color="#4169E1">for</font>(int i = 0; i < size; ++i) {sieve->addSupportSize(values[i].first, 1);}
<a name="line1330">1330: </a> maxSize = std::max(maxSize, size);
<a name="line1331">1331: </a> }
<a name="line1332">1332: </a> sieve->allocate();
<a name="line1333">1333: </a> typename OverlapSection::value_type::first_type *localValues = new typename OverlapSection::value_type::first_type[maxSize];
<a name="line1334">1334: </a> typename OverlapSection::value_type::second_type *localOrientation = new typename OverlapSection::value_type::second_type[maxSize];
<a name="line1336">1336: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1337">1337: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1338">1338: </a> const Point& localPoint = *p_iter;
<a name="line1339">1339: </a> const int rank = *points->begin();
<a name="line1340">1340: </a> const Point& remotePoint = points->begin().color();
<a name="line1341">1341: </a> const int size = overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint));
<a name="line1342">1342: </a> const typename OverlapSection::value_type *values = overlapSection->restrictPoint(overlap_point_type(rank, remotePoint));
<a name="line1344">1344: </a> <font color="#4169E1">for</font>(int i = 0; i < size; ++i) {
<a name="line1345">1345: </a> localValues[i] = values[i].first;
<a name="line1346">1346: </a> localOrientation[i] = values[i].second;
<a name="line1347">1347: </a> }
<a name="line1348">1348: </a> sieve->setCone(localValues, localPoint);
<a name="line1349">1349: </a> sieve->setConeOrientation(localOrientation, localPoint);
<a name="line1350">1350: </a> }
<a name="line1351">1351: </a> delete [] localValues;
<a name="line1352">1352: </a> delete [] localOrientation;
<a name="line1353">1353: </a> };
<a name="line1354">1354: </a> // Generic
<a name="line1355">1355: </a> template<typename OverlapSection, typename RecvOverlap, typename Section, typename Bundle>
<a name="line1356">1356: </a> static void fuse(const Obj<OverlapSection>& overlapSection, const Obj<RecvOverlap>& recvOverlap, const Obj<Section>& section, const Obj<Bundle>& bundle) {
<a name="line1357">1357: </a> <font color="#4169E1">typedef</font> typename OverlapSection::point_type overlap_point_type;
<a name="line1358">1358: </a> const Obj<typename RecvOverlap::traits::baseSequence> rPoints = recvOverlap->base();
<a name="line1359">1359: </a> const typename RecvOverlap::traits::baseSequence::iterator rEnd = rPoints->end();
<a name="line1361">1361: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1362">1362: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1363">1363: </a> const typename Section::point_type& localPoint = *p_iter;
<a name="line1364">1364: </a> const int rank = *points->begin();
<a name="line1365">1365: </a> const typename OverlapSection::point_type& remotePoint = points->begin().color();
<a name="line1367">1367: </a> section->setFiberDimension(localPoint, overlapSection->getFiberDimension(overlap_point_type(rank, remotePoint)));
<a name="line1368">1368: </a> }
<a name="line1369">1369: </a> bundle->allocate(section);
<a name="line1370">1370: </a> <font color="#4169E1">for</font>(typename RecvOverlap::traits::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rEnd; ++p_iter) {
<a name="line1371">1371: </a> const Obj<typename RecvOverlap::coneSequence>& points = recvOverlap->cone(*p_iter);
<a name="line1372">1372: </a> const typename Section::point_type& localPoint = *p_iter;
<a name="line1373">1373: </a> const int rank = *points->begin();
<a name="line1374">1374: </a> const typename OverlapSection::point_type& remotePoint = points->begin().color();
<a name="line1376">1376: </a> section->update(localPoint, overlapSection->restrictPoint(overlap_point_type(rank, remotePoint)));
<a name="line1377">1377: </a> }
<a name="line1378">1378: </a> };
<a name="line1379">1379: </a> };
<a name="line1380">1380: </a> }
<a name="line1381">1381: </a>}
<a name="line1383">1383: </a><font color="#A020F0">#endif</font>
</pre>
</body>
</html>
|
