-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathAmrData.cpp
1842 lines (1609 loc) · 59.9 KB
/
AmrData.cpp
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
//
// $Id: AmrData.cpp,v 1.62 2002-08-16 00:22:33 vince Exp $
//
// ---------------------------------------------------------------
// AmrData.cpp
// ---------------------------------------------------------------
#include <winstd.H>
#include "AmrData.H"
#include "ArrayLim.H"
#include "BoxDomain.H"
#include "VisMF.H"
#include <string>
using std::string;
using std::cout;
using std::cerr;
using std::endl;
using std::min;
using std::max;
#if ! (defined(BL_Linux) || defined(BL_AIX) || defined(BL_IRIX64) || defined(WIN32) || defined(BL_CYGWIN_NT))
#define BL_ALWAYS_FIX_DENORMALS
#endif
#ifdef BL_ALWAYS_FIX_DENORMALS
#include <float.h>
#if defined(BL_T3E)
# include <fp.h>
# if (BL_USE_FLOAT)
# define DS_FP_CLASS fpclassify
# else
# define DS_FP_CLASS fpclassify
# endif
#else
# if (BL_USE_FLOAT)
# define DS_FP_CLASS fp_classf
# else
# define DS_FP_CLASS fp_class
# endif
#endif
#endif
#include <iostream>
#include <fstream>
#include <cstdio>
using std::ios;
using std::ifstream;
//
// This MUST be defined if don't have pubsetbuf() in I/O Streams Library.
//
#ifdef BL_USE_SETBUF
#define pubsetbuf setbuf
#endif
#ifdef SHOWVAL
#undef SHOWVAL
#endif
#define SHOWVAL(val) { cout << #val << " = " << val << endl; }
#ifdef VSHOWVAL
#undef VSHOWVAL
#endif
#define VSHOWVAL(verbose, val) { if(verbose) { \
cout << #val << " = " << val << endl; } }
#if defined( BL_FORT_USE_UPPERCASE )
# if (BL_SPACEDIM == 2)
# define FORT_CINTERP CINTERP2D
# define FORT_PCINTERP PCINTERP2D
# elif (BL_SPACEDIM == 3)
# define FORT_CINTERP CINTERP3D
# define FORT_PCINTERP PCINTERP3D
# endif
#elif defined( BL_FORT_USE_LOWERCASE )
# if (BL_SPACEDIM == 2)
# define FORT_CINTERP cinterp2d
# define FORT_PCINTERP pcinterp2d
# elif (BL_SPACEDIM == 3)
# define FORT_CINTERP cinterp3d
# define FORT_PCINTERP pcinterp3d
# endif
#else
# if (BL_SPACEDIM == 2)
# define FORT_CINTERP cinterp2d_
# define FORT_PCINTERP pcinterp2d_
# elif (BL_SPACEDIM == 3)
# define FORT_CINTERP cinterp3d_
# define FORT_PCINTERP pcinterp3d_
# endif
#endif
extern "C" {
void FORT_CINTERP(Real *fine, ARLIM_P(flo), ARLIM_P(fhi),
const int *fblo, const int *fbhi,
const int &nvar, const int &lratio,
const Real *crse, const int &clo, const int &chi,
const int *cslo, const int *cshi,
const int *fslo, const int *fshi,
Real *cslope, const int &c_len,
Real *fslope, Real *fdat, const int &f_len,
Real *foff);
void FORT_PCINTERP(Real *fine, ARLIM_P(flo), ARLIM_P(fhi),
const int *fblo, const int *fbhi,
const int &lrat, const int &nvar,
const Real *crse, ARLIM_P(clo), ARLIM_P(chi),
const int *cblo, const int *cbhi,
Real *temp, const int &tlo, const int &thi);
}
bool AmrData::verbose = false;
int AmrData::skipPltLines = 0;
int AmrData::sBoundaryWidth = 0;
// ---------------------------------------------------------------
AmrData::AmrData() {
probSize.resize(BL_SPACEDIM, -1.0);
probLo.resize(BL_SPACEDIM, 0.0);
probHi.resize(BL_SPACEDIM, -1.0);
plotVars.clear();
nRegions = 0;
boundaryWidth = 0;
}
// ---------------------------------------------------------------
AmrData::~AmrData() {
for(int i = 0; i < nRegions; ++i) {
for(int lev = 0; lev <= finestLevel; ++lev) {
delete regions[lev][i];
}
}
for(int lev = 0; lev <= finestLevel; ++lev) {
for(int iComp = 0; iComp < nComp; ++iComp) {
delete dataGrids[lev][iComp];
}
}
}
namespace
{
void mytrim(char* str)
{
int i = std::strlen(str);
for ( int n = i-1; n >= 0; n-- )
{
if ( str[n] > ' ' ) break;
str[n] = 0;
}
}
}
// ---------------------------------------------------------------
bool AmrData::ReadData(const string &filename, FileType filetype) {
fileType = filetype;
bCartGrid = false;
bTerrain = false;
if(filetype == FAB || filetype == MULTIFAB) {
return ReadNonPlotfileData(filename, filetype);
}
int i, j, k, width;
fileName = filename;
string File = filename;
#ifdef BL_PARALLEL_IO
File += '/';
File += "Header";
#endif /*BL_PARALLEL_IO*/
VisMF::IO_Buffer io_buffer(VisMF::IO_Buffer_Size);
ifstream isPltIn;
isPltIn.rdbuf()->pubsetbuf(io_buffer.dataPtr(), io_buffer.size());
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "AmrData::opening file = " << filename << endl;
}
}
isPltIn.open(File.c_str(), ios::in);
if(isPltIn.fail()) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Unable to open file: " << filename << endl;
}
return false;
}
char skipBuff[LINELENGTH];
for(i = 0; i < skipPltLines; ++i) {
isPltIn.getline(skipBuff, LINELENGTH);
if(ParallelDescriptor::IOProcessor()) {
cout << "Skipped line in pltfile = " << skipBuff << endl;
}
}
isPltIn >> plotFileVersion;
if(strncmp(plotFileVersion.c_str(), "CartGrid", 8) == 0) {
bCartGrid = true;
}
if(strncmp(plotFileVersion.c_str(), "Terrain", 7) == 0) {
bTerrain = true;
}
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "Plot file version: " << plotFileVersion << endl;
if(bCartGrid) {
cout << ":::: Found a CartGrid file type." << endl;
}
if(bTerrain) {
cout << ":::: Found a Terrain file type." << endl;
}
}
}
// read list of variables
isPltIn >> nComp;
if(nComp < 1 || nComp > 1024) { // arbitrarily limit to 1024
if(ParallelDescriptor::IOProcessor()) {
cerr << "Error in AmrData: bad nComp = " << nComp << endl;
}
return false;
}
if(ParallelDescriptor::IOProcessor()) {
VSHOWVAL(verbose, nComp);
}
plotVars.resize(nComp);
char plotVarName[LINELENGTH];
isPltIn.getline(plotVarName, LINELENGTH); // eat white space left by op<<
for(i = 0; i < nComp; ++i) {
isPltIn.getline(plotVarName, LINELENGTH);
mytrim(plotVarName);
plotVars[i] = plotVarName;
if(ParallelDescriptor::IOProcessor()) {
VSHOWVAL(verbose, plotVarName);
}
}
int spacedim;
isPltIn >> spacedim >> time >> finestLevel;
if(ParallelDescriptor::IOProcessor()) {
VSHOWVAL(verbose, spacedim);
VSHOWVAL(verbose, time);
VSHOWVAL(verbose, finestLevel);
}
if(spacedim != BL_SPACEDIM) {
if(ParallelDescriptor::IOProcessor()) {
cerr << endl << " ~~~~ Error: You are using " << BL_SPACEDIM
<< "D amrvis "
<< "to look at a " << spacedim << "D file." << endl << endl;
}
return false;
}
if(finestLevel < 0) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Error in AmrData: bad finestLevel = " << finestLevel << endl;
}
return false;
}
for(i = 0; i < BL_SPACEDIM; ++i) {
isPltIn >> probLo[i];
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "probLo[" << i << "] = " << probLo[i] << endl;
}
}
}
for(i = 0; i < BL_SPACEDIM; ++i) {
isPltIn >> probHi[i];
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "probHi[" << i << "] = " << probHi[i] << endl;
}
}
}
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
if(finestLevel > 0) {
cout << "Resizing refRatio to size = " << finestLevel << endl;
}
}
}
if(finestLevel == 0) {
refRatio.resize(1, 1);
} else {
refRatio.resize(finestLevel, -1);
}
while(isPltIn.get() != '\n');
bool bIVRefRatio(false);
if(isPltIn.peek() == '(') { // it is an IntVect
bIVRefRatio = true;
}
for(i = 0; i < finestLevel; ++i) {
// try to guess if refRatio is an IntVect
if(bIVRefRatio) { // it is an IntVect
IntVect ivRefRatio;
isPltIn >> ivRefRatio;
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "IntVect refRatio[" << i << "] = " << ivRefRatio << endl;
}
}
refRatio[i] = ivRefRatio[0]; // non-uniform ref ratios not supported
} else {
isPltIn >> refRatio[i];
}
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "refRatio[" << i << "] = " << refRatio[i] << endl;
}
}
}
for(i = 0; i < finestLevel; ++i ) {
if(refRatio[i] < 2 || refRatio[i] > 32 ) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Error in AmrData: bad refRatio at level " << i << " = "
<< refRatio[i] << endl;
}
return false;
}
}
while(isPltIn.get() != '\n');
probDomain.resize(finestLevel + 1);
maxDomain.resize(finestLevel + 1);
for(i = 0; i <= finestLevel; ++i) {
isPltIn >> probDomain[i];
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "probDomain[" << i << "] = " << probDomain[i] << endl;
}
}
if( ! probDomain[i].ok()) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Error in AmrData: bad probDomain[" << i << "] = "
<< probDomain[i] << endl;
}
return false;
}
}
char lstepbuff[128];
while(isPltIn.get() != '\n') {
; // do nothing
}
isPltIn.getline(lstepbuff, 128); // ignore levelsteps--some files have
// finestlevel of these, others have
// finestlevel + 1
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "Ignored levelSteps = " << lstepbuff << endl;
}
}
dxLevel.resize(finestLevel + 1);
for(i = 0; i <= finestLevel; ++i) {
dxLevel[i].resize(BL_SPACEDIM);
for(k = 0; k < BL_SPACEDIM; k++) {
isPltIn >> dxLevel[i][k];
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "dxLevel[" << i << "][" << k << "] = "
<< dxLevel[i][k] << endl;
}
}
}
}
vfEps.resize(finestLevel + 1); // must resize these even if not cartGrid
afEps.resize(finestLevel + 1);
if(bCartGrid) {
for(i = 0; i <= finestLevel; ++i) {
isPltIn >> vfEps[i];
if(verbose) {
cout << "vfEps[" << i << "] = " << vfEps[i] << endl;
}
}
}
for(i = 0; i < BL_SPACEDIM; ++i) {
probSize[i] = probHi[i] - probLo[i];
if(probSize[i] <= 0.0 ) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Error in AmrData: bad probSize[" << i << "] = "
<< probSize[i] << endl;
}
return false;
}
}
isPltIn >> coordSys;
if(ParallelDescriptor::IOProcessor()) {
VSHOWVAL(verbose, coordSys);
}
while(isPltIn.get() != '\n') {
; // do nothing
}
isPltIn >> width; // width of bndry regions
if(ParallelDescriptor::IOProcessor()) {
VSHOWVAL(verbose, width);
}
while(isPltIn.get() != '\n') {
; // do nothing
}
dataGrids.resize(finestLevel + 1);
dataGridsDefined.resize(finestLevel + 1);
int lev;
boundaryWidth = max(width, sBoundaryWidth);
bool bRestrictDomain(maxDomain[0].ok());
if(bRestrictDomain) {
for(lev = 1; lev <= finestLevel; lev++) {
maxDomain[lev] = BoxLib::refine(maxDomain[lev-1],refRatio[lev-1]);
}
}
Array<Box> restrictDomain(finestLevel + 1);
Array<Box> extendRestrictDomain(finestLevel + 1);
regions.resize(finestLevel + 1);
for(lev = 0; lev <= finestLevel; ++lev) {
restrictDomain[lev] = probDomain[lev];
if(bRestrictDomain) {
restrictDomain[lev] = maxDomain[lev];
}
extendRestrictDomain[lev] = BoxLib::grow(restrictDomain[lev],boundaryWidth);
BoxList bndry_boxes = BoxLib::boxDiff(extendRestrictDomain[lev],
restrictDomain[lev]);
nRegions = bndry_boxes.size();
BoxList::iterator bli = bndry_boxes.begin();
regions[lev].resize(nRegions);
i = 0;
while(bli != bndry_boxes.end()) {
regions[lev][i] = new FArrayBox(*bli, nComp);
if(verbose) {
if(ParallelDescriptor::IOProcessor()) {
cout << "BNDRY REGION " << i << " : " << *bli << endl;
cout << " numPts = " << bli->numPts() << endl;
}
}
++i;
++bli;
}
}
// if positive set up and read bndry databoxes
if(width > 0) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Error in AmrData: Boundary width > 0 not supported: width = "
<< width << endl;
}
return false;
} // end if(width...)
// read all grids but only save those inside the restricted region
visMF.resize(finestLevel + 1);
compIndexToVisMFMap.resize(nComp);
compIndexToVisMFComponentMap.resize(nComp);
gridLocLo.resize(finestLevel + 1);
gridLocHi.resize(finestLevel + 1);
for(i = 0; i <= finestLevel; ++i) {
int nGrids;
Real gTime;
int iLevelSteps;
isPltIn >> lev >> nGrids >> gTime >> iLevelSteps;
if(ParallelDescriptor::IOProcessor()) {
VSHOWVAL(verbose, lev);
VSHOWVAL(verbose, nGrids);
VSHOWVAL(verbose, gTime);
VSHOWVAL(verbose, iLevelSteps);
}
if(i != lev) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Level misrestart:mismatch on restart" << endl;
cerr << "Error in AmrData: Level mismatch: read level " << lev
<< " while expecting level " << i << endl;
}
return false;
}
if(nGrids < 1) {
if(ParallelDescriptor::IOProcessor()) {
cerr << "Error in AmrData: bad nGrids = " << nGrids << endl;
}
return false;
}
gridLocLo[i].resize(nGrids);
gridLocHi[i].resize(nGrids);
for(int iloc = 0; iloc < nGrids; ++iloc) {
gridLocLo[i][iloc].resize(BL_SPACEDIM);
gridLocHi[i][iloc].resize(BL_SPACEDIM);
for(int iDim = 0; iDim < BL_SPACEDIM; ++iDim) {
isPltIn >> gridLocLo[i][iloc][iDim] >> gridLocHi[i][iloc][iDim];
if(ParallelDescriptor::IOProcessor()) {
VSHOWVAL(verbose, gridLocLo[i][iloc][iDim]);
VSHOWVAL(verbose, gridLocHi[i][iloc][iDim]);
}
}
}
// here we account for multiple multifabs in a plot file
int currentIndexComp(0);
int currentVisMF(0);
dataGrids[i].resize(nComp);
dataGridsDefined[i].resize(nComp);
while(currentIndexComp < nComp) {
string mfNameRelative;
isPltIn >> mfNameRelative;
string mfName(fileName);
#ifdef BL_PARALLEL_IO
mfName += '/';
mfName += mfNameRelative;
VSHOWVAL(verbose, mfName);
VSHOWVAL(verbose, mfNameRelative);
#endif /* BL_PARALLEL_IO */
visMF[i].resize(currentVisMF + 1); // this preserves previous ones
visMF[i][currentVisMF] = new VisMF(mfName);
int iComp(currentIndexComp);
nGrow = visMF[i][currentVisMF]->nGrow();
currentIndexComp += visMF[i][currentVisMF]->nComp();
int currentVisMFComponent(0);
for( ; iComp < currentIndexComp; ++iComp) {
// make single component multifabs
// defer reading the MultiFab data
dataGrids[i][iComp] = new MultiFab(visMF[i][currentVisMF]->boxArray(), 1,
visMF[i][currentVisMF]->nGrow(),
Fab_noallocate);
dataGridsDefined[i][iComp].resize(visMF[i][currentVisMF]->size(),
false);
compIndexToVisMFMap[iComp] = currentVisMF;
compIndexToVisMFComponentMap[iComp] = currentVisMFComponent;
++currentVisMFComponent;
}
++currentVisMF;
} // end while
} // end for(i...finestLevel)
// fill a set of temporary bndry regions surrounding the
// restricted domain by extension from interior data
// only use this data in bndry regions that did not
// get better data from interior or input bndry regions
for(lev = 0; lev <= finestLevel; lev++) {
Box inbox(restrictDomain[lev]);
Box reg1(BoxLib::grow(restrictDomain[lev],boundaryWidth));
Box reg2(BoxLib::grow(probDomain[lev],width));
BoxList outside = BoxLib::boxDiff(reg1, reg2);
if(outside.size() > 0) {
// parts of the bndry have not been filled from the input
// data, must extending from interior regions
for(int idir = 0; idir < BL_SPACEDIM; idir++) {
Box bx(BoxLib::adjCellLo(inbox,idir,boundaryWidth));
Box br(bx);
for(k = 0; k < BL_SPACEDIM; k++) {
if(k != idir) {
br.grow(k,boundaryWidth);
}
}
br.shift(idir,1);
FArrayBox tmpreg(br,nComp);
Box reg_bx = tmpreg.box();
reg_bx &= inbox;
FillInterior(tmpreg,lev,reg_bx);
br.shift(idir,-1);
FArrayBox tmpreg_lo(br,nComp);
tmpreg_lo.copy(tmpreg,tmpreg.box(),0,tmpreg_lo.box(),0,nComp);
// now fill out tmp region along idir direction
Box b_lo(BoxLib::adjCellLo(inbox,idir,1));
for(k = 1; k < boundaryWidth; k++) {
Box btmp(b_lo);
btmp.shift(idir,-k);
tmpreg_lo.copy(tmpreg_lo,b_lo,0,btmp,0,nComp);
}
// now fill out temp bndry region
Box b_src, b_dest;
int n;
for(k = 1; k < BL_SPACEDIM; ++k) {
int kdir = (idir + k) % BL_SPACEDIM;
b_dest = BoxLib::adjCellLo(bx, kdir, 1);
b_src = b_dest;
b_src = b_src.shift(kdir, 1);
for(n = 1; n <= boundaryWidth; n++) {
tmpreg_lo.copy(tmpreg_lo, b_src, 0, b_dest, 0, nComp);
b_dest.shift(kdir, -1);
}
b_dest = BoxLib::adjCellHi(bx,kdir,1);
b_src = b_dest;
b_src.shift(kdir,-1);
for(n = 1; n <= boundaryWidth; n++) {
tmpreg_lo.copy(tmpreg_lo,b_src,0,b_dest,0,nComp);
b_dest.shift(kdir,1);
}
bx.grow(kdir,boundaryWidth);
}
// now copy into real bndry regions
for(j = 0; j < nRegions; j++) {
FArrayBox *p = regions[lev][j];
Box p_box = p->box();
BoxList::iterator bli = outside.begin();
while(bli != outside.end()) {
Box ovlp(p_box);
ovlp &= *bli;
ovlp &= br;
if(ovlp.ok()) {
p->copy(tmpreg_lo, ovlp);
}
++bli;
}
} // end for j
// now work on the high side of the bndry region
bx = BoxLib::adjCellHi(inbox,idir,boundaryWidth);
br = bx;
for(k = 0; k < BL_SPACEDIM; k++) {
if(k != idir) br.grow(k, boundaryWidth);
}
br.shift(idir,-1);
FArrayBox tmpreg2(br,nComp);
reg_bx = tmpreg2.box();
reg_bx &= inbox;
FillInterior(tmpreg2,lev,reg_bx);
br.shift(idir,1);
FArrayBox tmpreg_hi(br,nComp);
tmpreg_hi.copy(tmpreg2,tmpreg2.box(),0,tmpreg_hi.box(),0,nComp);
// now fill out tmp region along idir direction
Box b_hi(BoxLib::adjCellHi(inbox,idir,1));
for(k = 1; k < boundaryWidth; k++) {
Box btmp(b_hi);
btmp.shift(idir,k);
tmpreg_hi.copy(tmpreg_hi,b_hi,0,btmp,0,nComp);
}
// now fill out temp bndry region
for(k = 1; k < BL_SPACEDIM; k++) {
int kdir = (idir + k) % BL_SPACEDIM;
b_dest = BoxLib::adjCellLo(bx, kdir, 1);
b_src = b_dest;
b_src.shift(kdir, 1);
for(n = 1; n <= boundaryWidth; n++) {
tmpreg_hi.copy(tmpreg_hi, b_src, 0, b_dest, 0, nComp);
b_dest.shift(kdir,-1);
}
b_dest = BoxLib::adjCellHi(bx, kdir, 1);
b_src = b_dest;
b_src.shift(kdir, -1);
for(n = 1; n <= boundaryWidth; n++) {
tmpreg_hi.copy(tmpreg_hi, b_src, 0, b_dest, 0, nComp);
b_dest.shift(kdir, 1);
}
bx.grow(kdir, boundaryWidth);
}
// now copy into real bndry regions
for(j = 0; j < nRegions; j++) {
FArrayBox *p = regions[lev][j];
Box p_box = p->box();
BoxList::iterator bli = outside.begin();
while(bli != outside.end()) {
Box ovlp(p_box);
ovlp &= *bli;
ovlp &= br;
if(ovlp.ok()) {
p->copy(tmpreg_hi, ovlp);
}
++bli;
}
} // end for j
} // end for(idir...)
} // end if(outside.size())...
outside.clear();
} // end for(lev...)
if(bRestrictDomain) {
Array<Real> p_lo(BL_SPACEDIM), p_hi(BL_SPACEDIM);
LoNodeLoc(0,maxDomain[0].smallEnd(),p_lo);
HiNodeLoc(0,maxDomain[0].bigEnd(),p_hi);
for(i = 0; i < BL_SPACEDIM; ++i) {
probLo[i] = p_lo[i];
probHi[i] = p_hi[i];
probSize[i] = p_hi[i] - p_lo[i];
}
for(lev = 0; lev <= finestLevel; ++lev) {
probDomain[lev] = maxDomain[lev];
}
}
return true;
} // end ReadData
// ---------------------------------------------------------------
bool AmrData::ReadNonPlotfileData(const string &filename, FileType filetype) {
int i;
if(verbose) {
cout << "AmrPlot::opening file = " << filename << endl;
}
fileName = filename;
#ifdef BL_USE_SETBUF
VisMF::IO_Buffer io_buffer(VisMF::IO_Buffer_Size);
#endif
time = 0;
if(fileType == FAB) {
finestLevel = 0;
} else if(fileType == MULTIFAB) {
finestLevel = 1; // level zero is filler
}
probDomain.resize(finestLevel + 1);
maxDomain.resize(finestLevel + 1);
dxLevel.resize(finestLevel + 1);
refRatio.resize(finestLevel + 1);
if(fileType == FAB) {
refRatio[0] = 1;
} else if(fileType == MULTIFAB) {
refRatio[0] = 2;
}
for(int iLevel(0); iLevel <= finestLevel; ++iLevel) {
dxLevel[iLevel].resize(BL_SPACEDIM);
for(i = 0; i < BL_SPACEDIM; ++i) {
probLo[i] = 0.0;
probHi[i] = 1.0; // arbitrarily
probSize[i] = probHi[i] - probLo[i];
dxLevel[iLevel][i] = 0.0; // temporarily
}
}
dataGrids.resize(finestLevel + 1);
dataGridsDefined.resize(finestLevel + 1);
if(fileType == FAB) {
ifstream is;
is.open(filename.c_str(), ios::in);
if(is.fail()) {
cerr << "Unable to open plotfile: " << filename << endl;
return false;
}
#ifdef BL_USE_SETBUF
is.rdbuf()->setbuf(io_buffer.dataPtr(), io_buffer.size());
#endif
FArrayBox *newfab = new FArrayBox;
nComp = newfab->readFrom(is, 0); // read the first component
Box fabbox(newfab->box());
fabBoxArray.resize(1);
fabBoxArray.set(0, fabbox);
dataGrids[0].resize(nComp);
dataGridsDefined[0].resize(nComp);
dataGridsDefined[0][0].resize(1);
dataGrids[0][0] = new MultiFab;
int nGrow(0);
dataGrids[0][0]->define(fabBoxArray, 0, nGrow, Fab_noallocate);
dataGrids[0][0]->setFab(0, newfab);
dataGridsDefined[0][0][0] = true;
// read subsequent components
// need to optimize this for lazy i/o
for(int iComp = 1; iComp < nComp; ++iComp) {
dataGrids[0][iComp] = new MultiFab;
dataGrids[0][iComp]->define(fabBoxArray, 0, nGrow, Fab_noallocate);
newfab = new FArrayBox;
is.seekg(0, ios::beg);
newfab->readFrom(is, iComp); // read the iComp component
dataGrids[0][iComp]->setFab(0, newfab);
dataGridsDefined[0][iComp].resize(1);
dataGridsDefined[0][iComp][0] = true;
}
char fabname[64]; // arbitrarily
plotVars.resize(nComp);
for(i = 0; i < nComp; ++i) {
sprintf(fabname, "%s%d", "Fab_", i);
plotVars[i] = fabname;
}
probDomain[0] = newfab->box();
for(i = 0; i < BL_SPACEDIM; ++i) {
dxLevel[0][i] = 1.0 / probDomain[0].length(i);
}
is.close();
} else if(fileType == MULTIFAB) {
VisMF tempVisMF(filename);
nComp = tempVisMF.nComp();
probDomain[1] = tempVisMF.boxArray().minimalBox();
probDomain[0] = probDomain[1];
probDomain[0].coarsen(refRatio[0]);
BoxArray mfBoxArray(tempVisMF.boxArray());
BoxArray levelZeroBoxArray;
levelZeroBoxArray.resize(1);
levelZeroBoxArray.set(0, probDomain[0]);
dataGrids[0].resize(nComp, NULL);
dataGrids[1].resize(nComp, NULL);
dataGridsDefined[0].resize(nComp);
dataGridsDefined[1].resize(nComp);
fabBoxArray.resize(1);
fabBoxArray.set(0, probDomain[0]);
int nGrow(0);
char fabname[64]; // arbitrarily
plotVars.resize(nComp);
for(int iComp(0); iComp < nComp; ++iComp) {
sprintf(fabname, "%s%d", "MultiFab_", iComp);
plotVars[iComp] = fabname;
for(int iDim(0); iDim < BL_SPACEDIM; ++iDim) {
dxLevel[0][iDim] = 1.0 / probDomain[0].length(iDim);
dxLevel[1][iDim] = 1.0 / probDomain[1].length(iDim);
}
// set the level zero multifab
dataGridsDefined[0][iComp].resize(1, false);
dataGrids[0][iComp] = new MultiFab;
dataGrids[0][iComp]->define(levelZeroBoxArray, 0, nGrow, Fab_noallocate);
FArrayBox *newfab = new FArrayBox(probDomain[0], 1);
Real levelZeroValue(tempVisMF.min(0, iComp) -
((tempVisMF.max(0, iComp) - tempVisMF.min(0, iComp)) / 256.0));
newfab->setVal(levelZeroValue);
dataGrids[0][iComp]->setFab(0, newfab);
dataGridsDefined[0][iComp][0] = true;
} // end for(iComp...)
// set the level one multifab
// here we account for multiple multifabs in a plot file
int currentIndexComp(0);
int currentVisMF(0);
visMF.resize(finestLevel + 1);
compIndexToVisMFMap.resize(nComp);
compIndexToVisMFComponentMap.resize(nComp);
while(currentIndexComp < nComp) {
visMF[1].resize(currentVisMF + 1); // this preserves previous ones
visMF[1][currentVisMF] = new VisMF(filename);
int iComp(currentIndexComp);
nGrow = visMF[1][currentVisMF]->nGrow();
currentIndexComp += visMF[1][currentVisMF]->nComp();
for(int currentVisMFComponent(0); iComp < currentIndexComp; ++iComp) {
// make single component multifabs for level one
dataGrids[1][iComp] = new MultiFab(visMF[1][currentVisMF]->boxArray(), 1,
visMF[1][currentVisMF]->nGrow(),
Fab_noallocate);
dataGridsDefined[1][iComp].resize(visMF[1][currentVisMF]->size(),
false);
compIndexToVisMFMap[iComp] = currentVisMF;
compIndexToVisMFComponentMap[iComp] = currentVisMFComponent;
++currentVisMFComponent;
}
++currentVisMF;
} // end while
} // end if(fileType...)
return true;
}
// ---------------------------------------------------------------
void AmrData::CellLoc(int lev, IntVect ix, Array<Real> &pos) const {
BL_ASSERT(pos.size() == dxLevel[lev].size());
for(int i(0); i < BL_SPACEDIM; ++i) {
pos[i] = probLo[i] + (dxLevel[lev][i])*(0.5 + Real(ix[i]));
}
}
// ---------------------------------------------------------------
void AmrData::LoNodeLoc(int lev, IntVect ix, Array<Real> &pos) const {
BL_ASSERT(pos.size() == dxLevel[lev].size());
for(int i(0); i < BL_SPACEDIM; ++i) {
pos[i] = probLo[i] + (dxLevel[lev][i])*Real(ix[i]);
}
}
// ---------------------------------------------------------------
void AmrData::HiNodeLoc(int lev, IntVect ix, Array<Real> &pos) const {
BL_ASSERT(pos.size() == dxLevel[lev].size());
for(int i(0); i < BL_SPACEDIM; ++i) {
pos[i] = probLo[i] + (dxLevel[lev][i])*Real(ix[i]+1);
}
}
// ---------------------------------------------------------------
void AmrData::IntVectFromLocation(const int finestFillLevel,
const Array<Real> &location,
IntVect &ivLoc, int &ivLevel,
IntVect &ivFinestFillLev)
{
BL_ASSERT(location.size() == BL_SPACEDIM);
BL_ASSERT(finestFillLevel <= finestLevel);
int ffl(finestFillLevel);
for(int i(0); i < BL_SPACEDIM; ++i) {
int ival = probDomain[ffl].smallEnd()[i] +
((int) ( (location[i] - probLo[i]) / dxLevel[ffl][i] ) );
ivFinestFillLev.setVal(i, ival);
}
}
// ---------------------------------------------------------------
void AmrData::FillVar(FArrayBox *destFab, const Box &destBox,
int finestFillLevel, const string &varname, int procWithFabs)
{
Array<FArrayBox *> destFabs(1);
Array<Box> destBoxes(1);
destFabs[0] = destFab;
destBoxes[0] = destBox;
FillVar(destFabs, destBoxes, finestFillLevel, varname, procWithFabs);
}
// ---------------------------------------------------------------
void AmrData::FillVar(MultiFab &destMultiFab, int finestFillLevel,
const string &varname, int destcomp)
{
int numFillComps(1);
Array<string> varNames(numFillComps);
Array<int> destComps(numFillComps);
varNames[0] = varname;
destComps[0] = destcomp;
FillVar(destMultiFab, finestFillLevel, varNames, destComps);
}
// ---------------------------------------------------------------
void AmrData::FillVar(MultiFab &destMultiFab, int finestFillLevel,
const Array<string> &varNames,
const Array<int> &destFillComps)
{
// This function fills the destMultiFab which is defined on
// the finestFillLevel.
BL_ASSERT(finestFillLevel >= 0 && finestFillLevel <= finestLevel);
BoxArray destBoxes(destMultiFab.boxArray());
for(int iIndex = 0; iIndex < destBoxes.size(); ++iIndex) {
BL_ASSERT(probDomain[finestFillLevel].contains(destBoxes[iIndex]));
}
int myProc(ParallelDescriptor::MyProc());
int srcComp(0); // always 0 since AmrData uses single component MultiFabs
int nFillComps(1); // always
int currentLevel;
Array<int> cumulativeRefRatios(finestFillLevel + 1, -1);
cumulativeRefRatios[finestFillLevel] = 1;
for(currentLevel = finestFillLevel - 1; currentLevel >= 0; --currentLevel) {
cumulativeRefRatios[currentLevel] = cumulativeRefRatios[currentLevel + 1] *
refRatio[currentLevel];
}
BL_ASSERT(varNames.size() == destFillComps.size());
int nFillVars(varNames.size());
for(int currentFillIndex(0); currentFillIndex < nFillVars; ++currentFillIndex) {
int destComp(destFillComps[currentFillIndex]);
int stateIndex(StateNumber(varNames[currentFillIndex]));