b'\n \n \n
 
\n  
sfbigmpistack (4.0)
index
user/cwp/Mbigmpistack.c
\n remap and stacks rsf files using mpi \n

\n \n \n \n \n \n
 
\n Synopsis
       sfbigmpistack nx= ny= nz= debug=n verb=n dx= dy= dz= oz= oy= ox= nf= jf= of= prefix= shots= oname=

\nAssumes that files are commonly named sequentially, e.g.:
\n
\nFile001.rsf
\nFile002.rsf
\nFile003.rsf ...
\nFileN.rsf
\n
\nSuch that all files can be represented as a prefix, which
\nis a printf like statement that will be evaluated for all
\nfiles to be included in a range.
\n
\nFor the above example the prefix would be:
\n
\nprefix="File%03d.rsf"
\n
\nThe nf, jf, and of parameters specify a range of numbers to evaluate the
\nprefix for, giving the program filenames to be used for summing
\ntogether. For example:
\n
\nnf=10,of=0,jf=1 --> (0,1,2,3,4,5,6,7,8,9,10)
\nnf=10,of=5,jf=2 --> (5,7,9,11,13,15,17,19,21,23)
\n
\nIf there are more files than processes, then this program will subdivide
\nthe files onto various processes, and run multiple rounds until
\neverything is done.
\n
\nThese must be 3D arrays (or 2D ,but with three dimensions), arrays must be
\nX-Y-Z
\na1-a2-a3
\n\n

\n \n \n \n \n \n
 
\n Parameters
       \n \n \n
\n  
bool debug=n [y/n]
\t
\n
\n \n\n \n \n
\n  
float dx=
\t
\n
\n \n\n \n \n
\n  
float dy=
\t
\n
\n \n\n \n \n
\n  
float dz=
\t
\n
\n \n\n \n \n
\n  
int jf=
\tdelta between files
\n
\n \n\n \n \n
\n  
int nf=
\tnumber of files to stack
\n
\n \n\n \n \n
\n  
int nx=
\torigin of files
\n
\n \n\n \n \n
\n  
int ny=
\torigin of files
\n
\n \n\n \n \n
\n  
int nz=
\torigin of files
\n
\n \n\n \n \n
\n  
int of=
\torigin of files
\n
\n \n\n \n \n
\n  
string oname=
\tname of output file
\n
\n \n\n \n \n
\n  
float ox=
\t
\n
\n \n\n \n \n
\n  
float oy=
\t
\n
\n \n\n \n \n
\n  
float oz=
\t
\n
\n \n\n \n \n
\n  
string prefix=
\tprintf like prefix
\n
\n \n\n \n \n
\n  
string shots=
\tname of shot file
\n
\n \n\n \n \n
\n  
bool verb=n [y/n]
\t
\n
\n \n
'