ssa.cpp 121 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028
  1. struct ssaModule;
  2. struct ssaProcedure;
  3. struct ssaBlock;
  4. struct ssaValue;
  5. enum ssaDebugInfoKind {
  6. ssaDebugInfo_Invalid,
  7. ssaDebugInfo_CompileUnit,
  8. ssaDebugInfo_File,
  9. ssaDebugInfo_Proc,
  10. ssaDebugInfo_AllProcs,
  11. ssaDebugInfo_Count,
  12. };
  13. struct ssaDebugInfo {
  14. ssaDebugInfoKind kind;
  15. i32 id;
  16. union {
  17. struct {
  18. AstFile *file;
  19. String producer;
  20. ssaDebugInfo *all_procs;
  21. } CompileUnit;
  22. struct {
  23. AstFile *file;
  24. String filename;
  25. String directory;
  26. } File;
  27. struct {
  28. Entity * entity;
  29. String name;
  30. ssaDebugInfo *file;
  31. TokenPos pos;
  32. } Proc;
  33. struct {
  34. gbArray(ssaDebugInfo *) procs;
  35. } AllProcs;
  36. };
  37. };
  38. struct ssaModule {
  39. CheckerInfo * info;
  40. BaseTypeSizes sizes;
  41. gbArena arena;
  42. gbArena tmp_arena;
  43. gbAllocator allocator;
  44. gbAllocator tmp_allocator;
  45. b32 generate_debug_info;
  46. u32 stmt_state_flags;
  47. // String source_filename;
  48. String layout;
  49. // String triple;
  50. Map<ssaValue *> values; // Key: Entity *
  51. Map<ssaValue *> members; // Key: String
  52. Map<String> type_names; // Key: Type *
  53. Map<ssaDebugInfo *> debug_info; // Key: Unique pointer
  54. i32 global_string_index;
  55. i32 global_array_index; // For ConstantSlice
  56. gbArray(ssaValue *) procs; // NOTE(bill): Procedures to generate
  57. };
  58. struct ssaBlock {
  59. i32 id;
  60. AstNode *node;
  61. Scope *scope;
  62. isize scope_index;
  63. String label;
  64. ssaProcedure *parent;
  65. b32 added;
  66. gbArray(ssaValue *) instrs;
  67. gbArray(ssaValue *) values;
  68. };
  69. struct ssaTargetList {
  70. ssaTargetList *prev;
  71. ssaBlock * break_;
  72. ssaBlock * continue_;
  73. ssaBlock * fallthrough_;
  74. };
  75. enum ssaDeferExitKind {
  76. ssaDeferExit_Default,
  77. ssaDeferExit_Return,
  78. ssaDeferExit_Branch,
  79. };
  80. enum ssaDeferKind {
  81. ssaDefer_Node,
  82. ssaDefer_Instr,
  83. };
  84. struct ssaDefer {
  85. ssaDeferKind kind;
  86. isize scope_index;
  87. ssaBlock *block;
  88. union {
  89. AstNode *stmt;
  90. // NOTE(bill): `instr` will be copied every time to create a new one
  91. ssaValue *instr;
  92. };
  93. };
  94. struct ssaProcedure {
  95. ssaProcedure *parent;
  96. gbArray(ssaProcedure *) children;
  97. Entity * entity;
  98. ssaModule * module;
  99. String name;
  100. Type * type;
  101. AstNode * type_expr;
  102. AstNode * body;
  103. u64 tags;
  104. isize scope_index;
  105. gbArray(ssaDefer) defer_stmts;
  106. gbArray(ssaBlock *) blocks;
  107. ssaBlock * decl_block;
  108. ssaBlock * entry_block;
  109. ssaBlock * curr_block;
  110. ssaTargetList * target_list;
  111. };
  112. #define SSA_STARTUP_RUNTIME_PROC_NAME "__$startup_runtime"
  113. #define SSA_TYPE_INFO_DATA_NAME "__$type_info_data"
  114. #define SSA_TYPE_INFO_DATA_MEMBER_NAME "__$type_info_data_member"
  115. #define SSA_INSTR_KINDS \
  116. SSA_INSTR_KIND(Invalid), \
  117. SSA_INSTR_KIND(Comment), \
  118. SSA_INSTR_KIND(Local), \
  119. SSA_INSTR_KIND(ZeroInit), \
  120. SSA_INSTR_KIND(Store), \
  121. SSA_INSTR_KIND(Load), \
  122. SSA_INSTR_KIND(GetElementPtr), \
  123. SSA_INSTR_KIND(ExtractValue), \
  124. SSA_INSTR_KIND(InsertValue), \
  125. SSA_INSTR_KIND(Conv), \
  126. SSA_INSTR_KIND(Br), \
  127. SSA_INSTR_KIND(Ret), \
  128. SSA_INSTR_KIND(Select), \
  129. SSA_INSTR_KIND(Unreachable), \
  130. SSA_INSTR_KIND(BinaryOp), \
  131. SSA_INSTR_KIND(Call), \
  132. SSA_INSTR_KIND(NoOp), \
  133. SSA_INSTR_KIND(ExtractElement), \
  134. SSA_INSTR_KIND(InsertElement), \
  135. SSA_INSTR_KIND(ShuffleVector), \
  136. SSA_INSTR_KIND(StartupRuntime), \
  137. SSA_INSTR_KIND(Count),
  138. enum ssaInstrKind {
  139. #define SSA_INSTR_KIND(x) GB_JOIN2(ssaInstr_, x)
  140. SSA_INSTR_KINDS
  141. #undef SSA_INSTR_KIND
  142. };
  143. String const ssa_instr_strings[] = {
  144. #define SSA_INSTR_KIND(x) {cast(u8 *)#x, gb_size_of(#x)-1}
  145. SSA_INSTR_KINDS
  146. #undef SSA_INSTR_KIND
  147. };
  148. #define SSA_CONV_KINDS \
  149. SSA_CONV_KIND(Invalid), \
  150. SSA_CONV_KIND(trunc), \
  151. SSA_CONV_KIND(zext), \
  152. SSA_CONV_KIND(fptrunc), \
  153. SSA_CONV_KIND(fpext), \
  154. SSA_CONV_KIND(fptoui), \
  155. SSA_CONV_KIND(fptosi), \
  156. SSA_CONV_KIND(uitofp), \
  157. SSA_CONV_KIND(sitofp), \
  158. SSA_CONV_KIND(ptrtoint), \
  159. SSA_CONV_KIND(inttoptr), \
  160. SSA_CONV_KIND(bitcast), \
  161. SSA_CONV_KIND(Count)
  162. enum ssaConvKind {
  163. #define SSA_CONV_KIND(x) GB_JOIN2(ssaConv_, x)
  164. SSA_CONV_KINDS
  165. #undef SSA_CONV_KIND
  166. };
  167. String const ssa_conv_strings[] = {
  168. #define SSA_CONV_KIND(x) {cast(u8 *)#x, gb_size_of(#x)-1}
  169. SSA_CONV_KINDS
  170. #undef SSA_CONV_KIND
  171. };
  172. struct ssaInstr {
  173. ssaInstrKind kind;
  174. ssaBlock *parent;
  175. Type *type;
  176. union {
  177. struct {
  178. String text;
  179. } Comment;
  180. struct {
  181. Entity *entity;
  182. Type * type;
  183. b32 zero_initialized;
  184. } Local;
  185. struct {
  186. ssaValue *address;
  187. } ZeroInit;
  188. struct {
  189. ssaValue *address;
  190. ssaValue *value;
  191. } Store;
  192. struct {
  193. Type *type;
  194. ssaValue *address;
  195. } Load;
  196. struct {
  197. ssaValue *address;
  198. Type * result_type;
  199. Type * elem_type;
  200. ssaValue *indices[2];
  201. isize index_count;
  202. b32 inbounds;
  203. } GetElementPtr;
  204. struct {
  205. ssaValue *address;
  206. Type * result_type;
  207. Type * elem_type;
  208. i32 index;
  209. } ExtractValue;
  210. struct {
  211. ssaValue *value;
  212. ssaValue *elem;
  213. ssaValue *index;
  214. } InsertValue;
  215. struct {
  216. ssaConvKind kind;
  217. ssaValue *value;
  218. Type *from, *to;
  219. } Conv;
  220. struct {
  221. ssaValue *cond;
  222. ssaBlock *true_block;
  223. ssaBlock *false_block;
  224. } Br;
  225. struct { ssaValue *value; } Ret;
  226. struct {} Unreachable;
  227. struct {
  228. ssaValue *cond;
  229. ssaValue *true_value;
  230. ssaValue *false_value;
  231. } Select;
  232. struct {
  233. Type *type;
  234. Token op;
  235. ssaValue *left, *right;
  236. } BinaryOp;
  237. struct {
  238. Type *type; // return type
  239. ssaValue *value;
  240. ssaValue **args;
  241. isize arg_count;
  242. } Call;
  243. struct {
  244. ssaValue *vector;
  245. ssaValue *index;
  246. } ExtractElement;
  247. struct {
  248. ssaValue *vector;
  249. ssaValue *elem;
  250. ssaValue *index;
  251. } InsertElement;
  252. struct {
  253. ssaValue *vector;
  254. i32 *indices;
  255. isize index_count;
  256. Type *type;
  257. } ShuffleVector;
  258. struct {} StartupRuntime;
  259. };
  260. };
  261. enum ssaValueKind {
  262. ssaValue_Invalid,
  263. ssaValue_Constant,
  264. ssaValue_ConstantSlice,
  265. ssaValue_Nil,
  266. ssaValue_TypeName,
  267. ssaValue_Global,
  268. ssaValue_Param,
  269. ssaValue_Proc,
  270. ssaValue_Block,
  271. ssaValue_Instr,
  272. ssaValue_Count,
  273. };
  274. struct ssaValue {
  275. ssaValueKind kind;
  276. i32 id;
  277. union {
  278. struct {
  279. Type * type;
  280. ExactValue value;
  281. } Constant;
  282. struct {
  283. Type *type;
  284. ssaValue *backing_array;
  285. i64 count;
  286. } ConstantSlice;
  287. struct {
  288. Type *type;
  289. } Nil;
  290. struct {
  291. String name;
  292. Type * type;
  293. } TypeName;
  294. struct {
  295. b32 is_constant;
  296. b32 is_private;
  297. b32 is_thread_local;
  298. Entity * entity;
  299. Type * type;
  300. ssaValue *value;
  301. } Global;
  302. struct {
  303. ssaProcedure *parent;
  304. Entity *entity;
  305. Type * type;
  306. } Param;
  307. ssaProcedure Proc;
  308. ssaBlock Block;
  309. ssaInstr Instr;
  310. };
  311. };
  312. gb_global ssaValue *v_zero = NULL;
  313. gb_global ssaValue *v_one = NULL;
  314. gb_global ssaValue *v_zero32 = NULL;
  315. gb_global ssaValue *v_one32 = NULL;
  316. gb_global ssaValue *v_two32 = NULL;
  317. gb_global ssaValue *v_false = NULL;
  318. gb_global ssaValue *v_true = NULL;
  319. struct ssaAddr {
  320. ssaValue *addr;
  321. AstNode *expr; // NOTE(bill): Just for testing - probably remove later
  322. b32 is_vector;
  323. ssaValue *index;
  324. };
  325. ssaAddr ssa_make_addr(ssaValue *addr, AstNode *expr) {
  326. ssaAddr v = {addr, expr, false, NULL};
  327. return v;
  328. }
  329. ssaAddr ssa_make_addr_vector(ssaValue *addr, ssaValue *index, AstNode *expr) {
  330. ssaAddr v = {addr, expr, true, index};
  331. return v;
  332. }
  333. ssaValue *ssa_make_value_global(gbAllocator a, Entity *e, ssaValue *value);
  334. void ssa_module_add_value(ssaModule *m, Entity *e, ssaValue *v) {
  335. map_set(&m->values, hash_pointer(e), v);
  336. }
  337. ssaDebugInfo *ssa_alloc_debug_info(gbAllocator a, ssaDebugInfoKind kind) {
  338. ssaDebugInfo *di = gb_alloc_item(a, ssaDebugInfo);
  339. di->kind = kind;
  340. return di;
  341. }
  342. ssaDefer ssa_add_defer_node(ssaProcedure *proc, isize scope_index, AstNode *stmt) {
  343. ssaDefer d = {ssaDefer_Node};
  344. d.scope_index = scope_index;
  345. d.block = proc->curr_block;
  346. d.stmt = stmt;
  347. gb_array_append(proc->defer_stmts, d);
  348. return d;
  349. }
  350. ssaDefer ssa_add_defer_instr(ssaProcedure *proc, isize scope_index, ssaValue *instr) {
  351. ssaDefer d = {ssaDefer_Instr};
  352. d.scope_index = proc->scope_index;
  353. d.block = proc->curr_block;
  354. d.instr = instr; // NOTE(bill): It will make a copy everytime it is called
  355. gb_array_append(proc->defer_stmts, d);
  356. return d;
  357. }
  358. void ssa_init_module(ssaModule *m, Checker *c) {
  359. // TODO(bill): Determine a decent size for the arena
  360. isize token_count = c->parser->total_token_count;
  361. isize arena_size = 4 * token_count * gb_size_of(ssaValue);
  362. gb_arena_init_from_allocator(&m->arena, gb_heap_allocator(), arena_size);
  363. gb_arena_init_from_allocator(&m->tmp_arena, gb_heap_allocator(), arena_size);
  364. m->allocator = gb_arena_allocator(&m->arena);
  365. m->tmp_allocator = gb_arena_allocator(&m->tmp_arena);
  366. m->info = &c->info;
  367. m->sizes = c->sizes;
  368. map_init(&m->values, gb_heap_allocator());
  369. map_init(&m->members, gb_heap_allocator());
  370. map_init(&m->debug_info, gb_heap_allocator());
  371. map_init(&m->type_names, gb_heap_allocator());
  372. gb_array_init(m->procs, gb_heap_allocator());
  373. // Default states
  374. m->stmt_state_flags = 0;
  375. m->stmt_state_flags |= StmtStateFlag_bounds_check;
  376. {
  377. // Add type info data
  378. {
  379. String name = make_string(SSA_TYPE_INFO_DATA_NAME);
  380. isize count = gb_array_count(c->info.type_info_map.entries);
  381. Entity *e = make_entity_variable(m->allocator, NULL, make_token_ident(name), make_type_array(m->allocator, t_type_info, count));
  382. ssaValue *g = ssa_make_value_global(m->allocator, e, NULL);
  383. g->Global.is_private = true;
  384. ssa_module_add_value(m, e, g);
  385. map_set(&m->members, hash_string(name), g);
  386. }
  387. // Type info member buffer
  388. {
  389. // NOTE(bill): Removes need for heap allocation by making it global memory
  390. isize count = 0;
  391. gb_for_array(entry_index, m->info->type_info_map.entries) {
  392. auto *entry = &m->info->type_info_map.entries[entry_index];
  393. Type *t = cast(Type *)cast(uintptr)entry->key.key;
  394. switch (t->kind) {
  395. case Type_Record:
  396. switch (t->Record.kind) {
  397. case TypeRecord_Struct:
  398. case TypeRecord_RawUnion:
  399. count += t->Record.field_count;
  400. }
  401. break;
  402. case Type_Tuple:
  403. count += t->Tuple.variable_count;
  404. break;
  405. }
  406. }
  407. String name = make_string(SSA_TYPE_INFO_DATA_MEMBER_NAME);
  408. Entity *e = make_entity_variable(m->allocator, NULL, make_token_ident(name),
  409. make_type_array(m->allocator, t_type_info_member, count));
  410. ssaValue *g = ssa_make_value_global(m->allocator, e, NULL);
  411. ssa_module_add_value(m, e, g);
  412. map_set(&m->members, hash_string(name), g);
  413. }
  414. }
  415. {
  416. ssaDebugInfo *di = ssa_alloc_debug_info(m->allocator, ssaDebugInfo_CompileUnit);
  417. di->CompileUnit.file = m->info->files.entries[0].value; // Zeroth is the init file
  418. di->CompileUnit.producer = make_string("odin");
  419. map_set(&m->debug_info, hash_pointer(m), di);
  420. }
  421. }
  422. void ssa_destroy_module(ssaModule *m) {
  423. map_destroy(&m->values);
  424. map_destroy(&m->members);
  425. map_destroy(&m->type_names);
  426. map_destroy(&m->debug_info);
  427. gb_array_free(m->procs);
  428. gb_arena_free(&m->arena);
  429. }
  430. Type *ssa_type(ssaValue *value);
  431. Type *ssa_type(ssaInstr *instr) {
  432. switch (instr->kind) {
  433. case ssaInstr_Local:
  434. return instr->Local.type;
  435. case ssaInstr_Store:
  436. return ssa_type(instr->Store.value);
  437. case ssaInstr_Load:
  438. return instr->Load.type;
  439. case ssaInstr_GetElementPtr:
  440. return instr->GetElementPtr.result_type;
  441. case ssaInstr_ExtractValue:
  442. return instr->ExtractValue.result_type;
  443. case ssaInstr_InsertValue:
  444. return ssa_type(instr->InsertValue.value);
  445. case ssaInstr_BinaryOp:
  446. return instr->BinaryOp.type;
  447. case ssaInstr_Conv:
  448. return instr->Conv.to;
  449. case ssaInstr_Select:
  450. return ssa_type(instr->Select.true_value);
  451. case ssaInstr_Call: {
  452. Type *pt = base_type(instr->Call.type);
  453. if (pt != NULL) {
  454. if (pt->kind == Type_Tuple && pt->Tuple.variable_count == 1)
  455. return pt->Tuple.variables[0]->type;
  456. return pt;
  457. }
  458. return NULL;
  459. } break;
  460. case ssaInstr_ExtractElement: {
  461. Type *vt = ssa_type(instr->ExtractElement.vector);
  462. Type *bt = base_vector_type(vt);
  463. GB_ASSERT(!is_type_vector(bt));
  464. return bt;
  465. } break;
  466. case ssaInstr_InsertElement:
  467. return ssa_type(instr->InsertElement.vector);
  468. case ssaInstr_ShuffleVector:
  469. return instr->ShuffleVector.type;
  470. }
  471. return NULL;
  472. }
  473. Type *ssa_type(ssaValue *value) {
  474. switch (value->kind) {
  475. case ssaValue_Constant:
  476. return value->Constant.type;
  477. case ssaValue_ConstantSlice:
  478. return value->ConstantSlice.type;
  479. case ssaValue_Nil:
  480. return value->Nil.type;
  481. case ssaValue_TypeName:
  482. return value->TypeName.type;
  483. case ssaValue_Global:
  484. return value->Global.type;
  485. case ssaValue_Param:
  486. return value->Param.type;
  487. case ssaValue_Proc:
  488. return value->Proc.type;
  489. case ssaValue_Instr:
  490. return ssa_type(&value->Instr);
  491. }
  492. return NULL;
  493. }
  494. ssaDebugInfo *ssa_add_debug_info_file(ssaProcedure *proc, AstFile *file) {
  495. GB_ASSERT(file != NULL);
  496. ssaDebugInfo *di = ssa_alloc_debug_info(proc->module->allocator, ssaDebugInfo_File);
  497. di->File.file = file;
  498. String filename = file->tokenizer.fullpath;
  499. String directory = filename;
  500. isize slash_index = 0;
  501. for (isize i = filename.len-1; i >= 0; i--) {
  502. if (filename.text[i] == '\\' ||
  503. filename.text[i] == '/') {
  504. break;
  505. }
  506. slash_index = i;
  507. }
  508. directory.len = slash_index-1;
  509. filename.text = filename.text + slash_index;
  510. filename.len -= slash_index;
  511. di->File.filename = filename;
  512. di->File.directory = directory;
  513. map_set(&proc->module->debug_info, hash_pointer(file), di);
  514. return di;
  515. }
  516. ssaDebugInfo *ssa_add_debug_info_proc(ssaProcedure *proc, Entity *entity, String name, ssaDebugInfo *file) {
  517. GB_ASSERT(entity != NULL);
  518. ssaDebugInfo *di = ssa_alloc_debug_info(proc->module->allocator, ssaDebugInfo_Proc);
  519. di->Proc.entity = entity;
  520. di->Proc.name = name;
  521. di->Proc.file = file;
  522. di->Proc.pos = entity->token.pos;
  523. map_set(&proc->module->debug_info, hash_pointer(entity), di);
  524. return di;
  525. }
  526. ssaValue *ssa_build_expr(ssaProcedure *proc, AstNode *expr);
  527. ssaValue *ssa_build_single_expr(ssaProcedure *proc, AstNode *expr, TypeAndValue *tv);
  528. ssaAddr ssa_build_addr(ssaProcedure *proc, AstNode *expr);
  529. ssaValue *ssa_emit_conv(ssaProcedure *proc, ssaValue *value, Type *a_type, b32 is_argument = false);
  530. ssaValue *ssa_emit_transmute(ssaProcedure *proc, ssaValue *value, Type *a_type);
  531. void ssa_build_proc(ssaValue *value, ssaProcedure *parent);
  532. ssaValue *ssa_alloc_value(gbAllocator a, ssaValueKind kind) {
  533. ssaValue *v = gb_alloc_item(a, ssaValue);
  534. v->kind = kind;
  535. return v;
  536. }
  537. ssaValue *ssa_alloc_instr(ssaProcedure *proc, ssaInstrKind kind) {
  538. ssaValue *v = ssa_alloc_value(proc->module->allocator, ssaValue_Instr);
  539. v->Instr.kind = kind;
  540. if (proc->curr_block) {
  541. gb_array_append(proc->curr_block->values, v);
  542. }
  543. return v;
  544. }
  545. ssaValue *ssa_make_value_type_name(gbAllocator a, String name, Type *type) {
  546. ssaValue *v = ssa_alloc_value(a, ssaValue_TypeName);
  547. v->TypeName.name = name;
  548. v->TypeName.type = type;
  549. return v;
  550. }
  551. ssaValue *ssa_make_value_global(gbAllocator a, Entity *e, ssaValue *value) {
  552. ssaValue *v = ssa_alloc_value(a, ssaValue_Global);
  553. v->Global.entity = e;
  554. v->Global.type = make_type_pointer(a, e->type);
  555. v->Global.value = value;
  556. return v;
  557. }
  558. ssaValue *ssa_make_value_param(gbAllocator a, ssaProcedure *parent, Entity *e) {
  559. ssaValue *v = ssa_alloc_value(a, ssaValue_Param);
  560. v->Param.parent = parent;
  561. v->Param.entity = e;
  562. v->Param.type = e->type;
  563. return v;
  564. }
  565. ssaValue *ssa_make_value_nil(gbAllocator a, Type *type) {
  566. ssaValue *v = ssa_alloc_value(a, ssaValue_Nil);
  567. v->Nil.type = type;
  568. return v;
  569. }
  570. ssaValue *ssa_make_instr_local(ssaProcedure *p, Entity *e, b32 zero_initialized) {
  571. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Local);
  572. ssaInstr *i = &v->Instr;
  573. i->Local.entity = e;
  574. i->Local.type = make_type_pointer(p->module->allocator, e->type);
  575. i->Local.zero_initialized = zero_initialized;
  576. ssa_module_add_value(p->module, e, v);
  577. return v;
  578. }
  579. ssaValue *ssa_make_instr_store(ssaProcedure *p, ssaValue *address, ssaValue *value) {
  580. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Store);
  581. ssaInstr *i = &v->Instr;
  582. i->Store.address = address;
  583. i->Store.value = value;
  584. return v;
  585. }
  586. ssaValue *ssa_make_instr_zero_init(ssaProcedure *p, ssaValue *address) {
  587. ssaValue *v = ssa_alloc_instr(p, ssaInstr_ZeroInit);
  588. ssaInstr *i = &v->Instr;
  589. i->ZeroInit.address = address;
  590. return v;
  591. }
  592. ssaValue *ssa_make_instr_load(ssaProcedure *p, ssaValue *address) {
  593. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Load);
  594. ssaInstr *i = &v->Instr;
  595. i->Load.address = address;
  596. i->Load.type = type_deref(ssa_type(address));
  597. return v;
  598. }
  599. ssaValue *ssa_make_instr_get_element_ptr(ssaProcedure *p, ssaValue *address,
  600. ssaValue *index0, ssaValue *index1, isize index_count,
  601. b32 inbounds) {
  602. ssaValue *v = ssa_alloc_instr(p, ssaInstr_GetElementPtr);
  603. ssaInstr *i = &v->Instr;
  604. i->GetElementPtr.address = address;
  605. i->GetElementPtr.indices[0] = index0;
  606. i->GetElementPtr.indices[1] = index1;
  607. i->GetElementPtr.index_count = index_count;
  608. i->GetElementPtr.elem_type = ssa_type(address);
  609. i->GetElementPtr.inbounds = inbounds;
  610. GB_ASSERT_MSG(is_type_pointer(ssa_type(address)),
  611. "%s", type_to_string(ssa_type(address)));
  612. return v;
  613. }
  614. ssaValue *ssa_make_instr_extract_value(ssaProcedure *p, ssaValue *address, i32 index, Type *result_type) {
  615. ssaValue *v = ssa_alloc_instr(p, ssaInstr_ExtractValue);
  616. ssaInstr *i = &v->Instr;
  617. i->ExtractValue.address = address;
  618. i->ExtractValue.index = index;
  619. i->ExtractValue.result_type = result_type;
  620. Type *et = ssa_type(address);
  621. i->ExtractValue.elem_type = et;
  622. // GB_ASSERT(et->kind == Type_Struct || et->kind == Type_Array || et->kind == Type_Tuple);
  623. return v;
  624. }
  625. ssaValue *ssa_make_instr_insert_value(ssaProcedure *p, ssaValue *value, ssaValue *elem, ssaValue *index) {
  626. Type *t = ssa_type(value);
  627. GB_ASSERT(is_type_array(t) || is_type_struct(t));
  628. ssaValue *v = ssa_alloc_instr(p, ssaInstr_InsertValue);
  629. v->Instr.InsertValue.value = value;
  630. v->Instr.InsertValue.elem = elem;
  631. v->Instr.InsertValue.index = index;
  632. return v;
  633. }
  634. ssaValue *ssa_make_instr_binary_op(ssaProcedure *p, Token op, ssaValue *left, ssaValue *right, Type *type) {
  635. ssaValue *v = ssa_alloc_instr(p, ssaInstr_BinaryOp);
  636. ssaInstr *i = &v->Instr;
  637. i->BinaryOp.op = op;
  638. i->BinaryOp.left = left;
  639. i->BinaryOp.right = right;
  640. i->BinaryOp.type = type;
  641. return v;
  642. }
  643. ssaValue *ssa_make_instr_br(ssaProcedure *p, ssaValue *cond, ssaBlock *true_block, ssaBlock *false_block) {
  644. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Br);
  645. ssaInstr *i = &v->Instr;
  646. i->Br.cond = cond;
  647. i->Br.true_block = true_block;
  648. i->Br.false_block = false_block;
  649. return v;
  650. }
  651. ssaValue *ssa_make_instr_unreachable(ssaProcedure *p) {
  652. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Unreachable);
  653. return v;
  654. }
  655. ssaValue *ssa_make_instr_ret(ssaProcedure *p, ssaValue *value) {
  656. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Ret);
  657. v->Instr.Ret.value = value;
  658. return v;
  659. }
  660. ssaValue *ssa_make_instr_select(ssaProcedure *p, ssaValue *cond, ssaValue *t, ssaValue *f) {
  661. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Select);
  662. v->Instr.Select.cond = cond;
  663. v->Instr.Select.true_value = t;
  664. v->Instr.Select.false_value = f;
  665. return v;
  666. }
  667. ssaValue *ssa_make_instr_call(ssaProcedure *p, ssaValue *value, ssaValue **args, isize arg_count, Type *result_type) {
  668. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Call);
  669. v->Instr.Call.value = value;
  670. v->Instr.Call.args = args;
  671. v->Instr.Call.arg_count = arg_count;
  672. v->Instr.Call.type = result_type;
  673. return v;
  674. }
  675. ssaValue *ssa_make_instr_conv(ssaProcedure *p, ssaConvKind kind, ssaValue *value, Type *from, Type *to) {
  676. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Conv);
  677. v->Instr.Conv.kind = kind;
  678. v->Instr.Conv.value = value;
  679. v->Instr.Conv.from = from;
  680. v->Instr.Conv.to = to;
  681. return v;
  682. }
  683. ssaValue *ssa_make_instr_extract_element(ssaProcedure *p, ssaValue *vector, ssaValue *index) {
  684. ssaValue *v = ssa_alloc_instr(p, ssaInstr_ExtractElement);
  685. v->Instr.ExtractElement.vector = vector;
  686. v->Instr.ExtractElement.index = index;
  687. return v;
  688. }
  689. ssaValue *ssa_make_instr_insert_element(ssaProcedure *p, ssaValue *vector, ssaValue *elem, ssaValue *index) {
  690. ssaValue *v = ssa_alloc_instr(p, ssaInstr_InsertElement);
  691. v->Instr.InsertElement.vector = vector;
  692. v->Instr.InsertElement.elem = elem;
  693. v->Instr.InsertElement.index = index;
  694. return v;
  695. }
  696. ssaValue *ssa_make_instr_shuffle_vector(ssaProcedure *p, ssaValue *vector, i32 *indices, isize index_count) {
  697. ssaValue *v = ssa_alloc_instr(p, ssaInstr_ShuffleVector);
  698. v->Instr.ShuffleVector.vector = vector;
  699. v->Instr.ShuffleVector.indices = indices;
  700. v->Instr.ShuffleVector.index_count = index_count;
  701. Type *vt = base_type(ssa_type(vector));
  702. v->Instr.ShuffleVector.type = make_type_vector(p->module->allocator, vt->Vector.elem, index_count);
  703. return v;
  704. }
  705. ssaValue *ssa_make_instr_no_op(ssaProcedure *p) {
  706. ssaValue *v = ssa_alloc_instr(p, ssaInstr_NoOp);
  707. return v;
  708. }
  709. ssaValue *ssa_make_instr_comment(ssaProcedure *p, String text) {
  710. ssaValue *v = ssa_alloc_instr(p, ssaInstr_Comment);
  711. v->Instr.Comment.text = text;
  712. return v;
  713. }
  714. ssaValue *ssa_make_value_constant(gbAllocator a, Type *type, ExactValue value) {
  715. ssaValue *v = ssa_alloc_value(a, ssaValue_Constant);
  716. v->Constant.type = type;
  717. v->Constant.value = value;
  718. return v;
  719. }
  720. ssaValue *ssa_make_value_constant_slice(gbAllocator a, Type *type, ssaValue *backing_array, i64 count) {
  721. ssaValue *v = ssa_alloc_value(a, ssaValue_ConstantSlice);
  722. v->ConstantSlice.type = type;
  723. v->ConstantSlice.backing_array = backing_array;
  724. v->ConstantSlice.count = count;
  725. return v;
  726. }
  727. ssaValue *ssa_make_const_int(gbAllocator a, i64 i) {
  728. return ssa_make_value_constant(a, t_int, make_exact_value_integer(i));
  729. }
  730. ssaValue *ssa_make_const_i32(gbAllocator a, i64 i) {
  731. return ssa_make_value_constant(a, t_i32, make_exact_value_integer(i));
  732. }
  733. ssaValue *ssa_make_const_i64(gbAllocator a, i64 i) {
  734. return ssa_make_value_constant(a, t_i64, make_exact_value_integer(i));
  735. }
  736. ssaValue *ssa_make_const_bool(gbAllocator a, b32 b) {
  737. return ssa_make_value_constant(a, t_bool, make_exact_value_bool(b != 0));
  738. }
  739. ssaValue *ssa_add_module_constant(ssaModule *m, Type *type, ExactValue value) {
  740. if (is_type_slice(type)) {
  741. ast_node(cl, CompoundLit, value.value_compound);
  742. gbAllocator a = m->allocator;
  743. isize count = 0;
  744. if (cl->elems) {
  745. count = gb_array_count(cl->elems);
  746. }
  747. if (count > 0) {
  748. Type *elem = base_type(type)->Slice.elem;
  749. Type *t = make_type_array(a, elem, count);
  750. ssaValue *backing_array = ssa_add_module_constant(m, t, value);
  751. isize max_len = 7+8+1;
  752. u8 *str = cast(u8 *)gb_alloc_array(a, u8, max_len);
  753. isize len = gb_snprintf(cast(char *)str, max_len, "__csba$%x", m->global_array_index);
  754. m->global_array_index++;
  755. String name = make_string(str, len-1);
  756. Entity *e = make_entity_constant(a, NULL, make_token_ident(name), t, value);
  757. ssaValue *g = ssa_make_value_global(a, e, backing_array);
  758. ssa_module_add_value(m, e, g);
  759. map_set(&m->members, hash_string(name), g);
  760. return ssa_make_value_constant_slice(a, type, g, count);
  761. } else {
  762. return ssa_make_value_constant_slice(a, type, NULL, 0);
  763. }
  764. }
  765. return ssa_make_value_constant(m->allocator, type, value);
  766. }
  767. ssaValue *ssa_make_value_procedure(gbAllocator a, ssaModule *m, Entity *entity, Type *type, AstNode *type_expr, AstNode *body, String name) {
  768. ssaValue *v = ssa_alloc_value(a, ssaValue_Proc);
  769. v->Proc.module = m;
  770. v->Proc.entity = entity;
  771. v->Proc.type = type;
  772. v->Proc.type_expr = type_expr;
  773. v->Proc.body = body;
  774. v->Proc.name = name;
  775. return v;
  776. }
  777. ssaValue *ssa_make_value_block(ssaProcedure *proc, AstNode *node, Scope *scope, String label) {
  778. ssaValue *v = ssa_alloc_value(proc->module->allocator, ssaValue_Block);
  779. v->Block.label = label;
  780. v->Block.node = node;
  781. v->Block.scope = scope;
  782. v->Block.parent = proc;
  783. gb_array_init(v->Block.instrs, gb_heap_allocator());
  784. gb_array_init(v->Block.values, gb_heap_allocator());
  785. return v;
  786. }
  787. b32 ssa_is_blank_ident(AstNode *node) {
  788. if (node->kind == AstNode_Ident) {
  789. ast_node(i, Ident, node);
  790. return is_blank_ident(i->string);
  791. }
  792. return false;
  793. }
  794. ssaInstr *ssa_get_last_instr(ssaBlock *block) {
  795. if (block != NULL) {
  796. isize len = 0;
  797. if (block->instrs != NULL) {
  798. len = gb_array_count(block->instrs);
  799. }
  800. if (len > 0) {
  801. ssaValue *v = block->instrs[len-1];
  802. GB_ASSERT(v->kind == ssaValue_Instr);
  803. return &v->Instr;
  804. }
  805. }
  806. return NULL;
  807. }
  808. b32 ssa_is_instr_terminating(ssaInstr *i) {
  809. if (i != NULL) {
  810. switch (i->kind) {
  811. case ssaInstr_Ret:
  812. case ssaInstr_Unreachable:
  813. return true;
  814. }
  815. }
  816. return false;
  817. }
  818. ssaValue *ssa_emit(ssaProcedure *proc, ssaValue *instr) {
  819. GB_ASSERT(instr->kind == ssaValue_Instr);
  820. ssaBlock *b = proc->curr_block;
  821. instr->Instr.parent = b;
  822. if (b != NULL) {
  823. ssaInstr *i = ssa_get_last_instr(b);
  824. if (!ssa_is_instr_terminating(i)) {
  825. gb_array_append(b->instrs, instr);
  826. }
  827. }
  828. return instr;
  829. }
  830. ssaValue *ssa_emit_store(ssaProcedure *p, ssaValue *address, ssaValue *value) {
  831. return ssa_emit(p, ssa_make_instr_store(p, address, value));
  832. }
  833. ssaValue *ssa_emit_load(ssaProcedure *p, ssaValue *address) {
  834. return ssa_emit(p, ssa_make_instr_load(p, address));
  835. }
  836. ssaValue *ssa_emit_select(ssaProcedure *p, ssaValue *cond, ssaValue *t, ssaValue *f) {
  837. return ssa_emit(p, ssa_make_instr_select(p, cond, t, f));
  838. }
  839. ssaValue *ssa_emit_zero_init(ssaProcedure *p, ssaValue *address) {
  840. return ssa_emit(p, ssa_make_instr_zero_init(p, address));
  841. }
  842. ssaValue *ssa_emit_comment(ssaProcedure *p, String text) {
  843. return ssa_emit(p, ssa_make_instr_comment(p, text));
  844. }
  845. ssaValue *ssa_add_local(ssaProcedure *proc, Entity *e, b32 zero_initialized = true) {
  846. ssaBlock *b = proc->decl_block; // all variables must be in the first block
  847. ssaValue *instr = ssa_make_instr_local(proc, e, zero_initialized);
  848. instr->Instr.parent = b;
  849. gb_array_append(b->instrs, instr);
  850. // if (zero_initialized) {
  851. ssa_emit_zero_init(proc, instr);
  852. // }
  853. return instr;
  854. }
  855. ssaValue *ssa_add_local_for_identifier(ssaProcedure *proc, AstNode *name, b32 zero_initialized) {
  856. Entity **found = map_get(&proc->module->info->definitions, hash_pointer(name));
  857. if (found) {
  858. Entity *e = *found;
  859. ssa_emit_comment(proc, e->token.string);
  860. return ssa_add_local(proc, e, zero_initialized);
  861. }
  862. return NULL;
  863. }
  864. ssaValue *ssa_add_local_generated(ssaProcedure *proc, Type *type) {
  865. GB_ASSERT(type != NULL);
  866. Scope *scope = NULL;
  867. if (proc->curr_block) {
  868. scope = proc->curr_block->scope;
  869. }
  870. Entity *e = make_entity_variable(proc->module->allocator,
  871. scope,
  872. empty_token,
  873. type);
  874. return ssa_add_local(proc, e, true);
  875. }
  876. ssaValue *ssa_add_param(ssaProcedure *proc, Entity *e) {
  877. ssaValue *v = ssa_make_value_param(proc->module->allocator, proc, e);
  878. ssaValue *l = ssa_add_local(proc, e);
  879. ssa_emit_store(proc, l, v);
  880. return v;
  881. }
  882. ssaValue *ssa_emit_call(ssaProcedure *p, ssaValue *value, ssaValue **args, isize arg_count) {
  883. Type *pt = base_type(ssa_type(value));
  884. GB_ASSERT(pt->kind == Type_Proc);
  885. Type *results = pt->Proc.results;
  886. return ssa_emit(p, ssa_make_instr_call(p, value, args, arg_count, results));
  887. }
  888. ssaValue *ssa_emit_global_call(ssaProcedure *proc, char *name_, ssaValue **args, isize arg_count) {
  889. String name = make_string(name_);
  890. ssaValue **found = map_get(&proc->module->members, hash_string(name));
  891. GB_ASSERT_MSG(found != NULL, "%.*s", LIT(name));
  892. ssaValue *gp = *found;
  893. return ssa_emit_call(proc, gp, args, arg_count);
  894. }
  895. Type *ssa_addr_type(ssaAddr lval) {
  896. if (lval.addr != NULL) {
  897. Type *t = ssa_type(lval.addr);
  898. GB_ASSERT(is_type_pointer(t));
  899. return type_deref(t);
  900. }
  901. return NULL;
  902. }
  903. ssaBlock *ssa__make_block(ssaProcedure *proc, AstNode *node, String label) {
  904. Scope *scope = NULL;
  905. if (node != NULL) {
  906. Scope **found = map_get(&proc->module->info->scopes, hash_pointer(node));
  907. if (found) {
  908. scope = *found;
  909. } else {
  910. GB_PANIC("Block scope not found for %.*s", LIT(ast_node_strings[node->kind]));
  911. }
  912. }
  913. ssaValue *block = ssa_make_value_block(proc, node, scope, label);
  914. return &block->Block;
  915. }
  916. ssaBlock *ssa_add_block(ssaProcedure *proc, AstNode *node, String label) {
  917. ssaBlock *block = ssa__make_block(proc, node, label);
  918. gb_array_append(proc->blocks, block);
  919. return block;
  920. }
  921. void ssa_build_stmt(ssaProcedure *proc, AstNode *s);
  922. void ssa_emit_no_op(ssaProcedure *proc);
  923. void ssa_emit_jump(ssaProcedure *proc, ssaBlock *block);
  924. void ssa_build_defer_stmt(ssaProcedure *proc, ssaDefer d) {
  925. ssaBlock *b = ssa__make_block(proc, NULL, make_string("defer"));
  926. // NOTE(bill): The prev block may defer injection before it's terminator
  927. ssaInstr *last_instr = ssa_get_last_instr(proc->curr_block);
  928. if (last_instr == NULL || !ssa_is_instr_terminating(last_instr)) {
  929. ssa_emit_jump(proc, b);
  930. }
  931. gb_array_append(proc->blocks, b);
  932. proc->curr_block = b;
  933. ssa_emit_comment(proc, make_string("defer"));
  934. if (d.kind == ssaDefer_Node) {
  935. ssa_build_stmt(proc, d.stmt);
  936. } else if (d.kind == ssaDefer_Instr) {
  937. // NOTE(bill): Need to make a new copy
  938. ssaValue *instr = cast(ssaValue *)gb_alloc_copy(proc->module->allocator, d.instr, gb_size_of(ssaValue));
  939. ssa_emit(proc, instr);
  940. }
  941. }
  942. void ssa_emit_defer_stmts(ssaProcedure *proc, ssaDeferExitKind kind, ssaBlock *block) {
  943. isize count = gb_array_count(proc->defer_stmts);
  944. isize i = count;
  945. while (i --> 0) {
  946. ssaDefer d = proc->defer_stmts[i];
  947. if (kind == ssaDeferExit_Default) {
  948. if (proc->scope_index == d.scope_index &&
  949. d.scope_index > 1) {
  950. ssa_build_defer_stmt(proc, d);
  951. gb_array_pop(proc->defer_stmts);
  952. continue;
  953. } else {
  954. break;
  955. }
  956. } else if (kind == ssaDeferExit_Return) {
  957. ssa_build_defer_stmt(proc, d);
  958. } else if (kind == ssaDeferExit_Branch) {
  959. GB_ASSERT(block != NULL);
  960. isize lower_limit = block->scope_index+1;
  961. if (lower_limit < d.scope_index) {
  962. ssa_build_defer_stmt(proc, d);
  963. }
  964. }
  965. }
  966. }
  967. void ssa_open_scope(ssaProcedure *proc) {
  968. proc->scope_index++;
  969. }
  970. void ssa_close_scope(ssaProcedure *proc, ssaDeferExitKind kind, ssaBlock *block) {
  971. ssa_emit_defer_stmts(proc, kind, block);
  972. GB_ASSERT(proc->scope_index > 0);
  973. proc->scope_index--;
  974. }
  975. void ssa_emit_unreachable(ssaProcedure *proc) {
  976. ssa_emit(proc, ssa_make_instr_unreachable(proc));
  977. }
  978. void ssa_emit_ret(ssaProcedure *proc, ssaValue *v) {
  979. ssa_emit_defer_stmts(proc, ssaDeferExit_Return, NULL);
  980. ssa_emit(proc, ssa_make_instr_ret(proc, v));
  981. }
  982. void ssa_emit_jump(ssaProcedure *proc, ssaBlock *block) {
  983. ssa_emit(proc, ssa_make_instr_br(proc, NULL, block, NULL));
  984. proc->curr_block = NULL;
  985. }
  986. void ssa_emit_if(ssaProcedure *proc, ssaValue *cond, ssaBlock *true_block, ssaBlock *false_block) {
  987. ssaValue *br = ssa_make_instr_br(proc, cond, true_block, false_block);
  988. ssa_emit(proc, br);
  989. proc->curr_block = NULL;
  990. }
  991. void ssa_emit_no_op(ssaProcedure *proc) {
  992. ssa_emit(proc, ssa_make_instr_no_op(proc));
  993. }
  994. ssaValue *ssa_lvalue_store(ssaProcedure *proc, ssaAddr lval, ssaValue *value) {
  995. if (lval.addr != NULL) {
  996. if (lval.is_vector) {
  997. ssaValue *v = ssa_emit_load(proc, lval.addr);
  998. Type *elem_type = base_type(ssa_type(v))->Vector.elem;
  999. ssaValue *elem = ssa_emit_conv(proc, value, elem_type);
  1000. ssaValue *out = ssa_emit(proc, ssa_make_instr_insert_element(proc, v, elem, lval.index));
  1001. return ssa_emit_store(proc, lval.addr, out);
  1002. } else {
  1003. ssaValue *v = ssa_emit_conv(proc, value, ssa_addr_type(lval));
  1004. return ssa_emit_store(proc, lval.addr, v);
  1005. }
  1006. }
  1007. return NULL;
  1008. }
  1009. ssaValue *ssa_lvalue_load(ssaProcedure *proc, ssaAddr lval) {
  1010. if (lval.addr != NULL) {
  1011. if (lval.is_vector) {
  1012. ssaValue *v = ssa_emit_load(proc, lval.addr);
  1013. return ssa_emit(proc, ssa_make_instr_extract_element(proc, v, lval.index));
  1014. }
  1015. // NOTE(bill): Imported procedures don't require a load as they are pointers
  1016. Type *t = base_type(ssa_type(lval.addr));
  1017. if (t->kind == Type_Proc) {
  1018. return lval.addr;
  1019. }
  1020. return ssa_emit_load(proc, lval.addr);
  1021. }
  1022. GB_PANIC("Illegal lvalue load");
  1023. return NULL;
  1024. }
  1025. void ssa_begin_procedure_body(ssaProcedure *proc) {
  1026. gb_array_init(proc->blocks, gb_heap_allocator());
  1027. gb_array_init(proc->defer_stmts, gb_heap_allocator());
  1028. gb_array_init(proc->children, gb_heap_allocator());
  1029. proc->decl_block = ssa_add_block(proc, proc->type_expr, make_string("decls"));
  1030. proc->entry_block = ssa_add_block(proc, proc->type_expr, make_string("entry"));
  1031. proc->curr_block = proc->entry_block;
  1032. if (proc->type->Proc.params != NULL) {
  1033. auto *params = &proc->type->Proc.params->Tuple;
  1034. for (isize i = 0; i < params->variable_count; i++) {
  1035. Entity *e = params->variables[i];
  1036. ssa_add_param(proc, e);
  1037. }
  1038. }
  1039. }
  1040. void ssa_end_procedure_body(ssaProcedure *proc) {
  1041. if (proc->type->Proc.result_count == 0) {
  1042. ssa_emit_ret(proc, NULL);
  1043. }
  1044. if (gb_array_count(proc->curr_block->instrs) == 0) {
  1045. ssa_emit_unreachable(proc);
  1046. }
  1047. proc->curr_block = proc->decl_block;
  1048. ssa_emit_jump(proc, proc->entry_block);
  1049. // Number blocks and registers
  1050. i32 reg_id = 0;
  1051. gb_for_array(i, proc->blocks) {
  1052. ssaBlock *b = proc->blocks[i];
  1053. b->id = i;
  1054. gb_for_array(j, b->instrs) {
  1055. ssaValue *value = b->instrs[j];
  1056. GB_ASSERT(value->kind == ssaValue_Instr);
  1057. ssaInstr *instr = &value->Instr;
  1058. // NOTE(bill): Ignore non-returning instructions
  1059. switch (instr->kind) {
  1060. case ssaInstr_Comment:
  1061. case ssaInstr_ZeroInit:
  1062. case ssaInstr_Store:
  1063. case ssaInstr_Br:
  1064. case ssaInstr_Ret:
  1065. case ssaInstr_Unreachable:
  1066. case ssaInstr_StartupRuntime:
  1067. continue;
  1068. case ssaInstr_Call:
  1069. if (instr->Call.type == NULL) {
  1070. continue;
  1071. }
  1072. break;
  1073. }
  1074. value->id = reg_id;
  1075. reg_id++;
  1076. }
  1077. }
  1078. }
  1079. void ssa_push_target_list(ssaProcedure *proc, ssaBlock *break_, ssaBlock *continue_, ssaBlock *fallthrough_) {
  1080. ssaTargetList *tl = gb_alloc_item(proc->module->allocator, ssaTargetList);
  1081. tl->prev = proc->target_list;
  1082. tl->break_ = break_;
  1083. tl->continue_ = continue_;
  1084. tl->fallthrough_ = fallthrough_;
  1085. proc->target_list = tl;
  1086. }
  1087. void ssa_pop_target_list(ssaProcedure *proc) {
  1088. proc->target_list = proc->target_list->prev;
  1089. }
  1090. ssaValue *ssa_emit_arith(ssaProcedure *proc, Token op, ssaValue *left, ssaValue *right, Type *type) {
  1091. switch (op.kind) {
  1092. case Token_AndNot: {
  1093. // NOTE(bill): x &~ y == x & (~y) == x & (y ~ -1)
  1094. // NOTE(bill): "not" `x` == `x` "xor" `-1`
  1095. ssaValue *neg = ssa_add_module_constant(proc->module, type, make_exact_value_integer(-1));
  1096. op.kind = Token_Xor;
  1097. right = ssa_emit_arith(proc, op, right, neg, type);
  1098. GB_ASSERT(right->Instr.kind == ssaInstr_BinaryOp);
  1099. right->Instr.BinaryOp.type = type;
  1100. op.kind = Token_And;
  1101. } /* fallthrough */
  1102. case Token_Add:
  1103. case Token_Sub:
  1104. case Token_Mul:
  1105. case Token_Quo:
  1106. case Token_Mod:
  1107. case Token_And:
  1108. case Token_Or:
  1109. case Token_Xor:
  1110. left = ssa_emit_conv(proc, left, type);
  1111. right = ssa_emit_conv(proc, right, type);
  1112. break;
  1113. }
  1114. return ssa_emit(proc, ssa_make_instr_binary_op(proc, op, left, right, type));
  1115. }
  1116. ssaValue *ssa_emit_comp(ssaProcedure *proc, Token op, ssaValue *left, ssaValue *right) {
  1117. Type *a = base_type(ssa_type(left));
  1118. Type *b = base_type(ssa_type(right));
  1119. if (are_types_identical(a, b)) {
  1120. // NOTE(bill): No need for a conversion
  1121. } else if (left->kind == ssaValue_Constant || left->kind == ssaValue_Nil) {
  1122. left = ssa_emit_conv(proc, left, ssa_type(right));
  1123. } else if (right->kind == ssaValue_Constant || right->kind == ssaValue_Nil) {
  1124. right = ssa_emit_conv(proc, right, ssa_type(left));
  1125. }
  1126. Type *result = t_bool;
  1127. if (is_type_vector(a)) {
  1128. result = make_type_vector(proc->module->allocator, t_bool, a->Vector.count);
  1129. }
  1130. return ssa_emit(proc, ssa_make_instr_binary_op(proc, op, left, right, result));
  1131. }
  1132. ssaValue *ssa_emit_ptr_offset(ssaProcedure *proc, ssaValue *ptr, ssaValue *offset) {
  1133. ssaValue *gep = NULL;
  1134. offset = ssa_emit_conv(proc, offset, t_int);
  1135. gep = ssa_make_instr_get_element_ptr(proc, ptr, offset, NULL, 1, false);
  1136. gep->Instr.GetElementPtr.result_type = ssa_type(ptr);
  1137. return ssa_emit(proc, gep);
  1138. }
  1139. ssaValue *ssa_emit_zero_gep(ssaProcedure *proc, ssaValue *s) {
  1140. ssaValue *gep = NULL;
  1141. // NOTE(bill): For some weird legacy reason in LLVM, structure elements must be accessed as an i32
  1142. gep = ssa_make_instr_get_element_ptr(proc, s, NULL, NULL, 0, true);
  1143. gep->Instr.GetElementPtr.result_type = ssa_type(s);
  1144. return ssa_emit(proc, gep);
  1145. }
  1146. ssaValue *ssa_emit_struct_gep(ssaProcedure *proc, ssaValue *s, ssaValue *index, Type *result_type) {
  1147. ssaValue *gep = NULL;
  1148. // NOTE(bill): For some weird legacy reason in LLVM, structure elements must be accessed as an i32
  1149. index = ssa_emit_conv(proc, index, t_i32);
  1150. gep = ssa_make_instr_get_element_ptr(proc, s, v_zero, index, 2, true);
  1151. gep->Instr.GetElementPtr.result_type = result_type;
  1152. return ssa_emit(proc, gep);
  1153. }
  1154. ssaValue *ssa_emit_struct_gep(ssaProcedure *proc, ssaValue *s, i32 index, Type *result_type) {
  1155. ssaValue *i = ssa_make_const_i32(proc->module->allocator, index);
  1156. return ssa_emit_struct_gep(proc, s, i, result_type);
  1157. }
  1158. ssaValue *ssa_emit_struct_ev(ssaProcedure *proc, ssaValue *s, i32 index, Type *result_type) {
  1159. // NOTE(bill): For some weird legacy reason in LLVM, structure elements must be accessed as an i32
  1160. return ssa_emit(proc, ssa_make_instr_extract_value(proc, s, index, result_type));
  1161. }
  1162. ssaValue *ssa_emit_deep_field_gep(ssaProcedure *proc, Type *type, ssaValue *e, Selection sel) {
  1163. GB_ASSERT(gb_array_count(sel.index) > 0);
  1164. gb_for_array(i, sel.index) {
  1165. isize index = sel.index[i];
  1166. if (is_type_pointer(type)) {
  1167. type = type_deref(type);
  1168. e = ssa_emit_load(proc, e);
  1169. e = ssa_emit_ptr_offset(proc, e, v_zero);
  1170. }
  1171. type = base_type(type);
  1172. if (is_type_raw_union(type)) {
  1173. type = type->Record.fields[index]->type;
  1174. e = ssa_emit_conv(proc, e, make_type_pointer(proc->module->allocator, type));
  1175. } else if (type->kind == Type_Record) {
  1176. type = type->Record.fields[index]->type;
  1177. e = ssa_emit_struct_gep(proc, e, index, make_type_pointer(proc->module->allocator, type));
  1178. } else if (type->kind == Type_Basic) {
  1179. switch (type->Basic.kind) {
  1180. case Basic_any: {
  1181. if (index == 0) {
  1182. type = t_type_info_ptr;
  1183. } else if (index == 1) {
  1184. type = t_rawptr;
  1185. }
  1186. e = ssa_emit_struct_gep(proc, e, index, make_type_pointer(proc->module->allocator, type));
  1187. } break;
  1188. case Basic_string:
  1189. e = ssa_emit_struct_gep(proc, e, index, make_type_pointer(proc->module->allocator, sel.entity->type));
  1190. break;
  1191. default:
  1192. GB_PANIC("un-gep-able type");
  1193. break;
  1194. }
  1195. } else if (type->kind == Type_Slice) {
  1196. e = ssa_emit_struct_gep(proc, e, index, make_type_pointer(proc->module->allocator, sel.entity->type));
  1197. } else {
  1198. GB_PANIC("un-gep-able type");
  1199. }
  1200. }
  1201. return e;
  1202. }
  1203. ssaValue *ssa_emit_deep_field_ev(ssaProcedure *proc, Type *type, ssaValue *e, Selection sel) {
  1204. GB_ASSERT(gb_array_count(sel.index) > 0);
  1205. gb_for_array(i, sel.index) {
  1206. isize index = sel.index[i];
  1207. if (is_type_pointer(type)) {
  1208. type = type_deref(type);
  1209. e = ssa_emit_load(proc, e);
  1210. e = ssa_emit_ptr_offset(proc, e, v_zero);
  1211. }
  1212. type = base_type(type);
  1213. if (is_type_raw_union(type)) {
  1214. type = type->Record.fields[index]->type;
  1215. e = ssa_emit_conv(proc, e, make_type_pointer(proc->module->allocator, type));
  1216. } else if (type->kind == Type_Record) {
  1217. type = type->Record.fields[index]->type;
  1218. e = ssa_emit_struct_ev(proc, e, index, type);
  1219. } else if (type->kind == Type_Basic) {
  1220. switch (type->Basic.kind) {
  1221. case Basic_any: {
  1222. if (index == 0) {
  1223. type = t_type_info_ptr;
  1224. } else if (index == 1) {
  1225. type = t_rawptr;
  1226. }
  1227. e = ssa_emit_struct_ev(proc, e, index, type);
  1228. } break;
  1229. case Basic_string:
  1230. e = ssa_emit_struct_ev(proc, e, index, sel.entity->type);
  1231. break;
  1232. default:
  1233. GB_PANIC("un-ev-able type");
  1234. break;
  1235. }
  1236. } else if (type->kind == Type_Slice) {
  1237. e = ssa_emit_struct_gep(proc, e, index, make_type_pointer(proc->module->allocator, sel.entity->type));
  1238. } else {
  1239. GB_PANIC("un-ev-able type");
  1240. }
  1241. }
  1242. return e;
  1243. }
  1244. isize ssa_type_info_index(CheckerInfo *info, Type *type) {
  1245. type = default_type(type);
  1246. isize entry_index = -1;
  1247. HashKey key = hash_pointer(type);
  1248. auto *found_entry_index = map_get(&info->type_info_map, key);
  1249. if (found_entry_index) {
  1250. entry_index = *found_entry_index;
  1251. }
  1252. if (entry_index < 0) {
  1253. // NOTE(bill): Do manual search
  1254. // TODO(bill): This is O(n) and can be very slow
  1255. gb_for_array(i, info->type_info_map.entries){
  1256. auto *e = &info->type_info_map.entries[i];
  1257. Type *prev_type = cast(Type *)cast(uintptr)e->key.key;
  1258. if (are_types_identical(prev_type, type)) {
  1259. entry_index = e->value;
  1260. // NOTE(bill): Add it to the search map
  1261. map_set(&info->type_info_map, key, entry_index);
  1262. break;
  1263. }
  1264. }
  1265. }
  1266. if (entry_index < 0) {
  1267. compiler_error("Type_Info for `%s` could not be found", type_to_string(type));
  1268. }
  1269. return entry_index;
  1270. }
  1271. ssaValue *ssa_type_info(ssaProcedure *proc, Type *type) {
  1272. ssaValue **found = map_get(&proc->module->members, hash_string(make_string(SSA_TYPE_INFO_DATA_NAME)));
  1273. GB_ASSERT(found != NULL);
  1274. ssaValue *type_info_data = *found;
  1275. CheckerInfo *info = proc->module->info;
  1276. isize entry_index = ssa_type_info_index(info, type);
  1277. return ssa_emit_struct_gep(proc, type_info_data, entry_index, t_type_info_ptr);
  1278. }
  1279. ssaValue *ssa_array_elem(ssaProcedure *proc, ssaValue *array) {
  1280. Type *t = type_deref(ssa_type(array));
  1281. GB_ASSERT(t->kind == Type_Array);
  1282. Type *result_type = make_type_pointer(proc->module->allocator, t->Array.elem);
  1283. return ssa_emit_struct_gep(proc, array, v_zero32, result_type);
  1284. }
  1285. ssaValue *ssa_array_len(ssaProcedure *proc, ssaValue *array) {
  1286. Type *t = ssa_type(array);
  1287. GB_ASSERT(t->kind == Type_Array);
  1288. return ssa_make_const_int(proc->module->allocator, t->Array.count);
  1289. }
  1290. ssaValue *ssa_array_cap(ssaProcedure *proc, ssaValue *array) {
  1291. return ssa_array_len(proc, array);
  1292. }
  1293. ssaValue *ssa_slice_elem(ssaProcedure *proc, ssaValue *slice) {
  1294. Type *t = ssa_type(slice);
  1295. GB_ASSERT(t->kind == Type_Slice);
  1296. Type *result_type = make_type_pointer(proc->module->allocator, t->Slice.elem);
  1297. return ssa_emit_struct_ev(proc, slice, 0, result_type);
  1298. }
  1299. ssaValue *ssa_slice_len(ssaProcedure *proc, ssaValue *slice) {
  1300. Type *t = ssa_type(slice);
  1301. GB_ASSERT(t->kind == Type_Slice);
  1302. return ssa_emit_struct_ev(proc, slice, 1, t_int);
  1303. }
  1304. ssaValue *ssa_slice_cap(ssaProcedure *proc, ssaValue *slice) {
  1305. Type *t = ssa_type(slice);
  1306. GB_ASSERT(t->kind == Type_Slice);
  1307. return ssa_emit_struct_ev(proc, slice, 2, t_int);
  1308. }
  1309. ssaValue *ssa_string_elem(ssaProcedure *proc, ssaValue *string) {
  1310. Type *t = ssa_type(string);
  1311. GB_ASSERT(t->kind == Type_Basic && t->Basic.kind == Basic_string);
  1312. Type *t_u8_ptr = make_type_pointer(proc->module->allocator, t_u8);
  1313. return ssa_emit_struct_ev(proc, string, 0, t_u8_ptr);
  1314. }
  1315. ssaValue *ssa_string_len(ssaProcedure *proc, ssaValue *string) {
  1316. Type *t = ssa_type(string);
  1317. GB_ASSERT(t->kind == Type_Basic && t->Basic.kind == Basic_string);
  1318. return ssa_emit_struct_ev(proc, string, 1, t_int);
  1319. }
  1320. ssaValue *ssa_add_local_slice(ssaProcedure *proc, Type *slice_type, ssaValue *base, ssaValue *low, ssaValue *high, ssaValue *max) {
  1321. // TODO(bill): array bounds checking for slice creation
  1322. // TODO(bill): check that low < high <= max
  1323. gbAllocator a = proc->module->allocator;
  1324. Type *bt = base_type(ssa_type(base));
  1325. if (low == NULL) {
  1326. low = v_zero;
  1327. }
  1328. if (high == NULL) {
  1329. switch (bt->kind) {
  1330. case Type_Array: high = ssa_array_len(proc, base); break;
  1331. case Type_Slice: high = ssa_slice_len(proc, base); break;
  1332. case Type_Pointer: high = v_one; break;
  1333. }
  1334. }
  1335. if (max == NULL) {
  1336. switch (bt->kind) {
  1337. case Type_Array: max = ssa_array_cap(proc, base); break;
  1338. case Type_Slice: max = ssa_slice_cap(proc, base); break;
  1339. case Type_Pointer: max = high; break;
  1340. }
  1341. }
  1342. GB_ASSERT(max != NULL);
  1343. Token op_sub = {Token_Sub};
  1344. ssaValue *len = ssa_emit_arith(proc, op_sub, high, low, t_int);
  1345. ssaValue *cap = ssa_emit_arith(proc, op_sub, max, low, t_int);
  1346. ssaValue *elem = NULL;
  1347. switch (bt->kind) {
  1348. case Type_Array: elem = ssa_array_elem(proc, base); break;
  1349. case Type_Slice: elem = ssa_slice_elem(proc, base); break;
  1350. case Type_Pointer: elem = ssa_emit_load(proc, base); break;
  1351. }
  1352. elem = ssa_emit_ptr_offset(proc, elem, low);
  1353. ssaValue *slice = ssa_add_local_generated(proc, slice_type);
  1354. ssaValue *gep = NULL;
  1355. gep = ssa_emit_struct_gep(proc, slice, v_zero32, ssa_type(elem));
  1356. ssa_emit_store(proc, gep, elem);
  1357. gep = ssa_emit_struct_gep(proc, slice, v_one32, t_int);
  1358. ssa_emit_store(proc, gep, len);
  1359. gep = ssa_emit_struct_gep(proc, slice, v_two32, t_int);
  1360. ssa_emit_store(proc, gep, cap);
  1361. return slice;
  1362. }
  1363. ssaValue *ssa_add_global_string_array(ssaModule *m, String string) {
  1364. gbAllocator a = m->allocator;
  1365. isize max_len = 6+8+1;
  1366. u8 *str = cast(u8 *)gb_alloc_array(a, u8, max_len);
  1367. isize len = gb_snprintf(cast(char *)str, max_len, "__str$%x", m->global_string_index);
  1368. m->global_string_index++;
  1369. String name = make_string(str, len-1);
  1370. Token token = {Token_String};
  1371. token.string = name;
  1372. Type *type = make_type_array(a, t_u8, string.len);
  1373. ExactValue ev = make_exact_value_string(string);
  1374. Entity *entity = make_entity_constant(a, NULL, token, type, ev);
  1375. ssaValue *g = ssa_make_value_global(a, entity, ssa_add_module_constant(m, type, ev));
  1376. g->Global.is_private = true;
  1377. // g->Global.is_constant = true;
  1378. ssa_module_add_value(m, entity, g);
  1379. map_set(&m->members, hash_string(name), g);
  1380. return g;
  1381. }
  1382. ssaValue *ssa_emit_string(ssaProcedure *proc, ssaValue *elem, ssaValue *len) {
  1383. Type *t_u8_ptr = ssa_type(elem);
  1384. GB_ASSERT(t_u8_ptr->kind == Type_Pointer);
  1385. GB_ASSERT(is_type_u8(t_u8_ptr->Pointer.elem));
  1386. ssaValue *str = ssa_add_local_generated(proc, t_string);
  1387. ssaValue *str_elem = ssa_emit_struct_gep(proc, str, v_zero32, t_u8_ptr);
  1388. ssaValue *str_len = ssa_emit_struct_gep(proc, str, v_one32, t_int);
  1389. ssa_emit_store(proc, str_elem, elem);
  1390. ssa_emit_store(proc, str_len, len);
  1391. return ssa_emit_load(proc, str);
  1392. }
  1393. ssaValue *ssa_emit_global_string(ssaProcedure *proc, String str) {
  1394. ssaValue *global_array = ssa_add_global_string_array(proc->module, str);
  1395. ssaValue *elem = ssa_array_elem(proc, global_array);
  1396. ssaValue *len = ssa_make_const_int(proc->module->allocator, str.len);
  1397. return ssa_emit_string(proc, elem, len);
  1398. }
  1399. String lookup_polymorphic_field(CheckerInfo *info, Type *dst, Type *src) {
  1400. Type *prev_src = src;
  1401. // Type *prev_dst = dst;
  1402. src = base_type(type_deref(src));
  1403. // dst = base_type(type_deref(dst));
  1404. b32 src_is_ptr = src != prev_src;
  1405. // b32 dst_is_ptr = dst != prev_dst;
  1406. GB_ASSERT(is_type_struct(src));
  1407. for (isize i = 0; i < src->Record.field_count; i++) {
  1408. Entity *f = src->Record.fields[i];
  1409. if (f->kind == Entity_Variable && f->Variable.anonymous) {
  1410. if (are_types_identical(dst, f->type)) {
  1411. return f->token.string;
  1412. }
  1413. if (src_is_ptr && is_type_pointer(dst)) {
  1414. if (are_types_identical(type_deref(dst), f->type)) {
  1415. return f->token.string;
  1416. }
  1417. }
  1418. String name = lookup_polymorphic_field(info, dst, f->type);
  1419. if (name.len > 0) {
  1420. return name;
  1421. }
  1422. }
  1423. }
  1424. return make_string("");
  1425. }
  1426. ssaValue *ssa_emit_conv(ssaProcedure *proc, ssaValue *value, Type *t, b32 is_argument) {
  1427. Type *src_type = ssa_type(value);
  1428. if (are_types_identical(t, src_type)) {
  1429. return value;
  1430. }
  1431. Type *src = get_enum_base_type(base_type(src_type));
  1432. Type *dst = get_enum_base_type(base_type(t));
  1433. if (value->kind == ssaValue_Constant) {
  1434. if (is_type_any(dst)) {
  1435. ssaValue *default_value = ssa_add_local_generated(proc, default_type(src_type));
  1436. ssa_emit_store(proc, default_value, value);
  1437. return ssa_emit_conv(proc, ssa_emit_load(proc, default_value), t_any, is_argument);
  1438. } else if (dst->kind == Type_Basic) {
  1439. ExactValue ev = value->Constant.value;
  1440. if (is_type_float(dst)) {
  1441. ev = exact_value_to_float(ev);
  1442. } else if (is_type_string(dst)) {
  1443. // Handled elsewhere
  1444. } else if (is_type_integer(dst)) {
  1445. ev = exact_value_to_integer(ev);
  1446. } else if (is_type_pointer(dst)) {
  1447. // IMPORTANT NOTE(bill): LLVM doesn't support pointer constants expect `null`
  1448. ssaValue *i = ssa_add_module_constant(proc->module, t_uint, ev);
  1449. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_inttoptr, i, t_uint, dst));
  1450. }
  1451. return ssa_add_module_constant(proc->module, t, ev);
  1452. }
  1453. }
  1454. if (are_types_identical(src, dst)) {
  1455. return value;
  1456. }
  1457. // integer -> integer
  1458. if (is_type_integer(src) && is_type_integer(dst)) {
  1459. GB_ASSERT(src->kind == Type_Basic &&
  1460. dst->kind == Type_Basic);
  1461. i64 sz = type_size_of(proc->module->sizes, proc->module->allocator, src);
  1462. i64 dz = type_size_of(proc->module->sizes, proc->module->allocator, dst);
  1463. if (sz == dz) {
  1464. // NOTE(bill): In LLVM, all integers are signed and rely upon 2's compliment
  1465. return value;
  1466. }
  1467. ssaConvKind kind = ssaConv_trunc;
  1468. if (dz >= sz) {
  1469. kind = ssaConv_zext;
  1470. }
  1471. return ssa_emit(proc, ssa_make_instr_conv(proc, kind, value, src, dst));
  1472. }
  1473. // boolean -> integer
  1474. if (is_type_boolean(src) && is_type_integer(dst)) {
  1475. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_zext, value, src, dst));
  1476. }
  1477. // integer -> boolean
  1478. if (is_type_integer(src) && is_type_boolean(dst)) {
  1479. Token op = {Token_NotEq};
  1480. return ssa_emit_comp(proc, op, value, v_zero);
  1481. }
  1482. // float -> float
  1483. if (is_type_float(src) && is_type_float(dst)) {
  1484. i64 sz = basic_type_sizes[src->Basic.kind];
  1485. i64 dz = basic_type_sizes[dst->Basic.kind];
  1486. ssaConvKind kind = ssaConv_fptrunc;
  1487. if (dz >= sz) {
  1488. kind = ssaConv_fpext;
  1489. }
  1490. return ssa_emit(proc, ssa_make_instr_conv(proc, kind, value, src, dst));
  1491. }
  1492. // float <-> integer
  1493. if (is_type_float(src) && is_type_integer(dst)) {
  1494. ssaConvKind kind = ssaConv_fptosi;
  1495. if (is_type_unsigned(dst)) {
  1496. kind = ssaConv_fptoui;
  1497. }
  1498. return ssa_emit(proc, ssa_make_instr_conv(proc, kind, value, src, dst));
  1499. }
  1500. if (is_type_integer(src) && is_type_float(dst)) {
  1501. ssaConvKind kind = ssaConv_sitofp;
  1502. if (is_type_unsigned(src)) {
  1503. kind = ssaConv_uitofp;
  1504. }
  1505. return ssa_emit(proc, ssa_make_instr_conv(proc, kind, value, src, dst));
  1506. }
  1507. // Pointer <-> int
  1508. if (is_type_pointer(src) && is_type_int_or_uint(dst)) {
  1509. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_ptrtoint, value, src, dst));
  1510. }
  1511. if (is_type_int_or_uint(src) && is_type_pointer(dst)) {
  1512. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_inttoptr, value, src, dst));
  1513. }
  1514. if (is_type_union(dst)) {
  1515. for (isize i = 0; i < dst->Record.field_count; i++) {
  1516. Entity *f = dst->Record.fields[i];
  1517. if (are_types_identical(f->type, src_type)) {
  1518. ssa_emit_comment(proc, make_string("union - child to parent"));
  1519. gbAllocator allocator = proc->module->allocator;
  1520. ssaValue *parent = ssa_add_local_generated(proc, t);
  1521. ssaValue *tag = ssa_make_const_int(allocator, i);
  1522. ssa_emit_store(proc, ssa_emit_struct_gep(proc, parent, v_one32, t_int), tag);
  1523. ssaValue *data = ssa_emit_conv(proc, parent, t_rawptr);
  1524. Type *tag_type = src_type;
  1525. Type *tag_type_ptr = make_type_pointer(allocator, tag_type);
  1526. ssaValue *underlying = ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_bitcast, data, t_rawptr, tag_type_ptr));
  1527. ssa_emit_store(proc, underlying, value);
  1528. return ssa_emit_load(proc, parent);
  1529. }
  1530. }
  1531. }
  1532. // NOTE(bill): This has to be done beofre `Pointer <-> Pointer` as it's
  1533. // subtype polymorphism casting
  1534. if (true || is_argument) {
  1535. Type *sb = base_type(type_deref(src));
  1536. b32 src_is_ptr = src != sb;
  1537. if (is_type_struct(sb)) {
  1538. String field_name = lookup_polymorphic_field(proc->module->info, t, src);
  1539. // gb_printf("field_name: %.*s\n", LIT(field_name));
  1540. if (field_name.len > 0) {
  1541. // NOTE(bill): It can be casted
  1542. Selection sel = lookup_field(proc->module->allocator, sb, field_name, false);
  1543. if (sel.entity != NULL) {
  1544. ssa_emit_comment(proc, make_string("cast - polymorphism"));
  1545. if (src_is_ptr) {
  1546. value = ssa_emit_load(proc, value);
  1547. }
  1548. return ssa_emit_deep_field_ev(proc, sb, value, sel);
  1549. }
  1550. }
  1551. }
  1552. }
  1553. // Pointer <-> Pointer
  1554. if (is_type_pointer(src) && is_type_pointer(dst)) {
  1555. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_bitcast, value, src, dst));
  1556. }
  1557. // proc <-> proc
  1558. if (is_type_proc(src) && is_type_proc(dst)) {
  1559. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_bitcast, value, src, dst));
  1560. }
  1561. // pointer -> proc
  1562. if (is_type_pointer(src) && is_type_proc(dst)) {
  1563. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_bitcast, value, src, dst));
  1564. }
  1565. // proc -> pointer
  1566. if (is_type_proc(src) && is_type_pointer(dst)) {
  1567. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_bitcast, value, src, dst));
  1568. }
  1569. // []byte/[]u8 <-> string
  1570. if (is_type_u8_slice(src) && is_type_string(dst)) {
  1571. ssaValue *elem = ssa_slice_elem(proc, value);
  1572. ssaValue *len = ssa_slice_len(proc, value);
  1573. return ssa_emit_string(proc, elem, len);
  1574. }
  1575. if (is_type_string(src) && is_type_u8_slice(dst)) {
  1576. ssaValue *elem = ssa_string_elem(proc, value);
  1577. ssaValue *elem_ptr = ssa_add_local_generated(proc, ssa_type(elem));
  1578. ssa_emit_store(proc, elem_ptr, elem);
  1579. ssaValue *len = ssa_string_len(proc, value);
  1580. ssaValue *slice = ssa_add_local_slice(proc, dst, elem_ptr, v_zero, len, len);
  1581. return ssa_emit_load(proc, slice);
  1582. }
  1583. if (is_type_vector(dst)) {
  1584. Type *dst_elem = dst->Vector.elem;
  1585. value = ssa_emit_conv(proc, value, dst_elem);
  1586. ssaValue *v = ssa_add_local_generated(proc, t);
  1587. v = ssa_emit_load(proc, v);
  1588. v = ssa_emit(proc, ssa_make_instr_insert_element(proc, v, value, v_zero32));
  1589. // NOTE(bill): Broadcast lowest value to all values
  1590. isize index_count = dst->Vector.count;
  1591. i32 *indices = gb_alloc_array(proc->module->allocator, i32, index_count);
  1592. for (isize i = 0; i < index_count; i++) {
  1593. indices[i] = 0;
  1594. }
  1595. v = ssa_emit(proc, ssa_make_instr_shuffle_vector(proc, v, indices, index_count));
  1596. return v;
  1597. }
  1598. if (is_type_any(dst)) {
  1599. ssaValue *result = ssa_add_local_generated(proc, t_any);
  1600. if (is_type_untyped_nil(src)) {
  1601. return ssa_emit_load(proc, result);
  1602. }
  1603. ssaValue *data = NULL;
  1604. if (value->kind == ssaValue_Instr &&
  1605. value->Instr.kind == ssaInstr_Load) {
  1606. // NOTE(bill): Addressable value
  1607. data = value->Instr.Load.address;
  1608. } else {
  1609. // NOTE(bill): Non-addressable value
  1610. data = ssa_add_local_generated(proc, src_type);
  1611. ssa_emit_store(proc, data, value);
  1612. }
  1613. GB_ASSERT(is_type_pointer(ssa_type(data)));
  1614. GB_ASSERT(is_type_typed(src_type));
  1615. data = ssa_emit_conv(proc, data, t_rawptr);
  1616. ssaValue *ti = ssa_type_info(proc, src_type);
  1617. ssaValue *gep0 = ssa_emit_struct_gep(proc, result, v_zero32, make_type_pointer(proc->module->allocator, t_type_info_ptr));
  1618. ssaValue *gep1 = ssa_emit_struct_gep(proc, result, v_one32, make_type_pointer(proc->module->allocator, t_rawptr));
  1619. ssa_emit_store(proc, gep0, ti);
  1620. ssa_emit_store(proc, gep1, data);
  1621. return ssa_emit_load(proc, result);
  1622. }
  1623. if (is_type_untyped_nil(src) && type_has_nil(dst)) {
  1624. return ssa_make_value_nil(proc->module->allocator, t);
  1625. }
  1626. gb_printf_err("Not Identical %s != %s\n", type_to_string(src_type), type_to_string(t));
  1627. gb_printf_err("Not Identical %s != %s\n", type_to_string(src), type_to_string(dst));
  1628. GB_PANIC("Invalid type conversion: `%s` to `%s`", type_to_string(src_type), type_to_string(t));
  1629. return NULL;
  1630. }
  1631. ssaValue *ssa_emit_transmute(ssaProcedure *proc, ssaValue *value, Type *t) {
  1632. Type *src_type = ssa_type(value);
  1633. if (are_types_identical(t, src_type)) {
  1634. return value;
  1635. }
  1636. Type *src = base_type(src_type);
  1637. Type *dst = base_type(t);
  1638. if (are_types_identical(t, src_type)) {
  1639. return value;
  1640. }
  1641. i64 sz = type_size_of(proc->module->sizes, proc->module->allocator, src);
  1642. i64 dz = type_size_of(proc->module->sizes, proc->module->allocator, dst);
  1643. if (sz == dz) {
  1644. return ssa_emit(proc, ssa_make_instr_conv(proc, ssaConv_bitcast, value, src, dst));
  1645. }
  1646. GB_PANIC("Invalid transmute conversion: `%s` to `%s`", type_to_string(src_type), type_to_string(t));
  1647. return NULL;
  1648. }
  1649. ssaValue *ssa_emit_down_cast(ssaProcedure *proc, ssaValue *value, Type *t) {
  1650. GB_ASSERT(is_type_pointer(ssa_type(value)));
  1651. gbAllocator allocator = proc->module->allocator;
  1652. String field_name = check_down_cast_name(t, type_deref(ssa_type(value)));
  1653. GB_ASSERT(field_name.len > 0);
  1654. Selection sel = lookup_field(proc->module->allocator, t, field_name, false);
  1655. Type *t_u8_ptr = make_type_pointer(allocator, t_u8);
  1656. ssaValue *bytes = ssa_emit_conv(proc, value, t_u8_ptr);
  1657. i64 offset_ = type_offset_of_from_selection(proc->module->sizes, allocator, type_deref(t), sel);
  1658. ssaValue *offset = ssa_make_const_int(allocator, -offset_);
  1659. ssaValue *head = ssa_emit_ptr_offset(proc, bytes, offset);
  1660. return ssa_emit_conv(proc, head, t);
  1661. }
  1662. void ssa_build_cond(ssaProcedure *proc, AstNode *cond, ssaBlock *true_block, ssaBlock *false_block);
  1663. ssaValue *ssa_emit_logical_binary_expr(ssaProcedure *proc, AstNode *expr) {
  1664. ast_node(be, BinaryExpr, expr);
  1665. ssaBlock *true_ = ssa_add_block(proc, NULL, make_string("logical.cmp.true"));
  1666. ssaBlock *false_ = ssa_add_block(proc, NULL, make_string("logical.cmp.false"));
  1667. ssaBlock *done = ssa__make_block(proc, NULL, make_string("logical.cmp.done"));
  1668. ssaValue *result = ssa_add_local_generated(proc, t_bool);
  1669. ssa_build_cond(proc, expr, true_, false_);
  1670. proc->curr_block = true_;
  1671. ssa_emit_store(proc, result, v_true);
  1672. ssa_emit_jump(proc, done);
  1673. proc->curr_block = false_;
  1674. ssa_emit_store(proc, result, v_false);
  1675. ssa_emit_jump(proc, done);
  1676. gb_array_append(proc->blocks, done);
  1677. proc->curr_block = done;
  1678. return ssa_emit_load(proc, result);
  1679. }
  1680. void ssa_array_bounds_check(ssaProcedure *proc, Token token, ssaValue *index, ssaValue *len) {
  1681. if ((proc->module->stmt_state_flags & StmtStateFlag_no_bounds_check) != 0) {
  1682. return;
  1683. }
  1684. gbAllocator a = proc->module->allocator;
  1685. ssaValue **args = gb_alloc_array(a, ssaValue *, 5);
  1686. args[0] = ssa_emit_global_string(proc, token.pos.file);
  1687. args[1] = ssa_make_const_int(a, token.pos.line);
  1688. args[2] = ssa_make_const_int(a, token.pos.column);
  1689. args[3] = ssa_emit_conv(proc, index, t_int);
  1690. args[4] = ssa_emit_conv(proc, len, t_int);
  1691. ssa_emit_global_call(proc, "__bounds_check_error", args, 5);
  1692. }
  1693. void ssa_slice_bounds_check(ssaProcedure *proc, Token token, ssaValue *low, ssaValue *high, ssaValue *max, b32 is_substring) {
  1694. if ((proc->module->stmt_state_flags & StmtStateFlag_no_bounds_check) != 0) {
  1695. return;
  1696. }
  1697. gbAllocator a = proc->module->allocator;
  1698. ssaValue **args = gb_alloc_array(a, ssaValue *, 6);
  1699. args[0] = ssa_emit_global_string(proc, token.pos.file);
  1700. args[1] = ssa_make_const_int(a, token.pos.line);
  1701. args[2] = ssa_make_const_int(a, token.pos.column);
  1702. args[3] = ssa_emit_conv(proc, low, t_int);
  1703. args[4] = ssa_emit_conv(proc, high, t_int);
  1704. args[5] = ssa_emit_conv(proc, max, t_int);
  1705. if (!is_substring) {
  1706. ssa_emit_global_call(proc, "__slice_expr_error", args, 6);
  1707. } else {
  1708. ssa_emit_global_call(proc, "__substring_expr_error", args, 5);
  1709. }
  1710. }
  1711. ssaValue *ssa_build_single_expr(ssaProcedure *proc, AstNode *expr, TypeAndValue *tv) {
  1712. switch (expr->kind) {
  1713. case_ast_node(bl, BasicLit, expr);
  1714. GB_PANIC("Non-constant basic literal");
  1715. case_end;
  1716. case_ast_node(i, Ident, expr);
  1717. Entity *e = *map_get(&proc->module->info->uses, hash_pointer(expr));
  1718. if (e->kind == Entity_Builtin) {
  1719. Token token = ast_node_token(expr);
  1720. GB_PANIC("TODO(bill): ssa_build_single_expr Entity_Builtin `%.*s`\n"
  1721. "\t at %.*s(%td:%td)", LIT(builtin_procs[e->Builtin.id].name),
  1722. LIT(token.pos.file), token.pos.line, token.pos.column);
  1723. return NULL;
  1724. } else if (e->kind == Entity_Nil) {
  1725. return ssa_make_value_nil(proc->module->allocator, tv->type);
  1726. }
  1727. auto *found = map_get(&proc->module->values, hash_pointer(e));
  1728. if (found) {
  1729. ssaValue *v = *found;
  1730. if (v->kind == ssaValue_Proc)
  1731. return v;
  1732. return ssa_emit_load(proc, v);
  1733. }
  1734. return NULL;
  1735. case_end;
  1736. case_ast_node(pe, ParenExpr, expr);
  1737. return ssa_build_single_expr(proc, unparen_expr(expr), tv);
  1738. case_end;
  1739. case_ast_node(de, DerefExpr, expr);
  1740. return ssa_lvalue_load(proc, ssa_build_addr(proc, expr));
  1741. case_end;
  1742. case_ast_node(se, SelectorExpr, expr);
  1743. return ssa_lvalue_load(proc, ssa_build_addr(proc, expr));
  1744. case_end;
  1745. case_ast_node(ue, UnaryExpr, expr);
  1746. switch (ue->op.kind) {
  1747. case Token_Pointer: {
  1748. return ssa_emit_zero_gep(proc, ssa_build_addr(proc, ue->expr).addr);
  1749. }
  1750. case Token_Add:
  1751. return ssa_build_expr(proc, ue->expr);
  1752. case Token_Sub: {
  1753. // NOTE(bill): -`x` == 0 - `x`
  1754. ssaValue *left = v_zero;
  1755. ssaValue *right = ssa_build_expr(proc, ue->expr);
  1756. return ssa_emit_arith(proc, ue->op, left, right, tv->type);
  1757. } break;
  1758. case Token_Not: // Boolean not
  1759. case Token_Xor: { // Bitwise not
  1760. // NOTE(bill): "not" `x` == `x` "xor" `-1`
  1761. ExactValue neg_one = make_exact_value_integer(-1);
  1762. ssaValue *left = ssa_build_expr(proc, ue->expr);
  1763. ssaValue *right = ssa_add_module_constant(proc->module, tv->type, neg_one);
  1764. return ssa_emit_arith(proc, ue->op, left, right, tv->type);
  1765. } break;
  1766. }
  1767. case_end;
  1768. case_ast_node(be, BinaryExpr, expr);
  1769. switch (be->op.kind) {
  1770. case Token_Add:
  1771. case Token_Sub:
  1772. case Token_Mul:
  1773. case Token_Quo:
  1774. case Token_Mod:
  1775. case Token_And:
  1776. case Token_Or:
  1777. case Token_Xor:
  1778. case Token_AndNot:
  1779. case Token_Shl:
  1780. case Token_Shr:
  1781. return ssa_emit_arith(proc, be->op,
  1782. ssa_build_expr(proc, be->left),
  1783. ssa_build_expr(proc, be->right),
  1784. tv->type);
  1785. case Token_CmpEq:
  1786. case Token_NotEq:
  1787. case Token_Lt:
  1788. case Token_LtEq:
  1789. case Token_Gt:
  1790. case Token_GtEq: {
  1791. ssaValue *left = ssa_build_expr(proc, be->left);
  1792. ssaValue *right = ssa_build_expr(proc, be->right);
  1793. ssaValue *cmp = ssa_emit_comp(proc, be->op, left, right);
  1794. return ssa_emit_conv(proc, cmp, default_type(tv->type));
  1795. } break;
  1796. case Token_CmpAnd:
  1797. case Token_CmpOr:
  1798. return ssa_emit_logical_binary_expr(proc, expr);
  1799. case Token_as:
  1800. ssa_emit_comment(proc, make_string("cast - as"));
  1801. return ssa_emit_conv(proc, ssa_build_expr(proc, be->left), tv->type);
  1802. case Token_transmute:
  1803. ssa_emit_comment(proc, make_string("cast - transmute"));
  1804. return ssa_emit_transmute(proc, ssa_build_expr(proc, be->left), tv->type);
  1805. case Token_down_cast:
  1806. ssa_emit_comment(proc, make_string("cast - down_cast"));
  1807. return ssa_emit_down_cast(proc, ssa_build_expr(proc, be->left), tv->type);
  1808. default:
  1809. GB_PANIC("Invalid binary expression");
  1810. break;
  1811. }
  1812. case_end;
  1813. case_ast_node(pl, ProcLit, expr);
  1814. // NOTE(bill): Generate a new name
  1815. // parent$count
  1816. isize name_len = proc->name.len + 1 + 8 + 1;
  1817. u8 *name_text = gb_alloc_array(proc->module->allocator, u8, name_len);
  1818. name_len = gb_snprintf(cast(char *)name_text, name_len, "%.*s$%d", LIT(proc->name), cast(i32)gb_array_count(proc->children));
  1819. String name = make_string(name_text, name_len-1);
  1820. Type *type = type_of_expr(proc->module->info, expr);
  1821. ssaValue *value = ssa_make_value_procedure(proc->module->allocator,
  1822. proc->module, NULL, type, pl->type, pl->body, name);
  1823. value->Proc.tags = pl->tags;
  1824. gb_array_append(proc->children, &value->Proc);
  1825. ssa_build_proc(value, proc);
  1826. return value;
  1827. case_end;
  1828. case_ast_node(cl, CompoundLit, expr);
  1829. ssa_emit_comment(proc, make_string("CompoundLit"));
  1830. Type *type = type_of_expr(proc->module->info, expr);
  1831. Type *bt = base_type(type);
  1832. ssaValue *v = ssa_add_local_generated(proc, type);
  1833. Type *et = NULL;
  1834. switch (bt->kind) {
  1835. case Type_Vector: et = bt->Vector.elem; break;
  1836. case Type_Array: et = bt->Array.elem; break;
  1837. case Type_Slice: et = bt->Slice.elem; break;
  1838. }
  1839. auto is_elem_const = [](ssaModule *m, AstNode *elem) -> b32 {
  1840. if (elem->kind == AstNode_FieldValue) {
  1841. elem = elem->FieldValue.value;
  1842. }
  1843. TypeAndValue *tav = type_and_value_of_expression(m->info, elem);
  1844. GB_ASSERT(tav != NULL);
  1845. return tav->value.kind != ExactValue_Invalid;
  1846. };
  1847. switch (bt->kind) {
  1848. default: GB_PANIC("Unknown CompoundLit type: %s", type_to_string(type)); break;
  1849. case Type_Vector: {
  1850. ssaValue *result = ssa_add_module_constant(proc->module, type, make_exact_value_compound(expr));
  1851. if (cl->elems != NULL) {
  1852. for (isize index = 0; index < gb_array_count(cl->elems); index++) {
  1853. AstNode *elem = cl->elems[index];
  1854. if (is_elem_const(proc->module, elem)) {
  1855. continue;
  1856. }
  1857. ssaValue *field_elem = ssa_build_expr(proc, elem);
  1858. Type *t = ssa_type(field_elem);
  1859. GB_ASSERT(t->kind != Type_Tuple);
  1860. ssaValue *ev = ssa_emit_conv(proc, field_elem, et);
  1861. ssaValue *i = ssa_make_const_int(proc->module->allocator, index);
  1862. result = ssa_emit(proc, ssa_make_instr_insert_element(proc, result, ev, i));
  1863. }
  1864. if (gb_array_count(cl->elems) == 1 && bt->Vector.count > 1) {
  1865. isize index_count = bt->Vector.count;
  1866. i32 *indices = gb_alloc_array(proc->module->allocator, i32, index_count);
  1867. for (isize i = 0; i < index_count; i++) {
  1868. indices[i] = 0;
  1869. }
  1870. ssaValue *sv = ssa_emit(proc, ssa_make_instr_shuffle_vector(proc, result, indices, index_count));
  1871. ssa_emit_store(proc, v, sv);
  1872. return ssa_emit_load(proc, v);
  1873. }
  1874. }
  1875. return result;
  1876. } break;
  1877. case Type_Record: {
  1878. GB_ASSERT(is_type_struct(bt));
  1879. auto *st = &bt->Record;
  1880. if (cl->elems != NULL && gb_array_count(cl->elems) > 0) {
  1881. ssa_emit_store(proc, v, ssa_add_module_constant(proc->module, type, make_exact_value_compound(expr)));
  1882. gb_for_array(field_index, cl->elems) {
  1883. AstNode *elem = cl->elems[field_index];
  1884. if (is_elem_const(proc->module, elem)) {
  1885. continue;
  1886. }
  1887. ssaValue *field_expr = NULL;
  1888. Entity *field = NULL;
  1889. isize index = field_index;
  1890. if (elem->kind == AstNode_FieldValue) {
  1891. ast_node(fv, FieldValue, elem);
  1892. Selection sel = lookup_field(proc->module->allocator, bt, fv->field->Ident.string, false);
  1893. index = sel.index[0];
  1894. field_expr = ssa_build_expr(proc, fv->value);
  1895. } else {
  1896. TypeAndValue *tav = type_and_value_of_expression(proc->module->info, elem);
  1897. Selection sel = lookup_field(proc->module->allocator, bt, st->fields_in_src_order[field_index]->token.string, false);
  1898. index = sel.index[0];
  1899. field_expr = ssa_build_expr(proc, elem);
  1900. }
  1901. GB_ASSERT(ssa_type(field_expr)->kind != Type_Tuple);
  1902. field = st->fields[index];
  1903. Type *ft = field->type;
  1904. ssaValue *fv = ssa_emit_conv(proc, field_expr, ft);
  1905. ssaValue *gep = ssa_emit_struct_gep(proc, v, index, ft);
  1906. ssa_emit_store(proc, gep, fv);
  1907. }
  1908. }
  1909. } break;
  1910. case Type_Array: {
  1911. if (cl->elems != NULL && gb_array_count(cl->elems) > 0) {
  1912. ssa_emit_store(proc, v, ssa_add_module_constant(proc->module, type, make_exact_value_compound(expr)));
  1913. gb_for_array(i, cl->elems) {
  1914. AstNode *elem = cl->elems[i];
  1915. if (is_elem_const(proc->module, elem)) {
  1916. continue;
  1917. }
  1918. ssaValue *field_expr = ssa_build_expr(proc, elem);
  1919. Type *t = ssa_type(field_expr);
  1920. GB_ASSERT(t->kind != Type_Tuple);
  1921. ssaValue *ev = ssa_emit_conv(proc, field_expr, et);
  1922. ssaValue *gep = ssa_emit_struct_gep(proc, v, i, et);
  1923. ssa_emit_store(proc, gep, ev);
  1924. }
  1925. }
  1926. } break;
  1927. case Type_Slice: {
  1928. if (cl->elems != NULL && gb_array_count(cl->elems) > 0) {
  1929. Type *elem_type = bt->Slice.elem;
  1930. Type *elem_ptr_type = make_type_pointer(proc->module->allocator, elem_type);
  1931. Type *elem_ptr_ptr_type = make_type_pointer(proc->module->allocator, elem_ptr_type);
  1932. Type *t_int_ptr = make_type_pointer(proc->module->allocator, t_int);
  1933. ssaValue *slice = ssa_add_module_constant(proc->module, type, make_exact_value_compound(expr));
  1934. GB_ASSERT(slice->kind == ssaValue_ConstantSlice);
  1935. ssaValue *data = ssa_emit_struct_gep(proc, slice->ConstantSlice.backing_array, v_zero32, elem_ptr_type);
  1936. gb_for_array(i, cl->elems) {
  1937. AstNode *elem = cl->elems[i];
  1938. if (is_elem_const(proc->module,elem)) {
  1939. continue;
  1940. }
  1941. ssaValue *field_expr = ssa_build_expr(proc, elem);
  1942. Type *t = ssa_type(field_expr);
  1943. GB_ASSERT(t->kind != Type_Tuple);
  1944. ssaValue *ev = ssa_emit_conv(proc, field_expr, elem_type);
  1945. ssaValue *offset = ssa_emit_ptr_offset(proc, data, ssa_make_const_int(proc->module->allocator, i));
  1946. ssa_emit_store(proc, offset, ev);
  1947. }
  1948. ssaValue *gep0 = ssa_emit_struct_gep(proc, v, v_zero32, elem_ptr_ptr_type);
  1949. ssaValue *gep1 = ssa_emit_struct_gep(proc, v, v_one32, t_int_ptr);
  1950. ssaValue *gep2 = ssa_emit_struct_gep(proc, v, v_two32, t_int_ptr);
  1951. ssa_emit_store(proc, gep0, data);
  1952. ssa_emit_store(proc, gep1, ssa_make_const_int(proc->module->allocator, slice->ConstantSlice.count));
  1953. ssa_emit_store(proc, gep2, ssa_make_const_int(proc->module->allocator, slice->ConstantSlice.count));
  1954. }
  1955. } break;
  1956. }
  1957. return ssa_emit_load(proc, v);
  1958. case_end;
  1959. case_ast_node(ce, CallExpr, expr);
  1960. AstNode *p = unparen_expr(ce->proc);
  1961. if (p->kind == AstNode_Ident) {
  1962. Entity **found = map_get(&proc->module->info->uses, hash_pointer(p));
  1963. if (found && (*found)->kind == Entity_Builtin) {
  1964. Entity *e = *found;
  1965. switch (e->Builtin.id) {
  1966. case BuiltinProc_type_info: {
  1967. Type *t = default_type(type_of_expr(proc->module->info, ce->args[0]));
  1968. return ssa_type_info(proc, t);
  1969. } break;
  1970. case BuiltinProc_type_info_of_val: {
  1971. Type *t = default_type(type_of_expr(proc->module->info, ce->args[0]));
  1972. return ssa_type_info(proc, t);
  1973. } break;
  1974. case BuiltinProc_new: {
  1975. ssa_emit_comment(proc, make_string("new"));
  1976. // new :: proc(Type) -> ^Type
  1977. gbAllocator allocator = proc->module->allocator;
  1978. Type *type = type_of_expr(proc->module->info, ce->args[0]);
  1979. Type *ptr_type = make_type_pointer(allocator, type);
  1980. i64 s = type_size_of(proc->module->sizes, allocator, type);
  1981. i64 a = type_align_of(proc->module->sizes, allocator, type);
  1982. ssaValue **args = gb_alloc_array(allocator, ssaValue *, 2);
  1983. args[0] = ssa_make_const_int(allocator, s);
  1984. args[1] = ssa_make_const_int(allocator, a);
  1985. ssaValue *call = ssa_emit_global_call(proc, "alloc_align", args, 2);
  1986. ssaValue *v = ssa_emit_conv(proc, call, ptr_type);
  1987. return v;
  1988. } break;
  1989. case BuiltinProc_new_slice: {
  1990. ssa_emit_comment(proc, make_string("new_slice"));
  1991. // new_slice :: proc(Type, len: int[, cap: int]) -> ^Type
  1992. gbAllocator allocator = proc->module->allocator;
  1993. Type *type = type_of_expr(proc->module->info, ce->args[0]);
  1994. Type *ptr_type = make_type_pointer(allocator, type);
  1995. Type *slice_type = make_type_slice(allocator, type);
  1996. i64 s = type_size_of(proc->module->sizes, allocator, type);
  1997. i64 a = type_align_of(proc->module->sizes, allocator, type);
  1998. ssaValue *elem_size = ssa_make_const_int(allocator, s);
  1999. ssaValue *elem_align = ssa_make_const_int(allocator, a);
  2000. ssaValue *len =ssa_emit_conv(proc, ssa_build_expr(proc, ce->args[1]), t_int);
  2001. ssaValue *cap = len;
  2002. if (gb_array_count(ce->args) == 3) {
  2003. cap = ssa_emit_conv(proc, ssa_build_expr(proc, ce->args[2]), t_int);
  2004. }
  2005. ssa_slice_bounds_check(proc, ast_node_token(ce->args[1]), v_zero, len, cap, false);
  2006. Token mul = {Token_Mul};
  2007. ssaValue *slice_size = ssa_emit_arith(proc, mul, elem_size, cap, t_int);
  2008. ssaValue **args = gb_alloc_array(allocator, ssaValue *, 2);
  2009. args[0] = slice_size;
  2010. args[1] = elem_align;
  2011. ssaValue *call = ssa_emit_global_call(proc, "alloc_align", args, 2);
  2012. ssaValue *ptr = ssa_emit_conv(proc, call, ptr_type, true);
  2013. ssaValue *slice = ssa_add_local_generated(proc, slice_type);
  2014. ssaValue *gep0 = ssa_emit_struct_gep(proc, slice, v_zero32, ptr_type);
  2015. ssaValue *gep1 = ssa_emit_struct_gep(proc, slice, v_one32, t_int);
  2016. ssaValue *gep2 = ssa_emit_struct_gep(proc, slice, v_two32, t_int);
  2017. ssa_emit_store(proc, gep0, ptr);
  2018. ssa_emit_store(proc, gep1, len);
  2019. ssa_emit_store(proc, gep2, cap);
  2020. return ssa_emit_load(proc, slice);
  2021. } break;
  2022. case BuiltinProc_assert: {
  2023. ssa_emit_comment(proc, make_string("assert"));
  2024. ssaValue *cond = ssa_build_expr(proc, ce->args[0]);
  2025. GB_ASSERT(is_type_boolean(ssa_type(cond)));
  2026. Token eq = {Token_CmpEq};
  2027. cond = ssa_emit_comp(proc, eq, cond, v_false);
  2028. ssaBlock *err = ssa_add_block(proc, NULL, make_string("builtin.assert.err"));
  2029. ssaBlock *done = ssa__make_block(proc, NULL, make_string("builtin.assert.done"));
  2030. ssa_emit_if(proc, cond, err, done);
  2031. proc->curr_block = err;
  2032. // TODO(bill): Cleanup allocations here
  2033. Token token = ast_node_token(ce->args[0]);
  2034. TokenPos pos = token.pos;
  2035. gbString expr = expr_to_string(ce->args[0]);
  2036. defer (gb_string_free(expr));
  2037. isize expr_len = gb_string_length(expr);
  2038. String expr_str = {};
  2039. expr_str.text = cast(u8 *)gb_alloc_copy_align(proc->module->allocator, expr, expr_len, 1);
  2040. expr_str.len = expr_len;
  2041. ssaValue **args = gb_alloc_array(proc->module->allocator, ssaValue *, 4);
  2042. args[0] = ssa_emit_global_string(proc, pos.file);
  2043. args[1] = ssa_make_const_int(proc->module->allocator, pos.line);
  2044. args[2] = ssa_make_const_int(proc->module->allocator, pos.column);
  2045. args[3] = ssa_emit_global_string(proc, expr_str);
  2046. ssa_emit_global_call(proc, "__assert", args, 4);
  2047. ssa_emit_jump(proc, done);
  2048. gb_array_append(proc->blocks, done);
  2049. proc->curr_block = done;
  2050. return NULL;
  2051. } break;
  2052. case BuiltinProc_panic: {
  2053. ssa_emit_comment(proc, make_string("panic"));
  2054. ssaValue *msg = ssa_build_expr(proc, ce->args[0]);
  2055. GB_ASSERT(is_type_string(ssa_type(msg)));
  2056. Token token = ast_node_token(ce->args[0]);
  2057. TokenPos pos = token.pos;
  2058. ssaValue **args = gb_alloc_array(proc->module->allocator, ssaValue *, 4);
  2059. args[0] = ssa_emit_global_string(proc, pos.file);
  2060. args[1] = ssa_make_const_int(proc->module->allocator, pos.line);
  2061. args[2] = ssa_make_const_int(proc->module->allocator, pos.column);
  2062. args[3] = msg;
  2063. ssa_emit_global_call(proc, "__assert", args, 4);
  2064. return NULL;
  2065. } break;
  2066. case BuiltinProc_copy: {
  2067. ssa_emit_comment(proc, make_string("copy"));
  2068. // copy :: proc(dst, src: []Type) -> int
  2069. AstNode *dst_node = ce->args[0];
  2070. AstNode *src_node = ce->args[1];
  2071. ssaValue *dst_slice = ssa_build_expr(proc, dst_node);
  2072. ssaValue *src_slice = ssa_build_expr(proc, src_node);
  2073. Type *slice_type = base_type(ssa_type(dst_slice));
  2074. GB_ASSERT(slice_type->kind == Type_Slice);
  2075. Type *elem_type = slice_type->Slice.elem;
  2076. i64 size_of_elem = type_size_of(proc->module->sizes, proc->module->allocator, elem_type);
  2077. ssaValue *dst = ssa_emit_conv(proc, ssa_slice_elem(proc, dst_slice), t_rawptr, true);
  2078. ssaValue *src = ssa_emit_conv(proc, ssa_slice_elem(proc, src_slice), t_rawptr, true);
  2079. ssaValue *len_dst = ssa_slice_len(proc, dst_slice);
  2080. ssaValue *len_src = ssa_slice_len(proc, src_slice);
  2081. Token lt = {Token_Lt};
  2082. ssaValue *cond = ssa_emit_comp(proc, lt, len_dst, len_src);
  2083. ssaValue *len = ssa_emit_select(proc, cond, len_dst, len_src);
  2084. Token mul = {Token_Mul};
  2085. ssaValue *elem_size = ssa_make_const_int(proc->module->allocator, size_of_elem);
  2086. ssaValue *byte_count = ssa_emit_arith(proc, mul, len, elem_size, t_int);
  2087. ssaValue **args = gb_alloc_array(proc->module->allocator, ssaValue *, 3);
  2088. args[0] = dst;
  2089. args[1] = src;
  2090. args[2] = byte_count;
  2091. ssa_emit_global_call(proc, "__mem_copy", args, 3);
  2092. return len;
  2093. } break;
  2094. case BuiltinProc_append: {
  2095. ssa_emit_comment(proc, make_string("append"));
  2096. // append :: proc(s: ^[]Type, item: Type) -> bool
  2097. AstNode *sptr_node = ce->args[0];
  2098. AstNode *item_node = ce->args[1];
  2099. ssaValue *slice_ptr = ssa_build_expr(proc, sptr_node);
  2100. ssaValue *slice = ssa_emit_load(proc, slice_ptr);
  2101. ssaValue *elem = ssa_slice_elem(proc, slice);
  2102. ssaValue *len = ssa_slice_len(proc, slice);
  2103. ssaValue *cap = ssa_slice_cap(proc, slice);
  2104. Type *elem_type = type_deref(ssa_type(elem));
  2105. ssaValue *item_value = ssa_build_expr(proc, item_node);
  2106. item_value = ssa_emit_conv(proc, item_value, elem_type, true);
  2107. ssaValue *item = ssa_add_local_generated(proc, elem_type);
  2108. ssa_emit_store(proc, item, item_value);
  2109. // NOTE(bill): Check if can append is possible
  2110. Token lt = {Token_Lt};
  2111. ssaValue *cond = ssa_emit_comp(proc, lt, len, cap);
  2112. ssaBlock *able = ssa_add_block(proc, NULL, make_string("builtin.append.able"));
  2113. ssaBlock *done = ssa__make_block(proc, NULL, make_string("builtin.append.done"));
  2114. ssa_emit_if(proc, cond, able, done);
  2115. proc->curr_block = able;
  2116. // Add new slice item
  2117. i64 item_size = type_size_of(proc->module->sizes, proc->module->allocator, elem_type);
  2118. ssaValue *byte_count = ssa_make_const_int(proc->module->allocator, item_size);
  2119. ssaValue *offset = ssa_emit_ptr_offset(proc, elem, len);
  2120. offset = ssa_emit_conv(proc, offset, t_rawptr, true);
  2121. item = ssa_emit_ptr_offset(proc, item, v_zero);
  2122. item = ssa_emit_conv(proc, item, t_rawptr, true);
  2123. ssaValue **args = gb_alloc_array(proc->module->allocator, ssaValue *, 3);
  2124. args[0] = offset;
  2125. args[1] = item;
  2126. args[2] = byte_count;
  2127. ssa_emit_global_call(proc, "__mem_copy", args, 3);
  2128. // Increment slice length
  2129. Token add = {Token_Add};
  2130. ssaValue *new_len = ssa_emit_arith(proc, add, len, v_one, t_int);
  2131. ssaValue *gep = ssa_emit_struct_gep(proc, slice_ptr, v_one32, t_int);
  2132. ssa_emit_store(proc, gep, new_len);
  2133. ssa_emit_jump(proc, done);
  2134. gb_array_append(proc->blocks, done);
  2135. proc->curr_block = done;
  2136. return ssa_emit_conv(proc, cond, t_bool, true);
  2137. } break;
  2138. case BuiltinProc_swizzle: {
  2139. ssa_emit_comment(proc, make_string("swizzle"));
  2140. ssaValue *vector = ssa_build_expr(proc, ce->args[0]);
  2141. isize index_count = gb_array_count(ce->args)-1;
  2142. if (index_count == 0) {
  2143. return vector;
  2144. }
  2145. i32 *indices = gb_alloc_array(proc->module->allocator, i32, index_count);
  2146. isize index = 0;
  2147. gb_for_array(i, ce->args) {
  2148. if (i == 0) continue;
  2149. TypeAndValue *tv = type_and_value_of_expression(proc->module->info, ce->args[i]);
  2150. GB_ASSERT(is_type_integer(tv->type));
  2151. GB_ASSERT(tv->value.kind == ExactValue_Integer);
  2152. indices[index++] = cast(i32)tv->value.value_integer;
  2153. }
  2154. return ssa_emit(proc, ssa_make_instr_shuffle_vector(proc, vector, indices, index_count));
  2155. } break;
  2156. case BuiltinProc_ptr_offset: {
  2157. ssa_emit_comment(proc, make_string("ptr_offset"));
  2158. ssaValue *ptr = ssa_build_expr(proc, ce->args[0]);
  2159. ssaValue *offset = ssa_build_expr(proc, ce->args[1]);
  2160. return ssa_emit_ptr_offset(proc, ptr, offset);
  2161. } break;
  2162. case BuiltinProc_ptr_sub: {
  2163. ssa_emit_comment(proc, make_string("ptr_sub"));
  2164. ssaValue *ptr_a = ssa_build_expr(proc, ce->args[0]);
  2165. ssaValue *ptr_b = ssa_build_expr(proc, ce->args[1]);
  2166. Type *ptr_type = base_type(ssa_type(ptr_a));
  2167. GB_ASSERT(ptr_type->kind == Type_Pointer);
  2168. isize elem_size = type_size_of(proc->module->sizes, proc->module->allocator, ptr_type->Pointer.elem);
  2169. Token sub = {Token_Sub};
  2170. ssaValue *v = ssa_emit_arith(proc, sub, ptr_a, ptr_b, t_int);
  2171. if (elem_size > 1) {
  2172. Token quo = {Token_Quo};
  2173. ssaValue *ez = ssa_make_const_int(proc->module->allocator, elem_size);
  2174. v = ssa_emit_arith(proc, quo, v, ez, t_int);
  2175. }
  2176. return v;
  2177. } break;
  2178. case BuiltinProc_slice_ptr: {
  2179. ssa_emit_comment(proc, make_string("slice_ptr"));
  2180. ssaValue *ptr = ssa_build_expr(proc, ce->args[0]);
  2181. ssaValue *len = ssa_build_expr(proc, ce->args[1]);
  2182. ssaValue *cap = len;
  2183. len = ssa_emit_conv(proc, len, t_int, true);
  2184. if (gb_array_count(ce->args) == 3) {
  2185. cap = ssa_build_expr(proc, ce->args[2]);
  2186. cap = ssa_emit_conv(proc, cap, t_int, true);
  2187. }
  2188. Type *slice_type = make_type_slice(proc->module->allocator, type_deref(ssa_type(ptr)));
  2189. ssaValue *slice = ssa_add_local_generated(proc, slice_type);
  2190. ssa_emit_store(proc, ssa_emit_struct_gep(proc, slice, v_zero32, ssa_type(ptr)), ptr);
  2191. ssa_emit_store(proc, ssa_emit_struct_gep(proc, slice, v_one32, t_int), len);
  2192. ssa_emit_store(proc, ssa_emit_struct_gep(proc, slice, v_two32, t_int), cap);
  2193. return ssa_emit_load(proc, slice);
  2194. } break;
  2195. case BuiltinProc_min: {
  2196. ssa_emit_comment(proc, make_string("min"));
  2197. ssaValue *x = ssa_build_expr(proc, ce->args[0]);
  2198. ssaValue *y = ssa_build_expr(proc, ce->args[1]);
  2199. Type *t = base_type(ssa_type(x));
  2200. Token lt = {Token_Lt};
  2201. ssaValue *cond = ssa_emit_comp(proc, lt, x, y);
  2202. return ssa_emit_select(proc, cond, x, y);
  2203. } break;
  2204. case BuiltinProc_max: {
  2205. ssa_emit_comment(proc, make_string("max"));
  2206. ssaValue *x = ssa_build_expr(proc, ce->args[0]);
  2207. ssaValue *y = ssa_build_expr(proc, ce->args[1]);
  2208. Type *t = base_type(ssa_type(x));
  2209. Token gt = {Token_Gt};
  2210. ssaValue *cond = ssa_emit_comp(proc, gt, x, y);
  2211. return ssa_emit_select(proc, cond, x, y);
  2212. } break;
  2213. case BuiltinProc_abs: {
  2214. ssa_emit_comment(proc, make_string("abs"));
  2215. Token lt = {Token_Lt};
  2216. Token sub = {Token_Sub};
  2217. ssaValue *x = ssa_build_expr(proc, ce->args[0]);
  2218. Type *t = ssa_type(x);
  2219. ssaValue *neg_x = ssa_emit_arith(proc, sub, v_zero, x, t);
  2220. ssaValue *cond = ssa_emit_comp(proc, lt, x, v_zero);
  2221. return ssa_emit_select(proc, cond, neg_x, x);
  2222. } break;
  2223. case BuiltinProc_enum_to_string: {
  2224. ssa_emit_comment(proc, make_string("enum_to_string"));
  2225. ssaValue *x = ssa_build_expr(proc, ce->args[0]);
  2226. Type *t = ssa_type(x);
  2227. ssaValue *ti = ssa_type_info(proc, t);
  2228. ssaValue **args = gb_alloc_array(proc->module->allocator, ssaValue *, 2);
  2229. args[0] = ti;
  2230. args[1] = ssa_emit_conv(proc, x, t_i64);
  2231. return ssa_emit_global_call(proc, "__enum_to_string", args, 2);
  2232. } break;
  2233. }
  2234. }
  2235. }
  2236. // NOTE(bill): Regular call
  2237. ssaValue *value = ssa_build_expr(proc, ce->proc);
  2238. Type *proc_type_ = base_type(ssa_type(value));
  2239. GB_ASSERT(proc_type_->kind == Type_Proc);
  2240. auto *type = &proc_type_->Proc;
  2241. isize arg_index = 0;
  2242. isize arg_count = 0;
  2243. gb_for_array(i, ce->args) {
  2244. AstNode *a = ce->args[i];
  2245. Type *at = base_type(type_of_expr(proc->module->info, a));
  2246. if (at->kind == Type_Tuple) {
  2247. arg_count += at->Tuple.variable_count;
  2248. } else {
  2249. arg_count++;
  2250. }
  2251. }
  2252. ssaValue **args = gb_alloc_array(proc->module->allocator, ssaValue *, arg_count);
  2253. b32 variadic = proc_type_->Proc.variadic;
  2254. b32 vari_expand = ce->ellipsis.pos.line != 0;
  2255. gb_for_array(i, ce->args) {
  2256. ssaValue *a = ssa_build_expr(proc, ce->args[i]);
  2257. Type *at = ssa_type(a);
  2258. if (at->kind == Type_Tuple) {
  2259. for (isize i = 0; i < at->Tuple.variable_count; i++) {
  2260. Entity *e = at->Tuple.variables[i];
  2261. ssaValue *v = ssa_emit_struct_ev(proc, a, i, e->type);
  2262. args[arg_index++] = v;
  2263. }
  2264. } else {
  2265. args[arg_index++] = a;
  2266. }
  2267. }
  2268. auto *pt = &type->params->Tuple;
  2269. if (variadic) {
  2270. isize i = 0;
  2271. for (; i < type->param_count-1; i++) {
  2272. args[i] = ssa_emit_conv(proc, args[i], pt->variables[i]->type, true);
  2273. }
  2274. if (!vari_expand) {
  2275. Type *variadic_type = pt->variables[i]->type;
  2276. GB_ASSERT(is_type_slice(variadic_type));
  2277. variadic_type = base_type(variadic_type)->Slice.elem;
  2278. for (; i < arg_count; i++) {
  2279. args[i] = ssa_emit_conv(proc, args[i], variadic_type, true);
  2280. }
  2281. }
  2282. } else {
  2283. for (isize i = 0; i < arg_count; i++) {
  2284. args[i] = ssa_emit_conv(proc, args[i], pt->variables[i]->type, true);
  2285. }
  2286. }
  2287. if (variadic && !vari_expand) {
  2288. ssa_emit_comment(proc, make_string("variadic call argument generation"));
  2289. gbAllocator allocator = proc->module->allocator;
  2290. Type *slice_type = pt->variables[type->param_count-1]->type;
  2291. Type *elem_type = base_type(slice_type)->Slice.elem;
  2292. Type *elem_ptr_type = make_type_pointer(allocator, elem_type);
  2293. ssaValue *slice = ssa_add_local_generated(proc, slice_type);
  2294. isize slice_len = arg_count+1 - type->param_count;
  2295. if (slice_len > 0) {
  2296. ssaValue *base_array = ssa_add_local_generated(proc, make_type_array(allocator, elem_type, slice_len));
  2297. for (isize i = type->param_count-1, j = 0; i < arg_count; i++, j++) {
  2298. ssaValue *addr = ssa_emit_struct_gep(proc, base_array, j, elem_type);
  2299. ssa_emit_store(proc, addr, args[i]);
  2300. }
  2301. ssaValue *base_elem = ssa_emit_struct_gep(proc, base_array, v_zero32, elem_ptr_type);
  2302. ssaValue *slice_elem = ssa_emit_struct_gep(proc, slice, v_zero32, elem_ptr_type);
  2303. ssa_emit_store(proc, slice_elem, base_elem);
  2304. ssaValue *len = ssa_make_const_int(allocator, slice_len);
  2305. ssa_emit_store(proc, ssa_emit_struct_gep(proc, slice, v_one32, t_int), len);
  2306. ssa_emit_store(proc, ssa_emit_struct_gep(proc, slice, v_two32, t_int), len);
  2307. }
  2308. arg_count = type->param_count;
  2309. args[arg_count-1] = ssa_emit_load(proc, slice);
  2310. }
  2311. return ssa_emit_call(proc, value, args, arg_count);
  2312. case_end;
  2313. case_ast_node(se, SliceExpr, expr);
  2314. return ssa_emit_load(proc, ssa_build_addr(proc, expr).addr);
  2315. case_end;
  2316. case_ast_node(ie, IndexExpr, expr);
  2317. return ssa_emit_load(proc, ssa_build_addr(proc, expr).addr);
  2318. case_end;
  2319. }
  2320. GB_PANIC("Unexpected expression: %.*s", LIT(ast_node_strings[expr->kind]));
  2321. return NULL;
  2322. }
  2323. ssaValue *ssa_build_expr(ssaProcedure *proc, AstNode *expr) {
  2324. expr = unparen_expr(expr);
  2325. TypeAndValue *tv = map_get(&proc->module->info->types, hash_pointer(expr));
  2326. GB_ASSERT_NOT_NULL(tv);
  2327. if (tv->value.kind != ExactValue_Invalid) {
  2328. if (tv->value.kind == ExactValue_String) {
  2329. ssa_emit_comment(proc, make_string("Emit string constant"));
  2330. // TODO(bill): Optimize by not allocating everytime
  2331. if (tv->value.value_string.len > 0) {
  2332. return ssa_emit_global_string(proc, tv->value.value_string);
  2333. } else {
  2334. ssaValue *null_string = ssa_add_local_generated(proc, t_string);
  2335. return ssa_emit_load(proc, null_string);
  2336. }
  2337. }
  2338. return ssa_add_module_constant(proc->module, tv->type, tv->value);
  2339. }
  2340. ssaValue *value = NULL;
  2341. if (tv->mode == Addressing_Variable) {
  2342. ssaAddr addr = ssa_build_addr(proc, expr);
  2343. value = ssa_lvalue_load(proc, addr);
  2344. } else {
  2345. value = ssa_build_single_expr(proc, expr, tv);
  2346. }
  2347. return value;
  2348. }
  2349. ssaValue *ssa_add_using_variable(ssaProcedure *proc, Entity *e) {
  2350. GB_ASSERT(e->kind == Entity_Variable && e->Variable.is_using);
  2351. String name = e->token.string;
  2352. Entity *parent = e->using_parent;
  2353. ssaValue *p = NULL;
  2354. if (parent->kind == Entity_Variable && parent->Variable.is_using) {
  2355. p = ssa_add_using_variable(proc, parent);
  2356. }
  2357. Selection sel = lookup_field(proc->module->allocator, parent->type, name, false);
  2358. GB_ASSERT(sel.entity != NULL);
  2359. ssaValue **pv = map_get(&proc->module->values, hash_pointer(parent));
  2360. ssaValue *v = NULL;
  2361. if (pv != NULL) {
  2362. v = *pv;
  2363. } else {
  2364. v = ssa_build_addr(proc, e->using_expr).addr;
  2365. }
  2366. GB_ASSERT(v != NULL);
  2367. ssaValue *var = ssa_emit_deep_field_gep(proc, parent->type, v, sel);
  2368. map_set(&proc->module->values, hash_pointer(e), var);
  2369. return var;
  2370. }
  2371. ssaAddr ssa_build_addr(ssaProcedure *proc, AstNode *expr) {
  2372. switch (expr->kind) {
  2373. case_ast_node(i, Ident, expr);
  2374. if (ssa_is_blank_ident(expr)) {
  2375. ssaAddr val = {};
  2376. return val;
  2377. }
  2378. Entity *e = entity_of_ident(proc->module->info, expr);
  2379. if (e->kind == Entity_Constant) {
  2380. if (base_type(e->type) == t_string) {
  2381. // HACK TODO(bill): This is lazy but it works
  2382. String str = e->Constant.value.value_string;
  2383. ssaValue *global_array = ssa_add_global_string_array(proc->module, str);
  2384. ssaValue *elem = ssa_array_elem(proc, global_array);
  2385. ssaValue *len = ssa_make_const_int(proc->module->allocator, str.len);
  2386. ssaValue *v = ssa_add_local_generated(proc, e->type);
  2387. ssaValue *str_elem = ssa_emit_struct_gep(proc, v, v_zero32, ssa_type(elem));
  2388. ssaValue *str_len = ssa_emit_struct_gep(proc, v, v_one32, t_int);
  2389. ssa_emit_store(proc, str_elem, elem);
  2390. ssa_emit_store(proc, str_len, len);
  2391. return ssa_make_addr(v, expr);
  2392. }
  2393. }
  2394. ssaValue *v = NULL;
  2395. ssaValue **found = map_get(&proc->module->values, hash_pointer(e));
  2396. if (found) {
  2397. v = *found;
  2398. } else if (e->kind == Entity_Variable && e->Variable.is_using) {
  2399. v = ssa_add_using_variable(proc, e);
  2400. }
  2401. if (v == NULL) {
  2402. GB_PANIC("Unknown value: %s, entity: %p\n", expr_to_string(expr), e);
  2403. }
  2404. return ssa_make_addr(v, expr);
  2405. case_end;
  2406. case_ast_node(pe, ParenExpr, expr);
  2407. return ssa_build_addr(proc, unparen_expr(expr));
  2408. case_end;
  2409. case_ast_node(se, SelectorExpr, expr);
  2410. ssa_emit_comment(proc, make_string("SelectorExpr"));
  2411. String selector = unparen_expr(se->selector)->Ident.string;
  2412. Type *type = base_type(type_of_expr(proc->module->info, se->expr));
  2413. if (type == t_invalid) {
  2414. // NOTE(bill): Imports
  2415. Entity *imp = entity_of_ident(proc->module->info, se->expr);
  2416. if (imp != NULL) {
  2417. GB_ASSERT(imp->kind == Entity_ImportName);
  2418. }
  2419. return ssa_build_addr(proc, unparen_expr(se->selector));
  2420. } else {
  2421. Selection sel = lookup_field(proc->module->allocator, type, selector, false);
  2422. GB_ASSERT(sel.entity != NULL);
  2423. ssaValue *a = ssa_build_addr(proc, se->expr).addr;
  2424. a = ssa_emit_deep_field_gep(proc, type, a, sel);
  2425. return ssa_make_addr(a, expr);
  2426. }
  2427. case_end;
  2428. case_ast_node(ue, UnaryExpr, expr);
  2429. switch (ue->op.kind) {
  2430. case Token_Pointer: {
  2431. return ssa_build_addr(proc, ue->expr);
  2432. }
  2433. default:
  2434. GB_PANIC("Invalid unary expression for ssa_build_addr");
  2435. }
  2436. case_end;
  2437. case_ast_node(be, BinaryExpr, expr);
  2438. switch (be->op.kind) {
  2439. case Token_as: {
  2440. ssa_emit_comment(proc, make_string("Cast - as"));
  2441. // NOTE(bill): Needed for dereference of pointer conversion
  2442. Type *type = type_of_expr(proc->module->info, expr);
  2443. ssaValue *v = ssa_add_local_generated(proc, type);
  2444. ssa_emit_store(proc, v, ssa_emit_conv(proc, ssa_build_expr(proc, be->left), type));
  2445. return ssa_make_addr(v, expr);
  2446. }
  2447. case Token_transmute: {
  2448. ssa_emit_comment(proc, make_string("Cast - transmute"));
  2449. // NOTE(bill): Needed for dereference of pointer conversion
  2450. Type *type = type_of_expr(proc->module->info, expr);
  2451. ssaValue *v = ssa_add_local_generated(proc, type);
  2452. ssa_emit_store(proc, v, ssa_emit_transmute(proc, ssa_build_expr(proc, be->left), type));
  2453. return ssa_make_addr(v, expr);
  2454. }
  2455. default:
  2456. GB_PANIC("Invalid binary expression for ssa_build_addr: %.*s\n", LIT(be->op.string));
  2457. break;
  2458. }
  2459. case_end;
  2460. case_ast_node(ie, IndexExpr, expr);
  2461. ssa_emit_comment(proc, make_string("IndexExpr"));
  2462. Type *t = base_type(type_of_expr(proc->module->info, ie->expr));
  2463. gbAllocator a = proc->module->allocator;
  2464. b32 deref = is_type_pointer(t);
  2465. t = type_deref(t);
  2466. ssaValue *using_addr = NULL;
  2467. if (!is_type_indexable(t)) {
  2468. // Using index expression
  2469. Entity *using_field = find_using_index_expr(t);
  2470. if (using_field != NULL) {
  2471. Selection sel = lookup_field(a, t, using_field->token.string, false);
  2472. ssaValue *e = ssa_build_addr(proc, ie->expr).addr;
  2473. using_addr = ssa_emit_deep_field_gep(proc, t, e, sel);
  2474. t = using_field->type;
  2475. }
  2476. }
  2477. switch (t->kind) {
  2478. case Type_Vector: {
  2479. ssaValue *vector = NULL;
  2480. if (using_addr != NULL) {
  2481. vector = using_addr;
  2482. } else {
  2483. vector = ssa_build_addr(proc, ie->expr).addr;
  2484. if (deref) {
  2485. vector = ssa_emit_load(proc, vector);
  2486. }
  2487. }
  2488. ssaValue *index = ssa_emit_conv(proc, ssa_build_expr(proc, ie->index), t_int);
  2489. ssaValue *len = ssa_make_const_int(a, t->Vector.count);
  2490. ssa_array_bounds_check(proc, ast_node_token(ie->index), index, len);
  2491. return ssa_make_addr_vector(vector, index, expr);
  2492. } break;
  2493. case Type_Array: {
  2494. ssaValue *array = NULL;
  2495. if (using_addr != NULL) {
  2496. array = using_addr;
  2497. } else {
  2498. array = ssa_build_addr(proc, ie->expr).addr;
  2499. if (deref) {
  2500. array = ssa_emit_load(proc, array);
  2501. }
  2502. }
  2503. Type *et = make_type_pointer(proc->module->allocator, t->Array.elem);
  2504. ssaValue *index = ssa_emit_conv(proc, ssa_build_expr(proc, ie->index), t_int);
  2505. ssaValue *elem = ssa_emit_struct_gep(proc, array, index, et);
  2506. ssaValue *len = ssa_make_const_int(a, t->Vector.count);
  2507. ssa_array_bounds_check(proc, ast_node_token(ie->index), index, len);
  2508. return ssa_make_addr(elem, expr);
  2509. } break;
  2510. case Type_Slice: {
  2511. ssaValue *slice = NULL;
  2512. if (using_addr != NULL) {
  2513. slice = ssa_emit_load(proc, using_addr);
  2514. } else {
  2515. slice = ssa_build_expr(proc, ie->expr);
  2516. if (deref) {
  2517. slice = ssa_emit_load(proc, slice);
  2518. }
  2519. }
  2520. ssaValue *elem = ssa_slice_elem(proc, slice);
  2521. ssaValue *len = ssa_slice_len(proc, slice);
  2522. ssaValue *index = ssa_emit_conv(proc, ssa_build_expr(proc, ie->index), t_int);
  2523. ssa_array_bounds_check(proc, ast_node_token(ie->index), index, len);
  2524. ssaValue *v = ssa_emit_ptr_offset(proc, elem, index);
  2525. return ssa_make_addr(v, expr);
  2526. } break;
  2527. case Type_Basic: { // Basic_string
  2528. TypeAndValue *tv = map_get(&proc->module->info->types, hash_pointer(ie->expr));
  2529. ssaValue *elem = NULL;
  2530. ssaValue *len = NULL;
  2531. if (tv != NULL && tv->mode == Addressing_Constant) {
  2532. ssaValue *array = ssa_add_global_string_array(proc->module, tv->value.value_string);
  2533. elem = ssa_array_elem(proc, array);
  2534. len = ssa_make_const_int(a, tv->value.value_string.len);
  2535. } else {
  2536. ssaValue *str = NULL;
  2537. if (using_addr != NULL) {
  2538. str = ssa_emit_load(proc, using_addr);
  2539. } else {
  2540. str = ssa_build_expr(proc, ie->expr);
  2541. if (deref) {
  2542. str = ssa_emit_load(proc, str);
  2543. }
  2544. }
  2545. elem = ssa_string_elem(proc, str);
  2546. len = ssa_string_len(proc, str);
  2547. }
  2548. ssaValue *index = ssa_emit_conv(proc, ssa_build_expr(proc, ie->index), t_int);
  2549. ssa_array_bounds_check(proc, ast_node_token(ie->index), index, len);
  2550. ssaValue *v = ssa_emit_ptr_offset(proc, elem, index);
  2551. return ssa_make_addr(v, expr);
  2552. } break;
  2553. }
  2554. case_end;
  2555. case_ast_node(se, SliceExpr, expr);
  2556. ssa_emit_comment(proc, make_string("SliceExpr"));
  2557. gbAllocator a = proc->module->allocator;
  2558. ssaValue *low = v_zero;
  2559. ssaValue *high = NULL;
  2560. ssaValue *max = NULL;
  2561. if (se->low != NULL) low = ssa_build_expr(proc, se->low);
  2562. if (se->high != NULL) high = ssa_build_expr(proc, se->high);
  2563. if (se->triple_indexed) max = ssa_build_expr(proc, se->max);
  2564. ssaValue *addr = ssa_build_addr(proc, se->expr).addr;
  2565. ssaValue *base = ssa_emit_load(proc, addr);
  2566. Type *type = base_type(ssa_type(base));
  2567. if (is_type_pointer(type)) {
  2568. type = type_deref(type);
  2569. addr = base;
  2570. base = ssa_emit_load(proc, base);
  2571. }
  2572. // TODO(bill): Cleanup like mad!
  2573. switch (type->kind) {
  2574. case Type_Slice: {
  2575. Type *slice_type = type;
  2576. if (high == NULL) high = ssa_slice_len(proc, base);
  2577. if (max == NULL) max = ssa_slice_cap(proc, base);
  2578. GB_ASSERT(max != NULL);
  2579. ssa_slice_bounds_check(proc, se->open, low, high, max, false);
  2580. Token op_sub = {Token_Sub};
  2581. ssaValue *elem = ssa_slice_elem(proc, base);
  2582. ssaValue *len = ssa_emit_arith(proc, op_sub, high, low, t_int);
  2583. ssaValue *cap = ssa_emit_arith(proc, op_sub, max, low, t_int);
  2584. ssaValue *slice = ssa_add_local_generated(proc, slice_type);
  2585. ssaValue *gep0 = ssa_emit_struct_gep(proc, slice, v_zero32, ssa_type(elem));
  2586. ssaValue *gep1 = ssa_emit_struct_gep(proc, slice, v_one32, t_int);
  2587. ssaValue *gep2 = ssa_emit_struct_gep(proc, slice, v_two32, t_int);
  2588. ssa_emit_store(proc, gep0, elem);
  2589. ssa_emit_store(proc, gep1, len);
  2590. ssa_emit_store(proc, gep2, cap);
  2591. return ssa_make_addr(slice, expr);
  2592. }
  2593. case Type_Array: {
  2594. Type *slice_type = make_type_slice(a, type->Array.elem);
  2595. if (high == NULL) high = ssa_array_len(proc, base);
  2596. if (max == NULL) max = ssa_array_cap(proc, base);
  2597. GB_ASSERT(max != NULL);
  2598. ssa_slice_bounds_check(proc, se->open, low, high, max, false);
  2599. Token op_sub = {Token_Sub};
  2600. ssaValue *elem = ssa_array_elem(proc, addr);
  2601. ssaValue *len = ssa_emit_arith(proc, op_sub, high, low, t_int);
  2602. ssaValue *cap = ssa_emit_arith(proc, op_sub, max, low, t_int);
  2603. ssaValue *slice = ssa_add_local_generated(proc, slice_type);
  2604. ssaValue *gep0 = ssa_emit_struct_gep(proc, slice, v_zero32, ssa_type(elem));
  2605. ssaValue *gep1 = ssa_emit_struct_gep(proc, slice, v_one32, t_int);
  2606. ssaValue *gep2 = ssa_emit_struct_gep(proc, slice, v_two32, t_int);
  2607. ssa_emit_store(proc, gep0, elem);
  2608. ssa_emit_store(proc, gep1, len);
  2609. ssa_emit_store(proc, gep2, cap);
  2610. return ssa_make_addr(slice, expr);
  2611. }
  2612. case Type_Basic: {
  2613. GB_ASSERT(type == t_string);
  2614. if (high == NULL) {
  2615. high = ssa_string_len(proc, base);
  2616. }
  2617. ssa_slice_bounds_check(proc, se->open, low, high, high, true);
  2618. Token op_sub = {Token_Sub};
  2619. ssaValue *elem, *len;
  2620. len = ssa_emit_arith(proc, op_sub, high, low, t_int);
  2621. elem = ssa_string_elem(proc, base);
  2622. elem = ssa_emit_ptr_offset(proc, elem, low);
  2623. ssaValue *str = ssa_add_local_generated(proc, t_string);
  2624. ssaValue *gep0 = ssa_emit_struct_gep(proc, str, v_zero32, ssa_type(elem));
  2625. ssaValue *gep1 = ssa_emit_struct_gep(proc, str, v_one32, t_int);
  2626. ssa_emit_store(proc, gep0, elem);
  2627. ssa_emit_store(proc, gep1, len);
  2628. return ssa_make_addr(str, expr);
  2629. } break;
  2630. }
  2631. GB_PANIC("Unknown slicable type");
  2632. case_end;
  2633. case_ast_node(de, DerefExpr, expr);
  2634. ssaValue *e = ssa_build_expr(proc, de->expr);
  2635. // TODO(bill): Is a ptr copy needed?
  2636. ssaValue *gep = ssa_emit_zero_gep(proc, e);
  2637. return ssa_make_addr(gep, expr);
  2638. case_end;
  2639. case_ast_node(ce, CallExpr, expr);
  2640. ssaValue *e = ssa_build_expr(proc, expr);
  2641. ssaValue *v = ssa_add_local_generated(proc, ssa_type(e));
  2642. ssa_emit_store(proc, v, e);
  2643. return ssa_make_addr(v, expr);
  2644. case_end;
  2645. }
  2646. TokenPos token_pos = ast_node_token(expr).pos;
  2647. GB_PANIC("Unexpected address expression\n"
  2648. "\tAstNode: %.*s @ "
  2649. "%.*s(%td:%td)\n",
  2650. LIT(ast_node_strings[expr->kind]),
  2651. LIT(token_pos.file), token_pos.line, token_pos.column);
  2652. return ssa_make_addr(NULL, NULL);
  2653. }
  2654. void ssa_build_assign_op(ssaProcedure *proc, ssaAddr lhs, ssaValue *value, Token op) {
  2655. ssaValue *old_value = ssa_lvalue_load(proc, lhs);
  2656. Type *type = ssa_type(old_value);
  2657. ssaValue *change = ssa_emit_conv(proc, value, type);
  2658. ssaValue *new_value = ssa_emit_arith(proc, op, old_value, change, type);
  2659. ssa_lvalue_store(proc, lhs, new_value);
  2660. }
  2661. void ssa_build_cond(ssaProcedure *proc, AstNode *cond, ssaBlock *true_block, ssaBlock *false_block) {
  2662. switch (cond->kind) {
  2663. case_ast_node(pe, ParenExpr, cond);
  2664. ssa_build_cond(proc, pe->expr, true_block, false_block);
  2665. return;
  2666. case_end;
  2667. case_ast_node(ue, UnaryExpr, cond);
  2668. if (ue->op.kind == Token_Not) {
  2669. ssa_build_cond(proc, ue->expr, false_block, true_block);
  2670. return;
  2671. }
  2672. case_end;
  2673. case_ast_node(be, BinaryExpr, cond);
  2674. if (be->op.kind == Token_CmpAnd) {
  2675. ssaBlock *block = ssa_add_block(proc, NULL, make_string("cmp.and"));
  2676. ssa_build_cond(proc, be->left, block, false_block);
  2677. proc->curr_block = block;
  2678. ssa_build_cond(proc, be->right, true_block, false_block);
  2679. return;
  2680. } else if (be->op.kind == Token_CmpOr) {
  2681. ssaBlock *block = ssa_add_block(proc, NULL, make_string("cmp.or"));
  2682. ssa_build_cond(proc, be->left, true_block, block);
  2683. proc->curr_block = block;
  2684. ssa_build_cond(proc, be->right, true_block, false_block);
  2685. return;
  2686. }
  2687. case_end;
  2688. }
  2689. ssaValue *expr = ssa_build_expr(proc, cond);
  2690. ssa_emit_if(proc, expr, true_block, false_block);
  2691. }
  2692. void ssa_gen_global_type_name(ssaModule *m, Entity *e, String name);
  2693. void ssa_mangle_sub_type_name(ssaModule *m, Entity *field, String parent) {
  2694. if (field->kind != Entity_TypeName) {
  2695. return;
  2696. }
  2697. auto *tn = &field->type->Named;
  2698. String cn = field->token.string;
  2699. isize len = parent.len + 1 + cn.len;
  2700. String child = {NULL, len};
  2701. child.text = gb_alloc_array(m->allocator, u8, len);
  2702. isize i = 0;
  2703. gb_memcopy(child.text+i, parent.text, parent.len);
  2704. i += parent.len;
  2705. child.text[i++] = '.';
  2706. gb_memcopy(child.text+i, cn.text, cn.len);
  2707. map_set(&m->type_names, hash_pointer(field->type), child);
  2708. ssa_gen_global_type_name(m, field, child);
  2709. }
  2710. void ssa_gen_global_type_name(ssaModule *m, Entity *e, String name) {
  2711. ssaValue *t = ssa_make_value_type_name(m->allocator, name, e->type);
  2712. ssa_module_add_value(m, e, t);
  2713. map_set(&m->members, hash_string(name), t);
  2714. Type *bt = base_type(e->type);
  2715. if (bt->kind == Type_Record) {
  2716. auto *s = &bt->Record;
  2717. for (isize j = 0; j < s->other_field_count; j++) {
  2718. ssa_mangle_sub_type_name(m, s->other_fields[j], name);
  2719. }
  2720. }
  2721. if (is_type_union(bt)) {
  2722. auto *s = &bt->Record;
  2723. // NOTE(bill): Zeroth entry is null (for `match type` stmts)
  2724. for (isize j = 1; j < s->field_count; j++) {
  2725. ssa_mangle_sub_type_name(m, s->fields[j], name);
  2726. }
  2727. }
  2728. }
  2729. void ssa_build_stmt_list(ssaProcedure *proc, AstNodeArray stmts) {
  2730. gb_for_array(i, stmts) {
  2731. ssa_build_stmt(proc, stmts[i]);
  2732. }
  2733. }
  2734. void ssa_build_stmt(ssaProcedure *proc, AstNode *node) {
  2735. u32 prev_stmt_state_flags = proc->module->stmt_state_flags;
  2736. defer (proc->module->stmt_state_flags = prev_stmt_state_flags);
  2737. if (node->stmt_state_flags != 0) {
  2738. u32 in = node->stmt_state_flags;
  2739. u32 out = proc->module->stmt_state_flags;
  2740. defer (proc->module->stmt_state_flags = out);
  2741. if (in & StmtStateFlag_bounds_check) {
  2742. out |= StmtStateFlag_bounds_check;
  2743. out &= ~StmtStateFlag_no_bounds_check;
  2744. } else if (in & StmtStateFlag_no_bounds_check) {
  2745. out |= StmtStateFlag_no_bounds_check;
  2746. out &= ~StmtStateFlag_bounds_check;
  2747. }
  2748. }
  2749. switch (node->kind) {
  2750. case_ast_node(bs, EmptyStmt, node);
  2751. case_end;
  2752. case_ast_node(us, UsingStmt, node);
  2753. AstNode *decl = unparen_expr(us->node);
  2754. if (decl->kind == AstNode_VarDecl) {
  2755. ssa_build_stmt(proc, decl);
  2756. }
  2757. case_end;
  2758. case_ast_node(vd, VarDecl, node);
  2759. ssaModule *m = proc->module;
  2760. gbTempArenaMemory tmp = gb_temp_arena_memory_begin(&m->tmp_arena);
  2761. defer (gb_temp_arena_memory_end(tmp));
  2762. if (gb_array_count(vd->values) == 0) { // declared and zero-initialized
  2763. gb_for_array(i, vd->names) {
  2764. AstNode *name = vd->names[i];
  2765. if (!ssa_is_blank_ident(name)) {
  2766. ssa_add_local_for_identifier(proc, name, true);
  2767. }
  2768. }
  2769. } else { // Tuple(s)
  2770. gbArray(ssaAddr) lvals;
  2771. gbArray(ssaValue *) inits;
  2772. gb_array_init_reserve(lvals, m->tmp_allocator, gb_array_count(vd->names));
  2773. gb_array_init_reserve(inits, m->tmp_allocator, gb_array_count(vd->names));
  2774. gb_for_array(i, vd->names) {
  2775. AstNode *name = vd->names[i];
  2776. ssaAddr lval = ssa_make_addr(NULL, NULL);
  2777. if (!ssa_is_blank_ident(name)) {
  2778. ssa_add_local_for_identifier(proc, name, false);
  2779. lval = ssa_build_addr(proc, name);
  2780. }
  2781. gb_array_append(lvals, lval);
  2782. }
  2783. gb_for_array(i, vd->values) {
  2784. ssaValue *init = ssa_build_expr(proc, vd->values[i]);
  2785. Type *t = ssa_type(init);
  2786. if (t->kind == Type_Tuple) {
  2787. for (isize i = 0; i < t->Tuple.variable_count; i++) {
  2788. Entity *e = t->Tuple.variables[i];
  2789. ssaValue *v = ssa_emit_struct_ev(proc, init, i, e->type);
  2790. gb_array_append(inits, v);
  2791. }
  2792. } else {
  2793. gb_array_append(inits, init);
  2794. }
  2795. }
  2796. gb_for_array(i, inits) {
  2797. ssaValue *v = ssa_emit_conv(proc, inits[i], ssa_addr_type(lvals[i]));
  2798. ssa_lvalue_store(proc, lvals[i], v);
  2799. }
  2800. }
  2801. case_end;
  2802. case_ast_node(pd, ProcDecl, node);
  2803. if (pd->body != NULL) {
  2804. auto *info = proc->module->info;
  2805. Entity **found = map_get(&info->definitions, hash_pointer(pd->name));
  2806. GB_ASSERT_MSG(found != NULL, "Unable to find: %.*s", LIT(pd->name->Ident.string));
  2807. Entity *e = *found;
  2808. // NOTE(bill): Generate a new name
  2809. // parent.name-guid
  2810. String original_name = pd->name->Ident.string;
  2811. String pd_name = original_name;
  2812. if (pd->link_name.len > 0) {
  2813. pd_name = pd->link_name;
  2814. }
  2815. isize name_len = proc->name.len + 1 + pd_name.len + 1 + 10 + 1;
  2816. u8 *name_text = gb_alloc_array(proc->module->allocator, u8, name_len);
  2817. i32 guid = cast(i32)gb_array_count(proc->children);
  2818. name_len = gb_snprintf(cast(char *)name_text, name_len, "%.*s.%.*s-%d", LIT(proc->name), LIT(pd_name), guid);
  2819. String name = make_string(name_text, name_len-1);
  2820. ssaValue *value = ssa_make_value_procedure(proc->module->allocator,
  2821. proc->module, e, e->type, pd->type, pd->body, name);
  2822. value->Proc.tags = pd->tags;
  2823. value->Proc.parent = proc;
  2824. ssa_module_add_value(proc->module, e, value);
  2825. gb_array_append(proc->children, &value->Proc);
  2826. gb_array_append(proc->module->procs, value);
  2827. } else {
  2828. auto *info = proc->module->info;
  2829. Entity **found = map_get(&info->definitions, hash_pointer(pd->name));
  2830. GB_ASSERT_MSG(found != NULL, "Unable to find: %.*s", LIT(pd->name->Ident.string));
  2831. Entity *e = *found;
  2832. // FFI - Foreign function interace
  2833. String original_name = pd->name->Ident.string;
  2834. String name = original_name;
  2835. if (pd->foreign_name.len > 0) {
  2836. name = pd->foreign_name;
  2837. }
  2838. ssaValue *value = ssa_make_value_procedure(proc->module->allocator,
  2839. proc->module, e, e->type, pd->type, pd->body, name);
  2840. value->Proc.tags = pd->tags;
  2841. ssa_module_add_value(proc->module, e, value);
  2842. ssa_build_proc(value, proc);
  2843. if (value->Proc.tags & ProcTag_foreign) {
  2844. HashKey key = hash_string(name);
  2845. auto *prev_value = map_get(&proc->module->members, key);
  2846. if (prev_value == NULL) {
  2847. // NOTE(bill): Don't do mutliple declarations in the IR
  2848. map_set(&proc->module->members, key, value);
  2849. }
  2850. } else {
  2851. gb_array_append(proc->children, &value->Proc);
  2852. }
  2853. }
  2854. case_end;
  2855. case_ast_node(td, TypeDecl, node);
  2856. // NOTE(bill): Generate a new name
  2857. // parent_proc.name-guid
  2858. String td_name = td->name->Ident.string;
  2859. isize name_len = proc->name.len + 1 + td_name.len + 1 + 10 + 1;
  2860. u8 *name_text = gb_alloc_array(proc->module->allocator, u8, name_len);
  2861. i32 guid = cast(i32)gb_array_count(proc->module->members.entries);
  2862. name_len = gb_snprintf(cast(char *)name_text, name_len, "%.*s.%.*s-%d", LIT(proc->name), LIT(td_name), guid);
  2863. String name = make_string(name_text, name_len-1);
  2864. Entity **found = map_get(&proc->module->info->definitions, hash_pointer(td->name));
  2865. GB_ASSERT(found != NULL);
  2866. Entity *e = *found;
  2867. ssaValue *value = ssa_make_value_type_name(proc->module->allocator,
  2868. name, e->type);
  2869. map_set(&proc->module->type_names, hash_pointer(e->type), name);
  2870. ssa_gen_global_type_name(proc->module, e, name);
  2871. case_end;
  2872. case_ast_node(ids, IncDecStmt, node);
  2873. ssa_emit_comment(proc, make_string("IncDecStmt"));
  2874. Token op = ids->op;
  2875. if (op.kind == Token_Increment) {
  2876. op.kind = Token_Add;
  2877. } else if (op.kind == Token_Decrement) {
  2878. op.kind = Token_Sub;
  2879. }
  2880. ssaAddr lval = ssa_build_addr(proc, ids->expr);
  2881. ssaValue *one = ssa_emit_conv(proc, v_one, ssa_addr_type(lval));
  2882. ssa_build_assign_op(proc, lval, one, op);
  2883. case_end;
  2884. case_ast_node(as, AssignStmt, node);
  2885. ssa_emit_comment(proc, make_string("AssignStmt"));
  2886. ssaModule *m = proc->module;
  2887. gbTempArenaMemory tmp = gb_temp_arena_memory_begin(&m->tmp_arena);
  2888. defer (gb_temp_arena_memory_end(tmp));
  2889. switch (as->op.kind) {
  2890. case Token_Eq: {
  2891. gbArray(ssaAddr) lvals;
  2892. gb_array_init(lvals, m->tmp_allocator);
  2893. gb_for_array(i, as->lhs) {
  2894. AstNode *lhs = as->lhs[i];
  2895. ssaAddr lval = {};
  2896. if (!ssa_is_blank_ident(lhs)) {
  2897. lval = ssa_build_addr(proc, lhs);
  2898. }
  2899. gb_array_append(lvals, lval);
  2900. }
  2901. if (gb_array_count(as->lhs) == gb_array_count(as->rhs)) {
  2902. if (gb_array_count(as->lhs) == 1) {
  2903. AstNode *rhs = as->rhs[0];
  2904. ssaValue *init = ssa_build_expr(proc, rhs);
  2905. ssa_lvalue_store(proc, lvals[0], init);
  2906. } else {
  2907. gbArray(ssaValue *) inits;
  2908. gb_array_init_reserve(inits, m->tmp_allocator, gb_array_count(lvals));
  2909. gb_for_array(i, as->rhs) {
  2910. ssaValue *init = ssa_build_expr(proc, as->rhs[i]);
  2911. gb_array_append(inits, init);
  2912. }
  2913. gb_for_array(i, inits) {
  2914. ssa_lvalue_store(proc, lvals[i], inits[i]);
  2915. }
  2916. }
  2917. } else {
  2918. gbArray(ssaValue *) inits;
  2919. gb_array_init_reserve(inits, m->tmp_allocator, gb_array_count(lvals));
  2920. gb_for_array(i, as->rhs) {
  2921. ssaValue *init = ssa_build_expr(proc, as->rhs[i]);
  2922. Type *t = ssa_type(init);
  2923. // TODO(bill): refactor for code reuse as this is repeated a bit
  2924. if (t->kind == Type_Tuple) {
  2925. for (isize i = 0; i < t->Tuple.variable_count; i++) {
  2926. Entity *e = t->Tuple.variables[i];
  2927. ssaValue *v = ssa_emit_struct_ev(proc, init, i, e->type);
  2928. gb_array_append(inits, v);
  2929. }
  2930. } else {
  2931. gb_array_append(inits, init);
  2932. }
  2933. }
  2934. gb_for_array(i, inits) {
  2935. ssa_lvalue_store(proc, lvals[i], inits[i]);
  2936. }
  2937. }
  2938. } break;
  2939. default: {
  2940. // NOTE(bill): Only 1 += 1 is allowed, no tuples
  2941. // +=, -=, etc
  2942. Token op = as->op;
  2943. i32 kind = op.kind;
  2944. kind += Token_Add - Token_AddEq; // Convert += to +
  2945. op.kind = cast(TokenKind)kind;
  2946. ssaAddr lhs = ssa_build_addr(proc, as->lhs[0]);
  2947. ssaValue *value = ssa_build_expr(proc, as->rhs[0]);
  2948. ssa_build_assign_op(proc, lhs, value, op);
  2949. } break;
  2950. }
  2951. case_end;
  2952. case_ast_node(es, ExprStmt, node);
  2953. // NOTE(bill): No need to use return value
  2954. ssa_build_expr(proc, es->expr);
  2955. case_end;
  2956. case_ast_node(bs, BlockStmt, node);
  2957. ssa_open_scope(proc);
  2958. ssa_build_stmt_list(proc, bs->stmts);
  2959. ssa_close_scope(proc, ssaDeferExit_Default, NULL);
  2960. case_end;
  2961. case_ast_node(ds, DeferStmt, node);
  2962. ssa_emit_comment(proc, make_string("DeferStmt"));
  2963. isize scope_index = proc->scope_index;
  2964. if (ds->stmt->kind == AstNode_BlockStmt) {
  2965. scope_index--;
  2966. }
  2967. ssa_add_defer_node(proc, scope_index, ds->stmt);
  2968. case_end;
  2969. case_ast_node(rs, ReturnStmt, node);
  2970. ssa_emit_comment(proc, make_string("ReturnStmt"));
  2971. ssaValue *v = NULL;
  2972. auto *return_type_tuple = &proc->type->Proc.results->Tuple;
  2973. isize return_count = proc->type->Proc.result_count;
  2974. if (return_count == 0) {
  2975. // No return values
  2976. } else if (return_count == 1) {
  2977. Entity *e = return_type_tuple->variables[0];
  2978. v = ssa_emit_conv(proc, ssa_build_expr(proc, rs->results[0]), e->type);
  2979. } else {
  2980. gbTempArenaMemory tmp = gb_temp_arena_memory_begin(&proc->module->tmp_arena);
  2981. defer (gb_temp_arena_memory_end(tmp));
  2982. gbArray(ssaValue *) results;
  2983. gb_array_init_reserve(results, proc->module->tmp_allocator, return_count);
  2984. gb_for_array(res_index, rs->results) {
  2985. ssaValue *res = ssa_build_expr(proc, rs->results[res_index]);
  2986. Type *t = ssa_type(res);
  2987. if (t->kind == Type_Tuple) {
  2988. for (isize i = 0; i < t->Tuple.variable_count; i++) {
  2989. Entity *e = t->Tuple.variables[i];
  2990. ssaValue *v = ssa_emit_struct_ev(proc, res, i, e->type);
  2991. gb_array_append(results, v);
  2992. }
  2993. } else {
  2994. gb_array_append(results, res);
  2995. }
  2996. }
  2997. Type *ret_type = proc->type->Proc.results;
  2998. v = ssa_add_local_generated(proc, ret_type);
  2999. gb_for_array(i, results) {
  3000. Entity *e = return_type_tuple->variables[i];
  3001. ssaValue *res = ssa_emit_conv(proc, results[i], e->type);
  3002. ssaValue *field = ssa_emit_struct_gep(proc, v, i, make_type_pointer(proc->module->allocator, e->type));
  3003. ssa_emit_store(proc, field, res);
  3004. }
  3005. v = ssa_emit_load(proc, v);
  3006. }
  3007. ssa_emit_ret(proc, v);
  3008. case_end;
  3009. case_ast_node(is, IfStmt, node);
  3010. ssa_emit_comment(proc, make_string("IfStmt"));
  3011. if (is->init != NULL) {
  3012. ssaBlock *init = ssa_add_block(proc, node, make_string("if.init"));
  3013. ssa_emit_jump(proc, init);
  3014. proc->curr_block = init;
  3015. ssa_build_stmt(proc, is->init);
  3016. }
  3017. ssaBlock *then = ssa_add_block(proc, node, make_string("if.then"));
  3018. ssaBlock *done = ssa__make_block(proc, node, make_string("if.done")); // NOTE(bill): Append later
  3019. ssaBlock *else_ = done;
  3020. if (is->else_stmt != NULL) {
  3021. else_ = ssa_add_block(proc, is->else_stmt, make_string("if.else"));
  3022. }
  3023. ssa_build_cond(proc, is->cond, then, else_);
  3024. proc->curr_block = then;
  3025. ssa_open_scope(proc);
  3026. ssa_build_stmt(proc, is->body);
  3027. ssa_close_scope(proc, ssaDeferExit_Default, NULL);
  3028. ssa_emit_jump(proc, done);
  3029. if (is->else_stmt != NULL) {
  3030. proc->curr_block = else_;
  3031. ssa_open_scope(proc);
  3032. ssa_build_stmt(proc, is->else_stmt);
  3033. ssa_close_scope(proc, ssaDeferExit_Default, NULL);
  3034. ssa_emit_jump(proc, done);
  3035. }
  3036. gb_array_append(proc->blocks, done);
  3037. proc->curr_block = done;
  3038. case_end;
  3039. case_ast_node(fs, ForStmt, node);
  3040. ssa_emit_comment(proc, make_string("ForStmt"));
  3041. if (fs->init != NULL) {
  3042. ssaBlock *init = ssa_add_block(proc, node, make_string("for.init"));
  3043. ssa_emit_jump(proc, init);
  3044. proc->curr_block = init;
  3045. ssa_build_stmt(proc, fs->init);
  3046. }
  3047. ssaBlock *body = ssa_add_block(proc, node, make_string("for.body"));
  3048. ssaBlock *done = ssa__make_block(proc, node, make_string("for.done")); // NOTE(bill): Append later
  3049. ssaBlock *loop = body;
  3050. if (fs->cond != NULL) {
  3051. loop = ssa_add_block(proc, node, make_string("for.loop"));
  3052. }
  3053. ssaBlock *cont = loop;
  3054. if (fs->post != NULL) {
  3055. cont = ssa_add_block(proc, node, make_string("for.post"));
  3056. }
  3057. ssa_emit_jump(proc, loop);
  3058. proc->curr_block = loop;
  3059. if (loop != body) {
  3060. ssa_build_cond(proc, fs->cond, body, done);
  3061. proc->curr_block = body;
  3062. }
  3063. ssa_push_target_list(proc, done, cont, NULL);
  3064. ssa_open_scope(proc);
  3065. ssa_build_stmt(proc, fs->body);
  3066. ssa_close_scope(proc, ssaDeferExit_Default, NULL);
  3067. ssa_pop_target_list(proc);
  3068. ssa_emit_jump(proc, cont);
  3069. if (fs->post != NULL) {
  3070. proc->curr_block = cont;
  3071. ssa_build_stmt(proc, fs->post);
  3072. ssa_emit_jump(proc, loop);
  3073. }
  3074. gb_array_append(proc->blocks, done);
  3075. proc->curr_block = done;
  3076. case_end;
  3077. case_ast_node(ms, MatchStmt, node);
  3078. ssa_emit_comment(proc, make_string("MatchStmt"));
  3079. if (ms->init != NULL) {
  3080. ssa_build_stmt(proc, ms->init);
  3081. }
  3082. ssaValue *tag = v_true;
  3083. if (ms->tag != NULL) {
  3084. tag = ssa_build_expr(proc, ms->tag);
  3085. }
  3086. ssaBlock *done = ssa__make_block(proc, node, make_string("match.done")); // NOTE(bill): Append later
  3087. ast_node(body, BlockStmt, ms->body);
  3088. AstNodeArray default_stmts = NULL;
  3089. ssaBlock *default_fall = NULL;
  3090. ssaBlock *default_block = NULL;
  3091. ssaBlock *fall = NULL;
  3092. b32 append_fall = false;
  3093. isize case_count = gb_array_count(body->stmts);
  3094. gb_for_array(i, body->stmts) {
  3095. AstNode *clause = body->stmts[i];
  3096. ssaBlock *body = fall;
  3097. b32 append_body = false;
  3098. ast_node(cc, CaseClause, clause);
  3099. if (body == NULL) {
  3100. append_body = true;
  3101. if (gb_array_count(cc->list)) {
  3102. body = ssa__make_block(proc, clause, make_string("match.dflt.body"));
  3103. } else {
  3104. body = ssa__make_block(proc, clause, make_string("match.case.body"));
  3105. }
  3106. }
  3107. if (append_fall && body == fall) {
  3108. append_fall = false;
  3109. append_body = true;
  3110. }
  3111. fall = done;
  3112. if (i+1 < case_count) {
  3113. append_fall = true;
  3114. fall = ssa__make_block(proc, clause, make_string("match.fall.body"));
  3115. }
  3116. if (gb_array_count(cc->list) == 0) {
  3117. // default case
  3118. default_stmts = cc->stmts;
  3119. default_fall = fall;
  3120. default_block = body;
  3121. continue;
  3122. }
  3123. ssaBlock *next_cond = NULL;
  3124. Token eq = {Token_CmpEq};
  3125. gb_for_array(j, cc->list) {
  3126. AstNode *expr = cc->list[j];
  3127. next_cond = ssa__make_block(proc, clause, make_string("match.case.next"));
  3128. ssaValue *cond = ssa_emit_comp(proc, eq, tag, ssa_build_expr(proc, expr));
  3129. ssa_emit_if(proc, cond, body, next_cond);
  3130. gb_array_append(proc->blocks, next_cond);
  3131. proc->curr_block = next_cond;
  3132. }
  3133. if (append_body) {
  3134. gb_array_append(proc->blocks, body);
  3135. }
  3136. proc->curr_block = body;
  3137. ssa_push_target_list(proc, done, NULL, fall);
  3138. ssa_open_scope(proc);
  3139. ssa_build_stmt_list(proc, cc->stmts);
  3140. ssa_close_scope(proc, ssaDeferExit_Default, body);
  3141. ssa_pop_target_list(proc);
  3142. ssa_emit_jump(proc, done);
  3143. proc->curr_block = next_cond;
  3144. }
  3145. if (default_block != NULL) {
  3146. ssa_emit_jump(proc, default_block);
  3147. gb_array_append(proc->blocks, default_block);
  3148. proc->curr_block = default_block;
  3149. ssa_push_target_list(proc, done, NULL, default_fall);
  3150. ssa_open_scope(proc);
  3151. ssa_build_stmt_list(proc, default_stmts);
  3152. ssa_close_scope(proc, ssaDeferExit_Default, default_block);
  3153. ssa_pop_target_list(proc);
  3154. }
  3155. ssa_emit_jump(proc, done);
  3156. gb_array_append(proc->blocks, done);
  3157. proc->curr_block = done;
  3158. case_end;
  3159. case_ast_node(ms, TypeMatchStmt, node);
  3160. ssa_emit_comment(proc, make_string("TypeMatchStmt"));
  3161. gbAllocator allocator = proc->module->allocator;
  3162. ssaValue *parent = ssa_build_expr(proc, ms->tag);
  3163. Type *union_type = type_deref(ssa_type(parent));
  3164. GB_ASSERT(is_type_union(union_type));
  3165. ssa_emit_comment(proc, make_string("get union's tag"));
  3166. ssaValue *tag_index = ssa_emit_struct_gep(proc, parent, v_one32, make_type_pointer(allocator, t_int));
  3167. tag_index = ssa_emit_load(proc, tag_index);
  3168. ssaValue *data = ssa_emit_conv(proc, parent, t_rawptr);
  3169. ssaBlock *start_block = ssa_add_block(proc, node, make_string("type-match.case.first"));
  3170. ssa_emit_jump(proc, start_block);
  3171. proc->curr_block = start_block;
  3172. ssaBlock *done = ssa__make_block(proc, node, make_string("type-match.done")); // NOTE(bill): Append later
  3173. ast_node(body, BlockStmt, ms->body);
  3174. String tag_var_name = ms->var->Ident.string;
  3175. AstNodeArray default_stmts = NULL;
  3176. ssaBlock *default_block = NULL;
  3177. isize case_count = gb_array_count(body->stmts);
  3178. gb_for_array(i, body->stmts) {
  3179. AstNode *clause = body->stmts[i];
  3180. ast_node(cc, CaseClause, clause);
  3181. if (gb_array_count(cc->list) == 0) {
  3182. // default case
  3183. default_stmts = cc->stmts;
  3184. default_block = ssa__make_block(proc, clause, make_string("type-match.dflt.body"));
  3185. continue;
  3186. }
  3187. ssaBlock *body = ssa__make_block(proc, clause, make_string("type-match.case.body"));
  3188. Scope *scope = *map_get(&proc->module->info->scopes, hash_pointer(clause));
  3189. Entity *tag_var_entity = current_scope_lookup_entity(scope, tag_var_name);
  3190. GB_ASSERT_MSG(tag_var_entity != NULL, "%.*s", LIT(tag_var_name));
  3191. ssaValue *tag_var = ssa_add_local(proc, tag_var_entity);
  3192. ssaValue *data_ptr = ssa_emit_conv(proc, data, tag_var_entity->type);
  3193. ssa_emit_store(proc, tag_var, data_ptr);
  3194. Type *bt = type_deref(tag_var_entity->type);
  3195. ssaValue *index = NULL;
  3196. Type *ut = base_type(union_type);
  3197. GB_ASSERT(ut->Record.kind == TypeRecord_Union);
  3198. for (isize field_index = 1; field_index < ut->Record.field_count; field_index++) {
  3199. Entity *f = base_type(union_type)->Record.fields[field_index];
  3200. if (are_types_identical(f->type, bt)) {
  3201. index = ssa_make_const_int(allocator, field_index);
  3202. break;
  3203. }
  3204. }
  3205. GB_ASSERT(index != NULL);
  3206. ssaBlock *next_cond = ssa__make_block(proc, clause, make_string("type-match.case.next"));
  3207. Token eq = {Token_CmpEq};
  3208. ssaValue *cond = ssa_emit_comp(proc, eq, tag_index, index);
  3209. ssa_emit_if(proc, cond, body, next_cond);
  3210. gb_array_append(proc->blocks, next_cond);
  3211. proc->curr_block = next_cond;
  3212. gb_array_append(proc->blocks, body);
  3213. proc->curr_block = body;
  3214. ssa_push_target_list(proc, done, NULL, NULL);
  3215. ssa_open_scope(proc);
  3216. ssa_build_stmt_list(proc, cc->stmts);
  3217. ssa_close_scope(proc, ssaDeferExit_Default, body);
  3218. ssa_pop_target_list(proc);
  3219. ssa_emit_jump(proc, done);
  3220. proc->curr_block = next_cond;
  3221. }
  3222. if (default_block != NULL) {
  3223. ssa_emit_jump(proc, default_block);
  3224. gb_array_append(proc->blocks, default_block);
  3225. proc->curr_block = default_block;
  3226. ssa_push_target_list(proc, done, NULL, NULL);
  3227. ssa_open_scope(proc);
  3228. ssa_build_stmt_list(proc, default_stmts);
  3229. ssa_close_scope(proc, ssaDeferExit_Default, default_block);
  3230. ssa_pop_target_list(proc);
  3231. }
  3232. ssa_emit_jump(proc, done);
  3233. gb_array_append(proc->blocks, done);
  3234. proc->curr_block = done;
  3235. case_end;
  3236. case_ast_node(bs, BranchStmt, node);
  3237. ssaBlock *block = NULL;
  3238. switch (bs->token.kind) {
  3239. case Token_break:
  3240. for (ssaTargetList *t = proc->target_list; t != NULL && block == NULL; t = t->prev) {
  3241. block = t->break_;
  3242. }
  3243. break;
  3244. case Token_continue:
  3245. for (ssaTargetList *t = proc->target_list; t != NULL && block == NULL; t = t->prev) {
  3246. block = t->continue_;
  3247. }
  3248. break;
  3249. case Token_fallthrough:
  3250. for (ssaTargetList *t = proc->target_list; t != NULL && block == NULL; t = t->prev) {
  3251. block = t->fallthrough_;
  3252. }
  3253. break;
  3254. }
  3255. // TODO(bill): Handle fallthrough scope exit correctly
  3256. // if (block != NULL && bs->token.kind != Token_fallthrough) {
  3257. if (block != NULL) {
  3258. ssa_emit_defer_stmts(proc, ssaDeferExit_Branch, block);
  3259. }
  3260. switch (bs->token.kind) {
  3261. case Token_break: ssa_emit_comment(proc, make_string("break")); break;
  3262. case Token_continue: ssa_emit_comment(proc, make_string("continue")); break;
  3263. case Token_fallthrough: ssa_emit_comment(proc, make_string("fallthrough")); break;
  3264. }
  3265. ssa_emit_jump(proc, block);
  3266. ssa_emit_unreachable(proc);
  3267. case_end;
  3268. case_ast_node(pa, PushAllocator, node);
  3269. ssa_emit_comment(proc, make_string("PushAllocator"));
  3270. ssa_open_scope(proc);
  3271. defer (ssa_close_scope(proc, ssaDeferExit_Default, NULL));
  3272. ssaValue *context_ptr = *map_get(&proc->module->members, hash_string(make_string("__context")));
  3273. ssaValue *prev_context = ssa_add_local_generated(proc, t_context);
  3274. ssa_emit_store(proc, prev_context, ssa_emit_load(proc, context_ptr));
  3275. ssa_add_defer_instr(proc, proc->scope_index, ssa_make_instr_store(proc, context_ptr, ssa_emit_load(proc, prev_context)));
  3276. ssaValue *gep = ssa_emit_struct_gep(proc, context_ptr, 1, t_allocator_ptr);
  3277. ssa_emit_store(proc, gep, ssa_build_expr(proc, pa->expr));
  3278. ssa_build_stmt(proc, pa->body);
  3279. case_end;
  3280. case_ast_node(pa, PushContext, node);
  3281. ssa_emit_comment(proc, make_string("PushContext"));
  3282. ssa_open_scope(proc);
  3283. defer (ssa_close_scope(proc, ssaDeferExit_Default, NULL));
  3284. ssaValue *context_ptr = *map_get(&proc->module->members, hash_string(make_string("__context")));
  3285. ssaValue *prev_context = ssa_add_local_generated(proc, t_context);
  3286. ssa_emit_store(proc, prev_context, ssa_emit_load(proc, context_ptr));
  3287. ssa_add_defer_instr(proc, proc->scope_index, ssa_make_instr_store(proc, context_ptr, ssa_emit_load(proc, prev_context)));
  3288. ssa_emit_store(proc, context_ptr, ssa_build_expr(proc, pa->expr));
  3289. ssa_build_stmt(proc, pa->body);
  3290. case_end;
  3291. }
  3292. }
  3293. void ssa_emit_startup_runtime(ssaProcedure *proc) {
  3294. GB_ASSERT(proc->parent == NULL && proc->name == "main");
  3295. ssa_emit(proc, ssa_alloc_instr(proc, ssaInstr_StartupRuntime));
  3296. }
  3297. void ssa_insert_code_before_proc(ssaProcedure* proc, ssaProcedure *parent) {
  3298. if (parent == NULL) {
  3299. if (proc->name == "main") {
  3300. ssa_emit_startup_runtime(proc);
  3301. }
  3302. }
  3303. }
  3304. void ssa_build_proc(ssaValue *value, ssaProcedure *parent) {
  3305. ssaProcedure *proc = &value->Proc;
  3306. proc->parent = parent;
  3307. if (proc->entity != NULL) {
  3308. ssaModule *m = proc->module;
  3309. CheckerInfo *info = m->info;
  3310. Entity *e = proc->entity;
  3311. String filename = e->token.pos.file;
  3312. AstFile **found = map_get(&info->files, hash_string(filename));
  3313. GB_ASSERT(found != NULL);
  3314. AstFile *f = *found;
  3315. ssaDebugInfo *di_file = NULL;
  3316. ssaDebugInfo **di_file_found = map_get(&m->debug_info, hash_pointer(f));
  3317. if (di_file_found) {
  3318. di_file = *di_file_found;
  3319. GB_ASSERT(di_file->kind == ssaDebugInfo_File);
  3320. } else {
  3321. di_file = ssa_add_debug_info_file(proc, f);
  3322. }
  3323. ssa_add_debug_info_proc(proc, e, proc->name, di_file);
  3324. }
  3325. if (proc->body != NULL) {
  3326. u32 prev_stmt_state_flags = proc->module->stmt_state_flags;
  3327. defer (proc->module->stmt_state_flags = prev_stmt_state_flags);
  3328. if (proc->tags != 0) {
  3329. u32 in = proc->tags;
  3330. u32 out = proc->module->stmt_state_flags;
  3331. defer (proc->module->stmt_state_flags = out);
  3332. if (in & ProcTag_bounds_check) {
  3333. out |= StmtStateFlag_bounds_check;
  3334. out &= ~StmtStateFlag_no_bounds_check;
  3335. } else if (in & ProcTag_no_bounds_check) {
  3336. out |= StmtStateFlag_no_bounds_check;
  3337. out &= ~StmtStateFlag_bounds_check;
  3338. }
  3339. }
  3340. ssa_begin_procedure_body(proc);
  3341. ssa_insert_code_before_proc(proc, parent);
  3342. ssa_build_stmt(proc, proc->body);
  3343. ssa_end_procedure_body(proc);
  3344. }
  3345. }