BeModule.cpp 88 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700
  1. #include "BeModule.h"
  2. #include "../Beef/BfCommon.h"
  3. #include "../Compiler/BfUtil.h"
  4. #include "BeefySysLib/util/BeefPerf.h"
  5. #include "BeefySysLib/util/StackHelper.h"
  6. #include "../Compiler/BfIRCodeGen.h"
  7. #include "llvm/IR/DIBuilder.h"
  8. #include "BeefySysLib/util/AllocDebug.h"
  9. USING_NS_BF;
  10. //////////////////////////////////////////////////////////////////////////
  11. void bpt(Beefy::BeType* t)
  12. {
  13. Beefy::String str;
  14. if (t->IsStruct())
  15. BeModule::StructToString(str, (BeStructType*)t);
  16. else
  17. {
  18. BeModule::ToString(str, t);
  19. str += "\n";
  20. }
  21. OutputDebugStrF("%s", str.c_str());
  22. if (t->IsPointer())
  23. {
  24. bpt(((BePointerType*)t)->mElementType);
  25. }
  26. }
  27. void bpv(Beefy::BeValue* val)
  28. {
  29. BeDumpContext dumpCtx;
  30. String str;
  31. dumpCtx.ToString(str, val);
  32. str += "\n";
  33. OutputDebugStr(str);
  34. auto type = val->GetType();
  35. if (type != NULL)
  36. bpt(type);
  37. }
  38. //////////////////////////////////////////////////////////////////////////
  39. void BeValueVisitor::VisitChild(BeValue* value)
  40. {
  41. if (value != NULL)
  42. value->Accept(this);
  43. }
  44. BeValue* BeInliner::Remap(BeValue* srcValue)
  45. {
  46. if (srcValue == NULL)
  47. return NULL;
  48. // Try to unwrap mdnode
  49. if (auto inlinedScope = BeValueDynCast<BeDbgInlinedScope>(srcValue))
  50. srcValue = inlinedScope->mScope;
  51. BeValue** valuePtr = NULL;
  52. /*auto itr = mValueMap.find(srcValue);
  53. if (itr != mValueMap.end())
  54. return itr->second;*/
  55. if (mValueMap.TryGetValue(srcValue, &valuePtr))
  56. return *valuePtr;
  57. BeMDNode* wrapMDNode = NULL;
  58. if (auto dbgFunction = BeValueDynCast<BeDbgFunction>(srcValue))
  59. {
  60. wrapMDNode = dbgFunction;
  61. }
  62. if (auto dbgLexBlock = BeValueDynCast<BeDbgLexicalBlock>(srcValue))
  63. {
  64. wrapMDNode = dbgLexBlock;
  65. }
  66. if (auto callInst = BeValueDynCast<BeCallInst>(srcValue))
  67. {
  68. if (callInst->mInlineResult != NULL)
  69. return Remap(callInst->mInlineResult);
  70. }
  71. if (wrapMDNode != NULL)
  72. {
  73. auto destMDNode = mOwnedValueVec->Alloc<BeDbgInlinedScope>();
  74. destMDNode->mScope = wrapMDNode;
  75. mValueMap[srcValue] = destMDNode;
  76. return destMDNode;
  77. }
  78. return srcValue;
  79. }
  80. // Insert 'mCallInst->mDbgLoc' at the head of the inline chain
  81. BeDbgLoc* BeInliner::ExtendInlineDbgLoc(BeDbgLoc* srcInlineAt)
  82. {
  83. if (srcInlineAt == NULL)
  84. return mCallInst->mDbgLoc;
  85. /*auto itr = mInlinedAtMap.find(srcInlineAt);
  86. if (itr != mInlinedAtMap.end())
  87. {
  88. return itr->second;
  89. }*/
  90. BeDbgLoc** dbgLocPtr = NULL;
  91. if (mInlinedAtMap.TryGetValue(srcInlineAt, &dbgLocPtr))
  92. return *dbgLocPtr;
  93. auto dbgLoc = mModule->mAlloc.Alloc<BeDbgLoc>();
  94. dbgLoc->mLine = srcInlineAt->mLine;
  95. dbgLoc->mColumn = srcInlineAt->mColumn;
  96. dbgLoc->mDbgScope = (BeMDNode*)Remap(srcInlineAt->mDbgScope);
  97. dbgLoc->mIdx = mModule->mCurDbgLocIdx++;
  98. dbgLoc->mDbgInlinedAt = ExtendInlineDbgLoc(srcInlineAt->mDbgInlinedAt);
  99. mInlinedAtMap[srcInlineAt] = dbgLoc;
  100. return dbgLoc;
  101. }
  102. void BeInliner::AddInst(BeInst* destInst, BeInst* srcInst)
  103. {
  104. if ((srcInst != NULL) && (srcInst->mDbgLoc != mSrcDbgLoc))
  105. {
  106. mSrcDbgLoc = srcInst->mDbgLoc;
  107. if (mSrcDbgLoc == NULL)
  108. {
  109. mDestDbgLoc = NULL;
  110. }
  111. else
  112. {
  113. BeDbgLoc* inlinedAt = ExtendInlineDbgLoc(mSrcDbgLoc->mDbgInlinedAt);
  114. mModule->SetCurrentDebugLocation(mSrcDbgLoc->mLine, mSrcDbgLoc->mColumn, (BeMDNode*)Remap(mSrcDbgLoc->mDbgScope), inlinedAt);
  115. mDestDbgLoc = mModule->mCurDbgLoc;
  116. }
  117. }
  118. if (srcInst != NULL)
  119. destInst->mName = srcInst->mName;
  120. destInst->mDbgLoc = mDestDbgLoc;
  121. destInst->mParentBlock = mDestBlock;
  122. mDestBlock->mInstructions.push_back(destInst);
  123. if (srcInst != NULL)
  124. mValueMap[srcInst] = destInst;
  125. }
  126. void BeInliner::Visit(BeValue* beValue)
  127. {
  128. }
  129. void BeInliner::Visit(BeBlock* beBlock)
  130. {
  131. }
  132. void BeInliner::Visit(BeArgument* beArgument)
  133. {
  134. }
  135. void BeInliner::Visit(BeInst* beInst)
  136. {
  137. BF_FATAL("Not handled");
  138. }
  139. void BeInliner::Visit(BeNopInst* nopInst)
  140. {
  141. auto destNopInst = AllocInst(nopInst);
  142. }
  143. void BeInliner::Visit(BeUnreachableInst* unreachableInst)
  144. {
  145. auto destUnreachableInst = AllocInst(unreachableInst);
  146. }
  147. void BeInliner::Visit(BeEnsureInstructionAtInst* ensureCodeAtInst)
  148. {
  149. auto destEnsureCodeAtInst = AllocInst(ensureCodeAtInst);
  150. }
  151. void BeInliner::Visit(BeUndefValueInst* undefValue)
  152. {
  153. auto destUndefValue = AllocInst(undefValue);
  154. destUndefValue->mType = undefValue->mType;
  155. }
  156. void BeInliner::Visit(BeExtractValueInst* extractValue)
  157. {
  158. auto destExtractValue = AllocInst(extractValue);
  159. destExtractValue->mAggVal = Remap(extractValue->mAggVal);
  160. destExtractValue->mIdx = extractValue->mIdx;
  161. }
  162. void BeInliner::Visit(BeInsertValueInst* insertValue)
  163. {
  164. auto destInsertValue = AllocInst(insertValue);
  165. destInsertValue->mAggVal = Remap(insertValue->mAggVal);
  166. destInsertValue->mMemberVal = Remap(insertValue->mMemberVal);
  167. destInsertValue->mIdx = insertValue->mIdx;
  168. }
  169. void BeInliner::Visit(BeNumericCastInst* castInst)
  170. {
  171. auto destCastInset = AllocInst(castInst);
  172. destCastInset->mValue = Remap(castInst->mValue);
  173. destCastInset->mToType = castInst->mToType;
  174. destCastInset->mValSigned = castInst->mValSigned;
  175. destCastInset->mToSigned = castInst->mToSigned;
  176. }
  177. void BeInliner::Visit(BeBitCastInst* castInst)
  178. {
  179. auto destCastInst = AllocInst(castInst);
  180. destCastInst->mValue = Remap(castInst->mValue);
  181. destCastInst->mToType = castInst->mToType;
  182. }
  183. void BeInliner::Visit(BeNegInst* negInst)
  184. {
  185. auto destNegInst = AllocInst(negInst);
  186. destNegInst->mValue = Remap(negInst->mValue);
  187. }
  188. void BeInliner::Visit(BeNotInst* notInst)
  189. {
  190. auto destNotInst = AllocInst(notInst);
  191. destNotInst->mValue = Remap(notInst->mValue);
  192. }
  193. void BeInliner::Visit(BeBinaryOpInst* binaryOpInst)
  194. {
  195. auto destBinaryOp = AllocInst(binaryOpInst);
  196. destBinaryOp->mOpKind = binaryOpInst->mOpKind;
  197. destBinaryOp->mLHS = Remap(binaryOpInst->mLHS);
  198. destBinaryOp->mRHS = Remap(binaryOpInst->mRHS);
  199. }
  200. void BeInliner::Visit(BeCmpInst* cmpInst)
  201. {
  202. auto destCmpInst = AllocInst(cmpInst);
  203. destCmpInst->mCmpKind = cmpInst->mCmpKind;
  204. destCmpInst->mLHS = Remap(cmpInst->mLHS);
  205. destCmpInst->mRHS = Remap(cmpInst->mRHS);
  206. }
  207. void BeInliner::Visit(BeFenceInst* fenceInst)
  208. {
  209. auto destFenceInst = AllocInst(fenceInst);
  210. }
  211. void BeInliner::Visit(BeStackSaveInst* stackSaveInst)
  212. {
  213. auto destStackSaveInst = AllocInst(stackSaveInst);
  214. }
  215. void BeInliner::Visit(BeStackRestoreInst* stackRestoreInst)
  216. {
  217. auto destStackRestoreInst = AllocInst(stackRestoreInst);
  218. destStackRestoreInst->mStackVal = Remap(stackRestoreInst->mStackVal);
  219. }
  220. void BeInliner::Visit(BeObjectAccessCheckInst* objectAccessCheckInst)
  221. {
  222. auto destObjectAccessCheckInst = AllocInst(objectAccessCheckInst);
  223. destObjectAccessCheckInst->mValue = Remap(objectAccessCheckInst->mValue);
  224. }
  225. void BeInliner::Visit(BeAllocaInst* allocaInst)
  226. {
  227. auto destAllocInst = AllocInst(allocaInst);
  228. destAllocInst->mType = allocaInst->mType;
  229. destAllocInst->mArraySize = Remap(allocaInst->mArraySize);
  230. destAllocInst->mAlign = allocaInst->mAlign;
  231. destAllocInst->mNoChkStk = allocaInst->mNoChkStk;
  232. destAllocInst->mForceMem = allocaInst->mForceMem;
  233. }
  234. void BeInliner::Visit(BeAliasValueInst* aliasValueInst)
  235. {
  236. auto destlifetimeStartInst = AllocInst(aliasValueInst);
  237. destlifetimeStartInst->mPtr = Remap(aliasValueInst->mPtr);
  238. }
  239. void BeInliner::Visit(BeLifetimeExtendInst* lifetimeExtendInst)
  240. {
  241. auto destlifetimeExtendInst = AllocInst(lifetimeExtendInst);
  242. destlifetimeExtendInst->mPtr = Remap(lifetimeExtendInst->mPtr);
  243. }
  244. void BeInliner::Visit(BeLifetimeStartInst* lifetimeStartInst)
  245. {
  246. auto destlifetimeStartInst = AllocInst(lifetimeStartInst);
  247. destlifetimeStartInst->mPtr = Remap(lifetimeStartInst->mPtr);
  248. }
  249. void BeInliner::Visit(BeLifetimeEndInst* lifetimeEndInst)
  250. {
  251. auto destlifetimeEndInst = AllocInst(lifetimeEndInst);
  252. destlifetimeEndInst->mPtr = Remap(lifetimeEndInst->mPtr);
  253. }
  254. void BeInliner::Visit(BeLifetimeSoftEndInst* lifetimeEndInst)
  255. {
  256. auto destlifetimeEndInst = AllocInst(lifetimeEndInst);
  257. destlifetimeEndInst->mPtr = Remap(lifetimeEndInst->mPtr);
  258. }
  259. void BeInliner::Visit(BeLifetimeFenceInst* lifetimeFenceInst)
  260. {
  261. auto destlifetimeFenceInst = AllocInst(lifetimeFenceInst);
  262. destlifetimeFenceInst->mFenceBlock = (BeBlock*)Remap(lifetimeFenceInst->mFenceBlock);
  263. destlifetimeFenceInst->mPtr = Remap(lifetimeFenceInst->mPtr);
  264. }
  265. void BeInliner::Visit(BeValueScopeStartInst* valueScopeStartInst)
  266. {
  267. auto destValueScopeStartInst = AllocInst(valueScopeStartInst);
  268. }
  269. void BeInliner::Visit(BeValueScopeRetainInst* valueScopeRetainInst)
  270. {
  271. auto destValueScopeRetainInst = AllocInst(valueScopeRetainInst);
  272. destValueScopeRetainInst->mValue = Remap(valueScopeRetainInst->mValue);
  273. }
  274. void BeInliner::Visit(BeValueScopeEndInst* valueScopeEndInst)
  275. {
  276. auto destValueScopeEndInst = AllocInst(valueScopeEndInst);
  277. destValueScopeEndInst->mScopeStart = (BeValueScopeStartInst*)Remap(valueScopeEndInst->mScopeStart);
  278. destValueScopeEndInst->mIsSoft = valueScopeEndInst->mIsSoft;
  279. }
  280. void BeInliner::Visit(BeLoadInst* loadInst)
  281. {
  282. auto destLoadInst = AllocInst(loadInst);
  283. destLoadInst->mTarget = Remap(loadInst->mTarget);
  284. }
  285. void BeInliner::Visit(BeStoreInst* storeInst)
  286. {
  287. auto destStoreInst = AllocInst(storeInst);
  288. destStoreInst->mPtr = Remap(storeInst->mPtr);
  289. destStoreInst->mVal = Remap(storeInst->mVal);
  290. }
  291. void BeInliner::Visit(BeSetCanMergeInst* setCanMergeInst)
  292. {
  293. auto destSetCanMergeInst = AllocInst(setCanMergeInst);
  294. destSetCanMergeInst->mVal = Remap(setCanMergeInst->mVal);
  295. }
  296. void BeInliner::Visit(BeMemSetInst* memSetInst)
  297. {
  298. auto destMemSetInst = AllocInst(memSetInst);
  299. destMemSetInst->mAddr = Remap(memSetInst->mAddr);
  300. destMemSetInst->mVal = Remap(memSetInst->mVal);
  301. destMemSetInst->mSize = Remap(memSetInst->mSize);
  302. destMemSetInst->mAlignment = memSetInst->mAlignment;
  303. }
  304. void BeInliner::Visit(BeGEPInst* gepInst)
  305. {
  306. auto destGEPInst = AllocInst(gepInst);
  307. destGEPInst->mPtr = Remap(gepInst->mPtr);
  308. destGEPInst->mIdx0 = Remap(gepInst->mIdx0);
  309. destGEPInst->mIdx1 = Remap(gepInst->mIdx1);
  310. }
  311. void BeInliner::Visit(BeBrInst* brInst)
  312. {
  313. auto destBrInst = AllocInst(brInst);
  314. destBrInst->mTargetBlock = (BeBlock*)Remap(brInst->mTargetBlock);
  315. destBrInst->mNoCollapse = brInst->mNoCollapse;
  316. destBrInst->mIsFake = brInst->mIsFake;
  317. }
  318. void BeInliner::Visit(BeCondBrInst* condBrInst)
  319. {
  320. auto destCondBrInst = AllocInst(condBrInst);
  321. destCondBrInst->mCond = Remap(condBrInst->mCond);
  322. destCondBrInst->mTrueBlock = (BeBlock*)Remap(condBrInst->mTrueBlock);
  323. destCondBrInst->mFalseBlock = (BeBlock*)Remap(condBrInst->mFalseBlock);
  324. }
  325. void BeInliner::Visit(BePhiIncoming* phiIncomingInst)
  326. {
  327. }
  328. void BeInliner::Visit(BePhiInst* phiInst)
  329. {
  330. auto destPhiInst = AllocInst(phiInst);
  331. for (auto incoming : phiInst->mIncoming)
  332. {
  333. auto destPhiIncoming = mAlloc->Alloc<BePhiIncoming>();
  334. destPhiIncoming->mValue = Remap(incoming->mValue);
  335. destPhiIncoming->mBlock = (BeBlock*)Remap(incoming->mBlock);
  336. destPhiInst->mIncoming.push_back(destPhiIncoming);
  337. }
  338. destPhiInst->mType = phiInst->mType;
  339. }
  340. void BeInliner::Visit(BeSwitchInst* switchInst)
  341. {
  342. auto destSwitchInst = AllocInstOwned(switchInst);
  343. destSwitchInst->mValue = Remap(switchInst->mValue);
  344. destSwitchInst->mDefaultBlock = (BeBlock*)Remap(switchInst->mDefaultBlock);
  345. for (auto& switchCase : switchInst->mCases)
  346. {
  347. BeSwitchCase destSwitchCase;
  348. destSwitchCase.mBlock = (BeBlock*)Remap(switchCase.mBlock);
  349. destSwitchCase.mValue = switchCase.mValue;
  350. destSwitchInst->mCases.push_back(destSwitchCase);
  351. }
  352. }
  353. void BeInliner::Visit(BeRetInst* retInst)
  354. {
  355. auto destRetInst = AllocInst(retInst);
  356. destRetInst->mRetValue = Remap(retInst->mRetValue);
  357. }
  358. void BeInliner::Visit(BeCallInst* callInst)
  359. {
  360. auto destCallInst = AllocInstOwned(callInst);
  361. destCallInst->mFunc = Remap(callInst->mFunc);
  362. for (auto& arg : callInst->mArgs)
  363. {
  364. auto copiedArg = arg;
  365. copiedArg.mValue = Remap(arg.mValue);
  366. destCallInst->mArgs.push_back(copiedArg);
  367. }
  368. destCallInst->mNoReturn = callInst->mNoReturn;
  369. destCallInst->mTailCall = callInst->mTailCall;
  370. }
  371. void BeInliner::Visit(BeDbgDeclareInst* dbgDeclareInst)
  372. {
  373. auto destDbgDeclareInst = AllocInst(dbgDeclareInst);
  374. destDbgDeclareInst->mDbgVar = (BeDbgVariable*)Remap(dbgDeclareInst->mDbgVar);
  375. destDbgDeclareInst->mValue = Remap(dbgDeclareInst->mValue);
  376. }
  377. //////////////////////////////////////////////////////////////////////////
  378. BeType* BeConstant::GetType()
  379. {
  380. return mType;
  381. }
  382. void BeConstant::GetData(BeConstData& data)
  383. {
  384. auto type = GetType();
  385. while ((((int)data.mData.size()) % type->mAlign) != 0)
  386. data.mData.push_back(0);
  387. if (type->IsComposite())
  388. {
  389. for (int i = 0; i < type->mSize; i++)
  390. data.mData.push_back(0); // Aggregate
  391. }
  392. else if (type->mTypeCode == BeTypeCode_Float)
  393. {
  394. float f = mDouble;
  395. data.mData.Insert(data.mData.mSize, (uint8*)&f, sizeof(float));
  396. }
  397. else
  398. {
  399. data.mData.Insert(data.mData.mSize, &mUInt8, type->mSize);
  400. }
  401. }
  402. void BeConstant::HashContent(BeHashContext& hashCtx)
  403. {
  404. hashCtx.Mixin(TypeId);
  405. mType->HashReference(hashCtx);
  406. if (mType->mTypeCode < BeTypeCode_Struct)
  407. {
  408. hashCtx.Mixin(mUInt64);
  409. }
  410. else if (mType->IsPointer())
  411. {
  412. if (mTarget != NULL)
  413. mTarget->HashReference(hashCtx);
  414. else
  415. hashCtx.Mixin(-1);
  416. }
  417. else if (mType->IsComposite())
  418. {
  419. // Zero-init
  420. BF_ASSERT(mTarget == NULL);
  421. }
  422. else
  423. BF_FATAL("NotImpl");
  424. }
  425. void BeStructConstant::GetData(BeConstData& data)
  426. {
  427. for (auto val : mMemberValues)
  428. val->GetData(data);
  429. }
  430. BeType* BeGEP1Constant::GetType()
  431. {
  432. BePointerType* ptrType = (BePointerType*)mTarget->GetType();
  433. return ptrType;
  434. }
  435. BeType* BeGEP2Constant::GetType()
  436. {
  437. BePointerType* ptrType = (BePointerType*)mTarget->GetType();
  438. BF_ASSERT(ptrType->mTypeCode == BeTypeCode_Pointer);
  439. if (ptrType->mElementType->mTypeCode == BeTypeCode_SizedArray)
  440. {
  441. BeSizedArrayType* arrayType = (BeSizedArrayType*)ptrType->mElementType;
  442. BF_ASSERT(arrayType->mTypeCode == BeTypeCode_SizedArray);
  443. return arrayType->mContext->GetPointerTo(arrayType->mElementType);
  444. }
  445. else if (ptrType->mElementType->mTypeCode == BeTypeCode_Vector)
  446. {
  447. BeVectorType* arrayType = (BeVectorType*)ptrType->mElementType;
  448. BF_ASSERT(arrayType->mTypeCode == BeTypeCode_Vector);
  449. return arrayType->mContext->GetPointerTo(arrayType->mElementType);
  450. }
  451. /*else if (ptrType->mElementType->IsPointer())
  452. {
  453. return ptrType->mElementType;
  454. }*/
  455. else
  456. {
  457. BeStructType* structType = (BeStructType*)ptrType->mElementType;
  458. BF_ASSERT(structType->mTypeCode == BeTypeCode_Struct);
  459. return structType->mContext->GetPointerTo(structType->mMembers[mIdx1].mType);
  460. }
  461. }
  462. BeType* BeExtractValueConstant::GetType()
  463. {
  464. BeType* type = mTarget->GetType();
  465. if (type->mTypeCode == BeTypeCode_SizedArray)
  466. {
  467. BeSizedArrayType* arrayType = (BeSizedArrayType*)type;
  468. BF_ASSERT(arrayType->mTypeCode == BeTypeCode_SizedArray);
  469. return arrayType->mElementType;
  470. }
  471. else if (type->mTypeCode == BeTypeCode_Vector)
  472. {
  473. BeVectorType* arrayType = (BeVectorType*)type;
  474. BF_ASSERT(arrayType->mTypeCode == BeTypeCode_Vector);
  475. return arrayType->mElementType;
  476. }
  477. /*else if (ptrType->mElementType->IsPointer())
  478. {
  479. return ptrType->mElementType;
  480. }*/
  481. else
  482. {
  483. BeStructType* structType = (BeStructType*)type;
  484. BF_ASSERT(structType->mTypeCode == BeTypeCode_Struct);
  485. return structType->mMembers[mIdx0].mType;
  486. }
  487. }
  488. BeType* BeGlobalVariable::GetType()
  489. {
  490. //if (mIsConstant)
  491. //return mType;
  492. return mModule->mContext->GetPointerTo(mType);
  493. }
  494. void BeFunction::HashContent(BeHashContext& hashCtx)
  495. {
  496. hashCtx.Mixin(TypeId);
  497. hashCtx.MixinStr(mName);
  498. hashCtx.Mixin(mLinkageType);
  499. hashCtx.Mixin(mAlwaysInline);
  500. hashCtx.Mixin(mNoUnwind);
  501. hashCtx.Mixin(mUWTable);
  502. hashCtx.Mixin(mNoReturn);
  503. hashCtx.Mixin(mNoFramePointerElim);
  504. hashCtx.Mixin(mIsDLLExport);
  505. hashCtx.Mixin(mIsDLLImport);
  506. hashCtx.Mixin(mCallingConv);
  507. for (auto block : mBlocks)
  508. block->HashReference(hashCtx);
  509. for (auto& param : mParams)
  510. {
  511. hashCtx.MixinStr(param.mName);
  512. hashCtx.Mixin(param.mNoAlias);
  513. hashCtx.Mixin(param.mNoCapture);
  514. hashCtx.Mixin(param.mStructRet);
  515. hashCtx.Mixin(param.mZExt);
  516. hashCtx.Mixin(param.mDereferenceableSize);
  517. hashCtx.Mixin(param.mByValSize);
  518. }
  519. if (mDbgFunction != NULL)
  520. mDbgFunction->HashReference(hashCtx);
  521. if (mRemapBindVar != NULL)
  522. mRemapBindVar->HashReference(hashCtx);
  523. }
  524. void BeBlock::HashContent(BeHashContext& hashCtx)
  525. {
  526. hashCtx.Mixin(TypeId);
  527. hashCtx.MixinStr(mName);
  528. hashCtx.Mixin(mInstructions.size());
  529. for (auto inst : mInstructions)
  530. inst->HashReference(hashCtx);
  531. }
  532. void BeInst::HashContent(BeHashContext& hashCtx)
  533. {
  534. HashInst(hashCtx);
  535. if (mName != NULL)
  536. hashCtx.MixinStr(mName);
  537. if (mDbgLoc != NULL)
  538. mDbgLoc->HashReference(hashCtx);
  539. }
  540. BeType* BeNumericCastInst::GetType()
  541. {
  542. return mToType;
  543. }
  544. BeType* BeBitCastInst::GetType()
  545. {
  546. return mToType;
  547. }
  548. BeType* BeNegInst::GetType()
  549. {
  550. return mValue->GetType();
  551. }
  552. BeType* BeNotInst::GetType()
  553. {
  554. return mValue->GetType();
  555. }
  556. BeType* BeBinaryOpInst::GetType()
  557. {
  558. return mLHS->GetType();
  559. }
  560. BeContext* BeInst::GetContext()
  561. {
  562. return mParentBlock->mFunction->mModule->mContext;
  563. }
  564. BeModule* BeInst::GetModule()
  565. {
  566. return mParentBlock->mFunction->mModule;
  567. }
  568. void BeInst::SetName(const StringImpl& name)
  569. {
  570. char* nameStr = (char*)GetModule()->mAlloc.AllocBytes((int)name.length() + 1);
  571. strcpy(nameStr, name.c_str());
  572. mName = nameStr;
  573. }
  574. BeType* BeLoadInst::GetType()
  575. {
  576. auto type = mTarget->GetType();
  577. BF_ASSERT(type->mTypeCode == BeTypeCode_Pointer);
  578. BePointerType* pointerType = (BePointerType*)type;
  579. return pointerType->mElementType;
  580. }
  581. BeType* BeUndefValueInst::GetType()
  582. {
  583. return mType;
  584. }
  585. BeType* BeExtractValueInst::GetType()
  586. {
  587. auto aggType = mAggVal->GetType();
  588. if (aggType->mTypeCode == BeTypeCode_SizedArray)
  589. {
  590. BeSizedArrayType* arrayType = (BeSizedArrayType*)aggType;
  591. return arrayType->mElementType;
  592. }
  593. if (aggType->mTypeCode == BeTypeCode_Vector)
  594. {
  595. BeVectorType* arrayType = (BeVectorType*)aggType;
  596. return arrayType->mElementType;
  597. }
  598. BF_ASSERT(aggType->mTypeCode == BeTypeCode_Struct);
  599. BeStructType* structType = (BeStructType*)aggType;
  600. return structType->mMembers[mIdx].mType;
  601. }
  602. BeType* BeInsertValueInst::GetType()
  603. {
  604. return mAggVal->GetType();
  605. }
  606. BeType* BeCmpInst::GetType()
  607. {
  608. return GetContext()->GetPrimitiveType(BeTypeCode_Boolean);
  609. }
  610. BeType* BeAllocaInst::GetType()
  611. {
  612. auto context = GetContext();
  613. return context->GetPointerTo(mType);
  614. }
  615. BeType * BeValueScopeStartInst::GetType()
  616. {
  617. auto context = GetContext();
  618. return context->GetPrimitiveType(BeTypeCode_Int32);
  619. }
  620. BeType* BeGEPInst::GetType()
  621. {
  622. if (mIdx1 == NULL)
  623. return mPtr->GetType();
  624. BePointerType* ptrType = (BePointerType*)mPtr->GetType();
  625. BF_ASSERT(ptrType->mTypeCode == BeTypeCode_Pointer);
  626. auto elementType = ptrType->mElementType;
  627. if (elementType->IsStruct())
  628. {
  629. BeStructType* structType = (BeStructType*)ptrType->mElementType;
  630. BF_ASSERT(structType->mTypeCode == BeTypeCode_Struct);
  631. auto constIdx1 = BeValueDynCast<BeConstant>(mIdx1);
  632. return GetContext()->GetPointerTo(structType->mMembers[constIdx1->mInt64].mType);
  633. }
  634. else if (elementType->IsSizedArray())
  635. {
  636. BeSizedArrayType* arrayType = (BeSizedArrayType*)ptrType->mElementType;
  637. return GetContext()->GetPointerTo(arrayType->mElementType);
  638. }
  639. else if (elementType->IsVector())
  640. {
  641. BeVectorType* arrayType = (BeVectorType*)ptrType->mElementType;
  642. return GetContext()->GetPointerTo(arrayType->mElementType);
  643. }
  644. else
  645. {
  646. BF_FATAL("Bad type");
  647. return NULL;
  648. }
  649. }
  650. bool BeBlock::IsEmpty()
  651. {
  652. return mInstructions.size() == 0;
  653. }
  654. BeType* BeCallInst::GetType()
  655. {
  656. if (mInlineResult != NULL)
  657. return mInlineResult->GetType();
  658. auto type = mFunc->GetType();
  659. if (type == NULL)
  660. {
  661. if (auto intrin = BeValueDynCast<BeIntrinsic>(mFunc))
  662. return intrin->mReturnType;
  663. return type;
  664. }
  665. while (type->mTypeCode == BeTypeCode_Pointer)
  666. type = ((BePointerType*)type)->mElementType;
  667. auto funcType = (BeFunctionType*)(type);
  668. if (funcType == NULL)
  669. return NULL;
  670. BF_ASSERT(funcType->mTypeCode == BeTypeCode_Function);
  671. return funcType->mReturnType;
  672. }
  673. BeType* BePhiInst::GetType()
  674. {
  675. return mType;
  676. }
  677. BeType* BeArgument::GetType()
  678. {
  679. return mModule->mActiveFunction->GetFuncType()->mParams[mArgIdx].mType;
  680. }
  681. void BeDbgDeclareInst::HashInst(BeHashContext& hashCtx)
  682. {
  683. hashCtx.Mixin(TypeId);
  684. mDbgVar->HashReference(hashCtx);
  685. mValue->HashReference(hashCtx);
  686. hashCtx.Mixin(mIsValue);
  687. }
  688. void BeDbgStructType::HashContent(BeHashContext& hashCtx)
  689. {
  690. hashCtx.Mixin(TypeId);
  691. hashCtx.MixinStr(mName);
  692. if (mDerivedFrom != NULL)
  693. mDerivedFrom->HashReference(hashCtx);
  694. for (auto member : mMembers)
  695. member->HashReference(hashCtx);
  696. for (auto method : mMethods)
  697. method->HashReference(hashCtx);
  698. hashCtx.Mixin(mIsFullyDefined);
  699. hashCtx.Mixin(mIsStatic);
  700. mDefFile->HashReference(hashCtx);
  701. hashCtx.Mixin(mDefLine);
  702. }
  703. //////////////////////////////////////////////////////////////////////////
  704. void BeDbgLexicalBlock::HashContent(BeHashContext& hashCtx)
  705. {
  706. hashCtx.Mixin(TypeId);
  707. mFile->HashReference(hashCtx);
  708. mScope->HashReference(hashCtx);
  709. }
  710. //////////////////////////////////////////////////////////////////////////
  711. BeDbgFunction* BeDbgLoc::GetDbgFunc()
  712. {
  713. auto checkScope = mDbgScope;
  714. while (checkScope != NULL)
  715. {
  716. if (auto inlinedScope = BeValueDynCast<BeDbgInlinedScope>(checkScope))
  717. {
  718. checkScope = inlinedScope->mScope;
  719. }
  720. if (auto dbgFunc = BeValueDynCast<BeDbgFunction>(checkScope))
  721. {
  722. return dbgFunc;
  723. }
  724. else if (auto dbgLexBlock = BeValueDynCast<BeDbgLexicalBlock>(checkScope))
  725. {
  726. checkScope = dbgLexBlock->mScope;
  727. }
  728. else
  729. return NULL;
  730. }
  731. return NULL;
  732. }
  733. BeDbgFile* BeDbgLoc::GetDbgFile()
  734. {
  735. auto checkScope = mDbgScope;
  736. while (checkScope != NULL)
  737. {
  738. if (auto inlinedScope = BeValueDynCast<BeDbgInlinedScope>(checkScope))
  739. {
  740. checkScope = inlinedScope->mScope;
  741. }
  742. if (auto dbgFile = BeValueDynCast<BeDbgFile>(checkScope))
  743. {
  744. return dbgFile;
  745. }
  746. else if (auto dbgStruct = BeValueDynCast<BeDbgStructType>(checkScope))
  747. {
  748. checkScope = dbgStruct->mScope;
  749. }
  750. else if (auto dbgEnum = BeValueDynCast<BeDbgEnumType>(checkScope))
  751. {
  752. checkScope = dbgEnum->mScope;
  753. }
  754. else if (auto dbgNamespace = BeValueDynCast<BeDbgNamespace>(checkScope))
  755. {
  756. checkScope = dbgNamespace->mScope;
  757. }
  758. else if (auto dbgFunc = BeValueDynCast<BeDbgFunction>(checkScope))
  759. {
  760. return dbgFunc->mFile;
  761. }
  762. else if (auto dbgLexBlock = BeValueDynCast<BeDbgLexicalBlock>(checkScope))
  763. {
  764. return dbgLexBlock->mFile;
  765. }
  766. else
  767. return NULL;
  768. }
  769. return NULL;
  770. }
  771. BeDbgLoc* BeDbgLoc::GetInlinedAt(int idx)
  772. {
  773. if (idx == -1)
  774. return this;
  775. auto checkDbgLoc = mDbgInlinedAt;
  776. for (int i = 0; i < idx; i++)
  777. checkDbgLoc = checkDbgLoc->mDbgInlinedAt;
  778. return checkDbgLoc;
  779. }
  780. BeDbgLoc* BeDbgLoc::GetRoot()
  781. {
  782. auto checkDbgLoc = this;
  783. while (checkDbgLoc->mDbgInlinedAt != NULL)
  784. checkDbgLoc = checkDbgLoc->mDbgInlinedAt;
  785. return checkDbgLoc;
  786. }
  787. int BeDbgLoc::GetInlineDepth()
  788. {
  789. int inlineDepth = 0;
  790. auto checkDbgLoc = mDbgInlinedAt;
  791. while (checkDbgLoc != NULL)
  792. {
  793. inlineDepth++;
  794. checkDbgLoc = checkDbgLoc->mDbgInlinedAt;
  795. }
  796. return inlineDepth;
  797. }
  798. int BeDbgLoc::GetInlineMatchDepth(BeDbgLoc* other)
  799. {
  800. int inlineDepth = GetInlineDepth();
  801. int otherInlineDepth = other->GetInlineDepth();
  802. int matchDepth = 0;
  803. while (true)
  804. {
  805. if ((matchDepth >= inlineDepth) || (matchDepth >= otherInlineDepth))
  806. break;
  807. int inlineIdx = inlineDepth - matchDepth - 1;
  808. int otherInlineIdx = otherInlineDepth - matchDepth - 1;
  809. auto inlinedAt = GetInlinedAt(inlineIdx);
  810. auto otherInlinedAt = other->GetInlinedAt(otherInlineIdx);
  811. if (inlinedAt != otherInlinedAt)
  812. break;
  813. if ((otherInlineIdx == 0) || (inlineIdx == 0))
  814. {
  815. // At the current scope, make sure we're refererring to the same method...
  816. auto funcScope = GetInlinedAt(inlineIdx - 1);
  817. auto otherFuncScope = other->GetInlinedAt(otherInlineIdx - 1);
  818. auto dbgFunc = funcScope->GetDbgFunc();
  819. auto otherDbgFunc = otherFuncScope->GetDbgFunc();
  820. if (dbgFunc != otherDbgFunc)
  821. {
  822. // Same invocation position but different method...
  823. break;
  824. }
  825. }
  826. matchDepth++;
  827. }
  828. /*int matchDepth = 0;
  829. while (true)
  830. {
  831. if ((matchDepth >= inlineDepth) || (matchDepth >= otherInlineDepth))
  832. break;
  833. if (GetInlinedAt(inlineDepth - matchDepth - 1) != other->GetInlinedAt(otherInlineDepth - matchDepth - 1))
  834. break;
  835. matchDepth++;
  836. }*/
  837. return matchDepth;
  838. }
  839. void BeDbgFunction::HashContent(BeHashContext& hashCtx)
  840. {
  841. hashCtx.Mixin(TypeId);
  842. if (mFile != NULL)
  843. mFile->HashReference(hashCtx);
  844. hashCtx.Mixin(mLine);
  845. hashCtx.MixinStr(mName);
  846. hashCtx.MixinStr(mLinkageName);
  847. mType->HashReference(hashCtx);
  848. for (auto genericArg : mGenericArgs)
  849. genericArg->HashReference(hashCtx);
  850. for (auto genericConstValueArgs : mGenericArgs)
  851. genericConstValueArgs->HashReference(hashCtx);
  852. if (mValue != NULL)
  853. mValue->HashReference(hashCtx);
  854. hashCtx.Mixin(mIsLocalToUnit);
  855. hashCtx.Mixin(mIsStaticMethod);
  856. hashCtx.Mixin(mFlags);
  857. hashCtx.Mixin(mVK);
  858. hashCtx.Mixin(mVIndex);
  859. hashCtx.Mixin(mVariables.size());
  860. for (auto& variable : mVariables)
  861. {
  862. if (variable == NULL)
  863. hashCtx.Mixin(-1);
  864. else
  865. variable->HashReference(hashCtx);
  866. }
  867. hashCtx.Mixin(mPrologSize);
  868. hashCtx.Mixin(mCodeLen);
  869. }
  870. void BeDbgStructType::SetMembers(SizedArrayImpl<BeMDNode*>& members)
  871. {
  872. mIsFullyDefined = true;
  873. BF_ASSERT(mMembers.size() == 0);
  874. for (auto member : members)
  875. {
  876. if (auto inheritance = BeValueDynCast<BeDbgInheritance>(member))
  877. {
  878. BF_ASSERT(mDerivedFrom == NULL);
  879. mDerivedFrom = inheritance->mBaseType;
  880. }
  881. else if (auto structMember = BeValueDynCast<BeDbgStructMember>(member))
  882. {
  883. mMembers.push_back(structMember);
  884. }
  885. else if (auto dbgMethod = BeValueDynCast<BeDbgFunction>(member))
  886. {
  887. dbgMethod->mIncludedAsMember = true;
  888. mMethods.push_back(dbgMethod);
  889. }
  890. else
  891. BF_FATAL("bad");
  892. }
  893. }
  894. void BeDbgEnumType::SetMembers(SizedArrayImpl<BeMDNode*>& members)
  895. {
  896. mIsFullyDefined = true;
  897. BF_ASSERT(mMembers.size() == 0);
  898. for (auto member : members)
  899. {
  900. if (auto enumMember = BeValueDynCast<BeDbgEnumMember>(member))
  901. {
  902. mMembers.push_back(enumMember);
  903. }
  904. else
  905. BF_FATAL("bad");
  906. }
  907. }
  908. //////////////////////////////////////////////////////////////////////////
  909. void BeDumpContext::ToString(StringImpl& str, BeValue* value, bool showType, bool mdDrillDown, bool checkStack)
  910. {
  911. if (checkStack)
  912. {
  913. BP_ZONE("CreateValueFromExpression:CheckStack");
  914. StackHelper stackHelper;
  915. if (!stackHelper.CanStackExpand(64 * 1024))
  916. {
  917. if (!stackHelper.Execute([&]()
  918. {
  919. ToString(str, value, showType, mdDrillDown, false);
  920. }))
  921. {
  922. //Fail("Expression too complex to compile", expr);
  923. str += "!!!FAILED!!!";
  924. }
  925. return;
  926. }
  927. }
  928. if (value == NULL)
  929. {
  930. str += "<null>";
  931. return;
  932. }
  933. if (auto mdNode = BeValueDynCast<BeMDNode>(value))
  934. {
  935. if (auto dbgInlinedScope = BeValueDynCast<BeDbgInlinedScope>(mdNode))
  936. {
  937. str += "Inlined:";
  938. ToString(str, dbgInlinedScope->mScope);
  939. return;
  940. }
  941. if (auto dbgType = BeValueDynCast<BeDbgTypeId>(mdNode))
  942. {
  943. str += StrFormat("DbgTypeId: %d", dbgType->mTypeId);
  944. return;
  945. }
  946. if (auto dbgVar = BeValueDynCast<BeDbgVariable>(mdNode))
  947. {
  948. ToString(str, dbgVar->mType);
  949. str += " ";
  950. str += dbgVar->mName;
  951. return;
  952. }
  953. if (auto dbgVar = BeValueDynCast<BeDbgVariable>(mdNode))
  954. {
  955. ToString(str, dbgVar->mType);
  956. str += " ";
  957. str += dbgVar->mName;
  958. return;
  959. }
  960. if (auto dbgFile = BeValueDynCast<BeDbgFile>(mdNode))
  961. {
  962. str += dbgFile->mFileName;
  963. return;
  964. }
  965. if (auto dbgFunc = BeValueDynCast<BeDbgFunction>(mdNode))
  966. {
  967. if (auto parentType = BeValueDynCast<BeDbgType>(dbgFunc->mScope))
  968. {
  969. ToString(str, dbgFunc->mScope);
  970. str += ".";
  971. }
  972. else if (auto dbgNamespace = BeValueDynCast<BeDbgNamespace>(dbgFunc->mScope))
  973. {
  974. ToString(str, dbgNamespace->mScope);
  975. str += ".";
  976. }
  977. str += dbgFunc->mName;
  978. if (mdDrillDown)
  979. {
  980. str += ":";
  981. ToString(str, dbgFunc->mFile, true, true);
  982. }
  983. return;
  984. }
  985. if (auto lexBlock = BeValueDynCast<BeDbgLexicalBlock>(mdNode))
  986. {
  987. str += "{";
  988. str += StrFormat("%d@", lexBlock->mId);
  989. ToString(str, lexBlock->mFile);
  990. str += ":";
  991. ToString(str, lexBlock->mScope, true, false, true);
  992. return;
  993. }
  994. if (auto dbgType = BeValueDynCast<BeDbgBasicType>(mdNode))
  995. {
  996. if (dbgType->mEncoding == llvm::dwarf::DW_ATE_address)
  997. {
  998. if (dbgType->mSize == 0)
  999. str += "void";
  1000. else
  1001. str += "addr";
  1002. return;
  1003. }
  1004. else if (dbgType->mEncoding == llvm::dwarf::DW_ATE_signed)
  1005. {
  1006. str += "int";
  1007. }
  1008. else if (dbgType->mEncoding == llvm::dwarf::DW_ATE_unsigned)
  1009. {
  1010. str += "uint";
  1011. }
  1012. else if (dbgType->mEncoding == llvm::dwarf::DW_ATE_float)
  1013. {
  1014. if (dbgType->mSize == 4)
  1015. str += "float";
  1016. else
  1017. str += "double";
  1018. return;
  1019. }
  1020. else if (dbgType->mEncoding == llvm::dwarf::DW_ATE_unsigned_char)
  1021. str += "uchar";
  1022. else if (dbgType->mEncoding == llvm::dwarf::DW_ATE_signed_char)
  1023. str += "char";
  1024. else if (dbgType->mEncoding == llvm::dwarf::DW_ATE_boolean)
  1025. {
  1026. if (dbgType->mSize == 1)
  1027. {
  1028. str += "bool";
  1029. return;
  1030. }
  1031. str += "bool";
  1032. }
  1033. else
  1034. str += "???";
  1035. str += StrFormat("%d", dbgType->mSize * 8);
  1036. return;
  1037. }
  1038. if (auto dbgType = BeValueDynCast<BeDbgPointerType>(mdNode))
  1039. {
  1040. ToString(str, dbgType->mElement);
  1041. str += "*";
  1042. return;
  1043. }
  1044. if (auto dbgType = BeValueDynCast<BeDbgReferenceType>(mdNode))
  1045. {
  1046. ToString(str, dbgType->mElement);
  1047. str += "&";
  1048. return;
  1049. }
  1050. if (auto dbgType = BeValueDynCast<BeDbgConstType>(mdNode))
  1051. {
  1052. str += "const ";
  1053. ToString(str, dbgType->mElement);
  1054. return;
  1055. }
  1056. if (auto dbgType = BeValueDynCast<BeDbgArtificialType>(mdNode))
  1057. {
  1058. str += "artificial ";
  1059. ToString(str, dbgType->mElement);
  1060. return;
  1061. }
  1062. if (auto dbgType = BeValueDynCast<BeDbgNamespace>(mdNode))
  1063. {
  1064. if ((BeValueDynCast<BeDbgStructType>(dbgType->mScope) != NULL) ||
  1065. (BeValueDynCast<BeDbgNamespace>(dbgType->mScope) != NULL))
  1066. {
  1067. ToString(str, dbgType->mScope);
  1068. str += ".";
  1069. str += dbgType->mName;
  1070. return;
  1071. }
  1072. else
  1073. str += dbgType->mName;
  1074. return;
  1075. }
  1076. if (auto dbgType = BeValueDynCast<BeDbgStructType>(mdNode))
  1077. {
  1078. if ((BeValueDynCast<BeDbgStructType>(dbgType->mScope) != NULL) ||
  1079. (BeValueDynCast<BeDbgNamespace>(dbgType->mScope) != NULL))
  1080. {
  1081. ToString(str, dbgType->mScope);
  1082. str += ".";
  1083. str += dbgType->mName;
  1084. return;
  1085. }
  1086. else
  1087. str += dbgType->mName;
  1088. return;
  1089. }
  1090. if (auto dbgType = BeValueDynCast<BeDbgEnumType>(mdNode))
  1091. {
  1092. if ((BeValueDynCast<BeDbgStructType>(dbgType->mScope) != NULL) ||
  1093. (BeValueDynCast<BeDbgNamespace>(dbgType->mScope) != NULL))
  1094. {
  1095. ToString(str, dbgType->mScope);
  1096. str += ".";
  1097. str += dbgType->mName;
  1098. return;
  1099. }
  1100. else
  1101. str += dbgType->mName;
  1102. return;
  1103. }
  1104. if (auto dbgType = BeValueDynCast<BeDbgArrayType>(mdNode))
  1105. {
  1106. ToString(str, dbgType->mElement);
  1107. str += "[";
  1108. str += StrFormat("%d", dbgType->mNumElements);
  1109. str += "]";
  1110. return;
  1111. }
  1112. if (auto dbgLoc = BeValueDynCast<BeDbgLoc>(mdNode))
  1113. {
  1114. str += StrFormat("@%d ", dbgLoc->mIdx);
  1115. ToString(str, dbgLoc->mDbgScope, true, true);
  1116. str += StrFormat(":%d:%d", dbgLoc->mLine + 1, dbgLoc->mColumn + 1);
  1117. if (dbgLoc->mDbgInlinedAt)
  1118. {
  1119. str += " inlined at ";
  1120. ToString(str, dbgLoc->mDbgInlinedAt, true, true);
  1121. }
  1122. return;
  1123. }
  1124. if (auto inheritance = BeValueDynCast<BeDbgInheritance>(mdNode))
  1125. {
  1126. str += "inherit ";
  1127. ToString(str, inheritance->mBaseType);
  1128. return;
  1129. }
  1130. if (auto dbgMember = BeValueDynCast<BeDbgStructMember>(mdNode))
  1131. {
  1132. if (dbgMember->mIsStatic)
  1133. str += "static ";
  1134. ToString(str, dbgMember->mType);
  1135. str += " ";
  1136. str += dbgMember->mName;
  1137. if (!dbgMember->mIsStatic)
  1138. {
  1139. str += " offset:";
  1140. str += StrFormat("%d", dbgMember->mOffset);
  1141. }
  1142. if (dbgMember->mStaticValue != NULL)
  1143. str += " " + ToString(dbgMember->mStaticValue);
  1144. return;
  1145. }
  1146. if (auto dbgMember = BeValueDynCast<BeDbgEnumMember>(mdNode))
  1147. {
  1148. str += dbgMember->mName;
  1149. str += " ";
  1150. str += StrFormat("%lld", dbgMember->mValue);
  1151. return;
  1152. }
  1153. str += "?MDNode?";
  1154. return;
  1155. }
  1156. if (auto globalVar = BeValueDynCast<BeGlobalVariable>(value))
  1157. {
  1158. ToString(str, globalVar->GetType());
  1159. str += " ";
  1160. str += globalVar->mName;
  1161. return;
  1162. }
  1163. if (auto constantGEP = BeValueDynCast<BeGEP1Constant>(value))
  1164. {
  1165. str += "ConstGEP1 ";
  1166. ToString(str, constantGEP->mTarget);
  1167. str += StrFormat(" %d %d", constantGEP->mIdx0);
  1168. return;
  1169. }
  1170. if (auto constantGEP = BeValueDynCast<BeGEP2Constant>(value))
  1171. {
  1172. str += "ConstGEP2 ";
  1173. ToString(str, constantGEP->mTarget);
  1174. str += StrFormat(" %d %d", constantGEP->mIdx0, constantGEP->mIdx1);
  1175. return;
  1176. }
  1177. if (auto constantExtract = BeValueDynCast<BeExtractValueConstant>(value))
  1178. {
  1179. str += "ConstExtract ";
  1180. ToString(str, constantExtract->mTarget);
  1181. str += StrFormat(" %d", constantExtract->mIdx0);
  1182. return;
  1183. }
  1184. if (auto arg = BeValueDynCast<BeArgument>(value))
  1185. {
  1186. auto activeFunction = arg->mModule->mActiveFunction;
  1187. auto& typeParam = activeFunction->GetFuncType()->mParams[arg->mArgIdx];
  1188. auto& param = activeFunction->mParams[arg->mArgIdx];
  1189. if (showType)
  1190. {
  1191. BeModule::ToString(str, typeParam.mType);
  1192. str += " %";
  1193. str += param.mName;
  1194. }
  1195. else
  1196. {
  1197. str += "%";
  1198. str += param.mName;
  1199. }
  1200. return;
  1201. }
  1202. if (auto func = BeValueDynCast<BeFunction>(value))
  1203. {
  1204. str += func->mName;
  1205. return;
  1206. }
  1207. if (auto constant = BeValueDynCast<BeStructConstant>(value))
  1208. {
  1209. if (showType)
  1210. {
  1211. BeModule::ToString(str, constant->mType);
  1212. str += " ";
  1213. }
  1214. str += "(";
  1215. switch (constant->mType->mTypeCode)
  1216. {
  1217. case BeTypeCode_Struct:
  1218. case BeTypeCode_SizedArray:
  1219. case BeTypeCode_Vector:
  1220. for (int valIdx = 0; valIdx < (int)constant->mMemberValues.size(); valIdx++)
  1221. {
  1222. if (valIdx > 0)
  1223. str += ", ";
  1224. ToString(str, constant->mMemberValues[valIdx], false);
  1225. }
  1226. break;
  1227. default:
  1228. BF_FATAL("NotImpl");
  1229. break;
  1230. }
  1231. str += ")";
  1232. return;
  1233. }
  1234. if (auto constant = BeValueDynCast<BeUndefConstant>(value))
  1235. {
  1236. if (showType)
  1237. {
  1238. BeModule::ToString(str, constant->mType);
  1239. str += " ";
  1240. }
  1241. str += "undef";
  1242. return;
  1243. }
  1244. if (auto constant = BeValueDynCast<BeCastConstant>(value))
  1245. {
  1246. ToString(str, constant->mType);
  1247. str += " cast ";
  1248. ToString(str, constant->mTarget);
  1249. return;
  1250. }
  1251. if (auto constant = BeValueDynCast<BeGEP1Constant>(value))
  1252. {
  1253. ToString(str, constant->GetType());
  1254. str += " gep (";
  1255. ToString(str, constant->mTarget);
  1256. str += StrFormat(", %d)", constant->mIdx0);
  1257. return;
  1258. }
  1259. if (auto constant = BeValueDynCast<BeGEP2Constant>(value))
  1260. {
  1261. ToString(str, constant->GetType());
  1262. str += " gep (";
  1263. ToString(str, constant->mTarget);
  1264. str += StrFormat(", %d, %d)", constant->mIdx0, constant->mIdx1);
  1265. return;
  1266. }
  1267. if (auto constant = BeValueDynCast<BeExtractValueConstant>(value))
  1268. {
  1269. ToString(str, constant->GetType());
  1270. str += " extract (";
  1271. ToString(str, constant->mTarget);
  1272. str += StrFormat(", %d)", constant->mIdx0);
  1273. return;
  1274. }
  1275. if (auto constant = BeValueDynCast<BeStructConstant>(value))
  1276. {
  1277. ToString(str, constant->GetType());
  1278. str += " (";
  1279. for (int i = 0; i < constant->mMemberValues.size(); i++)
  1280. {
  1281. if (i > 0)
  1282. str += ", ";
  1283. ToString(str, constant->mMemberValues[i]);
  1284. }
  1285. str += ")";
  1286. return;
  1287. }
  1288. if (auto constant = BeValueDynCast<BeTypeOfConstant>(value))
  1289. {
  1290. ToString(str, constant->GetType());
  1291. str += StrFormat(" typeof(%d)", constant->mBfTypeId);
  1292. return;
  1293. }
  1294. if (auto constant = BeValueDynCast<BeStringConstant>(value))
  1295. {
  1296. ToString(str, constant->GetType());
  1297. str += " \"";
  1298. str += SlashString(constant->mString, true, true);
  1299. str += "\"";
  1300. return;
  1301. }
  1302. if (auto constant = BeValueDynCast<BeConstant>(value))
  1303. {
  1304. BeModule::ToString(str, constant->mType);
  1305. str += " ";
  1306. switch (constant->mType->mTypeCode)
  1307. {
  1308. case BeTypeCode_None:
  1309. return;
  1310. case BeTypeCode_NullPtr:
  1311. return;
  1312. case BeTypeCode_Boolean:
  1313. str += constant->mBool ? "true" : "false";
  1314. return;
  1315. case BeTypeCode_Int8:
  1316. case BeTypeCode_Int16:
  1317. case BeTypeCode_Int32:
  1318. case BeTypeCode_Int64:
  1319. str += StrFormat("%lld", constant->mInt64);
  1320. return;
  1321. case BeTypeCode_Float:
  1322. case BeTypeCode_Double:
  1323. str += StrFormat("%f", constant->mDouble);
  1324. return;
  1325. case BeTypeCode_Pointer:
  1326. if (constant->mTarget == NULL)
  1327. {
  1328. str += "null";
  1329. return;
  1330. }
  1331. else
  1332. {
  1333. str += "(";
  1334. ToString(str, constant->mTarget);
  1335. str += ")";
  1336. return;
  1337. }
  1338. case BeTypeCode_Struct:
  1339. case BeTypeCode_SizedArray:
  1340. case BeTypeCode_Vector:
  1341. str += "zeroinitializer";
  1342. return;
  1343. case BeTypeCode_Function:
  1344. BF_FATAL("Notimpl");
  1345. str += "<InvalidConstant>";
  1346. return;
  1347. default:
  1348. BF_FATAL("NotImpl");
  1349. }
  1350. }
  1351. if (auto intrin = BeValueDynCast<BeIntrinsic>(value))
  1352. {
  1353. str += "intrin:";
  1354. str += BfIRCodeGen::GetIntrinsicName((int)intrin->mKind);;
  1355. return;
  1356. }
  1357. if (auto callInst = BeValueDynCast<BeCallInst>(value))
  1358. {
  1359. if (callInst->mInlineResult != NULL)
  1360. {
  1361. str += "InlineResult: ";
  1362. ToString(str, callInst->mInlineResult);
  1363. return;
  1364. }
  1365. }
  1366. BeType* resultType = NULL;
  1367. const char* wantNamePtr = NULL;
  1368. if (auto instVal = BeValueDynCast<BeInst>(value))
  1369. {
  1370. resultType = instVal->GetType();
  1371. if ((instVal->mName != NULL) && (instVal->mName[0] != 0))
  1372. wantNamePtr = instVal->mName;
  1373. }
  1374. String* valueNamePtr = NULL;
  1375. if (mValueNameMap.TryGetValue(value, &valueNamePtr))
  1376. {
  1377. if (resultType != NULL)
  1378. {
  1379. BeModule::ToString(str, resultType);
  1380. str += " %";
  1381. }
  1382. else
  1383. str += "%";
  1384. str += *valueNamePtr;
  1385. return;
  1386. }
  1387. if (auto beBlock = BeValueDynCast<BeBlock>(value))
  1388. {
  1389. if (!beBlock->mName.IsEmpty())
  1390. wantNamePtr = beBlock->mName.c_str();
  1391. }
  1392. StringT<64> useName;
  1393. if (wantNamePtr != NULL)
  1394. useName += wantNamePtr;
  1395. while (true)
  1396. {
  1397. int* idxPtr = NULL;
  1398. if ((mSeenNames.TryAdd(useName, NULL, &idxPtr)) && (!useName.IsEmpty()))
  1399. break;
  1400. int checkIdx = (*idxPtr)++;
  1401. char str[32];
  1402. sprintf(str, "%d", checkIdx);
  1403. useName += str;
  1404. }
  1405. mValueNameMap[value] = useName;
  1406. if ((showType) && (resultType != NULL))
  1407. {
  1408. BeModule::ToString(str, resultType);
  1409. str += " %";
  1410. str += useName;
  1411. return;
  1412. }
  1413. else
  1414. {
  1415. str += "%";
  1416. str += useName;
  1417. return;
  1418. }
  1419. }
  1420. String BeDumpContext::ToString(BeValue* value, bool showType, bool mdDrillDown)
  1421. {
  1422. String str;
  1423. ToString(str, value, showType, mdDrillDown);
  1424. return str;
  1425. }
  1426. String BeDumpContext::ToString(BeType* type)
  1427. {
  1428. String str;
  1429. BeModule::ToString(str, type);
  1430. return str;
  1431. }
  1432. void BeDumpContext::ToString(StringImpl& str, BeType* type)
  1433. {
  1434. BeModule::ToString(str, type);
  1435. }
  1436. void BeDumpContext::ToString(StringImpl& str, BeDbgFunction* dbgFunction, bool showScope)
  1437. {
  1438. if (dbgFunction->mIsStaticMethod)
  1439. str += "static ";
  1440. if (dbgFunction->mIsLocalToUnit)
  1441. str += "internal ";
  1442. if (dbgFunction->mValue == NULL)
  1443. str += "external ";
  1444. if (dbgFunction->mVK > 0)
  1445. str += StrFormat("virtual(%d) ", dbgFunction->mVIndex);
  1446. str += ToString(dbgFunction->mType->mReturnType);
  1447. str += " ";
  1448. if ((showScope) && (dbgFunction->mScope != NULL))
  1449. {
  1450. if (auto parentType = BeValueDynCast<BeDbgType>(dbgFunction->mScope))
  1451. {
  1452. ToString(str, parentType);
  1453. str += ".";
  1454. }
  1455. }
  1456. bool needsQuote = false;
  1457. for (char c : dbgFunction->mName)
  1458. {
  1459. if ((c == '.') || (c == '<') || (c == '('))
  1460. needsQuote = true;
  1461. }
  1462. if (needsQuote)
  1463. str += "\"";
  1464. str += dbgFunction->mName;
  1465. if (needsQuote)
  1466. str += "\"";
  1467. if (!dbgFunction->mGenericArgs.IsEmpty())
  1468. {
  1469. str += "<";
  1470. for (int genericIdx = 0; genericIdx < dbgFunction->mGenericArgs.Count(); genericIdx++)
  1471. {
  1472. if (genericIdx > 0)
  1473. str += ", ";
  1474. str += ToString(dbgFunction->mGenericArgs[genericIdx]);
  1475. }
  1476. str += ">";
  1477. }
  1478. if (!dbgFunction->mGenericConstValueArgs.IsEmpty())
  1479. {
  1480. str += "<";
  1481. for (int genericIdx = 0; genericIdx < dbgFunction->mGenericConstValueArgs.Count(); genericIdx++)
  1482. {
  1483. if (genericIdx > 0)
  1484. str += ", ";
  1485. str += ToString(dbgFunction->mGenericConstValueArgs[genericIdx]);
  1486. }
  1487. str += ">";
  1488. }
  1489. str += "(";
  1490. for (int paramIdx = 0; paramIdx < (int)dbgFunction->mType->mParams.size(); paramIdx++)
  1491. {
  1492. if (paramIdx > 0)
  1493. str += ", ";
  1494. str += ToString(dbgFunction->mType->mParams[paramIdx]);
  1495. BeDbgVariable* variable = NULL;
  1496. if (paramIdx < dbgFunction->mVariables.Count())
  1497. variable = dbgFunction->mVariables[paramIdx];
  1498. if (variable != NULL)
  1499. {
  1500. if (variable->mParamNum == paramIdx)
  1501. {
  1502. str += " ";
  1503. str += variable->mName;
  1504. }
  1505. }
  1506. }
  1507. str += ")";
  1508. if (!dbgFunction->mLinkageName.IsEmpty())
  1509. {
  1510. str += " Link:";
  1511. str += dbgFunction->mLinkageName;
  1512. }
  1513. }
  1514. String BeDumpContext::ToString(BeDbgFunction* dbgFunction)
  1515. {
  1516. String str;
  1517. ToString(str, dbgFunction, false);
  1518. return str;
  1519. }
  1520. void BeDumpContext::ToString(StringImpl& str, int val)
  1521. {
  1522. char iStr[32];
  1523. sprintf(iStr, "%d", val);
  1524. str += iStr;
  1525. }
  1526. String BeDumpContext::ToString(int val)
  1527. {
  1528. return StrFormat("%d", val);
  1529. }
  1530. void BeDumpContext::ToString(StringImpl& str, BeCmpKind cmpKind)
  1531. {
  1532. switch (cmpKind)
  1533. {
  1534. case BeCmpKind_SLT: str += "slt"; return;
  1535. case BeCmpKind_ULT: str += "ult"; return;
  1536. case BeCmpKind_OLT: str += "olt"; return;
  1537. case BeCmpKind_SLE: str += "sle"; return;
  1538. case BeCmpKind_ULE: str += "ule"; return;
  1539. case BeCmpKind_OLE: str += "ole"; return;
  1540. case BeCmpKind_EQ: str += "eq"; return;
  1541. case BeCmpKind_NE: str += "ne"; return;
  1542. case BeCmpKind_SGT: str += "sgt"; return;
  1543. case BeCmpKind_UGT: str += "ugt"; return;
  1544. case BeCmpKind_OGT: str += "ogt"; return;
  1545. case BeCmpKind_SGE: str += "sge"; return;
  1546. case BeCmpKind_UGE: str += "uge"; return;
  1547. case BeCmpKind_OGE: str += "oge"; return;
  1548. case BeCmpKind_NB: str += "nb"; return;
  1549. case BeCmpKind_NO: str += "no"; return;
  1550. case BeCmpKind_Sign: str += "sign"; return;
  1551. default:
  1552. str += "???";
  1553. }
  1554. }
  1555. String BeDumpContext::ToString(BeCmpKind cmpKind)
  1556. {
  1557. String str;
  1558. ToString(str, cmpKind);
  1559. return str;
  1560. }
  1561. void BeDumpContext::ToString(StringImpl& str, BeBinaryOpKind opKind)
  1562. {
  1563. switch (opKind)
  1564. {
  1565. case BeBinaryOpKind_Add: str += "+"; return;
  1566. case BeBinaryOpKind_Subtract: str += "-"; return;
  1567. case BeBinaryOpKind_Multiply: str += "*"; return;
  1568. case BeBinaryOpKind_SDivide: str += "s/"; return;
  1569. case BeBinaryOpKind_UDivide: str += "u/"; return;
  1570. case BeBinaryOpKind_SModulus: str += "%"; return;
  1571. case BeBinaryOpKind_UModulus: str += "%"; return;
  1572. case BeBinaryOpKind_BitwiseAnd: str += "&"; return;
  1573. case BeBinaryOpKind_BitwiseOr: str += "|"; return;
  1574. case BeBinaryOpKind_ExclusiveOr: str += "^"; return;
  1575. case BeBinaryOpKind_LeftShift: str += "<<"; return;
  1576. case BeBinaryOpKind_RightShift: str += ">>"; return;
  1577. case BeBinaryOpKind_ARightShift: str += "A>>"; return;
  1578. default:
  1579. str += "???";
  1580. }
  1581. }
  1582. String BeDumpContext::ToString(BeBinaryOpKind opKind)
  1583. {
  1584. String str;
  1585. ToString(str, opKind);
  1586. return str;
  1587. }
  1588. //////////////////////////////////////////////////////////////////////////
  1589. void BeDbgFile::ToString(String& str)
  1590. {
  1591. str += mDirectory;
  1592. if (str.length() > 0)
  1593. {
  1594. if ((str[str.length() - 1] != '\\') && (str[str.length() - 1] != '/'))
  1595. str += "\\";
  1596. }
  1597. str += mFileName;
  1598. for (int i = 0; i < str.length(); i++)
  1599. if (str[i] == '/')
  1600. str = '\\';
  1601. }
  1602. void BeDbgFile::GetFilePath(String& outStr)
  1603. {
  1604. outStr.Append(mDirectory);
  1605. outStr.Append(DIR_SEP_CHAR);
  1606. outStr.Append(mFileName);
  1607. }
  1608. //////////////////////////////////////////////////////////////////////////
  1609. BeModule::BeModule(const StringImpl& moduleName, BeContext* context)
  1610. {
  1611. mBeIRCodeGen = NULL;
  1612. mModuleName = moduleName;
  1613. mContext = context;
  1614. mActiveBlock = NULL;
  1615. mInsertPos = -1;
  1616. mCurDbgLoc = NULL;
  1617. mLastDbgLoc = NULL;
  1618. mActiveFunction = NULL;
  1619. mDbgModule = NULL;
  1620. mCeMachine = NULL;
  1621. mPrevDbgLocInline = NULL;
  1622. mCurDbgLocIdx = 0;
  1623. mCurLexBlockId = 0;
  1624. }
  1625. void BeModule::Hash(BeHashContext& hashCtx)
  1626. {
  1627. hashCtx.MixinStr(mTargetTriple);
  1628. hashCtx.MixinStr(mTargetCPU);
  1629. hashCtx.Mixin(mConfigConsts64.size());
  1630. for (auto configConst : mConfigConsts64)
  1631. configConst->HashContent(hashCtx);
  1632. if (mDbgModule != NULL)
  1633. mDbgModule->HashReference(hashCtx);
  1634. if (!mFunctions.IsEmpty())
  1635. {
  1636. std::sort(mFunctions.begin(), mFunctions.end(), [](BeFunction* lhs, BeFunction* rhs)
  1637. {
  1638. return (lhs->mName < rhs->mName);
  1639. });
  1640. for (auto& beFunction : mFunctions)
  1641. {
  1642. if (!beFunction->mBlocks.IsEmpty())
  1643. beFunction->HashReference(hashCtx);
  1644. }
  1645. }
  1646. if (!mGlobalVariables.IsEmpty())
  1647. {
  1648. std::sort(mGlobalVariables.begin(), mGlobalVariables.end(), [](BeGlobalVariable* lhs, BeGlobalVariable* rhs)
  1649. {
  1650. return (lhs->mName < rhs->mName);
  1651. });
  1652. for (auto& beGlobalVar : mGlobalVariables)
  1653. {
  1654. if (beGlobalVar->mInitializer != NULL)
  1655. beGlobalVar->HashReference(hashCtx);
  1656. }
  1657. }
  1658. }
  1659. #define DELETE_ENTRY(i) delete mOwnedValues[i]; mOwnedValues[i] = NULL
  1660. BeModule::~BeModule()
  1661. {
  1662. delete mDbgModule;
  1663. }
  1664. void BeModule::StructToString(StringImpl& str, BeStructType* structType)
  1665. {
  1666. str += structType->mName;
  1667. str += " = type ";
  1668. if (!structType->mMembers.IsEmpty())
  1669. {
  1670. if (structType->mIsPacked)
  1671. str += "<";
  1672. str += "{";
  1673. for (int memberIdx = 0; memberIdx < (int)structType->mMembers.size(); memberIdx++)
  1674. {
  1675. if (memberIdx > 0)
  1676. str += ", ";
  1677. ToString(str, structType->mMembers[memberIdx].mType);
  1678. }
  1679. str += "}";
  1680. if (structType->mIsPacked)
  1681. str += ">";
  1682. }
  1683. else
  1684. {
  1685. str += "opaque";
  1686. if (structType->mSize > 0)
  1687. {
  1688. str += " size ";
  1689. str += StrFormat("%d", structType->mSize);
  1690. }
  1691. if (structType->mAlign > 0)
  1692. {
  1693. str += " align ";
  1694. str += StrFormat("%d", structType->mAlign);
  1695. }
  1696. }
  1697. str += "\n";
  1698. }
  1699. String BeModule::ToString(BeFunction* wantFunc)
  1700. {
  1701. Dictionary<int, BeDbgLoc*> dbgLocs;
  1702. StringT<128*1024> str;
  1703. SetAndRestoreValue<BeFunction*> prevActiveFunc(mActiveFunction, NULL);
  1704. BeDumpContext dc;
  1705. if (wantFunc == NULL)
  1706. {
  1707. str += "Module: "; str += mModuleName; str += "\n";
  1708. str += "Target: "; str += mTargetTriple; str += "\n";
  1709. if (mDbgModule != NULL)
  1710. {
  1711. str += "FileName: "; str += mDbgModule->mFileName; str += "\n";
  1712. str += "Directory: "; str += mDbgModule->mDirectory; str += "\n";
  1713. str += "Producer: "; str += mDbgModule->mProducer; str += "\n";
  1714. }
  1715. for (int i = 0; i < (int)mConfigConsts64.size(); i++)
  1716. {
  1717. if (i == 0)
  1718. str += "VirtualMethodOfs: ";
  1719. else if (i == 1)
  1720. str += "DynSlotOfs: ";
  1721. dc.ToString(str, mConfigConsts64[i]);
  1722. str += "\n";
  1723. }
  1724. str += "\n";
  1725. str += "; Types\n";
  1726. for (auto type : mContext->mTypes)
  1727. {
  1728. if (type->mTypeCode == BeTypeCode_Struct)
  1729. {
  1730. auto structType = (BeStructType*)type;
  1731. StructToString(str, structType);
  1732. }
  1733. }
  1734. str += "\n";
  1735. str += "; Global variables\n";
  1736. for (int gvIdx = 0; gvIdx < (int)mGlobalVariables.size(); gvIdx++)
  1737. {
  1738. auto gv = mGlobalVariables[gvIdx];
  1739. str += gv->mName;
  1740. str += " =";
  1741. if (gv->mInitializer == NULL)
  1742. str += " external";
  1743. if (gv->mLinkageType == BfIRLinkageType_Internal)
  1744. str += " internal";
  1745. if (gv->mIsConstant)
  1746. str += " constant";
  1747. if (gv->mIsTLS)
  1748. str += " tls";
  1749. if (gv->mInitializer != NULL)
  1750. {
  1751. str += " ";
  1752. dc.ToString(str, gv->mInitializer);
  1753. }
  1754. else
  1755. {
  1756. str += " ";
  1757. dc.ToString(str, gv->mType);
  1758. }
  1759. if (gv->mAlign != -1)
  1760. {
  1761. str += " align ";
  1762. str += StrFormat("%d", gv->mAlign);
  1763. }
  1764. str += "\n";
  1765. }
  1766. str += "\n";
  1767. if (mDbgModule != NULL)
  1768. {
  1769. if (!mDbgModule->mGlobalVariables.IsEmpty())
  1770. {
  1771. str += "; Global variable debug info\n";
  1772. for (auto dbgGlobalVar : mDbgModule->mGlobalVariables)
  1773. {
  1774. str += dbgGlobalVar->mName;
  1775. str += " = ";
  1776. if (dbgGlobalVar->mIsLocalToUnit)
  1777. str += "internal ";
  1778. dc.ToString(str, dbgGlobalVar->mType);
  1779. if (dbgGlobalVar->mValue != NULL)
  1780. {
  1781. str += " ";
  1782. dc.ToString(str, dbgGlobalVar->mValue);
  1783. }
  1784. if (dbgGlobalVar->mFile != NULL)
  1785. {
  1786. str += " @";
  1787. dc.ToString(str, dbgGlobalVar->mFile);
  1788. str += StrFormat(":%d", dbgGlobalVar->mLineNum);
  1789. }
  1790. if (!dbgGlobalVar->mLinkageName.IsEmpty())
  1791. {
  1792. str += " Link:";
  1793. str += dbgGlobalVar->mLinkageName;
  1794. }
  1795. str += "\n";
  1796. }
  1797. str += "\n";
  1798. }
  1799. str += "; Debug types\n";
  1800. for (auto dbgType : mDbgModule->mTypes)
  1801. {
  1802. if (auto dbgStructType = BeValueDynCast<BeDbgStructType>(dbgType))
  1803. {
  1804. dc.ToString(str, dbgStructType);
  1805. str += " = {";
  1806. if (dbgStructType->mSize != -1)
  1807. {
  1808. str += "\n Size: ";
  1809. str += StrFormat("%d", dbgStructType->mSize);
  1810. str += "\n Align : ";
  1811. str += StrFormat("%d", dbgStructType->mAlign);
  1812. }
  1813. if (dbgStructType->mDerivedFrom != NULL)
  1814. {
  1815. str += "\n Base: "; str += dc.ToString(dbgStructType->mDerivedFrom);
  1816. }
  1817. if (!dbgStructType->mMembers.IsEmpty())
  1818. {
  1819. str += "\n Members: {";
  1820. for (int memberIdx = 0; memberIdx < dbgStructType->mMembers.Count(); memberIdx++)
  1821. {
  1822. if (memberIdx > 0)
  1823. str += ", ";
  1824. str += "\n ";
  1825. dc.ToString(str, dbgStructType->mMembers[memberIdx]);
  1826. }
  1827. str += "}";
  1828. }
  1829. if (!dbgStructType->mMethods.IsEmpty())
  1830. {
  1831. str += "\n Methods: {";
  1832. for (int methodIdx = 0; methodIdx < dbgStructType->mMethods.Count(); methodIdx++)
  1833. {
  1834. if (methodIdx > 0)
  1835. str += ",";
  1836. str += "\n ";
  1837. dc.ToString(str, dbgStructType->mMethods[methodIdx], false);
  1838. }
  1839. str += "}";
  1840. }
  1841. str += "}\n";
  1842. }
  1843. else if (auto dbgEnumType = BeValueDynCast<BeDbgEnumType>(dbgType))
  1844. {
  1845. dc.ToString(str, dbgEnumType);
  1846. str += " = enum {";
  1847. if (dbgEnumType->mSize != -1)
  1848. {
  1849. str += "\n Size: ";
  1850. str += StrFormat("%d", dbgEnumType->mSize);
  1851. str += "\n Align : ";
  1852. str += StrFormat("%d", dbgEnumType->mAlign);
  1853. }
  1854. if (dbgEnumType->mElementType != NULL)
  1855. {
  1856. str += "\n Underlying: ";
  1857. dc.ToString(str, dbgEnumType->mElementType);
  1858. }
  1859. if (!dbgEnumType->mMembers.IsEmpty())
  1860. {
  1861. str += "\n Members: {";
  1862. for (int memberIdx = 0; memberIdx < dbgEnumType->mMembers.Count(); memberIdx++)
  1863. {
  1864. if (memberIdx > 0)
  1865. str += ", ";
  1866. str += "\n ";
  1867. dc.ToString(str, dbgEnumType->mMembers[memberIdx]);
  1868. }
  1869. str += "}";
  1870. }
  1871. str += "}\n";
  1872. }
  1873. }
  1874. str += "\n";
  1875. str += "; Debug functions\n";
  1876. for (auto dbgFunc : mDbgModule->mFuncs)
  1877. {
  1878. if (!dbgFunc->mIncludedAsMember)
  1879. {
  1880. dc.ToString(str, dbgFunc, true);
  1881. str += "\n";
  1882. }
  1883. }
  1884. str += "\n";
  1885. }
  1886. str += "; Functions\n";
  1887. }
  1888. for (auto func : mFunctions)
  1889. {
  1890. if ((wantFunc != NULL) && (wantFunc != func))
  1891. continue;
  1892. mActiveFunction = func;
  1893. Dictionary<BeValue*, String> valueNameMap;
  1894. HashSet<String> seenNames;
  1895. auto funcType = func->GetFuncType();
  1896. if (func->mBlocks.size() == 0)
  1897. str += "declare ";
  1898. else
  1899. str += "define ";
  1900. ToString(str, func->GetFuncType()->mReturnType);
  1901. str += " ";
  1902. str += func->mName;
  1903. str += "(";
  1904. for (int paramIdx = 0; paramIdx < (int)funcType->mParams.size(); paramIdx++)
  1905. {
  1906. auto& typeParam = funcType->mParams[paramIdx];
  1907. auto& param = func->mParams[paramIdx];
  1908. if (paramIdx > 0)
  1909. str += ", ";
  1910. ToString(str, typeParam.mType);
  1911. if (param.mStructRet)
  1912. str += " sret";
  1913. if (param.mNoAlias)
  1914. str += " noalias";
  1915. if (param.mNoCapture)
  1916. str += " nocapture";
  1917. if (param.mZExt)
  1918. str += " zext";
  1919. if (param.mDereferenceableSize != -1)
  1920. str += StrFormat(" dereferenceable(%d)", param.mDereferenceableSize);
  1921. str += " ";
  1922. if (param.mName.empty())
  1923. param.mName = StrFormat("p%d", paramIdx);
  1924. dc.mSeenNames[param.mName] = 0;
  1925. str += "%" + param.mName;
  1926. }
  1927. if (funcType->mIsVarArg)
  1928. {
  1929. if (!funcType->mParams.IsEmpty())
  1930. str += ", ";
  1931. str += "...";
  1932. }
  1933. str += ")";
  1934. if (func->mAlwaysInline)
  1935. str += " AlwaysInline";
  1936. if (func->mNoUnwind)
  1937. str += " nounwind";
  1938. if (func->mUWTable)
  1939. str += " uwtable";
  1940. if (func->mNoReturn)
  1941. str += " noreturn";
  1942. if (func->mNoFramePointerElim)
  1943. str += " noframepointerelim";
  1944. if (func->mIsDLLExport)
  1945. str += " dllexport";
  1946. if (func->mBlocks.size() == 0)
  1947. {
  1948. str += "\n\n";
  1949. continue;
  1950. }
  1951. str += " {\n";
  1952. #define DISPLAY_INST0(typeName, name) \
  1953. case typeName::TypeId: { \
  1954. auto castedInst = (typeName*)inst; \
  1955. str += name; \
  1956. } \
  1957. break;
  1958. #define DISPLAY_INST1(typeName, name, member1) \
  1959. case typeName::TypeId: { \
  1960. auto castedInst = (typeName*)inst; \
  1961. str += name; \
  1962. str += " "; \
  1963. dc.ToString(str, castedInst->member1); \
  1964. } \
  1965. break;
  1966. #define DISPLAY_INST2(typeName, name, member1, member2) \
  1967. case typeName::TypeId: { \
  1968. auto castedInst = (typeName*)inst;\
  1969. str += name; \
  1970. str += " "; \
  1971. dc.ToString(str, castedInst->member1); \
  1972. str += ", "; \
  1973. dc.ToString(str, castedInst->member2); \
  1974. } \
  1975. break;
  1976. #define DISPLAY_INST2_OPEN(typeName, name, member1, member2) \
  1977. case typeName::TypeId: { \
  1978. auto castedInst = (typeName*)inst;\
  1979. str += name; \
  1980. str += " "; \
  1981. dc.ToString(str, castedInst->member1); \
  1982. str += ", "; \
  1983. dc.ToString(str, castedInst->member2); \
  1984. }
  1985. #define DISPLAY_INST3(typeName, name, member1, member2, member3) \
  1986. case typeName::TypeId: { \
  1987. auto castedInst = (typeName*)inst;\
  1988. str += name; \
  1989. str += " "; \
  1990. dc.ToString(str, castedInst->member1); \
  1991. str += ", "; \
  1992. dc.ToString(str, castedInst->member2); \
  1993. if ((std::is_pointer<decltype(castedInst->member3)>::value) && (castedInst->member3 != NULL)) \
  1994. { \
  1995. str += ", "; \
  1996. str += dc.ToString(castedInst->member3); \
  1997. } \
  1998. } \
  1999. break;
  2000. #define DISPLAY_INST4(typeName, name, member1, member2, member3, member4) \
  2001. case typeName::TypeId: { \
  2002. auto castedInst = (typeName*)inst;\
  2003. str += name; \
  2004. str += " "; \
  2005. dc.ToString(str, castedInst->member1); \
  2006. str += ", "; \
  2007. dc.ToString(str, castedInst->member2); \
  2008. if ((std::is_pointer<decltype(castedInst->member3)>::value) && (castedInst->member3 != NULL)) \
  2009. { \
  2010. str += ", "; \
  2011. dc.ToString(str, castedInst->member3); \
  2012. if ((std::is_pointer<decltype(castedInst->member4)>::value) && (castedInst->member4 != NULL)) \
  2013. { \
  2014. str += ", "; \
  2015. dc.ToString(str, castedInst->member4); \
  2016. } \
  2017. } \
  2018. } \
  2019. break;
  2020. HashSet<BeDbgLoc*> seenInlinedAt;
  2021. BeDbgLoc* lastDbgLoc = NULL;
  2022. HashSet<BeDbgLoc*> prevDbgLocs;
  2023. for (int blockIdx = 0; blockIdx < (int)func->mBlocks.size(); blockIdx++)
  2024. {
  2025. auto beBlock = func->mBlocks[blockIdx];
  2026. if (blockIdx > 0)
  2027. str += "\n";
  2028. dc.ToString(str, beBlock);
  2029. str += ":\n";
  2030. for (auto inst : beBlock->mInstructions)
  2031. {
  2032. if (inst->mDbgLoc != NULL)
  2033. {
  2034. if ((inst->mDbgLoc != lastDbgLoc) && (lastDbgLoc != NULL))
  2035. {
  2036. // if (inst->mDbgLoc->mIdx < lastDbgLoc->mIdx)
  2037. // {
  2038. // str += "WARNING: Out-of-order debug locations:\n";
  2039. // }
  2040. if ((inst->mDbgLoc->mDbgInlinedAt != lastDbgLoc->mDbgInlinedAt) && (inst->mDbgLoc->mDbgInlinedAt != NULL))
  2041. {
  2042. prevDbgLocs.Clear();
  2043. auto prevInlinedAt = lastDbgLoc->mDbgInlinedAt;
  2044. while (prevInlinedAt != NULL)
  2045. {
  2046. prevDbgLocs.Add(prevInlinedAt);
  2047. prevInlinedAt = prevInlinedAt->mDbgInlinedAt;
  2048. }
  2049. auto curInlinedAt = inst->mDbgLoc->mDbgInlinedAt;
  2050. if (!prevDbgLocs.Contains(curInlinedAt))
  2051. {
  2052. if (!seenInlinedAt.Add(curInlinedAt))
  2053. {
  2054. str += "WARNING: Adding new span of already-seen inlined location:\n";
  2055. }
  2056. }
  2057. }
  2058. }
  2059. lastDbgLoc = inst->mDbgLoc;
  2060. }
  2061. str += " ";
  2062. if (inst->CanBeReferenced())
  2063. {
  2064. str += dc.ToString(inst, false);
  2065. str += " = ";
  2066. }
  2067. switch (inst->GetTypeId())
  2068. {
  2069. DISPLAY_INST0(BeNopInst, "nop");
  2070. DISPLAY_INST0(BeUnreachableInst, "unreachable");
  2071. DISPLAY_INST0(BeEnsureInstructionAtInst, "ensureCodeAt");
  2072. DISPLAY_INST1(BeUndefValueInst, "undef", mType);
  2073. DISPLAY_INST2(BeExtractValueInst, "extractValue", mAggVal, mIdx);
  2074. DISPLAY_INST3(BeInsertValueInst, "insertValue", mAggVal, mMemberVal, mIdx);
  2075. DISPLAY_INST2_OPEN(BeNumericCastInst, "numericCast", mValue, mToType)
  2076. {
  2077. auto castedInst = (BeNumericCastInst*)inst;
  2078. if (castedInst->mValSigned)
  2079. str += " s->";
  2080. else
  2081. str += " u->";
  2082. if (castedInst->mToSigned)
  2083. str += "s";
  2084. else
  2085. str += "u";
  2086. }
  2087. break;
  2088. DISPLAY_INST2(BeBitCastInst, "bitCast", mValue, mToType);
  2089. DISPLAY_INST1(BeNegInst, "neg", mValue);
  2090. DISPLAY_INST1(BeNotInst, "not", mValue);
  2091. DISPLAY_INST3(BeBinaryOpInst, "binOp", mLHS, mOpKind, mRHS);
  2092. /*{
  2093. auto castedInst = (BeAddInst*)inst;
  2094. str += "add ";
  2095. str += dc.ToString(castedInst->mLHS);
  2096. str += ", ";
  2097. str += dc.ToString(castedInst->mRHS, false);
  2098. }
  2099. break;*/
  2100. DISPLAY_INST3(BeCmpInst, "cmp", mCmpKind, mLHS, mRHS);
  2101. DISPLAY_INST1(BeObjectAccessCheckInst, "objectAccessCheck", mValue);
  2102. case BeAllocaInst::TypeId:
  2103. {
  2104. auto castedInst = (BeAllocaInst*)inst;
  2105. str += "alloca ";
  2106. ToString(str, castedInst->mType);
  2107. if (castedInst->mArraySize != NULL)
  2108. {
  2109. str += ", ";
  2110. dc.ToString(str, castedInst->mArraySize);
  2111. }
  2112. str += ", align ";
  2113. dc.ToString(str, castedInst->mAlign);
  2114. }
  2115. break;
  2116. DISPLAY_INST1(BeAliasValueInst, "aliasvalue", mPtr);
  2117. DISPLAY_INST1(BeLifetimeStartInst, "lifetime.start", mPtr);
  2118. DISPLAY_INST1(BeLifetimeEndInst, "lifetime.end", mPtr);
  2119. DISPLAY_INST1(BeLifetimeSoftEndInst, "lifetime.softEnd", mPtr);
  2120. DISPLAY_INST2(BeLifetimeFenceInst, "lifetime.fence", mFenceBlock, mPtr);
  2121. DISPLAY_INST0(BeValueScopeStartInst, "valueScope.start");
  2122. DISPLAY_INST1(BeValueScopeRetainInst, "valueScope.retain", mValue);
  2123. DISPLAY_INST1(BeValueScopeEndInst, ((BeValueScopeEndInst*)inst)->mIsSoft ? "valueScope.softEnd" : "valueScope.hardEnd", mScopeStart);
  2124. DISPLAY_INST1(BeLifetimeExtendInst, "lifetime.extend", mPtr);
  2125. case BeLoadInst::TypeId:
  2126. {
  2127. auto castedInst = (BeLoadInst*)inst;
  2128. str += "load ";
  2129. if (castedInst->mIsVolatile)
  2130. str += "volatile ";
  2131. ToString(str, inst->GetType());
  2132. str += ", ";
  2133. dc.ToString(str, castedInst->mTarget);
  2134. }
  2135. break;
  2136. case BeStoreInst::TypeId:
  2137. {
  2138. auto castedInst = (BeStoreInst*)inst;
  2139. str += "store ";
  2140. if (castedInst->mIsVolatile)
  2141. str += "volatile ";
  2142. dc.ToString(str, castedInst->mVal);
  2143. str += ", ";
  2144. dc.ToString(str, castedInst->mPtr);
  2145. }
  2146. break;
  2147. DISPLAY_INST1(BeSetCanMergeInst, "setCanMerge", mVal);
  2148. DISPLAY_INST4(BeMemSetInst, "memset", mAddr, mVal, mSize, mAlignment);
  2149. DISPLAY_INST0(BeFenceInst, "fence");
  2150. DISPLAY_INST0(BeStackSaveInst, "stackSave");
  2151. DISPLAY_INST1(BeStackRestoreInst, "stackRestore", mStackVal);
  2152. DISPLAY_INST3(BeGEPInst, "gep", mPtr, mIdx0, mIdx1);
  2153. //DISPLAY_INST1(BeBrInst, "br", mTargetBlock);
  2154. case BeBrInst::TypeId:
  2155. {
  2156. auto castedInst = (BeBrInst*)inst;
  2157. if (castedInst->mNoCollapse)
  2158. str += "br NoCollapse ";
  2159. else if (castedInst->mIsFake)
  2160. str += "br Fake ";
  2161. else
  2162. str += "br ";
  2163. dc.ToString(str, castedInst->mTargetBlock);
  2164. }
  2165. break;
  2166. DISPLAY_INST3(BeCondBrInst, "condbr", mCond, mTrueBlock, mFalseBlock);
  2167. case BeRetInst::TypeId:
  2168. {
  2169. auto castedInst = (BeRetInst*)inst;
  2170. str += "ret";
  2171. if (castedInst->mRetValue != NULL)
  2172. {
  2173. str += " ";
  2174. dc.ToString(str, castedInst->mRetValue);
  2175. }
  2176. else
  2177. str += " void";
  2178. }
  2179. break;
  2180. DISPLAY_INST2(BeSetRetInst, "setret", mRetValue, mReturnTypeId);
  2181. case BeCallInst::TypeId:
  2182. {
  2183. auto castedInst = (BeCallInst*)inst;
  2184. if (castedInst->mInlineResult != NULL)
  2185. {
  2186. str += "InlineResult: ";
  2187. dc.ToString(str, castedInst->mInlineResult);
  2188. break;
  2189. }
  2190. if (castedInst->mTailCall)
  2191. str += "tail ";
  2192. str += "call ";
  2193. dc.ToString(str, castedInst->mFunc);
  2194. str += "(";
  2195. for (int argIdx = 0; argIdx < (int)castedInst->mArgs.size(); argIdx++)
  2196. {
  2197. auto& arg = castedInst->mArgs[argIdx];
  2198. if (argIdx > 0)
  2199. str += ", ";
  2200. str += dc.ToString(arg.mValue);
  2201. if (arg.mStructRet)
  2202. str += " sret";
  2203. if (arg.mZExt)
  2204. str += " zext";
  2205. if (arg.mNoAlias)
  2206. str += " noalias";
  2207. if (arg.mNoCapture)
  2208. str += " nocapture";
  2209. if (arg.mDereferenceableSize != -1)
  2210. str += StrFormat(" dereferenceable(%d)", arg.mDereferenceableSize);
  2211. }
  2212. str += ")";
  2213. if (castedInst->mNoReturn)
  2214. str += " noreturn";
  2215. }
  2216. break;
  2217. case BePhiInst::TypeId:
  2218. {
  2219. auto castedInst = (BePhiInst*)inst;
  2220. str += "phi ";
  2221. dc.ToString(str, castedInst->mType);
  2222. str += " ";
  2223. for (int argIdx = 0; argIdx < (int)castedInst->mIncoming.size(); argIdx++)
  2224. {
  2225. if (argIdx > 0)
  2226. str += ", ";
  2227. str += "[";
  2228. dc.ToString(str, castedInst->mIncoming[argIdx]->mValue);
  2229. str += ", ";
  2230. dc.ToString(str, castedInst->mIncoming[argIdx]->mBlock);
  2231. str += "]";
  2232. }
  2233. }
  2234. break;
  2235. case BeSwitchInst::TypeId:
  2236. {
  2237. auto castedInst = (BeSwitchInst*)inst;
  2238. str += "switch ";
  2239. dc.ToString(str, castedInst->mValue);
  2240. str += " ";
  2241. dc.ToString(str, castedInst->mDefaultBlock);
  2242. str += " [";
  2243. for (int argIdx = 0; argIdx < (int)castedInst->mCases.size(); argIdx++)
  2244. {
  2245. str += "\n ";
  2246. dc.ToString(str, castedInst->mCases[argIdx].mValue);
  2247. str += ", ";
  2248. dc.ToString(str, castedInst->mCases[argIdx].mBlock);
  2249. }
  2250. str += "]";
  2251. }
  2252. break;
  2253. DISPLAY_INST2_OPEN(BeDbgDeclareInst, "DbgDeclare", mDbgVar, mValue);
  2254. {
  2255. auto castedInst = (BeDbgDeclareInst*)inst;
  2256. if (castedInst->mIsValue)
  2257. str += " <val>";
  2258. else
  2259. str += " <addr>";
  2260. if (auto dbgVariable = castedInst->mDbgVar)
  2261. {
  2262. switch (dbgVariable->mInitType)
  2263. {
  2264. case BfIRInitType_NotNeeded: str += " noinit"; break;
  2265. case BfIRInitType_NotNeeded_AliveOnDecl: str += " noinit_aliveondecl"; break;
  2266. case BfIRInitType_Uninitialized: str += " uninit"; break;
  2267. case BfIRInitType_Zero: str += " zero"; break;
  2268. }
  2269. if (dbgVariable->mScope != NULL)
  2270. {
  2271. str += " Scope:";
  2272. dc.ToString(str, dbgVariable->mScope);
  2273. }
  2274. }
  2275. }
  2276. break;
  2277. DISPLAY_INST1(BeComptimeError, "ComptimeError", mError);
  2278. DISPLAY_INST1(BeComptimeGetType, "ComptimeGetType", mTypeId);
  2279. DISPLAY_INST1(BeComptimeGetReflectType, "ComptimeGetReflectType", mTypeId);
  2280. DISPLAY_INST2(BeComptimeDynamicCastCheck, "ComptimeDynamicCastCheck", mValue, mTypeId);
  2281. DISPLAY_INST2(BeComptimeGetVirtualFunc, "ComptimeGetVirtualFunc", mValue, mVirtualTableIdx);
  2282. DISPLAY_INST3(BeComptimeGetInterfaceFunc, "ComptimeGetInterfaceFunc", mValue, mIFaceTypeId, mMethodIdx);
  2283. default:
  2284. BF_FATAL("Notimpl");
  2285. str += "<UNKNOWN INST>";
  2286. break;
  2287. }
  2288. if (inst->mDbgLoc != NULL)
  2289. {
  2290. dbgLocs[inst->mDbgLoc->mIdx] = inst->mDbgLoc;
  2291. str += StrFormat(" @%d", inst->mDbgLoc->mIdx);
  2292. auto dbgFile = inst->mDbgLoc->GetDbgFile();
  2293. if (dbgFile != NULL)
  2294. {
  2295. str += "[";
  2296. str += dbgFile->mFileName;
  2297. str += StrFormat(":%d", inst->mDbgLoc->mLine + 1);
  2298. if (inst->mDbgLoc->mDbgInlinedAt != NULL)
  2299. {
  2300. str += ",inl";
  2301. BeDbgLoc* inlinedAt = inst->mDbgLoc->mDbgInlinedAt;
  2302. while (inlinedAt != NULL)
  2303. {
  2304. str += StrFormat("#%d", inlinedAt->mIdx);
  2305. inlinedAt = inlinedAt->mDbgInlinedAt;
  2306. }
  2307. }
  2308. str += "]";
  2309. }
  2310. }
  2311. str += "\n";
  2312. }
  2313. }
  2314. str += "}\n";
  2315. if (func->mDbgFunction != NULL)
  2316. {
  2317. str += " DbgFunc: ";
  2318. dc.ToString(str, func->mDbgFunction);
  2319. str += "\n";
  2320. for (auto dbgVar : func->mDbgFunction->mVariables)
  2321. {
  2322. if (dbgVar == NULL)
  2323. continue;
  2324. str += StrFormat(" Var: ");
  2325. str += dbgVar->mName;
  2326. str += " ";
  2327. dc.ToString(str, dbgVar->mScope);
  2328. str += "\n";
  2329. }
  2330. }
  2331. str += "\n";
  2332. }
  2333. for (auto& dbgLocPair : dbgLocs)
  2334. {
  2335. auto dbgLoc = dbgLocPair.mValue;
  2336. dc.ToString(str, dbgLocPair.mValue);
  2337. str += "\n";
  2338. }
  2339. str += "\n";
  2340. return str;
  2341. }
  2342. void BeModule::Print()
  2343. {
  2344. OutputDebugStr(ToString());
  2345. }
  2346. void BeModule::Print(BeFunction* func)
  2347. {
  2348. OutputDebugStr(ToString(func));
  2349. }
  2350. void BeModule::PrintValue(BeValue* val)
  2351. {
  2352. BeDumpContext dumpCtx;
  2353. String str;
  2354. dumpCtx.ToString(str, val);
  2355. str += "\n";
  2356. OutputDebugStr(str);
  2357. auto type = val->GetType();
  2358. if (type != NULL)
  2359. bpt(type);
  2360. }
  2361. void BeModule::DoInlining(BeFunction* func)
  2362. {
  2363. //bool debugging = func->mName == "?Test@Program@bf@@CAXXZ";
  2364. //bool debugging = func->mName == "?TestA@TestClass@Bro@Dude@Hey@@SAX_J@Z";
  2365. //debugging |= func->mName == "?TestB@TestClass@Bro@Dude@Hey@@SAX_J@Z";
  2366. //debugging |= func->mName == "?TestC@TestClass@Bro@Dude@Hey@@SAX_J@Z";
  2367. // if (debugging)
  2368. // {
  2369. // Print(func);
  2370. // }
  2371. if (func->mDidInlinePass)
  2372. return;
  2373. // Set this true here so we don't recurse on the same function
  2374. func->mDidInlinePass = true;
  2375. int numHeadAllocas = 0;
  2376. bool inHeadAllocas = true;
  2377. int blockIdx = 0;
  2378. // From head to resume
  2379. std::unordered_multimap<BeBlock*, BeBlock*> inlineResumesMap;
  2380. // From resume to head
  2381. std::unordered_multimap<BeBlock*, BeBlock*> inlineHeadMap;
  2382. bool hadInlining = false;
  2383. std::function<void(int& blockIdx, BeBlock* endBlock, std::unordered_set<BeFunction*>& funcInlined)> _DoInlining;
  2384. _DoInlining = [&](int& blockIdx, BeBlock* endBlock, std::unordered_set<BeFunction*>& funcInlined)
  2385. {
  2386. for (; blockIdx < (int)func->mBlocks.size(); blockIdx++)
  2387. {
  2388. auto beBlock = func->mBlocks[blockIdx];
  2389. if (beBlock == endBlock)
  2390. {
  2391. // Let previous handler deal with this
  2392. --blockIdx;
  2393. return;
  2394. }
  2395. for (int instIdx = 0; instIdx < (int)beBlock->mInstructions.size(); instIdx++)
  2396. {
  2397. auto inst = beBlock->mInstructions[instIdx];
  2398. if (inHeadAllocas)
  2399. {
  2400. switch (inst->GetTypeId())
  2401. {
  2402. case BeAllocaInst::TypeId:
  2403. case BeNumericCastInst::TypeId:
  2404. case BeBitCastInst::TypeId:
  2405. numHeadAllocas++;
  2406. default:
  2407. inHeadAllocas = false;
  2408. }
  2409. }
  2410. if (auto phiInst = BeValueDynCast<BePhiInst>(inst))
  2411. {
  2412. for (auto incoming : phiInst->mIncoming)
  2413. {
  2414. bool found = false;
  2415. auto _CheckBlock = [&](BeBlock* checkBlock)
  2416. {
  2417. for (auto inst : checkBlock->mInstructions)
  2418. {
  2419. switch (inst->GetTypeId())
  2420. {
  2421. case BeBrInst::TypeId:
  2422. {
  2423. auto castedInst = (BeBrInst*)inst;
  2424. if (castedInst->mTargetBlock == beBlock)
  2425. {
  2426. found = true;
  2427. }
  2428. }
  2429. break;
  2430. case BeCondBrInst::TypeId:
  2431. {
  2432. auto castedInst = (BeCondBrInst*)inst;
  2433. if ((castedInst->mTrueBlock == beBlock) ||
  2434. (castedInst->mFalseBlock == beBlock))
  2435. {
  2436. found = true;
  2437. }
  2438. }
  2439. break;
  2440. case BeSwitchInst::TypeId:
  2441. {
  2442. auto castedInst = (BeSwitchInst*)inst;
  2443. if (castedInst->mDefaultBlock == beBlock)
  2444. found = true;
  2445. for (auto& caseVal : castedInst->mCases)
  2446. if (caseVal.mBlock == beBlock)
  2447. found = true;
  2448. }
  2449. break;
  2450. };
  2451. };
  2452. if (found)
  2453. {
  2454. incoming->mBlock = checkBlock;
  2455. return;
  2456. }
  2457. };
  2458. _CheckBlock(incoming->mBlock);
  2459. auto itr = inlineResumesMap.find(incoming->mBlock);
  2460. while (itr != inlineResumesMap.end())
  2461. {
  2462. if (found)
  2463. break;
  2464. if (itr->first != incoming->mBlock)
  2465. break;
  2466. auto checkBlock = itr->second;
  2467. _CheckBlock(checkBlock);
  2468. ++itr;
  2469. }
  2470. BF_ASSERT(found);
  2471. }
  2472. }
  2473. auto callInst = BeValueDynCast<BeCallInst>(inst);
  2474. if (callInst == NULL)
  2475. continue;
  2476. auto inlineFunc = BeValueDynCast<BeFunction>(callInst->mFunc);
  2477. if (inlineFunc == NULL)
  2478. continue;
  2479. if (inlineFunc == func)
  2480. continue;
  2481. if (!inlineFunc->mAlwaysInline)
  2482. continue;
  2483. if (inlineFunc->mBlocks.empty())
  2484. {
  2485. BF_FATAL("No content?");
  2486. continue;
  2487. }
  2488. // It's more efficient to do depth-first inlining so nested inlines will be pre-expanded
  2489. DoInlining(inlineFunc);
  2490. //TODO: Not needed anymore, right?
  2491. if (funcInlined.find(inlineFunc) != funcInlined.end())
  2492. continue; // Don't recursively inline
  2493. // Incase we have multiple inlines from the same location, those need to have unique dbgLocs
  2494. callInst->mDbgLoc = DupDebugLocation(callInst->mDbgLoc);
  2495. hadInlining = true;
  2496. BeInliner inliner;
  2497. inliner.mAlloc = &mAlloc;
  2498. inliner.mOwnedValueVec = &mOwnedValues;
  2499. inliner.mModule = this;
  2500. inliner.mSrcFunc = inlineFunc;
  2501. inliner.mDestFunc = func;
  2502. inliner.mCallInst = callInst;
  2503. if ((func->mDbgFunction != NULL) && (inlineFunc->mDbgFunction != NULL))
  2504. {
  2505. //BeDbgLexicalBlock
  2506. for (int srcVarIdx = 0; srcVarIdx < (int)inlineFunc->mDbgFunction->mVariables.size(); srcVarIdx++)
  2507. {
  2508. auto dbgGlobalVar = inlineFunc->mDbgFunction->mVariables[srcVarIdx];
  2509. if (dbgGlobalVar == NULL)
  2510. continue;
  2511. auto destDbgGlobalVar = mOwnedValues.Alloc<BeDbgVariable>();
  2512. destDbgGlobalVar->mName = dbgGlobalVar->mName;
  2513. destDbgGlobalVar->mType = dbgGlobalVar->mType;
  2514. destDbgGlobalVar->mInitType = dbgGlobalVar->mInitType;
  2515. if (dbgGlobalVar->mValue != NULL)
  2516. {
  2517. BF_ASSERT(BeValueDynCast<BeConstant>(dbgGlobalVar->mValue) != NULL);
  2518. destDbgGlobalVar->mValue = dbgGlobalVar->mValue;
  2519. }
  2520. else
  2521. BF_ASSERT(dbgGlobalVar->mValue == NULL);
  2522. destDbgGlobalVar->mScope = (BeMDNode*)inliner.Remap(dbgGlobalVar->mScope);
  2523. inliner.mValueMap[dbgGlobalVar] = destDbgGlobalVar;
  2524. func->mDbgFunction->mVariables.push_back(destDbgGlobalVar);
  2525. }
  2526. }
  2527. //int prevBlockSize = func->mBlocks.size();
  2528. // Split block, with calls that come after the call going into inlineResume
  2529. BeBlock* returnBlock = mOwnedValues.Alloc<BeBlock>();
  2530. returnBlock->mName = "inlineResume";
  2531. returnBlock->mFunction = func;
  2532. func->mBlocks.Insert(blockIdx + 1, returnBlock);
  2533. for (int srcIdx = instIdx + 1; srcIdx < (int)beBlock->mInstructions.size(); srcIdx++)
  2534. returnBlock->mInstructions.push_back(beBlock->mInstructions[srcIdx]);
  2535. beBlock->mInstructions.RemoveRange(instIdx, beBlock->mInstructions.size() - instIdx);
  2536. /*auto _InsertResume = (BeBlock* beBlock, BeBlock* returnBlock)[&]
  2537. {
  2538. inlineResumesMap.insert(std::make_pair(beBlock, returnBlock));
  2539. inlineHeadMap.insert(std::make_pair(returnBlock, beBlock));
  2540. auto prevHeadItr = inlineHeadMap.find(beBlock);
  2541. };
  2542. _InsertResume(beBlock, returnBlock);*/
  2543. auto headBlock = beBlock;
  2544. while (true)
  2545. {
  2546. auto itr = inlineHeadMap.find(headBlock);
  2547. if (itr == inlineHeadMap.end())
  2548. break;
  2549. headBlock = itr->second;
  2550. }
  2551. inlineResumesMap.insert(std::make_pair(headBlock, returnBlock));
  2552. inlineHeadMap.insert(std::make_pair(returnBlock, headBlock));
  2553. std::vector<BeBlock*> destBlocks;
  2554. for (int argIdx = 0; argIdx < (int)callInst->mArgs.size(); argIdx++)
  2555. {
  2556. auto& argVal = callInst->mArgs[argIdx];
  2557. inliner.mValueMap[GetArgument(argIdx)] = argVal.mValue;
  2558. }
  2559. for (int inlineBlockIdx = 0; inlineBlockIdx < (int)inlineFunc->mBlocks.size(); inlineBlockIdx++)
  2560. {
  2561. auto srcBlock = inlineFunc->mBlocks[inlineBlockIdx];
  2562. auto destBlock = mOwnedValues.Alloc<BeBlock>();
  2563. destBlock->mFunction = func;
  2564. destBlock->mName = inlineFunc->mName;
  2565. destBlock->mName += "_";
  2566. destBlock->mName += srcBlock->mName;
  2567. if (inlineBlockIdx == 0)
  2568. {
  2569. auto brInst = mAlloc.Alloc<BeBrInst>();
  2570. brInst->mDbgLoc = inst->mDbgLoc;
  2571. brInst->mTargetBlock = destBlock;
  2572. beBlock->mInstructions.push_back(brInst);
  2573. }
  2574. func->mBlocks.Insert(blockIdx + 1 + inlineBlockIdx, destBlock);
  2575. destBlocks.push_back(destBlock);
  2576. inliner.mValueMap[srcBlock] = destBlock;
  2577. }
  2578. bool inlineInHeadAllocas = true;
  2579. for (int inlineBlockIdx = 0; inlineBlockIdx < (int)inlineFunc->mBlocks.size(); inlineBlockIdx++)
  2580. {
  2581. auto srcBlock = inlineFunc->mBlocks[inlineBlockIdx];
  2582. auto destBlock = destBlocks[inlineBlockIdx];
  2583. inliner.mDestBlock = destBlock;
  2584. for (int srcInstIdx = 0; srcInstIdx < (int)srcBlock->mInstructions.size(); srcInstIdx++)
  2585. {
  2586. auto srcInst = srcBlock->mInstructions[srcInstIdx];
  2587. if (inlineInHeadAllocas)
  2588. {
  2589. if (srcInst->GetTypeId() == BeAllocaInst::TypeId)
  2590. {
  2591. BeAllocaInst* allocaInst = (BeAllocaInst*)srcInst;
  2592. auto destAlloca = mAlloc.Alloc<BeAllocaInst>();
  2593. destAlloca->mType = allocaInst->mType;
  2594. destAlloca->mArraySize = allocaInst->mArraySize;
  2595. destAlloca->mAlign = allocaInst->mAlign;
  2596. destAlloca->mNoChkStk = allocaInst->mNoChkStk;
  2597. destAlloca->mForceMem = allocaInst->mForceMem;
  2598. destAlloca->mName = allocaInst->mName;
  2599. auto destBlock = func->mBlocks[0];
  2600. destAlloca->mParentBlock = destBlock;
  2601. destBlock->mInstructions.Insert(numHeadAllocas, destAlloca);
  2602. numHeadAllocas++;
  2603. inliner.mValueMap[allocaInst] = destAlloca;
  2604. continue;
  2605. }
  2606. else
  2607. inlineInHeadAllocas = false;
  2608. }
  2609. if (auto storeInst = BeValueDynCast<BeStoreInst>(srcInst))
  2610. {
  2611. if (auto argVal = BeValueDynCast<BeArgument>(storeInst->mVal))
  2612. {
  2613. // This doesn't solve the 'SRET' issue of allowing a single-value return
  2614. // in a SRET function to directly map the returned value to the incoming
  2615. // SRET pointer, since that relies on setting a function-wide
  2616. // mCompositeRetVRegIdx value. Possible future optimization.
  2617. auto setCanMergeInst = mAlloc.Alloc<BeSetCanMergeInst>();
  2618. setCanMergeInst->mVal = inliner.Remap(storeInst->mPtr);
  2619. inliner.AddInst(setCanMergeInst, NULL);
  2620. }
  2621. }
  2622. if (auto retInst = BeValueDynCast<BeRetInst>(srcInst))
  2623. {
  2624. callInst->mInlineResult = inliner.Remap(retInst->mRetValue);
  2625. callInst->mFunc = NULL;
  2626. callInst->mArgs.clear();
  2627. callInst->mNoReturn = false;
  2628. callInst->mTailCall = false;
  2629. if (retInst->mRetValue != NULL)
  2630. {
  2631. // We want to ensure that we can step onto the closing brace to see the __return value
  2632. auto brInst = mAlloc.Alloc<BeEnsureInstructionAtInst>();
  2633. inliner.AddInst(brInst, retInst);
  2634. auto fenceInst = mAlloc.Alloc<BeLifetimeFenceInst>();
  2635. fenceInst->mFenceBlock = beBlock;
  2636. fenceInst->mPtr = callInst->mInlineResult;
  2637. inliner.AddInst(fenceInst, retInst);
  2638. }
  2639. auto brInst = mAlloc.Alloc<BeBrInst>();
  2640. brInst->mTargetBlock = returnBlock;
  2641. inliner.AddInst(brInst, retInst);
  2642. }
  2643. else
  2644. inliner.VisitChild(srcInst);
  2645. }
  2646. }
  2647. /*if (callInst->mInlineResult != NULL)
  2648. {
  2649. auto fenceInst = mAlloc.Alloc<BeLifetimeFenceInst>();
  2650. fenceInst->mPtr = callInst->mInlineResult;
  2651. beBlock->mInstructions.push_back(fenceInst);
  2652. }*/
  2653. auto inlinedFuncInlined = funcInlined;
  2654. inlinedFuncInlined.insert(inlineFunc);
  2655. _DoInlining(blockIdx, returnBlock, inlinedFuncInlined);
  2656. }
  2657. }
  2658. };
  2659. /*int prevDbgVars = 0;
  2660. if (func->mDbgFunction != NULL)
  2661. prevDbgVars = (int)func->mDbgFunction->mVariables.size();*/
  2662. std::unordered_set<BeFunction*> newFuncSet;
  2663. _DoInlining(blockIdx, NULL, newFuncSet);
  2664. /*if ((func->mDbgFunction != NULL) && (prevDbgVars != (int)func->mDbgFunction->mVariables.size()))
  2665. {
  2666. std::stable_sort(func->mDbgFunction->mVariables.begin(), func->mDbgFunction->mVariables.end(), [] (BeDbgVariable* lhs, BeDbgVariable* rhs)
  2667. {
  2668. BeDbgLoc* lhsInlinePos = NULL;
  2669. if (lhs->mDeclDbgLoc != NULL)
  2670. lhsInlinePos = lhs->mDeclDbgLoc->mDbgInlinedAt;
  2671. BeDbgLoc* rhsInlinePos = NULL;
  2672. if (rhs->mDeclDbgLoc != NULL)
  2673. rhsInlinePos = rhs->mDeclDbgLoc->mDbgInlinedAt;
  2674. if ((lhsInlinePos == NULL) || (rhsInlinePos == NULL))
  2675. {
  2676. if ((lhsInlinePos == NULL) && (rhsInlinePos != NULL))
  2677. return true;
  2678. return false;
  2679. }
  2680. return lhsInlinePos->mIdx < rhsInlinePos->mIdx;
  2681. });
  2682. }*/
  2683. }
  2684. void BeModule::DoInlining()
  2685. {
  2686. BP_ZONE("BeModule::DoInlining");
  2687. for (auto func : mFunctions)
  2688. {
  2689. DoInlining(func);
  2690. }
  2691. }
  2692. BeCmpKind BeModule::InvertCmp(BeCmpKind cmpKind)
  2693. {
  2694. switch (cmpKind)
  2695. {
  2696. case BeCmpKind_SLT:
  2697. return BeCmpKind_SGE;
  2698. case BeCmpKind_ULT:
  2699. return BeCmpKind_UGE;
  2700. case BeCmpKind_OLT:
  2701. return BeCmpKind_OGE;
  2702. case BeCmpKind_SLE:
  2703. return BeCmpKind_SGT;
  2704. case BeCmpKind_ULE:
  2705. return BeCmpKind_UGT;
  2706. case BeCmpKind_OLE:
  2707. return BeCmpKind_OGT;
  2708. case BeCmpKind_EQ:
  2709. return BeCmpKind_NE;
  2710. case BeCmpKind_OEQ:
  2711. return BeCmpKind_UNE;
  2712. case BeCmpKind_NE:
  2713. return BeCmpKind_EQ;
  2714. case BeCmpKind_UNE:
  2715. return BeCmpKind_OEQ;
  2716. case BeCmpKind_SGT:
  2717. return BeCmpKind_SLE;
  2718. case BeCmpKind_UGT:
  2719. return BeCmpKind_ULE;
  2720. case BeCmpKind_OGT:
  2721. return BeCmpKind_OLE;
  2722. case BeCmpKind_SGE:
  2723. return BeCmpKind_SLT;
  2724. case BeCmpKind_UGE:
  2725. return BeCmpKind_ULT;
  2726. case BeCmpKind_OGE:
  2727. return BeCmpKind_OLT;
  2728. }
  2729. return cmpKind;
  2730. }
  2731. BeCmpKind BeModule::SwapCmpSides(BeCmpKind cmpKind)
  2732. {
  2733. switch (cmpKind)
  2734. {
  2735. case BeCmpKind_SLT:
  2736. return BeCmpKind_SGT;
  2737. case BeCmpKind_ULT:
  2738. return BeCmpKind_UGT;
  2739. case BeCmpKind_OLT:
  2740. return BeCmpKind_OGT;
  2741. case BeCmpKind_SLE:
  2742. return BeCmpKind_SGE;
  2743. case BeCmpKind_ULE:
  2744. return BeCmpKind_UGE;
  2745. case BeCmpKind_OLE:
  2746. return BeCmpKind_OGE;
  2747. case BeCmpKind_EQ:
  2748. return BeCmpKind_EQ;
  2749. case BeCmpKind_NE:
  2750. return BeCmpKind_NE;
  2751. case BeCmpKind_SGT:
  2752. return BeCmpKind_SLT;
  2753. case BeCmpKind_UGT:
  2754. return BeCmpKind_ULT;
  2755. case BeCmpKind_OGT:
  2756. return BeCmpKind_OLT;
  2757. case BeCmpKind_SGE:
  2758. return BeCmpKind_SLE;
  2759. case BeCmpKind_UGE:
  2760. return BeCmpKind_ULE;
  2761. case BeCmpKind_OGE:
  2762. return BeCmpKind_OLE;
  2763. }
  2764. return cmpKind;
  2765. }
  2766. bool BeModule::IsCmpOrdered(BeCmpKind cmpKind)
  2767. {
  2768. switch (cmpKind)
  2769. {
  2770. case BeCmpKind_OLT:
  2771. case BeCmpKind_OLE:
  2772. case BeCmpKind_OGT:
  2773. case BeCmpKind_OGE:
  2774. case BeCmpKind_OEQ:
  2775. case BeCmpKind_UNE:
  2776. return true;
  2777. }
  2778. return false;
  2779. }
  2780. void BeModule::AddInst(BeInst* inst)
  2781. {
  2782. inst->mDbgLoc = mCurDbgLoc;
  2783. inst->mParentBlock = mActiveBlock;
  2784. if (mInsertPos == -1)
  2785. {
  2786. mActiveBlock->mInstructions.push_back(inst);
  2787. }
  2788. else
  2789. {
  2790. mActiveBlock->mInstructions.Insert(mInsertPos, inst);
  2791. mInsertPos++;
  2792. }
  2793. //inst->mFuncRelId = mActiveBlock->mFunction->mCurElementId++;
  2794. }
  2795. void BeModule::ToString(StringImpl& str, BeType* type)
  2796. {
  2797. if (type == NULL)
  2798. {
  2799. str += "<MissingType>";
  2800. return;
  2801. }
  2802. switch (type->mTypeCode)
  2803. {
  2804. case BeTypeCode_None:
  2805. str += "void";
  2806. return;
  2807. case BeTypeCode_NullPtr:
  2808. str += "null";
  2809. return;
  2810. case BeTypeCode_Boolean:
  2811. str += "bool";
  2812. return;
  2813. case BeTypeCode_Int8:
  2814. str += "i8";
  2815. return;
  2816. case BeTypeCode_Int16:
  2817. str += "i16";
  2818. return;
  2819. case BeTypeCode_Int32:
  2820. str += "i32";
  2821. return;
  2822. case BeTypeCode_Int64:
  2823. str += "i64";
  2824. return;
  2825. case BeTypeCode_Float:
  2826. str += "float";
  2827. return;
  2828. case BeTypeCode_Double:
  2829. str += "double";
  2830. return;
  2831. case BeTypeCode_Pointer:
  2832. ToString(str, ((BePointerType*)type)->mElementType);
  2833. str += "*";
  2834. return;
  2835. case BeTypeCode_Struct:
  2836. str += ((BeStructType*)type)->mName;
  2837. return;
  2838. case BeTypeCode_Function:
  2839. {
  2840. auto funcType = (BeFunctionType*)type;
  2841. ToString(str, funcType->mReturnType);
  2842. str += "(";
  2843. for (int paramIdx = 0; paramIdx < (int)funcType->mParams.size(); paramIdx++)
  2844. {
  2845. if (paramIdx > 0)
  2846. str += ", ";
  2847. ToString(str, funcType->mParams[paramIdx].mType);
  2848. }
  2849. if (funcType->mIsVarArg)
  2850. {
  2851. if (!funcType->mParams.IsEmpty())
  2852. str += ", ";
  2853. str += "...";
  2854. }
  2855. str += ")";
  2856. return;
  2857. }
  2858. case BeTypeCode_SizedArray:
  2859. {
  2860. auto arrayType = (BeSizedArrayType*)type;
  2861. ToString(str, arrayType->mElementType);
  2862. str += "[";
  2863. str += StrFormat("%d", arrayType->mLength);
  2864. str += "]";
  2865. return;
  2866. }
  2867. case BeTypeCode_Vector:
  2868. {
  2869. auto arrayType = (BeSizedArrayType*)type;
  2870. ToString(str, arrayType->mElementType);
  2871. str += "<";
  2872. str += StrFormat("%d", arrayType->mLength);
  2873. str += ">";
  2874. return;
  2875. }
  2876. }
  2877. str += "<UnknownType>";
  2878. }
  2879. void BeModule::SetActiveFunction(BeFunction* function)
  2880. {
  2881. mActiveFunction = function;
  2882. }
  2883. BeArgument* BeModule::GetArgument(int argIdx)
  2884. {
  2885. while ((int)argIdx >= mArgs.size())
  2886. {
  2887. auto arg = mAlloc.Alloc<BeArgument>();
  2888. arg->mModule = this;
  2889. arg->mArgIdx = (int)mArgs.size();
  2890. mArgs.push_back(arg);
  2891. }
  2892. return mArgs[argIdx];
  2893. }
  2894. BeBlock* BeModule::CreateBlock(const StringImpl& name)
  2895. {
  2896. auto block = mOwnedValues.Alloc<BeBlock>();
  2897. block->mName = name;
  2898. return block;
  2899. }
  2900. void BeModule::AddBlock(BeFunction* function, BeBlock* block)
  2901. {
  2902. block->mFunction = function;
  2903. function->mBlocks.push_back(block);
  2904. }
  2905. void BeModule::RemoveBlock(BeFunction* function, BeBlock* block)
  2906. {
  2907. bool didRemove = function->mBlocks.Remove(block);
  2908. BF_ASSERT(didRemove);
  2909. #ifdef _DEBUG
  2910. for (auto inst : block->mInstructions)
  2911. inst->mWasRemoved = true;
  2912. #endif
  2913. }
  2914. BeBlock* BeModule::GetInsertBlock()
  2915. {
  2916. return mActiveBlock;
  2917. }
  2918. void BeModule::SetInsertPoint(BeBlock* block)
  2919. {
  2920. mActiveBlock = block;
  2921. mInsertPos = -1;
  2922. }
  2923. void BeModule::SetInsertPointAtStart(BeBlock* block)
  2924. {
  2925. mActiveBlock = block;
  2926. mInsertPos = 0;
  2927. }
  2928. BeFunction* BeModule::CreateFunction(BeFunctionType* funcType, BfIRLinkageType linkageType, const StringImpl& name)
  2929. {
  2930. auto func = mOwnedValues.Alloc<BeFunction>();
  2931. func->mName = name;
  2932. func->mModule = this;
  2933. func->mType = mContext->GetPointerTo(funcType);
  2934. func->mLinkageType = linkageType;
  2935. func->mParams.Resize(funcType->mParams.size());
  2936. mFunctions.push_back(func);
  2937. #ifdef _DEBUG
  2938. // It IS possible hit this, especially if we have multiple intrinsics mapping to 'malloc' for example
  2939. //BF_ASSERT(mFunctionMap.TryAdd(name, func));
  2940. #endif
  2941. return func;
  2942. }
  2943. BeDbgLoc* BeModule::GetCurrentDebugLocation()
  2944. {
  2945. return mCurDbgLoc;
  2946. }
  2947. void BeModule::SetCurrentDebugLocation(BeDbgLoc* debugLoc)
  2948. {
  2949. mCurDbgLoc = debugLoc;
  2950. }
  2951. void BeModule::SetCurrentDebugLocation(int line, int column, BeMDNode* dbgScope, BeDbgLoc* dbgInlinedAt)
  2952. {
  2953. if (mCurDbgLoc == NULL)
  2954. mCurDbgLoc = mLastDbgLoc;
  2955. if ((mCurDbgLoc != NULL) &&
  2956. (mCurDbgLoc->mLine == line) &&
  2957. (mCurDbgLoc->mColumn == column) &&
  2958. (mCurDbgLoc->mDbgScope == dbgScope) &&
  2959. (mCurDbgLoc->mDbgInlinedAt == dbgInlinedAt))
  2960. return;
  2961. mCurDbgLoc = mAlloc.Alloc<BeDbgLoc>();
  2962. mCurDbgLoc->mLine = line;
  2963. mCurDbgLoc->mColumn = column;
  2964. mCurDbgLoc->mDbgScope = dbgScope;
  2965. mCurDbgLoc->mDbgInlinedAt = dbgInlinedAt;
  2966. mCurDbgLoc->mIdx = mCurDbgLocIdx++;
  2967. if ((dbgInlinedAt != NULL) && (!dbgInlinedAt->mHadInline))
  2968. {
  2969. dbgInlinedAt->mHadInline = true;
  2970. }
  2971. mLastDbgLoc = mCurDbgLoc;
  2972. }
  2973. BeDbgLoc* BeModule::DupDebugLocation(BeDbgLoc* dbgLoc)
  2974. {
  2975. if (dbgLoc == NULL)
  2976. return dbgLoc;
  2977. auto newDbgLoc = mAlloc.Alloc<BeDbgLoc>();
  2978. newDbgLoc->mLine = dbgLoc->mLine;
  2979. newDbgLoc->mColumn = dbgLoc->mColumn;
  2980. newDbgLoc->mDbgScope = dbgLoc->mDbgScope;
  2981. newDbgLoc->mDbgInlinedAt = dbgLoc->mDbgInlinedAt;
  2982. newDbgLoc->mIdx = mCurDbgLocIdx++;
  2983. if ((newDbgLoc->mDbgInlinedAt != NULL) && (!newDbgLoc->mDbgInlinedAt->mHadInline))
  2984. {
  2985. newDbgLoc->mDbgInlinedAt->mHadInline = true;
  2986. }
  2987. return newDbgLoc;
  2988. }
  2989. void BeModule::DupCurrentDebugLocation()
  2990. {
  2991. mCurDbgLoc = DupDebugLocation(mCurDbgLoc);
  2992. mLastDbgLoc = mCurDbgLoc;
  2993. }
  2994. BeNopInst* BeModule::CreateNop()
  2995. {
  2996. auto inst = mAlloc.Alloc<BeNopInst>();
  2997. AddInst(inst);
  2998. return inst;
  2999. }
  3000. BeUndefValueInst* BeModule::CreateUndefValue(BeType* type)
  3001. {
  3002. auto undefValue = AllocInst<BeUndefValueInst>();
  3003. undefValue->mType = type;
  3004. return undefValue;
  3005. }
  3006. BeNumericCastInst* BeModule::CreateNumericCast(BeValue* value, BeType* toType, bool valSigned, bool toSigned)
  3007. {
  3008. auto inst = mAlloc.Alloc<BeNumericCastInst>();
  3009. inst->mValue = value;
  3010. inst->mToType = toType;
  3011. inst->mValSigned = valSigned;
  3012. inst->mToSigned = toSigned;
  3013. BF_ASSERT(toType != NULL);
  3014. AddInst(inst);
  3015. return inst;
  3016. }
  3017. BeBitCastInst * BeModule::CreateBitCast(BeValue* value, BeType* toType)
  3018. {
  3019. auto inst = mAlloc.Alloc<BeBitCastInst>();
  3020. inst->mValue = value;
  3021. inst->mToType = toType;
  3022. AddInst(inst);
  3023. return inst;
  3024. }
  3025. BeCmpInst* BeModule::CreateCmp(BeCmpKind cmpKind, BeValue* lhs, BeValue* rhs)
  3026. {
  3027. auto inst = mAlloc.Alloc<BeCmpInst>();
  3028. inst->mCmpKind = cmpKind;
  3029. inst->mLHS = lhs;
  3030. inst->mRHS = rhs;
  3031. AddInst(inst);
  3032. return inst;
  3033. }
  3034. BeBinaryOpInst* BeModule::CreateBinaryOp(BeBinaryOpKind opKind, BeValue* lhs, BeValue* rhs, BfOverflowCheckKind overflowCheckKind)
  3035. {
  3036. #ifdef _DEBUG
  3037. auto leftType = lhs->GetType();
  3038. auto rightType = rhs->GetType();
  3039. BF_ASSERT(leftType == rightType);
  3040. #endif
  3041. auto inst = mAlloc.Alloc<BeBinaryOpInst>();
  3042. inst->mOpKind = opKind;
  3043. inst->mLHS = lhs;
  3044. inst->mRHS = rhs;
  3045. inst->mOverflowCheckKind = overflowCheckKind;
  3046. AddInst(inst);
  3047. return inst;
  3048. }
  3049. BeAllocaInst* BeModule::CreateAlloca(BeType* type)
  3050. {
  3051. auto inst = mAlloc.Alloc<BeAllocaInst>();
  3052. inst->mType = type;
  3053. AddInst(inst);
  3054. return inst;
  3055. }
  3056. BeLoadInst* BeModule::CreateLoad(BeValue* value, bool isVolatile)
  3057. {
  3058. auto inst = mAlloc.Alloc<BeLoadInst>();
  3059. inst->mTarget = value;
  3060. inst->mIsVolatile = isVolatile;
  3061. AddInst(inst);
  3062. return inst;
  3063. }
  3064. BeLoadInst* BeModule::CreateAlignedLoad(BeValue* value, int alignment, bool isVolatile)
  3065. {
  3066. BF_ASSERT(value->GetType()->IsPointer());
  3067. auto inst = mAlloc.Alloc<BeLoadInst>();
  3068. inst->mTarget = value;
  3069. inst->mIsVolatile = isVolatile;
  3070. AddInst(inst);
  3071. return inst;
  3072. }
  3073. BeStoreInst* BeModule::CreateStore(BeValue* val, BeValue* ptr, bool isVolatile)
  3074. {
  3075. BF_ASSERT(ptr->GetType()->IsPointer());
  3076. auto inst = mAlloc.Alloc<BeStoreInst>();
  3077. inst->mVal = val;
  3078. inst->mPtr = ptr;
  3079. inst->mIsVolatile = isVolatile;
  3080. AddInst(inst);
  3081. return inst;
  3082. }
  3083. BeStoreInst* BeModule::CreateAlignedStore(BeValue* val, BeValue* ptr, int alignment, bool isVolatile)
  3084. {
  3085. BF_ASSERT(ptr->GetType()->IsPointer());
  3086. auto inst = mAlloc.Alloc<BeStoreInst>();
  3087. inst->mVal = val;
  3088. inst->mPtr = ptr;
  3089. inst->mIsVolatile = isVolatile;
  3090. AddInst(inst);
  3091. return inst;
  3092. }
  3093. BeGEPInst* BeModule::CreateGEP(BeValue* ptr, BeValue* idx0, BeValue* idx1)
  3094. {
  3095. #ifdef _DEBUG
  3096. BF_ASSERT(ptr->GetType()->IsPointer());
  3097. #endif
  3098. auto inst = mAlloc.Alloc<BeGEPInst>();
  3099. inst->mPtr = ptr;
  3100. inst->mIdx0 = idx0;
  3101. inst->mIdx1 = idx1;
  3102. AddInst(inst);
  3103. #ifdef _DEBUG
  3104. inst->GetType();
  3105. #endif
  3106. return inst;
  3107. }
  3108. BeBrInst* BeModule::CreateBr(BeBlock* block)
  3109. {
  3110. auto inst = mAlloc.Alloc<BeBrInst>();
  3111. inst->mTargetBlock = block;
  3112. AddInst(inst);
  3113. return inst;
  3114. }
  3115. BeCondBrInst* BeModule::CreateCondBr(BeValue* cond, BeBlock* trueBlock, BeBlock* falseBlock)
  3116. {
  3117. auto inst = mAlloc.Alloc<BeCondBrInst>();
  3118. inst->mCond = cond;
  3119. inst->mTrueBlock = trueBlock;
  3120. inst->mFalseBlock = falseBlock;
  3121. AddInst(inst);
  3122. return inst;
  3123. }
  3124. BeRetInst* BeModule::CreateRetVoid()
  3125. {
  3126. auto inst = mAlloc.Alloc<BeRetInst>();
  3127. AddInst(inst);
  3128. return inst;
  3129. }
  3130. BeRetInst* BeModule::CreateRet(BeValue* value)
  3131. {
  3132. auto inst = mAlloc.Alloc<BeRetInst>();
  3133. inst->mRetValue = value;
  3134. AddInst(inst);
  3135. return inst;
  3136. }
  3137. BeSetRetInst* BeModule::CreateSetRet(BeValue* value, int returnTypeId)
  3138. {
  3139. auto inst = mAlloc.Alloc<BeSetRetInst>();
  3140. inst->mRetValue = value;
  3141. inst->mReturnTypeId = returnTypeId;
  3142. AddInst(inst);
  3143. return inst;
  3144. }
  3145. BeCallInst* BeModule::CreateCall(BeValue* func, const SizedArrayImpl<BeValue*>& args)
  3146. {
  3147. auto inst = mOwnedValues.Alloc<BeCallInst>();
  3148. inst->mFunc = func;
  3149. if (!args.IsEmpty())
  3150. {
  3151. inst->mArgs.resize(args.size());
  3152. for (int i = 0; i < (int)args.size(); i++)
  3153. inst->mArgs[i].mValue = args[i];
  3154. }
  3155. AddInst(inst);
  3156. return inst;
  3157. }
  3158. BeConstant* BeModule::GetConstant(BeType* type, double floatVal)
  3159. {
  3160. auto constant = mAlloc.Alloc<BeConstant>();
  3161. constant->mType = type;
  3162. constant->mDouble = floatVal;
  3163. return constant;
  3164. }
  3165. BeConstant* BeModule::GetConstant(BeType* type, int64 intVal)
  3166. {
  3167. auto constant = mAlloc.Alloc<BeConstant>();
  3168. constant->mType = type;
  3169. // Sign extend. One reason this is required is to for binary searching on switches
  3170. switch (type->mTypeCode)
  3171. {
  3172. case BeTypeCode_Int8:
  3173. constant->mInt64 = (int8)intVal;
  3174. break;
  3175. case BeTypeCode_Int16:
  3176. constant->mInt64 = (int16)intVal;
  3177. break;
  3178. case BeTypeCode_Int32:
  3179. constant->mInt64 = (int32)intVal;
  3180. break;
  3181. default:
  3182. constant->mInt64 = intVal;
  3183. }
  3184. return constant;
  3185. }
  3186. BeConstant* BeModule::GetConstant(BeType* type, bool boolVal)
  3187. {
  3188. auto constant = mAlloc.Alloc<BeConstant>();
  3189. constant->mType = type;
  3190. constant->mBool = boolVal;
  3191. return constant;
  3192. }
  3193. BeConstant* BeModule::GetConstantNull(BePointerType* type)
  3194. {
  3195. auto constant = mAlloc.Alloc<BeConstant>();
  3196. if (type == NULL)
  3197. constant->mType = mContext->GetPrimitiveType(BeTypeCode_NullPtr);
  3198. else
  3199. constant->mType = type;
  3200. return constant;
  3201. }
  3202. BeDbgReferenceType * BeDbgModule::CreateReferenceType(BeDbgType* elementType)
  3203. {
  3204. BeDbgType* useType = elementType->FindDerivedType(BeDbgReferenceType::TypeId);
  3205. if (useType == NULL)
  3206. {
  3207. auto dbgType = mTypes.Alloc<BeDbgReferenceType>();
  3208. dbgType->mElement = elementType;
  3209. elementType->mDerivedTypes.PushFront(dbgType, &mBeModule->mAlloc);
  3210. useType = dbgType;
  3211. }
  3212. return (BeDbgReferenceType*)useType;
  3213. }
  3214. void BeDbgModule::HashContent(BeHashContext & hashCtx)
  3215. {
  3216. hashCtx.Mixin(TypeId);
  3217. hashCtx.MixinStr(mFileName);
  3218. hashCtx.MixinStr(mDirectory);
  3219. hashCtx.MixinStr(mProducer);
  3220. BeDumpContext dc;
  3221. String lhsName;
  3222. String rhsName;
  3223. if (!mFuncs.IsEmpty())
  3224. {
  3225. auto _GetName = [&](BeDbgFunction* func, String& str)
  3226. {
  3227. if (!func->mLinkageName.IsEmpty())
  3228. str.Append(func->mLinkageName);
  3229. else
  3230. dc.ToString(str, func);
  3231. };
  3232. Array<BeDbgFunction*> unrefFuncs;
  3233. for (auto dbgFunc : mFuncs)
  3234. {
  3235. if ((!dbgFunc->mIncludedAsMember) && (dbgFunc->mHashId == -1))
  3236. unrefFuncs.Add(dbgFunc);
  3237. }
  3238. std::sort(unrefFuncs.begin(), unrefFuncs.end(), [&](BeDbgFunction* lhs, BeDbgFunction* rhs)
  3239. {
  3240. lhsName.Clear();
  3241. _GetName(lhs, lhsName);
  3242. rhsName.Clear();
  3243. _GetName(rhs, rhsName);
  3244. int cmp = String::Compare(lhsName, rhsName, false);
  3245. if (cmp != 0)
  3246. return cmp < 0;
  3247. if (lhs->mFile != rhs->mFile)
  3248. {
  3249. lhsName.Clear();
  3250. rhsName.Clear();
  3251. if (lhs->mFile != NULL)
  3252. lhs->mFile->ToString(lhsName);
  3253. if (rhs->mFile != NULL)
  3254. rhs->mFile->ToString(rhsName);
  3255. cmp = String::Compare(lhsName, rhsName, false);
  3256. if (cmp != 0)
  3257. return cmp < 0;
  3258. }
  3259. if (lhs->mLine != rhs->mLine)
  3260. return lhs->mLine < rhs->mLine;
  3261. return lhs->mIdx < rhs->mIdx;
  3262. });
  3263. hashCtx.Mixin(unrefFuncs.size());
  3264. for (auto dbgFunc : unrefFuncs)
  3265. {
  3266. if (dbgFunc->mHashId == -1)
  3267. dbgFunc->HashReference(hashCtx);
  3268. }
  3269. }
  3270. if (!mGlobalVariables.IsEmpty())
  3271. {
  3272. auto _GetName = [&](BeDbgGlobalVariable* func, String& str)
  3273. {
  3274. if (!func->mLinkageName.IsEmpty())
  3275. str.Append(func->mLinkageName);
  3276. else
  3277. dc.ToString(str, func);
  3278. };
  3279. std::sort(mGlobalVariables.begin(), mGlobalVariables.end(), [&](BeDbgGlobalVariable* lhs, BeDbgGlobalVariable* rhs)
  3280. {
  3281. lhsName.Clear();
  3282. _GetName(lhs, lhsName);
  3283. rhsName.Clear();
  3284. _GetName(rhs, rhsName);
  3285. return (lhsName < rhsName);
  3286. });
  3287. for (auto globalVar : mGlobalVariables)
  3288. globalVar->HashReference(hashCtx);
  3289. }
  3290. }