fmm_pts.txx 134 KB

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