fmm_pts.txx 203 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374
  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]={(Real_t)(c[0]-r*(RAD1-1.0)),(Real_t)(c[1]-r*(RAD1-1.0)),(Real_t)(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]={(Real_t)(c[0]-r*(RAD0-1.0)),(Real_t)(c[1]-r*(RAD0-1.0)),(Real_t)(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]={(Real_t)(c[0]-r*(RAD0-1.0)),(Real_t)(c[1]-r*(RAD0-1.0)),(Real_t)(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]={(Real_t)(c[0]-r*(RAD1-1.0)),(Real_t)(c[1]-r*(RAD1-1.0)),(Real_t)(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_){
  199. Profile::Tic("InitFMM_Pts",&comm_,true);{
  200. int rank;
  201. MPI_Comm_rank(comm_,&rank);
  202. bool verbose=false;
  203. #ifndef NDEBUG
  204. #ifdef __VERBOSE__
  205. if(!rank) verbose=true;
  206. #endif
  207. #endif
  208. if(kernel_) kernel_->Initialize(verbose);
  209. multipole_order=mult_order;
  210. comm=comm_;
  211. kernel=kernel_;
  212. assert(kernel!=NULL);
  213. bool save_precomp=false;
  214. mat=new PrecompMat<Real_t>(ScaleInvar());
  215. if(this->mat_fname.size()==0){// && !this->ScaleInvar()){
  216. std::stringstream st;
  217. st<<PVFMM_PRECOMP_DATA_PATH;
  218. if(!st.str().size()){ // look in PVFMM_DIR
  219. char* pvfmm_dir = getenv ("PVFMM_DIR");
  220. if(pvfmm_dir) st<<pvfmm_dir;
  221. }
  222. #ifndef STAT_MACROS_BROKEN
  223. if(st.str().size()){ // check if the path is a directory
  224. struct stat stat_buff;
  225. if(stat(st.str().c_str(), &stat_buff) || !S_ISDIR(stat_buff.st_mode)){
  226. std::cout<<"error: path not found: "<<st.str()<<'\n';
  227. exit(0);
  228. }
  229. }
  230. #endif
  231. if(st.str().size()) st<<'/';
  232. st<<"Precomp_"<<kernel->ker_name.c_str()<<"_m"<<mult_order;
  233. if(sizeof(Real_t)==8) st<<"";
  234. else if(sizeof(Real_t)==4) st<<"_f";
  235. else st<<"_t"<<sizeof(Real_t);
  236. st<<".data";
  237. this->mat_fname=st.str();
  238. save_precomp=true;
  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(UC2UE0_Type);
  244. this->PrecompAll(UC2UE1_Type);
  245. Profile::Toc();
  246. Profile::Tic("PrecompDC2DE",&comm,false,4);
  247. this->PrecompAll(DC2DE0_Type);
  248. this->PrecompAll(DC2DE1_Type);
  249. Profile::Toc();
  250. Profile::Tic("PrecompBC",&comm,false,4);
  251. { /*
  252. int type=BC_Type;
  253. for(int l=0;l<MAX_DEPTH;l++)
  254. for(size_t indx=0;indx<this->interac_list.ListCount((Mat_Type)type);indx++){
  255. Matrix<Real_t>& M=this->mat->Mat(l, (Mat_Type)type, indx);
  256. M.Resize(0,0);
  257. } // */
  258. }
  259. this->PrecompAll(BC_Type,0);
  260. Profile::Toc();
  261. Profile::Tic("PrecompU2U",&comm,false,4);
  262. this->PrecompAll(U2U_Type);
  263. Profile::Toc();
  264. Profile::Tic("PrecompD2D",&comm,false,4);
  265. this->PrecompAll(D2D_Type);
  266. Profile::Toc();
  267. if(save_precomp){
  268. Profile::Tic("Save2File",&this->comm,false,4);
  269. if(!rank){
  270. FILE* f=fopen(this->mat_fname.c_str(),"r");
  271. if(f==NULL) { //File does not exists.
  272. this->mat->Save2File(this->mat_fname.c_str());
  273. }else fclose(f);
  274. }
  275. Profile::Toc();
  276. }
  277. Profile::Tic("PrecompV",&comm,false,4);
  278. this->PrecompAll(V_Type);
  279. Profile::Toc();
  280. Profile::Tic("PrecompV1",&comm,false,4);
  281. this->PrecompAll(V1_Type);
  282. Profile::Toc();
  283. }Profile::Toc();
  284. }
  285. template <class Real_t>
  286. Permutation<Real_t> equiv_surf_perm(size_t m, size_t p_indx, const Permutation<Real_t>& ker_perm, const Vector<Real_t>* scal_exp=NULL){
  287. Real_t eps=1e-10;
  288. int dof=ker_perm.Dim();
  289. Real_t c[3]={-0.5,-0.5,-0.5};
  290. std::vector<Real_t> trg_coord=d_check_surf(m,c,0);
  291. int n_trg=trg_coord.size()/3;
  292. Permutation<Real_t> P=Permutation<Real_t>(n_trg*dof);
  293. if(p_indx==ReflecX || p_indx==ReflecY || p_indx==ReflecZ){ // Set P.perm
  294. for(int i=0;i<n_trg;i++)
  295. for(int j=0;j<n_trg;j++){
  296. if(fabs(trg_coord[i*3+0]-trg_coord[j*3+0]*(p_indx==ReflecX?-1.0:1.0))<eps)
  297. if(fabs(trg_coord[i*3+1]-trg_coord[j*3+1]*(p_indx==ReflecY?-1.0:1.0))<eps)
  298. if(fabs(trg_coord[i*3+2]-trg_coord[j*3+2]*(p_indx==ReflecZ?-1.0:1.0))<eps){
  299. for(int k=0;k<dof;k++){
  300. P.perm[j*dof+k]=i*dof+ker_perm.perm[k];
  301. }
  302. }
  303. }
  304. }else if(p_indx==SwapXY || p_indx==SwapXZ){
  305. for(int i=0;i<n_trg;i++)
  306. for(int j=0;j<n_trg;j++){
  307. if(fabs(trg_coord[i*3+0]-trg_coord[j*3+(p_indx==SwapXY?1:2)])<eps)
  308. if(fabs(trg_coord[i*3+1]-trg_coord[j*3+(p_indx==SwapXY?0:1)])<eps)
  309. if(fabs(trg_coord[i*3+2]-trg_coord[j*3+(p_indx==SwapXY?2:0)])<eps){
  310. for(int k=0;k<dof;k++){
  311. P.perm[j*dof+k]=i*dof+ker_perm.perm[k];
  312. }
  313. }
  314. }
  315. }else{
  316. for(int j=0;j<n_trg;j++){
  317. for(int k=0;k<dof;k++){
  318. P.perm[j*dof+k]=j*dof+ker_perm.perm[k];
  319. }
  320. }
  321. }
  322. if(scal_exp && p_indx==Scaling){ // Set level-by-level scaling
  323. assert(dof==scal_exp->Dim());
  324. Vector<Real_t> scal(scal_exp->Dim());
  325. for(size_t i=0;i<scal.Dim();i++){
  326. scal[i]=pow(2.0,(*scal_exp)[i]);
  327. }
  328. for(int j=0;j<n_trg;j++){
  329. for(int i=0;i<dof;i++){
  330. P.scal[j*dof+i]*=scal[i];
  331. }
  332. }
  333. }
  334. { // Set P.scal
  335. for(int j=0;j<n_trg;j++){
  336. for(int i=0;i<dof;i++){
  337. P.scal[j*dof+i]*=ker_perm.scal[i];
  338. }
  339. }
  340. }
  341. return P;
  342. }
  343. template <class FMMNode>
  344. Permutation<typename FMMNode::Real_t>& FMM_Pts<FMMNode>::PrecompPerm(Mat_Type type, Perm_Type perm_indx){
  345. //Check if the matrix already exists.
  346. Permutation<Real_t>& P_ = mat->Perm((Mat_Type)type, perm_indx);
  347. if(P_.Dim()!=0) return P_;
  348. size_t m=this->MultipoleOrder();
  349. size_t p_indx=perm_indx % C_Perm;
  350. //Compute the matrix.
  351. Permutation<Real_t> P;
  352. switch (type){
  353. case U2U_Type:
  354. {
  355. Vector<Real_t> scal_exp;
  356. Permutation<Real_t> ker_perm;
  357. if(perm_indx<C_Perm){ // Source permutation
  358. ker_perm=kernel->k_m2m->perm_vec[0 +p_indx];
  359. scal_exp=kernel->k_m2m->src_scal;
  360. }else{ // Target permutation
  361. ker_perm=kernel->k_m2m->perm_vec[0 +p_indx];
  362. scal_exp=kernel->k_m2m->src_scal;
  363. for(size_t i=0;i<scal_exp.Dim();i++) scal_exp[i]=-scal_exp[i];
  364. }
  365. P=equiv_surf_perm(m, p_indx, ker_perm, (this->ScaleInvar()?&scal_exp:NULL));
  366. break;
  367. }
  368. case D2D_Type:
  369. {
  370. Vector<Real_t> scal_exp;
  371. Permutation<Real_t> ker_perm;
  372. if(perm_indx<C_Perm){ // Source permutation
  373. ker_perm=kernel->k_l2l->perm_vec[C_Perm+p_indx];
  374. scal_exp=kernel->k_l2l->trg_scal;
  375. for(size_t i=0;i<scal_exp.Dim();i++) scal_exp[i]=-scal_exp[i];
  376. }else{ // Target permutation
  377. ker_perm=kernel->k_l2l->perm_vec[C_Perm+p_indx];
  378. scal_exp=kernel->k_l2l->trg_scal;
  379. }
  380. P=equiv_surf_perm(m, p_indx, ker_perm, (this->ScaleInvar()?&scal_exp:NULL));
  381. break;
  382. }
  383. default:
  384. break;
  385. }
  386. //Save the matrix for future use.
  387. #pragma omp critical (PRECOMP_MATRIX_PTS)
  388. {
  389. if(P_.Dim()==0) P_=P;
  390. }
  391. return P_;
  392. }
  393. template <class FMMNode>
  394. Matrix<typename FMMNode::Real_t>& FMM_Pts<FMMNode>::Precomp(int level, Mat_Type type, size_t mat_indx){
  395. if(this->ScaleInvar()) level=0;
  396. //Check if the matrix already exists.
  397. Matrix<Real_t>& M_ = this->mat->Mat(level, type, mat_indx);
  398. if(M_.Dim(0)!=0 && M_.Dim(1)!=0) return M_;
  399. else{ //Compute matrix from symmetry class (if possible).
  400. size_t class_indx = this->interac_list.InteracClass(type, mat_indx);
  401. if(class_indx!=mat_indx){
  402. Matrix<Real_t>& M0 = this->Precomp(level, type, class_indx);
  403. if(M0.Dim(0)==0 || M0.Dim(1)==0) return M_;
  404. for(size_t i=0;i<Perm_Count;i++) this->PrecompPerm(type, (Perm_Type) i);
  405. Permutation<Real_t>& Pr = this->interac_list.Perm_R(level, type, mat_indx);
  406. Permutation<Real_t>& Pc = this->interac_list.Perm_C(level, type, mat_indx);
  407. if(Pr.Dim()>0 && Pc.Dim()>0 && M0.Dim(0)>0 && M0.Dim(1)>0) return M_;
  408. }
  409. }
  410. //Compute the matrix.
  411. Matrix<Real_t> M;
  412. //int omp_p=omp_get_max_threads();
  413. switch (type){
  414. case UC2UE0_Type:
  415. {
  416. if(MultipoleOrder()==0) break;
  417. const int* ker_dim=kernel->k_m2m->ker_dim;
  418. // Coord of upward check surface
  419. Real_t c[3]={0,0,0};
  420. std::vector<Real_t> uc_coord=u_check_surf(MultipoleOrder(),c,level);
  421. size_t n_uc=uc_coord.size()/3;
  422. // Coord of upward equivalent surface
  423. std::vector<Real_t> ue_coord=u_equiv_surf(MultipoleOrder(),c,level);
  424. size_t n_ue=ue_coord.size()/3;
  425. // Evaluate potential at check surface due to equivalent surface.
  426. Matrix<Real_t> M_e2c(n_ue*ker_dim[0],n_uc*ker_dim[1]);
  427. kernel->k_m2m->BuildMatrix(&ue_coord[0], n_ue,
  428. &uc_coord[0], n_uc, &(M_e2c[0][0]));
  429. Matrix<Real_t> U,S,V;
  430. M_e2c.SVD(U,S,V);
  431. Real_t eps=1, max_S=0;
  432. while(eps*(Real_t)0.5+(Real_t)1.0>1.0) eps*=0.5;
  433. for(size_t i=0;i<std::min(S.Dim(0),S.Dim(1));i++){
  434. if(fabs(S[i][i])>max_S) max_S=fabs(S[i][i]);
  435. }
  436. for(size_t i=0;i<S.Dim(0);i++) S[i][i]=(S[i][i]>eps*max_S*4?1.0/S[i][i]:0.0);
  437. M=V.Transpose()*S;//*U.Transpose();
  438. break;
  439. }
  440. case UC2UE1_Type:
  441. {
  442. if(MultipoleOrder()==0) break;
  443. const int* ker_dim=kernel->k_m2m->ker_dim;
  444. // Coord of upward check surface
  445. Real_t c[3]={0,0,0};
  446. std::vector<Real_t> uc_coord=u_check_surf(MultipoleOrder(),c,level);
  447. size_t n_uc=uc_coord.size()/3;
  448. // Coord of upward equivalent surface
  449. std::vector<Real_t> ue_coord=u_equiv_surf(MultipoleOrder(),c,level);
  450. size_t n_ue=ue_coord.size()/3;
  451. // Evaluate potential at check surface due to equivalent surface.
  452. Matrix<Real_t> M_e2c(n_ue*ker_dim[0],n_uc*ker_dim[1]);
  453. kernel->k_m2m->BuildMatrix(&ue_coord[0], n_ue,
  454. &uc_coord[0], n_uc, &(M_e2c[0][0]));
  455. Matrix<Real_t> U,S,V;
  456. M_e2c.SVD(U,S,V);
  457. M=U.Transpose();
  458. break;
  459. }
  460. case DC2DE0_Type:
  461. {
  462. if(MultipoleOrder()==0) break;
  463. const int* ker_dim=kernel->k_l2l->ker_dim;
  464. // Coord of downward check surface
  465. Real_t c[3]={0,0,0};
  466. std::vector<Real_t> check_surf=d_check_surf(MultipoleOrder(),c,level);
  467. size_t n_ch=check_surf.size()/3;
  468. // Coord of downward equivalent surface
  469. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),c,level);
  470. size_t n_eq=equiv_surf.size()/3;
  471. // Evaluate potential at check surface due to equivalent surface.
  472. Matrix<Real_t> M_e2c(n_eq*ker_dim[0],n_ch*ker_dim[1]);
  473. kernel->k_l2l->BuildMatrix(&equiv_surf[0], n_eq,
  474. &check_surf[0], n_ch, &(M_e2c[0][0]));
  475. Matrix<Real_t> U,S,V;
  476. M_e2c.SVD(U,S,V);
  477. Real_t eps=1, max_S=0;
  478. while(eps*(Real_t)0.5+(Real_t)1.0>1.0) eps*=0.5;
  479. for(size_t i=0;i<std::min(S.Dim(0),S.Dim(1));i++){
  480. if(fabs(S[i][i])>max_S) max_S=fabs(S[i][i]);
  481. }
  482. for(size_t i=0;i<S.Dim(0);i++) S[i][i]=(S[i][i]>eps*max_S*4?1.0/S[i][i]:0.0);
  483. M=V.Transpose()*S;//*U.Transpose();
  484. break;
  485. }
  486. case DC2DE1_Type:
  487. {
  488. if(MultipoleOrder()==0) break;
  489. const int* ker_dim=kernel->k_l2l->ker_dim;
  490. // Coord of downward check surface
  491. Real_t c[3]={0,0,0};
  492. std::vector<Real_t> check_surf=d_check_surf(MultipoleOrder(),c,level);
  493. size_t n_ch=check_surf.size()/3;
  494. // Coord of downward equivalent surface
  495. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),c,level);
  496. size_t n_eq=equiv_surf.size()/3;
  497. // Evaluate potential at check surface due to equivalent surface.
  498. Matrix<Real_t> M_e2c(n_eq*ker_dim[0],n_ch*ker_dim[1]);
  499. kernel->k_l2l->BuildMatrix(&equiv_surf[0], n_eq,
  500. &check_surf[0], n_ch, &(M_e2c[0][0]));
  501. Matrix<Real_t> U,S,V;
  502. M_e2c.SVD(U,S,V);
  503. M=U.Transpose();
  504. break;
  505. }
  506. case U2U_Type:
  507. {
  508. if(MultipoleOrder()==0) break;
  509. const int* ker_dim=kernel->k_m2m->ker_dim;
  510. // Coord of upward check surface
  511. Real_t c[3]={0,0,0};
  512. std::vector<Real_t> check_surf=u_check_surf(MultipoleOrder(),c,level);
  513. size_t n_uc=check_surf.size()/3;
  514. // Coord of child's upward equivalent surface
  515. Real_t s=pow(0.5,(level+2));
  516. int* coord=interac_list.RelativeCoord(type,mat_indx);
  517. Real_t child_coord[3]={(coord[0]+1)*s,(coord[1]+1)*s,(coord[2]+1)*s};
  518. std::vector<Real_t> equiv_surf=u_equiv_surf(MultipoleOrder(),child_coord,level+1);
  519. size_t n_ue=equiv_surf.size()/3;
  520. // Evaluate potential at check surface due to equivalent surface.
  521. Matrix<Real_t> M_ce2c(n_ue*ker_dim[0],n_uc*ker_dim[1]);
  522. kernel->k_m2m->BuildMatrix(&equiv_surf[0], n_ue,
  523. &check_surf[0], n_uc, &(M_ce2c[0][0]));
  524. Matrix<Real_t>& M_c2e0 = Precomp(level, UC2UE0_Type, 0);
  525. Matrix<Real_t>& M_c2e1 = Precomp(level, UC2UE1_Type, 0);
  526. M=(M_ce2c*M_c2e0)*M_c2e1;
  527. break;
  528. }
  529. case D2D_Type:
  530. {
  531. if(MultipoleOrder()==0) break;
  532. const int* ker_dim=kernel->k_l2l->ker_dim;
  533. // Coord of downward check surface
  534. Real_t s=pow(0.5,level+1);
  535. int* coord=interac_list.RelativeCoord(type,mat_indx);
  536. Real_t c[3]={(coord[0]+1)*s,(coord[1]+1)*s,(coord[2]+1)*s};
  537. std::vector<Real_t> check_surf=d_check_surf(MultipoleOrder(),c,level);
  538. size_t n_dc=check_surf.size()/3;
  539. // Coord of parent's downward equivalent surface
  540. Real_t parent_coord[3]={0,0,0};
  541. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),parent_coord,level-1);
  542. size_t n_de=equiv_surf.size()/3;
  543. // Evaluate potential at check surface due to equivalent surface.
  544. Matrix<Real_t> M_pe2c(n_de*ker_dim[0],n_dc*ker_dim[1]);
  545. kernel->k_l2l->BuildMatrix(&equiv_surf[0], n_de,
  546. &check_surf[0], n_dc, &(M_pe2c[0][0]));
  547. Matrix<Real_t> M_c2e0=Precomp(level-1,DC2DE0_Type,0);
  548. Matrix<Real_t> M_c2e1=Precomp(level-1,DC2DE1_Type,0);
  549. if(ScaleInvar()){ // Scale M_c2e0 for level-1
  550. Permutation<Real_t> ker_perm=this->kernel->k_l2l->perm_vec[C_Perm+Scaling];
  551. Vector<Real_t> scal_exp=this->kernel->k_l2l->trg_scal;
  552. Permutation<Real_t> P=equiv_surf_perm(MultipoleOrder(), Scaling, ker_perm, &scal_exp);
  553. M_c2e0=P*M_c2e0;
  554. }
  555. if(ScaleInvar()){ // Scale M_c2e1 for level-1
  556. Permutation<Real_t> ker_perm=this->kernel->k_l2l->perm_vec[0 +Scaling];
  557. Vector<Real_t> scal_exp=this->kernel->k_l2l->src_scal;
  558. Permutation<Real_t> P=equiv_surf_perm(MultipoleOrder(), Scaling, ker_perm, &scal_exp);
  559. M_c2e1=M_c2e1*P;
  560. }
  561. M=M_c2e0*(M_c2e1*M_pe2c);
  562. break;
  563. }
  564. case D2T_Type:
  565. {
  566. if(MultipoleOrder()==0) break;
  567. const int* ker_dim=kernel->k_l2t->ker_dim;
  568. std::vector<Real_t>& rel_trg_coord=mat->RelativeTrgCoord();
  569. // Coord of target points
  570. Real_t r=pow(0.5,level);
  571. size_t n_trg=rel_trg_coord.size()/3;
  572. std::vector<Real_t> trg_coord(n_trg*3);
  573. for(size_t i=0;i<n_trg*COORD_DIM;i++) trg_coord[i]=rel_trg_coord[i]*r;
  574. // Coord of downward equivalent surface
  575. Real_t c[3]={0,0,0};
  576. std::vector<Real_t> equiv_surf=d_equiv_surf(MultipoleOrder(),c,level);
  577. size_t n_eq=equiv_surf.size()/3;
  578. // Evaluate potential at target points due to equivalent surface.
  579. {
  580. M .Resize(n_eq*ker_dim [0], n_trg*ker_dim [1]);
  581. kernel->k_l2t->BuildMatrix(&equiv_surf[0], n_eq, &trg_coord[0], n_trg, &(M [0][0]));
  582. }
  583. Matrix<Real_t>& M_c2e0=Precomp(level,DC2DE0_Type,0);
  584. Matrix<Real_t>& M_c2e1=Precomp(level,DC2DE1_Type,0);
  585. M=M_c2e0*(M_c2e1*M);
  586. break;
  587. }
  588. case V_Type:
  589. {
  590. if(MultipoleOrder()==0) break;
  591. const int* ker_dim=kernel->k_m2l->ker_dim;
  592. int n1=MultipoleOrder()*2;
  593. int n3 =n1*n1*n1;
  594. int n3_=n1*n1*(n1/2+1);
  595. //Compute the matrix.
  596. Real_t s=pow(0.5,level);
  597. int* coord2=interac_list.RelativeCoord(type,mat_indx);
  598. Real_t coord_diff[3]={coord2[0]*s,coord2[1]*s,coord2[2]*s};
  599. //Evaluate potential.
  600. std::vector<Real_t> r_trg(COORD_DIM,0.0);
  601. std::vector<Real_t> conv_poten(n3*ker_dim[0]*ker_dim[1]);
  602. std::vector<Real_t> conv_coord=conv_grid(MultipoleOrder(),coord_diff,level);
  603. kernel->k_m2l->BuildMatrix(&conv_coord[0],n3,&r_trg[0],1,&conv_poten[0]);
  604. //Rearrange data.
  605. Matrix<Real_t> M_conv(n3,ker_dim[0]*ker_dim[1],&conv_poten[0],false);
  606. M_conv=M_conv.Transpose();
  607. //Compute FFTW plan.
  608. int nnn[3]={n1,n1,n1};
  609. Real_t *fftw_in, *fftw_out;
  610. fftw_in = mem::aligned_new<Real_t>( n3 *ker_dim[0]*ker_dim[1]*sizeof(Real_t));
  611. fftw_out = mem::aligned_new<Real_t>(2*n3_*ker_dim[0]*ker_dim[1]*sizeof(Real_t));
  612. #pragma omp critical (FFTW_PLAN)
  613. {
  614. if (!vprecomp_fft_flag){
  615. vprecomp_fftplan = FFTW_t<Real_t>::fft_plan_many_dft_r2c(COORD_DIM, nnn, ker_dim[0]*ker_dim[1],
  616. (Real_t*)fftw_in, NULL, 1, n3, (typename FFTW_t<Real_t>::cplx*) fftw_out, NULL, 1, n3_);
  617. vprecomp_fft_flag=true;
  618. }
  619. }
  620. //Compute FFT.
  621. mem::memcopy(fftw_in, &conv_poten[0], n3*ker_dim[0]*ker_dim[1]*sizeof(Real_t));
  622. FFTW_t<Real_t>::fft_execute_dft_r2c(vprecomp_fftplan, (Real_t*)fftw_in, (typename FFTW_t<Real_t>::cplx*)(fftw_out));
  623. Matrix<Real_t> M_(2*n3_*ker_dim[0]*ker_dim[1],1,(Real_t*)fftw_out,false);
  624. M=M_;
  625. //Free memory.
  626. mem::aligned_delete<Real_t>(fftw_in);
  627. mem::aligned_delete<Real_t>(fftw_out);
  628. break;
  629. }
  630. case V1_Type:
  631. {
  632. if(MultipoleOrder()==0) break;
  633. const int* ker_dim=kernel->k_m2l->ker_dim;
  634. size_t mat_cnt =interac_list.ListCount( V_Type);
  635. for(size_t k=0;k<mat_cnt;k++) Precomp(level, V_Type, k);
  636. const size_t chld_cnt=1UL<<COORD_DIM;
  637. size_t n1=MultipoleOrder()*2;
  638. size_t M_dim=n1*n1*(n1/2+1);
  639. size_t n3=n1*n1*n1;
  640. Vector<Real_t> zero_vec(M_dim*ker_dim[0]*ker_dim[1]*2);
  641. zero_vec.SetZero();
  642. Vector<Real_t*> M_ptr(chld_cnt*chld_cnt);
  643. for(size_t i=0;i<chld_cnt*chld_cnt;i++) M_ptr[i]=&zero_vec[0];
  644. int* rel_coord_=interac_list.RelativeCoord(V1_Type, mat_indx);
  645. for(int j1=0;j1<chld_cnt;j1++)
  646. for(int j2=0;j2<chld_cnt;j2++){
  647. int rel_coord[3]={rel_coord_[0]*2-(j1/1)%2+(j2/1)%2,
  648. rel_coord_[1]*2-(j1/2)%2+(j2/2)%2,
  649. rel_coord_[2]*2-(j1/4)%2+(j2/4)%2};
  650. for(size_t k=0;k<mat_cnt;k++){
  651. int* ref_coord=interac_list.RelativeCoord(V_Type, k);
  652. if(ref_coord[0]==rel_coord[0] &&
  653. ref_coord[1]==rel_coord[1] &&
  654. ref_coord[2]==rel_coord[2]){
  655. Matrix<Real_t>& M = this->mat->Mat(level, V_Type, k);
  656. M_ptr[j2*chld_cnt+j1]=&M[0][0];
  657. break;
  658. }
  659. }
  660. }
  661. // Build matrix ker_dim0 x ker_dim1 x M_dim x 8 x 8
  662. M.Resize(ker_dim[0]*ker_dim[1]*M_dim, 2*chld_cnt*chld_cnt);
  663. for(int j=0;j<ker_dim[0]*ker_dim[1]*M_dim;j++){
  664. for(size_t k=0;k<chld_cnt*chld_cnt;k++){
  665. M[j][k*2+0]=M_ptr[k][j*2+0]/n3;
  666. M[j][k*2+1]=M_ptr[k][j*2+1]/n3;
  667. }
  668. }
  669. break;
  670. }
  671. case W_Type:
  672. {
  673. if(MultipoleOrder()==0) break;
  674. const int* ker_dim=kernel->k_m2t->ker_dim;
  675. std::vector<Real_t>& rel_trg_coord=mat->RelativeTrgCoord();
  676. // Coord of target points
  677. Real_t s=pow(0.5,level);
  678. size_t n_trg=rel_trg_coord.size()/3;
  679. std::vector<Real_t> trg_coord(n_trg*3);
  680. for(size_t j=0;j<n_trg*COORD_DIM;j++) trg_coord[j]=rel_trg_coord[j]*s;
  681. // Coord of downward equivalent surface
  682. int* coord2=interac_list.RelativeCoord(type,mat_indx);
  683. Real_t c[3]={(Real_t)((coord2[0]+1)*s*0.25),(Real_t)((coord2[1]+1)*s*0.25),(Real_t)((coord2[2]+1)*s*0.25)};
  684. std::vector<Real_t> equiv_surf=u_equiv_surf(MultipoleOrder(),c,level+1);
  685. size_t n_eq=equiv_surf.size()/3;
  686. // Evaluate potential at target points due to equivalent surface.
  687. {
  688. M .Resize(n_eq*ker_dim [0],n_trg*ker_dim [1]);
  689. kernel->k_m2t->BuildMatrix(&equiv_surf[0], n_eq, &trg_coord[0], n_trg, &(M [0][0]));
  690. }
  691. break;
  692. }
  693. case BC_Type:
  694. {
  695. if(!this->ScaleInvar() || MultipoleOrder()==0) break;
  696. if(kernel->k_m2l->ker_dim[0]!=kernel->k_m2m->ker_dim[0]) break;
  697. if(kernel->k_m2l->ker_dim[1]!=kernel->k_l2l->ker_dim[1]) break;
  698. const int* ker_dim=kernel->k_m2l->ker_dim;
  699. size_t mat_cnt_m2m=interac_list.ListCount(U2U_Type);
  700. size_t n_surf=(6*(MultipoleOrder()-1)*(MultipoleOrder()-1)+2); //Total number of points.
  701. if((M.Dim(0)!=n_surf*ker_dim[0] || M.Dim(1)!=n_surf*ker_dim[1]) && level==0){
  702. Matrix<Real_t> M_m2m[BC_LEVELS+1];
  703. Matrix<Real_t> M_m2l[BC_LEVELS+1];
  704. Matrix<Real_t> M_l2l[BC_LEVELS+1];
  705. Matrix<Real_t> M_equiv_zero_avg(n_surf*ker_dim[0],n_surf*ker_dim[0]);
  706. Matrix<Real_t> M_check_zero_avg(n_surf*ker_dim[1],n_surf*ker_dim[1]);
  707. { // Set average multipole charge to zero. (improves stability for large BC_LEVELS)
  708. M_equiv_zero_avg.SetZero();
  709. for(size_t i=0;i<n_surf*ker_dim[0];i++)
  710. M_equiv_zero_avg[i][i]+=1;
  711. for(size_t i=0;i<n_surf;i++)
  712. for(size_t j=0;j<n_surf;j++)
  713. for(size_t k=0;k<ker_dim[0];k++)
  714. M_equiv_zero_avg[i*ker_dim[0]+k][j*ker_dim[0]+k]-=1.0/n_surf;
  715. }
  716. { // Set average check potential to zero. (improves stability for large BC_LEVELS)
  717. M_check_zero_avg.SetZero();
  718. for(size_t i=0;i<n_surf*ker_dim[1];i++)
  719. M_check_zero_avg[i][i]+=1;
  720. for(size_t i=0;i<n_surf;i++)
  721. for(size_t j=0;j<n_surf;j++)
  722. for(size_t k=0;k<ker_dim[1];k++)
  723. M_check_zero_avg[i*ker_dim[1]+k][j*ker_dim[1]+k]-=1.0/n_surf;
  724. }
  725. for(int level=0; level>=-BC_LEVELS; level--){
  726. { // Compute M_l2l
  727. this->Precomp(level, D2D_Type, 0);
  728. Permutation<Real_t>& Pr = this->interac_list.Perm_R(level, D2D_Type, 0);
  729. Permutation<Real_t>& Pc = this->interac_list.Perm_C(level, D2D_Type, 0);
  730. M_l2l[-level] = M_check_zero_avg * Pr * this->Precomp(level, D2D_Type, this->interac_list.InteracClass(D2D_Type, 0)) * Pc * M_check_zero_avg;
  731. assert(M_l2l[-level].Dim(0)>0 && M_l2l[-level].Dim(1)>0);
  732. }
  733. // Compute M_m2m
  734. for(size_t mat_indx=0; mat_indx<mat_cnt_m2m; mat_indx++){
  735. this->Precomp(level, U2U_Type, mat_indx);
  736. Permutation<Real_t>& Pr = this->interac_list.Perm_R(level, U2U_Type, mat_indx);
  737. Permutation<Real_t>& Pc = this->interac_list.Perm_C(level, U2U_Type, mat_indx);
  738. Matrix<Real_t> M = Pr * this->Precomp(level, U2U_Type, this->interac_list.InteracClass(U2U_Type, mat_indx)) * Pc;
  739. assert(M.Dim(0)>0 && M.Dim(1)>0);
  740. if(mat_indx==0) M_m2m[-level] = M_equiv_zero_avg*M*M_equiv_zero_avg;
  741. else M_m2m[-level] += M_equiv_zero_avg*M*M_equiv_zero_avg;
  742. }
  743. // Compute M_m2l
  744. if(!ScaleInvar() || level==0){
  745. Real_t s=(1UL<<(-level));
  746. Real_t dc_coord[3]={0,0,0};
  747. std::vector<Real_t> trg_coord=d_check_surf(MultipoleOrder(), dc_coord, level);
  748. Matrix<Real_t> M_ue2dc(n_surf*ker_dim[0], n_surf*ker_dim[1]); M_ue2dc.SetZero();
  749. for(int x0=-2;x0<4;x0++)
  750. for(int x1=-2;x1<4;x1++)
  751. for(int x2=-2;x2<4;x2++)
  752. if(abs(x0)>1 || abs(x1)>1 || abs(x2)>1){
  753. Real_t ue_coord[3]={x0*s, x1*s, x2*s};
  754. std::vector<Real_t> src_coord=u_equiv_surf(MultipoleOrder(), ue_coord, level);
  755. Matrix<Real_t> M_tmp(n_surf*ker_dim[0], n_surf*ker_dim[1]);
  756. kernel->k_m2l->BuildMatrix(&src_coord[0], n_surf,
  757. &trg_coord[0], n_surf, &(M_tmp[0][0]));
  758. M_ue2dc+=M_tmp;
  759. }
  760. M_m2l[-level]=M_check_zero_avg*M_ue2dc * M_check_zero_avg;
  761. }else{
  762. M_m2l[-level]=M_equiv_zero_avg * M_m2l[-level-1] * M_check_zero_avg;
  763. if(ScaleInvar()){ // Scale M_m2l
  764. Permutation<Real_t> ker_perm=this->kernel->k_m2l->perm_vec[0 +Scaling];
  765. Vector<Real_t> scal_exp=this->kernel->k_m2l->src_scal;
  766. for(size_t i=0;i<scal_exp.Dim();i++) scal_exp[i]=-scal_exp[i];
  767. Permutation<Real_t> P=equiv_surf_perm(MultipoleOrder(), Scaling, ker_perm, &scal_exp);
  768. M_m2l[-level]=P*M_m2l[-level];
  769. }
  770. if(ScaleInvar()){ // Scale M_m2l
  771. Permutation<Real_t> ker_perm=this->kernel->k_m2l->perm_vec[C_Perm+Scaling];
  772. Vector<Real_t> scal_exp=this->kernel->k_m2l->trg_scal;
  773. for(size_t i=0;i<scal_exp.Dim();i++) scal_exp[i]=-scal_exp[i];
  774. Permutation<Real_t> P=equiv_surf_perm(MultipoleOrder(), Scaling, ker_perm, &scal_exp);
  775. M_m2l[-level]=M_m2l[-level]*P;
  776. }
  777. }
  778. }
  779. for(int level=-BC_LEVELS;level<=0;level++){
  780. if(level==-BC_LEVELS) M = M_m2l[-level];
  781. else M = M_equiv_zero_avg * (M_m2l[-level] + M_m2m[-level]*M*M_l2l[-level]) * M_equiv_zero_avg;
  782. }
  783. { // ax+by+cz+d correction.
  784. std::vector<Real_t> corner_pts;
  785. corner_pts.push_back(0); corner_pts.push_back(0); corner_pts.push_back(0);
  786. corner_pts.push_back(1); corner_pts.push_back(0); corner_pts.push_back(0);
  787. corner_pts.push_back(0); corner_pts.push_back(1); corner_pts.push_back(0);
  788. corner_pts.push_back(0); corner_pts.push_back(0); corner_pts.push_back(1);
  789. size_t n_corner=corner_pts.size()/COORD_DIM;
  790. // Coord of downward equivalent surface
  791. Real_t c[3]={0,0,0};
  792. std::vector<Real_t> up_equiv_surf=u_equiv_surf(MultipoleOrder(),c,0);
  793. std::vector<Real_t> dn_equiv_surf=d_equiv_surf(MultipoleOrder(),c,0);
  794. std::vector<Real_t> dn_check_surf=d_check_surf(MultipoleOrder(),c,0);
  795. Matrix<Real_t> M_err;
  796. { // Evaluate potential at corner due to upward and dnward equivalent surface.
  797. { // Error from local expansion.
  798. Matrix<Real_t> M_e2pt(n_surf*ker_dim[0],n_corner*ker_dim[1]);
  799. kernel->k_m2l->BuildMatrix(&dn_equiv_surf[0], n_surf,
  800. &corner_pts[0], n_corner, &(M_e2pt[0][0]));
  801. Matrix<Real_t>& M_dc2de0 = Precomp(0, DC2DE0_Type, 0);
  802. Matrix<Real_t>& M_dc2de1 = Precomp(0, DC2DE1_Type, 0);
  803. M_err=(M*M_dc2de0)*(M_dc2de1*M_e2pt);
  804. }
  805. for(size_t k=0;k<4;k++){ // Error from colleagues of root.
  806. for(int j0=-1;j0<=1;j0++)
  807. for(int j1=-1;j1<=1;j1++)
  808. for(int j2=-1;j2<=1;j2++){
  809. Real_t pt_coord[3]={corner_pts[k*COORD_DIM+0]-j0,
  810. corner_pts[k*COORD_DIM+1]-j1,
  811. corner_pts[k*COORD_DIM+2]-j2};
  812. 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){
  813. Matrix<Real_t> M_e2pt(n_surf*ker_dim[0],ker_dim[1]);
  814. kernel->k_m2l->BuildMatrix(&up_equiv_surf[0], n_surf,
  815. &pt_coord[0], 1, &(M_e2pt[0][0]));
  816. for(size_t i=0;i<M_e2pt.Dim(0);i++)
  817. for(size_t j=0;j<M_e2pt.Dim(1);j++)
  818. M_err[i][k*ker_dim[1]+j]+=M_e2pt[i][j];
  819. }
  820. }
  821. }
  822. }
  823. Matrix<Real_t> M_grad(M_err.Dim(0),n_surf*ker_dim[1]);
  824. for(size_t i=0;i<M_err.Dim(0);i++)
  825. for(size_t k=0;k<ker_dim[1];k++)
  826. for(size_t j=0;j<n_surf;j++){
  827. M_grad[i][j*ker_dim[1]+k]=(M_err[i][0*ker_dim[1]+k] )*1.0 +
  828. (M_err[i][1*ker_dim[1]+k]-M_err[i][0*ker_dim[1]+k])*dn_check_surf[j*COORD_DIM+0]+
  829. (M_err[i][2*ker_dim[1]+k]-M_err[i][0*ker_dim[1]+k])*dn_check_surf[j*COORD_DIM+1]+
  830. (M_err[i][3*ker_dim[1]+k]-M_err[i][0*ker_dim[1]+k])*dn_check_surf[j*COORD_DIM+2];
  831. }
  832. M-=M_grad;
  833. }
  834. if(!this->ScaleInvar()){ // Free memory
  835. Mat_Type type=D2D_Type;
  836. for(int l=-BC_LEVELS;l<0;l++)
  837. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  838. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  839. M.Resize(0,0);
  840. }
  841. type=U2U_Type;
  842. for(int l=-BC_LEVELS;l<0;l++)
  843. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  844. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  845. M.Resize(0,0);
  846. }
  847. type=DC2DE0_Type;
  848. for(int l=-BC_LEVELS;l<0;l++)
  849. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  850. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  851. M.Resize(0,0);
  852. }
  853. type=DC2DE1_Type;
  854. for(int l=-BC_LEVELS;l<0;l++)
  855. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  856. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  857. M.Resize(0,0);
  858. }
  859. type=UC2UE0_Type;
  860. for(int l=-BC_LEVELS;l<0;l++)
  861. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  862. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  863. M.Resize(0,0);
  864. }
  865. type=UC2UE1_Type;
  866. for(int l=-BC_LEVELS;l<0;l++)
  867. for(size_t indx=0;indx<this->interac_list.ListCount(type);indx++){
  868. Matrix<Real_t>& M=this->mat->Mat(l, type, indx);
  869. M.Resize(0,0);
  870. }
  871. }
  872. }
  873. break;
  874. }
  875. default:
  876. break;
  877. }
  878. //Save the matrix for future use.
  879. #pragma omp critical (PRECOMP_MATRIX_PTS)
  880. if(M_.Dim(0)==0 && M_.Dim(1)==0){
  881. M_=M;
  882. /*
  883. M_.Resize(M.Dim(0),M.Dim(1));
  884. int dof=ker_dim[0]*ker_dim[1];
  885. for(int j=0;j<dof;j++){
  886. size_t a=(M.Dim(0)*M.Dim(1)* j )/dof;
  887. size_t b=(M.Dim(0)*M.Dim(1)*(j+1))/dof;
  888. #pragma omp parallel for // NUMA
  889. for(int tid=0;tid<omp_p;tid++){
  890. size_t a_=a+((b-a)* tid )/omp_p;
  891. size_t b_=a+((b-a)*(tid+1))/omp_p;
  892. mem::memcopy(&M_[0][a_], &M[0][a_], (b_-a_)*sizeof(Real_t));
  893. }
  894. }
  895. */
  896. }
  897. return M_;
  898. }
  899. template <class FMMNode>
  900. void FMM_Pts<FMMNode>::PrecompAll(Mat_Type type, int level){
  901. if(level==-1){
  902. for(int l=0;l<MAX_DEPTH;l++){
  903. PrecompAll(type, l);
  904. }
  905. return;
  906. }
  907. //Compute basic permutations.
  908. for(size_t i=0;i<Perm_Count;i++)
  909. this->PrecompPerm(type, (Perm_Type) i);
  910. {
  911. //Allocate matrices.
  912. size_t mat_cnt=interac_list.ListCount((Mat_Type)type);
  913. mat->Mat(level, (Mat_Type)type, mat_cnt-1);
  914. { // Compute InteracClass matrices.
  915. std::vector<size_t> indx_lst;
  916. for(size_t i=0; i<mat_cnt; i++){
  917. if(interac_list.InteracClass((Mat_Type)type,i)==i)
  918. indx_lst.push_back(i);
  919. }
  920. //Compute Transformations.
  921. //#pragma omp parallel for //lets use fine grained parallelism
  922. for(size_t i=0; i<indx_lst.size(); i++){
  923. Precomp(level, (Mat_Type)type, indx_lst[i]);
  924. }
  925. }
  926. //#pragma omp parallel for //lets use fine grained parallelism
  927. for(size_t mat_indx=0;mat_indx<mat_cnt;mat_indx++){
  928. Matrix<Real_t>& M0=interac_list.ClassMat(level,(Mat_Type)type,mat_indx);
  929. Permutation<Real_t>& pr=interac_list.Perm_R(level, (Mat_Type)type, mat_indx);
  930. Permutation<Real_t>& pc=interac_list.Perm_C(level, (Mat_Type)type, mat_indx);
  931. if(pr.Dim()!=M0.Dim(0) || pc.Dim()!=M0.Dim(1)) Precomp(level, (Mat_Type)type, mat_indx);
  932. }
  933. }
  934. }
  935. template <class FMMNode>
  936. void FMM_Pts<FMMNode>::CollectNodeData(FMMTree_t* tree, std::vector<FMMNode*>& node, std::vector<Matrix<Real_t> >& buff_list, std::vector<Vector<FMMNode_t*> >& n_list, std::vector<std::vector<Vector<Real_t>* > > vec_list){
  937. if(buff_list.size()<7) buff_list.resize(7);
  938. if( n_list.size()<7) n_list.resize(7);
  939. if( vec_list.size()<7) vec_list.resize(7);
  940. int omp_p=omp_get_max_threads();
  941. if(node.size()==0) return;
  942. {// 0. upward_equiv
  943. int indx=0;
  944. size_t vec_sz;
  945. { // Set vec_sz
  946. Matrix<Real_t>& M_uc2ue = this->interac_list.ClassMat(0, UC2UE1_Type, 0);
  947. vec_sz=M_uc2ue.Dim(1);
  948. }
  949. std::vector< FMMNode* > node_lst;
  950. {// Construct node_lst
  951. node_lst.clear();
  952. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  953. FMMNode_t* r_node=NULL;
  954. for(size_t i=0;i<node.size();i++){
  955. if(!node[i]->IsLeaf()){
  956. node[i]->pt_cnt[0] =0;
  957. node_lst_[node[i]->Depth()].push_back(node[i]);
  958. }else{
  959. node[i]->pt_cnt[0] =node[i]-> src_coord.Dim()/COORD_DIM;
  960. node[i]->pt_cnt[0]+=node[i]->surf_coord.Dim()/COORD_DIM;
  961. if(node[i]->IsGhost()) node[i]->pt_cnt[0]++; // TODO: temporary fix, pt_cnt not known for ghost nodes
  962. }
  963. if(node[i]->Depth()==0) r_node=node[i];
  964. }
  965. size_t chld_cnt=1UL<<COORD_DIM;
  966. for(int i=MAX_DEPTH;i>=0;i--){
  967. for(size_t j=0;j<node_lst_[i].size();j++){
  968. for(size_t k=0;k<chld_cnt;k++){
  969. FMMNode_t* node=(FMMNode_t*)node_lst_[i][j]->Child(k);
  970. node_lst_[i][j]->pt_cnt[0]+=node->pt_cnt[0];
  971. }
  972. }
  973. }
  974. for(int i=0;i<=MAX_DEPTH;i++){
  975. for(size_t j=0;j<node_lst_[i].size();j++){
  976. if(node_lst_[i][j]->pt_cnt[0])
  977. for(size_t k=0;k<chld_cnt;k++){
  978. FMMNode_t* node=(FMMNode_t*)node_lst_[i][j]->Child(k);
  979. node_lst.push_back(node);
  980. }
  981. }
  982. }
  983. if(r_node!=NULL) node_lst.push_back(r_node);
  984. n_list[indx]=node_lst;
  985. }
  986. std::vector<Vector<Real_t>*>& vec_lst=vec_list[indx];
  987. for(size_t i=0;i<node_lst.size();i++){ // Construct vec_lst
  988. FMMNode_t* node=node_lst[i];
  989. Vector<Real_t>& data_vec=node->FMMData()->upward_equiv;
  990. data_vec.ReInit(vec_sz,NULL,false);
  991. vec_lst.push_back(&data_vec);
  992. }
  993. }
  994. {// 1. dnward_equiv
  995. int indx=1;
  996. size_t vec_sz;
  997. { // Set vec_sz
  998. Matrix<Real_t>& M_dc2de0 = this->interac_list.ClassMat(0, DC2DE0_Type, 0);
  999. vec_sz=M_dc2de0.Dim(0);
  1000. }
  1001. std::vector< FMMNode* > node_lst;
  1002. {// Construct node_lst
  1003. node_lst.clear();
  1004. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  1005. FMMNode_t* r_node=NULL;
  1006. for(size_t i=0;i<node.size();i++){
  1007. if(!node[i]->IsLeaf()){
  1008. node[i]->pt_cnt[1]=0;
  1009. node_lst_[node[i]->Depth()].push_back(node[i]);
  1010. }else{
  1011. node[i]->pt_cnt[1]=node[i]->trg_coord.Dim()/COORD_DIM;
  1012. }
  1013. if(node[i]->Depth()==0) r_node=node[i];
  1014. }
  1015. size_t chld_cnt=1UL<<COORD_DIM;
  1016. for(int i=MAX_DEPTH;i>=0;i--){
  1017. for(size_t j=0;j<node_lst_[i].size();j++){
  1018. for(size_t k=0;k<chld_cnt;k++){
  1019. FMMNode_t* node=(FMMNode_t*)node_lst_[i][j]->Child(k);
  1020. node_lst_[i][j]->pt_cnt[1]+=node->pt_cnt[1];
  1021. }
  1022. }
  1023. }
  1024. for(int i=0;i<=MAX_DEPTH;i++){
  1025. for(size_t j=0;j<node_lst_[i].size();j++){
  1026. if(node_lst_[i][j]->pt_cnt[1])
  1027. for(size_t k=0;k<chld_cnt;k++){
  1028. FMMNode_t* node=(FMMNode_t*)node_lst_[i][j]->Child(k);
  1029. node_lst.push_back(node);
  1030. }
  1031. }
  1032. }
  1033. if(r_node!=NULL) node_lst.push_back(r_node);
  1034. n_list[indx]=node_lst;
  1035. }
  1036. std::vector<Vector<Real_t>*>& vec_lst=vec_list[indx];
  1037. for(size_t i=0;i<node_lst.size();i++){ // Construct vec_lst
  1038. FMMNode_t* node=node_lst[i];
  1039. Vector<Real_t>& data_vec=node->FMMData()->dnward_equiv;
  1040. data_vec.ReInit(vec_sz,NULL,false);
  1041. vec_lst.push_back(&data_vec);
  1042. }
  1043. }
  1044. {// 2. upward_equiv_fft
  1045. int indx=2;
  1046. std::vector< FMMNode* > node_lst;
  1047. {
  1048. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  1049. for(size_t i=0;i<node.size();i++)
  1050. if(!node[i]->IsLeaf())
  1051. node_lst_[node[i]->Depth()].push_back(node[i]);
  1052. for(int i=0;i<=MAX_DEPTH;i++)
  1053. for(size_t j=0;j<node_lst_[i].size();j++)
  1054. node_lst.push_back(node_lst_[i][j]);
  1055. }
  1056. n_list[indx]=node_lst;
  1057. }
  1058. {// 3. dnward_check_fft
  1059. int indx=3;
  1060. std::vector< FMMNode* > node_lst;
  1061. {
  1062. std::vector<std::vector< FMMNode* > > node_lst_(MAX_DEPTH+1);
  1063. for(size_t i=0;i<node.size();i++)
  1064. if(!node[i]->IsLeaf() && !node[i]->IsGhost())
  1065. node_lst_[node[i]->Depth()].push_back(node[i]);
  1066. for(int i=0;i<=MAX_DEPTH;i++)
  1067. for(size_t j=0;j<node_lst_[i].size();j++)
  1068. node_lst.push_back(node_lst_[i][j]);
  1069. }
  1070. n_list[indx]=node_lst;
  1071. }
  1072. {// 4. src_val
  1073. int indx=4;
  1074. int src_dof=kernel->ker_dim[0];
  1075. int surf_dof=COORD_DIM+src_dof;
  1076. std::vector< FMMNode* > node_lst;
  1077. for(size_t i=0;i<node.size();i++){// Construct node_lst
  1078. if(node[i]->IsLeaf()){
  1079. node_lst.push_back(node[i]);
  1080. }
  1081. }
  1082. n_list[indx]=node_lst;
  1083. std::vector<Vector<Real_t>*>& vec_lst=vec_list[indx];
  1084. for(size_t i=0;i<node_lst.size();i++){ // Construct vec_lst
  1085. FMMNode_t* node=node_lst[i];
  1086. { // src_value
  1087. Vector<Real_t>& data_vec=node->src_value;
  1088. size_t vec_sz=(node->src_coord.Dim()/COORD_DIM)*src_dof;
  1089. if(data_vec.Dim()!=vec_sz) data_vec.ReInit(vec_sz,NULL,false);
  1090. vec_lst.push_back(&data_vec);
  1091. }
  1092. { // surf_value
  1093. Vector<Real_t>& data_vec=node->surf_value;
  1094. size_t vec_sz=(node->surf_coord.Dim()/COORD_DIM)*surf_dof;
  1095. if(data_vec.Dim()!=vec_sz) data_vec.ReInit(vec_sz,NULL,false);
  1096. vec_lst.push_back(&data_vec);
  1097. }
  1098. }
  1099. }
  1100. {// 5. trg_val
  1101. int indx=5;
  1102. int trg_dof=kernel->ker_dim[1];
  1103. std::vector< FMMNode* > node_lst;
  1104. for(size_t i=0;i<node.size();i++){// Construct node_lst
  1105. if(node[i]->IsLeaf() && !node[i]->IsGhost()){
  1106. node_lst.push_back(node[i]);
  1107. }
  1108. }
  1109. n_list[indx]=node_lst;
  1110. std::vector<Vector<Real_t>*>& vec_lst=vec_list[indx];
  1111. for(size_t i=0;i<node_lst.size();i++){ // Construct vec_lst
  1112. FMMNode_t* node=node_lst[i];
  1113. { // trg_value
  1114. Vector<Real_t>& data_vec=node->trg_value;
  1115. size_t vec_sz=(node->trg_coord.Dim()/COORD_DIM)*trg_dof;
  1116. data_vec.ReInit(vec_sz,NULL,false);
  1117. vec_lst.push_back(&data_vec);
  1118. }
  1119. }
  1120. }
  1121. {// 6. pts_coord
  1122. int indx=6;
  1123. std::vector< FMMNode* > node_lst;
  1124. for(size_t i=0;i<node.size();i++){// Construct node_lst
  1125. if(node[i]->IsLeaf()){
  1126. node_lst.push_back(node[i]);
  1127. }
  1128. }
  1129. n_list[indx]=node_lst;
  1130. std::vector<Vector<Real_t>*>& vec_lst=vec_list[indx];
  1131. for(size_t i=0;i<node_lst.size();i++){ // Construct vec_lst
  1132. FMMNode_t* node=node_lst[i];
  1133. { // src_coord
  1134. Vector<Real_t>& data_vec=node->src_coord;
  1135. vec_lst.push_back(&data_vec);
  1136. }
  1137. { // surf_coord
  1138. Vector<Real_t>& data_vec=node->surf_coord;
  1139. vec_lst.push_back(&data_vec);
  1140. }
  1141. { // trg_coord
  1142. Vector<Real_t>& data_vec=node->trg_coord;
  1143. vec_lst.push_back(&data_vec);
  1144. }
  1145. }
  1146. { // check and equiv surfaces.
  1147. if(tree->upwd_check_surf.size()==0){
  1148. size_t m=MultipoleOrder();
  1149. tree->upwd_check_surf.resize(MAX_DEPTH);
  1150. tree->upwd_equiv_surf.resize(MAX_DEPTH);
  1151. tree->dnwd_check_surf.resize(MAX_DEPTH);
  1152. tree->dnwd_equiv_surf.resize(MAX_DEPTH);
  1153. for(size_t depth=0;depth<MAX_DEPTH;depth++){
  1154. Real_t c[3]={0.0,0.0,0.0};
  1155. tree->upwd_check_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM);
  1156. tree->upwd_equiv_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM);
  1157. tree->dnwd_check_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM);
  1158. tree->dnwd_equiv_surf[depth].ReInit((6*(m-1)*(m-1)+2)*COORD_DIM);
  1159. tree->upwd_check_surf[depth]=u_check_surf(m,c,depth);
  1160. tree->upwd_equiv_surf[depth]=u_equiv_surf(m,c,depth);
  1161. tree->dnwd_check_surf[depth]=d_check_surf(m,c,depth);
  1162. tree->dnwd_equiv_surf[depth]=d_equiv_surf(m,c,depth);
  1163. }
  1164. }
  1165. for(size_t depth=0;depth<MAX_DEPTH;depth++){
  1166. vec_lst.push_back(&tree->upwd_check_surf[depth]);
  1167. vec_lst.push_back(&tree->upwd_equiv_surf[depth]);
  1168. vec_lst.push_back(&tree->dnwd_check_surf[depth]);
  1169. vec_lst.push_back(&tree->dnwd_equiv_surf[depth]);
  1170. }
  1171. }
  1172. }
  1173. // Create extra auxiliary buffer.
  1174. if(buff_list.size()<=vec_list.size()) buff_list.resize(vec_list.size()+1);
  1175. for(size_t indx=0;indx<vec_list.size();indx++){ // Resize buffer
  1176. Matrix<Real_t>& aux_buff=buff_list[vec_list.size()];
  1177. Matrix<Real_t>& buff=buff_list[indx];
  1178. std::vector<Vector<Real_t>*>& vec_lst= vec_list[indx];
  1179. bool keep_data=(indx==4 || indx==6);
  1180. size_t n_vec=vec_lst.size();
  1181. { // Continue if nothing to be done.
  1182. if(!n_vec) continue;
  1183. if(buff.Dim(0)*buff.Dim(1)>0){
  1184. bool init_buff=false;
  1185. Real_t* buff_start=&buff[0][0];
  1186. Real_t* buff_end=&buff[0][0]+buff.Dim(0)*buff.Dim(1);
  1187. #pragma omp parallel for reduction(||:init_buff)
  1188. for(size_t i=0;i<n_vec;i++){
  1189. if(vec_lst[i]->Dim() && (&(*vec_lst[i])[0]<buff_start || &(*vec_lst[i])[0]>=buff_end)){
  1190. init_buff=true;
  1191. }
  1192. }
  1193. if(!init_buff) continue;
  1194. }
  1195. }
  1196. std::vector<size_t> vec_size(n_vec);
  1197. std::vector<size_t> vec_disp(n_vec);
  1198. if(n_vec){ // Set vec_size and vec_disp
  1199. #pragma omp parallel for
  1200. for(size_t i=0;i<n_vec;i++){ // Set vec_size
  1201. vec_size[i]=vec_lst[i]->Dim();
  1202. }
  1203. vec_disp[0]=0;
  1204. omp_par::scan(&vec_size[0],&vec_disp[0],n_vec);
  1205. }
  1206. size_t buff_size=vec_size[n_vec-1]+vec_disp[n_vec-1];
  1207. if(!buff_size) continue;
  1208. if(keep_data){ // Copy to aux_buff
  1209. if(aux_buff.Dim(0)*aux_buff.Dim(1)<buff_size){ // Resize aux_buff
  1210. aux_buff.ReInit(1,buff_size*1.05);
  1211. }
  1212. #pragma omp parallel for
  1213. for(size_t i=0;i<n_vec;i++){
  1214. if(&(*vec_lst[i])[0]){
  1215. mem::memcopy(&aux_buff[0][0]+vec_disp[i],&(*vec_lst[i])[0],vec_size[i]*sizeof(Real_t));
  1216. }
  1217. }
  1218. }
  1219. if(buff.Dim(0)*buff.Dim(1)<buff_size){ // Resize buff
  1220. buff.ReInit(1,buff_size*1.05);
  1221. }
  1222. if(keep_data){ // Copy to buff (from aux_buff)
  1223. #pragma omp parallel for
  1224. for(size_t tid=0;tid<omp_p;tid++){
  1225. size_t a=(buff_size*(tid+0))/omp_p;
  1226. size_t b=(buff_size*(tid+1))/omp_p;
  1227. mem::memcopy(&buff[0][0]+a,&aux_buff[0][0]+a,(b-a)*sizeof(Real_t));
  1228. }
  1229. }
  1230. #pragma omp parallel for
  1231. for(size_t i=0;i<n_vec;i++){ // ReInit vectors
  1232. vec_lst[i]->ReInit(vec_size[i],&buff[0][0]+vec_disp[i],false);
  1233. }
  1234. }
  1235. }
  1236. template <class FMMNode>
  1237. void FMM_Pts<FMMNode>::SetupPrecomp(SetupData<Real_t>& setup_data, bool device){
  1238. if(setup_data.precomp_data==NULL || setup_data.level>MAX_DEPTH) return;
  1239. Profile::Tic("SetupPrecomp",&this->comm,true,25);
  1240. { // Build precomp_data
  1241. size_t precomp_offset=0;
  1242. int level=setup_data.level;
  1243. Matrix<char>& precomp_data=*setup_data.precomp_data;
  1244. std::vector<Mat_Type>& interac_type_lst=setup_data.interac_type;
  1245. for(size_t type_indx=0; type_indx<interac_type_lst.size(); type_indx++){
  1246. Mat_Type& interac_type=interac_type_lst[type_indx];
  1247. this->PrecompAll(interac_type, level); // Compute matrices.
  1248. precomp_offset=this->mat->CompactData(level, interac_type, precomp_data, precomp_offset);
  1249. }
  1250. }
  1251. Profile::Toc();
  1252. if(device){ // Host2Device
  1253. Profile::Tic("Host2Device",&this->comm,false,25);
  1254. setup_data.precomp_data->AllocDevice(true);
  1255. Profile::Toc();
  1256. }
  1257. }
  1258. template <class FMMNode>
  1259. void FMM_Pts<FMMNode>::SetupInterac(SetupData<Real_t>& setup_data, bool device){
  1260. int level=setup_data.level;
  1261. std::vector<Mat_Type>& interac_type_lst=setup_data.interac_type;
  1262. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  1263. std::vector<void*>& nodes_out=setup_data.nodes_out;
  1264. Matrix<Real_t>& input_data=*setup_data. input_data;
  1265. Matrix<Real_t>& output_data=*setup_data.output_data;
  1266. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector;
  1267. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector;
  1268. size_t n_in =nodes_in .size();
  1269. size_t n_out=nodes_out.size();
  1270. // Setup precomputed data.
  1271. if(setup_data.precomp_data->Dim(0)*setup_data.precomp_data->Dim(1)==0) SetupPrecomp(setup_data,device);
  1272. // Build interac_data
  1273. Profile::Tic("Interac-Data",&this->comm,true,25);
  1274. Matrix<char>& interac_data=setup_data.interac_data;
  1275. { // Build precomp_data, interac_data
  1276. std::vector<size_t> interac_mat;
  1277. std::vector<size_t> interac_cnt;
  1278. std::vector<size_t> interac_blk;
  1279. std::vector<size_t> input_perm;
  1280. std::vector<size_t> output_perm;
  1281. size_t dof=0, M_dim0=0, M_dim1=0;
  1282. size_t precomp_offset=0;
  1283. size_t buff_size=DEVICE_BUFFER_SIZE*1024l*1024l;
  1284. if(n_out && n_in) for(size_t type_indx=0; type_indx<interac_type_lst.size(); type_indx++){
  1285. Mat_Type& interac_type=interac_type_lst[type_indx];
  1286. size_t mat_cnt=this->interac_list.ListCount(interac_type);
  1287. Matrix<size_t> precomp_data_offset;
  1288. { // Load precomp_data for interac_type.
  1289. struct HeaderData{
  1290. size_t total_size;
  1291. size_t level;
  1292. size_t mat_cnt ;
  1293. size_t max_depth;
  1294. };
  1295. Matrix<char>& precomp_data=*setup_data.precomp_data;
  1296. char* indx_ptr=precomp_data[0]+precomp_offset;
  1297. HeaderData& header=*(HeaderData*)indx_ptr;indx_ptr+=sizeof(HeaderData);
  1298. precomp_data_offset.ReInit(header.mat_cnt,(1+(2+2)*header.max_depth), (size_t*)indx_ptr, false);
  1299. precomp_offset+=header.total_size;
  1300. }
  1301. Matrix<FMMNode*> src_interac_list(n_in ,mat_cnt); src_interac_list.SetZero();
  1302. Matrix<FMMNode*> trg_interac_list(n_out,mat_cnt); trg_interac_list.SetZero();
  1303. { // Build trg_interac_list
  1304. #pragma omp parallel for
  1305. for(size_t i=0;i<n_out;i++){
  1306. if(!((FMMNode*)nodes_out[i])->IsGhost() && (level==-1 || ((FMMNode*)nodes_out[i])->Depth()==level)){
  1307. Vector<FMMNode*>& lst=((FMMNode*)nodes_out[i])->interac_list[interac_type];
  1308. mem::memcopy(&trg_interac_list[i][0], &lst[0], lst.Dim()*sizeof(FMMNode*));
  1309. assert(lst.Dim()==mat_cnt);
  1310. }
  1311. }
  1312. }
  1313. { // Build src_interac_list
  1314. #pragma omp parallel for
  1315. for(size_t i=0;i<n_out;i++){
  1316. for(size_t j=0;j<mat_cnt;j++)
  1317. if(trg_interac_list[i][j]!=NULL){
  1318. trg_interac_list[i][j]->node_id=n_in;
  1319. }
  1320. }
  1321. #pragma omp parallel for
  1322. for(size_t i=0;i<n_in ;i++) ((FMMNode*)nodes_in [i])->node_id=i;
  1323. #pragma omp parallel for
  1324. for(size_t i=0;i<n_out;i++){
  1325. for(size_t j=0;j<mat_cnt;j++){
  1326. if(trg_interac_list[i][j]!=NULL){
  1327. if(trg_interac_list[i][j]->node_id==n_in){
  1328. trg_interac_list[i][j]=NULL;
  1329. }else{
  1330. src_interac_list[trg_interac_list[i][j]->node_id][j]=(FMMNode*)nodes_out[i];
  1331. }
  1332. }
  1333. }
  1334. }
  1335. }
  1336. Matrix<size_t> interac_dsp(n_out,mat_cnt);
  1337. std::vector<size_t> interac_blk_dsp(1,0);
  1338. { // Determine dof, M_dim0, M_dim1
  1339. dof=1;
  1340. Matrix<Real_t>& M0 = this->interac_list.ClassMat(level, interac_type_lst[0], 0);
  1341. M_dim0=M0.Dim(0); M_dim1=M0.Dim(1);
  1342. }
  1343. { // Determine interaction blocks which fit in memory.
  1344. size_t vec_size=(M_dim0+M_dim1)*sizeof(Real_t)*dof;
  1345. for(size_t j=0;j<mat_cnt;j++){// Determine minimum buff_size
  1346. size_t vec_cnt=0;
  1347. for(size_t i=0;i<n_out;i++){
  1348. if(trg_interac_list[i][j]!=NULL) vec_cnt++;
  1349. }
  1350. if(buff_size<vec_cnt*vec_size)
  1351. buff_size=vec_cnt*vec_size;
  1352. }
  1353. size_t interac_dsp_=0;
  1354. for(size_t j=0;j<mat_cnt;j++){
  1355. for(size_t i=0;i<n_out;i++){
  1356. interac_dsp[i][j]=interac_dsp_;
  1357. if(trg_interac_list[i][j]!=NULL) interac_dsp_++;
  1358. }
  1359. if(interac_dsp_*vec_size>buff_size) // Comment to disable symmetries.
  1360. {
  1361. interac_blk.push_back(j-interac_blk_dsp.back());
  1362. interac_blk_dsp.push_back(j);
  1363. size_t offset=interac_dsp[0][j];
  1364. for(size_t i=0;i<n_out;i++) interac_dsp[i][j]-=offset;
  1365. interac_dsp_-=offset;
  1366. assert(interac_dsp_*vec_size<=buff_size); // Problem too big for buff_size.
  1367. }
  1368. interac_mat.push_back(precomp_data_offset[this->interac_list.InteracClass(interac_type,j)][0]);
  1369. interac_cnt.push_back(interac_dsp_-interac_dsp[0][j]);
  1370. }
  1371. interac_blk.push_back(mat_cnt-interac_blk_dsp.back());
  1372. interac_blk_dsp.push_back(mat_cnt);
  1373. }
  1374. { // Determine input_perm.
  1375. size_t vec_size=M_dim0*dof;
  1376. for(size_t i=0;i<n_out;i++) ((FMMNode*)nodes_out[i])->node_id=i;
  1377. for(size_t k=1;k<interac_blk_dsp.size();k++){
  1378. for(size_t i=0;i<n_in ;i++){
  1379. for(size_t j=interac_blk_dsp[k-1];j<interac_blk_dsp[k];j++){
  1380. FMMNode_t* trg_node=src_interac_list[i][j];
  1381. if(trg_node!=NULL && trg_node->node_id<n_out){
  1382. size_t depth=(this->ScaleInvar()?trg_node->Depth():0);
  1383. input_perm .push_back(precomp_data_offset[j][1+4*depth+0]); // prem
  1384. input_perm .push_back(precomp_data_offset[j][1+4*depth+1]); // scal
  1385. input_perm .push_back(interac_dsp[trg_node->node_id][j]*vec_size*sizeof(Real_t)); // trg_ptr
  1386. input_perm .push_back((size_t)(& input_vector[i][0][0]- input_data[0])); // src_ptr
  1387. assert(input_vector[i]->Dim()==vec_size);
  1388. }
  1389. }
  1390. }
  1391. }
  1392. }
  1393. { // Determine output_perm
  1394. size_t vec_size=M_dim1*dof;
  1395. for(size_t k=1;k<interac_blk_dsp.size();k++){
  1396. for(size_t i=0;i<n_out;i++){
  1397. for(size_t j=interac_blk_dsp[k-1];j<interac_blk_dsp[k];j++){
  1398. if(trg_interac_list[i][j]!=NULL){
  1399. size_t depth=(this->ScaleInvar()?((FMMNode*)nodes_out[i])->Depth():0);
  1400. output_perm.push_back(precomp_data_offset[j][1+4*depth+2]); // prem
  1401. output_perm.push_back(precomp_data_offset[j][1+4*depth+3]); // scal
  1402. output_perm.push_back(interac_dsp[ i ][j]*vec_size*sizeof(Real_t)); // src_ptr
  1403. output_perm.push_back((size_t)(&output_vector[i][0][0]-output_data[0])); // trg_ptr
  1404. assert(output_vector[i]->Dim()==vec_size);
  1405. }
  1406. }
  1407. }
  1408. }
  1409. }
  1410. }
  1411. if(this->dev_buffer.Dim()<buff_size) this->dev_buffer.ReInit(buff_size);
  1412. if(this->cpu_buffer.Dim()<buff_size) this->cpu_buffer.ReInit(buff_size);
  1413. { // Set interac_data.
  1414. size_t data_size=sizeof(size_t)*4;
  1415. data_size+=sizeof(size_t)+interac_blk.size()*sizeof(size_t);
  1416. data_size+=sizeof(size_t)+interac_cnt.size()*sizeof(size_t);
  1417. data_size+=sizeof(size_t)+interac_mat.size()*sizeof(size_t);
  1418. data_size+=sizeof(size_t)+ input_perm.size()*sizeof(size_t);
  1419. data_size+=sizeof(size_t)+output_perm.size()*sizeof(size_t);
  1420. if(interac_data.Dim(0)*interac_data.Dim(1)<sizeof(size_t)){
  1421. data_size+=sizeof(size_t);
  1422. interac_data.ReInit(1,data_size);
  1423. ((size_t*)&interac_data[0][0])[0]=sizeof(size_t);
  1424. }else{
  1425. size_t pts_data_size=*((size_t*)&interac_data[0][0]);
  1426. assert(interac_data.Dim(0)*interac_data.Dim(1)>=pts_data_size);
  1427. data_size+=pts_data_size;
  1428. if(data_size>interac_data.Dim(0)*interac_data.Dim(1)){ //Resize and copy interac_data.
  1429. Matrix< char> pts_interac_data=interac_data;
  1430. interac_data.ReInit(1,data_size);
  1431. mem::memcopy(&interac_data[0][0],&pts_interac_data[0][0],pts_data_size);
  1432. }
  1433. }
  1434. char* data_ptr=&interac_data[0][0];
  1435. data_ptr+=((size_t*)data_ptr)[0];
  1436. ((size_t*)data_ptr)[0]=data_size; data_ptr+=sizeof(size_t);
  1437. ((size_t*)data_ptr)[0]= M_dim0; data_ptr+=sizeof(size_t);
  1438. ((size_t*)data_ptr)[0]= M_dim1; data_ptr+=sizeof(size_t);
  1439. ((size_t*)data_ptr)[0]= dof; data_ptr+=sizeof(size_t);
  1440. ((size_t*)data_ptr)[0]=interac_blk.size(); data_ptr+=sizeof(size_t);
  1441. mem::memcopy(data_ptr, &interac_blk[0], interac_blk.size()*sizeof(size_t));
  1442. data_ptr+=interac_blk.size()*sizeof(size_t);
  1443. ((size_t*)data_ptr)[0]=interac_cnt.size(); data_ptr+=sizeof(size_t);
  1444. mem::memcopy(data_ptr, &interac_cnt[0], interac_cnt.size()*sizeof(size_t));
  1445. data_ptr+=interac_cnt.size()*sizeof(size_t);
  1446. ((size_t*)data_ptr)[0]=interac_mat.size(); data_ptr+=sizeof(size_t);
  1447. mem::memcopy(data_ptr, &interac_mat[0], interac_mat.size()*sizeof(size_t));
  1448. data_ptr+=interac_mat.size()*sizeof(size_t);
  1449. ((size_t*)data_ptr)[0]= input_perm.size(); data_ptr+=sizeof(size_t);
  1450. mem::memcopy(data_ptr, & input_perm[0], input_perm.size()*sizeof(size_t));
  1451. data_ptr+= input_perm.size()*sizeof(size_t);
  1452. ((size_t*)data_ptr)[0]=output_perm.size(); data_ptr+=sizeof(size_t);
  1453. mem::memcopy(data_ptr, &output_perm[0], output_perm.size()*sizeof(size_t));
  1454. data_ptr+=output_perm.size()*sizeof(size_t);
  1455. }
  1456. }
  1457. Profile::Toc();
  1458. if(device){ // Host2Device
  1459. Profile::Tic("Host2Device",&this->comm,false,25);
  1460. setup_data.interac_data .AllocDevice(true);
  1461. Profile::Toc();
  1462. }
  1463. }
  1464. #if defined(PVFMM_HAVE_CUDA)
  1465. #include <fmm_pts_gpu.hpp>
  1466. template <class Real_t, int SYNC>
  1467. void EvalListGPU(SetupData<Real_t>& setup_data, Vector<char>& dev_buffer, MPI_Comm& comm) {
  1468. cudaStream_t* stream = pvfmm::CUDA_Lock::acquire_stream();
  1469. Profile::Tic("Host2Device",&comm,false,25);
  1470. typename Matrix<char>::Device interac_data;
  1471. typename Vector<char>::Device buff;
  1472. typename Matrix<char>::Device precomp_data_d;
  1473. typename Matrix<char>::Device interac_data_d;
  1474. typename Matrix<Real_t>::Device input_data_d;
  1475. typename Matrix<Real_t>::Device output_data_d;
  1476. interac_data = setup_data.interac_data;
  1477. buff = dev_buffer. AllocDevice(false);
  1478. precomp_data_d= setup_data.precomp_data->AllocDevice(false);
  1479. interac_data_d= setup_data.interac_data. AllocDevice(false);
  1480. input_data_d = setup_data. input_data->AllocDevice(false);
  1481. output_data_d = setup_data. output_data->AllocDevice(false);
  1482. Profile::Toc();
  1483. Profile::Tic("DeviceComp",&comm,false,20);
  1484. { // Offloaded computation.
  1485. size_t data_size, M_dim0, M_dim1, dof;
  1486. Vector<size_t> interac_blk;
  1487. Vector<size_t> interac_cnt;
  1488. Vector<size_t> interac_mat;
  1489. Vector<size_t> input_perm_d;
  1490. Vector<size_t> output_perm_d;
  1491. { // Set interac_data.
  1492. char* data_ptr=&interac_data [0][0];
  1493. char* dev_ptr=&interac_data_d[0][0];
  1494. data_size=((size_t*)data_ptr)[0]; data_ptr+=data_size; dev_ptr += data_size;
  1495. data_size=((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t); dev_ptr += sizeof(size_t);
  1496. M_dim0 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t); dev_ptr += sizeof(size_t);
  1497. M_dim1 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t); dev_ptr += sizeof(size_t);
  1498. dof =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t); dev_ptr += sizeof(size_t);
  1499. interac_blk.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1500. data_ptr += sizeof(size_t) + sizeof(size_t)*interac_blk.Dim();
  1501. dev_ptr += sizeof(size_t) + sizeof(size_t)*interac_blk.Dim();
  1502. interac_cnt.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1503. data_ptr += sizeof(size_t) + sizeof(size_t)*interac_cnt.Dim();
  1504. dev_ptr += sizeof(size_t) + sizeof(size_t)*interac_cnt.Dim();
  1505. interac_mat.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1506. data_ptr += sizeof(size_t) + sizeof(size_t)*interac_mat.Dim();
  1507. dev_ptr += sizeof(size_t) + sizeof(size_t)*interac_mat.Dim();
  1508. input_perm_d.ReInit(((size_t*)data_ptr)[0],(size_t*)(dev_ptr+sizeof(size_t)),false);
  1509. data_ptr += sizeof(size_t) + sizeof(size_t)*input_perm_d.Dim();
  1510. dev_ptr += sizeof(size_t) + sizeof(size_t)*input_perm_d.Dim();
  1511. output_perm_d.ReInit(((size_t*)data_ptr)[0],(size_t*)(dev_ptr+sizeof(size_t)),false);
  1512. data_ptr += sizeof(size_t) + sizeof(size_t)*output_perm_d.Dim();
  1513. dev_ptr += sizeof(size_t) + sizeof(size_t)*output_perm_d.Dim();
  1514. }
  1515. { // interactions
  1516. size_t interac_indx = 0;
  1517. size_t interac_blk_dsp = 0;
  1518. cudaError_t error;
  1519. for (size_t k = 0; k < interac_blk.Dim(); k++) {
  1520. size_t vec_cnt=0;
  1521. for(size_t j=interac_blk_dsp;j<interac_blk_dsp+interac_blk[k];j++) vec_cnt+=interac_cnt[j];
  1522. if(vec_cnt==0){
  1523. //interac_indx += vec_cnt;
  1524. interac_blk_dsp += interac_blk[k];
  1525. continue;
  1526. }
  1527. char *buff_in_d =&buff[0];
  1528. char *buff_out_d =&buff[vec_cnt*dof*M_dim0*sizeof(Real_t)];
  1529. { // Input permutation.
  1530. in_perm_gpu<Real_t>(&precomp_data_d[0][0], &input_data_d[0][0], buff_in_d,
  1531. &input_perm_d[interac_indx*4], vec_cnt, M_dim0, stream);
  1532. }
  1533. size_t vec_cnt0 = 0;
  1534. for (size_t j = interac_blk_dsp; j < interac_blk_dsp + interac_blk[k];) {
  1535. size_t vec_cnt1 = 0;
  1536. size_t interac_mat0 = interac_mat[j];
  1537. for (; j < interac_blk_dsp + interac_blk[k] && interac_mat[j] == interac_mat0; j++) vec_cnt1 += interac_cnt[j];
  1538. Matrix<Real_t> M_d(M_dim0, M_dim1, (Real_t*)(precomp_data_d.dev_ptr + interac_mat0), false);
  1539. Matrix<Real_t> Ms_d(dof*vec_cnt1, M_dim0, (Real_t*)(buff_in_d + M_dim0*vec_cnt0*dof*sizeof(Real_t)), false);
  1540. Matrix<Real_t> Mt_d(dof*vec_cnt1, M_dim1, (Real_t*)(buff_out_d + M_dim1*vec_cnt0*dof*sizeof(Real_t)), false);
  1541. Matrix<Real_t>::CUBLASGEMM(Mt_d, Ms_d, M_d);
  1542. vec_cnt0 += vec_cnt1;
  1543. }
  1544. { // Output permutation.
  1545. out_perm_gpu<Real_t>(&precomp_data_d[0][0], &output_data_d[0][0], buff_out_d,
  1546. &output_perm_d[interac_indx*4], vec_cnt, M_dim1, stream);
  1547. }
  1548. interac_indx += vec_cnt;
  1549. interac_blk_dsp += interac_blk[k];
  1550. }
  1551. }
  1552. }
  1553. Profile::Toc();
  1554. if(SYNC) CUDA_Lock::wait();
  1555. }
  1556. #endif
  1557. template <class FMMNode>
  1558. template <int SYNC>
  1559. void FMM_Pts<FMMNode>::EvalList(SetupData<Real_t>& setup_data, bool device){
  1560. if(setup_data.interac_data.Dim(0)==0 || setup_data.interac_data.Dim(1)==0){
  1561. Profile::Tic("Host2Device",&this->comm,false,25);
  1562. Profile::Toc();
  1563. Profile::Tic("DeviceComp",&this->comm,false,20);
  1564. Profile::Toc();
  1565. return;
  1566. }
  1567. #if defined(PVFMM_HAVE_CUDA)
  1568. if (device) {
  1569. EvalListGPU<Real_t, SYNC>(setup_data, this->dev_buffer, this->comm);
  1570. return;
  1571. }
  1572. #endif
  1573. Profile::Tic("Host2Device",&this->comm,false,25);
  1574. typename Vector<char>::Device buff;
  1575. typename Matrix<char>::Device precomp_data;
  1576. typename Matrix<char>::Device interac_data;
  1577. typename Matrix<Real_t>::Device input_data;
  1578. typename Matrix<Real_t>::Device output_data;
  1579. if(device){
  1580. buff = this-> dev_buffer. AllocDevice(false);
  1581. precomp_data= setup_data.precomp_data->AllocDevice(false);
  1582. interac_data= setup_data.interac_data. AllocDevice(false);
  1583. input_data = setup_data. input_data->AllocDevice(false);
  1584. output_data = setup_data. output_data->AllocDevice(false);
  1585. }else{
  1586. buff = this-> cpu_buffer;
  1587. precomp_data=*setup_data.precomp_data;
  1588. interac_data= setup_data.interac_data;
  1589. input_data =*setup_data. input_data;
  1590. output_data =*setup_data. output_data;
  1591. }
  1592. Profile::Toc();
  1593. Profile::Tic("DeviceComp",&this->comm,false,20);
  1594. int lock_idx=-1;
  1595. int wait_lock_idx=-1;
  1596. if(device) wait_lock_idx=MIC_Lock::curr_lock();
  1597. if(device) lock_idx=MIC_Lock::get_lock();
  1598. #ifdef __INTEL_OFFLOAD
  1599. #pragma offload if(device) target(mic:0) signal(&MIC_Lock::lock_vec[device?lock_idx:0])
  1600. #endif
  1601. { // Offloaded computation.
  1602. // Set interac_data.
  1603. size_t data_size, M_dim0, M_dim1, dof;
  1604. Vector<size_t> interac_blk;
  1605. Vector<size_t> interac_cnt;
  1606. Vector<size_t> interac_mat;
  1607. Vector<size_t> input_perm;
  1608. Vector<size_t> output_perm;
  1609. { // Set interac_data.
  1610. char* data_ptr=&interac_data[0][0];
  1611. data_size=((size_t*)data_ptr)[0]; data_ptr+=data_size;
  1612. data_size=((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1613. M_dim0 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1614. M_dim1 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1615. dof =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  1616. interac_blk.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1617. data_ptr+=sizeof(size_t)+interac_blk.Dim()*sizeof(size_t);
  1618. interac_cnt.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1619. data_ptr+=sizeof(size_t)+interac_cnt.Dim()*sizeof(size_t);
  1620. interac_mat.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1621. data_ptr+=sizeof(size_t)+interac_mat.Dim()*sizeof(size_t);
  1622. input_perm .ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1623. data_ptr+=sizeof(size_t)+ input_perm.Dim()*sizeof(size_t);
  1624. output_perm.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  1625. data_ptr+=sizeof(size_t)+output_perm.Dim()*sizeof(size_t);
  1626. }
  1627. if(device) MIC_Lock::wait_lock(wait_lock_idx);
  1628. //Compute interaction from Chebyshev source density.
  1629. { // interactions
  1630. int omp_p=omp_get_max_threads();
  1631. size_t interac_indx=0;
  1632. size_t interac_blk_dsp=0;
  1633. for(size_t k=0;k<interac_blk.Dim();k++){
  1634. size_t vec_cnt=0;
  1635. for(size_t j=interac_blk_dsp;j<interac_blk_dsp+interac_blk[k];j++) vec_cnt+=interac_cnt[j];
  1636. if(vec_cnt==0){
  1637. //interac_indx += vec_cnt;
  1638. interac_blk_dsp += interac_blk[k];
  1639. continue;
  1640. }
  1641. char* buff_in =&buff[0];
  1642. char* buff_out=&buff[vec_cnt*dof*M_dim0*sizeof(Real_t)];
  1643. // Input permutation.
  1644. #pragma omp parallel for
  1645. for(int tid=0;tid<omp_p;tid++){
  1646. size_t a=( tid *vec_cnt)/omp_p;
  1647. size_t b=((tid+1)*vec_cnt)/omp_p;
  1648. for(size_t i=a;i<b;i++){
  1649. const PERM_INT_T* perm=(PERM_INT_T*)(precomp_data[0]+input_perm[(interac_indx+i)*4+0]);
  1650. const Real_t* scal=( Real_t*)(precomp_data[0]+input_perm[(interac_indx+i)*4+1]);
  1651. const Real_t* v_in =( Real_t*)( input_data[0]+input_perm[(interac_indx+i)*4+3]);
  1652. Real_t* v_out=( Real_t*)( buff_in +input_perm[(interac_indx+i)*4+2]);
  1653. // TODO: Fix for dof>1
  1654. #ifdef __MIC__
  1655. {
  1656. __m512d v8;
  1657. size_t j_start=(((uintptr_t)(v_out ) + (uintptr_t)(MEM_ALIGN-1)) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1658. size_t j_end =(((uintptr_t)(v_out+M_dim0) ) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1659. j_start/=sizeof(Real_t);
  1660. j_end /=sizeof(Real_t);
  1661. assert(((uintptr_t)(v_out))%sizeof(Real_t)==0);
  1662. assert(((uintptr_t)(v_out+j_start))%64==0);
  1663. assert(((uintptr_t)(v_out+j_end ))%64==0);
  1664. size_t j=0;
  1665. for(;j<j_start;j++ ){
  1666. v_out[j]=v_in[perm[j]]*scal[j];
  1667. }
  1668. for(;j<j_end ;j+=8){
  1669. v8=_mm512_setr_pd(
  1670. v_in[perm[j+0]]*scal[j+0],
  1671. v_in[perm[j+1]]*scal[j+1],
  1672. v_in[perm[j+2]]*scal[j+2],
  1673. v_in[perm[j+3]]*scal[j+3],
  1674. v_in[perm[j+4]]*scal[j+4],
  1675. v_in[perm[j+5]]*scal[j+5],
  1676. v_in[perm[j+6]]*scal[j+6],
  1677. v_in[perm[j+7]]*scal[j+7]);
  1678. _mm512_storenrngo_pd(v_out+j,v8);
  1679. }
  1680. for(;j<M_dim0 ;j++ ){
  1681. v_out[j]=v_in[perm[j]]*scal[j];
  1682. }
  1683. }
  1684. #else
  1685. for(size_t j=0;j<M_dim0;j++ ){
  1686. v_out[j]=v_in[perm[j]]*scal[j];
  1687. }
  1688. #endif
  1689. }
  1690. }
  1691. size_t vec_cnt0=0;
  1692. for(size_t j=interac_blk_dsp;j<interac_blk_dsp+interac_blk[k];){
  1693. size_t vec_cnt1=0;
  1694. size_t interac_mat0=interac_mat[j];
  1695. for(;j<interac_blk_dsp+interac_blk[k] && interac_mat[j]==interac_mat0;j++) vec_cnt1+=interac_cnt[j];
  1696. Matrix<Real_t> M(M_dim0, M_dim1, (Real_t*)(precomp_data[0]+interac_mat0), false);
  1697. #ifdef __MIC__
  1698. {
  1699. Matrix<Real_t> Ms(dof*vec_cnt1, M_dim0, (Real_t*)(buff_in +M_dim0*vec_cnt0*dof*sizeof(Real_t)), false);
  1700. Matrix<Real_t> Mt(dof*vec_cnt1, M_dim1, (Real_t*)(buff_out+M_dim1*vec_cnt0*dof*sizeof(Real_t)), false);
  1701. Matrix<Real_t>::GEMM(Mt,Ms,M);
  1702. }
  1703. #else
  1704. #pragma omp parallel for
  1705. for(int tid=0;tid<omp_p;tid++){
  1706. size_t a=(dof*vec_cnt1*(tid ))/omp_p;
  1707. size_t b=(dof*vec_cnt1*(tid+1))/omp_p;
  1708. Matrix<Real_t> Ms(b-a, M_dim0, (Real_t*)(buff_in +M_dim0*vec_cnt0*dof*sizeof(Real_t))+M_dim0*a, false);
  1709. Matrix<Real_t> Mt(b-a, M_dim1, (Real_t*)(buff_out+M_dim1*vec_cnt0*dof*sizeof(Real_t))+M_dim1*a, false);
  1710. Matrix<Real_t>::GEMM(Mt,Ms,M);
  1711. }
  1712. #endif
  1713. vec_cnt0+=vec_cnt1;
  1714. }
  1715. // Output permutation.
  1716. #pragma omp parallel for
  1717. for(int tid=0;tid<omp_p;tid++){
  1718. size_t a=( tid *vec_cnt)/omp_p;
  1719. size_t b=((tid+1)*vec_cnt)/omp_p;
  1720. if(tid> 0 && a<vec_cnt){ // Find 'a' independent of other threads.
  1721. size_t out_ptr=output_perm[(interac_indx+a)*4+3];
  1722. if(tid> 0) while(a<vec_cnt && out_ptr==output_perm[(interac_indx+a)*4+3]) a++;
  1723. }
  1724. if(tid<omp_p-1 && b<vec_cnt){ // Find 'b' independent of other threads.
  1725. size_t out_ptr=output_perm[(interac_indx+b)*4+3];
  1726. if(tid<omp_p-1) while(b<vec_cnt && out_ptr==output_perm[(interac_indx+b)*4+3]) b++;
  1727. }
  1728. for(size_t i=a;i<b;i++){ // Compute permutations.
  1729. const PERM_INT_T* perm=(PERM_INT_T*)(precomp_data[0]+output_perm[(interac_indx+i)*4+0]);
  1730. const Real_t* scal=( Real_t*)(precomp_data[0]+output_perm[(interac_indx+i)*4+1]);
  1731. const Real_t* v_in =( Real_t*)( buff_out +output_perm[(interac_indx+i)*4+2]);
  1732. Real_t* v_out=( Real_t*)( output_data[0]+output_perm[(interac_indx+i)*4+3]);
  1733. // TODO: Fix for dof>1
  1734. #ifdef __MIC__
  1735. {
  1736. __m512d v8;
  1737. __m512d v_old;
  1738. size_t j_start=(((uintptr_t)(v_out ) + (uintptr_t)(MEM_ALIGN-1)) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1739. size_t j_end =(((uintptr_t)(v_out+M_dim1) ) & ~ (uintptr_t)(MEM_ALIGN-1))-((uintptr_t)v_out);
  1740. j_start/=sizeof(Real_t);
  1741. j_end /=sizeof(Real_t);
  1742. assert(((uintptr_t)(v_out))%sizeof(Real_t)==0);
  1743. assert(((uintptr_t)(v_out+j_start))%64==0);
  1744. assert(((uintptr_t)(v_out+j_end ))%64==0);
  1745. size_t j=0;
  1746. for(;j<j_start;j++ ){
  1747. v_out[j]+=v_in[perm[j]]*scal[j];
  1748. }
  1749. for(;j<j_end ;j+=8){
  1750. v_old=_mm512_load_pd(v_out+j);
  1751. v8=_mm512_setr_pd(
  1752. v_in[perm[j+0]]*scal[j+0],
  1753. v_in[perm[j+1]]*scal[j+1],
  1754. v_in[perm[j+2]]*scal[j+2],
  1755. v_in[perm[j+3]]*scal[j+3],
  1756. v_in[perm[j+4]]*scal[j+4],
  1757. v_in[perm[j+5]]*scal[j+5],
  1758. v_in[perm[j+6]]*scal[j+6],
  1759. v_in[perm[j+7]]*scal[j+7]);
  1760. v_old=_mm512_add_pd(v_old, v8);
  1761. _mm512_storenrngo_pd(v_out+j,v_old);
  1762. }
  1763. for(;j<M_dim1 ;j++ ){
  1764. v_out[j]+=v_in[perm[j]]*scal[j];
  1765. }
  1766. }
  1767. #else
  1768. for(size_t j=0;j<M_dim1;j++ ){
  1769. v_out[j]+=v_in[perm[j]]*scal[j];
  1770. }
  1771. #endif
  1772. }
  1773. }
  1774. interac_indx+=vec_cnt;
  1775. interac_blk_dsp+=interac_blk[k];
  1776. }
  1777. }
  1778. if(device) MIC_Lock::release_lock(lock_idx);
  1779. }
  1780. #ifdef __INTEL_OFFLOAD
  1781. if(SYNC){
  1782. #pragma offload if(device) target(mic:0)
  1783. {if(device) MIC_Lock::wait_lock(lock_idx);}
  1784. }
  1785. #endif
  1786. Profile::Toc();
  1787. }
  1788. template <class FMMNode>
  1789. void FMM_Pts<FMMNode>::Source2UpSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  1790. if(!this->MultipoleOrder()) return;
  1791. { // Set setup_data
  1792. setup_data. level=level;
  1793. setup_data.kernel=kernel->k_s2m;
  1794. setup_data. input_data=&buff[4];
  1795. setup_data.output_data=&buff[0];
  1796. setup_data. coord_data=&buff[6];
  1797. Vector<FMMNode_t*>& nodes_in =n_list[4];
  1798. Vector<FMMNode_t*>& nodes_out=n_list[0];
  1799. setup_data.nodes_in .clear();
  1800. setup_data.nodes_out.clear();
  1801. for(size_t i=0;i<nodes_in .Dim();i++) if((nodes_in [i]->Depth()==level || level==-1) && nodes_in [i]->pt_cnt[0] && nodes_in [i]->IsLeaf() && !nodes_in [i]->IsGhost()) setup_data.nodes_in .push_back(nodes_in [i]);
  1802. for(size_t i=0;i<nodes_out.Dim();i++) if((nodes_out[i]->Depth()==level || level==-1) && nodes_out[i]->pt_cnt[0] && nodes_out[i]->IsLeaf() && !nodes_out[i]->IsGhost()) setup_data.nodes_out.push_back(nodes_out[i]);
  1803. }
  1804. struct PackedData{
  1805. size_t len;
  1806. Matrix<Real_t>* ptr;
  1807. Vector<size_t> cnt;
  1808. Vector<size_t> dsp;
  1809. };
  1810. struct InteracData{
  1811. Vector<size_t> in_node;
  1812. Vector<size_t> scal_idx;
  1813. Vector<Real_t> coord_shift;
  1814. Vector<size_t> interac_cnt;
  1815. Vector<size_t> interac_dsp;
  1816. Vector<Real_t> scal[4*MAX_DEPTH];
  1817. Matrix<Real_t> M[4];
  1818. };
  1819. struct ptSetupData{
  1820. int level;
  1821. const Kernel<Real_t>* kernel;
  1822. PackedData src_coord; // Src coord
  1823. PackedData src_value; // Src density
  1824. PackedData srf_coord; // Srf coord
  1825. PackedData srf_value; // Srf density
  1826. PackedData trg_coord; // Trg coord
  1827. PackedData trg_value; // Trg potential
  1828. InteracData interac_data;
  1829. };
  1830. ptSetupData data;
  1831. data. level=setup_data. level;
  1832. data.kernel=setup_data.kernel;
  1833. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  1834. std::vector<void*>& nodes_out=setup_data.nodes_out;
  1835. { // Set src data
  1836. std::vector<void*>& nodes=nodes_in;
  1837. PackedData& coord=data.src_coord;
  1838. PackedData& value=data.src_value;
  1839. coord.ptr=setup_data. coord_data;
  1840. value.ptr=setup_data. input_data;
  1841. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  1842. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  1843. coord.cnt.ReInit(nodes.size());
  1844. coord.dsp.ReInit(nodes.size());
  1845. value.cnt.ReInit(nodes.size());
  1846. value.dsp.ReInit(nodes.size());
  1847. #pragma omp parallel for
  1848. for(size_t i=0;i<nodes.size();i++){
  1849. ((FMMNode_t*)nodes[i])->node_id=i;
  1850. Vector<Real_t>& coord_vec=((FMMNode*)nodes[i])->src_coord;
  1851. Vector<Real_t>& value_vec=((FMMNode*)nodes[i])->src_value;
  1852. if(coord_vec.Dim()){
  1853. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  1854. assert(coord.dsp[i]<coord.len);
  1855. coord.cnt[i]=coord_vec.Dim();
  1856. }else{
  1857. coord.dsp[i]=0;
  1858. coord.cnt[i]=0;
  1859. }
  1860. if(value_vec.Dim()){
  1861. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  1862. assert(value.dsp[i]<value.len);
  1863. value.cnt[i]=value_vec.Dim();
  1864. }else{
  1865. value.dsp[i]=0;
  1866. value.cnt[i]=0;
  1867. }
  1868. }
  1869. }
  1870. { // Set srf data
  1871. std::vector<void*>& nodes=nodes_in;
  1872. PackedData& coord=data.srf_coord;
  1873. PackedData& value=data.srf_value;
  1874. coord.ptr=setup_data. coord_data;
  1875. value.ptr=setup_data. input_data;
  1876. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  1877. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  1878. coord.cnt.ReInit(nodes.size());
  1879. coord.dsp.ReInit(nodes.size());
  1880. value.cnt.ReInit(nodes.size());
  1881. value.dsp.ReInit(nodes.size());
  1882. #pragma omp parallel for
  1883. for(size_t i=0;i<nodes.size();i++){
  1884. Vector<Real_t>& coord_vec=((FMMNode*)nodes[i])->surf_coord;
  1885. Vector<Real_t>& value_vec=((FMMNode*)nodes[i])->surf_value;
  1886. if(coord_vec.Dim()){
  1887. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  1888. assert(coord.dsp[i]<coord.len);
  1889. coord.cnt[i]=coord_vec.Dim();
  1890. }else{
  1891. coord.dsp[i]=0;
  1892. coord.cnt[i]=0;
  1893. }
  1894. if(value_vec.Dim()){
  1895. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  1896. assert(value.dsp[i]<value.len);
  1897. value.cnt[i]=value_vec.Dim();
  1898. }else{
  1899. value.dsp[i]=0;
  1900. value.cnt[i]=0;
  1901. }
  1902. }
  1903. }
  1904. { // Set trg data
  1905. std::vector<void*>& nodes=nodes_out;
  1906. PackedData& coord=data.trg_coord;
  1907. PackedData& value=data.trg_value;
  1908. coord.ptr=setup_data. coord_data;
  1909. value.ptr=setup_data.output_data;
  1910. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  1911. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  1912. coord.cnt.ReInit(nodes.size());
  1913. coord.dsp.ReInit(nodes.size());
  1914. value.cnt.ReInit(nodes.size());
  1915. value.dsp.ReInit(nodes.size());
  1916. #pragma omp parallel for
  1917. for(size_t i=0;i<nodes.size();i++){
  1918. Vector<Real_t>& coord_vec=tree->upwd_check_surf[((FMMNode*)nodes[i])->Depth()];
  1919. Vector<Real_t>& value_vec=((FMMData*)((FMMNode*)nodes[i])->FMMData())->upward_equiv;
  1920. if(coord_vec.Dim()){
  1921. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  1922. assert(coord.dsp[i]<coord.len);
  1923. coord.cnt[i]=coord_vec.Dim();
  1924. }else{
  1925. coord.dsp[i]=0;
  1926. coord.cnt[i]=0;
  1927. }
  1928. if(value_vec.Dim()){
  1929. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  1930. assert(value.dsp[i]<value.len);
  1931. value.cnt[i]=value_vec.Dim();
  1932. }else{
  1933. value.dsp[i]=0;
  1934. value.cnt[i]=0;
  1935. }
  1936. }
  1937. }
  1938. { // Set interac_data
  1939. int omp_p=omp_get_max_threads();
  1940. std::vector<std::vector<size_t> > in_node_(omp_p);
  1941. std::vector<std::vector<size_t> > scal_idx_(omp_p);
  1942. std::vector<std::vector<Real_t> > coord_shift_(omp_p);
  1943. std::vector<std::vector<size_t> > interac_cnt_(omp_p);
  1944. if(this->ScaleInvar()){ // Set scal
  1945. const Kernel<Real_t>* ker=kernel->k_m2m;
  1946. for(size_t l=0;l<MAX_DEPTH;l++){ // scal[l*4+2]
  1947. Vector<Real_t>& scal=data.interac_data.scal[l*4+2];
  1948. Vector<Real_t>& scal_exp=ker->trg_scal;
  1949. scal.ReInit(scal_exp.Dim());
  1950. for(size_t i=0;i<scal.Dim();i++){
  1951. scal[i]=std::pow(2.0,-scal_exp[i]*l);
  1952. }
  1953. }
  1954. for(size_t l=0;l<MAX_DEPTH;l++){ // scal[l*4+3]
  1955. Vector<Real_t>& scal=data.interac_data.scal[l*4+3];
  1956. Vector<Real_t>& scal_exp=ker->src_scal;
  1957. scal.ReInit(scal_exp.Dim());
  1958. for(size_t i=0;i<scal.Dim();i++){
  1959. scal[i]=std::pow(2.0,-scal_exp[i]*l);
  1960. }
  1961. }
  1962. }
  1963. #pragma omp parallel for
  1964. for(size_t tid=0;tid<omp_p;tid++){
  1965. std::vector<size_t>& in_node =in_node_[tid] ;
  1966. std::vector<size_t>& scal_idx =scal_idx_[tid] ;
  1967. std::vector<Real_t>& coord_shift=coord_shift_[tid];
  1968. std::vector<size_t>& interac_cnt=interac_cnt_[tid];
  1969. size_t a=(nodes_out.size()*(tid+0))/omp_p;
  1970. size_t b=(nodes_out.size()*(tid+1))/omp_p;
  1971. for(size_t i=a;i<b;i++){
  1972. FMMNode_t* tnode=(FMMNode_t*)nodes_out[i];
  1973. Real_t s=std::pow(0.5,tnode->Depth());
  1974. size_t interac_cnt_=0;
  1975. { // S2U_Type
  1976. Mat_Type type=S2U_Type;
  1977. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  1978. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  1979. FMMNode_t* snode=intlst[j];
  1980. size_t snode_id=snode->node_id;
  1981. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  1982. in_node.push_back(snode_id);
  1983. scal_idx.push_back(snode->Depth());
  1984. { // set coord_shift
  1985. const int* rel_coord=interac_list.RelativeCoord(type,j);
  1986. const Real_t* scoord=snode->Coord();
  1987. const Real_t* tcoord=tnode->Coord();
  1988. Real_t shift[COORD_DIM];
  1989. shift[0]=rel_coord[0]*0.5*s-(scoord[0]+0.5*s)+(0+0.5*s);
  1990. shift[1]=rel_coord[1]*0.5*s-(scoord[1]+0.5*s)+(0+0.5*s);
  1991. shift[2]=rel_coord[2]*0.5*s-(scoord[2]+0.5*s)+(0+0.5*s);
  1992. coord_shift.push_back(shift[0]);
  1993. coord_shift.push_back(shift[1]);
  1994. coord_shift.push_back(shift[2]);
  1995. }
  1996. interac_cnt_++;
  1997. }
  1998. }
  1999. interac_cnt.push_back(interac_cnt_);
  2000. }
  2001. }
  2002. { // Combine interac data
  2003. InteracData& interac_data=data.interac_data;
  2004. { // in_node
  2005. typedef size_t ElemType;
  2006. std::vector<std::vector<ElemType> >& vec_=in_node_;
  2007. pvfmm::Vector<ElemType>& vec=interac_data.in_node;
  2008. std::vector<size_t> vec_dsp(omp_p+1,0);
  2009. for(size_t tid=0;tid<omp_p;tid++){
  2010. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  2011. }
  2012. vec.ReInit(vec_dsp[omp_p]);
  2013. #pragma omp parallel for
  2014. for(size_t tid=0;tid<omp_p;tid++){
  2015. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  2016. }
  2017. }
  2018. { // scal_idx
  2019. typedef size_t ElemType;
  2020. std::vector<std::vector<ElemType> >& vec_=scal_idx_;
  2021. pvfmm::Vector<ElemType>& vec=interac_data.scal_idx;
  2022. std::vector<size_t> vec_dsp(omp_p+1,0);
  2023. for(size_t tid=0;tid<omp_p;tid++){
  2024. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  2025. }
  2026. vec.ReInit(vec_dsp[omp_p]);
  2027. #pragma omp parallel for
  2028. for(size_t tid=0;tid<omp_p;tid++){
  2029. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  2030. }
  2031. }
  2032. { // coord_shift
  2033. typedef Real_t ElemType;
  2034. std::vector<std::vector<ElemType> >& vec_=coord_shift_;
  2035. pvfmm::Vector<ElemType>& vec=interac_data.coord_shift;
  2036. std::vector<size_t> vec_dsp(omp_p+1,0);
  2037. for(size_t tid=0;tid<omp_p;tid++){
  2038. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  2039. }
  2040. vec.ReInit(vec_dsp[omp_p]);
  2041. #pragma omp parallel for
  2042. for(size_t tid=0;tid<omp_p;tid++){
  2043. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  2044. }
  2045. }
  2046. { // interac_cnt
  2047. typedef size_t ElemType;
  2048. std::vector<std::vector<ElemType> >& vec_=interac_cnt_;
  2049. pvfmm::Vector<ElemType>& vec=interac_data.interac_cnt;
  2050. std::vector<size_t> vec_dsp(omp_p+1,0);
  2051. for(size_t tid=0;tid<omp_p;tid++){
  2052. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  2053. }
  2054. vec.ReInit(vec_dsp[omp_p]);
  2055. #pragma omp parallel for
  2056. for(size_t tid=0;tid<omp_p;tid++){
  2057. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  2058. }
  2059. }
  2060. { // interac_dsp
  2061. pvfmm::Vector<size_t>& cnt=interac_data.interac_cnt;
  2062. pvfmm::Vector<size_t>& dsp=interac_data.interac_dsp;
  2063. dsp.ReInit(cnt.Dim()); if(dsp.Dim()) dsp[0]=0;
  2064. omp_par::scan(&cnt[0],&dsp[0],dsp.Dim());
  2065. }
  2066. }
  2067. { // Set M[2], M[3]
  2068. InteracData& interac_data=data.interac_data;
  2069. pvfmm::Vector<size_t>& cnt=interac_data.interac_cnt;
  2070. pvfmm::Vector<size_t>& dsp=interac_data.interac_dsp;
  2071. if(cnt.Dim() && cnt[cnt.Dim()-1]+dsp[dsp.Dim()-1]){
  2072. data.interac_data.M[2]=this->mat->Mat(level, UC2UE0_Type, 0);
  2073. data.interac_data.M[3]=this->mat->Mat(level, UC2UE1_Type, 0);
  2074. }else{
  2075. data.interac_data.M[2].ReInit(0,0);
  2076. data.interac_data.M[3].ReInit(0,0);
  2077. }
  2078. }
  2079. }
  2080. PtSetup(setup_data, &data);
  2081. }
  2082. template <class FMMNode>
  2083. void FMM_Pts<FMMNode>::Source2Up(SetupData<Real_t>& setup_data, bool device){
  2084. if(!this->MultipoleOrder()) return;
  2085. //Add Source2Up contribution.
  2086. this->EvalListPts(setup_data, device);
  2087. }
  2088. template <class FMMNode>
  2089. void FMM_Pts<FMMNode>::Up2UpSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2090. if(!this->MultipoleOrder()) return;
  2091. { // Set setup_data
  2092. setup_data.level=level;
  2093. setup_data.kernel=kernel->k_m2m;
  2094. setup_data.interac_type.resize(1);
  2095. setup_data.interac_type[0]=U2U_Type;
  2096. setup_data. input_data=&buff[0];
  2097. setup_data.output_data=&buff[0];
  2098. Vector<FMMNode_t*>& nodes_in =n_list[0];
  2099. Vector<FMMNode_t*>& nodes_out=n_list[0];
  2100. setup_data.nodes_in .clear();
  2101. setup_data.nodes_out.clear();
  2102. for(size_t i=0;i<nodes_in .Dim();i++) if((nodes_in [i]->Depth()==level+1) && nodes_in [i]->pt_cnt[0]) setup_data.nodes_in .push_back(nodes_in [i]);
  2103. for(size_t i=0;i<nodes_out.Dim();i++) if((nodes_out[i]->Depth()==level ) && nodes_out[i]->pt_cnt[0]) setup_data.nodes_out.push_back(nodes_out[i]);
  2104. }
  2105. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2106. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2107. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2108. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2109. for(size_t i=0;i<nodes_in .size();i++) input_vector.push_back(&((FMMData*)((FMMNode*)nodes_in [i])->FMMData())->upward_equiv);
  2110. for(size_t i=0;i<nodes_out.size();i++) output_vector.push_back(&((FMMData*)((FMMNode*)nodes_out[i])->FMMData())->upward_equiv);
  2111. SetupInterac(setup_data,device);
  2112. }
  2113. template <class FMMNode>
  2114. void FMM_Pts<FMMNode>::Up2Up (SetupData<Real_t>& setup_data, bool device){
  2115. if(!this->MultipoleOrder()) return;
  2116. //Add Up2Up contribution.
  2117. EvalList(setup_data, device);
  2118. }
  2119. template <class FMMNode>
  2120. void FMM_Pts<FMMNode>::PeriodicBC(FMMNode* node){
  2121. if(!this->ScaleInvar() || this->MultipoleOrder()==0) return;
  2122. Matrix<Real_t>& M = Precomp(0, BC_Type, 0);
  2123. assert(node->FMMData()->upward_equiv.Dim()>0);
  2124. int dof=1;
  2125. Vector<Real_t>& upward_equiv=node->FMMData()->upward_equiv;
  2126. Vector<Real_t>& dnward_equiv=node->FMMData()->dnward_equiv;
  2127. assert(upward_equiv.Dim()==M.Dim(0)*dof);
  2128. assert(dnward_equiv.Dim()==M.Dim(1)*dof);
  2129. Matrix<Real_t> d_equiv(dof,M.Dim(0),&dnward_equiv[0],false);
  2130. Matrix<Real_t> u_equiv(dof,M.Dim(1),&upward_equiv[0],false);
  2131. Matrix<Real_t>::GEMM(d_equiv,u_equiv,M);
  2132. }
  2133. template <class FMMNode>
  2134. void FMM_Pts<FMMNode>::FFT_UpEquiv(size_t dof, size_t m, size_t ker_dim0, Vector<size_t>& fft_vec, Vector<Real_t>& fft_scal,
  2135. Vector<Real_t>& input_data, Vector<Real_t>& output_data, Vector<Real_t>& buffer_){
  2136. size_t n1=m*2;
  2137. size_t n2=n1*n1;
  2138. size_t n3=n1*n2;
  2139. size_t n3_=n2*(n1/2+1);
  2140. size_t chld_cnt=1UL<<COORD_DIM;
  2141. size_t fftsize_in =2*n3_*chld_cnt*ker_dim0*dof;
  2142. int omp_p=omp_get_max_threads();
  2143. //Load permutation map.
  2144. size_t n=6*(m-1)*(m-1)+2;
  2145. static Vector<size_t> map;
  2146. { // Build map to reorder upward_equiv
  2147. size_t n_old=map.Dim();
  2148. if(n_old!=n){
  2149. Real_t c[3]={0,0,0};
  2150. Vector<Real_t> surf=surface(m, c, (Real_t)(m-1), 0);
  2151. map.Resize(surf.Dim()/COORD_DIM);
  2152. for(size_t i=0;i<map.Dim();i++)
  2153. 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;
  2154. }
  2155. }
  2156. { // Build FFTW plan.
  2157. if(!vlist_fft_flag){
  2158. int nnn[3]={(int)n1,(int)n1,(int)n1};
  2159. void *fftw_in, *fftw_out;
  2160. fftw_in = mem::aligned_new<Real_t>( n3 *ker_dim0*chld_cnt);
  2161. fftw_out = mem::aligned_new<Real_t>(2*n3_*ker_dim0*chld_cnt);
  2162. vlist_fftplan = FFTW_t<Real_t>::fft_plan_many_dft_r2c(COORD_DIM,nnn,ker_dim0*chld_cnt,
  2163. (Real_t*)fftw_in, NULL, 1, n3, (typename FFTW_t<Real_t>::cplx*)(fftw_out),NULL, 1, n3_);
  2164. mem::aligned_delete<Real_t>((Real_t*)fftw_in );
  2165. mem::aligned_delete<Real_t>((Real_t*)fftw_out);
  2166. vlist_fft_flag=true;
  2167. }
  2168. }
  2169. { // Offload section
  2170. size_t n_in = fft_vec.Dim();
  2171. #pragma omp parallel for
  2172. for(int pid=0; pid<omp_p; pid++){
  2173. size_t node_start=(n_in*(pid ))/omp_p;
  2174. size_t node_end =(n_in*(pid+1))/omp_p;
  2175. Vector<Real_t> buffer(fftsize_in, &buffer_[fftsize_in*pid], false);
  2176. for(size_t node_idx=node_start; node_idx<node_end; node_idx++){
  2177. Matrix<Real_t> upward_equiv(chld_cnt,n*ker_dim0*dof,&input_data[0] + fft_vec[node_idx],false);
  2178. Vector<Real_t> upward_equiv_fft(fftsize_in, &output_data[fftsize_in *node_idx], false);
  2179. upward_equiv_fft.SetZero();
  2180. // Rearrange upward equivalent data.
  2181. for(size_t k=0;k<n;k++){
  2182. size_t idx=map[k];
  2183. for(int j1=0;j1<dof;j1++)
  2184. for(int j0=0;j0<(int)chld_cnt;j0++)
  2185. for(int i=0;i<ker_dim0;i++)
  2186. upward_equiv_fft[idx+(j0+(i+j1*ker_dim0)*chld_cnt)*n3]=upward_equiv[j0][ker_dim0*(n*j1+k)+i]*fft_scal[ker_dim0*node_idx+i];
  2187. }
  2188. // Compute FFT.
  2189. for(int i=0;i<dof;i++)
  2190. FFTW_t<Real_t>::fft_execute_dft_r2c(vlist_fftplan, (Real_t*)&upward_equiv_fft[i* n3 *ker_dim0*chld_cnt],
  2191. (typename FFTW_t<Real_t>::cplx*)&buffer [i*2*n3_*ker_dim0*chld_cnt]);
  2192. //Compute flops.
  2193. #ifndef FFTW3_MKL
  2194. double add, mul, fma;
  2195. FFTW_t<Real_t>::fftw_flops(vlist_fftplan, &add, &mul, &fma);
  2196. #ifndef __INTEL_OFFLOAD0
  2197. Profile::Add_FLOP((long long)(add+mul+2*fma));
  2198. #endif
  2199. #endif
  2200. for(int i=0;i<ker_dim0*dof;i++)
  2201. for(size_t j=0;j<n3_;j++)
  2202. for(size_t k=0;k<chld_cnt;k++){
  2203. upward_equiv_fft[2*(chld_cnt*(n3_*i+j)+k)+0]=buffer[2*(n3_*(chld_cnt*i+k)+j)+0];
  2204. upward_equiv_fft[2*(chld_cnt*(n3_*i+j)+k)+1]=buffer[2*(n3_*(chld_cnt*i+k)+j)+1];
  2205. }
  2206. }
  2207. }
  2208. }
  2209. }
  2210. template <class FMMNode>
  2211. void FMM_Pts<FMMNode>::FFT_Check2Equiv(size_t dof, size_t m, size_t ker_dim1, Vector<size_t>& ifft_vec, Vector<Real_t>& ifft_scal,
  2212. Vector<Real_t>& input_data, Vector<Real_t>& output_data, Vector<Real_t>& buffer_){
  2213. size_t n1=m*2;
  2214. size_t n2=n1*n1;
  2215. size_t n3=n1*n2;
  2216. size_t n3_=n2*(n1/2+1);
  2217. size_t chld_cnt=1UL<<COORD_DIM;
  2218. size_t fftsize_out=2*n3_*dof*ker_dim1*chld_cnt;
  2219. int omp_p=omp_get_max_threads();
  2220. //Load permutation map.
  2221. size_t n=6*(m-1)*(m-1)+2;
  2222. static Vector<size_t> map;
  2223. { // Build map to reorder dnward_check
  2224. size_t n_old=map.Dim();
  2225. if(n_old!=n){
  2226. Real_t c[3]={0,0,0};
  2227. Vector<Real_t> surf=surface(m, c, (Real_t)(m-1), 0);
  2228. map.Resize(surf.Dim()/COORD_DIM);
  2229. for(size_t i=0;i<map.Dim();i++)
  2230. 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;
  2231. //map;//.AllocDevice(true);
  2232. }
  2233. }
  2234. { // Build FFTW plan.
  2235. if(!vlist_ifft_flag){
  2236. //Build FFTW plan.
  2237. int nnn[3]={(int)n1,(int)n1,(int)n1};
  2238. Real_t *fftw_in, *fftw_out;
  2239. fftw_in = mem::aligned_new<Real_t>(2*n3_*ker_dim1*chld_cnt);
  2240. fftw_out = mem::aligned_new<Real_t>( n3 *ker_dim1*chld_cnt);
  2241. vlist_ifftplan = FFTW_t<Real_t>::fft_plan_many_dft_c2r(COORD_DIM,nnn,ker_dim1*chld_cnt,
  2242. (typename FFTW_t<Real_t>::cplx*)fftw_in, NULL, 1, n3_, (Real_t*)(fftw_out),NULL, 1, n3);
  2243. mem::aligned_delete<Real_t>(fftw_in);
  2244. mem::aligned_delete<Real_t>(fftw_out);
  2245. vlist_ifft_flag=true;
  2246. }
  2247. }
  2248. { // Offload section
  2249. assert(buffer_.Dim()>=2*fftsize_out*omp_p);
  2250. size_t n_out=ifft_vec.Dim();
  2251. #pragma omp parallel for
  2252. for(int pid=0; pid<omp_p; pid++){
  2253. size_t node_start=(n_out*(pid ))/omp_p;
  2254. size_t node_end =(n_out*(pid+1))/omp_p;
  2255. Vector<Real_t> buffer0(fftsize_out, &buffer_[fftsize_out*(2*pid+0)], false);
  2256. Vector<Real_t> buffer1(fftsize_out, &buffer_[fftsize_out*(2*pid+1)], false);
  2257. for(size_t node_idx=node_start; node_idx<node_end; node_idx++){
  2258. Vector<Real_t> dnward_check_fft(fftsize_out, &input_data[fftsize_out*node_idx], false);
  2259. Vector<Real_t> dnward_equiv(ker_dim1*n*dof*chld_cnt,&output_data[0] + ifft_vec[node_idx],false);
  2260. //De-interleave data.
  2261. for(int i=0;i<ker_dim1*dof;i++)
  2262. for(size_t j=0;j<n3_;j++)
  2263. for(size_t k=0;k<chld_cnt;k++){
  2264. buffer0[2*(n3_*(ker_dim1*dof*k+i)+j)+0]=dnward_check_fft[2*(chld_cnt*(n3_*i+j)+k)+0];
  2265. buffer0[2*(n3_*(ker_dim1*dof*k+i)+j)+1]=dnward_check_fft[2*(chld_cnt*(n3_*i+j)+k)+1];
  2266. }
  2267. // Compute FFT.
  2268. for(int i=0;i<dof;i++)
  2269. FFTW_t<Real_t>::fft_execute_dft_c2r(vlist_ifftplan, (typename FFTW_t<Real_t>::cplx*)&buffer0[i*2*n3_*ker_dim1*chld_cnt],
  2270. (Real_t*)&buffer1[i* n3 *ker_dim1*chld_cnt]);
  2271. //Compute flops.
  2272. #ifndef FFTW3_MKL
  2273. double add, mul, fma;
  2274. FFTW_t<Real_t>::fftw_flops(vlist_ifftplan, &add, &mul, &fma);
  2275. #ifndef __INTEL_OFFLOAD0
  2276. Profile::Add_FLOP((long long)(add+mul+2*fma)*dof);
  2277. #endif
  2278. #endif
  2279. // Rearrange downward check data.
  2280. for(size_t k=0;k<n;k++){
  2281. size_t idx=map[k];
  2282. for(int j1=0;j1<dof;j1++)
  2283. for(int j0=0;j0<(int)chld_cnt;j0++)
  2284. for(int i=0;i<ker_dim1;i++)
  2285. dnward_equiv[ker_dim1*(n*(dof*j0+j1)+k)+i]+=buffer1[idx+(i+(j1+j0*dof)*ker_dim1)*n3]*ifft_scal[ker_dim1*node_idx+i];
  2286. }
  2287. }
  2288. }
  2289. }
  2290. }
  2291. template<class Real_t>
  2292. inline void matmult_8x8x2(Real_t*& M_, Real_t*& IN0, Real_t*& IN1, Real_t*& OUT0, Real_t*& OUT1){
  2293. // Generic code.
  2294. Real_t out_reg000, out_reg001, out_reg010, out_reg011;
  2295. Real_t out_reg100, out_reg101, out_reg110, out_reg111;
  2296. Real_t in_reg000, in_reg001, in_reg010, in_reg011;
  2297. Real_t in_reg100, in_reg101, in_reg110, in_reg111;
  2298. Real_t m_reg000, m_reg001, m_reg010, m_reg011;
  2299. Real_t m_reg100, m_reg101, m_reg110, m_reg111;
  2300. //#pragma unroll
  2301. for(int i1=0;i1<8;i1+=2){
  2302. Real_t* IN0_=IN0;
  2303. Real_t* IN1_=IN1;
  2304. out_reg000=OUT0[ 0]; out_reg001=OUT0[ 1];
  2305. out_reg010=OUT0[ 2]; out_reg011=OUT0[ 3];
  2306. out_reg100=OUT1[ 0]; out_reg101=OUT1[ 1];
  2307. out_reg110=OUT1[ 2]; out_reg111=OUT1[ 3];
  2308. //#pragma unroll
  2309. for(int i2=0;i2<8;i2+=2){
  2310. m_reg000=M_[ 0]; m_reg001=M_[ 1];
  2311. m_reg010=M_[ 2]; m_reg011=M_[ 3];
  2312. m_reg100=M_[16]; m_reg101=M_[17];
  2313. m_reg110=M_[18]; m_reg111=M_[19];
  2314. in_reg000=IN0_[0]; in_reg001=IN0_[1];
  2315. in_reg010=IN0_[2]; in_reg011=IN0_[3];
  2316. in_reg100=IN1_[0]; in_reg101=IN1_[1];
  2317. in_reg110=IN1_[2]; in_reg111=IN1_[3];
  2318. out_reg000 += m_reg000*in_reg000 - m_reg001*in_reg001;
  2319. out_reg001 += m_reg000*in_reg001 + m_reg001*in_reg000;
  2320. out_reg010 += m_reg010*in_reg000 - m_reg011*in_reg001;
  2321. out_reg011 += m_reg010*in_reg001 + m_reg011*in_reg000;
  2322. out_reg000 += m_reg100*in_reg010 - m_reg101*in_reg011;
  2323. out_reg001 += m_reg100*in_reg011 + m_reg101*in_reg010;
  2324. out_reg010 += m_reg110*in_reg010 - m_reg111*in_reg011;
  2325. out_reg011 += m_reg110*in_reg011 + m_reg111*in_reg010;
  2326. out_reg100 += m_reg000*in_reg100 - m_reg001*in_reg101;
  2327. out_reg101 += m_reg000*in_reg101 + m_reg001*in_reg100;
  2328. out_reg110 += m_reg010*in_reg100 - m_reg011*in_reg101;
  2329. out_reg111 += m_reg010*in_reg101 + m_reg011*in_reg100;
  2330. out_reg100 += m_reg100*in_reg110 - m_reg101*in_reg111;
  2331. out_reg101 += m_reg100*in_reg111 + m_reg101*in_reg110;
  2332. out_reg110 += m_reg110*in_reg110 - m_reg111*in_reg111;
  2333. out_reg111 += m_reg110*in_reg111 + m_reg111*in_reg110;
  2334. M_+=32; // Jump to (column+2).
  2335. IN0_+=4;
  2336. IN1_+=4;
  2337. }
  2338. OUT0[ 0]=out_reg000; OUT0[ 1]=out_reg001;
  2339. OUT0[ 2]=out_reg010; OUT0[ 3]=out_reg011;
  2340. OUT1[ 0]=out_reg100; OUT1[ 1]=out_reg101;
  2341. OUT1[ 2]=out_reg110; OUT1[ 3]=out_reg111;
  2342. M_+=4-64*2; // Jump back to first column (row+2).
  2343. OUT0+=4;
  2344. OUT1+=4;
  2345. }
  2346. }
  2347. #if defined(__AVX__) || defined(__SSE3__)
  2348. template<>
  2349. inline void matmult_8x8x2<double>(double*& M_, double*& IN0, double*& IN1, double*& OUT0, double*& OUT1){
  2350. #ifdef __AVX__ //AVX code.
  2351. __m256d out00,out01,out10,out11;
  2352. __m256d out20,out21,out30,out31;
  2353. double* in0__ = IN0;
  2354. double* in1__ = IN1;
  2355. out00 = _mm256_load_pd(OUT0);
  2356. out01 = _mm256_load_pd(OUT1);
  2357. out10 = _mm256_load_pd(OUT0+4);
  2358. out11 = _mm256_load_pd(OUT1+4);
  2359. out20 = _mm256_load_pd(OUT0+8);
  2360. out21 = _mm256_load_pd(OUT1+8);
  2361. out30 = _mm256_load_pd(OUT0+12);
  2362. out31 = _mm256_load_pd(OUT1+12);
  2363. for(int i2=0;i2<8;i2+=2){
  2364. __m256d m00;
  2365. __m256d ot00;
  2366. __m256d mt0,mtt0;
  2367. __m256d in00,in00_r,in01,in01_r;
  2368. in00 = _mm256_broadcast_pd((const __m128d*)in0__);
  2369. in00_r = _mm256_permute_pd(in00,5);
  2370. in01 = _mm256_broadcast_pd((const __m128d*)in1__);
  2371. in01_r = _mm256_permute_pd(in01,5);
  2372. m00 = _mm256_load_pd(M_);
  2373. mt0 = _mm256_unpacklo_pd(m00,m00);
  2374. ot00 = _mm256_mul_pd(mt0,in00);
  2375. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2376. out00 = _mm256_add_pd(out00,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2377. ot00 = _mm256_mul_pd(mt0,in01);
  2378. out01 = _mm256_add_pd(out01,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2379. m00 = _mm256_load_pd(M_+4);
  2380. mt0 = _mm256_unpacklo_pd(m00,m00);
  2381. ot00 = _mm256_mul_pd(mt0,in00);
  2382. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2383. out10 = _mm256_add_pd(out10,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2384. ot00 = _mm256_mul_pd(mt0,in01);
  2385. out11 = _mm256_add_pd(out11,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2386. m00 = _mm256_load_pd(M_+8);
  2387. mt0 = _mm256_unpacklo_pd(m00,m00);
  2388. ot00 = _mm256_mul_pd(mt0,in00);
  2389. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2390. out20 = _mm256_add_pd(out20,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2391. ot00 = _mm256_mul_pd(mt0,in01);
  2392. out21 = _mm256_add_pd(out21,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2393. m00 = _mm256_load_pd(M_+12);
  2394. mt0 = _mm256_unpacklo_pd(m00,m00);
  2395. ot00 = _mm256_mul_pd(mt0,in00);
  2396. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2397. out30 = _mm256_add_pd(out30,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2398. ot00 = _mm256_mul_pd(mt0,in01);
  2399. out31 = _mm256_add_pd(out31,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2400. in00 = _mm256_broadcast_pd((const __m128d*) (in0__+2));
  2401. in00_r = _mm256_permute_pd(in00,5);
  2402. in01 = _mm256_broadcast_pd((const __m128d*) (in1__+2));
  2403. in01_r = _mm256_permute_pd(in01,5);
  2404. m00 = _mm256_load_pd(M_+16);
  2405. mt0 = _mm256_unpacklo_pd(m00,m00);
  2406. ot00 = _mm256_mul_pd(mt0,in00);
  2407. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2408. out00 = _mm256_add_pd(out00,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2409. ot00 = _mm256_mul_pd(mt0,in01);
  2410. out01 = _mm256_add_pd(out01,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2411. m00 = _mm256_load_pd(M_+20);
  2412. mt0 = _mm256_unpacklo_pd(m00,m00);
  2413. ot00 = _mm256_mul_pd(mt0,in00);
  2414. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2415. out10 = _mm256_add_pd(out10,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2416. ot00 = _mm256_mul_pd(mt0,in01);
  2417. out11 = _mm256_add_pd(out11,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2418. m00 = _mm256_load_pd(M_+24);
  2419. mt0 = _mm256_unpacklo_pd(m00,m00);
  2420. ot00 = _mm256_mul_pd(mt0,in00);
  2421. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2422. out20 = _mm256_add_pd(out20,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2423. ot00 = _mm256_mul_pd(mt0,in01);
  2424. out21 = _mm256_add_pd(out21,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2425. m00 = _mm256_load_pd(M_+28);
  2426. mt0 = _mm256_unpacklo_pd(m00,m00);
  2427. ot00 = _mm256_mul_pd(mt0,in00);
  2428. mtt0 = _mm256_unpackhi_pd(m00,m00);
  2429. out30 = _mm256_add_pd(out30,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in00_r)));
  2430. ot00 = _mm256_mul_pd(mt0,in01);
  2431. out31 = _mm256_add_pd(out31,_mm256_addsub_pd(ot00,_mm256_mul_pd(mtt0,in01_r)));
  2432. M_ += 32;
  2433. in0__ += 4;
  2434. in1__ += 4;
  2435. }
  2436. _mm256_store_pd(OUT0,out00);
  2437. _mm256_store_pd(OUT1,out01);
  2438. _mm256_store_pd(OUT0+4,out10);
  2439. _mm256_store_pd(OUT1+4,out11);
  2440. _mm256_store_pd(OUT0+8,out20);
  2441. _mm256_store_pd(OUT1+8,out21);
  2442. _mm256_store_pd(OUT0+12,out30);
  2443. _mm256_store_pd(OUT1+12,out31);
  2444. #elif defined __SSE3__ // SSE code.
  2445. __m128d out00, out01, out10, out11;
  2446. __m128d in00, in01, in10, in11;
  2447. __m128d m00, m01, m10, m11;
  2448. //#pragma unroll
  2449. for(int i1=0;i1<8;i1+=2){
  2450. double* IN0_=IN0;
  2451. double* IN1_=IN1;
  2452. out00 =_mm_load_pd (OUT0 );
  2453. out10 =_mm_load_pd (OUT0+2);
  2454. out01 =_mm_load_pd (OUT1 );
  2455. out11 =_mm_load_pd (OUT1+2);
  2456. //#pragma unroll
  2457. for(int i2=0;i2<8;i2+=2){
  2458. m00 =_mm_load1_pd (M_ );
  2459. m10 =_mm_load1_pd (M_+ 2);
  2460. m01 =_mm_load1_pd (M_+16);
  2461. m11 =_mm_load1_pd (M_+18);
  2462. in00 =_mm_load_pd (IN0_ );
  2463. in10 =_mm_load_pd (IN0_+2);
  2464. in01 =_mm_load_pd (IN1_ );
  2465. in11 =_mm_load_pd (IN1_+2);
  2466. out00 = _mm_add_pd (out00, _mm_mul_pd(m00 , in00 ));
  2467. out00 = _mm_add_pd (out00, _mm_mul_pd(m01 , in10 ));
  2468. out01 = _mm_add_pd (out01, _mm_mul_pd(m00 , in01 ));
  2469. out01 = _mm_add_pd (out01, _mm_mul_pd(m01 , in11 ));
  2470. out10 = _mm_add_pd (out10, _mm_mul_pd(m10 , in00 ));
  2471. out10 = _mm_add_pd (out10, _mm_mul_pd(m11 , in10 ));
  2472. out11 = _mm_add_pd (out11, _mm_mul_pd(m10 , in01 ));
  2473. out11 = _mm_add_pd (out11, _mm_mul_pd(m11 , in11 ));
  2474. m00 =_mm_load1_pd (M_+ 1);
  2475. m10 =_mm_load1_pd (M_+ 2+1);
  2476. m01 =_mm_load1_pd (M_+16+1);
  2477. m11 =_mm_load1_pd (M_+18+1);
  2478. in00 =_mm_shuffle_pd (in00,in00,_MM_SHUFFLE2(0,1));
  2479. in01 =_mm_shuffle_pd (in01,in01,_MM_SHUFFLE2(0,1));
  2480. in10 =_mm_shuffle_pd (in10,in10,_MM_SHUFFLE2(0,1));
  2481. in11 =_mm_shuffle_pd (in11,in11,_MM_SHUFFLE2(0,1));
  2482. out00 = _mm_addsub_pd(out00, _mm_mul_pd(m00, in00));
  2483. out00 = _mm_addsub_pd(out00, _mm_mul_pd(m01, in10));
  2484. out01 = _mm_addsub_pd(out01, _mm_mul_pd(m00, in01));
  2485. out01 = _mm_addsub_pd(out01, _mm_mul_pd(m01, in11));
  2486. out10 = _mm_addsub_pd(out10, _mm_mul_pd(m10, in00));
  2487. out10 = _mm_addsub_pd(out10, _mm_mul_pd(m11, in10));
  2488. out11 = _mm_addsub_pd(out11, _mm_mul_pd(m10, in01));
  2489. out11 = _mm_addsub_pd(out11, _mm_mul_pd(m11, in11));
  2490. M_+=32; // Jump to (column+2).
  2491. IN0_+=4;
  2492. IN1_+=4;
  2493. }
  2494. _mm_store_pd (OUT0 ,out00);
  2495. _mm_store_pd (OUT0+2,out10);
  2496. _mm_store_pd (OUT1 ,out01);
  2497. _mm_store_pd (OUT1+2,out11);
  2498. M_+=4-64*2; // Jump back to first column (row+2).
  2499. OUT0+=4;
  2500. OUT1+=4;
  2501. }
  2502. #endif
  2503. }
  2504. #endif
  2505. #if defined(__SSE3__)
  2506. template<>
  2507. inline void matmult_8x8x2<float>(float*& M_, float*& IN0, float*& IN1, float*& OUT0, float*& OUT1){
  2508. #if defined __SSE3__ // SSE code.
  2509. __m128 out00,out01,out10,out11;
  2510. __m128 out20,out21,out30,out31;
  2511. float* in0__ = IN0;
  2512. float* in1__ = IN1;
  2513. out00 = _mm_load_ps(OUT0);
  2514. out01 = _mm_load_ps(OUT1);
  2515. out10 = _mm_load_ps(OUT0+4);
  2516. out11 = _mm_load_ps(OUT1+4);
  2517. out20 = _mm_load_ps(OUT0+8);
  2518. out21 = _mm_load_ps(OUT1+8);
  2519. out30 = _mm_load_ps(OUT0+12);
  2520. out31 = _mm_load_ps(OUT1+12);
  2521. for(int i2=0;i2<8;i2+=2){
  2522. __m128 m00;
  2523. __m128 mt0,mtt0;
  2524. __m128 in00,in00_r,in01,in01_r;
  2525. in00 = _mm_castpd_ps(_mm_load_pd1((const double*)in0__));
  2526. in00_r = _mm_shuffle_ps(in00,in00,_MM_SHUFFLE(2,3,0,1));
  2527. in01 = _mm_castpd_ps(_mm_load_pd1((const double*)in1__));
  2528. in01_r = _mm_shuffle_ps(in01,in01,_MM_SHUFFLE(2,3,0,1));
  2529. m00 = _mm_load_ps(M_);
  2530. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2531. out00= _mm_add_ps (out00,_mm_mul_ps( mt0,in00 ));
  2532. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2533. out00= _mm_addsub_ps(out00,_mm_mul_ps(mtt0,in00_r));
  2534. out01 = _mm_add_ps (out01,_mm_mul_ps( mt0,in01 ));
  2535. out01 = _mm_addsub_ps(out01,_mm_mul_ps(mtt0,in01_r));
  2536. m00 = _mm_load_ps(M_+4);
  2537. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2538. out10= _mm_add_ps (out10,_mm_mul_ps( mt0,in00 ));
  2539. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2540. out10= _mm_addsub_ps(out10,_mm_mul_ps(mtt0,in00_r));
  2541. out11 = _mm_add_ps (out11,_mm_mul_ps( mt0,in01 ));
  2542. out11 = _mm_addsub_ps(out11,_mm_mul_ps(mtt0,in01_r));
  2543. m00 = _mm_load_ps(M_+8);
  2544. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2545. out20= _mm_add_ps (out20,_mm_mul_ps( mt0,in00 ));
  2546. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2547. out20= _mm_addsub_ps(out20,_mm_mul_ps(mtt0,in00_r));
  2548. out21 = _mm_add_ps (out21,_mm_mul_ps( mt0,in01 ));
  2549. out21 = _mm_addsub_ps(out21,_mm_mul_ps(mtt0,in01_r));
  2550. m00 = _mm_load_ps(M_+12);
  2551. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2552. out30= _mm_add_ps (out30,_mm_mul_ps( mt0, in00));
  2553. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2554. out30= _mm_addsub_ps(out30,_mm_mul_ps(mtt0,in00_r));
  2555. out31 = _mm_add_ps (out31,_mm_mul_ps( mt0,in01 ));
  2556. out31 = _mm_addsub_ps(out31,_mm_mul_ps(mtt0,in01_r));
  2557. in00 = _mm_castpd_ps(_mm_load_pd1((const double*) (in0__+2)));
  2558. in00_r = _mm_shuffle_ps(in00,in00,_MM_SHUFFLE(2,3,0,1));
  2559. in01 = _mm_castpd_ps(_mm_load_pd1((const double*) (in1__+2)));
  2560. in01_r = _mm_shuffle_ps(in01,in01,_MM_SHUFFLE(2,3,0,1));
  2561. m00 = _mm_load_ps(M_+16);
  2562. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2563. out00= _mm_add_ps (out00,_mm_mul_ps( mt0,in00 ));
  2564. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2565. out00= _mm_addsub_ps(out00,_mm_mul_ps(mtt0,in00_r));
  2566. out01 = _mm_add_ps (out01,_mm_mul_ps( mt0,in01 ));
  2567. out01 = _mm_addsub_ps(out01,_mm_mul_ps(mtt0,in01_r));
  2568. m00 = _mm_load_ps(M_+20);
  2569. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2570. out10= _mm_add_ps (out10,_mm_mul_ps( mt0,in00 ));
  2571. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2572. out10= _mm_addsub_ps(out10,_mm_mul_ps(mtt0,in00_r));
  2573. out11 = _mm_add_ps (out11,_mm_mul_ps( mt0,in01 ));
  2574. out11 = _mm_addsub_ps(out11,_mm_mul_ps(mtt0,in01_r));
  2575. m00 = _mm_load_ps(M_+24);
  2576. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2577. out20= _mm_add_ps (out20,_mm_mul_ps( mt0,in00 ));
  2578. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2579. out20= _mm_addsub_ps(out20,_mm_mul_ps(mtt0,in00_r));
  2580. out21 = _mm_add_ps (out21,_mm_mul_ps( mt0,in01 ));
  2581. out21 = _mm_addsub_ps(out21,_mm_mul_ps(mtt0,in01_r));
  2582. m00 = _mm_load_ps(M_+28);
  2583. mt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(2,2,0,0));
  2584. out30= _mm_add_ps (out30,_mm_mul_ps( mt0,in00 ));
  2585. mtt0 = _mm_shuffle_ps(m00,m00,_MM_SHUFFLE(3,3,1,1));
  2586. out30= _mm_addsub_ps(out30,_mm_mul_ps(mtt0,in00_r));
  2587. out31 = _mm_add_ps (out31,_mm_mul_ps( mt0,in01 ));
  2588. out31 = _mm_addsub_ps(out31,_mm_mul_ps(mtt0,in01_r));
  2589. M_ += 32;
  2590. in0__ += 4;
  2591. in1__ += 4;
  2592. }
  2593. _mm_store_ps(OUT0,out00);
  2594. _mm_store_ps(OUT1,out01);
  2595. _mm_store_ps(OUT0+4,out10);
  2596. _mm_store_ps(OUT1+4,out11);
  2597. _mm_store_ps(OUT0+8,out20);
  2598. _mm_store_ps(OUT1+8,out21);
  2599. _mm_store_ps(OUT0+12,out30);
  2600. _mm_store_ps(OUT1+12,out31);
  2601. #endif
  2602. }
  2603. #endif
  2604. template <class Real_t>
  2605. void VListHadamard(size_t dof, size_t M_dim, size_t ker_dim0, size_t ker_dim1, Vector<size_t>& interac_dsp,
  2606. Vector<size_t>& interac_vec, Vector<Real_t*>& precomp_mat, Vector<Real_t>& fft_in, Vector<Real_t>& fft_out){
  2607. size_t chld_cnt=1UL<<COORD_DIM;
  2608. size_t fftsize_in =M_dim*ker_dim0*chld_cnt*2;
  2609. size_t fftsize_out=M_dim*ker_dim1*chld_cnt*2;
  2610. Real_t* zero_vec0=mem::aligned_new<Real_t>(fftsize_in );
  2611. Real_t* zero_vec1=mem::aligned_new<Real_t>(fftsize_out);
  2612. size_t n_out=fft_out.Dim()/fftsize_out;
  2613. // Set buff_out to zero.
  2614. #pragma omp parallel for
  2615. for(size_t k=0;k<n_out;k++){
  2616. Vector<Real_t> dnward_check_fft(fftsize_out, &fft_out[k*fftsize_out], false);
  2617. dnward_check_fft.SetZero();
  2618. }
  2619. // Build list of interaction pairs (in, out vectors).
  2620. size_t mat_cnt=precomp_mat.Dim();
  2621. size_t blk1_cnt=interac_dsp.Dim()/mat_cnt;
  2622. const size_t V_BLK_SIZE=V_BLK_CACHE*64/sizeof(Real_t);
  2623. Real_t** IN_ =mem::aligned_new<Real_t*>(2*V_BLK_SIZE*blk1_cnt*mat_cnt);
  2624. Real_t** OUT_=mem::aligned_new<Real_t*>(2*V_BLK_SIZE*blk1_cnt*mat_cnt);
  2625. #pragma omp parallel for
  2626. for(size_t interac_blk1=0; interac_blk1<blk1_cnt*mat_cnt; interac_blk1++){
  2627. size_t interac_dsp0 = (interac_blk1==0?0:interac_dsp[interac_blk1-1]);
  2628. size_t interac_dsp1 = interac_dsp[interac_blk1 ] ;
  2629. size_t interac_cnt = interac_dsp1-interac_dsp0;
  2630. for(size_t j=0;j<interac_cnt;j++){
  2631. IN_ [2*V_BLK_SIZE*interac_blk1 +j]=&fft_in [interac_vec[(interac_dsp0+j)*2+0]];
  2632. OUT_[2*V_BLK_SIZE*interac_blk1 +j]=&fft_out[interac_vec[(interac_dsp0+j)*2+1]];
  2633. }
  2634. IN_ [2*V_BLK_SIZE*interac_blk1 +interac_cnt]=zero_vec0;
  2635. OUT_[2*V_BLK_SIZE*interac_blk1 +interac_cnt]=zero_vec1;
  2636. }
  2637. int omp_p=omp_get_max_threads();
  2638. #pragma omp parallel for
  2639. for(int pid=0; pid<omp_p; pid++){
  2640. size_t a=( pid *M_dim)/omp_p;
  2641. size_t b=((pid+1)*M_dim)/omp_p;
  2642. for(int in_dim=0;in_dim<ker_dim0;in_dim++)
  2643. for(int ot_dim=0;ot_dim<ker_dim1;ot_dim++)
  2644. for(size_t blk1=0; blk1<blk1_cnt; blk1++)
  2645. for(size_t k=a; k< b; k++)
  2646. for(size_t mat_indx=0; mat_indx< mat_cnt;mat_indx++){
  2647. size_t interac_blk1 = blk1*mat_cnt+mat_indx;
  2648. size_t interac_dsp0 = (interac_blk1==0?0:interac_dsp[interac_blk1-1]);
  2649. size_t interac_dsp1 = interac_dsp[interac_blk1 ] ;
  2650. size_t interac_cnt = interac_dsp1-interac_dsp0;
  2651. Real_t** IN = IN_ + 2*V_BLK_SIZE*interac_blk1;
  2652. Real_t** OUT= OUT_+ 2*V_BLK_SIZE*interac_blk1;
  2653. Real_t* M = precomp_mat[mat_indx] + k*chld_cnt*chld_cnt*2 + (ot_dim+in_dim*ker_dim1)*M_dim*128;
  2654. {
  2655. for(size_t j=0;j<interac_cnt;j+=2){
  2656. Real_t* M_ = M;
  2657. Real_t* IN0 = IN [j+0] + (in_dim*M_dim+k)*chld_cnt*2;
  2658. Real_t* IN1 = IN [j+1] + (in_dim*M_dim+k)*chld_cnt*2;
  2659. Real_t* OUT0 = OUT[j+0] + (ot_dim*M_dim+k)*chld_cnt*2;
  2660. Real_t* OUT1 = OUT[j+1] + (ot_dim*M_dim+k)*chld_cnt*2;
  2661. #ifdef __SSE__
  2662. if (j+2 < interac_cnt) { // Prefetch
  2663. _mm_prefetch(((char *)(IN[j+2] + (in_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  2664. _mm_prefetch(((char *)(IN[j+2] + (in_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  2665. _mm_prefetch(((char *)(IN[j+3] + (in_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  2666. _mm_prefetch(((char *)(IN[j+3] + (in_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  2667. _mm_prefetch(((char *)(OUT[j+2] + (ot_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  2668. _mm_prefetch(((char *)(OUT[j+2] + (ot_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  2669. _mm_prefetch(((char *)(OUT[j+3] + (ot_dim*M_dim+k)*chld_cnt*2)), _MM_HINT_T0);
  2670. _mm_prefetch(((char *)(OUT[j+3] + (ot_dim*M_dim+k)*chld_cnt*2) + 64), _MM_HINT_T0);
  2671. }
  2672. #endif
  2673. matmult_8x8x2(M_, IN0, IN1, OUT0, OUT1);
  2674. }
  2675. }
  2676. }
  2677. }
  2678. // Compute flops.
  2679. {
  2680. Profile::Add_FLOP(8*8*8*(interac_vec.Dim()/2)*M_dim*ker_dim0*ker_dim1*dof);
  2681. }
  2682. // Free memory
  2683. mem::aligned_delete<Real_t*>(IN_ );
  2684. mem::aligned_delete<Real_t*>(OUT_);
  2685. mem::aligned_delete<Real_t>(zero_vec0);
  2686. mem::aligned_delete<Real_t>(zero_vec1);
  2687. }
  2688. template <class FMMNode>
  2689. void FMM_Pts<FMMNode>::V_ListSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  2690. if(!this->MultipoleOrder()) return;
  2691. if(level==0) return;
  2692. { // Set setup_data
  2693. setup_data.level=level;
  2694. setup_data.kernel=kernel->k_m2l;
  2695. setup_data.interac_type.resize(1);
  2696. setup_data.interac_type[0]=V1_Type;
  2697. setup_data. input_data=&buff[0];
  2698. setup_data.output_data=&buff[1];
  2699. Vector<FMMNode_t*>& nodes_in =n_list[2];
  2700. Vector<FMMNode_t*>& nodes_out=n_list[3];
  2701. setup_data.nodes_in .clear();
  2702. setup_data.nodes_out.clear();
  2703. for(size_t i=0;i<nodes_in .Dim();i++) if((nodes_in [i]->Depth()==level-1 || level==-1) && nodes_in [i]->pt_cnt[0]) setup_data.nodes_in .push_back(nodes_in [i]);
  2704. for(size_t i=0;i<nodes_out.Dim();i++) if((nodes_out[i]->Depth()==level-1 || level==-1) && nodes_out[i]->pt_cnt[1]) setup_data.nodes_out.push_back(nodes_out[i]);
  2705. }
  2706. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  2707. std::vector<void*>& nodes_out=setup_data.nodes_out;
  2708. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  2709. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  2710. 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);
  2711. 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);
  2712. /////////////////////////////////////////////////////////////////////////////
  2713. Real_t eps=1e-10;
  2714. size_t n_in =nodes_in .size();
  2715. size_t n_out=nodes_out.size();
  2716. // Setup precomputed data.
  2717. //if(setup_data.precomp_data->Dim(0)*setup_data.precomp_data->Dim(1)==0) SetupPrecomp(setup_data,device);
  2718. // Build interac_data
  2719. Profile::Tic("Interac-Data",&this->comm,true,25);
  2720. Matrix<char>& interac_data=setup_data.interac_data;
  2721. if(n_out>0 && n_in >0){ // Build precomp_data, interac_data
  2722. size_t precomp_offset=0;
  2723. Mat_Type& interac_type=setup_data.interac_type[0];
  2724. size_t mat_cnt=this->interac_list.ListCount(interac_type);
  2725. Matrix<size_t> precomp_data_offset;
  2726. std::vector<size_t> interac_mat;
  2727. std::vector<Real_t*> interac_mat_ptr;
  2728. #if 0 // Since we skip SetupPrecomp for V-list
  2729. { // Load precomp_data for interac_type.
  2730. struct HeaderData{
  2731. size_t total_size;
  2732. size_t level;
  2733. size_t mat_cnt ;
  2734. size_t max_depth;
  2735. };
  2736. Matrix<char>& precomp_data=*setup_data.precomp_data;
  2737. char* indx_ptr=precomp_data[0]+precomp_offset;
  2738. HeaderData& header=*(HeaderData*)indx_ptr;indx_ptr+=sizeof(HeaderData);
  2739. precomp_data_offset.ReInit(header.mat_cnt,1+(2+2)*header.max_depth, (size_t*)indx_ptr, false);
  2740. precomp_offset+=header.total_size;
  2741. for(size_t mat_id=0;mat_id<mat_cnt;mat_id++){
  2742. Matrix<Real_t>& M0 = this->mat->Mat(level, interac_type, mat_id);
  2743. assert(M0.Dim(0)>0 && M0.Dim(1)>0); UNUSED(M0);
  2744. interac_mat.push_back(precomp_data_offset[mat_id][0]);
  2745. }
  2746. }
  2747. #else
  2748. {
  2749. for(size_t mat_id=0;mat_id<mat_cnt;mat_id++){
  2750. Matrix<Real_t>& M = this->mat->Mat(level, interac_type, mat_id);
  2751. interac_mat_ptr.push_back(&M[0][0]);
  2752. }
  2753. }
  2754. #endif
  2755. size_t dof;
  2756. size_t m=MultipoleOrder();
  2757. size_t ker_dim0=setup_data.kernel->ker_dim[0];
  2758. size_t ker_dim1=setup_data.kernel->ker_dim[1];
  2759. size_t fftsize;
  2760. {
  2761. size_t n1=m*2;
  2762. size_t n2=n1*n1;
  2763. size_t n3_=n2*(n1/2+1);
  2764. size_t chld_cnt=1UL<<COORD_DIM;
  2765. fftsize=2*n3_*chld_cnt;
  2766. dof=1;
  2767. }
  2768. int omp_p=omp_get_max_threads();
  2769. size_t buff_size=DEVICE_BUFFER_SIZE*1024l*1024l;
  2770. size_t n_blk0=2*fftsize*dof*(ker_dim0*n_in +ker_dim1*n_out)*sizeof(Real_t)/buff_size;
  2771. if(n_blk0==0) n_blk0=1;
  2772. std::vector<std::vector<size_t> > fft_vec(n_blk0);
  2773. std::vector<std::vector<size_t> > ifft_vec(n_blk0);
  2774. std::vector<std::vector<Real_t> > fft_scl(n_blk0);
  2775. std::vector<std::vector<Real_t> > ifft_scl(n_blk0);
  2776. std::vector<std::vector<size_t> > interac_vec(n_blk0);
  2777. std::vector<std::vector<size_t> > interac_dsp(n_blk0);
  2778. {
  2779. Matrix<Real_t>& input_data=*setup_data. input_data;
  2780. Matrix<Real_t>& output_data=*setup_data.output_data;
  2781. std::vector<std::vector<FMMNode*> > nodes_blk_in (n_blk0);
  2782. std::vector<std::vector<FMMNode*> > nodes_blk_out(n_blk0);
  2783. Vector<Real_t> src_scal=this->kernel->k_m2l->src_scal;
  2784. Vector<Real_t> trg_scal=this->kernel->k_m2l->trg_scal;
  2785. for(size_t i=0;i<n_in;i++) ((FMMNode*)nodes_in[i])->node_id=i;
  2786. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2787. size_t blk0_start=(n_out* blk0 )/n_blk0;
  2788. size_t blk0_end =(n_out*(blk0+1))/n_blk0;
  2789. std::vector<FMMNode*>& nodes_in_ =nodes_blk_in [blk0];
  2790. std::vector<FMMNode*>& nodes_out_=nodes_blk_out[blk0];
  2791. { // Build node list for blk0.
  2792. std::set<void*> nodes_in;
  2793. for(size_t i=blk0_start;i<blk0_end;i++){
  2794. nodes_out_.push_back((FMMNode*)nodes_out[i]);
  2795. Vector<FMMNode*>& lst=((FMMNode*)nodes_out[i])->interac_list[interac_type];
  2796. for(size_t k=0;k<mat_cnt;k++) if(lst[k]!=NULL && lst[k]->pt_cnt[0]) nodes_in.insert(lst[k]);
  2797. }
  2798. for(std::set<void*>::iterator node=nodes_in.begin(); node != nodes_in.end(); node++){
  2799. nodes_in_.push_back((FMMNode*)*node);
  2800. }
  2801. size_t input_dim=nodes_in_ .size()*ker_dim0*dof*fftsize;
  2802. size_t output_dim=nodes_out_.size()*ker_dim1*dof*fftsize;
  2803. size_t buffer_dim=2*(ker_dim0+ker_dim1)*dof*fftsize*omp_p;
  2804. if(buff_size<(input_dim + output_dim + buffer_dim)*sizeof(Real_t))
  2805. buff_size=(input_dim + output_dim + buffer_dim)*sizeof(Real_t);
  2806. }
  2807. { // Set fft vectors.
  2808. 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]));
  2809. 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]));
  2810. size_t scal_dim0=src_scal.Dim();
  2811. size_t scal_dim1=trg_scal.Dim();
  2812. fft_scl [blk0].resize(nodes_in_ .size()*scal_dim0);
  2813. ifft_scl[blk0].resize(nodes_out_.size()*scal_dim1);
  2814. for(size_t i=0;i<nodes_in_ .size();i++){
  2815. size_t depth=nodes_in_[i]->Depth()+1;
  2816. for(size_t j=0;j<scal_dim0;j++){
  2817. fft_scl[blk0][i*scal_dim0+j]=pow(2.0, src_scal[j]*depth);
  2818. }
  2819. }
  2820. for(size_t i=0;i<nodes_out_.size();i++){
  2821. size_t depth=nodes_out_[i]->Depth()+1;
  2822. for(size_t j=0;j<scal_dim1;j++){
  2823. ifft_scl[blk0][i*scal_dim1+j]=pow(2.0, trg_scal[j]*depth);
  2824. }
  2825. }
  2826. }
  2827. }
  2828. for(size_t blk0=0;blk0<n_blk0;blk0++){ // Hadamard interactions.
  2829. std::vector<FMMNode*>& nodes_in_ =nodes_blk_in [blk0];
  2830. std::vector<FMMNode*>& nodes_out_=nodes_blk_out[blk0];
  2831. for(size_t i=0;i<nodes_in_.size();i++) nodes_in_[i]->node_id=i;
  2832. { // Next blocking level.
  2833. size_t n_blk1=nodes_out_.size()*(2)*sizeof(Real_t)/(64*V_BLK_CACHE);
  2834. if(n_blk1==0) n_blk1=1;
  2835. size_t interac_dsp_=0;
  2836. for(size_t blk1=0;blk1<n_blk1;blk1++){
  2837. size_t blk1_start=(nodes_out_.size()* blk1 )/n_blk1;
  2838. size_t blk1_end =(nodes_out_.size()*(blk1+1))/n_blk1;
  2839. for(size_t k=0;k<mat_cnt;k++){
  2840. for(size_t i=blk1_start;i<blk1_end;i++){
  2841. Vector<FMMNode*>& lst=((FMMNode*)nodes_out_[i])->interac_list[interac_type];
  2842. if(lst[k]!=NULL && lst[k]->pt_cnt[0]){
  2843. interac_vec[blk0].push_back(lst[k]->node_id*fftsize*ker_dim0*dof);
  2844. interac_vec[blk0].push_back( i *fftsize*ker_dim1*dof);
  2845. interac_dsp_++;
  2846. }
  2847. }
  2848. interac_dsp[blk0].push_back(interac_dsp_);
  2849. }
  2850. }
  2851. }
  2852. }
  2853. }
  2854. { // Set interac_data.
  2855. size_t data_size=sizeof(size_t)*6; // buff_size, m, dof, ker_dim0, ker_dim1, n_blk0
  2856. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2857. data_size+=sizeof(size_t)+ fft_vec[blk0].size()*sizeof(size_t);
  2858. data_size+=sizeof(size_t)+ ifft_vec[blk0].size()*sizeof(size_t);
  2859. data_size+=sizeof(size_t)+ fft_scl[blk0].size()*sizeof(Real_t);
  2860. data_size+=sizeof(size_t)+ ifft_scl[blk0].size()*sizeof(Real_t);
  2861. data_size+=sizeof(size_t)+interac_vec[blk0].size()*sizeof(size_t);
  2862. data_size+=sizeof(size_t)+interac_dsp[blk0].size()*sizeof(size_t);
  2863. }
  2864. data_size+=sizeof(size_t)+interac_mat.size()*sizeof(size_t);
  2865. data_size+=sizeof(size_t)+interac_mat_ptr.size()*sizeof(Real_t*);
  2866. if(data_size>interac_data.Dim(0)*interac_data.Dim(1))
  2867. interac_data.ReInit(1,data_size);
  2868. char* data_ptr=&interac_data[0][0];
  2869. ((size_t*)data_ptr)[0]=buff_size; data_ptr+=sizeof(size_t);
  2870. ((size_t*)data_ptr)[0]= m; data_ptr+=sizeof(size_t);
  2871. ((size_t*)data_ptr)[0]= dof; data_ptr+=sizeof(size_t);
  2872. ((size_t*)data_ptr)[0]= ker_dim0; data_ptr+=sizeof(size_t);
  2873. ((size_t*)data_ptr)[0]= ker_dim1; data_ptr+=sizeof(size_t);
  2874. ((size_t*)data_ptr)[0]= n_blk0; data_ptr+=sizeof(size_t);
  2875. ((size_t*)data_ptr)[0]= interac_mat.size(); data_ptr+=sizeof(size_t);
  2876. mem::memcopy(data_ptr, &interac_mat[0], interac_mat.size()*sizeof(size_t));
  2877. data_ptr+=interac_mat.size()*sizeof(size_t);
  2878. ((size_t*)data_ptr)[0]= interac_mat_ptr.size(); data_ptr+=sizeof(size_t);
  2879. mem::memcopy(data_ptr, &interac_mat_ptr[0], interac_mat_ptr.size()*sizeof(Real_t*));
  2880. data_ptr+=interac_mat_ptr.size()*sizeof(Real_t*);
  2881. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2882. ((size_t*)data_ptr)[0]= fft_vec[blk0].size(); data_ptr+=sizeof(size_t);
  2883. mem::memcopy(data_ptr, & fft_vec[blk0][0], fft_vec[blk0].size()*sizeof(size_t));
  2884. data_ptr+= fft_vec[blk0].size()*sizeof(size_t);
  2885. ((size_t*)data_ptr)[0]=ifft_vec[blk0].size(); data_ptr+=sizeof(size_t);
  2886. mem::memcopy(data_ptr, &ifft_vec[blk0][0], ifft_vec[blk0].size()*sizeof(size_t));
  2887. data_ptr+=ifft_vec[blk0].size()*sizeof(size_t);
  2888. ((size_t*)data_ptr)[0]= fft_scl[blk0].size(); data_ptr+=sizeof(size_t);
  2889. mem::memcopy(data_ptr, & fft_scl[blk0][0], fft_scl[blk0].size()*sizeof(Real_t));
  2890. data_ptr+= fft_scl[blk0].size()*sizeof(Real_t);
  2891. ((size_t*)data_ptr)[0]=ifft_scl[blk0].size(); data_ptr+=sizeof(size_t);
  2892. mem::memcopy(data_ptr, &ifft_scl[blk0][0], ifft_scl[blk0].size()*sizeof(Real_t));
  2893. data_ptr+=ifft_scl[blk0].size()*sizeof(Real_t);
  2894. ((size_t*)data_ptr)[0]=interac_vec[blk0].size(); data_ptr+=sizeof(size_t);
  2895. mem::memcopy(data_ptr, &interac_vec[blk0][0], interac_vec[blk0].size()*sizeof(size_t));
  2896. data_ptr+=interac_vec[blk0].size()*sizeof(size_t);
  2897. ((size_t*)data_ptr)[0]=interac_dsp[blk0].size(); data_ptr+=sizeof(size_t);
  2898. mem::memcopy(data_ptr, &interac_dsp[blk0][0], interac_dsp[blk0].size()*sizeof(size_t));
  2899. data_ptr+=interac_dsp[blk0].size()*sizeof(size_t);
  2900. }
  2901. }
  2902. }
  2903. Profile::Toc();
  2904. if(device){ // Host2Device
  2905. Profile::Tic("Host2Device",&this->comm,false,25);
  2906. setup_data.interac_data. AllocDevice(true);
  2907. Profile::Toc();
  2908. }
  2909. }
  2910. template <class FMMNode>
  2911. void FMM_Pts<FMMNode>::V_List (SetupData<Real_t>& setup_data, bool device){
  2912. if(!this->MultipoleOrder()) return;
  2913. assert(!device); //Can not run on accelerator yet.
  2914. int np;
  2915. MPI_Comm_size(comm,&np);
  2916. if(setup_data.interac_data.Dim(0)==0 || setup_data.interac_data.Dim(1)==0){
  2917. if(np>1) Profile::Tic("Host2Device",&this->comm,false,25);
  2918. if(np>1) Profile::Toc();
  2919. return;
  2920. }
  2921. Profile::Tic("Host2Device",&this->comm,false,25);
  2922. int level=setup_data.level;
  2923. size_t buff_size=*((size_t*)&setup_data.interac_data[0][0]);
  2924. typename Vector<char>::Device buff;
  2925. //typename Matrix<char>::Device precomp_data;
  2926. typename Matrix<char>::Device interac_data;
  2927. typename Matrix<Real_t>::Device input_data;
  2928. typename Matrix<Real_t>::Device output_data;
  2929. if(device){
  2930. if(this->dev_buffer.Dim()<buff_size) this->dev_buffer.ReInit(buff_size);
  2931. buff = this-> dev_buffer. AllocDevice(false);
  2932. //precomp_data= setup_data.precomp_data->AllocDevice(false);
  2933. interac_data= setup_data.interac_data. AllocDevice(false);
  2934. input_data = setup_data. input_data->AllocDevice(false);
  2935. output_data = setup_data. output_data->AllocDevice(false);
  2936. }else{
  2937. if(this->cpu_buffer.Dim()<buff_size) this->cpu_buffer.ReInit(buff_size);
  2938. buff = this-> cpu_buffer;
  2939. //precomp_data=*setup_data.precomp_data;
  2940. interac_data= setup_data.interac_data;
  2941. input_data =*setup_data. input_data;
  2942. output_data =*setup_data. output_data;
  2943. }
  2944. Profile::Toc();
  2945. { // Offloaded computation.
  2946. // Set interac_data.
  2947. size_t m, dof, ker_dim0, ker_dim1, n_blk0;
  2948. std::vector<Vector<size_t> > fft_vec;
  2949. std::vector<Vector<size_t> > ifft_vec;
  2950. std::vector<Vector<Real_t> > fft_scl;
  2951. std::vector<Vector<Real_t> > ifft_scl;
  2952. std::vector<Vector<size_t> > interac_vec;
  2953. std::vector<Vector<size_t> > interac_dsp;
  2954. Vector<Real_t*> precomp_mat;
  2955. { // Set interac_data.
  2956. char* data_ptr=&interac_data[0][0];
  2957. buff_size=((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2958. m =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2959. dof =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2960. ker_dim0 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2961. ker_dim1 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2962. n_blk0 =((size_t*)data_ptr)[0]; data_ptr+=sizeof(size_t);
  2963. fft_vec .resize(n_blk0);
  2964. ifft_vec.resize(n_blk0);
  2965. fft_scl .resize(n_blk0);
  2966. ifft_scl.resize(n_blk0);
  2967. interac_vec.resize(n_blk0);
  2968. interac_dsp.resize(n_blk0);
  2969. Vector<size_t> interac_mat;
  2970. interac_mat.ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2971. data_ptr+=sizeof(size_t)+interac_mat.Dim()*sizeof(size_t);
  2972. Vector<Real_t*> interac_mat_ptr;
  2973. interac_mat_ptr.ReInit(((size_t*)data_ptr)[0],(Real_t**)(data_ptr+sizeof(size_t)),false);
  2974. data_ptr+=sizeof(size_t)+interac_mat_ptr.Dim()*sizeof(Real_t*);
  2975. #if 0 // Since we skip SetupPrecomp for V-list
  2976. precomp_mat.Resize(interac_mat.Dim());
  2977. for(size_t i=0;i<interac_mat.Dim();i++){
  2978. precomp_mat[i]=(Real_t*)(precomp_data[0]+interac_mat[i]);
  2979. }
  2980. #else
  2981. precomp_mat.Resize(interac_mat_ptr.Dim());
  2982. for(size_t i=0;i<interac_mat_ptr.Dim();i++){
  2983. precomp_mat[i]=interac_mat_ptr[i];
  2984. }
  2985. #endif
  2986. for(size_t blk0=0;blk0<n_blk0;blk0++){
  2987. fft_vec[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2988. data_ptr+=sizeof(size_t)+fft_vec[blk0].Dim()*sizeof(size_t);
  2989. ifft_vec[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2990. data_ptr+=sizeof(size_t)+ifft_vec[blk0].Dim()*sizeof(size_t);
  2991. fft_scl[blk0].ReInit(((size_t*)data_ptr)[0],(Real_t*)(data_ptr+sizeof(size_t)),false);
  2992. data_ptr+=sizeof(size_t)+fft_scl[blk0].Dim()*sizeof(Real_t);
  2993. ifft_scl[blk0].ReInit(((size_t*)data_ptr)[0],(Real_t*)(data_ptr+sizeof(size_t)),false);
  2994. data_ptr+=sizeof(size_t)+ifft_scl[blk0].Dim()*sizeof(Real_t);
  2995. interac_vec[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2996. data_ptr+=sizeof(size_t)+interac_vec[blk0].Dim()*sizeof(size_t);
  2997. interac_dsp[blk0].ReInit(((size_t*)data_ptr)[0],(size_t*)(data_ptr+sizeof(size_t)),false);
  2998. data_ptr+=sizeof(size_t)+interac_dsp[blk0].Dim()*sizeof(size_t);
  2999. }
  3000. }
  3001. int omp_p=omp_get_max_threads();
  3002. size_t M_dim, fftsize;
  3003. {
  3004. size_t n1=m*2;
  3005. size_t n2=n1*n1;
  3006. size_t n3_=n2*(n1/2+1);
  3007. size_t chld_cnt=1UL<<COORD_DIM;
  3008. fftsize=2*n3_*chld_cnt;
  3009. M_dim=n3_;
  3010. }
  3011. for(size_t blk0=0;blk0<n_blk0;blk0++){ // interactions
  3012. size_t n_in = fft_vec[blk0].Dim();
  3013. size_t n_out=ifft_vec[blk0].Dim();
  3014. size_t input_dim=n_in *ker_dim0*dof*fftsize;
  3015. size_t output_dim=n_out*ker_dim1*dof*fftsize;
  3016. size_t buffer_dim=2*(ker_dim0+ker_dim1)*dof*fftsize*omp_p;
  3017. Vector<Real_t> fft_in ( input_dim, (Real_t*)&buff[ 0 ],false);
  3018. Vector<Real_t> fft_out(output_dim, (Real_t*)&buff[ input_dim *sizeof(Real_t)],false);
  3019. Vector<Real_t> buffer(buffer_dim, (Real_t*)&buff[(input_dim+output_dim)*sizeof(Real_t)],false);
  3020. { // FFT
  3021. if(np==1) Profile::Tic("FFT",&comm,false,100);
  3022. Vector<Real_t> input_data_( input_data.dim[0]* input_data.dim[1], input_data[0], false);
  3023. FFT_UpEquiv(dof, m, ker_dim0, fft_vec[blk0], fft_scl[blk0], input_data_, fft_in, buffer);
  3024. if(np==1) Profile::Toc();
  3025. }
  3026. { // Hadamard
  3027. #ifdef PVFMM_HAVE_PAPI
  3028. #ifdef __VERBOSE__
  3029. std::cout << "Starting counters new\n";
  3030. if (PAPI_start(EventSet) != PAPI_OK) std::cout << "handle_error3" << std::endl;
  3031. #endif
  3032. #endif
  3033. if(np==1) Profile::Tic("HadamardProduct",&comm,false,100);
  3034. VListHadamard<Real_t>(dof, M_dim, ker_dim0, ker_dim1, interac_dsp[blk0], interac_vec[blk0], precomp_mat, fft_in, fft_out);
  3035. if(np==1) Profile::Toc();
  3036. #ifdef PVFMM_HAVE_PAPI
  3037. #ifdef __VERBOSE__
  3038. if (PAPI_stop(EventSet, values) != PAPI_OK) std::cout << "handle_error4" << std::endl;
  3039. std::cout << "Stopping counters\n";
  3040. #endif
  3041. #endif
  3042. }
  3043. { // IFFT
  3044. if(np==1) Profile::Tic("IFFT",&comm,false,100);
  3045. Vector<Real_t> output_data_(output_data.dim[0]*output_data.dim[1], output_data[0], false);
  3046. FFT_Check2Equiv(dof, m, ker_dim1, ifft_vec[blk0], ifft_scl[blk0], fft_out, output_data_, buffer);
  3047. if(np==1) Profile::Toc();
  3048. }
  3049. }
  3050. }
  3051. }
  3052. template <class FMMNode>
  3053. void FMM_Pts<FMMNode>::Down2DownSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  3054. if(!this->MultipoleOrder()) return;
  3055. { // Set setup_data
  3056. setup_data.level=level;
  3057. setup_data.kernel=kernel->k_l2l;
  3058. setup_data.interac_type.resize(1);
  3059. setup_data.interac_type[0]=D2D_Type;
  3060. setup_data. input_data=&buff[1];
  3061. setup_data.output_data=&buff[1];
  3062. Vector<FMMNode_t*>& nodes_in =n_list[1];
  3063. Vector<FMMNode_t*>& nodes_out=n_list[1];
  3064. setup_data.nodes_in .clear();
  3065. setup_data.nodes_out.clear();
  3066. for(size_t i=0;i<nodes_in .Dim();i++) if((nodes_in [i]->Depth()==level-1) && nodes_in [i]->pt_cnt[1]) setup_data.nodes_in .push_back(nodes_in [i]);
  3067. for(size_t i=0;i<nodes_out.Dim();i++) if((nodes_out[i]->Depth()==level ) && nodes_out[i]->pt_cnt[1]) setup_data.nodes_out.push_back(nodes_out[i]);
  3068. }
  3069. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  3070. std::vector<void*>& nodes_out=setup_data.nodes_out;
  3071. std::vector<Vector<Real_t>*>& input_vector=setup_data. input_vector; input_vector.clear();
  3072. std::vector<Vector<Real_t>*>& output_vector=setup_data.output_vector; output_vector.clear();
  3073. for(size_t i=0;i<nodes_in .size();i++) input_vector.push_back(&((FMMData*)((FMMNode*)nodes_in [i])->FMMData())->dnward_equiv);
  3074. for(size_t i=0;i<nodes_out.size();i++) output_vector.push_back(&((FMMData*)((FMMNode*)nodes_out[i])->FMMData())->dnward_equiv);
  3075. SetupInterac(setup_data,device);
  3076. }
  3077. template <class FMMNode>
  3078. void FMM_Pts<FMMNode>::Down2Down (SetupData<Real_t>& setup_data, bool device){
  3079. if(!this->MultipoleOrder()) return;
  3080. //Add Down2Down contribution.
  3081. EvalList(setup_data, device);
  3082. }
  3083. template <class FMMNode>
  3084. void FMM_Pts<FMMNode>::PtSetup(SetupData<Real_t>& setup_data, void* data_){
  3085. struct PackedData{
  3086. size_t len;
  3087. Matrix<Real_t>* ptr;
  3088. Vector<size_t> cnt;
  3089. Vector<size_t> dsp;
  3090. };
  3091. struct InteracData{
  3092. Vector<size_t> in_node;
  3093. Vector<size_t> scal_idx;
  3094. Vector<Real_t> coord_shift;
  3095. Vector<size_t> interac_cnt;
  3096. Vector<size_t> interac_dsp;
  3097. Vector<Real_t> scal[4*MAX_DEPTH];
  3098. Matrix<Real_t> M[4];
  3099. };
  3100. struct ptSetupData{
  3101. int level;
  3102. const Kernel<Real_t>* kernel;
  3103. PackedData src_coord; // Src coord
  3104. PackedData src_value; // Src density
  3105. PackedData srf_coord; // Srf coord
  3106. PackedData srf_value; // Srf density
  3107. PackedData trg_coord; // Trg coord
  3108. PackedData trg_value; // Trg potential
  3109. InteracData interac_data;
  3110. };
  3111. ptSetupData& data=*(ptSetupData*)data_;
  3112. { // pack data
  3113. struct PackedSetupData{
  3114. size_t size;
  3115. int level;
  3116. const Kernel<Real_t>* kernel;
  3117. Matrix<Real_t>* src_coord; // Src coord
  3118. Matrix<Real_t>* src_value; // Src density
  3119. Matrix<Real_t>* srf_coord; // Srf coord
  3120. Matrix<Real_t>* srf_value; // Srf density
  3121. Matrix<Real_t>* trg_coord; // Trg coord
  3122. Matrix<Real_t>* trg_value; // Trg potential
  3123. size_t src_coord_cnt_size; size_t src_coord_cnt_offset;
  3124. size_t src_coord_dsp_size; size_t src_coord_dsp_offset;
  3125. size_t src_value_cnt_size; size_t src_value_cnt_offset;
  3126. size_t src_value_dsp_size; size_t src_value_dsp_offset;
  3127. size_t srf_coord_cnt_size; size_t srf_coord_cnt_offset;
  3128. size_t srf_coord_dsp_size; size_t srf_coord_dsp_offset;
  3129. size_t srf_value_cnt_size; size_t srf_value_cnt_offset;
  3130. size_t srf_value_dsp_size; size_t srf_value_dsp_offset;
  3131. size_t trg_coord_cnt_size; size_t trg_coord_cnt_offset;
  3132. size_t trg_coord_dsp_size; size_t trg_coord_dsp_offset;
  3133. size_t trg_value_cnt_size; size_t trg_value_cnt_offset;
  3134. size_t trg_value_dsp_size; size_t trg_value_dsp_offset;
  3135. // interac_data
  3136. size_t in_node_size; size_t in_node_offset;
  3137. size_t scal_idx_size; size_t scal_idx_offset;
  3138. size_t coord_shift_size; size_t coord_shift_offset;
  3139. size_t interac_cnt_size; size_t interac_cnt_offset;
  3140. size_t interac_dsp_size; size_t interac_dsp_offset;
  3141. size_t scal_dim[4*MAX_DEPTH]; size_t scal_offset[4*MAX_DEPTH];
  3142. size_t Mdim[4][2]; size_t M_offset[4];
  3143. };
  3144. PackedSetupData pkd_data;
  3145. { // Set pkd_data
  3146. size_t offset=mem::align_ptr(sizeof(PackedSetupData));
  3147. pkd_data. level=data. level;
  3148. pkd_data.kernel=data.kernel;
  3149. pkd_data.src_coord=data.src_coord.ptr;
  3150. pkd_data.src_value=data.src_value.ptr;
  3151. pkd_data.srf_coord=data.srf_coord.ptr;
  3152. pkd_data.srf_value=data.srf_value.ptr;
  3153. pkd_data.trg_coord=data.trg_coord.ptr;
  3154. pkd_data.trg_value=data.trg_value.ptr;
  3155. pkd_data.src_coord_cnt_offset=offset; pkd_data.src_coord_cnt_size=data.src_coord.cnt.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.src_coord_cnt_size);
  3156. pkd_data.src_coord_dsp_offset=offset; pkd_data.src_coord_dsp_size=data.src_coord.dsp.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.src_coord_dsp_size);
  3157. pkd_data.src_value_cnt_offset=offset; pkd_data.src_value_cnt_size=data.src_value.cnt.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.src_value_cnt_size);
  3158. pkd_data.src_value_dsp_offset=offset; pkd_data.src_value_dsp_size=data.src_value.dsp.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.src_value_dsp_size);
  3159. pkd_data.srf_coord_cnt_offset=offset; pkd_data.srf_coord_cnt_size=data.srf_coord.cnt.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.srf_coord_cnt_size);
  3160. pkd_data.srf_coord_dsp_offset=offset; pkd_data.srf_coord_dsp_size=data.srf_coord.dsp.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.srf_coord_dsp_size);
  3161. pkd_data.srf_value_cnt_offset=offset; pkd_data.srf_value_cnt_size=data.srf_value.cnt.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.srf_value_cnt_size);
  3162. pkd_data.srf_value_dsp_offset=offset; pkd_data.srf_value_dsp_size=data.srf_value.dsp.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.srf_value_dsp_size);
  3163. pkd_data.trg_coord_cnt_offset=offset; pkd_data.trg_coord_cnt_size=data.trg_coord.cnt.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.trg_coord_cnt_size);
  3164. pkd_data.trg_coord_dsp_offset=offset; pkd_data.trg_coord_dsp_size=data.trg_coord.dsp.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.trg_coord_dsp_size);
  3165. pkd_data.trg_value_cnt_offset=offset; pkd_data.trg_value_cnt_size=data.trg_value.cnt.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.trg_value_cnt_size);
  3166. pkd_data.trg_value_dsp_offset=offset; pkd_data.trg_value_dsp_size=data.trg_value.dsp.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.trg_value_dsp_size);
  3167. InteracData& intdata=data.interac_data;
  3168. pkd_data. in_node_offset=offset; pkd_data. in_node_size=intdata. in_node.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data. in_node_size);
  3169. pkd_data. scal_idx_offset=offset; pkd_data. scal_idx_size=intdata. scal_idx.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data. scal_idx_size);
  3170. pkd_data.coord_shift_offset=offset; pkd_data.coord_shift_size=intdata.coord_shift.Dim(); offset+=mem::align_ptr(sizeof(Real_t)*pkd_data.coord_shift_size);
  3171. pkd_data.interac_cnt_offset=offset; pkd_data.interac_cnt_size=intdata.interac_cnt.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.interac_cnt_size);
  3172. pkd_data.interac_dsp_offset=offset; pkd_data.interac_dsp_size=intdata.interac_dsp.Dim(); offset+=mem::align_ptr(sizeof(size_t)*pkd_data.interac_dsp_size);
  3173. for(size_t i=0;i<4*MAX_DEPTH;i++){
  3174. pkd_data.scal_offset[i]=offset; pkd_data.scal_dim[i]=intdata.scal[i].Dim(); offset+=mem::align_ptr(sizeof(Real_t)*pkd_data.scal_dim[i]);
  3175. }
  3176. for(size_t i=0;i<4;i++){
  3177. size_t& Mdim0=pkd_data.Mdim[i][0];
  3178. size_t& Mdim1=pkd_data.Mdim[i][1];
  3179. pkd_data.M_offset[i]=offset; Mdim0=intdata.M[i].Dim(0); Mdim1=intdata.M[i].Dim(1); offset+=mem::align_ptr(sizeof(Real_t)*Mdim0*Mdim1);
  3180. }
  3181. pkd_data.size=offset;
  3182. }
  3183. { // Set setup_data.interac_data
  3184. Matrix<char>& buff=setup_data.interac_data;
  3185. if(pkd_data.size>buff.Dim(0)*buff.Dim(1)){
  3186. buff.ReInit(1,pkd_data.size);
  3187. }
  3188. ((PackedSetupData*)buff[0])[0]=pkd_data;
  3189. if(pkd_data.src_coord_cnt_size) memcpy(&buff[0][pkd_data.src_coord_cnt_offset], &data.src_coord.cnt[0], pkd_data.src_coord_cnt_size*sizeof(size_t));
  3190. if(pkd_data.src_coord_dsp_size) memcpy(&buff[0][pkd_data.src_coord_dsp_offset], &data.src_coord.dsp[0], pkd_data.src_coord_dsp_size*sizeof(size_t));
  3191. if(pkd_data.src_value_cnt_size) memcpy(&buff[0][pkd_data.src_value_cnt_offset], &data.src_value.cnt[0], pkd_data.src_value_cnt_size*sizeof(size_t));
  3192. if(pkd_data.src_value_dsp_size) memcpy(&buff[0][pkd_data.src_value_dsp_offset], &data.src_value.dsp[0], pkd_data.src_value_dsp_size*sizeof(size_t));
  3193. if(pkd_data.srf_coord_cnt_size) memcpy(&buff[0][pkd_data.srf_coord_cnt_offset], &data.srf_coord.cnt[0], pkd_data.srf_coord_cnt_size*sizeof(size_t));
  3194. if(pkd_data.srf_coord_dsp_size) memcpy(&buff[0][pkd_data.srf_coord_dsp_offset], &data.srf_coord.dsp[0], pkd_data.srf_coord_dsp_size*sizeof(size_t));
  3195. if(pkd_data.srf_value_cnt_size) memcpy(&buff[0][pkd_data.srf_value_cnt_offset], &data.srf_value.cnt[0], pkd_data.srf_value_cnt_size*sizeof(size_t));
  3196. if(pkd_data.srf_value_dsp_size) memcpy(&buff[0][pkd_data.srf_value_dsp_offset], &data.srf_value.dsp[0], pkd_data.srf_value_dsp_size*sizeof(size_t));
  3197. if(pkd_data.trg_coord_cnt_size) memcpy(&buff[0][pkd_data.trg_coord_cnt_offset], &data.trg_coord.cnt[0], pkd_data.trg_coord_cnt_size*sizeof(size_t));
  3198. if(pkd_data.trg_coord_dsp_size) memcpy(&buff[0][pkd_data.trg_coord_dsp_offset], &data.trg_coord.dsp[0], pkd_data.trg_coord_dsp_size*sizeof(size_t));
  3199. if(pkd_data.trg_value_cnt_size) memcpy(&buff[0][pkd_data.trg_value_cnt_offset], &data.trg_value.cnt[0], pkd_data.trg_value_cnt_size*sizeof(size_t));
  3200. if(pkd_data.trg_value_dsp_size) memcpy(&buff[0][pkd_data.trg_value_dsp_offset], &data.trg_value.dsp[0], pkd_data.trg_value_dsp_size*sizeof(size_t));
  3201. InteracData& intdata=data.interac_data;
  3202. if(pkd_data. in_node_size) memcpy(&buff[0][pkd_data. in_node_offset], &intdata. in_node[0], pkd_data. in_node_size*sizeof(size_t));
  3203. if(pkd_data. scal_idx_size) memcpy(&buff[0][pkd_data. scal_idx_offset], &intdata. scal_idx[0], pkd_data. scal_idx_size*sizeof(size_t));
  3204. if(pkd_data.coord_shift_size) memcpy(&buff[0][pkd_data.coord_shift_offset], &intdata.coord_shift[0], pkd_data.coord_shift_size*sizeof(Real_t));
  3205. if(pkd_data.interac_cnt_size) memcpy(&buff[0][pkd_data.interac_cnt_offset], &intdata.interac_cnt[0], pkd_data.interac_cnt_size*sizeof(size_t));
  3206. if(pkd_data.interac_dsp_size) memcpy(&buff[0][pkd_data.interac_dsp_offset], &intdata.interac_dsp[0], pkd_data.interac_dsp_size*sizeof(size_t));
  3207. for(size_t i=0;i<4*MAX_DEPTH;i++){
  3208. if(intdata.scal[i].Dim()) memcpy(&buff[0][pkd_data.scal_offset[i]], &intdata.scal[i][0], intdata.scal[i].Dim()*sizeof(Real_t));
  3209. }
  3210. for(size_t i=0;i<4;i++){
  3211. if(intdata.M[i].Dim(0)*intdata.M[i].Dim(1)) memcpy(&buff[0][pkd_data.M_offset[i]], &intdata.M[i][0][0], intdata.M[i].Dim(0)*intdata.M[i].Dim(1)*sizeof(Real_t));
  3212. }
  3213. }
  3214. }
  3215. { // Resize device buffer
  3216. size_t n=setup_data.output_data->Dim(0)*setup_data.output_data->Dim(1)*sizeof(Real_t);
  3217. if(this->dev_buffer.Dim()<n) this->dev_buffer.ReInit(n);
  3218. }
  3219. }
  3220. template <class FMMNode>
  3221. template <int SYNC>
  3222. void FMM_Pts<FMMNode>::EvalListPts(SetupData<Real_t>& setup_data, bool device){
  3223. if(setup_data.kernel->ker_dim[0]*setup_data.kernel->ker_dim[1]==0) return;
  3224. if(setup_data.interac_data.Dim(0)==0 || setup_data.interac_data.Dim(1)==0){
  3225. Profile::Tic("Host2Device",&this->comm,false,25);
  3226. Profile::Toc();
  3227. Profile::Tic("DeviceComp",&this->comm,false,20);
  3228. Profile::Toc();
  3229. return;
  3230. }
  3231. bool have_gpu=false;
  3232. #if defined(PVFMM_HAVE_CUDA)
  3233. have_gpu=true;
  3234. #endif
  3235. Profile::Tic("Host2Device",&this->comm,false,25);
  3236. typename Vector<char>::Device dev_buff;
  3237. typename Matrix<char>::Device interac_data;
  3238. typename Matrix<Real_t>::Device coord_data;
  3239. typename Matrix<Real_t>::Device input_data;
  3240. typename Matrix<Real_t>::Device output_data;
  3241. size_t ptr_single_layer_kernel=(size_t)NULL;
  3242. size_t ptr_double_layer_kernel=(size_t)NULL;
  3243. if(device && !have_gpu){
  3244. dev_buff = this-> dev_buffer. AllocDevice(false);
  3245. interac_data= setup_data.interac_data. AllocDevice(false);
  3246. if(setup_data. coord_data!=NULL) coord_data = setup_data. coord_data->AllocDevice(false);
  3247. if(setup_data. input_data!=NULL) input_data = setup_data. input_data->AllocDevice(false);
  3248. if(setup_data. output_data!=NULL) output_data = setup_data. output_data->AllocDevice(false);
  3249. ptr_single_layer_kernel=setup_data.kernel->dev_ker_poten;
  3250. ptr_double_layer_kernel=setup_data.kernel->dev_dbl_layer_poten;
  3251. }else{
  3252. dev_buff = this-> cpu_buffer;
  3253. interac_data= setup_data.interac_data;
  3254. if(setup_data. coord_data!=NULL) coord_data =*setup_data. coord_data;
  3255. if(setup_data. input_data!=NULL) input_data =*setup_data. input_data;
  3256. if(setup_data. output_data!=NULL) output_data =*setup_data. output_data;
  3257. ptr_single_layer_kernel=(size_t)setup_data.kernel->ker_poten;
  3258. ptr_double_layer_kernel=(size_t)setup_data.kernel->dbl_layer_poten;
  3259. }
  3260. Profile::Toc();
  3261. Profile::Tic("DeviceComp",&this->comm,false,20);
  3262. int lock_idx=-1;
  3263. int wait_lock_idx=-1;
  3264. if(device) wait_lock_idx=MIC_Lock::curr_lock();
  3265. if(device) lock_idx=MIC_Lock::get_lock();
  3266. #ifdef __INTEL_OFFLOAD
  3267. #pragma offload if(device) target(mic:0) signal(&MIC_Lock::lock_vec[device?lock_idx:0])
  3268. #endif
  3269. { // Offloaded computation.
  3270. struct PackedData{
  3271. size_t len;
  3272. Matrix<Real_t>* ptr;
  3273. Vector<size_t> cnt;
  3274. Vector<size_t> dsp;
  3275. };
  3276. struct InteracData{
  3277. Vector<size_t> in_node;
  3278. Vector<size_t> scal_idx;
  3279. Vector<Real_t> coord_shift;
  3280. Vector<size_t> interac_cnt;
  3281. Vector<size_t> interac_dsp;
  3282. Vector<Real_t> scal[4*MAX_DEPTH];
  3283. Matrix<Real_t> M[4];
  3284. };
  3285. struct ptSetupData{
  3286. int level;
  3287. const Kernel<Real_t>* kernel;
  3288. PackedData src_coord; // Src coord
  3289. PackedData src_value; // Src density
  3290. PackedData srf_coord; // Srf coord
  3291. PackedData srf_value; // Srf density
  3292. PackedData trg_coord; // Trg coord
  3293. PackedData trg_value; // Trg potential
  3294. InteracData interac_data;
  3295. };
  3296. ptSetupData data;
  3297. { // Initialize data
  3298. struct PackedSetupData{
  3299. size_t size;
  3300. int level;
  3301. const Kernel<Real_t>* kernel;
  3302. Matrix<Real_t>* src_coord; // Src coord
  3303. Matrix<Real_t>* src_value; // Src density
  3304. Matrix<Real_t>* srf_coord; // Srf coord
  3305. Matrix<Real_t>* srf_value; // Srf density
  3306. Matrix<Real_t>* trg_coord; // Trg coord
  3307. Matrix<Real_t>* trg_value; // Trg potential
  3308. size_t src_coord_cnt_size; size_t src_coord_cnt_offset;
  3309. size_t src_coord_dsp_size; size_t src_coord_dsp_offset;
  3310. size_t src_value_cnt_size; size_t src_value_cnt_offset;
  3311. size_t src_value_dsp_size; size_t src_value_dsp_offset;
  3312. size_t srf_coord_cnt_size; size_t srf_coord_cnt_offset;
  3313. size_t srf_coord_dsp_size; size_t srf_coord_dsp_offset;
  3314. size_t srf_value_cnt_size; size_t srf_value_cnt_offset;
  3315. size_t srf_value_dsp_size; size_t srf_value_dsp_offset;
  3316. size_t trg_coord_cnt_size; size_t trg_coord_cnt_offset;
  3317. size_t trg_coord_dsp_size; size_t trg_coord_dsp_offset;
  3318. size_t trg_value_cnt_size; size_t trg_value_cnt_offset;
  3319. size_t trg_value_dsp_size; size_t trg_value_dsp_offset;
  3320. // interac_data
  3321. size_t in_node_size; size_t in_node_offset;
  3322. size_t scal_idx_size; size_t scal_idx_offset;
  3323. size_t coord_shift_size; size_t coord_shift_offset;
  3324. size_t interac_cnt_size; size_t interac_cnt_offset;
  3325. size_t interac_dsp_size; size_t interac_dsp_offset;
  3326. size_t scal_dim[4*MAX_DEPTH]; size_t scal_offset[4*MAX_DEPTH];
  3327. size_t Mdim[4][2]; size_t M_offset[4];
  3328. };
  3329. typename Matrix<char>::Device& setupdata=interac_data;
  3330. PackedSetupData& pkd_data=*((PackedSetupData*)setupdata[0]);
  3331. data. level=pkd_data. level;
  3332. data.kernel=pkd_data.kernel;
  3333. data.src_coord.ptr=pkd_data.src_coord;
  3334. data.src_value.ptr=pkd_data.src_value;
  3335. data.srf_coord.ptr=pkd_data.srf_coord;
  3336. data.srf_value.ptr=pkd_data.srf_value;
  3337. data.trg_coord.ptr=pkd_data.trg_coord;
  3338. data.trg_value.ptr=pkd_data.trg_value;
  3339. data.src_coord.cnt.ReInit(pkd_data.src_coord_cnt_size, (size_t*)&setupdata[0][pkd_data.src_coord_cnt_offset], false);
  3340. data.src_coord.dsp.ReInit(pkd_data.src_coord_dsp_size, (size_t*)&setupdata[0][pkd_data.src_coord_dsp_offset], false);
  3341. data.src_value.cnt.ReInit(pkd_data.src_value_cnt_size, (size_t*)&setupdata[0][pkd_data.src_value_cnt_offset], false);
  3342. data.src_value.dsp.ReInit(pkd_data.src_value_dsp_size, (size_t*)&setupdata[0][pkd_data.src_value_dsp_offset], false);
  3343. data.srf_coord.cnt.ReInit(pkd_data.srf_coord_cnt_size, (size_t*)&setupdata[0][pkd_data.srf_coord_cnt_offset], false);
  3344. data.srf_coord.dsp.ReInit(pkd_data.srf_coord_dsp_size, (size_t*)&setupdata[0][pkd_data.srf_coord_dsp_offset], false);
  3345. data.srf_value.cnt.ReInit(pkd_data.srf_value_cnt_size, (size_t*)&setupdata[0][pkd_data.srf_value_cnt_offset], false);
  3346. data.srf_value.dsp.ReInit(pkd_data.srf_value_dsp_size, (size_t*)&setupdata[0][pkd_data.srf_value_dsp_offset], false);
  3347. data.trg_coord.cnt.ReInit(pkd_data.trg_coord_cnt_size, (size_t*)&setupdata[0][pkd_data.trg_coord_cnt_offset], false);
  3348. data.trg_coord.dsp.ReInit(pkd_data.trg_coord_dsp_size, (size_t*)&setupdata[0][pkd_data.trg_coord_dsp_offset], false);
  3349. data.trg_value.cnt.ReInit(pkd_data.trg_value_cnt_size, (size_t*)&setupdata[0][pkd_data.trg_value_cnt_offset], false);
  3350. data.trg_value.dsp.ReInit(pkd_data.trg_value_dsp_size, (size_t*)&setupdata[0][pkd_data.trg_value_dsp_offset], false);
  3351. InteracData& intdata=data.interac_data;
  3352. intdata. in_node.ReInit(pkd_data. in_node_size, (size_t*)&setupdata[0][pkd_data. in_node_offset],false);
  3353. intdata. scal_idx.ReInit(pkd_data. scal_idx_size, (size_t*)&setupdata[0][pkd_data. scal_idx_offset],false);
  3354. intdata.coord_shift.ReInit(pkd_data.coord_shift_size, (Real_t*)&setupdata[0][pkd_data.coord_shift_offset],false);
  3355. intdata.interac_cnt.ReInit(pkd_data.interac_cnt_size, (size_t*)&setupdata[0][pkd_data.interac_cnt_offset],false);
  3356. intdata.interac_dsp.ReInit(pkd_data.interac_dsp_size, (size_t*)&setupdata[0][pkd_data.interac_dsp_offset],false);
  3357. for(size_t i=0;i<4*MAX_DEPTH;i++){
  3358. intdata.scal[i].ReInit(pkd_data.scal_dim[i], (Real_t*)&setupdata[0][pkd_data.scal_offset[i]],false);
  3359. }
  3360. for(size_t i=0;i<4;i++){
  3361. intdata.M[i].ReInit(pkd_data.Mdim[i][0], pkd_data.Mdim[i][1], (Real_t*)&setupdata[0][pkd_data.M_offset[i]],false);
  3362. }
  3363. }
  3364. if(device) MIC_Lock::wait_lock(wait_lock_idx);
  3365. { // Compute interactions
  3366. InteracData& intdata=data.interac_data;
  3367. typename Kernel<Real_t>::Ker_t single_layer_kernel=(typename Kernel<Real_t>::Ker_t)ptr_single_layer_kernel;
  3368. typename Kernel<Real_t>::Ker_t double_layer_kernel=(typename Kernel<Real_t>::Ker_t)ptr_double_layer_kernel;
  3369. int omp_p=omp_get_max_threads();
  3370. #pragma omp parallel for
  3371. for(size_t tid=0;tid<omp_p;tid++){
  3372. Matrix<Real_t> src_coord, src_value;
  3373. Matrix<Real_t> srf_coord, srf_value;
  3374. Matrix<Real_t> trg_coord, trg_value;
  3375. Vector<Real_t> buff;
  3376. { // init buff
  3377. size_t thread_buff_size=dev_buff.dim/sizeof(Real_t)/omp_p;
  3378. buff.ReInit(thread_buff_size, (Real_t*)&dev_buff[tid*thread_buff_size*sizeof(Real_t)], false);
  3379. }
  3380. size_t vcnt=0;
  3381. Matrix<Real_t> vbuff[6];
  3382. { // init vbuff[0:5]
  3383. size_t vdim_=0, vdim[6];
  3384. for(size_t indx=0;indx<6;indx++){
  3385. vdim[indx]=0;
  3386. switch(indx){
  3387. case 0:
  3388. vdim[indx]=intdata.M[0].Dim(0); break;
  3389. case 1:
  3390. assert(intdata.M[0].Dim(1)==intdata.M[1].Dim(0));
  3391. vdim[indx]=intdata.M[0].Dim(1); break;
  3392. case 2:
  3393. vdim[indx]=intdata.M[1].Dim(1); break;
  3394. case 3:
  3395. vdim[indx]=intdata.M[2].Dim(0); break;
  3396. case 4:
  3397. assert(intdata.M[2].Dim(1)==intdata.M[3].Dim(0));
  3398. vdim[indx]=intdata.M[2].Dim(1); break;
  3399. case 5:
  3400. vdim[indx]=intdata.M[3].Dim(1); break;
  3401. default:
  3402. vdim[indx]=0; break;
  3403. }
  3404. vdim_+=vdim[indx];
  3405. }
  3406. if(vdim_){
  3407. vcnt=buff.Dim()/vdim_/2;
  3408. assert(vcnt>0); // Thread buffer is too small
  3409. }
  3410. for(size_t indx=0;indx<6;indx++){ // init vbuff[0:5]
  3411. vbuff[indx].ReInit(vcnt,vdim[indx],&buff[0],false);
  3412. buff.ReInit(buff.Dim()-vdim[indx]*vcnt, &buff[vdim[indx]*vcnt], false);
  3413. }
  3414. }
  3415. size_t trg_a=((tid+0)*intdata.interac_cnt.Dim())/omp_p;
  3416. size_t trg_b=((tid+1)*intdata.interac_cnt.Dim())/omp_p;
  3417. for(size_t trg0=trg_a;trg0<trg_b;){
  3418. size_t trg1_max=1;
  3419. if(vcnt){ // Find trg1_max
  3420. size_t interac_cnt=intdata.interac_cnt[trg0];
  3421. while(trg0+trg1_max<trg_b){
  3422. interac_cnt+=intdata.interac_cnt[trg0+trg1_max];
  3423. if(interac_cnt>vcnt){
  3424. interac_cnt-=intdata.interac_cnt[trg0+trg1_max];
  3425. break;
  3426. }
  3427. trg1_max++;
  3428. }
  3429. assert(interac_cnt<=vcnt);
  3430. for(size_t k=0;k<6;k++){
  3431. if(vbuff[k].Dim(0)*vbuff[k].Dim(1)){
  3432. vbuff[k].ReInit(interac_cnt,vbuff[k].Dim(1),vbuff[k][0]);
  3433. }
  3434. }
  3435. }else{
  3436. trg1_max=trg_b-trg0;
  3437. }
  3438. if(intdata.M[0].Dim(0) && intdata.M[0].Dim(1) && intdata.M[1].Dim(0) && intdata.M[1].Dim(1)){ // src mat-vec
  3439. size_t interac_idx=0;
  3440. for(size_t trg1=0;trg1<trg1_max;trg1++){ // Copy src_value to vbuff[0]
  3441. size_t trg=trg0+trg1;
  3442. for(size_t i=0;i<intdata.interac_cnt[trg];i++){
  3443. size_t int_id=intdata.interac_dsp[trg]+i;
  3444. size_t src=intdata.in_node[int_id];
  3445. src_value.ReInit(1, data.src_value.cnt[src], &data.src_value.ptr[0][0][data.src_value.dsp[src]], false);
  3446. { // Copy src_value to vbuff[0]
  3447. size_t vdim=vbuff[0].Dim(1);
  3448. assert(src_value.Dim(1)==vdim);
  3449. for(size_t j=0;j<vdim;j++) vbuff[0][interac_idx][j]=src_value[0][j];
  3450. }
  3451. size_t scal_idx=intdata.scal_idx[int_id];
  3452. { // scaling
  3453. Matrix<Real_t>& vec=vbuff[0];
  3454. Vector<Real_t>& scal=intdata.scal[scal_idx*4+0];
  3455. size_t scal_dim=scal.Dim();
  3456. if(scal_dim){
  3457. size_t vdim=vec.Dim(1);
  3458. for(size_t j=0;j<vdim;j+=scal_dim){
  3459. for(size_t k=0;k<scal_dim;k++){
  3460. vec[interac_idx][j+k]*=scal[k];
  3461. }
  3462. }
  3463. }
  3464. }
  3465. interac_idx++;
  3466. }
  3467. }
  3468. Matrix<Real_t>::GEMM(vbuff[1],vbuff[0],intdata.M[0]);
  3469. Matrix<Real_t>::GEMM(vbuff[2],vbuff[1],intdata.M[1]);
  3470. interac_idx=0;
  3471. for(size_t trg1=0;trg1<trg1_max;trg1++){
  3472. size_t trg=trg0+trg1;
  3473. for(size_t i=0;i<intdata.interac_cnt[trg];i++){
  3474. size_t int_id=intdata.interac_dsp[trg]+i;
  3475. size_t scal_idx=intdata.scal_idx[int_id];
  3476. { // scaling
  3477. Matrix<Real_t>& vec=vbuff[2];
  3478. Vector<Real_t>& scal=intdata.scal[scal_idx*4+1];
  3479. size_t scal_dim=scal.Dim();
  3480. if(scal_dim){
  3481. size_t vdim=vec.Dim(1);
  3482. for(size_t j=0;j<vdim;j+=scal_dim){
  3483. for(size_t k=0;k<scal_dim;k++){
  3484. vec[interac_idx][j+k]*=scal[k];
  3485. }
  3486. }
  3487. }
  3488. }
  3489. interac_idx++;
  3490. }
  3491. }
  3492. }
  3493. if(intdata.M[2].Dim(0) && intdata.M[2].Dim(1) && intdata.M[3].Dim(0) && intdata.M[3].Dim(1)){ // init vbuff[3]
  3494. size_t vdim=vbuff[3].Dim(0)*vbuff[3].Dim(1);
  3495. for(size_t i=0;i<vdim;i++) vbuff[3][0][i]=0;
  3496. }
  3497. { // Evaluate kernel functions
  3498. size_t interac_idx=0;
  3499. for(size_t trg1=0;trg1<trg1_max;trg1++){
  3500. size_t trg=trg0+trg1;
  3501. trg_coord.ReInit(1, data.trg_coord.cnt[trg], &data.trg_coord.ptr[0][0][data.trg_coord.dsp[trg]], false);
  3502. trg_value.ReInit(1, data.trg_value.cnt[trg], &data.trg_value.ptr[0][0][data.trg_value.dsp[trg]], false);
  3503. for(size_t i=0;i<intdata.interac_cnt[trg];i++){
  3504. size_t int_id=intdata.interac_dsp[trg]+i;
  3505. size_t src=intdata.in_node[int_id];
  3506. src_coord.ReInit(1, data.src_coord.cnt[src], &data.src_coord.ptr[0][0][data.src_coord.dsp[src]], false);
  3507. src_value.ReInit(1, data.src_value.cnt[src], &data.src_value.ptr[0][0][data.src_value.dsp[src]], false);
  3508. srf_coord.ReInit(1, data.srf_coord.cnt[src], &data.srf_coord.ptr[0][0][data.srf_coord.dsp[src]], false);
  3509. srf_value.ReInit(1, data.srf_value.cnt[src], &data.srf_value.ptr[0][0][data.srf_value.dsp[src]], false);
  3510. Real_t* vbuff2_ptr=(vbuff[2].Dim(0)*vbuff[2].Dim(1)?vbuff[2][interac_idx]:src_value[0]);
  3511. Real_t* vbuff3_ptr=(vbuff[3].Dim(0)*vbuff[3].Dim(1)?vbuff[3][interac_idx]:trg_value[0]);
  3512. { // coord_shift
  3513. Real_t* shift=&intdata.coord_shift[int_id*COORD_DIM];
  3514. if(shift[0]!=0 || shift[1]!=0 || shift[2]!=0){
  3515. size_t vdim=src_coord.Dim(1);
  3516. Vector<Real_t> new_coord(vdim, &buff[0], false);
  3517. assert(buff.Dim()>=vdim); // Thread buffer is too small
  3518. //buff.ReInit(buff.Dim()-vdim, &buff[vdim], false);
  3519. for(size_t j=0;j<vdim;j+=COORD_DIM){
  3520. for(size_t k=0;k<COORD_DIM;k++){
  3521. new_coord[j+k]=src_coord[0][j+k]+shift[k];
  3522. }
  3523. }
  3524. src_coord.ReInit(1, vdim, &new_coord[0], false);
  3525. }
  3526. }
  3527. if(src_coord.Dim(1)){
  3528. assert(ptr_single_layer_kernel); // assert(Single-layer kernel is implemented)
  3529. single_layer_kernel(src_coord[0], src_coord.Dim(1)/COORD_DIM, vbuff2_ptr, 1,
  3530. trg_coord[0], trg_coord.Dim(1)/COORD_DIM, vbuff3_ptr, NULL);
  3531. }
  3532. if(srf_coord.Dim(1)){
  3533. assert(ptr_double_layer_kernel); // assert(Double-layer kernel is implemented)
  3534. double_layer_kernel(srf_coord[0], srf_coord.Dim(1)/COORD_DIM, srf_value[0], 1,
  3535. trg_coord[0], trg_coord.Dim(1)/COORD_DIM, trg_value[0], NULL);
  3536. }
  3537. interac_idx++;
  3538. }
  3539. }
  3540. }
  3541. if(intdata.M[2].Dim(0) && intdata.M[2].Dim(1) && intdata.M[3].Dim(0) && intdata.M[3].Dim(1)){ // trg mat-vec
  3542. size_t interac_idx=0;
  3543. for(size_t trg1=0;trg1<trg1_max;trg1++){
  3544. size_t trg=trg0+trg1;
  3545. for(size_t i=0;i<intdata.interac_cnt[trg];i++){
  3546. size_t int_id=intdata.interac_dsp[trg]+i;
  3547. size_t scal_idx=intdata.scal_idx[int_id];
  3548. { // scaling
  3549. Matrix<Real_t>& vec=vbuff[3];
  3550. Vector<Real_t>& scal=intdata.scal[scal_idx*4+2];
  3551. size_t scal_dim=scal.Dim();
  3552. if(scal_dim){
  3553. size_t vdim=vec.Dim(1);
  3554. for(size_t j=0;j<vdim;j+=scal_dim){
  3555. for(size_t k=0;k<scal_dim;k++){
  3556. vec[interac_idx][j+k]*=scal[k];
  3557. }
  3558. }
  3559. }
  3560. }
  3561. interac_idx++;
  3562. }
  3563. }
  3564. Matrix<Real_t>::GEMM(vbuff[4],vbuff[3],intdata.M[2]);
  3565. Matrix<Real_t>::GEMM(vbuff[5],vbuff[4],intdata.M[3]);
  3566. interac_idx=0;
  3567. for(size_t trg1=0;trg1<trg1_max;trg1++){
  3568. size_t trg=trg0+trg1;
  3569. trg_value.ReInit(1, data.trg_value.cnt[trg], &data.trg_value.ptr[0][0][data.trg_value.dsp[trg]], false);
  3570. for(size_t i=0;i<intdata.interac_cnt[trg];i++){
  3571. size_t int_id=intdata.interac_dsp[trg]+i;
  3572. size_t scal_idx=intdata.scal_idx[int_id];
  3573. { // scaling
  3574. Matrix<Real_t>& vec=vbuff[5];
  3575. Vector<Real_t>& scal=intdata.scal[scal_idx*4+3];
  3576. size_t scal_dim=scal.Dim();
  3577. if(scal_dim){
  3578. size_t vdim=vec.Dim(1);
  3579. for(size_t j=0;j<vdim;j+=scal_dim){
  3580. for(size_t k=0;k<scal_dim;k++){
  3581. vec[interac_idx][j+k]*=scal[k];
  3582. }
  3583. }
  3584. }
  3585. }
  3586. { // Add vbuff[5] to trg_value
  3587. size_t vdim=vbuff[5].Dim(1);
  3588. assert(trg_value.Dim(1)==vdim);
  3589. for(size_t i=0;i<vdim;i++) trg_value[0][i]+=vbuff[5][interac_idx][i];
  3590. }
  3591. interac_idx++;
  3592. }
  3593. }
  3594. }
  3595. trg0+=trg1_max;
  3596. }
  3597. }
  3598. }
  3599. if(device) MIC_Lock::release_lock(lock_idx);
  3600. }
  3601. #ifdef __INTEL_OFFLOAD
  3602. if(SYNC){
  3603. #pragma offload if(device) target(mic:0)
  3604. {if(device) MIC_Lock::wait_lock(lock_idx);}
  3605. }
  3606. #endif
  3607. Profile::Toc();
  3608. }
  3609. template <class FMMNode>
  3610. void FMM_Pts<FMMNode>::X_ListSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  3611. if(!this->MultipoleOrder()) return;
  3612. { // Set setup_data
  3613. setup_data. level=level;
  3614. setup_data.kernel=kernel->k_s2l;
  3615. setup_data. input_data=&buff[4];
  3616. setup_data.output_data=&buff[1];
  3617. setup_data. coord_data=&buff[6];
  3618. Vector<FMMNode_t*>& nodes_in =n_list[4];
  3619. Vector<FMMNode_t*>& nodes_out=n_list[1];
  3620. setup_data.nodes_in .clear();
  3621. setup_data.nodes_out.clear();
  3622. for(size_t i=0;i<nodes_in .Dim();i++) if((level==0 || level==-1) && nodes_in [i]->pt_cnt[0] && nodes_in [i]->IsLeaf() ) setup_data.nodes_in .push_back(nodes_in [i]);
  3623. for(size_t i=0;i<nodes_out.Dim();i++) if((level==0 || level==-1) && nodes_out[i]->pt_cnt[1] && !nodes_out[i]->IsGhost()) setup_data.nodes_out.push_back(nodes_out[i]);
  3624. }
  3625. struct PackedData{
  3626. size_t len;
  3627. Matrix<Real_t>* ptr;
  3628. Vector<size_t> cnt;
  3629. Vector<size_t> dsp;
  3630. };
  3631. struct InteracData{
  3632. Vector<size_t> in_node;
  3633. Vector<size_t> scal_idx;
  3634. Vector<Real_t> coord_shift;
  3635. Vector<size_t> interac_cnt;
  3636. Vector<size_t> interac_dsp;
  3637. Vector<Real_t> scal[4*MAX_DEPTH];
  3638. Matrix<Real_t> M[4];
  3639. };
  3640. struct ptSetupData{
  3641. int level;
  3642. const Kernel<Real_t>* kernel;
  3643. PackedData src_coord; // Src coord
  3644. PackedData src_value; // Src density
  3645. PackedData srf_coord; // Srf coord
  3646. PackedData srf_value; // Srf density
  3647. PackedData trg_coord; // Trg coord
  3648. PackedData trg_value; // Trg potential
  3649. InteracData interac_data;
  3650. };
  3651. ptSetupData data;
  3652. data. level=setup_data. level;
  3653. data.kernel=setup_data.kernel;
  3654. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  3655. std::vector<void*>& nodes_out=setup_data.nodes_out;
  3656. { // Set src data
  3657. std::vector<void*>& nodes=nodes_in;
  3658. PackedData& coord=data.src_coord;
  3659. PackedData& value=data.src_value;
  3660. coord.ptr=setup_data. coord_data;
  3661. value.ptr=setup_data. input_data;
  3662. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  3663. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  3664. coord.cnt.ReInit(nodes.size());
  3665. coord.dsp.ReInit(nodes.size());
  3666. value.cnt.ReInit(nodes.size());
  3667. value.dsp.ReInit(nodes.size());
  3668. #pragma omp parallel for
  3669. for(size_t i=0;i<nodes.size();i++){
  3670. ((FMMNode_t*)nodes[i])->node_id=i;
  3671. Vector<Real_t>& coord_vec=((FMMNode_t*)nodes[i])->src_coord;
  3672. Vector<Real_t>& value_vec=((FMMNode_t*)nodes[i])->src_value;
  3673. if(coord_vec.Dim()){
  3674. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  3675. assert(coord.dsp[i]<coord.len);
  3676. coord.cnt[i]=coord_vec.Dim();
  3677. }else{
  3678. coord.dsp[i]=0;
  3679. coord.cnt[i]=0;
  3680. }
  3681. if(value_vec.Dim()){
  3682. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  3683. assert(value.dsp[i]<value.len);
  3684. value.cnt[i]=value_vec.Dim();
  3685. }else{
  3686. value.dsp[i]=0;
  3687. value.cnt[i]=0;
  3688. }
  3689. }
  3690. }
  3691. { // Set srf data
  3692. std::vector<void*>& nodes=nodes_in;
  3693. PackedData& coord=data.srf_coord;
  3694. PackedData& value=data.srf_value;
  3695. coord.ptr=setup_data. coord_data;
  3696. value.ptr=setup_data. input_data;
  3697. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  3698. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  3699. coord.cnt.ReInit(nodes.size());
  3700. coord.dsp.ReInit(nodes.size());
  3701. value.cnt.ReInit(nodes.size());
  3702. value.dsp.ReInit(nodes.size());
  3703. #pragma omp parallel for
  3704. for(size_t i=0;i<nodes.size();i++){
  3705. Vector<Real_t>& coord_vec=((FMMNode_t*)nodes[i])->surf_coord;
  3706. Vector<Real_t>& value_vec=((FMMNode_t*)nodes[i])->surf_value;
  3707. if(coord_vec.Dim()){
  3708. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  3709. assert(coord.dsp[i]<coord.len);
  3710. coord.cnt[i]=coord_vec.Dim();
  3711. }else{
  3712. coord.dsp[i]=0;
  3713. coord.cnt[i]=0;
  3714. }
  3715. if(value_vec.Dim()){
  3716. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  3717. assert(value.dsp[i]<value.len);
  3718. value.cnt[i]=value_vec.Dim();
  3719. }else{
  3720. value.dsp[i]=0;
  3721. value.cnt[i]=0;
  3722. }
  3723. }
  3724. }
  3725. { // Set trg data
  3726. std::vector<void*>& nodes=nodes_out;
  3727. PackedData& coord=data.trg_coord;
  3728. PackedData& value=data.trg_value;
  3729. coord.ptr=setup_data. coord_data;
  3730. value.ptr=setup_data.output_data;
  3731. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  3732. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  3733. coord.cnt.ReInit(nodes.size());
  3734. coord.dsp.ReInit(nodes.size());
  3735. value.cnt.ReInit(nodes.size());
  3736. value.dsp.ReInit(nodes.size());
  3737. #pragma omp parallel for
  3738. for(size_t i=0;i<nodes.size();i++){
  3739. Vector<Real_t>& coord_vec=tree->dnwd_check_surf[((FMMNode*)nodes[i])->Depth()];
  3740. Vector<Real_t>& value_vec=((FMMData*)((FMMNode*)nodes[i])->FMMData())->dnward_equiv;
  3741. if(coord_vec.Dim()){
  3742. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  3743. assert(coord.dsp[i]<coord.len);
  3744. coord.cnt[i]=coord_vec.Dim();
  3745. }else{
  3746. coord.dsp[i]=0;
  3747. coord.cnt[i]=0;
  3748. }
  3749. if(value_vec.Dim()){
  3750. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  3751. assert(value.dsp[i]<value.len);
  3752. value.cnt[i]=value_vec.Dim();
  3753. }else{
  3754. value.dsp[i]=0;
  3755. value.cnt[i]=0;
  3756. }
  3757. }
  3758. }
  3759. { // Set interac_data
  3760. int omp_p=omp_get_max_threads();
  3761. std::vector<std::vector<size_t> > in_node_(omp_p);
  3762. std::vector<std::vector<size_t> > scal_idx_(omp_p);
  3763. std::vector<std::vector<Real_t> > coord_shift_(omp_p);
  3764. std::vector<std::vector<size_t> > interac_cnt_(omp_p);
  3765. size_t m=this->MultipoleOrder();
  3766. size_t Nsrf=(6*(m-1)*(m-1)+2);
  3767. #pragma omp parallel for
  3768. for(size_t tid=0;tid<omp_p;tid++){
  3769. std::vector<size_t>& in_node =in_node_[tid] ;
  3770. std::vector<size_t>& scal_idx =scal_idx_[tid] ;
  3771. std::vector<Real_t>& coord_shift=coord_shift_[tid];
  3772. std::vector<size_t>& interac_cnt=interac_cnt_[tid] ;
  3773. size_t a=(nodes_out.size()*(tid+0))/omp_p;
  3774. size_t b=(nodes_out.size()*(tid+1))/omp_p;
  3775. for(size_t i=a;i<b;i++){
  3776. FMMNode_t* tnode=(FMMNode_t*)nodes_out[i];
  3777. if(tnode->IsLeaf() && tnode->pt_cnt[1]<=Nsrf){ // skip: handled in U-list
  3778. interac_cnt.push_back(0);
  3779. continue;
  3780. }
  3781. Real_t s=std::pow(0.5,tnode->Depth());
  3782. size_t interac_cnt_=0;
  3783. { // X_Type
  3784. Mat_Type type=X_Type;
  3785. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  3786. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  3787. FMMNode_t* snode=intlst[j];
  3788. size_t snode_id=snode->node_id;
  3789. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  3790. in_node.push_back(snode_id);
  3791. scal_idx.push_back(snode->Depth());
  3792. { // set coord_shift
  3793. const int* rel_coord=interac_list.RelativeCoord(type,j);
  3794. const Real_t* scoord=snode->Coord();
  3795. const Real_t* tcoord=tnode->Coord();
  3796. Real_t shift[COORD_DIM];
  3797. shift[0]=rel_coord[0]*0.5*s-(scoord[0]+1.0*s)+(0+0.5*s);
  3798. shift[1]=rel_coord[1]*0.5*s-(scoord[1]+1.0*s)+(0+0.5*s);
  3799. shift[2]=rel_coord[2]*0.5*s-(scoord[2]+1.0*s)+(0+0.5*s);
  3800. coord_shift.push_back(shift[0]);
  3801. coord_shift.push_back(shift[1]);
  3802. coord_shift.push_back(shift[2]);
  3803. }
  3804. interac_cnt_++;
  3805. }
  3806. }
  3807. interac_cnt.push_back(interac_cnt_);
  3808. }
  3809. }
  3810. { // Combine interac data
  3811. InteracData& interac_data=data.interac_data;
  3812. { // in_node
  3813. typedef size_t ElemType;
  3814. std::vector<std::vector<ElemType> >& vec_=in_node_;
  3815. pvfmm::Vector<ElemType>& vec=interac_data.in_node;
  3816. std::vector<size_t> vec_dsp(omp_p+1,0);
  3817. for(size_t tid=0;tid<omp_p;tid++){
  3818. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  3819. }
  3820. vec.ReInit(vec_dsp[omp_p]);
  3821. #pragma omp parallel for
  3822. for(size_t tid=0;tid<omp_p;tid++){
  3823. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  3824. }
  3825. }
  3826. { // scal_idx
  3827. typedef size_t ElemType;
  3828. std::vector<std::vector<ElemType> >& vec_=scal_idx_;
  3829. pvfmm::Vector<ElemType>& vec=interac_data.scal_idx;
  3830. std::vector<size_t> vec_dsp(omp_p+1,0);
  3831. for(size_t tid=0;tid<omp_p;tid++){
  3832. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  3833. }
  3834. vec.ReInit(vec_dsp[omp_p]);
  3835. #pragma omp parallel for
  3836. for(size_t tid=0;tid<omp_p;tid++){
  3837. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  3838. }
  3839. }
  3840. { // coord_shift
  3841. typedef Real_t ElemType;
  3842. std::vector<std::vector<ElemType> >& vec_=coord_shift_;
  3843. pvfmm::Vector<ElemType>& vec=interac_data.coord_shift;
  3844. std::vector<size_t> vec_dsp(omp_p+1,0);
  3845. for(size_t tid=0;tid<omp_p;tid++){
  3846. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  3847. }
  3848. vec.ReInit(vec_dsp[omp_p]);
  3849. #pragma omp parallel for
  3850. for(size_t tid=0;tid<omp_p;tid++){
  3851. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  3852. }
  3853. }
  3854. { // interac_cnt
  3855. typedef size_t ElemType;
  3856. std::vector<std::vector<ElemType> >& vec_=interac_cnt_;
  3857. pvfmm::Vector<ElemType>& vec=interac_data.interac_cnt;
  3858. std::vector<size_t> vec_dsp(omp_p+1,0);
  3859. for(size_t tid=0;tid<omp_p;tid++){
  3860. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  3861. }
  3862. vec.ReInit(vec_dsp[omp_p]);
  3863. #pragma omp parallel for
  3864. for(size_t tid=0;tid<omp_p;tid++){
  3865. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  3866. }
  3867. }
  3868. { // interac_dsp
  3869. pvfmm::Vector<size_t>& cnt=interac_data.interac_cnt;
  3870. pvfmm::Vector<size_t>& dsp=interac_data.interac_dsp;
  3871. dsp.ReInit(cnt.Dim()); if(dsp.Dim()) dsp[0]=0;
  3872. omp_par::scan(&cnt[0],&dsp[0],dsp.Dim());
  3873. }
  3874. }
  3875. }
  3876. PtSetup(setup_data, &data);
  3877. }
  3878. template <class FMMNode>
  3879. void FMM_Pts<FMMNode>::X_List (SetupData<Real_t>& setup_data, bool device){
  3880. if(!this->MultipoleOrder()) return;
  3881. //Add X_List contribution.
  3882. this->EvalListPts(setup_data, device);
  3883. }
  3884. template <class FMMNode>
  3885. void FMM_Pts<FMMNode>::W_ListSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  3886. if(!this->MultipoleOrder()) return;
  3887. { // Set setup_data
  3888. setup_data. level=level;
  3889. setup_data.kernel=kernel->k_m2t;
  3890. setup_data. input_data=&buff[0];
  3891. setup_data.output_data=&buff[5];
  3892. setup_data. coord_data=&buff[6];
  3893. Vector<FMMNode_t*>& nodes_in =n_list[0];
  3894. Vector<FMMNode_t*>& nodes_out=n_list[5];
  3895. setup_data.nodes_in .clear();
  3896. setup_data.nodes_out.clear();
  3897. for(size_t i=0;i<nodes_in .Dim();i++) if((level==0 || level==-1) && nodes_in [i]->pt_cnt[0] ) setup_data.nodes_in .push_back(nodes_in [i]);
  3898. for(size_t i=0;i<nodes_out.Dim();i++) if((level==0 || level==-1) && nodes_out[i]->pt_cnt[1] && nodes_out[i]->IsLeaf() && !nodes_out[i]->IsGhost()) setup_data.nodes_out.push_back(nodes_out[i]);
  3899. }
  3900. struct PackedData{
  3901. size_t len;
  3902. Matrix<Real_t>* ptr;
  3903. Vector<size_t> cnt;
  3904. Vector<size_t> dsp;
  3905. };
  3906. struct InteracData{
  3907. Vector<size_t> in_node;
  3908. Vector<size_t> scal_idx;
  3909. Vector<Real_t> coord_shift;
  3910. Vector<size_t> interac_cnt;
  3911. Vector<size_t> interac_dsp;
  3912. Vector<Real_t> scal[4*MAX_DEPTH];
  3913. Matrix<Real_t> M[4];
  3914. };
  3915. struct ptSetupData{
  3916. int level;
  3917. const Kernel<Real_t>* kernel;
  3918. PackedData src_coord; // Src coord
  3919. PackedData src_value; // Src density
  3920. PackedData srf_coord; // Srf coord
  3921. PackedData srf_value; // Srf density
  3922. PackedData trg_coord; // Trg coord
  3923. PackedData trg_value; // Trg potential
  3924. InteracData interac_data;
  3925. };
  3926. ptSetupData data;
  3927. data. level=setup_data. level;
  3928. data.kernel=setup_data.kernel;
  3929. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  3930. std::vector<void*>& nodes_out=setup_data.nodes_out;
  3931. { // Set src data
  3932. std::vector<void*>& nodes=nodes_in;
  3933. PackedData& coord=data.src_coord;
  3934. PackedData& value=data.src_value;
  3935. coord.ptr=setup_data. coord_data;
  3936. value.ptr=setup_data. input_data;
  3937. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  3938. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  3939. coord.cnt.ReInit(nodes.size());
  3940. coord.dsp.ReInit(nodes.size());
  3941. value.cnt.ReInit(nodes.size());
  3942. value.dsp.ReInit(nodes.size());
  3943. #pragma omp parallel for
  3944. for(size_t i=0;i<nodes.size();i++){
  3945. ((FMMNode_t*)nodes[i])->node_id=i;
  3946. Vector<Real_t>& coord_vec=tree->upwd_equiv_surf[((FMMNode*)nodes[i])->Depth()];
  3947. Vector<Real_t>& value_vec=((FMMData*)((FMMNode*)nodes[i])->FMMData())->upward_equiv;
  3948. if(coord_vec.Dim()){
  3949. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  3950. assert(coord.dsp[i]<coord.len);
  3951. coord.cnt[i]=coord_vec.Dim();
  3952. }else{
  3953. coord.dsp[i]=0;
  3954. coord.cnt[i]=0;
  3955. }
  3956. if(value_vec.Dim()){
  3957. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  3958. assert(value.dsp[i]<value.len);
  3959. value.cnt[i]=value_vec.Dim();
  3960. }else{
  3961. value.dsp[i]=0;
  3962. value.cnt[i]=0;
  3963. }
  3964. }
  3965. }
  3966. { // Set srf data
  3967. std::vector<void*>& nodes=nodes_in;
  3968. PackedData& coord=data.srf_coord;
  3969. PackedData& value=data.srf_value;
  3970. coord.ptr=setup_data. coord_data;
  3971. value.ptr=setup_data. input_data;
  3972. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  3973. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  3974. coord.cnt.ReInit(nodes.size());
  3975. coord.dsp.ReInit(nodes.size());
  3976. value.cnt.ReInit(nodes.size());
  3977. value.dsp.ReInit(nodes.size());
  3978. #pragma omp parallel for
  3979. for(size_t i=0;i<nodes.size();i++){
  3980. coord.dsp[i]=0;
  3981. coord.cnt[i]=0;
  3982. value.dsp[i]=0;
  3983. value.cnt[i]=0;
  3984. }
  3985. }
  3986. { // Set trg data
  3987. std::vector<void*>& nodes=nodes_out;
  3988. PackedData& coord=data.trg_coord;
  3989. PackedData& value=data.trg_value;
  3990. coord.ptr=setup_data. coord_data;
  3991. value.ptr=setup_data.output_data;
  3992. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  3993. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  3994. coord.cnt.ReInit(nodes.size());
  3995. coord.dsp.ReInit(nodes.size());
  3996. value.cnt.ReInit(nodes.size());
  3997. value.dsp.ReInit(nodes.size());
  3998. #pragma omp parallel for
  3999. for(size_t i=0;i<nodes.size();i++){
  4000. Vector<Real_t>& coord_vec=((FMMNode_t*)nodes[i])->trg_coord;
  4001. Vector<Real_t>& value_vec=((FMMNode_t*)nodes[i])->trg_value;
  4002. if(coord_vec.Dim()){
  4003. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  4004. assert(coord.dsp[i]<coord.len);
  4005. coord.cnt[i]=coord_vec.Dim();
  4006. }else{
  4007. coord.dsp[i]=0;
  4008. coord.cnt[i]=0;
  4009. }
  4010. if(value_vec.Dim()){
  4011. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  4012. assert(value.dsp[i]<value.len);
  4013. value.cnt[i]=value_vec.Dim();
  4014. }else{
  4015. value.dsp[i]=0;
  4016. value.cnt[i]=0;
  4017. }
  4018. }
  4019. }
  4020. { // Set interac_data
  4021. int omp_p=omp_get_max_threads();
  4022. std::vector<std::vector<size_t> > in_node_(omp_p);
  4023. std::vector<std::vector<size_t> > scal_idx_(omp_p);
  4024. std::vector<std::vector<Real_t> > coord_shift_(omp_p);
  4025. std::vector<std::vector<size_t> > interac_cnt_(omp_p);
  4026. size_t m=this->MultipoleOrder();
  4027. size_t Nsrf=(6*(m-1)*(m-1)+2);
  4028. #pragma omp parallel for
  4029. for(size_t tid=0;tid<omp_p;tid++){
  4030. std::vector<size_t>& in_node =in_node_[tid] ;
  4031. std::vector<size_t>& scal_idx =scal_idx_[tid] ;
  4032. std::vector<Real_t>& coord_shift=coord_shift_[tid];
  4033. std::vector<size_t>& interac_cnt=interac_cnt_[tid] ;
  4034. size_t a=(nodes_out.size()*(tid+0))/omp_p;
  4035. size_t b=(nodes_out.size()*(tid+1))/omp_p;
  4036. for(size_t i=a;i<b;i++){
  4037. FMMNode_t* tnode=(FMMNode_t*)nodes_out[i];
  4038. Real_t s=std::pow(0.5,tnode->Depth());
  4039. size_t interac_cnt_=0;
  4040. { // W_Type
  4041. Mat_Type type=W_Type;
  4042. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  4043. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  4044. FMMNode_t* snode=intlst[j];
  4045. size_t snode_id=snode->node_id;
  4046. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  4047. if(snode->IsGhost() && snode->src_coord.Dim()+snode->surf_coord.Dim()==0){ // Is non-leaf ghost node
  4048. }else if(snode->IsLeaf() && snode->pt_cnt[0]<=Nsrf) continue; // skip: handled in U-list
  4049. in_node.push_back(snode_id);
  4050. scal_idx.push_back(snode->Depth());
  4051. { // set coord_shift
  4052. const int* rel_coord=interac_list.RelativeCoord(type,j);
  4053. const Real_t* scoord=snode->Coord();
  4054. const Real_t* tcoord=tnode->Coord();
  4055. Real_t shift[COORD_DIM];
  4056. shift[0]=rel_coord[0]*0.25*s-(0+0.25*s)+(tcoord[0]+0.5*s);
  4057. shift[1]=rel_coord[1]*0.25*s-(0+0.25*s)+(tcoord[1]+0.5*s);
  4058. shift[2]=rel_coord[2]*0.25*s-(0+0.25*s)+(tcoord[2]+0.5*s);
  4059. coord_shift.push_back(shift[0]);
  4060. coord_shift.push_back(shift[1]);
  4061. coord_shift.push_back(shift[2]);
  4062. }
  4063. interac_cnt_++;
  4064. }
  4065. }
  4066. interac_cnt.push_back(interac_cnt_);
  4067. }
  4068. }
  4069. { // Combine interac data
  4070. InteracData& interac_data=data.interac_data;
  4071. { // in_node
  4072. typedef size_t ElemType;
  4073. std::vector<std::vector<ElemType> >& vec_=in_node_;
  4074. pvfmm::Vector<ElemType>& vec=interac_data.in_node;
  4075. std::vector<size_t> vec_dsp(omp_p+1,0);
  4076. for(size_t tid=0;tid<omp_p;tid++){
  4077. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4078. }
  4079. vec.ReInit(vec_dsp[omp_p]);
  4080. #pragma omp parallel for
  4081. for(size_t tid=0;tid<omp_p;tid++){
  4082. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4083. }
  4084. }
  4085. { // scal_idx
  4086. typedef size_t ElemType;
  4087. std::vector<std::vector<ElemType> >& vec_=scal_idx_;
  4088. pvfmm::Vector<ElemType>& vec=interac_data.scal_idx;
  4089. std::vector<size_t> vec_dsp(omp_p+1,0);
  4090. for(size_t tid=0;tid<omp_p;tid++){
  4091. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4092. }
  4093. vec.ReInit(vec_dsp[omp_p]);
  4094. #pragma omp parallel for
  4095. for(size_t tid=0;tid<omp_p;tid++){
  4096. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4097. }
  4098. }
  4099. { // coord_shift
  4100. typedef Real_t ElemType;
  4101. std::vector<std::vector<ElemType> >& vec_=coord_shift_;
  4102. pvfmm::Vector<ElemType>& vec=interac_data.coord_shift;
  4103. std::vector<size_t> vec_dsp(omp_p+1,0);
  4104. for(size_t tid=0;tid<omp_p;tid++){
  4105. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4106. }
  4107. vec.ReInit(vec_dsp[omp_p]);
  4108. #pragma omp parallel for
  4109. for(size_t tid=0;tid<omp_p;tid++){
  4110. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4111. }
  4112. }
  4113. { // interac_cnt
  4114. typedef size_t ElemType;
  4115. std::vector<std::vector<ElemType> >& vec_=interac_cnt_;
  4116. pvfmm::Vector<ElemType>& vec=interac_data.interac_cnt;
  4117. std::vector<size_t> vec_dsp(omp_p+1,0);
  4118. for(size_t tid=0;tid<omp_p;tid++){
  4119. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4120. }
  4121. vec.ReInit(vec_dsp[omp_p]);
  4122. #pragma omp parallel for
  4123. for(size_t tid=0;tid<omp_p;tid++){
  4124. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4125. }
  4126. }
  4127. { // interac_dsp
  4128. pvfmm::Vector<size_t>& cnt=interac_data.interac_cnt;
  4129. pvfmm::Vector<size_t>& dsp=interac_data.interac_dsp;
  4130. dsp.ReInit(cnt.Dim()); if(dsp.Dim()) dsp[0]=0;
  4131. omp_par::scan(&cnt[0],&dsp[0],dsp.Dim());
  4132. }
  4133. }
  4134. }
  4135. PtSetup(setup_data, &data);
  4136. }
  4137. template <class FMMNode>
  4138. void FMM_Pts<FMMNode>::W_List (SetupData<Real_t>& setup_data, bool device){
  4139. if(!this->MultipoleOrder()) return;
  4140. //Add W_List contribution.
  4141. this->EvalListPts(setup_data, device);
  4142. }
  4143. template <class FMMNode>
  4144. void FMM_Pts<FMMNode>::U_ListSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  4145. { // Set setup_data
  4146. setup_data. level=level;
  4147. setup_data.kernel=kernel->k_s2t;
  4148. setup_data. input_data=&buff[4];
  4149. setup_data.output_data=&buff[5];
  4150. setup_data. coord_data=&buff[6];
  4151. Vector<FMMNode_t*>& nodes_in =n_list[4];
  4152. Vector<FMMNode_t*>& nodes_out=n_list[5];
  4153. setup_data.nodes_in .clear();
  4154. setup_data.nodes_out.clear();
  4155. for(size_t i=0;i<nodes_in .Dim();i++) if((level==0 || level==-1) && nodes_in [i]->pt_cnt[0] && nodes_in [i]->IsLeaf() ) setup_data.nodes_in .push_back(nodes_in [i]);
  4156. for(size_t i=0;i<nodes_out.Dim();i++) if((level==0 || level==-1) && nodes_out[i]->pt_cnt[1] && nodes_out[i]->IsLeaf() && !nodes_out[i]->IsGhost()) setup_data.nodes_out.push_back(nodes_out[i]);
  4157. }
  4158. struct PackedData{
  4159. size_t len;
  4160. Matrix<Real_t>* ptr;
  4161. Vector<size_t> cnt;
  4162. Vector<size_t> dsp;
  4163. };
  4164. struct InteracData{
  4165. Vector<size_t> in_node;
  4166. Vector<size_t> scal_idx;
  4167. Vector<Real_t> coord_shift;
  4168. Vector<size_t> interac_cnt;
  4169. Vector<size_t> interac_dsp;
  4170. Vector<Real_t> scal[4*MAX_DEPTH];
  4171. Matrix<Real_t> M[4];
  4172. };
  4173. struct ptSetupData{
  4174. int level;
  4175. const Kernel<Real_t>* kernel;
  4176. PackedData src_coord; // Src coord
  4177. PackedData src_value; // Src density
  4178. PackedData srf_coord; // Srf coord
  4179. PackedData srf_value; // Srf density
  4180. PackedData trg_coord; // Trg coord
  4181. PackedData trg_value; // Trg potential
  4182. InteracData interac_data;
  4183. };
  4184. ptSetupData data;
  4185. data. level=setup_data. level;
  4186. data.kernel=setup_data.kernel;
  4187. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  4188. std::vector<void*>& nodes_out=setup_data.nodes_out;
  4189. { // Set src data
  4190. std::vector<void*>& nodes=nodes_in;
  4191. PackedData& coord=data.src_coord;
  4192. PackedData& value=data.src_value;
  4193. coord.ptr=setup_data. coord_data;
  4194. value.ptr=setup_data. input_data;
  4195. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  4196. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  4197. coord.cnt.ReInit(nodes.size());
  4198. coord.dsp.ReInit(nodes.size());
  4199. value.cnt.ReInit(nodes.size());
  4200. value.dsp.ReInit(nodes.size());
  4201. #pragma omp parallel for
  4202. for(size_t i=0;i<nodes.size();i++){
  4203. ((FMMNode_t*)nodes[i])->node_id=i;
  4204. Vector<Real_t>& coord_vec=((FMMNode_t*)nodes[i])->src_coord;
  4205. Vector<Real_t>& value_vec=((FMMNode_t*)nodes[i])->src_value;
  4206. if(coord_vec.Dim()){
  4207. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  4208. assert(coord.dsp[i]<coord.len);
  4209. coord.cnt[i]=coord_vec.Dim();
  4210. }else{
  4211. coord.dsp[i]=0;
  4212. coord.cnt[i]=0;
  4213. }
  4214. if(value_vec.Dim()){
  4215. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  4216. assert(value.dsp[i]<value.len);
  4217. value.cnt[i]=value_vec.Dim();
  4218. }else{
  4219. value.dsp[i]=0;
  4220. value.cnt[i]=0;
  4221. }
  4222. }
  4223. }
  4224. { // Set srf data
  4225. std::vector<void*>& nodes=nodes_in;
  4226. PackedData& coord=data.srf_coord;
  4227. PackedData& value=data.srf_value;
  4228. coord.ptr=setup_data. coord_data;
  4229. value.ptr=setup_data. input_data;
  4230. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  4231. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  4232. coord.cnt.ReInit(nodes.size());
  4233. coord.dsp.ReInit(nodes.size());
  4234. value.cnt.ReInit(nodes.size());
  4235. value.dsp.ReInit(nodes.size());
  4236. #pragma omp parallel for
  4237. for(size_t i=0;i<nodes.size();i++){
  4238. Vector<Real_t>& coord_vec=((FMMNode_t*)nodes[i])->surf_coord;
  4239. Vector<Real_t>& value_vec=((FMMNode_t*)nodes[i])->surf_value;
  4240. if(coord_vec.Dim()){
  4241. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  4242. assert(coord.dsp[i]<coord.len);
  4243. coord.cnt[i]=coord_vec.Dim();
  4244. }else{
  4245. coord.dsp[i]=0;
  4246. coord.cnt[i]=0;
  4247. }
  4248. if(value_vec.Dim()){
  4249. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  4250. assert(value.dsp[i]<value.len);
  4251. value.cnt[i]=value_vec.Dim();
  4252. }else{
  4253. value.dsp[i]=0;
  4254. value.cnt[i]=0;
  4255. }
  4256. }
  4257. }
  4258. { // Set trg data
  4259. std::vector<void*>& nodes=nodes_out;
  4260. PackedData& coord=data.trg_coord;
  4261. PackedData& value=data.trg_value;
  4262. coord.ptr=setup_data. coord_data;
  4263. value.ptr=setup_data.output_data;
  4264. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  4265. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  4266. coord.cnt.ReInit(nodes.size());
  4267. coord.dsp.ReInit(nodes.size());
  4268. value.cnt.ReInit(nodes.size());
  4269. value.dsp.ReInit(nodes.size());
  4270. #pragma omp parallel for
  4271. for(size_t i=0;i<nodes.size();i++){
  4272. Vector<Real_t>& coord_vec=((FMMNode_t*)nodes[i])->trg_coord;
  4273. Vector<Real_t>& value_vec=((FMMNode_t*)nodes[i])->trg_value;
  4274. if(coord_vec.Dim()){
  4275. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  4276. assert(coord.dsp[i]<coord.len);
  4277. coord.cnt[i]=coord_vec.Dim();
  4278. }else{
  4279. coord.dsp[i]=0;
  4280. coord.cnt[i]=0;
  4281. }
  4282. if(value_vec.Dim()){
  4283. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  4284. assert(value.dsp[i]<value.len);
  4285. value.cnt[i]=value_vec.Dim();
  4286. }else{
  4287. value.dsp[i]=0;
  4288. value.cnt[i]=0;
  4289. }
  4290. }
  4291. }
  4292. { // Set interac_data
  4293. int omp_p=omp_get_max_threads();
  4294. std::vector<std::vector<size_t> > in_node_(omp_p);
  4295. std::vector<std::vector<size_t> > scal_idx_(omp_p);
  4296. std::vector<std::vector<Real_t> > coord_shift_(omp_p);
  4297. std::vector<std::vector<size_t> > interac_cnt_(omp_p);
  4298. size_t m=this->MultipoleOrder();
  4299. size_t Nsrf=(6*(m-1)*(m-1)+2);
  4300. #pragma omp parallel for
  4301. for(size_t tid=0;tid<omp_p;tid++){
  4302. std::vector<size_t>& in_node =in_node_[tid] ;
  4303. std::vector<size_t>& scal_idx =scal_idx_[tid] ;
  4304. std::vector<Real_t>& coord_shift=coord_shift_[tid];
  4305. std::vector<size_t>& interac_cnt=interac_cnt_[tid] ;
  4306. size_t a=(nodes_out.size()*(tid+0))/omp_p;
  4307. size_t b=(nodes_out.size()*(tid+1))/omp_p;
  4308. for(size_t i=a;i<b;i++){
  4309. FMMNode_t* tnode=(FMMNode_t*)nodes_out[i];
  4310. Real_t s=std::pow(0.5,tnode->Depth());
  4311. size_t interac_cnt_=0;
  4312. { // U0_Type
  4313. Mat_Type type=U0_Type;
  4314. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  4315. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  4316. FMMNode_t* snode=intlst[j];
  4317. size_t snode_id=snode->node_id;
  4318. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  4319. in_node.push_back(snode_id);
  4320. scal_idx.push_back(snode->Depth());
  4321. { // set coord_shift
  4322. const int* rel_coord=interac_list.RelativeCoord(type,j);
  4323. const Real_t* scoord=snode->Coord();
  4324. const Real_t* tcoord=tnode->Coord();
  4325. Real_t shift[COORD_DIM];
  4326. shift[0]=rel_coord[0]*0.5*s-(scoord[0]+1.0*s)+(tcoord[0]+0.5*s);
  4327. shift[1]=rel_coord[1]*0.5*s-(scoord[1]+1.0*s)+(tcoord[1]+0.5*s);
  4328. shift[2]=rel_coord[2]*0.5*s-(scoord[2]+1.0*s)+(tcoord[2]+0.5*s);
  4329. coord_shift.push_back(shift[0]);
  4330. coord_shift.push_back(shift[1]);
  4331. coord_shift.push_back(shift[2]);
  4332. }
  4333. interac_cnt_++;
  4334. }
  4335. }
  4336. { // U1_Type
  4337. Mat_Type type=U1_Type;
  4338. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  4339. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  4340. FMMNode_t* snode=intlst[j];
  4341. size_t snode_id=snode->node_id;
  4342. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  4343. in_node.push_back(snode_id);
  4344. scal_idx.push_back(snode->Depth());
  4345. { // set coord_shift
  4346. const int* rel_coord=interac_list.RelativeCoord(type,j);
  4347. const Real_t* scoord=snode->Coord();
  4348. const Real_t* tcoord=tnode->Coord();
  4349. Real_t shift[COORD_DIM];
  4350. shift[0]=rel_coord[0]*1.0*s-(scoord[0]+0.5*s)+(tcoord[0]+0.5*s);
  4351. shift[1]=rel_coord[1]*1.0*s-(scoord[1]+0.5*s)+(tcoord[1]+0.5*s);
  4352. shift[2]=rel_coord[2]*1.0*s-(scoord[2]+0.5*s)+(tcoord[2]+0.5*s);
  4353. coord_shift.push_back(shift[0]);
  4354. coord_shift.push_back(shift[1]);
  4355. coord_shift.push_back(shift[2]);
  4356. }
  4357. interac_cnt_++;
  4358. }
  4359. }
  4360. { // U2_Type
  4361. Mat_Type type=U2_Type;
  4362. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  4363. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  4364. FMMNode_t* snode=intlst[j];
  4365. size_t snode_id=snode->node_id;
  4366. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  4367. in_node.push_back(snode_id);
  4368. scal_idx.push_back(snode->Depth());
  4369. { // set coord_shift
  4370. const int* rel_coord=interac_list.RelativeCoord(type,j);
  4371. const Real_t* scoord=snode->Coord();
  4372. const Real_t* tcoord=tnode->Coord();
  4373. Real_t shift[COORD_DIM];
  4374. shift[0]=rel_coord[0]*0.25*s-(scoord[0]+0.25*s)+(tcoord[0]+0.5*s);
  4375. shift[1]=rel_coord[1]*0.25*s-(scoord[1]+0.25*s)+(tcoord[1]+0.5*s);
  4376. shift[2]=rel_coord[2]*0.25*s-(scoord[2]+0.25*s)+(tcoord[2]+0.5*s);
  4377. coord_shift.push_back(shift[0]);
  4378. coord_shift.push_back(shift[1]);
  4379. coord_shift.push_back(shift[2]);
  4380. }
  4381. interac_cnt_++;
  4382. }
  4383. }
  4384. { // X_Type
  4385. Mat_Type type=X_Type;
  4386. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  4387. if(tnode->pt_cnt[1]<=Nsrf)
  4388. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  4389. FMMNode_t* snode=intlst[j];
  4390. size_t snode_id=snode->node_id;
  4391. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  4392. in_node.push_back(snode_id);
  4393. scal_idx.push_back(snode->Depth());
  4394. { // set coord_shift
  4395. const int* rel_coord=interac_list.RelativeCoord(type,j);
  4396. const Real_t* scoord=snode->Coord();
  4397. const Real_t* tcoord=tnode->Coord();
  4398. Real_t shift[COORD_DIM];
  4399. shift[0]=rel_coord[0]*0.5*s-(scoord[0]+1.0*s)+(tcoord[0]+0.5*s);
  4400. shift[1]=rel_coord[1]*0.5*s-(scoord[1]+1.0*s)+(tcoord[1]+0.5*s);
  4401. shift[2]=rel_coord[2]*0.5*s-(scoord[2]+1.0*s)+(tcoord[2]+0.5*s);
  4402. coord_shift.push_back(shift[0]);
  4403. coord_shift.push_back(shift[1]);
  4404. coord_shift.push_back(shift[2]);
  4405. }
  4406. interac_cnt_++;
  4407. }
  4408. }
  4409. { // W_Type
  4410. Mat_Type type=W_Type;
  4411. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  4412. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  4413. FMMNode_t* snode=intlst[j];
  4414. size_t snode_id=snode->node_id;
  4415. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  4416. if(snode->IsGhost() && snode->src_coord.Dim()+snode->surf_coord.Dim()==0) continue; // Is non-leaf ghost node
  4417. if(snode->pt_cnt[0]> Nsrf) continue;
  4418. in_node.push_back(snode_id);
  4419. scal_idx.push_back(snode->Depth());
  4420. { // set coord_shift
  4421. const int* rel_coord=interac_list.RelativeCoord(type,j);
  4422. const Real_t* scoord=snode->Coord();
  4423. const Real_t* tcoord=tnode->Coord();
  4424. Real_t shift[COORD_DIM];
  4425. shift[0]=rel_coord[0]*0.25*s-(scoord[0]+0.25*s)+(tcoord[0]+0.5*s);
  4426. shift[1]=rel_coord[1]*0.25*s-(scoord[1]+0.25*s)+(tcoord[1]+0.5*s);
  4427. shift[2]=rel_coord[2]*0.25*s-(scoord[2]+0.25*s)+(tcoord[2]+0.5*s);
  4428. coord_shift.push_back(shift[0]);
  4429. coord_shift.push_back(shift[1]);
  4430. coord_shift.push_back(shift[2]);
  4431. }
  4432. interac_cnt_++;
  4433. }
  4434. }
  4435. interac_cnt.push_back(interac_cnt_);
  4436. }
  4437. }
  4438. { // Combine interac data
  4439. InteracData& interac_data=data.interac_data;
  4440. { // in_node
  4441. typedef size_t ElemType;
  4442. std::vector<std::vector<ElemType> >& vec_=in_node_;
  4443. pvfmm::Vector<ElemType>& vec=interac_data.in_node;
  4444. std::vector<size_t> vec_dsp(omp_p+1,0);
  4445. for(size_t tid=0;tid<omp_p;tid++){
  4446. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4447. }
  4448. vec.ReInit(vec_dsp[omp_p]);
  4449. #pragma omp parallel for
  4450. for(size_t tid=0;tid<omp_p;tid++){
  4451. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4452. }
  4453. }
  4454. { // scal_idx
  4455. typedef size_t ElemType;
  4456. std::vector<std::vector<ElemType> >& vec_=scal_idx_;
  4457. pvfmm::Vector<ElemType>& vec=interac_data.scal_idx;
  4458. std::vector<size_t> vec_dsp(omp_p+1,0);
  4459. for(size_t tid=0;tid<omp_p;tid++){
  4460. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4461. }
  4462. vec.ReInit(vec_dsp[omp_p]);
  4463. #pragma omp parallel for
  4464. for(size_t tid=0;tid<omp_p;tid++){
  4465. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4466. }
  4467. }
  4468. { // coord_shift
  4469. typedef Real_t ElemType;
  4470. std::vector<std::vector<ElemType> >& vec_=coord_shift_;
  4471. pvfmm::Vector<ElemType>& vec=interac_data.coord_shift;
  4472. std::vector<size_t> vec_dsp(omp_p+1,0);
  4473. for(size_t tid=0;tid<omp_p;tid++){
  4474. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4475. }
  4476. vec.ReInit(vec_dsp[omp_p]);
  4477. #pragma omp parallel for
  4478. for(size_t tid=0;tid<omp_p;tid++){
  4479. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4480. }
  4481. }
  4482. { // interac_cnt
  4483. typedef size_t ElemType;
  4484. std::vector<std::vector<ElemType> >& vec_=interac_cnt_;
  4485. pvfmm::Vector<ElemType>& vec=interac_data.interac_cnt;
  4486. std::vector<size_t> vec_dsp(omp_p+1,0);
  4487. for(size_t tid=0;tid<omp_p;tid++){
  4488. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4489. }
  4490. vec.ReInit(vec_dsp[omp_p]);
  4491. #pragma omp parallel for
  4492. for(size_t tid=0;tid<omp_p;tid++){
  4493. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4494. }
  4495. }
  4496. { // interac_dsp
  4497. pvfmm::Vector<size_t>& cnt=interac_data.interac_cnt;
  4498. pvfmm::Vector<size_t>& dsp=interac_data.interac_dsp;
  4499. dsp.ReInit(cnt.Dim()); if(dsp.Dim()) dsp[0]=0;
  4500. omp_par::scan(&cnt[0],&dsp[0],dsp.Dim());
  4501. }
  4502. }
  4503. }
  4504. PtSetup(setup_data, &data);
  4505. }
  4506. template <class FMMNode>
  4507. void FMM_Pts<FMMNode>::U_List (SetupData<Real_t>& setup_data, bool device){
  4508. //Add U_List contribution.
  4509. this->EvalListPts(setup_data, device);
  4510. }
  4511. template <class FMMNode>
  4512. void FMM_Pts<FMMNode>::Down2TargetSetup(SetupData<Real_t>& setup_data, FMMTree_t* tree, std::vector<Matrix<Real_t> >& buff, std::vector<Vector<FMMNode_t*> >& n_list, int level, bool device){
  4513. if(!this->MultipoleOrder()) return;
  4514. { // Set setup_data
  4515. setup_data. level=level;
  4516. setup_data.kernel=kernel->k_l2t;
  4517. setup_data. input_data=&buff[1];
  4518. setup_data.output_data=&buff[5];
  4519. setup_data. coord_data=&buff[6];
  4520. Vector<FMMNode_t*>& nodes_in =n_list[1];
  4521. Vector<FMMNode_t*>& nodes_out=n_list[5];
  4522. setup_data.nodes_in .clear();
  4523. setup_data.nodes_out.clear();
  4524. for(size_t i=0;i<nodes_in .Dim();i++) if((nodes_in [i]->Depth()==level || level==-1) && nodes_in [i]->pt_cnt[1] && nodes_in [i]->IsLeaf() && !nodes_in [i]->IsGhost()) setup_data.nodes_in .push_back(nodes_in [i]);
  4525. for(size_t i=0;i<nodes_out.Dim();i++) if((nodes_out[i]->Depth()==level || level==-1) && nodes_out[i]->pt_cnt[1] && nodes_out[i]->IsLeaf() && !nodes_out[i]->IsGhost()) setup_data.nodes_out.push_back(nodes_out[i]);
  4526. }
  4527. struct PackedData{
  4528. size_t len;
  4529. Matrix<Real_t>* ptr;
  4530. Vector<size_t> cnt;
  4531. Vector<size_t> dsp;
  4532. };
  4533. struct InteracData{
  4534. Vector<size_t> in_node;
  4535. Vector<size_t> scal_idx;
  4536. Vector<Real_t> coord_shift;
  4537. Vector<size_t> interac_cnt;
  4538. Vector<size_t> interac_dsp;
  4539. Vector<Real_t> scal[4*MAX_DEPTH];
  4540. Matrix<Real_t> M[4];
  4541. };
  4542. struct ptSetupData{
  4543. int level;
  4544. const Kernel<Real_t>* kernel;
  4545. PackedData src_coord; // Src coord
  4546. PackedData src_value; // Src density
  4547. PackedData srf_coord; // Srf coord
  4548. PackedData srf_value; // Srf density
  4549. PackedData trg_coord; // Trg coord
  4550. PackedData trg_value; // Trg potential
  4551. InteracData interac_data;
  4552. };
  4553. ptSetupData data;
  4554. data. level=setup_data. level;
  4555. data.kernel=setup_data.kernel;
  4556. std::vector<void*>& nodes_in =setup_data.nodes_in ;
  4557. std::vector<void*>& nodes_out=setup_data.nodes_out;
  4558. { // Set src data
  4559. std::vector<void*>& nodes=nodes_in;
  4560. PackedData& coord=data.src_coord;
  4561. PackedData& value=data.src_value;
  4562. coord.ptr=setup_data. coord_data;
  4563. value.ptr=setup_data. input_data;
  4564. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  4565. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  4566. coord.cnt.ReInit(nodes.size());
  4567. coord.dsp.ReInit(nodes.size());
  4568. value.cnt.ReInit(nodes.size());
  4569. value.dsp.ReInit(nodes.size());
  4570. #pragma omp parallel for
  4571. for(size_t i=0;i<nodes.size();i++){
  4572. ((FMMNode_t*)nodes[i])->node_id=i;
  4573. Vector<Real_t>& coord_vec=tree->dnwd_equiv_surf[((FMMNode*)nodes[i])->Depth()];
  4574. Vector<Real_t>& value_vec=((FMMData*)((FMMNode*)nodes[i])->FMMData())->dnward_equiv;
  4575. if(coord_vec.Dim()){
  4576. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  4577. assert(coord.dsp[i]<coord.len);
  4578. coord.cnt[i]=coord_vec.Dim();
  4579. }else{
  4580. coord.dsp[i]=0;
  4581. coord.cnt[i]=0;
  4582. }
  4583. if(value_vec.Dim()){
  4584. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  4585. assert(value.dsp[i]<value.len);
  4586. value.cnt[i]=value_vec.Dim();
  4587. }else{
  4588. value.dsp[i]=0;
  4589. value.cnt[i]=0;
  4590. }
  4591. }
  4592. }
  4593. { // Set srf data
  4594. std::vector<void*>& nodes=nodes_in;
  4595. PackedData& coord=data.srf_coord;
  4596. PackedData& value=data.srf_value;
  4597. coord.ptr=setup_data. coord_data;
  4598. value.ptr=setup_data. input_data;
  4599. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  4600. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  4601. coord.cnt.ReInit(nodes.size());
  4602. coord.dsp.ReInit(nodes.size());
  4603. value.cnt.ReInit(nodes.size());
  4604. value.dsp.ReInit(nodes.size());
  4605. #pragma omp parallel for
  4606. for(size_t i=0;i<nodes.size();i++){
  4607. coord.dsp[i]=0;
  4608. coord.cnt[i]=0;
  4609. value.dsp[i]=0;
  4610. value.cnt[i]=0;
  4611. }
  4612. }
  4613. { // Set trg data
  4614. std::vector<void*>& nodes=nodes_out;
  4615. PackedData& coord=data.trg_coord;
  4616. PackedData& value=data.trg_value;
  4617. coord.ptr=setup_data. coord_data;
  4618. value.ptr=setup_data.output_data;
  4619. coord.len=coord.ptr->Dim(0)*coord.ptr->Dim(1);
  4620. value.len=value.ptr->Dim(0)*value.ptr->Dim(1);
  4621. coord.cnt.ReInit(nodes.size());
  4622. coord.dsp.ReInit(nodes.size());
  4623. value.cnt.ReInit(nodes.size());
  4624. value.dsp.ReInit(nodes.size());
  4625. #pragma omp parallel for
  4626. for(size_t i=0;i<nodes.size();i++){
  4627. Vector<Real_t>& coord_vec=((FMMNode_t*)nodes[i])->trg_coord;
  4628. Vector<Real_t>& value_vec=((FMMNode_t*)nodes[i])->trg_value;
  4629. if(coord_vec.Dim()){
  4630. coord.dsp[i]=&coord_vec[0]-coord.ptr[0][0];
  4631. assert(coord.dsp[i]<coord.len);
  4632. coord.cnt[i]=coord_vec.Dim();
  4633. }else{
  4634. coord.dsp[i]=0;
  4635. coord.cnt[i]=0;
  4636. }
  4637. if(value_vec.Dim()){
  4638. value.dsp[i]=&value_vec[0]-value.ptr[0][0];
  4639. assert(value.dsp[i]<value.len);
  4640. value.cnt[i]=value_vec.Dim();
  4641. }else{
  4642. value.dsp[i]=0;
  4643. value.cnt[i]=0;
  4644. }
  4645. }
  4646. }
  4647. { // Set interac_data
  4648. int omp_p=omp_get_max_threads();
  4649. std::vector<std::vector<size_t> > in_node_(omp_p);
  4650. std::vector<std::vector<size_t> > scal_idx_(omp_p);
  4651. std::vector<std::vector<Real_t> > coord_shift_(omp_p);
  4652. std::vector<std::vector<size_t> > interac_cnt_(omp_p);
  4653. if(this->ScaleInvar()){ // Set scal
  4654. const Kernel<Real_t>* ker=kernel->k_l2l;
  4655. for(size_t l=0;l<MAX_DEPTH;l++){ // scal[l*4+0]
  4656. Vector<Real_t>& scal=data.interac_data.scal[l*4+0];
  4657. Vector<Real_t>& scal_exp=ker->trg_scal;
  4658. scal.ReInit(scal_exp.Dim());
  4659. for(size_t i=0;i<scal.Dim();i++){
  4660. scal[i]=std::pow(2.0,-scal_exp[i]*l);
  4661. }
  4662. }
  4663. for(size_t l=0;l<MAX_DEPTH;l++){ // scal[l*4+1]
  4664. Vector<Real_t>& scal=data.interac_data.scal[l*4+1];
  4665. Vector<Real_t>& scal_exp=ker->src_scal;
  4666. scal.ReInit(scal_exp.Dim());
  4667. for(size_t i=0;i<scal.Dim();i++){
  4668. scal[i]=std::pow(2.0,-scal_exp[i]*l);
  4669. }
  4670. }
  4671. }
  4672. #pragma omp parallel for
  4673. for(size_t tid=0;tid<omp_p;tid++){
  4674. std::vector<size_t>& in_node =in_node_[tid] ;
  4675. std::vector<size_t>& scal_idx =scal_idx_[tid] ;
  4676. std::vector<Real_t>& coord_shift=coord_shift_[tid];
  4677. std::vector<size_t>& interac_cnt=interac_cnt_[tid];
  4678. size_t a=(nodes_out.size()*(tid+0))/omp_p;
  4679. size_t b=(nodes_out.size()*(tid+1))/omp_p;
  4680. for(size_t i=a;i<b;i++){
  4681. FMMNode_t* tnode=(FMMNode_t*)nodes_out[i];
  4682. Real_t s=std::pow(0.5,tnode->Depth());
  4683. size_t interac_cnt_=0;
  4684. { // D2T_Type
  4685. Mat_Type type=D2T_Type;
  4686. Vector<FMMNode_t*>& intlst=tnode->interac_list[type];
  4687. for(size_t j=0;j<intlst.Dim();j++) if(intlst[j]){
  4688. FMMNode_t* snode=intlst[j];
  4689. size_t snode_id=snode->node_id;
  4690. if(snode_id>=nodes_in.size() || nodes_in[snode_id]!=snode) continue;
  4691. in_node.push_back(snode_id);
  4692. scal_idx.push_back(snode->Depth());
  4693. { // set coord_shift
  4694. const int* rel_coord=interac_list.RelativeCoord(type,j);
  4695. const Real_t* scoord=snode->Coord();
  4696. const Real_t* tcoord=tnode->Coord();
  4697. Real_t shift[COORD_DIM];
  4698. shift[0]=rel_coord[0]*0.5*s-(0+0.5*s)+(tcoord[0]+0.5*s);
  4699. shift[1]=rel_coord[1]*0.5*s-(0+0.5*s)+(tcoord[1]+0.5*s);
  4700. shift[2]=rel_coord[2]*0.5*s-(0+0.5*s)+(tcoord[2]+0.5*s);
  4701. coord_shift.push_back(shift[0]);
  4702. coord_shift.push_back(shift[1]);
  4703. coord_shift.push_back(shift[2]);
  4704. }
  4705. interac_cnt_++;
  4706. }
  4707. }
  4708. interac_cnt.push_back(interac_cnt_);
  4709. }
  4710. }
  4711. { // Combine interac data
  4712. InteracData& interac_data=data.interac_data;
  4713. { // in_node
  4714. typedef size_t ElemType;
  4715. std::vector<std::vector<ElemType> >& vec_=in_node_;
  4716. pvfmm::Vector<ElemType>& vec=interac_data.in_node;
  4717. std::vector<size_t> vec_dsp(omp_p+1,0);
  4718. for(size_t tid=0;tid<omp_p;tid++){
  4719. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4720. }
  4721. vec.ReInit(vec_dsp[omp_p]);
  4722. #pragma omp parallel for
  4723. for(size_t tid=0;tid<omp_p;tid++){
  4724. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4725. }
  4726. }
  4727. { // scal_idx
  4728. typedef size_t ElemType;
  4729. std::vector<std::vector<ElemType> >& vec_=scal_idx_;
  4730. pvfmm::Vector<ElemType>& vec=interac_data.scal_idx;
  4731. std::vector<size_t> vec_dsp(omp_p+1,0);
  4732. for(size_t tid=0;tid<omp_p;tid++){
  4733. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4734. }
  4735. vec.ReInit(vec_dsp[omp_p]);
  4736. #pragma omp parallel for
  4737. for(size_t tid=0;tid<omp_p;tid++){
  4738. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4739. }
  4740. }
  4741. { // coord_shift
  4742. typedef Real_t ElemType;
  4743. std::vector<std::vector<ElemType> >& vec_=coord_shift_;
  4744. pvfmm::Vector<ElemType>& vec=interac_data.coord_shift;
  4745. std::vector<size_t> vec_dsp(omp_p+1,0);
  4746. for(size_t tid=0;tid<omp_p;tid++){
  4747. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4748. }
  4749. vec.ReInit(vec_dsp[omp_p]);
  4750. #pragma omp parallel for
  4751. for(size_t tid=0;tid<omp_p;tid++){
  4752. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4753. }
  4754. }
  4755. { // interac_cnt
  4756. typedef size_t ElemType;
  4757. std::vector<std::vector<ElemType> >& vec_=interac_cnt_;
  4758. pvfmm::Vector<ElemType>& vec=interac_data.interac_cnt;
  4759. std::vector<size_t> vec_dsp(omp_p+1,0);
  4760. for(size_t tid=0;tid<omp_p;tid++){
  4761. vec_dsp[tid+1]=vec_dsp[tid]+vec_[tid].size();
  4762. }
  4763. vec.ReInit(vec_dsp[omp_p]);
  4764. #pragma omp parallel for
  4765. for(size_t tid=0;tid<omp_p;tid++){
  4766. memcpy(&vec[0]+vec_dsp[tid],&vec_[tid][0],vec_[tid].size()*sizeof(ElemType));
  4767. }
  4768. }
  4769. { // interac_dsp
  4770. pvfmm::Vector<size_t>& cnt=interac_data.interac_cnt;
  4771. pvfmm::Vector<size_t>& dsp=interac_data.interac_dsp;
  4772. dsp.ReInit(cnt.Dim()); if(dsp.Dim()) dsp[0]=0;
  4773. omp_par::scan(&cnt[0],&dsp[0],dsp.Dim());
  4774. }
  4775. }
  4776. { // Set M[0], M[1]
  4777. InteracData& interac_data=data.interac_data;
  4778. pvfmm::Vector<size_t>& cnt=interac_data.interac_cnt;
  4779. pvfmm::Vector<size_t>& dsp=interac_data.interac_dsp;
  4780. if(cnt.Dim() && cnt[cnt.Dim()-1]+dsp[dsp.Dim()-1]){
  4781. data.interac_data.M[0]=this->mat->Mat(level, DC2DE0_Type, 0);
  4782. data.interac_data.M[1]=this->mat->Mat(level, DC2DE1_Type, 0);
  4783. }else{
  4784. data.interac_data.M[0].ReInit(0,0);
  4785. data.interac_data.M[1].ReInit(0,0);
  4786. }
  4787. }
  4788. }
  4789. PtSetup(setup_data, &data);
  4790. }
  4791. template <class FMMNode>
  4792. void FMM_Pts<FMMNode>::Down2Target(SetupData<Real_t>& setup_data, bool device){
  4793. if(!this->MultipoleOrder()) return;
  4794. //Add Down2Target contribution.
  4795. this->EvalListPts(setup_data, device);
  4796. }
  4797. template <class FMMNode>
  4798. void FMM_Pts<FMMNode>::PostProcessing(std::vector<FMMNode_t*>& nodes){
  4799. }
  4800. template <class FMMNode>
  4801. void FMM_Pts<FMMNode>::CopyOutput(FMMNode** nodes, size_t n){
  4802. }
  4803. }//end namespace