fmm_pts.txx 133 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432
  1. /**
  2. * \file fmm_pts.txx
  3. * \author Dhairya Malhotra, dhairya.malhotra@gmail.com
  4. * \date 3-07-2011
  5. * \brief This file contains the implementation of the FMM_Pts class.
  6. */
  7. #include <stdio.h>
  8. #include <mpi.h>
  9. #include <set>
  10. #include <sstream>
  11. #include <fft_wrapper.hpp>
  12. #include <mat_utils.hpp>
  13. #ifdef PVFMM_HAVE_SYS_STAT_H
  14. #include <sys/stat.h>
  15. #endif
  16. #ifdef __SSE__
  17. #include <xmmintrin.h>
  18. #endif
  19. #ifdef __SSE3__
  20. #include <pmmintrin.h>
  21. #endif
  22. #ifdef __AVX__
  23. #include <immintrin.h>
  24. #endif
  25. #ifdef __INTEL_OFFLOAD
  26. #include <immintrin.h>
  27. #endif
  28. #ifdef __INTEL_OFFLOAD0
  29. #pragma offload_attribute(push,target(mic))
  30. #endif
  31. namespace pvfmm{
  32. /**
  33. * \brief Returns the coordinates of points on the surface of a cube.
  34. * \param[in] p Number of points on an edge of the cube is (n+1)
  35. * \param[in] c Coordinates to the centre of the cube (3D array).
  36. * \param[in] alpha Scaling factor for the size of the cube.
  37. * \param[in] depth Depth of the cube in the octree.
  38. * \return Vector with coordinates of points on the surface of the cube in the
  39. * format [x0 y0 z0 x1 y1 z1 .... ].
  40. */
  41. template <class Real_t>
  42. std::vector<Real_t> surface(int p, Real_t* c, Real_t alpha, int depth){
  43. size_t n_=(6*(p-1)*(p-1)+2); //Total number of points.
  44. std::vector<Real_t> coord(n_*3);
  45. coord[0]=coord[1]=coord[2]=-1.0;
  46. size_t cnt=1;
  47. for(int i=0;i<p-1;i++)
  48. for(int j=0;j<p-1;j++){
  49. coord[cnt*3 ]=-1.0;
  50. coord[cnt*3+1]=(2.0*(i+1)-p+1)/(p-1);
  51. coord[cnt*3+2]=(2.0*j-p+1)/(p-1);
  52. cnt++;
  53. }
  54. for(int i=0;i<p-1;i++)
  55. for(int j=0;j<p-1;j++){
  56. coord[cnt*3 ]=(2.0*i-p+1)/(p-1);
  57. coord[cnt*3+1]=-1.0;
  58. coord[cnt*3+2]=(2.0*(j+1)-p+1)/(p-1);
  59. cnt++;
  60. }
  61. for(int i=0;i<p-1;i++)
  62. for(int j=0;j<p-1;j++){
  63. coord[cnt*3 ]=(2.0*(i+1)-p+1)/(p-1);
  64. coord[cnt*3+1]=(2.0*j-p+1)/(p-1);
  65. coord[cnt*3+2]=-1.0;
  66. cnt++;
  67. }
  68. for(size_t i=0;i<(n_/2)*3;i++)
  69. coord[cnt*3+i]=-coord[i];
  70. Real_t r = 0.5*pow(0.5,depth);
  71. Real_t b = alpha*r;
  72. for(size_t i=0;i<n_;i++){
  73. coord[i*3+0]=(coord[i*3+0]+1.0)*b+c[0];
  74. coord[i*3+1]=(coord[i*3+1]+1.0)*b+c[1];
  75. coord[i*3+2]=(coord[i*3+2]+1.0)*b+c[2];
  76. }
  77. return coord;
  78. }
  79. /**
  80. * \brief Returns the coordinates of points on the upward check surface of cube.
  81. * \see surface()
  82. */
  83. template <class Real_t>
  84. std::vector<Real_t> u_check_surf(int p, Real_t* c, int depth){
  85. Real_t r=0.5*pow(0.5,depth);
  86. Real_t coord[3]={c[0]-r*(RAD1-1.0),c[1]-r*(RAD1-1.0),c[2]-r*(RAD1-1.0)};
  87. return surface(p,coord,(Real_t)RAD1,depth);
  88. }
  89. /**
  90. * \brief Returns the coordinates of points on the upward equivalent surface of cube.
  91. * \see surface()
  92. */
  93. template <class Real_t>
  94. std::vector<Real_t> u_equiv_surf(int p, Real_t* c, int depth){
  95. Real_t r=0.5*pow(0.5,depth);
  96. Real_t coord[3]={c[0]-r*(RAD0-1.0),c[1]-r*(RAD0-1.0),c[2]-r*(RAD0-1.0)};
  97. return surface(p,coord,(Real_t)RAD0,depth);
  98. }
  99. /**
  100. * \brief Returns the coordinates of points on the downward check surface of cube.
  101. * \see surface()
  102. */
  103. template <class Real_t>
  104. std::vector<Real_t> d_check_surf(int p, Real_t* c, int depth){
  105. Real_t r=0.5*pow(0.5,depth);
  106. Real_t coord[3]={c[0]-r*(RAD0-1.0),c[1]-r*(RAD0-1.0),c[2]-r*(RAD0-1.0)};
  107. return surface(p,coord,(Real_t)RAD0,depth);
  108. }
  109. /**
  110. * \brief Returns the coordinates of points on the downward equivalent surface of cube.
  111. * \see surface()
  112. */
  113. template <class Real_t>
  114. std::vector<Real_t> d_equiv_surf(int p, Real_t* c, int depth){
  115. Real_t r=0.5*pow(0.5,depth);
  116. Real_t coord[3]={c[0]-r*(RAD1-1.0),c[1]-r*(RAD1-1.0),c[2]-r*(RAD1-1.0)};
  117. return surface(p,coord,(Real_t)RAD1,depth);
  118. }
  119. /**
  120. * \brief Defines the 3D grid for convolution in FFT acceleration of V-list.
  121. * \see surface()
  122. */
  123. template <class Real_t>
  124. std::vector<Real_t> conv_grid(int p, Real_t* c, int depth){
  125. Real_t r=pow(0.5,depth);
  126. Real_t a=r*RAD0;
  127. Real_t coord[3]={c[0],c[1],c[2]};
  128. int n1=p*2;
  129. int n2=(int)pow((Real_t)n1,2);
  130. int n3=(int)pow((Real_t)n1,3);
  131. std::vector<Real_t> grid(n3*3);
  132. for(int i=0;i<n1;i++)
  133. for(int j=0;j<n1;j++)
  134. for(int k=0;k<n1;k++){
  135. grid[(i+n1*j+n2*k)*3+0]=(i-p)*a/(p-1)+coord[0];
  136. grid[(i+n1*j+n2*k)*3+1]=(j-p)*a/(p-1)+coord[1];
  137. grid[(i+n1*j+n2*k)*3+2]=(k-p)*a/(p-1)+coord[2];
  138. }
  139. return grid;
  140. }
  141. #ifdef __INTEL_OFFLOAD0
  142. #pragma offload_attribute(pop)
  143. #endif
  144. template <class Real_t>
  145. void FMM_Data<Real_t>::Clear(){
  146. upward_equiv.Resize(0);
  147. }
  148. template <class Real_t>
  149. PackedData FMM_Data<Real_t>::PackMultipole(void* buff_ptr){
  150. PackedData p0; p0.data=buff_ptr;
  151. p0.length=upward_equiv.Dim()*sizeof(Real_t);
  152. if(p0.length==0) return p0;
  153. if(p0.data==NULL) p0.data=(char*)&upward_equiv[0];
  154. else mem::memcopy(p0.data,&upward_equiv[0],p0.length);
  155. return p0;
  156. }
  157. template <class Real_t>
  158. void FMM_Data<Real_t>::AddMultipole(PackedData p0){
  159. Real_t* data=(Real_t*)p0.data;
  160. size_t n=p0.length/sizeof(Real_t);
  161. assert(upward_equiv.Dim()==n);
  162. Matrix<Real_t> v0(1,n,&upward_equiv[0],false);
  163. Matrix<Real_t> v1(1,n,data,false);
  164. v0+=v1;
  165. }
  166. template <class Real_t>
  167. void FMM_Data<Real_t>::InitMultipole(PackedData p0, bool own_data){
  168. Real_t* data=(Real_t*)p0.data;
  169. size_t n=p0.length/sizeof(Real_t);
  170. if(own_data){
  171. if(n>0) upward_equiv=Vector<Real_t>(n, &data[0], false);
  172. }else{
  173. if(n>0) upward_equiv.ReInit(n, &data[0], false);
  174. }
  175. }
  176. template <class FMMNode>
  177. FMM_Pts<FMMNode>::~FMM_Pts() {
  178. if(mat!=NULL){
  179. // int rank;
  180. // MPI_Comm_rank(comm,&rank);
  181. // if(rank==0) mat->Save2File("Precomp.data");
  182. delete mat;
  183. mat=NULL;
  184. }
  185. if(vprecomp_fft_flag) FFTW_t<Real_t>::fft_destroy_plan(vprecomp_fftplan);
  186. #ifdef __INTEL_OFFLOAD0
  187. #pragma offload target(mic:0)
  188. #endif
  189. {
  190. if(vlist_fft_flag ) FFTW_t<Real_t>::fft_destroy_plan(vlist_fftplan );
  191. if(vlist_ifft_flag) FFTW_t<Real_t>::fft_destroy_plan(vlist_ifftplan);
  192. vlist_fft_flag =false;
  193. vlist_ifft_flag=false;
  194. }
  195. }
  196. template <class FMMNode>
  197. void FMM_Pts<FMMNode>::Initialize(int mult_order, const MPI_Comm& comm_, const Kernel<Real_t>* kernel_, const Kernel<Real_t>* aux_kernel_){
  198. Profile::Tic("InitFMM_Pts",&comm_,true);{
  199. multipole_order=mult_order;
  200. comm=comm_;
  201. kernel=*kernel_;
  202. aux_kernel=*(aux_kernel_?aux_kernel_:kernel_);
  203. assert(kernel.ker_dim[0]==aux_kernel.ker_dim[0]);
  204. mat=new PrecompMat<Real_t>(Homogen(), MAX_DEPTH+1);
  205. if(this->mat_fname.size()==0){
  206. std::stringstream st;
  207. st<<PVFMM_PRECOMP_DATA_PATH;
  208. if(!st.str().size()){ // look in PVFMM_DIR
  209. char* pvfmm_dir = getenv ("PVFMM_DIR");
  210. if(pvfmm_dir) st<<pvfmm_dir<<'/';
  211. }
  212. #ifndef STAT_MACROS_BROKEN
  213. if(st.str().size()){ // check if the path is a directory
  214. struct stat stat_buff;
  215. if(stat(st.str().c_str(), &stat_buff) || !S_ISDIR(stat_buff.st_mode)){
  216. std::cout<<"error: path not found: "<<st.str()<<'\n';
  217. exit(0);
  218. }
  219. }
  220. #endif
  221. st<<"Precomp_"<<kernel.ker_name.c_str()<<"_m"<<mult_order<<(typeid(Real_t)==typeid(float)?"_f":"")<<".data";
  222. this->mat_fname=st.str();
  223. }
  224. this->mat->LoadFile(mat_fname.c_str(), this->comm);
  225. interac_list.Initialize(COORD_DIM, this->mat);
  226. Profile::Tic("PrecompUC2UE",&comm,false,4);
  227. this->PrecompAll(UC2UE_Type);
  228. Profile::Toc();
  229. Profile::Tic("PrecompDC2DE",&comm,false,4);
  230. this->PrecompAll(DC2DE_Type);
  231. Profile::Toc();
  232. Profile::Tic("PrecompBC",&comm,false,4);
  233. { /*
  234. int type=BC_Type;
  235. for(int l=0;l<MAX_DEPTH;l++)
  236. for(size_t indx=0;indx<this->interac_list.ListCount((Mat_Type)type);indx++){
  237. Matrix<Real_t>& M=this->mat->Mat(l, (Mat_Type)type, indx);
  238. M.Resize(0,0);
  239. } // */
  240. }
  241. this->PrecompAll(BC_Type,0);
  242. Profile::Toc();
  243. Profile::Tic("PrecompU2U",&comm,false,4);
  244. this->PrecompAll(U2U_Type);
  245. Profile::Toc();
  246. Profile::Tic("PrecompD2D",&comm,false,4);
  247. this->PrecompAll(D2D_Type);
  248. Profile::Toc();
  249. Profile::Tic("PrecompV",&comm,false,4);
  250. this->PrecompAll(V_Type);
  251. Profile::Toc();
  252. Profile::Tic("PrecompV1",&comm,false,4);
  253. this->PrecompAll(V1_Type);
  254. Profile::Toc();
  255. }Profile::Toc();
  256. }
  257. template <class FMMNode>
  258. Permutation<typename FMMNode::Real_t>& FMM_Pts<FMMNode>::PrecompPerm(Mat_Type type, Perm_Type perm_indx){
  259. //Check if the matrix already exists.
  260. Permutation<Real_t>& P_ = mat->Perm((Mat_Type)type, perm_indx);
  261. if(P_.Dim()!=0) return P_;
  262. Matrix<size_t> swap_xy(10,9);
  263. Matrix<size_t> swap_xz(10,9);
  264. {
  265. for(int i=0;i<9;i++)
  266. for(int j=0;j<9;j++){
  267. swap_xy[i][j]=j;
  268. swap_xz[i][j]=j;
  269. }
  270. swap_xy[3][0]=1; swap_xy[3][1]=0; swap_xy[3][2]=2;
  271. swap_xz[3][0]=2; swap_xz[3][1]=1; swap_xz[3][2]=0;
  272. swap_xy[6][0]=1; swap_xy[6][1]=0; swap_xy[6][2]=2;
  273. swap_xy[6][3]=4; swap_xy[6][4]=3; swap_xy[6][5]=5;
  274. swap_xz[6][0]=2; swap_xz[6][1]=1; swap_xz[6][2]=0;
  275. swap_xz[6][3]=5; swap_xz[6][4]=4; swap_xz[6][5]=3;
  276. swap_xy[9][0]=4; swap_xy[9][1]=3; swap_xy[9][2]=5;
  277. swap_xy[9][3]=1; swap_xy[9][4]=0; swap_xy[9][5]=2;
  278. swap_xy[9][6]=7; swap_xy[9][7]=6; swap_xy[9][8]=8;
  279. swap_xz[9][0]=8; swap_xz[9][1]=7; swap_xz[9][2]=6;
  280. swap_xz[9][3]=5; swap_xz[9][4]=4; swap_xz[9][5]=3;
  281. swap_xz[9][6]=2; swap_xz[9][7]=1; swap_xz[9][8]=0;
  282. }
  283. //Compute the matrix.
  284. Permutation<Real_t> P;
  285. switch (type){
  286. case UC2UE_Type:
  287. {
  288. break;
  289. }
  290. case DC2DE_Type:
  291. {
  292. break;
  293. }
  294. case S2U_Type:
  295. {
  296. break;
  297. }
  298. case U2U_Type:
  299. {
  300. break;
  301. }
  302. case D2D_Type:
  303. {
  304. Real_t eps=1e-10;
  305. int dof=kernel.ker_dim[0];
  306. size_t p_indx=perm_indx % C_Perm;
  307. Real_t c[3]={-0.5,-0.5,-0.5};
  308. std::vector<Real_t> trg_coord=d_check_surf(this->MultipoleOrder(),c,0);
  309. int n_trg=trg_coord.size()/3;
  310. P=Permutation<Real_t>(n_trg*dof);
  311. if(p_indx==ReflecX || p_indx==ReflecY || p_indx==ReflecZ){
  312. for(int i=0;i<n_trg;i++)
  313. for(int j=0;j<n_trg;j++){
  314. if(fabs(trg_coord[i*3+0]-trg_coord[j*3+0]*(p_indx==ReflecX?-1.0:1.0))<eps)
  315. if(fabs(trg_coord[i*3+1]-trg_coord[j*3+1]*(p_indx==ReflecY?-1.0:1.0))<eps)
  316. if(fabs(trg_coord[i*3+2]-trg_coord[j*3+2]*(p_indx==ReflecZ?-1.0:1.0))<eps){
  317. for(int k=0;k<dof;k++){
  318. P.perm[j*dof+k]=i*dof+k;
  319. }
  320. }
  321. }
  322. if(dof==3) //stokes_vel (and like kernels)
  323. for(int j=0;j<n_trg;j++)
  324. P.scal[j*dof+(int)p_indx]*=-1.0;
  325. }else if(p_indx==SwapXY || p_indx==SwapXZ)
  326. for(int i=0;i<n_trg;i++)
  327. for(int j=0;j<n_trg;j++){
  328. if(fabs(trg_coord[i*3+0]-trg_coord[j*3+(p_indx==SwapXY?1:2)])<eps)
  329. if(fabs(trg_coord[i*3+1]-trg_coord[j*3+(p_indx==SwapXY?0:1)])<eps)
  330. if(fabs(trg_coord[i*3+2]-trg_coord[j*3+(p_indx==SwapXY?2:0)])<eps){
  331. for(int k=0;k<dof;k++){
  332. P.perm[j*dof+k]=i*dof+(p_indx==SwapXY?swap_xy[dof][k]:swap_xz[dof][k]);
  333. }
  334. }
  335. }
  336. break;
  337. }
  338. case D2T_Type:
  339. {
  340. break;
  341. }
  342. case U0_Type:
  343. {
  344. break;
  345. }
  346. case U1_Type:
  347. {
  348. break;
  349. }
  350. case U2_Type:
  351. {
  352. break;
  353. }
  354. case V_Type:
  355. {
  356. break;
  357. }
  358. case V1_Type:
  359. {
  360. break;
  361. }
  362. case W_Type:
  363. {
  364. break;
  365. }
  366. case X_Type:
  367. {
  368. break;
  369. }
  370. case BC_Type:
  371. {
  372. break;
  373. }
  374. default:
  375. break;
  376. }
  377. //Save the matrix for future use.
  378. #pragma omp critical (PRECOMP_MATRIX_PTS)
  379. {
  380. if(P_.Dim()==0) P_=P;
  381. }
  382. return P_;
  383. }
  384. template <class FMMNode>
  385. Matrix<typename FMMNode::Real_t>& FMM_Pts<FMMNode>::Precomp(int level, Mat_Type type, size_t mat_indx){
  386. if(this->Homogen()) level=0;
  387. //Check if the matrix already exists.
  388. Matrix<Real_t>& M_ = this->mat->Mat(level, type, mat_indx);
  389. if(M_.Dim(0)!=0 && M_.Dim(1)!=0) return M_;
  390. else{ //Compute matrix from symmetry class (if possible).
  391. size_t class_indx = this->interac_list.InteracClass(type, mat_indx);
  392. if(class_indx!=mat_indx){
  393. Matrix<Real_t>& M0 = this->Precomp(level, type, class_indx);
  394. Permutation<Real_t>& Pr = this->interac_list.Perm_R(level, type, mat_indx);
  395. Permutation<Real_t>& Pc = this->interac_list.Perm_C(level, type, mat_indx);
  396. if(Pr.Dim()>0 && Pc.Dim()>0 && M0.Dim(0)>0 && M0.Dim(1)>0) return M_;
  397. }
  398. }
  399. //Compute the matrix.
  400. Matrix<Real_t> M;
  401. int* ker_dim=kernel.ker_dim;
  402. int* aux_ker_dim=aux_kernel.ker_dim;
  403. //int omp_p=omp_get_max_threads();
  404. switch (type){
  405. case UC2UE_Type:
  406. {
  407. // Coord of upward check surface
  408. Real_t c[3]={0,0,0};
  409. std::vector<Real_t> uc_coord=u_check_surf(MultipoleOrder(),c,level);
  410. size_t n_uc=uc_coord.size()/3;
  411. // Coord of upward equivalent surface
  412. std::vector<Real_t> ue_coord=u_equiv_surf(MultipoleOrder(),c,level);
  413. size_t n_ue=ue_coord.size()/3;
  414. // Evaluate potential at check surface due to equivalent surface.
  415. Matrix<Real_t> M_e2c(n_ue*aux_ker_dim[0],n_uc*aux_ker_dim[1]);
  416. Kernel<Real_t>::Eval(&ue_coord[0], n_ue,
  417. &uc_coord[0], n_uc, &(M_e2c[0][0]),
  418. aux_kernel.ker_poten, aux_ker_dim);
  419. M=M_e2c.pinv(); //check 2 equivalent
  420. break;
  421. }
  422. case DC2DE_Type:
  423. {
  424. // Coord of downward check surface
  425. Real_t c[3]={0,0,0};
  426. std::vector<Real_t> check_surf=d_check_surf(MultipoleOrder(),c,level);
  427. size_t n_ch=check_surf.size()/3;
  428. // Coord of downward equivalent surface
  429. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),c,level);
  430. size_t n_eq=equiv_surf.size()/3;
  431. // Evaluate potential at check surface due to equivalent surface.
  432. Matrix<Real_t> M_e2c(n_eq*aux_ker_dim[0],n_ch*aux_ker_dim[1]);
  433. Kernel<Real_t>::Eval(&equiv_surf[0], n_eq,
  434. &check_surf[0], n_ch, &(M_e2c[0][0]),
  435. aux_kernel.ker_poten,aux_ker_dim);
  436. M=M_e2c.pinv(); //check 2 equivalent
  437. break;
  438. }
  439. case S2U_Type:
  440. {
  441. break;
  442. }
  443. case U2U_Type:
  444. {
  445. // Coord of upward check surface
  446. Real_t c[3]={0,0,0};
  447. std::vector<Real_t> check_surf=u_check_surf(MultipoleOrder(),c,level);
  448. size_t n_uc=check_surf.size()/3;
  449. // Coord of child's upward equivalent surface
  450. Real_t s=pow(0.5,(level+2));
  451. int* coord=interac_list.RelativeCoord(type,mat_indx);
  452. Real_t child_coord[3]={(coord[0]+1)*s,(coord[1]+1)*s,(coord[2]+1)*s};
  453. std::vector<Real_t> equiv_surf=u_equiv_surf(MultipoleOrder(),child_coord,level+1);
  454. size_t n_ue=equiv_surf.size()/3;
  455. // Evaluate potential at check surface due to equivalent surface.
  456. Matrix<Real_t> M_ce2c(n_ue*aux_ker_dim[0],n_uc*aux_ker_dim[1]);
  457. Kernel<Real_t>::Eval(&equiv_surf[0], n_ue,
  458. &check_surf[0], n_uc, &(M_ce2c[0][0]),
  459. aux_kernel.ker_poten, aux_ker_dim);
  460. Matrix<Real_t>& M_c2e = Precomp(level, UC2UE_Type, 0);
  461. M=M_ce2c*M_c2e;
  462. break;
  463. }
  464. case D2D_Type:
  465. {
  466. // Coord of downward check surface
  467. Real_t s=pow(0.5,level+1);
  468. int* coord=interac_list.RelativeCoord(type,mat_indx);
  469. Real_t c[3]={(coord[0]+1)*s,(coord[1]+1)*s,(coord[2]+1)*s};
  470. std::vector<Real_t> check_surf=d_check_surf(MultipoleOrder(),c,level);
  471. size_t n_dc=check_surf.size()/3;
  472. // Coord of parent's downward equivalent surface
  473. Real_t parent_coord[3]={0,0,0};
  474. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),parent_coord,level-1);
  475. size_t n_de=equiv_surf.size()/3;
  476. // Evaluate potential at check surface due to equivalent surface.
  477. Matrix<Real_t> M_pe2c(n_de*aux_ker_dim[0],n_dc*aux_ker_dim[1]);
  478. Kernel<Real_t>::Eval(&equiv_surf[0], n_de,
  479. &check_surf[0], n_dc, &(M_pe2c[0][0]),
  480. aux_kernel.ker_poten,aux_ker_dim);
  481. Matrix<Real_t>& M_c2e=Precomp(level,DC2DE_Type,0);
  482. M=M_pe2c*M_c2e;
  483. break;
  484. }
  485. case D2T_Type:
  486. {
  487. std::vector<Real_t>& rel_trg_coord=mat->RelativeTrgCoord();
  488. // Coord of target points
  489. Real_t r=pow(0.5,level);
  490. size_t n_trg=rel_trg_coord.size()/3;
  491. std::vector<Real_t> trg_coord(n_trg*3);
  492. for(size_t i=0;i<n_trg*COORD_DIM;i++) trg_coord[i]=rel_trg_coord[i]*r;
  493. // Coord of downward equivalent surface
  494. Real_t c[3]={0,0,0};
  495. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),c,level);
  496. size_t n_eq=equiv_surf.size()/3;
  497. // Evaluate potential at target points due to equivalent surface.
  498. {
  499. M .Resize(n_eq*ker_dim [0], n_trg*ker_dim [1]);
  500. kernel.BuildMatrix(&equiv_surf[0], n_eq, &trg_coord[0], n_trg, &(M [0][0]));
  501. }
  502. break;
  503. }
  504. case U0_Type:
  505. {
  506. break;
  507. }
  508. case U1_Type:
  509. {
  510. break;
  511. }
  512. case U2_Type:
  513. {
  514. break;
  515. }
  516. case V_Type:
  517. {
  518. int n1=MultipoleOrder()*2;
  519. int n3 =n1*n1*n1;
  520. int n3_=n1*n1*(n1/2+1);
  521. //Compute the matrix.
  522. Real_t s=pow(0.5,level);
  523. int* coord2=interac_list.RelativeCoord(type,mat_indx);
  524. Real_t coord_diff[3]={coord2[0]*s,coord2[1]*s,coord2[2]*s};
  525. //Evaluate potential.
  526. std::vector<Real_t> r_trg(COORD_DIM,0.0);
  527. std::vector<Real_t> conv_poten(n3*aux_ker_dim[0]*aux_ker_dim[1]);
  528. std::vector<Real_t> conv_coord=conv_grid(MultipoleOrder(),coord_diff,level);
  529. Kernel<Real_t>::Eval(&conv_coord[0],n3,&r_trg[0],1,&conv_poten[0],aux_kernel.ker_poten,aux_ker_dim);
  530. //Rearrange data.
  531. Matrix<Real_t> M_conv(n3,aux_ker_dim[0]*aux_ker_dim[1],&conv_poten[0],false);
  532. M_conv=M_conv.Transpose();
  533. //Compute FFTW plan.
  534. int nnn[3]={n1,n1,n1};
  535. void *fftw_in, *fftw_out;
  536. fftw_in = fftw_malloc( n3 *aux_ker_dim[0]*aux_ker_dim[1]*sizeof(Real_t));
  537. fftw_out = fftw_malloc(2*n3_*aux_ker_dim[0]*aux_ker_dim[1]*sizeof(Real_t));
  538. #pragma omp critical (FFTW_PLAN)
  539. {
  540. if (!vprecomp_fft_flag){
  541. vprecomp_fftplan = FFTW_t<Real_t>::fft_plan_many_dft_r2c(COORD_DIM, nnn, aux_ker_dim[0]*aux_ker_dim[1],
  542. (Real_t*)fftw_in, NULL, 1, n3, (typename FFTW_t<Real_t>::cplx*) fftw_out, NULL, 1, n3_, FFTW_ESTIMATE);
  543. vprecomp_fft_flag=true;
  544. }
  545. }
  546. //Compute FFT.
  547. mem::memcopy(fftw_in, &conv_poten[0], n3*aux_ker_dim[0]*aux_ker_dim[1]*sizeof(Real_t));
  548. FFTW_t<Real_t>::fft_execute_dft_r2c(vprecomp_fftplan, (Real_t*)fftw_in, (typename FFTW_t<Real_t>::cplx*)(fftw_out));
  549. Matrix<Real_t> M_(2*n3_*aux_ker_dim[0]*aux_ker_dim[1],1,(Real_t*)fftw_out,false);
  550. M=M_;
  551. //Free memory.
  552. fftw_free(fftw_in);
  553. fftw_free(fftw_out);
  554. break;
  555. }
  556. case V1_Type:
  557. {
  558. size_t mat_cnt =interac_list.ListCount( V_Type);
  559. for(size_t k=0;k<mat_cnt;k++) Precomp(level, V_Type, k);
  560. const size_t chld_cnt=1UL<<COORD_DIM;
  561. size_t n1=MultipoleOrder()*2;
  562. size_t M_dim=n1*n1*(n1/2+1);
  563. size_t n3=n1*n1*n1;
  564. Vector<Real_t> zero_vec(M_dim*aux_ker_dim[0]*aux_ker_dim[1]*2);
  565. zero_vec.SetZero();
  566. Vector<Real_t*> M_ptr(chld_cnt*chld_cnt);
  567. for(size_t i=0;i<chld_cnt*chld_cnt;i++) M_ptr[i]=&zero_vec[0];
  568. int* rel_coord_=interac_list.RelativeCoord(V1_Type, mat_indx);
  569. for(int j1=0;j1<chld_cnt;j1++)
  570. for(int j2=0;j2<chld_cnt;j2++){
  571. int rel_coord[3]={rel_coord_[0]*2-(j1/1)%2+(j2/1)%2,
  572. rel_coord_[1]*2-(j1/2)%2+(j2/2)%2,
  573. rel_coord_[2]*2-(j1/4)%2+(j2/4)%2};
  574. for(size_t k=0;k<mat_cnt;k++){
  575. int* ref_coord=interac_list.RelativeCoord(V_Type, k);
  576. if(ref_coord[0]==rel_coord[0] &&
  577. ref_coord[1]==rel_coord[1] &&
  578. ref_coord[2]==rel_coord[2]){
  579. Matrix<Real_t>& M = this->mat->Mat(level, V_Type, k);
  580. M_ptr[j2*chld_cnt+j1]=&M[0][0];
  581. break;
  582. }
  583. }
  584. }
  585. // Build matrix aux_ker_dim0 x aux_ker_dim1 x M_dim x 8 x 8
  586. M.Resize(aux_ker_dim[0]*aux_ker_dim[1]*M_dim, 2*chld_cnt*chld_cnt);
  587. for(int j=0;j<aux_ker_dim[0]*aux_ker_dim[1]*M_dim;j++){
  588. for(size_t k=0;k<chld_cnt*chld_cnt;k++){
  589. M[j][k*2+0]=M_ptr[k][j*2+0]/n3;
  590. M[j][k*2+1]=M_ptr[k][j*2+1]/n3;
  591. }
  592. }
  593. break;
  594. }
  595. case W_Type:
  596. {
  597. std::vector<Real_t>& rel_trg_coord=mat->RelativeTrgCoord();
  598. // Coord of target points
  599. Real_t s=pow(0.5,level);
  600. size_t n_trg=rel_trg_coord.size()/3;
  601. std::vector<Real_t> trg_coord(n_trg*3);
  602. for(size_t j=0;j<n_trg*COORD_DIM;j++) trg_coord[j]=rel_trg_coord[j]*s;
  603. // Coord of downward equivalent surface
  604. int* coord2=interac_list.RelativeCoord(type,mat_indx);
  605. Real_t c[3]={(coord2[0]+1)*s*0.25,(coord2[1]+1)*s*0.25,(coord2[2]+1)*s*0.25};
  606. std::vector<Real_t> equiv_surf=u_equiv_surf(MultipoleOrder(),c,level+1);
  607. size_t n_eq=equiv_surf.size()/3;
  608. // Evaluate potential at target points due to equivalent surface.
  609. {
  610. M .Resize(n_eq*ker_dim [0],n_trg*ker_dim [1]);
  611. kernel.BuildMatrix(&equiv_surf[0], n_eq, &trg_coord[0], n_trg, &(M [0][0]));
  612. }
  613. break;
  614. }
  615. case X_Type:
  616. {
  617. break;
  618. }
  619. case BC_Type:
  620. {
  621. size_t mat_cnt_m2m=interac_list.ListCount(U2U_Type);
  622. size_t n_surf=(6*(MultipoleOrder()-1)*(MultipoleOrder()-1)+2); //Total number of points.
  623. if((M.Dim(0)!=n_surf*aux_ker_dim[0] || M.Dim(1)!=n_surf*aux_ker_dim[1]) && level==0){
  624. Matrix<Real_t> M_m2m[BC_LEVELS+1];
  625. Matrix<Real_t> M_m2l[BC_LEVELS+1];
  626. Matrix<Real_t> M_l2l[BC_LEVELS+1];
  627. Matrix<Real_t> M_zero_avg(n_surf*aux_ker_dim[0],n_surf*aux_ker_dim[0]);
  628. { // Set average multipole charge to zero. (improves stability for large BC_LEVELS)
  629. M_zero_avg.SetZero();
  630. for(size_t i=0;i<n_surf*aux_ker_dim[0];i++)
  631. M_zero_avg[i][i]+=1;
  632. for(size_t i=0;i<n_surf;i++)
  633. for(size_t j=0;j<n_surf;j++)
  634. for(size_t k=0;k<aux_ker_dim[0];k++)
  635. M_zero_avg[i*aux_ker_dim[0]+k][j*aux_ker_dim[0]+k]-=1.0/n_surf;
  636. }
  637. for(int level=0; level>-BC_LEVELS; level--){
  638. M_l2l[-level] = this->Precomp(level, D2D_Type, 0);
  639. if(M_l2l[-level].Dim(0)==0 || M_l2l[-level].Dim(1)==0){
  640. Matrix<Real_t>& M0 = interac_list.ClassMat(level, D2D_Type, 0);
  641. Permutation<Real_t>& Pr = this->interac_list.Perm_R(level, D2D_Type, 0);
  642. Permutation<Real_t>& Pc = this->interac_list.Perm_C(level, D2D_Type, 0);
  643. M_l2l[-level] = Pr*M0*Pc;
  644. }
  645. M_m2m[-level] = M_zero_avg*this->Precomp(level, U2U_Type, 0);
  646. for(size_t mat_indx=1; mat_indx<mat_cnt_m2m; mat_indx++)
  647. M_m2m[-level] += M_zero_avg*this->Precomp(level, U2U_Type, mat_indx);
  648. }
  649. for(int level=-BC_LEVELS;level<=0;level++){
  650. if(!Homogen() || level==-BC_LEVELS){
  651. Real_t s=(1UL<<(-level));
  652. Real_t ue_coord[3]={0,0,0};
  653. Real_t dc_coord[3]={0,0,0};
  654. std::vector<Real_t> src_coord=u_equiv_surf(MultipoleOrder(), ue_coord, level);
  655. std::vector<Real_t> trg_coord=d_check_surf(MultipoleOrder(), dc_coord, level);
  656. Matrix<Real_t> M_ue2dc(n_surf*aux_ker_dim[0], n_surf*aux_ker_dim[1]);
  657. M_ue2dc.SetZero();
  658. for(int x0=-2;x0<4;x0++)
  659. for(int x1=-2;x1<4;x1++)
  660. for(int x2=-2;x2<4;x2++)
  661. if(abs(x0)>1 || abs(x1)>1 || abs(x2)>1){
  662. ue_coord[0]=x0*s; ue_coord[1]=x1*s; ue_coord[2]=x2*s;
  663. std::vector<Real_t> src_coord=u_equiv_surf(MultipoleOrder(), ue_coord, level);
  664. Matrix<Real_t> M_tmp(n_surf*aux_ker_dim[0], n_surf*aux_ker_dim[1]);
  665. Kernel<Real_t>::Eval(&src_coord[0], n_surf,
  666. &trg_coord[0], n_surf, &(M_tmp[0][0]),
  667. aux_kernel.ker_poten, aux_ker_dim);
  668. M_ue2dc+=M_tmp;
  669. }
  670. // Shift by constant.
  671. Real_t scale_adj=(Homogen()?pow(0.5, level*aux_kernel.poten_scale):1);
  672. for(size_t i=0;i<M_ue2dc.Dim(0);i++){
  673. std::vector<Real_t> avg(aux_ker_dim[1],0);
  674. for(size_t j=0; j<M_ue2dc.Dim(1); j+=aux_ker_dim[1])
  675. for(int k=0; k<aux_ker_dim[1]; k++) avg[k]+=M_ue2dc[i][j+k];
  676. for(int k=0; k<aux_ker_dim[1]; k++) avg[k]/=n_surf;
  677. for(size_t j=0; j<M_ue2dc.Dim(1); j+=aux_ker_dim[1])
  678. for(int k=0; k<aux_ker_dim[1]; k++) M_ue2dc[i][j+k]=(M_ue2dc[i][j+k]-avg[k])*scale_adj;
  679. }
  680. Matrix<Real_t>& M_dc2de = Precomp(level, DC2DE_Type, 0);
  681. M_m2l[-level]=M_ue2dc*M_dc2de;
  682. }else M_m2l[-level]=M_m2l[1-level];
  683. if(level==-BC_LEVELS) M = M_m2l[-level];
  684. else M = M_m2l[-level] + M_m2m[-level]*M*M_l2l[-level];
  685. { // Shift by constant. (improves stability for large BC_LEVELS)
  686. Matrix<Real_t> M_de2dc(n_surf*aux_ker_dim[0], n_surf*aux_ker_dim[1]);
  687. { // M_de2dc TODO: For homogeneous kernels, compute only once.
  688. // Coord of downward check surface
  689. Real_t c[3]={0,0,0};
  690. std::vector<Real_t> check_surf=d_check_surf(MultipoleOrder(),c,0);
  691. size_t n_ch=check_surf.size()/3;
  692. // Coord of downward equivalent surface
  693. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),c,0);
  694. size_t n_eq=equiv_surf.size()/3;
  695. // Evaluate potential at check surface due to equivalent surface.
  696. Kernel<Real_t>::Eval(&equiv_surf[0], n_eq,
  697. &check_surf[0], n_ch, &(M_de2dc[0][0]),
  698. aux_kernel.ker_poten,aux_ker_dim);
  699. }
  700. Matrix<Real_t> M_ue2dc=M*M_de2dc;
  701. for(size_t i=0;i<M_ue2dc.Dim(0);i++){
  702. std::vector<Real_t> avg(aux_ker_dim[1],0);
  703. for(size_t j=0; j<M_ue2dc.Dim(1); j+=aux_ker_dim[1])
  704. for(int k=0; k<aux_ker_dim[1]; k++) avg[k]+=M_ue2dc[i][j+k];
  705. for(int k=0; k<aux_ker_dim[1]; k++) avg[k]/=n_surf;
  706. for(size_t j=0; j<M_ue2dc.Dim(1); j+=aux_ker_dim[1])
  707. for(int k=0; k<aux_ker_dim[1]; k++) M_ue2dc[i][j+k]-=avg[k];
  708. }
  709. Matrix<Real_t>& M_dc2de = Precomp(level, DC2DE_Type, 0);
  710. M=M_ue2dc*M_dc2de;
  711. }
  712. }
  713. { // ax+by+cz+d correction.
  714. std::vector<Real_t> corner_pts;
  715. corner_pts.push_back(0); corner_pts.push_back(0); corner_pts.push_back(0);
  716. corner_pts.push_back(1); corner_pts.push_back(0); corner_pts.push_back(0);
  717. corner_pts.push_back(0); corner_pts.push_back(1); corner_pts.push_back(0);
  718. corner_pts.push_back(0); corner_pts.push_back(0); corner_pts.push_back(1);
  719. size_t n_corner=corner_pts.size()/3;
  720. // Coord of downward equivalent surface
  721. Real_t c[3]={0,0,0};
  722. std::vector<Real_t> up_equiv_surf=u_equiv_surf(MultipoleOrder(),c,0);
  723. std::vector<Real_t> dn_equiv_surf=d_equiv_surf(MultipoleOrder(),c,0);
  724. std::vector<Real_t> dn_check_surf=d_check_surf(MultipoleOrder(),c,0);
  725. Matrix<Real_t> M_err;
  726. { // Evaluate potential at corner due to upward and dnward equivalent surface.
  727. { // Error from local expansion.
  728. Matrix<Real_t> M_e2pt(n_surf*aux_ker_dim[0],n_corner*aux_ker_dim[1]);
  729. Kernel<Real_t>::Eval(&dn_equiv_surf[0], n_surf,
  730. &corner_pts[0], n_corner, &(M_e2pt[0][0]),
  731. aux_kernel.ker_poten,aux_ker_dim);
  732. M_err=M*M_e2pt;
  733. }
  734. for(size_t k=0;k<4;k++){ // Error from colleagues of root.
  735. for(int j0=-1;j0<=1;j0++)
  736. for(int j1=-1;j1<=1;j1++)
  737. for(int j2=-1;j2<=1;j2++){
  738. Real_t pt_coord[3]={corner_pts[k*COORD_DIM+0]-j0,
  739. corner_pts[k*COORD_DIM+1]-j1,
  740. corner_pts[k*COORD_DIM+2]-j2};
  741. if(fabs(pt_coord[0]-0.5)>1.0 || fabs(pt_coord[1]-0.5)>1.0 || fabs(pt_coord[2]-0.5)>1.0){
  742. Matrix<Real_t> M_e2pt(n_surf*aux_ker_dim[0],aux_ker_dim[1]);
  743. Kernel<Real_t>::Eval(&up_equiv_surf[0], n_surf,
  744. &pt_coord[0], 1, &(M_e2pt[0][0]),
  745. aux_kernel.ker_poten,aux_ker_dim);
  746. for(size_t i=0;i<M_e2pt.Dim(0);i++)
  747. for(size_t j=0;j<M_e2pt.Dim(1);j++)
  748. M_err[i][k*aux_ker_dim[1]+j]+=M_e2pt[i][j];
  749. }
  750. }
  751. }
  752. }
  753. Matrix<Real_t> M_grad(M_err.Dim(0),n_surf*aux_ker_dim[1]);
  754. for(size_t i=0;i<M_err.Dim(0);i++)
  755. for(size_t k=0;k<aux_ker_dim[1];k++)
  756. for(size_t j=0;j<n_surf;j++){
  757. M_grad[i][j*aux_ker_dim[1]+k]=(M_err[i][0*aux_ker_dim[1]+k] )*1.0 +
  758. (M_err[i][1*aux_ker_dim[1]+k]-M_err[i][0*aux_ker_dim[1]+k])*dn_check_surf[j*COORD_DIM+0]+
  759. (M_err[i][2*aux_ker_dim[1]+k]-M_err[i][0*aux_ker_dim[1]+k])*dn_check_surf[j*COORD_DIM+1]+
  760. (M_err[i][3*aux_ker_dim[1]+k]-M_err[i][0*aux_ker_dim[1]+k])*dn_check_surf[j*COORD_DIM+2];
  761. }
  762. Matrix<Real_t>& M_dc2de = Precomp(0, DC2DE_Type, 0);
  763. M-=M_grad*M_dc2de;
  764. }
  765. { // Free memory
  766. Mat_Type type=D2D_Type;
  767. for(int l=-BC_LEVELS;l<0;l++)
  768. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  769. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  770. M.Resize(0,0);
  771. }
  772. type=U2U_Type;
  773. for(int l=-BC_LEVELS;l<0;l++)
  774. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  775. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  776. M.Resize(0,0);
  777. }
  778. type=DC2DE_Type;
  779. for(int l=-BC_LEVELS;l<0;l++)
  780. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  781. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  782. M.Resize(0,0);
  783. }
  784. type=UC2UE_Type;
  785. for(int l=-BC_LEVELS;l<0;l++)
  786. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  787. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  788. M.Resize(0,0);
  789. }
  790. }
  791. }
  792. break;
  793. }
  794. default:
  795. break;
  796. }
  797. //Save the matrix for future use.
  798. #pragma omp critical (PRECOMP_MATRIX_PTS)
  799. if(M_.Dim(0)==0 && M_.Dim(1)==0){
  800. M_=M;
  801. /*
  802. M_.Resize(M.Dim(0),M.Dim(1));
  803. int dof=aux_ker_dim[0]*aux_ker_dim[1];
  804. for(int j=0;j<dof;j++){
  805. size_t a=(M.Dim(0)*M.Dim(1)* j )/dof;
  806. size_t b=(M.Dim(0)*M.Dim(1)*(j+1))/dof;
  807. #pragma omp parallel for // NUMA
  808. for(int tid=0;tid<omp_p;tid++){
  809. size_t a_=a+((b-a)* tid )/omp_p;
  810. size_t b_=a+((b-a)*(tid+1))/omp_p;
  811. mem::memcopy(&M_[0][a_], &M[0][a_], (b_-a_)*sizeof(Real_t));
  812. }
  813. }
  814. */
  815. }
  816. return M_;
  817. }
  818. template <class FMMNode>
  819. void FMM_Pts<FMMNode>::PrecompAll(Mat_Type type, int level){
  820. int depth=(Homogen()?1:MAX_DEPTH);
  821. if(level==-1){
  822. for(int l=0;l<depth;l++){
  823. std::stringstream level_str;
  824. level_str<<"level="<<l;
  825. PrecompAll(type, l);
  826. }
  827. return;
  828. }
  829. //Compute basic permutations.
  830. for(size_t i=0;i<Perm_Count;i++)
  831. this->PrecompPerm(type, (Perm_Type) i);
  832. {
  833. //Allocate matrices.
  834. size_t mat_cnt=interac_list.ListCount((Mat_Type)type);
  835. mat->Mat(level, (Mat_Type)type, mat_cnt-1);
  836. { // Compute InteracClass matrices.
  837. std::vector<size_t> indx_lst;
  838. for(size_t i=0; i<mat_cnt; i++){
  839. if(interac_list.InteracClass((Mat_Type)type,i)==i)
  840. indx_lst.push_back(i);
  841. }
  842. //Compute Transformations.
  843. //#pragma omp parallel for //lets use fine grained parallelism
  844. for(size_t i=0; i<indx_lst.size(); i++){
  845. Precomp(level, (Mat_Type)type, indx_lst[i]);
  846. }
  847. }
  848. //#pragma omp parallel for //lets use fine grained parallelism
  849. for(size_t mat_indx=0;mat_indx<mat_cnt;mat_indx++){
  850. Matrix<Real_t>& M0=interac_list.ClassMat(level,(Mat_Type)type,mat_indx);
  851. assert(M0.Dim(0)>0 && M0.Dim(1)>0);
  852. Permutation<Real_t>& pr=interac_list.Perm_R(level, (Mat_Type)type, mat_indx);
  853. Permutation<Real_t>& pc=interac_list.Perm_C(level, (Mat_Type)type, mat_indx);
  854. if(pr.Dim()!=M0.Dim(0) || pc.Dim()!=M0.Dim(1)) Precomp(level, (Mat_Type)type, mat_indx);
  855. }
  856. }
  857. }
  858. template <class FMMNode>
  859. void FMM_Pts<FMMNode>::CollectNodeData(std::vector<FMMNode*>& node, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, std::vector<size_t> extra_size){
  860. if( buff.size()<7) buff.resize(7);
  861. if( n_list.size()<7) n_list.resize(7);
  862. if(node.size()==0) return;
  863. {// 0. upward_equiv
  864. int indx=0;
  865. Matrix<Real_t>& M_uc2ue = this->interac_list.ClassMat(0, UC2UE_Type, 0);
  866. size_t vec_sz=M_uc2ue.Dim(1);
  867. std::vector< FMMNode* > node_lst;
  868. {
  869. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  870. FMMNode_t* r_node=NULL;
  871. for(size_t i=0;i<node.size();i++){
  872. if(!node[i]->IsLeaf())
  873. node_lst_[node[i]->Depth()].push_back(node[i]);
  874. if(node[i]->Depth()==0) r_node=node[i];
  875. }
  876. size_t chld_cnt=1UL<<COORD_DIM;
  877. for(int i=0;i<=MAX_DEPTH;i++)
  878. for(size_t j=0;j<node_lst_[i].size();j++)
  879. for(size_t k=0;k<chld_cnt;k++)
  880. node_lst.push_back((FMMNode_t*)node_lst_[i][j]->Child(k));
  881. if(r_node!=NULL) node_lst.push_back(r_node);
  882. }
  883. n_list[indx]=node_lst;
  884. size_t buff_size=node_lst.size()*vec_sz;
  885. buff_size+=(extra_size.size()>indx?extra_size[indx]:0);
  886. buff[indx].Resize(1,buff_size);
  887. #pragma omp parallel for
  888. for(size_t i=0;i<node_lst.size();i++){
  889. Vector<Real_t>& upward_equiv=node_lst[i]->FMMData()->upward_equiv;
  890. upward_equiv.ReInit(vec_sz, buff[indx][0]+i*vec_sz, false);
  891. upward_equiv.SetZero();
  892. }
  893. buff[indx].AllocDevice(true);
  894. }
  895. {// 1. dnward_equiv
  896. int indx=1;
  897. Matrix<Real_t>& M_dc2de = this->interac_list.ClassMat(0, DC2DE_Type, 0);
  898. size_t vec_sz=M_dc2de.Dim(1);
  899. std::vector< FMMNode* > node_lst;
  900. {
  901. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  902. FMMNode_t* r_node=NULL;
  903. for(size_t i=0;i<node.size();i++){
  904. if(!node[i]->IsLeaf() && !node[i]->IsGhost())
  905. node_lst_[node[i]->Depth()].push_back(node[i]);
  906. if(node[i]->Depth()==0) r_node=node[i];
  907. }
  908. size_t chld_cnt=1UL<<COORD_DIM;
  909. for(int i=0;i<=MAX_DEPTH;i++)
  910. for(size_t j=0;j<node_lst_[i].size();j++)
  911. for(size_t k=0;k<chld_cnt;k++)
  912. node_lst.push_back((FMMNode_t*)node_lst_[i][j]->Child(k));
  913. if(r_node!=NULL) node_lst.push_back(r_node);
  914. }
  915. n_list[indx]=node_lst;
  916. size_t buff_size=node_lst.size()*vec_sz;
  917. buff_size+=(extra_size.size()>indx?extra_size[indx]:0);
  918. buff[indx].Resize(1,buff_size);
  919. #pragma omp parallel for
  920. for(size_t i=0;i<node_lst.size();i++){
  921. Vector<Real_t>& dnward_equiv=node_lst[i]->FMMData()->dnward_equiv;
  922. dnward_equiv.ReInit(vec_sz, buff[indx][0]+i*vec_sz, false);
  923. dnward_equiv.SetZero();
  924. }
  925. buff[indx].AllocDevice(true);
  926. }
  927. {// 2. upward_equiv_fft
  928. int indx=2;
  929. std::vector< FMMNode* > node_lst;
  930. {
  931. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  932. for(size_t i=0;i<node.size();i++)
  933. if(!node[i]->IsLeaf())
  934. node_lst_[node[i]->Depth()].push_back(node[i]);
  935. for(int i=0;i<=MAX_DEPTH;i++)
  936. for(size_t j=0;j<node_lst_[i].size();j++)
  937. node_lst.push_back(node_lst_[i][j]);
  938. }
  939. n_list[indx]=node_lst;
  940. buff[indx].AllocDevice(true);
  941. }
  942. {// 3. dnward_check_fft
  943. int indx=3;
  944. std::vector< FMMNode* > node_lst;
  945. {
  946. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  947. for(size_t i=0;i<node.size();i++)
  948. if(!node[i]->IsLeaf() && !node[i]->IsGhost())
  949. node_lst_[node[i]->Depth()].push_back(node[i]);
  950. for(int i=0;i<=MAX_DEPTH;i++)
  951. for(size_t j=0;j<node_lst_[i].size();j++)
  952. node_lst.push_back(node_lst_[i][j]);
  953. }
  954. n_list[indx]=node_lst;
  955. buff[indx].AllocDevice(true);
  956. }
  957. {// 4. src_val
  958. int indx=4;
  959. int src_dof=kernel.ker_dim[0];
  960. int surf_dof=COORD_DIM+src_dof;
  961. std::vector< FMMNode* > node_lst;
  962. size_t buff_size=0;
  963. for(size_t i=0;i<node.size();i++)
  964. if(node[i]->IsLeaf()){
  965. node_lst.push_back(node[i]);
  966. buff_size+=(node[i]->src_coord.Dim()/COORD_DIM)*src_dof;
  967. buff_size+=(node[i]->surf_coord.Dim()/COORD_DIM)*surf_dof;
  968. }
  969. n_list[indx]=node_lst;
  970. #pragma omp parallel for
  971. for(size_t i=0;i<node_lst.size();i++){ // Move data before resizing buff[indx]
  972. { // src_value
  973. Vector<Real_t>& src_value=node_lst[i]->src_value;
  974. Vector<Real_t> new_buff=src_value;
  975. src_value.ReInit(new_buff.Dim(), &new_buff[0]);
  976. }
  977. { // surf_value
  978. Vector<Real_t>& surf_value=node_lst[i]->surf_value;
  979. Vector<Real_t> new_buff=surf_value;
  980. surf_value.ReInit(new_buff.Dim(), &new_buff[0]);
  981. }
  982. }
  983. buff[indx].Resize(1,buff_size+(extra_size.size()>indx?extra_size[indx]:0));
  984. Real_t* buff_ptr=&buff[indx][0][0];
  985. for(size_t i=0;i<node_lst.size();i++){
  986. FMMData* fmm_data=((FMMData*)node_lst[i]->FMMData());
  987. { // src_value
  988. Vector<Real_t>& src_value=node_lst[i]->src_value;
  989. mem::memcopy(buff_ptr,&src_value[0],src_value.Dim()*sizeof(Real_t));
  990. src_value.ReInit((node_lst[i]->src_coord.Dim()/COORD_DIM)*src_dof, buff_ptr, false);
  991. buff_ptr+=(node_lst[i]->src_coord.Dim()/COORD_DIM)*src_dof;
  992. }
  993. { // surf_value
  994. Vector<Real_t>& surf_value=node_lst[i]->surf_value;
  995. mem::memcopy(buff_ptr,&surf_value[0],surf_value.Dim()*sizeof(Real_t));
  996. surf_value.ReInit((node_lst[i]->surf_coord.Dim()/COORD_DIM)*surf_dof, buff_ptr, false);
  997. buff_ptr+=(node_lst[i]->surf_coord.Dim()/COORD_DIM)*surf_dof;
  998. }
  999. }
  1000. buff[indx].AllocDevice(true);
  1001. }
  1002. {// 5. trg_val
  1003. int indx=5;
  1004. int trg_dof=kernel.ker_dim[1];
  1005. std::vector< FMMNode* > node_lst;
  1006. size_t buff_size=0;
  1007. for(size_t i=0;i<node.size();i++)
  1008. if(node[i]->IsLeaf() && !node[i]->IsGhost()){
  1009. node_lst.push_back(node[i]);
  1010. FMMData* fmm_data=((FMMData*)node[i]->FMMData());
  1011. buff_size+=(node[i]->trg_coord.Dim()/COORD_DIM)*trg_dof;
  1012. }
  1013. n_list[indx]=node_lst;
  1014. buff[indx].Resize(1,buff_size+(extra_size.size()>indx?extra_size[indx]:0));
  1015. Real_t* buff_ptr=&buff[indx][0][0];
  1016. for(size_t i=0;i<node_lst.size();i++){
  1017. FMMData* fmm_data=((FMMData*)node_lst[i]->FMMData());
  1018. { // trg_value
  1019. Vector<Real_t>& trg_value=node_lst[i]->trg_value;
  1020. trg_value.ReInit((node_lst[i]->trg_coord.Dim()/COORD_DIM)*trg_dof, buff_ptr, false);
  1021. buff_ptr+=(node_lst[i]->trg_coord.Dim()/COORD_DIM)*trg_dof;
  1022. }
  1023. }
  1024. #pragma omp parallel for
  1025. for(size_t i=0;i<node_lst.size();i++){
  1026. FMMData* fmm_data=((FMMData*)node_lst[i]->FMMData());
  1027. Vector<Real_t>& trg_value=node_lst[i]->trg_value;
  1028. trg_value.SetZero();
  1029. }
  1030. buff[indx].AllocDevice(true);
  1031. }
  1032. {// 6. pts_coord
  1033. int indx=6;
  1034. size_t m=MultipoleOrder();
  1035. std::vector< FMMNode* > node_lst;
  1036. size_t buff_size=0;
  1037. for(size_t i=0;i<node.size();i++)
  1038. if(node[i]->IsLeaf()){
  1039. node_lst.push_back(node[i]);
  1040. FMMData* fmm_data=((FMMData*)node[i]->FMMData());
  1041. buff_size+=node[i]->src_coord.Dim();
  1042. buff_size+=node[i]->surf_coord.Dim();
  1043. buff_size+=node[i]->trg_coord.Dim();
  1044. }
  1045. n_list[indx]=node_lst;
  1046. #pragma omp parallel for
  1047. for(size_t i=0;i<node_lst.size();i++){ // Move data before resizing buff[indx]
  1048. FMMData* fmm_data=((FMMData*)node_lst[i]->FMMData());
  1049. { // src_coord
  1050. Vector<Real_t>& src_coord=node_lst[i]->src_coord;
  1051. Vector<Real_t> new_buff=src_coord;
  1052. src_coord.ReInit(new_buff.Dim(), &new_buff[0]);
  1053. }
  1054. { // surf_coord
  1055. Vector<Real_t>& surf_coord=node_lst[i]->surf_coord;
  1056. Vector<Real_t> new_buff=surf_coord;
  1057. surf_coord.ReInit(new_buff.Dim(), &new_buff[0]);
  1058. }
  1059. { // trg_coord
  1060. Vector<Real_t>& trg_coord=node_lst[i]->trg_coord;
  1061. Vector<Real_t> new_buff=trg_coord;
  1062. trg_coord.ReInit(new_buff.Dim(), &new_buff[0]);
  1063. }
  1064. }
  1065. buff_size+=(extra_size.size()>indx?extra_size[indx]:0);
  1066. buff_size+=4*MAX_DEPTH*(6*(m-1)*(m-1)+2)*COORD_DIM;
  1067. buff[indx].Resize(1,buff_size);
  1068. Real_t* buff_ptr=&buff[indx][0][0];
  1069. for(size_t i=0;i<node_lst.size();i++){
  1070. FMMData* fmm_data=((FMMData*)node_lst[i]->FMMData());
  1071. { // src_coord
  1072. Vector<Real_t>& src_coord=node_lst[i]->src_coord;
  1073. mem::memcopy(buff_ptr,&src_coord[0],src_coord.Dim()*sizeof(Real_t));
  1074. src_coord.ReInit(node_lst[i]->src_coord.Dim(), buff_ptr, false);
  1075. buff_ptr+=node_lst[i]->src_coord.Dim();
  1076. }
  1077. { // surf_coord
  1078. Vector<Real_t>& surf_coord=node_lst[i]->surf_coord;
  1079. mem::memcopy(buff_ptr,&surf_coord[0],surf_coord.Dim()*sizeof(Real_t));
  1080. surf_coord.ReInit(node_lst[i]->surf_coord.Dim(), buff_ptr, false);
  1081. buff_ptr+=node_lst[i]->surf_coord.Dim();
  1082. }
  1083. { // trg_coord
  1084. Vector<Real_t>& trg_coord=node_lst[i]->trg_coord;
  1085. mem::memcopy(buff_ptr,&trg_coord[0],trg_coord.Dim()*sizeof(Real_t));
  1086. trg_coord.ReInit(node_lst[i]->trg_coord.Dim(), buff_ptr, false);
  1087. buff_ptr+=node_lst[i]->trg_coord.Dim();
  1088. }
  1089. }
  1090. { // check and equiv surfaces.
  1091. upwd_check_surf.resize(MAX_DEPTH);
  1092. upwd_equiv_surf.resize(MAX_DEPTH);
  1093. dnwd_check_surf.resize(MAX_DEPTH);
  1094. dnwd_equiv_surf.resize(MAX_DEPTH);
  1095. for(size_t depth=0;depth<MAX_DEPTH;depth++){
  1096. Real_t c[3]={0.0,0.0,0.0};
  1097. upwd_check_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM, buff_ptr, false); buff_ptr+=(6*(m-1)*(m-1)+2)*COORD_DIM;
  1098. upwd_equiv_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM, buff_ptr, false); buff_ptr+=(6*(m-1)*(m-1)+2)*COORD_DIM;
  1099. dnwd_check_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM, buff_ptr, false); buff_ptr+=(6*(m-1)*(m-1)+2)*COORD_DIM;
  1100. dnwd_equiv_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM, buff_ptr, false); buff_ptr+=(6*(m-1)*(m-1)+2)*COORD_DIM;
  1101. upwd_check_surf[depth]=u_check_surf(m,c,depth);
  1102. upwd_equiv_surf[depth]=u_equiv_surf(m,c,depth);
  1103. dnwd_check_surf[depth]=d_check_surf(m,c,depth);
  1104. dnwd_equiv_surf[depth]=d_equiv_surf(m,c,depth);
  1105. }
  1106. }
  1107. buff[indx].AllocDevice(true);
  1108. }
  1109. }
  1110. template <class FMMNode>
  1111. void FMM_Pts<FMMNode>::SetupPrecomp(SetupData<Real_t>& setup_data, bool device){
  1112. if(setup_data.precomp_data==NULL) return;
  1113. Profile::Tic("SetupPrecomp",&this->comm,true,25);
  1114. { // Build precomp_data
  1115. size_t precomp_offset=0;
  1116. int level=setup_data.level;
  1117. Matrix<char>& precomp_data=*setup_data.precomp_data;
  1118. std::vector<Mat_Type>& interac_type_lst=setup_data.interac_type;
  1119. for(size_t type_indx=0; type_indx<interac_type_lst.size(); type_indx++){
  1120. Mat_Type& interac_type=interac_type_lst[type_indx];
  1121. this->PrecompAll(interac_type, level); // Compute matrices.
  1122. precomp_offset=this->mat->CompactData(level, interac_type, precomp_data, precomp_offset);
  1123. }
  1124. }
  1125. Profile::Toc();
  1126. if(device){ // Host2Device
  1127. Profile::Tic("Host2Device",&this->comm,false,25);
  1128. setup_data.precomp_data->AllocDevice(true);
  1129. Profile::Toc();
  1130. }
  1131. }
  1132. template <class FMMNode>
  1133. void FMM_Pts<FMMNode>::SetupInterac(SetupData<Real_t>& setup_data, bool device){
  1134. int level=setup_data.level;
  1135. std::vector<Mat_Type>& interac_type_lst=setup_data.interac_type;
  1136. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  1137. std::vector<void*>& nodes_out=setup_data.nodes_out;
  1138. Matrix<Real_t>& input_data=*setup_data. input_data;
  1139. Matrix<Real_t>& output_data=*setup_data.output_data;
  1140. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector;
  1141. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector;
  1142. size_t n_in =nodes_in .size();
  1143. size_t n_out=nodes_out.size();
  1144. // Setup precomputed data.
  1145. SetupPrecomp(setup_data,device);
  1146. // Build interac_data
  1147. Profile::Tic("Interac-Data",&this->comm,true,25);
  1148. Matrix<char>& interac_data=setup_data.interac_data;
  1149. if(n_out>0 && n_in >0){ // Build precomp_data, interac_data
  1150. std::vector<size_t> interac_mat;
  1151. std::vector<size_t> interac_cnt;
  1152. std::vector<size_t> interac_blk;
  1153. std::vector<size_t> input_perm;
  1154. std::vector<size_t> output_perm;
  1155. std::vector<Real_t> scaling;
  1156. size_t dof=0, M_dim0=0, M_dim1=0;
  1157. size_t precomp_offset=0;
  1158. size_t buff_size=DEVICE_BUFFER_SIZE*1024l*1024l;
  1159. for(size_t type_indx=0; type_indx<interac_type_lst.size(); type_indx++){
  1160. Mat_Type& interac_type=interac_type_lst[type_indx];
  1161. size_t mat_cnt=this->interac_list.ListCount(interac_type);
  1162. Vector<size_t> precomp_data_offset;
  1163. { // Load precomp_data for interac_type.
  1164. Matrix<char>& precomp_data=*setup_data.precomp_data;
  1165. char* indx_ptr=precomp_data[0]+precomp_offset;
  1166. size_t total_size=((size_t*)indx_ptr)[0]; indx_ptr+=sizeof(size_t);
  1167. /*size_t mat_cnt_ =((size_t*)indx_ptr)[0];*/ indx_ptr+=sizeof(size_t);
  1168. precomp_data_offset.ReInit((1+2+2)*mat_cnt, (size_t*)indx_ptr, false);
  1169. precomp_offset+=total_size;
  1170. }
  1171. Matrix<FMMNode*> src_interac_list(n_in ,mat_cnt); src_interac_list.SetZero();
  1172. Matrix<FMMNode*> trg_interac_list(n_out,mat_cnt); trg_interac_list.SetZero();
  1173. { // Build trg_interac_list
  1174. for(size_t i=0;i<n_out;i++){
  1175. if(!((FMMNode*)nodes_out[i])->IsGhost() && (level==-1 || ((FMMNode*)nodes_out[i])->Depth()==level)){
  1176. std::vector<FMMNode*>& lst=((FMMNode*)nodes_out[i])->interac_list[interac_type];
  1177. mem::memcopy(&trg_interac_list[i][0], &lst[0], lst.size()*sizeof(FMMNode*));
  1178. assert(lst.size()==mat_cnt);
  1179. }
  1180. }
  1181. }
  1182. { // Build src_interac_list
  1183. for(size_t i=0;i<n_in ;i++) ((FMMNode*)nodes_in [i])->node_id=i;
  1184. for(size_t i=0;i<n_out;i++){
  1185. for(size_t j=0;j<mat_cnt;j++)
  1186. if(trg_interac_list[i][j]!=NULL){
  1187. src_interac_list[trg_interac_list[i][j]->node_id][j]=(FMMNode*)nodes_out[i];
  1188. }
  1189. }
  1190. }
  1191. Matrix<size_t> interac_dsp(n_out,mat_cnt);
  1192. std::vector<size_t> interac_blk_dsp(1,0);
  1193. { // Determine dof, M_dim0, M_dim1
  1194. dof=1;
  1195. Matrix<Real_t>& M0 = this->interac_list.ClassMat(level, interac_type_lst[0], 0);
  1196. M_dim0=M0.Dim(0); M_dim1=M0.Dim(1);
  1197. }
  1198. { // Determine interaction blocks which fit in memory.
  1199. size_t vec_size=(M_dim0+M_dim1)*sizeof(Real_t)*dof;
  1200. for(size_t j=0;j<mat_cnt;j++){// Determine minimum buff_size
  1201. size_t vec_cnt=0;
  1202. for(size_t i=0;i<n_out;i++){
  1203. if(trg_interac_list[i][j]!=NULL) vec_cnt++;
  1204. }
  1205. if(buff_size<vec_cnt*vec_size)
  1206. buff_size=vec_cnt*vec_size;
  1207. }
  1208. size_t interac_dsp_=0;
  1209. for(size_t j=0;j<mat_cnt;j++){
  1210. for(size_t i=0;i<n_out;i++){
  1211. interac_dsp[i][j]=interac_dsp_;
  1212. if(trg_interac_list[i][j]!=NULL) interac_dsp_++;
  1213. }
  1214. if(interac_dsp_*vec_size>buff_size){
  1215. interac_blk.push_back(j-interac_blk_dsp.back());
  1216. interac_blk_dsp.push_back(j);
  1217. size_t offset=interac_dsp[0][j];
  1218. for(size_t i=0;i<n_out;i++) interac_dsp[i][j]-=offset;
  1219. interac_dsp_-=offset;
  1220. assert(interac_dsp_*vec_size<=buff_size); // Problem too big for buff_size.
  1221. }
  1222. interac_mat.push_back(precomp_data_offset[5*this->interac_list.InteracClass(interac_type,j)+0]);
  1223. interac_cnt.push_back(interac_dsp_-interac_dsp[0][j]);
  1224. }
  1225. interac_blk.push_back(mat_cnt-interac_blk_dsp.back());
  1226. interac_blk_dsp.push_back(mat_cnt);
  1227. }
  1228. { // Determine input_perm.
  1229. size_t vec_size=M_dim0*dof;
  1230. for(size_t i=0;i<n_out;i++) ((FMMNode*)nodes_out[i])->node_id=i;
  1231. for(size_t k=1;k<interac_blk_dsp.size();k++){
  1232. for(size_t i=0;i<n_in ;i++){
  1233. for(size_t j=interac_blk_dsp[k-1];j<interac_blk_dsp[k];j++){
  1234. FMMNode_t* trg_node=src_interac_list[i][j];
  1235. if(trg_node!=NULL){
  1236. input_perm .push_back(precomp_data_offset[5*j+1]); // prem
  1237. input_perm .push_back(precomp_data_offset[5*j+2]); // scal
  1238. input_perm .push_back(interac_dsp[trg_node->node_id][j]*vec_size*sizeof(Real_t)); // trg_ptr
  1239. input_perm .push_back((size_t)(& input_vector[i][0][0]- input_data[0])); // src_ptr
  1240. assert(input_vector[i]->Dim()==vec_size);
  1241. }
  1242. }
  1243. }
  1244. }
  1245. }
  1246. { // Determine scaling and output_perm
  1247. size_t vec_size=M_dim1*dof;
  1248. for(size_t k=1;k<interac_blk_dsp.size();k++){
  1249. for(size_t i=0;i<n_out;i++){
  1250. Real_t scaling_=0.0;
  1251. if(!this->Homogen()) scaling_=1.0;
  1252. else if(interac_type==D2D_Type) scaling_=1.0;
  1253. else if(interac_type==D2T_Type) scaling_=pow(0.5, -setup_data.kernel->poten_scale *((FMMNode*)nodes_out[i])->Depth());
  1254. else if(interac_type== U0_Type) scaling_=pow(0.5,(COORD_DIM-setup_data.kernel->poten_scale)*((FMMNode*)nodes_out[i])->Depth());
  1255. else if(interac_type== U1_Type) scaling_=pow(0.5,(COORD_DIM-setup_data.kernel->poten_scale)*((FMMNode*)nodes_out[i])->Depth());
  1256. else if(interac_type== U2_Type) scaling_=pow(0.5,(COORD_DIM-setup_data.kernel->poten_scale)*((FMMNode*)nodes_out[i])->Depth());
  1257. else if(interac_type== W_Type) scaling_=pow(0.5, -setup_data.kernel->poten_scale *((FMMNode*)nodes_out[i])->Depth());
  1258. else if(interac_type== X_Type) scaling_=pow(0.5, COORD_DIM *((FMMNode*)nodes_out[i])->Depth());
  1259. for(size_t j=interac_blk_dsp[k-1];j<interac_blk_dsp[k];j++){
  1260. if(trg_interac_list[i][j]!=NULL){
  1261. scaling.push_back(scaling_); // scaling
  1262. output_perm.push_back(precomp_data_offset[5*j+3]); // prem
  1263. output_perm.push_back(precomp_data_offset[5*j+4]); // scal
  1264. output_perm.push_back(interac_dsp[ i ][j]*vec_size*sizeof(Real_t)); // src_ptr
  1265. output_perm.push_back((size_t)(&output_vector[i][0][0]-output_data[0])); // trg_ptr
  1266. assert(output_vector[i]->Dim()==vec_size);
  1267. }
  1268. }
  1269. }
  1270. }
  1271. }
  1272. }
  1273. if(this->dev_buffer.Dim()<buff_size) this->dev_buffer.Resize(buff_size);
  1274. if(this->cpu_buffer.Dim()<buff_size) this->cpu_buffer.Resize(buff_size);
  1275. { // Set interac_data.
  1276. size_t data_size=sizeof(size_t)*4;
  1277. data_size+=sizeof(size_t)+interac_blk.size()*sizeof(size_t);
  1278. data_size+=sizeof(size_t)+interac_cnt.size()*sizeof(size_t);
  1279. data_size+=sizeof(size_t)+interac_mat.size()*sizeof(size_t);
  1280. data_size+=sizeof(size_t)+ input_perm.size()*sizeof(size_t);
  1281. data_size+=sizeof(size_t)+output_perm.size()*sizeof(size_t);
  1282. data_size+=sizeof(size_t)+scaling.size()*sizeof(Real_t);
  1283. if(interac_data.Dim(0)*interac_data.Dim(1)<sizeof(size_t)){
  1284. data_size+=sizeof(size_t);
  1285. interac_data.Resize(1,data_size);
  1286. ((size_t*)&interac_data[0][0])[0]=sizeof(size_t);
  1287. }else{
  1288. size_t pts_data_size=*((size_t*)&interac_data[0][0]);
  1289. assert(interac_data.Dim(0)*interac_data.Dim(1)>=pts_data_size);
  1290. data_size+=pts_data_size;
  1291. if(data_size>interac_data.Dim(0)*interac_data.Dim(1)){ //Resize and copy interac_data.
  1292. Matrix< char> pts_interac_data=interac_data;
  1293. interac_data.Resize(1,data_size);
  1294. mem::memcopy(&interac_data[0][0],&pts_interac_data[0][0],pts_data_size);
  1295. }
  1296. }
  1297. char* data_ptr=&interac_data[0][0];
  1298. data_ptr+=((size_t*)data_ptr)[0];
  1299. ((size_t*)data_ptr)[0]=data_size; data_ptr+=sizeof(size_t);
  1300. ((size_t*)data_ptr)[0]= M_dim0; data_ptr+=sizeof(size_t);
  1301. ((size_t*)data_ptr)[0]= M_dim1; data_ptr+=sizeof(size_t);
  1302. ((size_t*)data_ptr)[0]= dof; data_ptr+=sizeof(size_t);
  1303. ((size_t*)data_ptr)[0]=interac_blk.size(); data_ptr+=sizeof(size_t);
  1304. mem::memcopy(data_ptr, &interac_blk[0], interac_blk.size()*sizeof(size_t));
  1305. data_ptr+=interac_blk.size()*sizeof(size_t);
  1306. ((size_t*)data_ptr)[0]=interac_cnt.size(); data_ptr+=sizeof(size_t);
  1307. mem::memcopy(data_ptr, &interac_cnt[0], interac_cnt.size()*sizeof(size_t));
  1308. data_ptr+=interac_cnt.size()*sizeof(size_t);
  1309. ((size_t*)data_ptr)[0]=interac_mat.size(); data_ptr+=sizeof(size_t);
  1310. mem::memcopy(data_ptr, &interac_mat[0], interac_mat.size()*sizeof(size_t));
  1311. data_ptr+=interac_mat.size()*sizeof(size_t);
  1312. ((size_t*)data_ptr)[0]= input_perm.size(); data_ptr+=sizeof(size_t);
  1313. mem::memcopy(data_ptr, & input_perm[0], input_perm.size()*sizeof(size_t));
  1314. data_ptr+= input_perm.size()*sizeof(size_t);
  1315. ((size_t*)data_ptr)[0]=output_perm.size(); data_ptr+=sizeof(size_t);
  1316. mem::memcopy(data_ptr, &output_perm[0], output_perm.size()*sizeof(size_t));
  1317. data_ptr+=output_perm.size()*sizeof(size_t);
  1318. ((size_t*)data_ptr)[0]=scaling.size(); data_ptr+=sizeof(size_t);
  1319. mem::memcopy(data_ptr, &scaling[0], scaling.size()*sizeof(Real_t));
  1320. data_ptr+=scaling.size()*sizeof(Real_t);
  1321. }
  1322. }
  1323. Profile::Toc();
  1324. if(device){ // Host2Device
  1325. Profile::Tic("Host2Device",&this->comm,false,25);
  1326. setup_data.interac_data .AllocDevice(true);
  1327. Profile::Toc();
  1328. }
  1329. }
  1330. template <class FMMNode>
  1331. void FMM_Pts<FMMNode>::EvalList(SetupData<Real_t>& setup_data, bool device){
  1332. if(setup_data.interac_data.Dim(0)==0 || setup_data.interac_data.Dim(1)==0){
  1333. Profile::Tic("Host2Device",&this->comm,false,25);
  1334. Profile::Toc();
  1335. Profile::Tic("DeviceComp",&this->comm,false,20);
  1336. Profile::Toc();
  1337. return;
  1338. }
  1339. Profile::Tic("Host2Device",&this->comm,false,25);
  1340. typename Vector<char>::Device buff;
  1341. typename Matrix<char>::Device precomp_data;
  1342. typename Matrix<char>::Device interac_data;
  1343. typename Matrix<Real_t>::Device input_data;
  1344. typename Matrix<Real_t>::Device output_data;
  1345. if(device){
  1346. buff = this-> dev_buffer. AllocDevice(false);
  1347. precomp_data= setup_data.precomp_data->AllocDevice(false);
  1348. interac_data= setup_data.interac_data. AllocDevice(false);
  1349. input_data = setup_data. input_data->AllocDevice(false);
  1350. output_data = setup_data. output_data->AllocDevice(false);
  1351. }else{
  1352. buff = this-> cpu_buffer;
  1353. precomp_data=*setup_data.precomp_data;
  1354. interac_data= setup_data.interac_data;
  1355. input_data =*setup_data. input_data;
  1356. output_data =*setup_data. output_data;
  1357. }
  1358. Profile::Toc();
  1359. Profile::Tic("DeviceComp",&this->comm,false,20);
  1360. #ifdef __INTEL_OFFLOAD
  1361. int lock_idx=-1;
  1362. int wait_lock_idx=-1;
  1363. if(device) wait_lock_idx=MIC_Lock::curr_lock();
  1364. if(device) lock_idx=MIC_Lock::get_lock();
  1365. #pragma offload if(device) target(mic:0) signal(&MIC_Lock::lock_vec[device?lock_idx:0])
  1366. #endif
  1367. { // Offloaded computation.
  1368. // Set interac_data.
  1369. size_t data_size, M_dim0, M_dim1, dof;
  1370. Vector<size_t> interac_blk;
  1371. Vector<size_t> interac_cnt;
  1372. Vector<size_t> interac_mat;
  1373. Vector<size_t> input_perm;
  1374. Vector<size_t> output_perm;
  1375. Vector<Real_t> scaling;
  1376. { // Set interac_data.
  1377. char* data_ptr=&interac_data[0][0];
  1378. data_size=((size_t*)data_ptr)[0]; data_ptr+=data_size;
  1379. data_size=((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1380. M_dim0 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1381. M_dim1 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1382. dof =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1383. interac_blk.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1384. data_ptr+=sizeof(size_t)+interac_blk.Dim()*sizeof(size_t);
  1385. interac_cnt.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1386. data_ptr+=sizeof(size_t)+interac_cnt.Dim()*sizeof(size_t);
  1387. interac_mat.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1388. data_ptr+=sizeof(size_t)+interac_mat.Dim()*sizeof(size_t);
  1389. input_perm .ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1390. data_ptr+=sizeof(size_t)+ input_perm.Dim()*sizeof(size_t);
  1391. output_perm.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1392. data_ptr+=sizeof(size_t)+output_perm.Dim()*sizeof(size_t);
  1393. scaling.ReInit(((size_t*)data_ptr)[0],(Real_t*)(data_ptr+sizeof(size_t)),false);
  1394. data_ptr+=sizeof(size_t)+scaling.Dim()*sizeof(Real_t);
  1395. }
  1396. #ifdef __INTEL_OFFLOAD
  1397. if(device) MIC_Lock::wait_lock(wait_lock_idx);
  1398. #endif
  1399. std::cout << "cuda_func::in_perm_h()" << '\n';
  1400. //Compute interaction from Chebyshev source density.
  1401. { // interactions
  1402. int omp_p=omp_get_max_threads();
  1403. size_t interac_indx=0;
  1404. size_t interac_blk_dsp=0;
  1405. for(size_t k=0;k<interac_blk.Dim();k++){
  1406. size_t vec_cnt=0;
  1407. for(size_t j=interac_blk_dsp;j<interac_blk_dsp+interac_blk[k];j++) vec_cnt+=interac_cnt[j];
  1408. char* buff_in =&buff[0];
  1409. char* buff_out=&buff[vec_cnt*dof*M_dim0*sizeof(Real_t)];
  1410. // Input permutation.
  1411. /*
  1412. #if defined(PVFMM_HAVE_CUDA)
  1413. cuda_func<Real_t>::in_perm_h (precomp_data.dev_ptr, (uintptr_t) input_perm[0], input_data.dev_ptr,
  1414. (uintptr_t) buff_in, interac_indx, M_dim0, vec_cnt);
  1415. #else
  1416. */
  1417. #pragma omp parallel for
  1418. for(int tid=0;tid<omp_p;tid++){
  1419. size_t a=( tid *vec_cnt)/omp_p;
  1420. size_t b=((tid+1)*vec_cnt)/omp_p;
  1421. for(size_t i=a;i<b;i++){
  1422. const PERM_INT_T* perm=(PERM_INT_T*)(precomp_data[0]+input_perm[(interac_indx+i)*4+0]);
  1423. const Real_t* scal=( Real_t*)(precomp_data[0]+input_perm[(interac_indx+i)*4+1]);
  1424. const Real_t* v_in =( Real_t*)( input_data[0]+input_perm[(interac_indx+i)*4+3]);
  1425. Real_t* v_out=( Real_t*)( buff_in +input_perm[(interac_indx+i)*4+2]);
  1426. // TODO: Fix for dof>1
  1427. #ifdef __MIC__
  1428. {
  1429. __m512d v8;
  1430. size_t j_start=(((uintptr_t)(v_out ) + (uintptr_t)(MEM_ALIGN-1)) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1431. size_t j_end =(((uintptr_t)(v_out+M_dim0) ) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1432. j_start/=sizeof(Real_t);
  1433. j_end /=sizeof(Real_t);
  1434. assert(((uintptr_t)(v_out))%sizeof(Real_t)==0);
  1435. assert(((uintptr_t)(v_out+j_start))%64==0);
  1436. assert(((uintptr_t)(v_out+j_end ))%64==0);
  1437. size_t j=0;
  1438. for(;j<j_start;j++ ){
  1439. v_out[j]=v_in[perm[j]]*scal[j];
  1440. }
  1441. for(;j<j_end ;j+=8){
  1442. v8=_mm512_setr_pd(
  1443. v_in[perm[j+0]]*scal[j+0],
  1444. v_in[perm[j+1]]*scal[j+1],
  1445. v_in[perm[j+2]]*scal[j+2],
  1446. v_in[perm[j+3]]*scal[j+3],
  1447. v_in[perm[j+4]]*scal[j+4],
  1448. v_in[perm[j+5]]*scal[j+5],
  1449. v_in[perm[j+6]]*scal[j+6],
  1450. v_in[perm[j+7]]*scal[j+7]);
  1451. _mm512_storenrngo_pd(v_out+j,v8);
  1452. }
  1453. for(;j<M_dim0 ;j++ ){
  1454. v_out[j]=v_in[perm[j]]*scal[j];
  1455. }
  1456. }
  1457. #else
  1458. for(size_t j=0;j<M_dim0;j++ ){
  1459. v_out[j]=v_in[perm[j]]*scal[j];
  1460. }
  1461. #endif
  1462. }
  1463. }
  1464. //#endif
  1465. size_t vec_cnt0=0;
  1466. for(size_t j=interac_blk_dsp;j<interac_blk_dsp+interac_blk[k];){
  1467. size_t vec_cnt1=0;
  1468. size_t interac_mat0=interac_mat[j];
  1469. for(;j<interac_blk_dsp+interac_blk[k] && interac_mat[j]==interac_mat0;j++) vec_cnt1+=interac_cnt[j];
  1470. Matrix<Real_t> M(M_dim0, M_dim1, (Real_t*)(precomp_data[0]+interac_mat0), false);
  1471. /*
  1472. #if defined(PVFMM_HAVE_CUDA)
  1473. {
  1474. Matrix<Real_t> Ms(dof*vec_cnt1, M_dim0, (Real_t*)(buff_in +M_dim0*vec_cnt0*dof*sizeof(Real_t)), false);
  1475. Matrix<Real_t> Mt(dof*vec_cnt1, M_dim1, (Real_t*)(buff_out+M_dim1*vec_cnt0*dof*sizeof(Real_t)), false);
  1476. Matrix<Real_t>::CUBLASXGEMM(Mt,Ms,M);
  1477. }
  1478. #else
  1479. */
  1480. #ifdef __MIC__
  1481. {
  1482. Matrix<Real_t> Ms(dof*vec_cnt1, M_dim0, (Real_t*)(buff_in +M_dim0*vec_cnt0*dof*sizeof(Real_t)), false);
  1483. Matrix<Real_t> Mt(dof*vec_cnt1, M_dim1, (Real_t*)(buff_out+M_dim1*vec_cnt0*dof*sizeof(Real_t)), false);
  1484. Matrix<Real_t>::DGEMM(Mt,Ms,M);
  1485. }
  1486. #else
  1487. #pragma omp parallel for
  1488. for(int tid=0;tid<omp_p;tid++){
  1489. size_t a=(dof*vec_cnt1*(tid ))/omp_p;
  1490. size_t b=(dof*vec_cnt1*(tid+1))/omp_p;
  1491. Matrix<Real_t> Ms(b-a, M_dim0, (Real_t*)(buff_in +M_dim0*vec_cnt0*dof*sizeof(Real_t))+M_dim0*a, false);
  1492. Matrix<Real_t> Mt(b-a, M_dim1, (Real_t*)(buff_out+M_dim1*vec_cnt0*dof*sizeof(Real_t))+M_dim1*a, false);
  1493. Matrix<Real_t>::DGEMM(Mt,Ms,M);
  1494. }
  1495. #endif
  1496. //#endif
  1497. vec_cnt0+=vec_cnt1;
  1498. }
  1499. // Output permutation.
  1500. /*
  1501. #if defined(PVFMM_HAVE_CUDA)
  1502. cuda_func<Real_t>::out_perm_h ((uintptr_t) scaling[0], precomp_data.dev_ptr, (uintptr_t) output_perm[0], output_data.dev_ptr,
  1503. (uintptr_t) buff_out, interac_indx, M_dim1, vec_cnt);
  1504. #else
  1505. */
  1506. #pragma omp parallel for
  1507. for(int tid=0;tid<omp_p;tid++){
  1508. size_t a=( tid *vec_cnt)/omp_p;
  1509. size_t b=((tid+1)*vec_cnt)/omp_p;
  1510. if(tid> 0 && a<vec_cnt){ // Find 'a' independent of other threads.
  1511. size_t out_ptr=output_perm[(interac_indx+a)*4+3];
  1512. if(tid> 0) while(a<vec_cnt && out_ptr==output_perm[(interac_indx+a)*4+3]) a++;
  1513. }
  1514. if(tid<omp_p-1 && b<vec_cnt){ // Find 'b' independent of other threads.
  1515. size_t out_ptr=output_perm[(interac_indx+b)*4+3];
  1516. if(tid<omp_p-1) while(b<vec_cnt && out_ptr==output_perm[(interac_indx+b)*4+3]) b++;
  1517. }
  1518. for(size_t i=a;i<b;i++){ // Compute permutations.
  1519. Real_t scaling_factor=scaling[interac_indx+i];
  1520. const PERM_INT_T* perm=(PERM_INT_T*)(precomp_data[0]+output_perm[(interac_indx+i)*4+0]);
  1521. const Real_t* scal=( Real_t*)(precomp_data[0]+output_perm[(interac_indx+i)*4+1]);
  1522. const Real_t* v_in =( Real_t*)( buff_out +output_perm[(interac_indx+i)*4+2]);
  1523. Real_t* v_out=( Real_t*)( output_data[0]+output_perm[(interac_indx+i)*4+3]);
  1524. // TODO: Fix for dof>1
  1525. #ifdef __MIC__
  1526. {
  1527. __m512d v8;
  1528. __m512d v_old;
  1529. size_t j_start=(((uintptr_t)(v_out ) + (uintptr_t)(MEM_ALIGN-1)) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1530. size_t j_end =(((uintptr_t)(v_out+M_dim1) ) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1531. j_start/=sizeof(Real_t);
  1532. j_end /=sizeof(Real_t);
  1533. assert(((uintptr_t)(v_out))%sizeof(Real_t)==0);
  1534. assert(((uintptr_t)(v_out+j_start))%64==0);
  1535. assert(((uintptr_t)(v_out+j_end ))%64==0);
  1536. size_t j=0;
  1537. for(;j<j_start;j++ ){
  1538. v_out[j]+=v_in[perm[j]]*scal[j]*scaling_factor;
  1539. }
  1540. for(;j<j_end ;j+=8){
  1541. v_old=_mm512_load_pd(v_out+j);
  1542. v8=_mm512_setr_pd(
  1543. v_in[perm[j+0]]*scal[j+0]*scaling_factor,
  1544. v_in[perm[j+1]]*scal[j+1]*scaling_factor,
  1545. v_in[perm[j+2]]*scal[j+2]*scaling_factor,
  1546. v_in[perm[j+3]]*scal[j+3]*scaling_factor,
  1547. v_in[perm[j+4]]*scal[j+4]*scaling_factor,
  1548. v_in[perm[j+5]]*scal[j+5]*scaling_factor,
  1549. v_in[perm[j+6]]*scal[j+6]*scaling_factor,
  1550. v_in[perm[j+7]]*scal[j+7]*scaling_factor);
  1551. v_old=_mm512_add_pd(v_old, v8);
  1552. _mm512_storenrngo_pd(v_out+j,v_old);
  1553. }
  1554. for(;j<M_dim1 ;j++ ){
  1555. v_out[j]+=v_in[perm[j]]*scal[j]*scaling_factor;
  1556. }
  1557. }
  1558. #else
  1559. for(size_t j=0;j<M_dim1;j++ ){
  1560. v_out[j]+=v_in[perm[j]]*scal[j]*scaling_factor;
  1561. }
  1562. #endif
  1563. }
  1564. }
  1565. //#endif
  1566. interac_indx+=vec_cnt;
  1567. interac_blk_dsp+=interac_blk[k];
  1568. }
  1569. }
  1570. #ifdef __INTEL_OFFLOAD
  1571. if(device) MIC_Lock::release_lock(lock_idx);
  1572. #endif
  1573. }
  1574. #ifndef __MIC_ASYNCH__
  1575. #ifdef __INTEL_OFFLOAD
  1576. #pragma offload if(device) target(mic:0)
  1577. {if(device) MIC_Lock::wait_lock(lock_idx);}
  1578. #endif
  1579. #endif
  1580. Profile::Toc();
  1581. }
  1582. template <class FMMNode>
  1583. void FMM_Pts<FMMNode>::InitMultipole(FMMNode** node, size_t n, int level){
  1584. if(n==0) return;
  1585. int dof=1;
  1586. //Get the upward-check surface.
  1587. std::vector<Real_t> uc_coord[MAX_DEPTH+1];
  1588. size_t uc_cnt;
  1589. {
  1590. Real_t c[3]={0,0,0};
  1591. for(int i=0;i<=MAX_DEPTH;i++)
  1592. uc_coord[i]=u_check_surf(MultipoleOrder(),c,i);
  1593. uc_cnt=uc_coord[0].size()/COORD_DIM;
  1594. }
  1595. //Read matrices.
  1596. Matrix<Real_t>& M_uc2ue = this->mat->Mat(level, UC2UE_Type, 0);
  1597. //Compute multipole expansion.
  1598. #pragma omp parallel
  1599. {
  1600. int omp_p=omp_get_num_threads();
  1601. int pid = omp_get_thread_num();
  1602. size_t a=(pid*n)/omp_p;
  1603. size_t b=((pid+1)*n)/omp_p;
  1604. Matrix<Real_t> u_check(dof, M_uc2ue.Dim(0));
  1605. for (size_t j=a;j<b;j++){
  1606. Vector<Real_t>& upward_equiv=node[j]->FMMData()->upward_equiv;
  1607. assert(upward_equiv.Dim()==M_uc2ue.Dim(1)*dof);
  1608. Matrix<Real_t> u_equiv(dof,M_uc2ue.Dim(1),&upward_equiv[0],false);
  1609. u_equiv.SetZero(); // TODO: Do in setup
  1610. //Compute multipole expansion form point sources.
  1611. size_t pt_cnt=node[j]->src_coord.Dim()/COORD_DIM;
  1612. size_t surf_pt_cnt=node[j]->surf_coord.Dim()/COORD_DIM;
  1613. if(pt_cnt+surf_pt_cnt>0){
  1614. //Relative coord of upward check surf.
  1615. Real_t* c=node[j]->Coord();
  1616. std::vector<Real_t> uc_coord1(uc_cnt*COORD_DIM);
  1617. for(size_t i=0;i<uc_cnt;i++) for(int k=0;k<COORD_DIM;k++)
  1618. uc_coord1[i*COORD_DIM+k]=uc_coord[node[j]->Depth()][i*COORD_DIM+k]+c[k];
  1619. Profile::Add_FLOP((long long)uc_cnt*(long long)COORD_DIM);
  1620. //Compute upward check potential.
  1621. u_check.SetZero();
  1622. if(pt_cnt>0)
  1623. aux_kernel.ker_poten(&node[j]->src_coord[0], pt_cnt,
  1624. &node[j]->src_value[0], dof,
  1625. &uc_coord1[0], uc_cnt, u_check[0]);
  1626. if(surf_pt_cnt>0)
  1627. aux_kernel.dbl_layer_poten(&node[j]->surf_coord[0], surf_pt_cnt,
  1628. &node[j]->surf_value[0], dof,
  1629. &uc_coord1[0], uc_cnt, u_check[0]);
  1630. //Rearrange data.
  1631. {
  1632. Matrix<Real_t> M_tmp(M_uc2ue.Dim(0)/aux_kernel.ker_dim[1],aux_kernel.ker_dim[1]*dof, &u_check[0][0], false);
  1633. M_tmp=M_tmp.Transpose();
  1634. for(int i=0;i<dof;i++){
  1635. Matrix<Real_t> M_tmp1(aux_kernel.ker_dim[1], M_uc2ue.Dim(0)/aux_kernel.ker_dim[1], &u_check[i][0], false);
  1636. M_tmp1=M_tmp1.Transpose();
  1637. }
  1638. }
  1639. //Compute UC2UE (vector-matrix multiply).
  1640. Matrix<Real_t>::DGEMM(u_equiv,u_check,M_uc2ue,1.0);
  1641. }
  1642. //Adjusting for scale.
  1643. if(Homogen()){
  1644. Real_t scale_factor=pow(0.5, node[j]->Depth()*aux_kernel.poten_scale);
  1645. for(size_t i=0;i<upward_equiv.Dim();i++)
  1646. upward_equiv[i]*=scale_factor;
  1647. }
  1648. }
  1649. }
  1650. }
  1651. template <class FMMNode>
  1652. void FMM_Pts<FMMNode>::Up2Up(FMMNode** nodes, size_t n, int level){
  1653. if(n==0) return;
  1654. int dof=1;
  1655. size_t n_eq=this->interac_list.ClassMat(level,U2U_Type,0).Dim(1);
  1656. size_t mat_cnt=interac_list.ListCount(U2U_Type);
  1657. //For all non-leaf, non-ghost nodes.
  1658. #pragma omp parallel
  1659. {
  1660. int omp_p=omp_get_num_threads();
  1661. int pid = omp_get_thread_num();
  1662. size_t a=(pid*n)/omp_p;
  1663. size_t b=((pid+1)*n)/omp_p;
  1664. size_t cnt;
  1665. //Initialize this node's upward equivalent data
  1666. for(size_t i=a;i<b;i++){
  1667. Vector<Real_t>& upward_equiv=nodes[i]->FMMData()->upward_equiv;
  1668. assert(upward_equiv.Dim()==dof*n_eq);
  1669. upward_equiv.SetZero(); // TODO: Do in setup
  1670. UNUSED(upward_equiv);
  1671. UNUSED(n_eq);
  1672. }
  1673. for(size_t mat_indx=0;mat_indx<mat_cnt;mat_indx++){
  1674. Matrix<Real_t>& M = this->mat->Mat(level, U2U_Type, mat_indx);
  1675. if(M.Dim(0)!=0 && M.Dim(1)!=0){
  1676. cnt=0;
  1677. for(size_t i=a;i<b;i++)
  1678. if(/*!nodes[i]->IsGhost() && */!nodes[i]->IsLeaf()) if(((FMMNode*)nodes[i]->Child(mat_indx))->FMMData()->upward_equiv.Dim()>0) cnt++;
  1679. Matrix<Real_t> src_vec(cnt*dof,M.Dim(0));
  1680. Matrix<Real_t> trg_vec(cnt*dof,M.Dim(1));
  1681. //Get child's multipole expansion.
  1682. cnt=0;
  1683. for(size_t i=a;i<b;i++)
  1684. if(/*!nodes[i]->IsGhost() && */!nodes[i]->IsLeaf()) if(((FMMNode*)nodes[i]->Child(mat_indx))->FMMData()->upward_equiv.Dim()>0){
  1685. Vector<Real_t>& child_equiv=static_cast<FMMNode*>(nodes[i]->Child(mat_indx))->FMMData()->upward_equiv;
  1686. mem::memcopy(&(src_vec[cnt*dof][0]), &(child_equiv[0]), dof*M.Dim(0)*sizeof(Real_t));
  1687. cnt++;
  1688. }
  1689. Matrix<Real_t>::DGEMM(trg_vec,src_vec,M);
  1690. cnt=0;
  1691. size_t vec_len=M.Dim(1)*dof;
  1692. for(size_t i=a;i<b;i++)
  1693. if(/*!nodes[i]->IsGhost() && */!nodes[i]->IsLeaf()) if(((FMMNode*)nodes[i]->Child(mat_indx))->FMMData()->upward_equiv.Dim()>0){
  1694. Vector<Real_t>& upward_equiv=nodes[i]->FMMData()->upward_equiv;
  1695. assert(upward_equiv.Dim()==vec_len);
  1696. Matrix<Real_t> equiv (1,vec_len,&upward_equiv[0],false);
  1697. Matrix<Real_t> equiv_ (1,vec_len,trg_vec[cnt*dof],false);
  1698. equiv+=equiv_;
  1699. cnt++;
  1700. }
  1701. }
  1702. }
  1703. }
  1704. }
  1705. template <class FMMNode>
  1706. void FMM_Pts<FMMNode>::PeriodicBC(FMMNode* node){
  1707. Matrix<Real_t>& M = Precomp(0, BC_Type, 0);
  1708. assert(node->FMMData()->upward_equiv.Dim()>0);
  1709. int dof=1;
  1710. Vector<Real_t>& upward_equiv=node->FMMData()->upward_equiv;
  1711. Vector<Real_t>& dnward_equiv=node->FMMData()->dnward_equiv;
  1712. assert(upward_equiv.Dim()==M.Dim(0)*dof);
  1713. assert(dnward_equiv.Dim()==M.Dim(1)*dof);
  1714. Matrix<Real_t> d_equiv(dof,M.Dim(0),&dnward_equiv[0],false);
  1715. Matrix<Real_t> u_equiv(dof,M.Dim(1),&upward_equiv[0],false);
  1716. Matrix<Real_t>::DGEMM(d_equiv,u_equiv,M);
  1717. }
  1718. template <class FMMNode>
  1719. void FMM_Pts<FMMNode>::FFT_UpEquiv(size_t dof, size_t m, size_t ker_dim0, Vector<size_t>& fft_vec,
  1720. Vector<Real_t>& input_data, Vector<Real_t>& output_data, Vector<Real_t>& buffer_){
  1721. size_t n1=m*2;
  1722. size_t n2=n1*n1;
  1723. size_t n3=n1*n2;
  1724. size_t n3_=n2*(n1/2+1);
  1725. size_t chld_cnt=1UL<<COORD_DIM;
  1726. size_t fftsize_in =2*n3_*chld_cnt*ker_dim0*dof;
  1727. int omp_p=omp_get_max_threads();
  1728. //Load permutation map.
  1729. size_t n=6*(m-1)*(m-1)+2;
  1730. static Vector<size_t> map;
  1731. { // Build map to reorder upward_equiv
  1732. size_t n_old=map.Dim();
  1733. if(n_old!=n){
  1734. Real_t c[3]={0,0,0};
  1735. Vector<Real_t> surf=surface(m, c, (Real_t)(m-1), 0);
  1736. map.Resize(surf.Dim()/COORD_DIM);
  1737. for(size_t i=0;i<map.Dim();i++)
  1738. map[i]=((size_t)(m-1-surf[i*3]+0.5))+((size_t)(m-1-surf[i*3+1]+0.5))*n1+((size_t)(m-1-surf[i*3+2]+0.5))*n2;
  1739. }
  1740. }
  1741. { // Build FFTW plan.
  1742. if(!vlist_fft_flag){
  1743. int nnn[3]={(int)n1,(int)n1,(int)n1};
  1744. void *fftw_in, *fftw_out;
  1745. fftw_in = mem::aligned_malloc<Real_t>( n3 *ker_dim0*chld_cnt);
  1746. fftw_out = mem::aligned_malloc<Real_t>(2*n3_*ker_dim0*chld_cnt);
  1747. vlist_fftplan = FFTW_t<Real_t>::fft_plan_many_dft_r2c(COORD_DIM,nnn,ker_dim0*chld_cnt,
  1748. (Real_t*)fftw_in, NULL, 1, n3, (typename FFTW_t<Real_t>::cplx*)(fftw_out),NULL, 1, n3_, FFTW_ESTIMATE);
  1749. mem::aligned_free<Real_t>((Real_t*)fftw_in );
  1750. mem::aligned_free<Real_t>((Real_t*)fftw_out);
  1751. vlist_fft_flag=true;
  1752. }
  1753. }
  1754. { // Offload section
  1755. size_t n_in = fft_vec.Dim();
  1756. #pragma omp parallel for
  1757. for(int pid=0; pid<omp_p; pid++){
  1758. size_t node_start=(n_in*(pid ))/omp_p;
  1759. size_t node_end =(n_in*(pid+1))/omp_p;
  1760. Vector<Real_t> buffer(fftsize_in, &buffer_[fftsize_in*pid], false);
  1761. for(size_t node_idx=node_start; node_idx<node_end; node_idx++){
  1762. Vector<Real_t*> upward_equiv(chld_cnt);
  1763. for(size_t i=0;i<chld_cnt;i++) upward_equiv[i]=&input_data[0] + fft_vec[node_idx] + n*ker_dim0*dof*i;
  1764. Vector<Real_t> upward_equiv_fft(fftsize_in, &output_data[fftsize_in *node_idx], false);
  1765. upward_equiv_fft.SetZero();
  1766. // Rearrange upward equivalent data.
  1767. for(size_t k=0;k<n;k++){
  1768. size_t idx=map[k];
  1769. for(int j1=0;j1<dof;j1++)
  1770. for(int j0=0;j0<(int)chld_cnt;j0++)
  1771. for(int i=0;i<ker_dim0;i++)
  1772. upward_equiv_fft[idx+(j0+(i+j1*ker_dim0)*chld_cnt)*n3]=upward_equiv[j0][ker_dim0*(n*j1+k)+i];
  1773. }
  1774. // Compute FFT.
  1775. for(int i=0;i<dof;i++)
  1776. FFTW_t<Real_t>::fft_execute_dft_r2c(vlist_fftplan, (Real_t*)&upward_equiv_fft[i* n3 *ker_dim0*chld_cnt],
  1777. (typename FFTW_t<Real_t>::cplx*)&buffer [i*2*n3_*ker_dim0*chld_cnt]);
  1778. //Compute flops.
  1779. #ifndef FFTW3_MKL
  1780. double add, mul, fma;
  1781. fftw_flops(vlist_fftplan, &add, &mul, &fma);
  1782. #ifndef __INTEL_OFFLOAD0
  1783. Profile::Add_FLOP((long long)(add+mul+2*fma));
  1784. #endif
  1785. #endif
  1786. for(int i=0;i<ker_dim0*dof;i++)
  1787. for(size_t j=0;j<n3_;j++)
  1788. for(size_t k=0;k<chld_cnt;k++){
  1789. upward_equiv_fft[2*(chld_cnt*(n3_*i+j)+k)+0]=buffer[2*(n3_*(chld_cnt*i+k)+j)+0];
  1790. upward_equiv_fft[2*(chld_cnt*(n3_*i+j)+k)+1]=buffer[2*(n3_*(chld_cnt*i+k)+j)+1];
  1791. }
  1792. }
  1793. }
  1794. }
  1795. }
  1796. template <class FMMNode>
  1797. void FMM_Pts<FMMNode>::FFT_Check2Equiv(size_t dof, size_t m, size_t ker_dim1, Vector<size_t>& ifft_vec,
  1798. Vector<Real_t>& input_data, Vector<Real_t>& output_data, Vector<Real_t>& buffer_, Matrix<Real_t>& M){
  1799. size_t n1=m*2;
  1800. size_t n2=n1*n1;
  1801. size_t n3=n1*n2;
  1802. size_t n3_=n2*(n1/2+1);
  1803. size_t chld_cnt=1UL<<COORD_DIM;
  1804. size_t fftsize_out=2*n3_*dof*ker_dim1*chld_cnt;
  1805. int omp_p=omp_get_max_threads();
  1806. //Load permutation map.
  1807. size_t n=6*(m-1)*(m-1)+2;
  1808. static Vector<size_t> map;
  1809. { // Build map to reorder dnward_check
  1810. size_t n_old=map.Dim();
  1811. if(n_old!=n){
  1812. Real_t c[3]={0,0,0};
  1813. Vector<Real_t> surf=surface(m, c, (Real_t)(m-1), 0);
  1814. map.Resize(surf.Dim()/COORD_DIM);
  1815. for(size_t i=0;i<map.Dim();i++)
  1816. map[i]=((size_t)(m*2-0.5-surf[i*3]))+((size_t)(m*2-0.5-surf[i*3+1]))*n1+((size_t)(m*2-0.5-surf[i*3+2]))*n2;
  1817. //map;//.AllocDevice(true);
  1818. }
  1819. }
  1820. { // Build FFTW plan.
  1821. if(!vlist_ifft_flag){
  1822. //Build FFTW plan.
  1823. int nnn[3]={(int)n1,(int)n1,(int)n1};
  1824. void *fftw_in, *fftw_out;
  1825. fftw_in = fftw_malloc(2*n3_*ker_dim1*sizeof(Real_t)*chld_cnt);
  1826. fftw_out = fftw_malloc( n3 *ker_dim1*sizeof(Real_t)*chld_cnt);
  1827. vlist_ifftplan = FFTW_t<Real_t>::fft_plan_many_dft_c2r(COORD_DIM,nnn,ker_dim1*chld_cnt,
  1828. (typename FFTW_t<Real_t>::cplx*)fftw_in, NULL, 1, n3_, (Real_t*)(fftw_out),NULL, 1, n3, FFTW_ESTIMATE);
  1829. fftw_free(fftw_in);
  1830. fftw_free(fftw_out);
  1831. vlist_ifft_flag=true;
  1832. }
  1833. }
  1834. { // Offload section
  1835. size_t n_out=ifft_vec.Dim();
  1836. #pragma omp parallel for
  1837. for(int pid=0; pid<omp_p; pid++){
  1838. size_t node_start=(n_out*(pid ))/omp_p;
  1839. size_t node_end =(n_out*(pid+1))/omp_p;
  1840. Vector<Real_t> buffer(fftsize_out, &buffer_[fftsize_out*pid], false);
  1841. for(size_t node_idx=node_start; node_idx<node_end; node_idx++){
  1842. Vector<Real_t> dnward_check_fft(fftsize_out, &input_data[fftsize_out*node_idx], false);
  1843. //De-interleave data.
  1844. for(int i=0;i<ker_dim1*dof;i++)
  1845. for(size_t j=0;j<n3_;j++)
  1846. for(size_t k=0;k<chld_cnt;k++){
  1847. buffer[2*(n3_*(ker_dim1*dof*k+i)+j)+0]=dnward_check_fft[2*(chld_cnt*(n3_*i+j)+k)+0];
  1848. buffer[2*(n3_*(ker_dim1*dof*k+i)+j)+1]=dnward_check_fft[2*(chld_cnt*(n3_*i+j)+k)+1];
  1849. }
  1850. // Compute FFT.
  1851. for(int i=0;i<dof;i++)
  1852. FFTW_t<Real_t>::fft_execute_dft_c2r(vlist_ifftplan, (typename FFTW_t<Real_t>::cplx*)&buffer [i*2*n3_*ker_dim1*chld_cnt],
  1853. (Real_t*)&dnward_check_fft[i* n3 *ker_dim1*chld_cnt]);
  1854. //Compute flops.
  1855. #ifndef FFTW3_MKL
  1856. double add, mul, fma;
  1857. fftw_flops(vlist_ifftplan, &add, &mul, &fma);
  1858. #ifndef __INTEL_OFFLOAD0
  1859. Profile::Add_FLOP((long long)(add+mul+2*fma));
  1860. #endif
  1861. #endif
  1862. // Rearrange downward check data.
  1863. for(size_t k=0;k<n;k++){
  1864. size_t idx=map[k];
  1865. for(int j1=0;j1<dof;j1++)
  1866. for(int j0=0;j0<(int)chld_cnt;j0++)
  1867. for(int i=0;i<ker_dim1;i++)
  1868. buffer[ker_dim1*(n*(dof*j0+j1)+k)+i]=dnward_check_fft[idx+(j1+(i+j0*ker_dim1)*dof)*n3];
  1869. }
  1870. // Compute check to equiv.
  1871. for(size_t j=0;j<chld_cnt;j++){
  1872. Matrix<Real_t> d_check(dof,M.Dim(0),&buffer[n*ker_dim1*dof*j],false);
  1873. Matrix<Real_t> d_equiv(dof,M.Dim(1),&output_data[0] + ifft_vec[node_idx] + M.Dim(1)*dof*j,false);
  1874. Matrix<Real_t>::DGEMM(d_equiv,d_check,M,1.0);
  1875. }
  1876. }
  1877. }
  1878. }
  1879. }
  1880. template <class Real_t>
  1881. void VListHadamard(size_t dof, size_t M_dim, size_t ker_dim0, size_t ker_dim1, Vector<size_t>& interac_dsp,
  1882. Vector<size_t>& interac_vec, Vector<Real_t*>& precomp_mat, Vector<Real_t>& fft_in, Vector<Real_t>& fft_out){
  1883. size_t chld_cnt=1UL<<COORD_DIM;
  1884. size_t fftsize_in =M_dim*ker_dim0*chld_cnt*2;
  1885. size_t fftsize_out=M_dim*ker_dim1*chld_cnt*2;
  1886. Real_t* zero_vec0=mem::aligned_malloc<Real_t>(fftsize_in );
  1887. Real_t* zero_vec1=mem::aligned_malloc<Real_t>(fftsize_out);
  1888. size_t n_out=fft_out.Dim()/fftsize_out;
  1889. // Set buff_out to zero.
  1890. #pragma omp parallel for
  1891. for(size_t k=0;k<n_out;k++){
  1892. Vector<Real_t> dnward_check_fft(fftsize_out, &fft_out[k*fftsize_out], false);
  1893. dnward_check_fft.SetZero();
  1894. }
  1895. // Build list of interaction pairs (in, out vectors).
  1896. size_t mat_cnt=precomp_mat.Dim();
  1897. size_t blk1_cnt=interac_dsp.Dim()/mat_cnt;
  1898. Real_t** IN_ =new Real_t*[2*V_BLK_SIZE*blk1_cnt*mat_cnt];
  1899. Real_t** OUT_=new Real_t*[2*V_BLK_SIZE*blk1_cnt*mat_cnt];
  1900. #pragma omp parallel for
  1901. for(size_t interac_blk1=0; interac_blk1<blk1_cnt*mat_cnt; interac_blk1++){
  1902. size_t interac_dsp0 = (interac_blk1==0?0:interac_dsp[interac_blk1-1]);
  1903. size_t interac_dsp1 = interac_dsp[interac_blk1 ] ;
  1904. size_t interac_cnt = interac_dsp1-interac_dsp0;
  1905. for(size_t j=0;j<interac_cnt;j++){
  1906. IN_ [2*V_BLK_SIZE*interac_blk1 +j]=&fft_in [interac_vec[(interac_dsp0+j)*2+0]];
  1907. OUT_[2*V_BLK_SIZE*interac_blk1 +j]=&fft_out[interac_vec[(interac_dsp0+j)*2+1]];
  1908. }
  1909. IN_ [2*V_BLK_SIZE*interac_blk1 +interac_cnt]=zero_vec0;
  1910. OUT_[2*V_BLK_SIZE*interac_blk1 +interac_cnt]=zero_vec1;
  1911. }
  1912. int omp_p=omp_get_max_threads();
  1913. #pragma omp parallel for
  1914. for(int pid=0; pid<omp_p; pid++){
  1915. size_t a=( pid *M_dim)/omp_p;
  1916. size_t b=((pid+1)*M_dim)/omp_p;
  1917. for(size_t blk1=0; blk1<blk1_cnt; blk1++)
  1918. for(size_t k=a; k< b; k++)
  1919. for(size_t mat_indx=0; mat_indx< mat_cnt;mat_indx++){
  1920. size_t interac_blk1 = blk1*mat_cnt+mat_indx;
  1921. size_t interac_dsp0 = (interac_blk1==0?0:interac_dsp[interac_blk1-1]);
  1922. size_t interac_dsp1 = interac_dsp[interac_blk1 ] ;
  1923. size_t interac_cnt = interac_dsp1-interac_dsp0;
  1924. Real_t** IN = IN_ + 2*V_BLK_SIZE*interac_blk1;
  1925. Real_t** OUT= OUT_+ 2*V_BLK_SIZE*interac_blk1;
  1926. Real_t* M = precomp_mat[mat_indx] + k*chld_cnt*chld_cnt*2;
  1927. #ifdef __SSE__
  1928. if (mat_indx +1 < mat_cnt){ // Prefetch
  1929. _mm_prefetch(((char *)(precomp_mat[mat_indx+1] + k*chld_cnt*chld_cnt*2)), _MM_HINT_T0);
  1930. _mm_prefetch(((char *)(precomp_mat[mat_indx+1] + k*chld_cnt*chld_cnt*2) + 64), _MM_HINT_T0);
  1931. }
  1932. #endif
  1933. for(int in_dim=0;in_dim<ker_dim0;in_dim++)
  1934. for(int ot_dim=0;ot_dim<ker_dim1;ot_dim++){
  1935. for(size_t j=0;j<interac_cnt;j+=2){
  1936. Real_t* M_ = M;
  1937. Real_t* IN0 = IN [j+0] + (in_dim*M_dim+k)*chld_cnt*2;
  1938. Real_t* IN1 = IN [j+1] + (in_dim*M_dim+k)*chld_cnt*2;
  1939. Real_t* OUT0 = OUT[j+0] + (ot_dim*M_dim+k)*chld_cnt*2;
  1940. Real_t* OUT1 = OUT[j+1] + (ot_dim*M_dim+k)*chld_cnt*2;
  1941. #ifdef __SSE__
  1942. if (j+2 < interac_cnt) { // Prefetch
  1943. _mm_prefetch(((char *)(IN[j+2] + (in_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  1944. _mm_prefetch(((char *)(IN[j+2] + (in_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  1945. _mm_prefetch(((char *)(IN[j+3] + (in_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  1946. _mm_prefetch(((char *)(IN[j+3] + (in_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  1947. _mm_prefetch(((char *)(OUT[j+2] + (ot_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  1948. _mm_prefetch(((char *)(OUT[j+2] + (ot_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  1949. _mm_prefetch(((char *)(OUT[j+3] + (ot_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  1950. _mm_prefetch(((char *)(OUT[j+3] + (ot_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  1951. }
  1952. #endif
  1953. #ifdef __AVX__ //AVX code.
  1954. __m256d out00,out01,out10,out11;
  1955. __m256d out20,out21,out30,out31;
  1956. double* in0__ = IN0;
  1957. double* in1__ = IN1;
  1958. out00 = _mm256_load_pd(OUT0);
  1959. out01 = _mm256_load_pd(OUT1);
  1960. out10 = _mm256_load_pd(OUT0+4);
  1961. out11 = _mm256_load_pd(OUT1+4);
  1962. out20 = _mm256_load_pd(OUT0+8);
  1963. out21 = _mm256_load_pd(OUT1+8);
  1964. out30 = _mm256_load_pd(OUT0+12);
  1965. out31 = _mm256_load_pd(OUT1+12);
  1966. for(int i2=0;i2<8;i2+=2){
  1967. __m256d m00;
  1968. __m256d ot00;
  1969. __m256d mt0,mtt0;
  1970. __m256d in00,in00_r,in01,in01_r;
  1971. in00 = _mm256_broadcast_pd((const __m128d*)in0__);
  1972. in00_r = _mm256_permute_pd(in00,5);
  1973. in01 = _mm256_broadcast_pd((const __m128d*)in1__);
  1974. in01_r = _mm256_permute_pd(in01,5);
  1975. m00 = _mm256_load_pd(M_);
  1976. mt0 = _mm256_unpacklo_pd(m00,m00);
  1977. ot00 = _mm256_mul_pd(mt0,in00);
  1978. mtt0 = _mm256_unpackhi_pd(m00,m00);
  1979. out00 = _mm256_add_pd(out00,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  1980. ot00 = _mm256_mul_pd(mt0,in01);
  1981. out01 = _mm256_add_pd(out01,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  1982. m00 = _mm256_load_pd(M_+4);
  1983. mt0 = _mm256_unpacklo_pd(m00,m00);
  1984. ot00 = _mm256_mul_pd(mt0,in00);
  1985. mtt0 = _mm256_unpackhi_pd(m00,m00);
  1986. out10 = _mm256_add_pd(out10,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  1987. ot00 = _mm256_mul_pd(mt0,in01);
  1988. out11 = _mm256_add_pd(out11,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  1989. m00 = _mm256_load_pd(M_+8);
  1990. mt0 = _mm256_unpacklo_pd(m00,m00);
  1991. ot00 = _mm256_mul_pd(mt0,in00);
  1992. mtt0 = _mm256_unpackhi_pd(m00,m00);
  1993. out20 = _mm256_add_pd(out20,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  1994. ot00 = _mm256_mul_pd(mt0,in01);
  1995. out21 = _mm256_add_pd(out21,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  1996. m00 = _mm256_load_pd(M_+12);
  1997. mt0 = _mm256_unpacklo_pd(m00,m00);
  1998. ot00 = _mm256_mul_pd(mt0,in00);
  1999. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2000. out30 = _mm256_add_pd(out30,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2001. ot00 = _mm256_mul_pd(mt0,in01);
  2002. out31 = _mm256_add_pd(out31,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2003. in00 = _mm256_broadcast_pd((const __m128d*) (in0__+2));
  2004. in00_r = _mm256_permute_pd(in00,5);
  2005. in01 = _mm256_broadcast_pd((const __m128d*) (in1__+2));
  2006. in01_r = _mm256_permute_pd(in01,5);
  2007. m00 = _mm256_load_pd(M_+16);
  2008. mt0 = _mm256_unpacklo_pd(m00,m00);
  2009. ot00 = _mm256_mul_pd(mt0,in00);
  2010. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2011. out00 = _mm256_add_pd(out00,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2012. ot00 = _mm256_mul_pd(mt0,in01);
  2013. out01 = _mm256_add_pd(out01,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2014. m00 = _mm256_load_pd(M_+20);
  2015. mt0 = _mm256_unpacklo_pd(m00,m00);
  2016. ot00 = _mm256_mul_pd(mt0,in00);
  2017. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2018. out10 = _mm256_add_pd(out10,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2019. ot00 = _mm256_mul_pd(mt0,in01);
  2020. out11 = _mm256_add_pd(out11,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2021. m00 = _mm256_load_pd(M_+24);
  2022. mt0 = _mm256_unpacklo_pd(m00,m00);
  2023. ot00 = _mm256_mul_pd(mt0,in00);
  2024. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2025. out20 = _mm256_add_pd(out20,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2026. ot00 = _mm256_mul_pd(mt0,in01);
  2027. out21 = _mm256_add_pd(out21,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2028. m00 = _mm256_load_pd(M_+28);
  2029. mt0 = _mm256_unpacklo_pd(m00,m00);
  2030. ot00 = _mm256_mul_pd(mt0,in00);
  2031. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2032. out30 = _mm256_add_pd(out30,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2033. ot00 = _mm256_mul_pd(mt0,in01);
  2034. out31 = _mm256_add_pd(out31,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2035. M_ += 32;
  2036. in0__ += 4;
  2037. in1__ += 4;
  2038. }
  2039. _mm256_store_pd(OUT0,out00);
  2040. _mm256_store_pd(OUT1,out01);
  2041. _mm256_store_pd(OUT0+4,out10);
  2042. _mm256_store_pd(OUT1+4,out11);
  2043. _mm256_store_pd(OUT0+8,out20);
  2044. _mm256_store_pd(OUT1+8,out21);
  2045. _mm256_store_pd(OUT0+12,out30);
  2046. _mm256_store_pd(OUT1+12,out31);
  2047. #elif defined __SSE3__ // SSE code.
  2048. __m128d out00, out01, out10, out11;
  2049. __m128d in00, in01, in10, in11;
  2050. __m128d m00, m01, m10, m11;
  2051. //#pragma unroll
  2052. for(int i1=0;i1<8;i1+=2){
  2053. double* IN0_=IN0;
  2054. double* IN1_=IN1;
  2055. out00 =_mm_load_pd (OUT0 );
  2056. out10 =_mm_load_pd (OUT0+2);
  2057. out01 =_mm_load_pd (OUT1 );
  2058. out11 =_mm_load_pd (OUT1+2);
  2059. //#pragma unroll
  2060. for(int i2=0;i2<8;i2+=2){
  2061. m00 =_mm_load1_pd (M_ );
  2062. m10 =_mm_load1_pd (M_+ 2);
  2063. m01 =_mm_load1_pd (M_+16);
  2064. m11 =_mm_load1_pd (M_+18);
  2065. in00 =_mm_load_pd (IN0_ );
  2066. in10 =_mm_load_pd (IN0_+2);
  2067. in01 =_mm_load_pd (IN1_ );
  2068. in11 =_mm_load_pd (IN1_+2);
  2069. out00 = _mm_add_pd (out00, _mm_mul_pd(m00 , in00 ));
  2070. out00 = _mm_add_pd (out00, _mm_mul_pd(m01 , in10 ));
  2071. out01 = _mm_add_pd (out01, _mm_mul_pd(m00 , in01 ));
  2072. out01 = _mm_add_pd (out01, _mm_mul_pd(m01 , in11 ));
  2073. out10 = _mm_add_pd (out10, _mm_mul_pd(m10 , in00 ));
  2074. out10 = _mm_add_pd (out10, _mm_mul_pd(m11 , in10 ));
  2075. out11 = _mm_add_pd (out11, _mm_mul_pd(m10 , in01 ));
  2076. out11 = _mm_add_pd (out11, _mm_mul_pd(m11 , in11 ));
  2077. m00 =_mm_load1_pd (M_+ 1);
  2078. m10 =_mm_load1_pd (M_+ 2+1);
  2079. m01 =_mm_load1_pd (M_+16+1);
  2080. m11 =_mm_load1_pd (M_+18+1);
  2081. in00 =_mm_shuffle_pd (in00,in00,_MM_SHUFFLE2(0,1));
  2082. in01 =_mm_shuffle_pd (in01,in01,_MM_SHUFFLE2(0,1));
  2083. in10 =_mm_shuffle_pd (in10,in10,_MM_SHUFFLE2(0,1));
  2084. in11 =_mm_shuffle_pd (in11,in11,_MM_SHUFFLE2(0,1));
  2085. out00 = _mm_addsub_pd(out00, _mm_mul_pd(m00, in00));
  2086. out00 = _mm_addsub_pd(out00, _mm_mul_pd(m01, in10));
  2087. out01 = _mm_addsub_pd(out01, _mm_mul_pd(m00, in01));
  2088. out01 = _mm_addsub_pd(out01, _mm_mul_pd(m01, in11));
  2089. out10 = _mm_addsub_pd(out10, _mm_mul_pd(m10, in00));
  2090. out10 = _mm_addsub_pd(out10, _mm_mul_pd(m11, in10));
  2091. out11 = _mm_addsub_pd(out11, _mm_mul_pd(m10, in01));
  2092. out11 = _mm_addsub_pd(out11, _mm_mul_pd(m11, in11));
  2093. M_+=32; // Jump to (column+2).
  2094. IN0_+=4;
  2095. IN1_+=4;
  2096. }
  2097. _mm_store_pd (OUT0 ,out00);
  2098. _mm_store_pd (OUT0+2,out10);
  2099. _mm_store_pd (OUT1 ,out01);
  2100. _mm_store_pd (OUT1+2,out11);
  2101. M_+=4-64*2; // Jump back to first column (row+2).
  2102. OUT0+=4;
  2103. OUT1+=4;
  2104. }
  2105. #else // Generic code.
  2106. Real_t out_reg000, out_reg001, out_reg010, out_reg011;
  2107. Real_t out_reg100, out_reg101, out_reg110, out_reg111;
  2108. Real_t in_reg000, in_reg001, in_reg010, in_reg011;
  2109. Real_t in_reg100, in_reg101, in_reg110, in_reg111;
  2110. Real_t m_reg000, m_reg001, m_reg010, m_reg011;
  2111. Real_t m_reg100, m_reg101, m_reg110, m_reg111;
  2112. //#pragma unroll
  2113. for(int i1=0;i1<8;i1+=2){
  2114. Real_t* IN0_=IN0;
  2115. Real_t* IN1_=IN1;
  2116. out_reg000=OUT0[ 0]; out_reg001=OUT0[ 1];
  2117. out_reg010=OUT0[ 2]; out_reg011=OUT0[ 3];
  2118. out_reg100=OUT1[ 0]; out_reg101=OUT1[ 1];
  2119. out_reg110=OUT1[ 2]; out_reg111=OUT1[ 3];
  2120. //#pragma unroll
  2121. for(int i2=0;i2<8;i2+=2){
  2122. m_reg000=M_[ 0]; m_reg001=M_[ 1];
  2123. m_reg010=M_[ 2]; m_reg011=M_[ 3];
  2124. m_reg100=M_[16]; m_reg101=M_[17];
  2125. m_reg110=M_[18]; m_reg111=M_[19];
  2126. in_reg000=IN0_[0]; in_reg001=IN0_[1];
  2127. in_reg010=IN0_[2]; in_reg011=IN0_[3];
  2128. in_reg100=IN1_[0]; in_reg101=IN1_[1];
  2129. in_reg110=IN1_[2]; in_reg111=IN1_[3];
  2130. out_reg000 += m_reg000*in_reg000 - m_reg001*in_reg001;
  2131. out_reg001 += m_reg000*in_reg001 + m_reg001*in_reg000;
  2132. out_reg010 += m_reg010*in_reg000 - m_reg011*in_reg001;
  2133. out_reg011 += m_reg010*in_reg001 + m_reg011*in_reg000;
  2134. out_reg000 += m_reg100*in_reg010 - m_reg101*in_reg011;
  2135. out_reg001 += m_reg100*in_reg011 + m_reg101*in_reg010;
  2136. out_reg010 += m_reg110*in_reg010 - m_reg111*in_reg011;
  2137. out_reg011 += m_reg110*in_reg011 + m_reg111*in_reg010;
  2138. out_reg100 += m_reg000*in_reg100 - m_reg001*in_reg101;
  2139. out_reg101 += m_reg000*in_reg101 + m_reg001*in_reg100;
  2140. out_reg110 += m_reg010*in_reg100 - m_reg011*in_reg101;
  2141. out_reg111 += m_reg010*in_reg101 + m_reg011*in_reg100;
  2142. out_reg100 += m_reg100*in_reg110 - m_reg101*in_reg111;
  2143. out_reg101 += m_reg100*in_reg111 + m_reg101*in_reg110;
  2144. out_reg110 += m_reg110*in_reg110 - m_reg111*in_reg111;
  2145. out_reg111 += m_reg110*in_reg111 + m_reg111*in_reg110;
  2146. M_+=32; // Jump to (column+2).
  2147. IN0_+=4;
  2148. IN1_+=4;
  2149. }
  2150. OUT0[ 0]=out_reg000; OUT0[ 1]=out_reg001;
  2151. OUT0[ 2]=out_reg010; OUT0[ 3]=out_reg011;
  2152. OUT1[ 0]=out_reg100; OUT1[ 1]=out_reg101;
  2153. OUT1[ 2]=out_reg110; OUT1[ 3]=out_reg111;
  2154. M_+=4-64*2; // Jump back to first column (row+2).
  2155. OUT0+=4;
  2156. OUT1+=4;
  2157. }
  2158. #endif
  2159. }
  2160. M += M_dim*128;
  2161. }
  2162. }
  2163. }
  2164. // Compute flops.
  2165. {
  2166. Profile::Add_FLOP(8*8*8*(interac_vec.Dim()/2)*M_dim*ker_dim0*ker_dim1*dof);
  2167. }
  2168. // Free memory
  2169. delete[] IN_ ;
  2170. delete[] OUT_;
  2171. mem::aligned_free<Real_t>(zero_vec0);
  2172. mem::aligned_free<Real_t>(zero_vec1);
  2173. }
  2174. template <class FMMNode>
  2175. void FMM_Pts<FMMNode>::V_ListSetup(SetupData<Real_t>& setup_data, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2176. if(level==0) return;
  2177. { // Set setup_data
  2178. setup_data.level=level;
  2179. setup_data.kernel=&aux_kernel;
  2180. setup_data.interac_type.resize(1);
  2181. setup_data.interac_type[0]=V1_Type;
  2182. setup_data. input_data=&buff[0];
  2183. setup_data.output_data=&buff[1];
  2184. Vector<FMMNode_t*>& nodes_in =n_list[2];
  2185. Vector<FMMNode_t*>& nodes_out=n_list[3];
  2186. setup_data.nodes_in .clear();
  2187. setup_data.nodes_out.clear();
  2188. for(size_t i=0;i<nodes_in .Dim();i++) if(nodes_in [i]->Depth()==level-1 || level==-1) setup_data.nodes_in .push_back(nodes_in [i]);
  2189. for(size_t i=0;i<nodes_out.Dim();i++) if(nodes_out[i]->Depth()==level-1 || level==-1) setup_data.nodes_out.push_back(nodes_out[i]);
  2190. }
  2191. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2192. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2193. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2194. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2195. for(size_t i=0;i<nodes_in .size();i++) input_vector.push_back(&((FMMData*)((FMMNode*)((FMMNode*)nodes_in [i])->Child(0))->FMMData())->upward_equiv);
  2196. for(size_t i=0;i<nodes_out.size();i++) output_vector.push_back(&((FMMData*)((FMMNode*)((FMMNode*)nodes_out[i])->Child(0))->FMMData())->dnward_equiv);
  2197. /////////////////////////////////////////////////////////////////////////////
  2198. size_t n_in =nodes_in .size();
  2199. size_t n_out=nodes_out.size();
  2200. // Setup precomputed data.
  2201. SetupPrecomp(setup_data,device);
  2202. // Build interac_data
  2203. Profile::Tic("Interac-Data",&this->comm,true,25);
  2204. Matrix<char>& interac_data=setup_data.interac_data;
  2205. if(n_out>0 && n_in >0){ // Build precomp_data, interac_data
  2206. size_t precomp_offset=0;
  2207. Mat_Type& interac_type=setup_data.interac_type[0];
  2208. size_t mat_cnt=this->interac_list.ListCount(interac_type);
  2209. Vector<size_t> precomp_data_offset;
  2210. std::vector<size_t> interac_mat;
  2211. { // Load precomp_data for interac_type.
  2212. Matrix<char>& precomp_data=*setup_data.precomp_data;
  2213. char* indx_ptr=precomp_data[0]+precomp_offset;
  2214. size_t total_size=((size_t*)indx_ptr)[0]; indx_ptr+=sizeof(size_t);
  2215. /*size_t mat_cnt_ =((size_t*)indx_ptr)[0];*/ indx_ptr+=sizeof(size_t);
  2216. precomp_data_offset.ReInit((1+2+2)*mat_cnt, (size_t*)indx_ptr, false);
  2217. precomp_offset+=total_size;
  2218. for(size_t mat_id=0;mat_id<mat_cnt;mat_id++){
  2219. Matrix<Real_t>& M0 = this->mat->Mat(level, interac_type, mat_id);
  2220. assert(M0.Dim(0)>0 && M0.Dim(1)>0); UNUSED(M0);
  2221. interac_mat.push_back(precomp_data_offset[5*mat_id]);
  2222. }
  2223. }
  2224. size_t dof;
  2225. size_t m=MultipoleOrder();
  2226. size_t ker_dim0=setup_data.kernel->ker_dim[0];
  2227. size_t ker_dim1=setup_data.kernel->ker_dim[1];
  2228. size_t fftsize;
  2229. {
  2230. size_t n1=m*2;
  2231. size_t n2=n1*n1;
  2232. size_t n3_=n2*(n1/2+1);
  2233. size_t chld_cnt=1UL<<COORD_DIM;
  2234. fftsize=2*n3_*chld_cnt;
  2235. dof=1;
  2236. }
  2237. int omp_p=omp_get_max_threads();
  2238. size_t buff_size=DEVICE_BUFFER_SIZE*1024l*1024l;
  2239. size_t n_blk0=2*fftsize*dof*(ker_dim0*n_in +ker_dim1*n_out)*sizeof(Real_t)/buff_size;
  2240. if(n_blk0==0) n_blk0=1;
  2241. std::vector<std::vector<size_t> > fft_vec(n_blk0);
  2242. std::vector<std::vector<size_t> > ifft_vec(n_blk0);
  2243. std::vector<std::vector<size_t> > interac_vec(n_blk0);
  2244. std::vector<std::vector<size_t> > interac_dsp(n_blk0);
  2245. {
  2246. Matrix<Real_t>& input_data=*setup_data. input_data;
  2247. Matrix<Real_t>& output_data=*setup_data.output_data;
  2248. std::vector<std::vector<FMMNode*> > nodes_blk_in (n_blk0);
  2249. std::vector<std::vector<FMMNode*> > nodes_blk_out(n_blk0);
  2250. for(size_t i=0;i<n_in;i++) ((FMMNode*)nodes_in[i])->node_id=i;
  2251. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2252. size_t blk0_start=(n_out* blk0 )/n_blk0;
  2253. size_t blk0_end =(n_out*(blk0+1))/n_blk0;
  2254. std::vector<FMMNode*>& nodes_in_ =nodes_blk_in [blk0];
  2255. std::vector<FMMNode*>& nodes_out_=nodes_blk_out[blk0];
  2256. { // Build node list for blk0.
  2257. std::set<void*> nodes_in;
  2258. for(size_t i=blk0_start;i<blk0_end;i++){
  2259. nodes_out_.push_back((FMMNode*)nodes_out[i]);
  2260. std::vector<FMMNode*>& lst=((FMMNode*)nodes_out[i])->interac_list[interac_type];
  2261. for(size_t k=0;k<mat_cnt;k++) if(lst[k]!=NULL) nodes_in.insert(lst[k]);
  2262. }
  2263. for(std::set<void*>::iterator node=nodes_in.begin(); node != nodes_in.end(); node++){
  2264. nodes_in_.push_back((FMMNode*)*node);
  2265. }
  2266. size_t input_dim=nodes_in_ .size()*ker_dim0*dof*fftsize;
  2267. size_t output_dim=nodes_out_.size()*ker_dim1*dof*fftsize;
  2268. size_t buffer_dim=(ker_dim0+ker_dim1)*dof*fftsize*omp_p;
  2269. if(buff_size<(input_dim + output_dim + buffer_dim)*sizeof(Real_t))
  2270. buff_size=(input_dim + output_dim + buffer_dim)*sizeof(Real_t);
  2271. }
  2272. { // Set fft vectors.
  2273. for(size_t i=0;i<nodes_in_ .size();i++) fft_vec[blk0].push_back((size_t)(& input_vector[nodes_in_[i]->node_id][0][0]- input_data[0]));
  2274. for(size_t i=0;i<nodes_out_.size();i++)ifft_vec[blk0].push_back((size_t)(&output_vector[blk0_start + i ][0][0]-output_data[0]));
  2275. }
  2276. }
  2277. for(size_t blk0=0;blk0<n_blk0;blk0++){ // Hadamard interactions.
  2278. std::vector<FMMNode*>& nodes_in_ =nodes_blk_in [blk0];
  2279. std::vector<FMMNode*>& nodes_out_=nodes_blk_out[blk0];
  2280. for(size_t i=0;i<nodes_in_.size();i++) nodes_in_[i]->node_id=i;
  2281. { // Next blocking level.
  2282. size_t n_blk1=nodes_out_.size()*(ker_dim0+ker_dim1)/V_BLK_SIZE; //64 vectors should fit in L1.
  2283. if(n_blk1==0) n_blk1=1;
  2284. size_t interac_dsp_=0;
  2285. for(size_t blk1=0;blk1<n_blk1;blk1++){
  2286. size_t blk1_start=(nodes_out_.size()* blk1 )/n_blk1;
  2287. size_t blk1_end =(nodes_out_.size()*(blk1+1))/n_blk1;
  2288. for(size_t k=0;k<mat_cnt;k++){
  2289. for(size_t i=blk1_start;i<blk1_end;i++){
  2290. std::vector<FMMNode*>& lst=((FMMNode*)nodes_out_[i])->interac_list[interac_type];
  2291. if(lst[k]!=NULL){
  2292. interac_vec[blk0].push_back(lst[k]->node_id*fftsize*ker_dim0*dof);
  2293. interac_vec[blk0].push_back( i *fftsize*ker_dim1*dof);
  2294. interac_dsp_++;
  2295. }
  2296. }
  2297. interac_dsp[blk0].push_back(interac_dsp_);
  2298. }
  2299. }
  2300. }
  2301. }
  2302. }
  2303. { // Set interac_data.
  2304. size_t data_size=sizeof(size_t)*5; // m, dof, ker_dim0, ker_dim1, n_blk0
  2305. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2306. data_size+=sizeof(size_t)+ fft_vec[blk0].size()*sizeof(size_t);
  2307. data_size+=sizeof(size_t)+ ifft_vec[blk0].size()*sizeof(size_t);
  2308. data_size+=sizeof(size_t)+interac_vec[blk0].size()*sizeof(size_t);
  2309. data_size+=sizeof(size_t)+interac_dsp[blk0].size()*sizeof(size_t);
  2310. }
  2311. data_size+=sizeof(size_t)+interac_mat.size()*sizeof(size_t);
  2312. if(data_size>interac_data.Dim(0)*interac_data.Dim(1))
  2313. interac_data.Resize(1,data_size);
  2314. char* data_ptr=&interac_data[0][0];
  2315. ((size_t*)data_ptr)[0]=buff_size; data_ptr+=sizeof(size_t);
  2316. ((size_t*)data_ptr)[0]= m; data_ptr+=sizeof(size_t);
  2317. ((size_t*)data_ptr)[0]= dof; data_ptr+=sizeof(size_t);
  2318. ((size_t*)data_ptr)[0]= ker_dim0; data_ptr+=sizeof(size_t);
  2319. ((size_t*)data_ptr)[0]= ker_dim1; data_ptr+=sizeof(size_t);
  2320. ((size_t*)data_ptr)[0]= n_blk0; data_ptr+=sizeof(size_t);
  2321. ((size_t*)data_ptr)[0]= interac_mat.size(); data_ptr+=sizeof(size_t);
  2322. mem::memcopy(data_ptr, &interac_mat[0], interac_mat.size()*sizeof(size_t));
  2323. data_ptr+=interac_mat.size()*sizeof(size_t);
  2324. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2325. ((size_t*)data_ptr)[0]= fft_vec[blk0].size(); data_ptr+=sizeof(size_t);
  2326. mem::memcopy(data_ptr, & fft_vec[blk0][0], fft_vec[blk0].size()*sizeof(size_t));
  2327. data_ptr+= fft_vec[blk0].size()*sizeof(size_t);
  2328. ((size_t*)data_ptr)[0]=ifft_vec[blk0].size(); data_ptr+=sizeof(size_t);
  2329. mem::memcopy(data_ptr, &ifft_vec[blk0][0], ifft_vec[blk0].size()*sizeof(size_t));
  2330. data_ptr+=ifft_vec[blk0].size()*sizeof(size_t);
  2331. ((size_t*)data_ptr)[0]=interac_vec[blk0].size(); data_ptr+=sizeof(size_t);
  2332. mem::memcopy(data_ptr, &interac_vec[blk0][0], interac_vec[blk0].size()*sizeof(size_t));
  2333. data_ptr+=interac_vec[blk0].size()*sizeof(size_t);
  2334. ((size_t*)data_ptr)[0]=interac_dsp[blk0].size(); data_ptr+=sizeof(size_t);
  2335. mem::memcopy(data_ptr, &interac_dsp[blk0][0], interac_dsp[blk0].size()*sizeof(size_t));
  2336. data_ptr+=interac_dsp[blk0].size()*sizeof(size_t);
  2337. }
  2338. }
  2339. }
  2340. Profile::Toc();
  2341. Profile::Tic("Host2Device",&this->comm,false,25);
  2342. if(device){ // Host2Device
  2343. setup_data.interac_data. AllocDevice(true);
  2344. }
  2345. Profile::Toc();
  2346. }
  2347. template <class FMMNode>
  2348. void FMM_Pts<FMMNode>::V_List (SetupData<Real_t>& setup_data, bool device){
  2349. assert(!device); //Can not run on accelerator yet.
  2350. if(setup_data.interac_data.Dim(0)==0 || setup_data.interac_data.Dim(1)==0){
  2351. Profile::Tic("Host2Device",&this->comm,false,25);
  2352. Profile::Toc();
  2353. Profile::Tic("FFT",&comm,false,100);
  2354. Profile::Toc();
  2355. Profile::Tic("HadamardProduct",&comm,false,100);
  2356. Profile::Toc();
  2357. Profile::Tic("IFFT",&comm,false,100);
  2358. Profile::Toc();
  2359. return;
  2360. }
  2361. Profile::Tic("Host2Device",&this->comm,false,25);
  2362. int level=setup_data.level;
  2363. size_t buff_size=*((size_t*)&setup_data.interac_data[0][0]);
  2364. typename Matrix<Real_t>::Device M_d;
  2365. typename Vector<char>::Device buff;
  2366. typename Matrix<char>::Device precomp_data;
  2367. typename Matrix<char>::Device interac_data;
  2368. typename Matrix<Real_t>::Device input_data;
  2369. typename Matrix<Real_t>::Device output_data;
  2370. Matrix<Real_t>& M = this->mat->Mat(level, DC2DE_Type, 0);
  2371. if(device){
  2372. if(this->dev_buffer.Dim()<buff_size) this->dev_buffer.Resize(buff_size);
  2373. M_d = M. AllocDevice(false);
  2374. buff = this-> dev_buffer. AllocDevice(false);
  2375. precomp_data= setup_data.precomp_data->AllocDevice(false);
  2376. interac_data= setup_data.interac_data. AllocDevice(false);
  2377. input_data = setup_data. input_data->AllocDevice(false);
  2378. output_data = setup_data. output_data->AllocDevice(false);
  2379. }else{
  2380. if(this->cpu_buffer.Dim()<buff_size) this->cpu_buffer.Resize(buff_size);
  2381. M_d = M;
  2382. buff = this-> cpu_buffer;
  2383. precomp_data=*setup_data.precomp_data;
  2384. interac_data= setup_data.interac_data;
  2385. input_data =*setup_data. input_data;
  2386. output_data =*setup_data. output_data;
  2387. }
  2388. Profile::Toc();
  2389. { // Offloaded computation.
  2390. // Set interac_data.
  2391. size_t m, dof, ker_dim0, ker_dim1, n_blk0;
  2392. std::vector<Vector<size_t> > fft_vec;
  2393. std::vector<Vector<size_t> > ifft_vec;
  2394. std::vector<Vector<size_t> > interac_vec;
  2395. std::vector<Vector<size_t> > interac_dsp;
  2396. Vector<Real_t*> precomp_mat;
  2397. { // Set interac_data.
  2398. char* data_ptr=&interac_data[0][0];
  2399. buff_size=((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2400. m =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2401. dof =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2402. ker_dim0 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2403. ker_dim1 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2404. n_blk0 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2405. fft_vec .resize(n_blk0);
  2406. ifft_vec.resize(n_blk0);
  2407. interac_vec.resize(n_blk0);
  2408. interac_dsp.resize(n_blk0);
  2409. Vector<size_t> interac_mat;
  2410. interac_mat.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2411. data_ptr+=sizeof(size_t)+interac_mat.Dim()*sizeof(size_t);
  2412. precomp_mat.Resize(interac_mat.Dim());
  2413. for(size_t i=0;i<interac_mat.Dim();i++){
  2414. precomp_mat[i]=(Real_t*)(precomp_data[0]+interac_mat[i]);
  2415. }
  2416. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2417. fft_vec[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2418. data_ptr+=sizeof(size_t)+fft_vec[blk0].Dim()*sizeof(size_t);
  2419. ifft_vec[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2420. data_ptr+=sizeof(size_t)+ifft_vec[blk0].Dim()*sizeof(size_t);
  2421. interac_vec[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2422. data_ptr+=sizeof(size_t)+interac_vec[blk0].Dim()*sizeof(size_t);
  2423. interac_dsp[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2424. data_ptr+=sizeof(size_t)+interac_dsp[blk0].Dim()*sizeof(size_t);
  2425. }
  2426. }
  2427. int omp_p=omp_get_max_threads();
  2428. size_t M_dim, fftsize;
  2429. {
  2430. size_t n1=m*2;
  2431. size_t n2=n1*n1;
  2432. size_t n3_=n2*(n1/2+1);
  2433. size_t chld_cnt=1UL<<COORD_DIM;
  2434. fftsize=2*n3_*chld_cnt;
  2435. M_dim=n3_;
  2436. }
  2437. for(size_t blk0=0;blk0<n_blk0;blk0++){ // interactions
  2438. size_t n_in = fft_vec[blk0].Dim();
  2439. size_t n_out=ifft_vec[blk0].Dim();
  2440. size_t input_dim=n_in *ker_dim0*dof*fftsize;
  2441. size_t output_dim=n_out*ker_dim1*dof*fftsize;
  2442. size_t buffer_dim=(ker_dim0+ker_dim1)*dof*fftsize*omp_p;
  2443. Vector<Real_t> fft_in ( input_dim, (Real_t*)&buff[ 0 ],false);
  2444. Vector<Real_t> fft_out(output_dim, (Real_t*)&buff[ input_dim *sizeof(Real_t)],false);
  2445. Vector<Real_t> buffer(buffer_dim, (Real_t*)&buff[(input_dim+output_dim)*sizeof(Real_t)],false);
  2446. { // FFT
  2447. Profile::Tic("FFT",&comm,false,100);
  2448. Vector<Real_t> input_data_( input_data.dim[0]* input_data.dim[1], input_data[0], false);
  2449. FFT_UpEquiv(dof, m, ker_dim0, fft_vec[blk0], input_data_, fft_in, buffer);
  2450. Profile::Toc();
  2451. }
  2452. { // Hadamard
  2453. #ifdef PVFMM_HAVE_PAPI
  2454. #ifdef __VERBOSE__
  2455. std::cout << "Starting counters new\n";
  2456. if (PAPI_start(EventSet) != PAPI_OK) std::cout << "handle_error3" << std::endl;
  2457. #endif
  2458. #endif
  2459. Profile::Tic("HadamardProduct",&comm,false,100);
  2460. VListHadamard<Real_t>(dof, M_dim, ker_dim0, ker_dim1, interac_dsp[blk0], interac_vec[blk0], precomp_mat, fft_in, fft_out);
  2461. Profile::Toc();
  2462. #ifdef PVFMM_HAVE_PAPI
  2463. #ifdef __VERBOSE__
  2464. if (PAPI_stop(EventSet, values) != PAPI_OK) std::cout << "handle_error4" << std::endl;
  2465. std::cout << "Stopping counters\n";
  2466. #endif
  2467. #endif
  2468. }
  2469. { // IFFT
  2470. Profile::Tic("IFFT",&comm,false,100);
  2471. Matrix<Real_t> M(M_d.dim[0],M_d.dim[1],M_d[0],false);
  2472. Vector<Real_t> output_data_(output_data.dim[0]*output_data.dim[1], output_data[0], false);
  2473. FFT_Check2Equiv(dof, m, ker_dim1, ifft_vec[blk0], fft_out, output_data_, buffer, M);
  2474. Profile::Toc();
  2475. }
  2476. }
  2477. }
  2478. }
  2479. template <class FMMNode>
  2480. void FMM_Pts<FMMNode>::Down2DownSetup(SetupData<Real_t>& setup_data, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2481. { // Set setup_data
  2482. setup_data.level=level;
  2483. setup_data.kernel=&aux_kernel;
  2484. setup_data.interac_type.resize(1);
  2485. setup_data.interac_type[0]=D2D_Type;
  2486. setup_data. input_data=&buff[1];
  2487. setup_data.output_data=&buff[1];
  2488. Vector<FMMNode_t*>& nodes_in =n_list[1];
  2489. Vector<FMMNode_t*>& nodes_out=n_list[1];
  2490. setup_data.nodes_in .clear();
  2491. setup_data.nodes_out.clear();
  2492. for(size_t i=0;i<nodes_in .Dim();i++) if(nodes_in [i]->Depth()==level-1) setup_data.nodes_in .push_back(nodes_in [i]);
  2493. for(size_t i=0;i<nodes_out.Dim();i++) if(nodes_out[i]->Depth()==level ) setup_data.nodes_out.push_back(nodes_out[i]);
  2494. }
  2495. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2496. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2497. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2498. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2499. for(size_t i=0;i<nodes_in .size();i++) input_vector.push_back(&((FMMData*)((FMMNode*)nodes_in [i])->FMMData())->dnward_equiv);
  2500. for(size_t i=0;i<nodes_out.size();i++) output_vector.push_back(&((FMMData*)((FMMNode*)nodes_out[i])->FMMData())->dnward_equiv);
  2501. SetupInterac(setup_data,device);
  2502. }
  2503. template <class FMMNode>
  2504. void FMM_Pts<FMMNode>::Down2Down (SetupData<Real_t>& setup_data, bool device){
  2505. //Add Down2Down contribution.
  2506. EvalList(setup_data, device);
  2507. }
  2508. template <class FMMNode>
  2509. void FMM_Pts<FMMNode>::SetupInteracPts(SetupData<Real_t>& setup_data, bool shift_src, bool shift_trg, Matrix<Real_t>* M, bool device){
  2510. int level=setup_data.level;
  2511. std::vector<Mat_Type>& interac_type_lst=setup_data.interac_type;
  2512. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2513. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2514. Matrix<Real_t>& output_data=*setup_data.output_data;
  2515. Matrix<Real_t>& input_data=*setup_data. input_data;
  2516. Matrix<Real_t>& coord_data=*setup_data. coord_data;
  2517. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector;
  2518. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector;
  2519. size_t n_in =nodes_in .size();
  2520. size_t n_out=nodes_out.size();
  2521. //setup_data.precomp_data=NULL;
  2522. // Build interac_data
  2523. Profile::Tic("Interac-Data",&this->comm,true,25);
  2524. Matrix<char>& interac_data=setup_data.interac_data;
  2525. if(n_out>0 && n_in >0){
  2526. size_t ker_dim0=setup_data.kernel->ker_dim[0];
  2527. size_t ker_dim1=setup_data.kernel->ker_dim[1];
  2528. size_t dof=1;
  2529. for(size_t i=0;i<n_in ;i++) ((FMMNode*)nodes_in [i])->node_id=i;
  2530. std::vector<size_t> trg_interac_cnt(n_out,0);
  2531. std::vector<size_t> trg_coord(n_out);
  2532. std::vector<size_t> trg_value(n_out);
  2533. std::vector<size_t> trg_cnt(n_out);
  2534. std::vector<Real_t> scaling(n_out,0);
  2535. { // Set trg data
  2536. Mat_Type& interac_type=interac_type_lst[0];
  2537. for(size_t i=0;i<n_out;i++){
  2538. if(!((FMMNode*)nodes_out[i])->IsGhost() && (level==-1 || ((FMMNode*)nodes_out[i])->Depth()==level)){
  2539. trg_cnt [i]=output_vector[i*2+0]->Dim()/COORD_DIM;
  2540. trg_coord[i]=(size_t)(&output_vector[i*2+0][0][0]- coord_data[0]);
  2541. trg_value[i]=(size_t)(&output_vector[i*2+1][0][0]-output_data[0]);
  2542. if(!this->Homogen()) scaling[i]=1.0;
  2543. else if(interac_type==X_Type) scaling[i]=pow(0.5, setup_data.kernel->poten_scale *((FMMNode*)nodes_out[i])->Depth());
  2544. }
  2545. }
  2546. }
  2547. std::vector<std::vector<size_t> > src_cnt(n_out);
  2548. std::vector<std::vector<size_t> > src_coord(n_out);
  2549. std::vector<std::vector<size_t> > src_value(n_out);
  2550. std::vector<std::vector<Real_t> > shift_coord(n_out);
  2551. for(size_t type_indx=0; type_indx<interac_type_lst.size(); type_indx++){
  2552. Mat_Type& interac_type=interac_type_lst[type_indx];
  2553. size_t mat_cnt=this->interac_list.ListCount(interac_type);
  2554. for(size_t i=0;i<n_out;i++){ // For each target node.
  2555. if(!((FMMNode*)nodes_out[i])->IsGhost() && (level==-1 || ((FMMNode*)nodes_out[i])->Depth()==level)){
  2556. std::vector<FMMNode*>& lst=((FMMNode*)nodes_out[i])->interac_list[interac_type];
  2557. for(size_t mat_indx=0;mat_indx<mat_cnt;mat_indx++) if(lst[mat_indx]!=NULL){ // For each direction.
  2558. size_t j=lst[mat_indx]->node_id;
  2559. if(input_vector[j*4+0]->Dim()>0 || input_vector[j*4+2]->Dim()>0){
  2560. trg_interac_cnt[i]++;
  2561. { // Determine shift for periodic boundary condition
  2562. Real_t* sc=lst[mat_indx]->Coord();
  2563. Real_t* tc=((FMMNode*)nodes_out[i])->Coord();
  2564. int* rel_coord=this->interac_list.RelativeCoord(interac_type, mat_indx);
  2565. shift_coord[i].push_back((tc[0]>sc[0] && rel_coord[0]>0? 1.0:
  2566. (tc[0]<sc[0] && rel_coord[0]<0?-1.0:0.0)) +
  2567. (shift_src?sc[0]:0) - (shift_trg?tc[0]:0) );
  2568. shift_coord[i].push_back((tc[1]>sc[1] && rel_coord[1]>0? 1.0:
  2569. (tc[1]<sc[1] && rel_coord[1]<0?-1.0:0.0)) +
  2570. (shift_src?sc[1]:0) - (shift_trg?tc[1]:0) );
  2571. shift_coord[i].push_back((tc[2]>sc[2] && rel_coord[2]>0? 1.0:
  2572. (tc[2]<sc[2] && rel_coord[2]<0?-1.0:0.0)) +
  2573. (shift_src?sc[2]:0) - (shift_trg?tc[2]:0) );
  2574. }
  2575. { // Set src data
  2576. if(input_vector[j*4+0]!=NULL){
  2577. src_cnt [i].push_back(input_vector[j*4+0]->Dim()/COORD_DIM);
  2578. src_coord[i].push_back((size_t)(& input_vector[j*4+0][0][0]- coord_data[0]));
  2579. src_value[i].push_back((size_t)(& input_vector[j*4+1][0][0]- input_data[0]));
  2580. }else{
  2581. src_cnt [i].push_back(0);
  2582. src_coord[i].push_back(0);
  2583. src_value[i].push_back(0);
  2584. }
  2585. if(input_vector[j*4+2]!=NULL){
  2586. src_cnt [i].push_back(input_vector[j*4+2]->Dim()/COORD_DIM);
  2587. src_coord[i].push_back((size_t)(& input_vector[j*4+2][0][0]- coord_data[0]));
  2588. src_value[i].push_back((size_t)(& input_vector[j*4+3][0][0]- input_data[0]));
  2589. }else{
  2590. src_cnt [i].push_back(0);
  2591. src_coord[i].push_back(0);
  2592. src_value[i].push_back(0);
  2593. }
  2594. }
  2595. }
  2596. }
  2597. }
  2598. }
  2599. }
  2600. { // Set interac_data.
  2601. size_t data_size=sizeof(size_t)*4;
  2602. data_size+=sizeof(size_t)+trg_interac_cnt.size()*sizeof(size_t);
  2603. data_size+=sizeof(size_t)+trg_coord.size()*sizeof(size_t);
  2604. data_size+=sizeof(size_t)+trg_value.size()*sizeof(size_t);
  2605. data_size+=sizeof(size_t)+trg_cnt .size()*sizeof(size_t);
  2606. data_size+=sizeof(size_t)+scaling .size()*sizeof(Real_t);
  2607. data_size+=sizeof(size_t)*2+(M!=NULL?M->Dim(0)*M->Dim(1)*sizeof(Real_t):0);
  2608. for(size_t i=0;i<n_out;i++){
  2609. data_size+=sizeof(size_t)+src_cnt [i].size()*sizeof(size_t);
  2610. data_size+=sizeof(size_t)+src_coord[i].size()*sizeof(size_t);
  2611. data_size+=sizeof(size_t)+src_value[i].size()*sizeof(size_t);
  2612. data_size+=sizeof(size_t)+shift_coord[i].size()*sizeof(Real_t);
  2613. }
  2614. if(data_size>interac_data.Dim(0)*interac_data.Dim(1))
  2615. interac_data.Resize(1,data_size);
  2616. char* data_ptr=&interac_data[0][0];
  2617. ((size_t*)data_ptr)[0]=data_size; data_ptr+=sizeof(size_t);
  2618. ((size_t*)data_ptr)[0]= ker_dim0; data_ptr+=sizeof(size_t);
  2619. ((size_t*)data_ptr)[0]= ker_dim1; data_ptr+=sizeof(size_t);
  2620. ((size_t*)data_ptr)[0]= dof; data_ptr+=sizeof(size_t);
  2621. ((size_t*)data_ptr)[0]=trg_interac_cnt.size(); data_ptr+=sizeof(size_t);
  2622. mem::memcopy(data_ptr, &trg_interac_cnt[0], trg_interac_cnt.size()*sizeof(size_t));
  2623. data_ptr+=trg_interac_cnt.size()*sizeof(size_t);
  2624. ((size_t*)data_ptr)[0]=trg_coord.size(); data_ptr+=sizeof(size_t);
  2625. mem::memcopy(data_ptr, &trg_coord[0], trg_coord.size()*sizeof(size_t));
  2626. data_ptr+=trg_coord.size()*sizeof(size_t);
  2627. ((size_t*)data_ptr)[0]=trg_value.size(); data_ptr+=sizeof(size_t);
  2628. mem::memcopy(data_ptr, &trg_value[0], trg_value.size()*sizeof(size_t));
  2629. data_ptr+=trg_value.size()*sizeof(size_t);
  2630. ((size_t*)data_ptr)[0]=trg_cnt.size(); data_ptr+=sizeof(size_t);
  2631. mem::memcopy(data_ptr, &trg_cnt[0], trg_cnt.size()*sizeof(size_t));
  2632. data_ptr+=trg_cnt.size()*sizeof(size_t);
  2633. ((size_t*)data_ptr)[0]=scaling.size(); data_ptr+=sizeof(size_t);
  2634. mem::memcopy(data_ptr, &scaling[0], scaling.size()*sizeof(Real_t));
  2635. data_ptr+=scaling.size()*sizeof(Real_t);
  2636. if(M!=NULL){
  2637. ((size_t*)data_ptr)[0]=M->Dim(0); data_ptr+=sizeof(size_t);
  2638. ((size_t*)data_ptr)[0]=M->Dim(1); data_ptr+=sizeof(size_t);
  2639. mem::memcopy(data_ptr, M[0][0], M->Dim(0)*M->Dim(1)*sizeof(Real_t));
  2640. data_ptr+=M->Dim(0)*M->Dim(1)*sizeof(Real_t);
  2641. }else{
  2642. ((size_t*)data_ptr)[0]=0; data_ptr+=sizeof(size_t);
  2643. ((size_t*)data_ptr)[0]=0; data_ptr+=sizeof(size_t);
  2644. }
  2645. for(size_t i=0;i<n_out;i++){
  2646. ((size_t*)data_ptr)[0]=src_cnt[i].size(); data_ptr+=sizeof(size_t);
  2647. mem::memcopy(data_ptr, &src_cnt[i][0], src_cnt[i].size()*sizeof(size_t));
  2648. data_ptr+=src_cnt[i].size()*sizeof(size_t);
  2649. ((size_t*)data_ptr)[0]=src_coord[i].size(); data_ptr+=sizeof(size_t);
  2650. mem::memcopy(data_ptr, &src_coord[i][0], src_coord[i].size()*sizeof(size_t));
  2651. data_ptr+=src_coord[i].size()*sizeof(size_t);
  2652. ((size_t*)data_ptr)[0]=src_value[i].size(); data_ptr+=sizeof(size_t);
  2653. mem::memcopy(data_ptr, &src_value[i][0], src_value[i].size()*sizeof(size_t));
  2654. data_ptr+=src_value[i].size()*sizeof(size_t);
  2655. ((size_t*)data_ptr)[0]=shift_coord[i].size(); data_ptr+=sizeof(size_t);
  2656. mem::memcopy(data_ptr, &shift_coord[i][0], shift_coord[i].size()*sizeof(Real_t));
  2657. data_ptr+=shift_coord[i].size()*sizeof(Real_t);
  2658. }
  2659. }
  2660. size_t buff_size=DEVICE_BUFFER_SIZE*1024l*1024l;
  2661. if(this->dev_buffer.Dim()<buff_size) this->dev_buffer.Resize(buff_size);
  2662. if(this->cpu_buffer.Dim()<buff_size) this->cpu_buffer.Resize(buff_size);
  2663. }
  2664. Profile::Toc();
  2665. Profile::Tic("Host2Device",&this->comm,false,25);
  2666. if(device){ // Host2Device
  2667. setup_data.interac_data .AllocDevice(true);
  2668. }
  2669. Profile::Toc();
  2670. }
  2671. template <class FMMNode>
  2672. void FMM_Pts<FMMNode>::EvalListPts(SetupData<Real_t>& setup_data, bool device){
  2673. if(setup_data.interac_data.Dim(0)==0 || setup_data.interac_data.Dim(1)==0){
  2674. Profile::Tic("Host2Device",&this->comm,false,25);
  2675. Profile::Toc();
  2676. Profile::Tic("DeviceComp",&this->comm,false,20);
  2677. Profile::Toc();
  2678. return;
  2679. }
  2680. std::cout << "EvalListPts, device = " << device << '\n';
  2681. Profile::Tic("Host2Device",&this->comm,false,25);
  2682. typename Vector<char>::Device buff;
  2683. //typename Matrix<char>::Device precomp_data;
  2684. typename Matrix<char>::Device interac_data;
  2685. typename Matrix<Real_t>::Device coord_data;
  2686. typename Matrix<Real_t>::Device input_data;
  2687. typename Matrix<Real_t>::Device output_data;
  2688. if(device){
  2689. buff = this-> dev_buffer. AllocDevice(false);
  2690. interac_data= setup_data.interac_data. AllocDevice(false);
  2691. //if(setup_data.precomp_data!=NULL) precomp_data= setup_data.precomp_data->AllocDevice(false);
  2692. if(setup_data. coord_data!=NULL) coord_data = setup_data. coord_data->AllocDevice(false);
  2693. if(setup_data. input_data!=NULL) input_data = setup_data. input_data->AllocDevice(false);
  2694. if(setup_data. output_data!=NULL) output_data = setup_data. output_data->AllocDevice(false);
  2695. }else{
  2696. buff = this-> cpu_buffer;
  2697. interac_data= setup_data.interac_data;
  2698. //if(setup_data.precomp_data!=NULL) precomp_data=*setup_data.precomp_data;
  2699. if(setup_data. coord_data!=NULL) coord_data =*setup_data. coord_data;
  2700. if(setup_data. input_data!=NULL) input_data =*setup_data. input_data;
  2701. if(setup_data. output_data!=NULL) output_data =*setup_data. output_data;
  2702. }
  2703. Profile::Toc();
  2704. std::cout << "EvalListPts, end allocation. " << '\n';
  2705. size_t ptr_single_layer_kernel=(size_t)setup_data.kernel->ker_poten;
  2706. size_t ptr_double_layer_kernel=(size_t)setup_data.kernel->dbl_layer_poten;
  2707. Profile::Tic("DeviceComp",&this->comm,false,20);
  2708. #ifdef __INTEL_OFFLOAD
  2709. int lock_idx=-1;
  2710. int wait_lock_idx=-1;
  2711. if(device) wait_lock_idx=MIC_Lock::curr_lock();
  2712. if(device) lock_idx=MIC_Lock::get_lock();
  2713. if(device) ptr_single_layer_kernel=setup_data.kernel->dev_ker_poten;
  2714. if(device) ptr_double_layer_kernel=setup_data.kernel->dev_dbl_layer_poten;
  2715. #pragma offload if(device) target(mic:0) signal(&MIC_Lock::lock_vec[device?lock_idx:0])
  2716. #endif
  2717. { // Offloaded computation.
  2718. // Set interac_data.
  2719. //size_t data_size;
  2720. //size_t ker_dim0;
  2721. size_t ker_dim1;
  2722. size_t dof, n_out;
  2723. Vector<size_t> trg_interac_cnt;
  2724. Vector<size_t> trg_coord;
  2725. Vector<size_t> trg_value;
  2726. Vector<size_t> trg_cnt;
  2727. Vector<Real_t> scaling;
  2728. Matrix<Real_t> M;
  2729. Vector< Vector<size_t> > src_cnt;
  2730. Vector< Vector<size_t> > src_coord;
  2731. Vector< Vector<size_t> > src_value;
  2732. Vector< Vector<Real_t> > shift_coord;
  2733. { // Set interac_data.
  2734. char* data_ptr=&interac_data[0][0];
  2735. std::cout << "EvalListPts, converting device ptr to char* " << '\n';
  2736. /*data_size=((size_t*)data_ptr)[0];*/ data_ptr+=sizeof(size_t);
  2737. /*ker_dim0=((size_t*)data_ptr)[0];*/ data_ptr+=sizeof(size_t);
  2738. ker_dim1=((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2739. dof =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2740. std::cout << "EvalListPts, device ptr evaluation " << '\n';
  2741. trg_interac_cnt.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2742. data_ptr+=sizeof(size_t)+trg_interac_cnt.Dim()*sizeof(size_t);
  2743. n_out=trg_interac_cnt.Dim();
  2744. std::cout << "EvalListPts, 1.st ReInit " << '\n';
  2745. trg_coord.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2746. data_ptr+=sizeof(size_t)+trg_coord.Dim()*sizeof(size_t);
  2747. trg_value.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2748. data_ptr+=sizeof(size_t)+trg_value.Dim()*sizeof(size_t);
  2749. trg_cnt.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2750. data_ptr+=sizeof(size_t)+trg_cnt.Dim()*sizeof(size_t);
  2751. scaling.ReInit(((size_t*)data_ptr)[0],(Real_t*)(data_ptr+sizeof(size_t)),false);
  2752. data_ptr+=sizeof(size_t)+scaling.Dim()*sizeof(Real_t);
  2753. M.ReInit(((size_t*)data_ptr)[0],((size_t*)data_ptr)[1],(Real_t*)(data_ptr+2*sizeof(size_t)),false);
  2754. data_ptr+=sizeof(size_t)*2+M.Dim(0)*M.Dim(1)*sizeof(Real_t);
  2755. src_cnt.Resize(n_out);
  2756. src_coord.Resize(n_out);
  2757. src_value.Resize(n_out);
  2758. shift_coord.Resize(n_out);
  2759. for(size_t i=0;i<n_out;i++){
  2760. src_cnt[i].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2761. data_ptr+=sizeof(size_t)+src_cnt[i].Dim()*sizeof(size_t);
  2762. src_coord[i].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2763. data_ptr+=sizeof(size_t)+src_coord[i].Dim()*sizeof(size_t);
  2764. src_value[i].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2765. data_ptr+=sizeof(size_t)+src_value[i].Dim()*sizeof(size_t);
  2766. shift_coord[i].ReInit(((size_t*)data_ptr)[0],(Real_t*)(data_ptr+sizeof(size_t)),false);
  2767. data_ptr+=sizeof(size_t)+shift_coord[i].Dim()*sizeof(Real_t);
  2768. }
  2769. }
  2770. #ifdef __INTEL_OFFLOAD
  2771. if(device) MIC_Lock::wait_lock(wait_lock_idx);
  2772. #endif
  2773. std::cout << "EvalListPts, end reallocation." << '\n';
  2774. //Compute interaction from point sources.
  2775. { // interactions
  2776. typename Kernel<Real_t>::Ker_t single_layer_kernel=(typename Kernel<Real_t>::Ker_t)ptr_single_layer_kernel;
  2777. typename Kernel<Real_t>::Ker_t double_layer_kernel=(typename Kernel<Real_t>::Ker_t)ptr_double_layer_kernel;
  2778. int omp_p=omp_get_max_threads();
  2779. Vector<Real_t*> thread_buff(omp_p);
  2780. size_t thread_buff_size=buff.dim/sizeof(Real_t)/omp_p;
  2781. for(int i=0;i<omp_p;i++) thread_buff[i]=(Real_t*)&buff[i*thread_buff_size*sizeof(Real_t)];
  2782. #pragma omp parallel for
  2783. for(size_t i=0;i<n_out;i++)
  2784. if(trg_interac_cnt[i]>0 && trg_cnt[i]>0){
  2785. int thread_id=omp_get_thread_num();
  2786. Real_t* s_coord=thread_buff[thread_id];
  2787. Real_t* t_value=output_data[0]+trg_value[i];
  2788. if(M.Dim(0)>0 && M.Dim(1)>0){
  2789. s_coord+=dof*M.Dim(0);
  2790. t_value=thread_buff[thread_id];
  2791. for(size_t j=0;j<dof*M.Dim(0);j++) t_value[j]=0;
  2792. }
  2793. size_t interac_cnt=0;
  2794. for(size_t j=0;j<trg_interac_cnt[i];j++){
  2795. if(ptr_single_layer_kernel!=(size_t)NULL){// Single layer kernel
  2796. Real_t* src_coord_=coord_data[0]+src_coord[i][2*j+0];
  2797. assert(thread_buff_size>=dof*M.Dim(0)+src_cnt[i][2*j+0]*COORD_DIM);
  2798. for(size_t k1=0;k1<src_cnt[i][2*j+0];k1++){ // Compute shifted source coordinates.
  2799. for(size_t k0=0;k0<COORD_DIM;k0++){
  2800. s_coord[k1*COORD_DIM+k0]=src_coord_[k1*COORD_DIM+k0]+shift_coord[i][j*COORD_DIM+k0];
  2801. }
  2802. }
  2803. single_layer_kernel( s_coord , src_cnt[i][2*j+0], input_data[0]+src_value[i][2*j+0], dof,
  2804. coord_data[0]+trg_coord[i], trg_cnt[i] , t_value);
  2805. interac_cnt+=src_cnt[i][2*j+0]*trg_cnt[i];
  2806. }
  2807. if(ptr_double_layer_kernel!=(size_t)NULL){// Double layer kernel
  2808. Real_t* src_coord_=coord_data[0]+src_coord[i][2*j+1];
  2809. assert(thread_buff_size>=dof*M.Dim(0)+src_cnt[i][2*j+1]*COORD_DIM);
  2810. for(size_t k1=0;k1<src_cnt[i][2*j+1];k1++){ // Compute shifted source coordinates.
  2811. for(size_t k0=0;k0<COORD_DIM;k0++){
  2812. s_coord[k1*COORD_DIM+k0]=src_coord_[k1*COORD_DIM+k0]+shift_coord[i][j*COORD_DIM+k0];
  2813. }
  2814. }
  2815. double_layer_kernel( s_coord , src_cnt[i][2*j+1], input_data[0]+src_value[i][2*j+1], dof,
  2816. coord_data[0]+trg_coord[i], trg_cnt[i] , t_value);
  2817. interac_cnt+=src_cnt[i][2*j+1]*trg_cnt[i];
  2818. }
  2819. }
  2820. if(M.Dim(0)>0 && M.Dim(1)>0 && interac_cnt>0){
  2821. assert(trg_cnt[i]*ker_dim1==M.Dim(0)); UNUSED(ker_dim1);
  2822. for(size_t j=0;j<dof*M.Dim(0);j++) t_value[j]*=scaling[i];
  2823. Matrix<Real_t> in_vec(dof, M.Dim(0), t_value , false);
  2824. Matrix<Real_t> out_vec(dof, M.Dim(1), output_data[0]+trg_value[i], false);
  2825. Matrix<Real_t>::DGEMM(out_vec, in_vec, M, 1.0);
  2826. }
  2827. }
  2828. }
  2829. #ifdef __INTEL_OFFLOAD
  2830. if(device) MIC_Lock::release_lock(lock_idx);
  2831. #endif
  2832. }
  2833. #ifndef __MIC_ASYNCH__
  2834. #ifdef __INTEL_OFFLOAD
  2835. #pragma offload if(device) target(mic:0)
  2836. {if(device) MIC_Lock::wait_lock(lock_idx);}
  2837. #endif
  2838. #endif
  2839. Profile::Toc();
  2840. }
  2841. template <class FMMNode>
  2842. void FMM_Pts<FMMNode>::X_ListSetup(SetupData<Real_t>& setup_data, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2843. { // Set setup_data
  2844. setup_data.level=level;
  2845. setup_data.kernel=&aux_kernel;
  2846. setup_data.interac_type.resize(1);
  2847. setup_data.interac_type[0]=X_Type;
  2848. setup_data. input_data=&buff[4];
  2849. setup_data.output_data=&buff[1];
  2850. setup_data. coord_data=&buff[6];
  2851. Vector<FMMNode_t*>& nodes_in =n_list[4];
  2852. Vector<FMMNode_t*>& nodes_out=n_list[1];
  2853. setup_data.nodes_in .clear();
  2854. setup_data.nodes_out.clear();
  2855. for(size_t i=0;i<nodes_in .Dim();i++) if(nodes_in [i]->Depth()==level-1 || level==-1) setup_data.nodes_in .push_back(nodes_in [i]);
  2856. for(size_t i=0;i<nodes_out.Dim();i++) if(nodes_out[i]->Depth()==level || level==-1) setup_data.nodes_out.push_back(nodes_out[i]);
  2857. }
  2858. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2859. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2860. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2861. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2862. for(size_t i=0;i<nodes_in .size();i++){
  2863. input_vector .push_back(&((FMMNode*)nodes_in [i])->src_coord);
  2864. input_vector .push_back(&((FMMNode*)nodes_in [i])->src_value);
  2865. input_vector .push_back(&((FMMNode*)nodes_in [i])->surf_coord);
  2866. input_vector .push_back(&((FMMNode*)nodes_in [i])->surf_value);
  2867. }
  2868. for(size_t i=0;i<nodes_out.size();i++){
  2869. output_vector.push_back(&dnwd_check_surf[((FMMNode*)nodes_out[i])->Depth()]);
  2870. output_vector.push_back(&((FMMData*)((FMMNode*)nodes_out[i])->FMMData())->dnward_equiv);
  2871. }
  2872. //Downward check to downward equivalent matrix.
  2873. Matrix<Real_t>& M_dc2de = this->mat->Mat(level, DC2DE_Type, 0);
  2874. this->SetupInteracPts(setup_data, false, true, &M_dc2de,device);
  2875. { // Resize device buffer
  2876. size_t n=setup_data.output_data->Dim(0)*setup_data.output_data->Dim(1)*sizeof(Real_t);
  2877. if(this->dev_buffer.Dim()<n) this->dev_buffer.Resize(n);
  2878. }
  2879. }
  2880. template <class FMMNode>
  2881. void FMM_Pts<FMMNode>::X_List (SetupData<Real_t>& setup_data, bool device){
  2882. //Add X_List contribution.
  2883. this->EvalListPts(setup_data, device);
  2884. }
  2885. template <class FMMNode>
  2886. void FMM_Pts<FMMNode>::W_ListSetup(SetupData<Real_t>& setup_data, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2887. { // Set setup_data
  2888. setup_data.level=level;
  2889. setup_data.kernel=&kernel;
  2890. setup_data.interac_type.resize(1);
  2891. setup_data.interac_type[0]=W_Type;
  2892. setup_data. input_data=&buff[0];
  2893. setup_data.output_data=&buff[5];
  2894. setup_data. coord_data=&buff[6];
  2895. Vector<FMMNode_t*>& nodes_in =n_list[0];
  2896. Vector<FMMNode_t*>& nodes_out=n_list[5];
  2897. setup_data.nodes_in .clear();
  2898. setup_data.nodes_out.clear();
  2899. for(size_t i=0;i<nodes_in .Dim();i++) if(nodes_in [i]->Depth()==level+1 || level==-1) setup_data.nodes_in .push_back(nodes_in [i]);
  2900. for(size_t i=0;i<nodes_out.Dim();i++) if(nodes_out[i]->Depth()==level || level==-1) setup_data.nodes_out.push_back(nodes_out[i]);
  2901. }
  2902. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2903. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2904. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2905. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2906. for(size_t i=0;i<nodes_in .size();i++){
  2907. input_vector .push_back(&upwd_equiv_surf[((FMMNode*)nodes_in [i])->Depth()]);
  2908. input_vector .push_back(&((FMMData*)((FMMNode*)nodes_in [i])->FMMData())->upward_equiv);
  2909. input_vector .push_back(NULL);
  2910. input_vector .push_back(NULL);
  2911. }
  2912. for(size_t i=0;i<nodes_out.size();i++){
  2913. output_vector.push_back(&((FMMNode*)nodes_out[i])->trg_coord);
  2914. output_vector.push_back(&((FMMNode*)nodes_out[i])->trg_value);
  2915. }
  2916. this->SetupInteracPts(setup_data, true, false, NULL, device);
  2917. { // Resize device buffer
  2918. size_t n=setup_data.output_data->Dim(0)*setup_data.output_data->Dim(1)*sizeof(Real_t);
  2919. if(this->dev_buffer.Dim()<n) this->dev_buffer.Resize(n);
  2920. }
  2921. }
  2922. template <class FMMNode>
  2923. void FMM_Pts<FMMNode>::W_List (SetupData<Real_t>& setup_data, bool device){
  2924. //Add W_List contribution.
  2925. this->EvalListPts(setup_data, device);
  2926. }
  2927. template <class FMMNode>
  2928. void FMM_Pts<FMMNode>::U_ListSetup(SetupData<Real_t>& setup_data, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2929. { // Set setup_data
  2930. setup_data.level=level;
  2931. setup_data.kernel=&kernel;
  2932. setup_data.interac_type.resize(3);
  2933. setup_data.interac_type[0]=U0_Type;
  2934. setup_data.interac_type[1]=U1_Type;
  2935. setup_data.interac_type[2]=U2_Type;
  2936. setup_data. input_data=&buff[4];
  2937. setup_data.output_data=&buff[5];
  2938. setup_data. coord_data=&buff[6];
  2939. Vector<FMMNode_t*>& nodes_in =n_list[4];
  2940. Vector<FMMNode_t*>& nodes_out=n_list[5];
  2941. setup_data.nodes_in .clear();
  2942. setup_data.nodes_out.clear();
  2943. for(size_t i=0;i<nodes_in .Dim();i++) if((level-1<=nodes_in [i]->Depth() && nodes_in [i]->Depth()<=level+1) || level==-1) setup_data.nodes_in .push_back(nodes_in [i]);
  2944. for(size_t i=0;i<nodes_out.Dim();i++) if(( nodes_out[i]->Depth()==level ) || level==-1) setup_data.nodes_out.push_back(nodes_out[i]);
  2945. }
  2946. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2947. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2948. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2949. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2950. for(size_t i=0;i<nodes_in .size();i++){
  2951. input_vector .push_back(&((FMMNode*)nodes_in [i])->src_coord);
  2952. input_vector .push_back(&((FMMNode*)nodes_in [i])->src_value);
  2953. input_vector .push_back(&((FMMNode*)nodes_in [i])->surf_coord);
  2954. input_vector .push_back(&((FMMNode*)nodes_in [i])->surf_value);
  2955. }
  2956. for(size_t i=0;i<nodes_out.size();i++){
  2957. output_vector.push_back(&((FMMNode*)nodes_out[i])->trg_coord);
  2958. output_vector.push_back(&((FMMNode*)nodes_out[i])->trg_value);
  2959. }
  2960. this->SetupInteracPts(setup_data, false, false, NULL, device);
  2961. { // Resize device buffer
  2962. size_t n=setup_data.output_data->Dim(0)*setup_data.output_data->Dim(1)*sizeof(Real_t);
  2963. if(this->dev_buffer.Dim()<n) this->dev_buffer.Resize(n);
  2964. }
  2965. }
  2966. template <class FMMNode>
  2967. void FMM_Pts<FMMNode>::U_List (SetupData<Real_t>& setup_data, bool device){
  2968. //Add U_List contribution.
  2969. this->EvalListPts(setup_data, device);
  2970. }
  2971. template <class FMMNode>
  2972. void FMM_Pts<FMMNode>::Down2TargetSetup(SetupData<Real_t>& setup_data, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2973. { // Set setup_data
  2974. setup_data.level=level;
  2975. setup_data.kernel=&kernel;
  2976. setup_data.interac_type.resize(1);
  2977. setup_data.interac_type[0]=D2T_Type;
  2978. setup_data. input_data=&buff[1];
  2979. setup_data.output_data=&buff[5];
  2980. setup_data. coord_data=&buff[6];
  2981. Vector<FMMNode_t*>& nodes_in =n_list[1];
  2982. Vector<FMMNode_t*>& nodes_out=n_list[5];
  2983. setup_data.nodes_in .clear();
  2984. setup_data.nodes_out.clear();
  2985. for(size_t i=0;i<nodes_in .Dim();i++) if(nodes_in [i]->Depth()==level || level==-1) setup_data.nodes_in .push_back(nodes_in [i]);
  2986. for(size_t i=0;i<nodes_out.Dim();i++) if(nodes_out[i]->Depth()==level || level==-1) setup_data.nodes_out.push_back(nodes_out[i]);
  2987. }
  2988. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2989. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2990. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2991. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2992. for(size_t i=0;i<nodes_in .size();i++){
  2993. input_vector .push_back(&dnwd_equiv_surf[((FMMNode*)nodes_in [i])->Depth()]);
  2994. input_vector .push_back(&((FMMData*)((FMMNode*)nodes_in [i])->FMMData())->dnward_equiv);
  2995. input_vector .push_back(NULL);
  2996. input_vector .push_back(NULL);
  2997. }
  2998. for(size_t i=0;i<nodes_out.size();i++){
  2999. output_vector.push_back(&((FMMNode*)nodes_out[i])->trg_coord);
  3000. output_vector.push_back(&((FMMNode*)nodes_out[i])->trg_value);
  3001. }
  3002. this->SetupInteracPts(setup_data, true, false, NULL, device);
  3003. { // Resize device buffer
  3004. size_t n=setup_data.output_data->Dim(0)*setup_data.output_data->Dim(1)*sizeof(Real_t);
  3005. if(this->dev_buffer.Dim()<n) this->dev_buffer.Resize(n);
  3006. }
  3007. }
  3008. template <class FMMNode>
  3009. void FMM_Pts<FMMNode>::Down2Target(SetupData<Real_t>& setup_data, bool device){
  3010. //Add Down2Target contribution.
  3011. this->EvalListPts(setup_data, device);
  3012. }
  3013. template <class FMMNode>
  3014. void FMM_Pts<FMMNode>::PostProcessing(std::vector<FMMNode_t*>& nodes){
  3015. }
  3016. template <class FMMNode>
  3017. void FMM_Pts<FMMNode>::CopyOutput(FMMNode** nodes, size_t n){
  3018. // for(size_t i=0;i<n;i++){
  3019. // FMMData* fmm_data=((FMMData*)nodes[i]->FMMData());
  3020. // }
  3021. }
  3022. }//end namespace