print_llvm.cpp 33 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234
  1. struct ssaFileBuffer {
  2. gbVirtualMemory vm;
  3. isize offset;
  4. gbFile *output;
  5. };
  6. void ssa_file_buffer_init(ssaFileBuffer *f, gbFile *output) {
  7. isize size = 8*gb_virtual_memory_page_size(NULL);
  8. f->vm = gb_vm_alloc(NULL, size);
  9. f->offset = 0;
  10. f->output = output;
  11. }
  12. void ssa_file_buffer_destroy(ssaFileBuffer *f) {
  13. if (f->offset > 0) {
  14. // NOTE(bill): finish writing buffered data
  15. gb_file_write(f->output, f->vm.data, f->offset);
  16. }
  17. gb_vm_free(f->vm);
  18. }
  19. void ssa_file_buffer_write(ssaFileBuffer *f, void *data, isize len) {
  20. if (len > f->vm.size) {
  21. gb_file_write(f->output, data, len);
  22. return;
  23. }
  24. if ((f->vm.size - f->offset) < len) {
  25. gb_file_write(f->output, f->vm.data, f->offset);
  26. f->offset = 0;
  27. }
  28. u8 *cursor = cast(u8 *)f->vm.data + f->offset;
  29. gb_memcopy(cursor, data, len);
  30. f->offset += len;
  31. }
  32. void ssa_fprintf(ssaFileBuffer *f, char *fmt, ...) {
  33. va_list va;
  34. va_start(va, fmt);
  35. char buf[4096] = {};
  36. isize len = gb_snprintf_va(buf, gb_size_of(buf), fmt, va);
  37. ssa_file_buffer_write(f, buf, len-1);
  38. va_end(va);
  39. }
  40. void ssa_file_write(ssaFileBuffer *f, void *data, isize len) {
  41. ssa_file_buffer_write(f, data, len);
  42. }
  43. b32 ssa_valid_char(u8 c) {
  44. if (c >= 0x80)
  45. return false;
  46. if (gb_char_is_alphanumeric(c))
  47. return true;
  48. switch (c) {
  49. case '$':
  50. case '-':
  51. case '.':
  52. case '_':
  53. return true;
  54. }
  55. return false;
  56. }
  57. void ssa_print_escape_string(ssaFileBuffer *f, String name, b32 print_quotes) {
  58. isize extra = 0;
  59. for (isize i = 0; i < name.len; i++) {
  60. u8 c = name.text[i];
  61. if (!ssa_valid_char(c))
  62. extra += 2;
  63. }
  64. if (extra == 0) {
  65. ssa_fprintf(f, "%.*s", LIT(name));
  66. return;
  67. }
  68. char hex_table[] = "0123456789ABCDEF";
  69. isize buf_len = name.len + extra + 2;
  70. gbTempArenaMemory tmp = gb_temp_arena_memory_begin(&string_buffer_arena);
  71. defer (gb_temp_arena_memory_end(tmp));
  72. u8 *buf = gb_alloc_array(string_buffer_allocator, u8, buf_len);
  73. isize j = 0;
  74. if (print_quotes) {
  75. buf[j++] = '"';
  76. }
  77. for (isize i = 0; i < name.len; i++) {
  78. u8 c = name.text[i];
  79. if (ssa_valid_char(c)) {
  80. buf[j++] = c;
  81. } else {
  82. buf[j] = '\\';
  83. buf[j+1] = hex_table[c >> 4];
  84. buf[j+2] = hex_table[c & 0x0f];
  85. j += 3;
  86. }
  87. }
  88. if (print_quotes) {
  89. buf[j++] = '"';
  90. }
  91. ssa_file_write(f, buf, j);
  92. }
  93. void ssa_print_encoded_local(ssaFileBuffer *f, String name) {
  94. ssa_fprintf(f, "%%");
  95. ssa_print_escape_string(f, name, true);
  96. }
  97. void ssa_print_encoded_global(ssaFileBuffer *f, String name, b32 global_scope) {
  98. ssa_fprintf(f, "@");
  99. if (!global_scope && name != make_string("main")) {
  100. ssa_fprintf(f, ".");
  101. }
  102. ssa_print_escape_string(f, name, true);
  103. }
  104. void ssa_print_type(ssaFileBuffer *f, ssaModule *m, Type *t) {
  105. BaseTypeSizes s = m->sizes;
  106. i64 word_bits = 8*s.word_size;
  107. GB_ASSERT_NOT_NULL(t);
  108. t = default_type(t);
  109. switch (t->kind) {
  110. case Type_Basic:
  111. switch (t->Basic.kind) {
  112. case Basic_bool: ssa_fprintf(f, "i1"); break;
  113. case Basic_i8: ssa_fprintf(f, "i8"); break;
  114. case Basic_i16: ssa_fprintf(f, "i16"); break;
  115. case Basic_i32: ssa_fprintf(f, "i32"); break;
  116. case Basic_i64: ssa_fprintf(f, "i64"); break;
  117. // case Basic_i128: ssa_fprintf(f, "i128"); break;
  118. case Basic_u8: ssa_fprintf(f, "i8"); break;
  119. case Basic_u16: ssa_fprintf(f, "i16"); break;
  120. case Basic_u32: ssa_fprintf(f, "i32"); break;
  121. case Basic_u64: ssa_fprintf(f, "i64"); break;
  122. // case Basic_u128: ssa_fprintf(f, "i128"); break;
  123. case Basic_f32: ssa_fprintf(f, "float"); break;
  124. case Basic_f64: ssa_fprintf(f, "double"); break;
  125. case Basic_rawptr: ssa_fprintf(f, "%%..rawptr"); break;
  126. case Basic_string: ssa_fprintf(f, "%%..string"); break;
  127. case Basic_uint: ssa_fprintf(f, "i%lld", word_bits); break;
  128. case Basic_int: ssa_fprintf(f, "i%lld", word_bits); break;
  129. case Basic_any: ssa_fprintf(f, "%%..any"); break;
  130. }
  131. break;
  132. case Type_Pointer:
  133. ssa_print_type(f, m, t->Pointer.elem);
  134. ssa_fprintf(f, "*");
  135. break;
  136. case Type_Maybe:
  137. ssa_fprintf(f, "{");
  138. ssa_print_type(f, m, t->Maybe.elem);
  139. ssa_fprintf(f, ", ");
  140. ssa_print_type(f, m, t_bool);
  141. ssa_fprintf(f, "}");
  142. break;
  143. case Type_Array:
  144. ssa_fprintf(f, "[%lld x ", t->Array.count);
  145. ssa_print_type(f, m, t->Array.elem);
  146. ssa_fprintf(f, "]");
  147. break;
  148. case Type_Vector: {
  149. // TODO(bill): actually do correctly
  150. ssa_fprintf(f, "<%lld x ", t->Vector.count);
  151. ssa_print_type(f, m, t->Vector.elem);
  152. ssa_fprintf(f, ">");
  153. } break;
  154. case Type_Slice:
  155. ssa_fprintf(f, "{");
  156. ssa_print_type(f, m, t->Slice.elem);
  157. ssa_fprintf(f, "*, i%lld, i%lld}", word_bits, word_bits);
  158. break;
  159. case Type_Record: {
  160. switch (t->Record.kind) {
  161. case TypeRecord_Struct:
  162. if (t->Record.struct_is_packed) {
  163. ssa_fprintf(f, "<");
  164. }
  165. ssa_fprintf(f, "{");
  166. for (isize i = 0; i < t->Record.field_count; i++) {
  167. if (i > 0) {
  168. ssa_fprintf(f, ", ");
  169. }
  170. Type *ft = t->Record.fields[i]->type;
  171. Type *bft = base_type(ft);
  172. if (!is_type_struct(bft)) {
  173. ft = bft;
  174. }
  175. ssa_print_type(f, m, ft);
  176. }
  177. ssa_fprintf(f, "}");
  178. if (t->Record.struct_is_packed) {
  179. ssa_fprintf(f, ">");
  180. }
  181. break;
  182. case TypeRecord_Union: {
  183. i64 size_of_union = type_size_of(s, gb_heap_allocator(), t) - s.word_size;
  184. ssa_fprintf(f, "{[%lld x i8], i%lld}", size_of_union, word_bits);
  185. } break;
  186. case TypeRecord_RawUnion:
  187. ssa_fprintf(f, "[%lld x i8]", type_size_of(s, gb_heap_allocator(), t));
  188. break;
  189. case TypeRecord_Enum:
  190. ssa_print_type(f, m, t->Record.enum_base);
  191. break;
  192. }
  193. } break;
  194. case Type_Named:
  195. if (is_type_struct(t) || is_type_union(t)) {
  196. String *name = map_get(&m->type_names, hash_pointer(t));
  197. GB_ASSERT(name != NULL);
  198. ssa_print_encoded_local(f, *name);
  199. // ssa_print_encoded_local(f, t->Named.name);
  200. } else {
  201. ssa_print_type(f, m, base_type(t));
  202. }
  203. break;
  204. case Type_Tuple:
  205. if (t->Tuple.variable_count == 1) {
  206. ssa_print_type(f, m, t->Tuple.variables[0]->type);
  207. } else {
  208. ssa_fprintf(f, "{");
  209. for (isize i = 0; i < t->Tuple.variable_count; i++) {
  210. if (i > 0) ssa_fprintf(f, ", ");
  211. ssa_print_type(f, m, t->Tuple.variables[i]->type);
  212. }
  213. ssa_fprintf(f, "}");
  214. }
  215. break;
  216. case Type_Proc: {
  217. if (t->Proc.result_count == 0) {
  218. ssa_fprintf(f, "void");
  219. } else {
  220. ssa_print_type(f, m, t->Proc.results);
  221. }
  222. ssa_fprintf(f, " (");
  223. auto *params = &t->Proc.params->Tuple;
  224. for (isize i = 0; i < t->Proc.param_count; i++) {
  225. if (i > 0) {
  226. ssa_fprintf(f, ", ");
  227. }
  228. ssa_print_type(f, m, params->variables[i]->type);
  229. }
  230. ssa_fprintf(f, ")*");
  231. } break;
  232. }
  233. }
  234. void ssa_print_exact_value(ssaFileBuffer *f, ssaModule *m, ExactValue value, Type *type);
  235. void ssa_print_compound_element(ssaFileBuffer *f, ssaModule *m, ExactValue v, Type *elem_type) {
  236. ssa_print_type(f, m, elem_type);
  237. ssa_fprintf(f, " ");
  238. if (v.kind != ExactValue_Invalid && is_type_maybe(elem_type)) {
  239. Type *t = base_type(elem_type)->Maybe.elem;
  240. ssa_fprintf(f, "{");
  241. ssa_print_type(f, m, t);
  242. ssa_fprintf(f, " ");
  243. }
  244. if (v.kind == ExactValue_Invalid) {
  245. ssa_fprintf(f, "zeroinitializer");
  246. } else if (v.kind == ExactValue_String) {
  247. // HACK NOTE(bill): This is a hack but it works because strings are created at the very end
  248. // of the .ll file
  249. ssaValue *str_array = ssa_add_global_string_array(m, v.value_string);
  250. ssa_fprintf(f, "{i8* getelementptr inbounds (");
  251. ssa_print_type(f, m, str_array->Global.entity->type);
  252. ssa_fprintf(f, ", ");
  253. ssa_print_type(f, m, str_array->Global.entity->type);
  254. ssa_fprintf(f, "* ");
  255. ssa_print_encoded_global(f, str_array->Global.entity->token.string, false);
  256. ssa_fprintf(f, ", ");
  257. ssa_print_type(f, m, t_int);
  258. ssa_fprintf(f, " 0, i32 0), ");
  259. ssa_print_type(f, m, t_int);
  260. ssa_fprintf(f, " %lld}", cast(i64)v.value_string.len);
  261. } else {
  262. ssa_print_exact_value(f, m, v, elem_type);
  263. }
  264. if (v.kind != ExactValue_Invalid && is_type_maybe(elem_type)) {
  265. ssa_fprintf(f, ", ");
  266. ssa_print_type(f, m, t_bool);
  267. ssa_fprintf(f, " ");
  268. ssa_fprintf(f, "true}");
  269. }
  270. }
  271. void ssa_print_exact_value(ssaFileBuffer *f, ssaModule *m, ExactValue value, Type *type) {
  272. type = base_type(type);
  273. if (is_type_float(type)) {
  274. value = exact_value_to_float(value);
  275. } else if (is_type_integer(type)) {
  276. value = exact_value_to_integer(value);
  277. } else if (is_type_pointer(type)) {
  278. value = exact_value_to_integer(value);
  279. }
  280. switch (value.kind) {
  281. case ExactValue_Bool:
  282. ssa_fprintf(f, "%s", (value.value_bool ? "true" : "false"));
  283. break;
  284. case ExactValue_String: {
  285. ssa_fprintf(f, "c\"");
  286. ssa_print_escape_string(f, value.value_string, false);
  287. ssa_fprintf(f, "\"");
  288. } break;
  289. case ExactValue_Integer: {
  290. if (is_type_pointer(type)) {
  291. if (value.value_integer == 0) {
  292. ssa_fprintf(f, "null");
  293. } else {
  294. ssa_fprintf(f, "inttoptr (");
  295. ssa_print_type(f, m, t_int);
  296. ssa_fprintf(f, " %llu to ", value.value_integer);
  297. ssa_print_type(f, m, t_rawptr);
  298. ssa_fprintf(f, ")");
  299. }
  300. } else {
  301. ssa_fprintf(f, "%lld", value.value_integer);
  302. }
  303. } break;
  304. case ExactValue_Float: {
  305. u64 u = *cast(u64*)&value.value_float;
  306. if (is_type_float(type) && type->Basic.kind == Basic_f32) {
  307. // IMPORTANT NOTE(bill): LLVM requires all floating point constants to be
  308. // a 64 bit number if bits_of(float type) <= 64.
  309. // For some bizarre reason, you need to clear the bottom 29 bits
  310. // https://groups.google.com/forum/#!topic/llvm-dev/IlqV3TbSk6M
  311. u >>= 29;
  312. u <<= 29;
  313. }
  314. ssa_fprintf(f, "0x%016llx", u);
  315. } break;
  316. case ExactValue_Pointer:
  317. if (value.value_pointer == NULL) {
  318. ssa_fprintf(f, "null");
  319. } else {
  320. ssa_fprintf(f, "inttoptr (");
  321. ssa_print_type(f, m, t_int);
  322. ssa_fprintf(f, " %llu to ", cast(u64)cast(uintptr)value.value_pointer);
  323. ssa_print_type(f, m, t_rawptr);
  324. ssa_fprintf(f, ")");
  325. }
  326. break;
  327. case ExactValue_Compound: {
  328. type = base_type(type);
  329. if (is_type_array(type)) {
  330. ast_node(cl, CompoundLit, value.value_compound);
  331. isize elem_count = cl->elems.count;
  332. if (elem_count == 0) {
  333. ssa_fprintf(f, "zeroinitializer");
  334. break;
  335. }
  336. ssa_fprintf(f, "[");
  337. Type *elem_type = type->Array.elem;
  338. for (isize i = 0; i < elem_count; i++) {
  339. if (i > 0) {
  340. ssa_fprintf(f, ", ");
  341. }
  342. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[i]);
  343. GB_ASSERT(tav != NULL);
  344. ssa_print_compound_element(f, m, tav->value, elem_type);
  345. }
  346. for (isize i = elem_count; i < type->Array.count; i++) {
  347. if (i >= elem_count) {
  348. ssa_fprintf(f, ", ");
  349. }
  350. ssa_print_type(f, m, elem_type);
  351. ssa_fprintf(f, " zeroinitializer");
  352. }
  353. ssa_fprintf(f, "]");
  354. } else if (is_type_vector(type)) {
  355. ast_node(cl, CompoundLit, value.value_compound);
  356. isize elem_count = cl->elems.count;
  357. if (elem_count == 0) {
  358. ssa_fprintf(f, "zeroinitializer");
  359. break;
  360. }
  361. ssa_fprintf(f, "<");
  362. Type *elem_type = type->Vector.elem;
  363. if (elem_count == 1 && type->Vector.count > 1) {
  364. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[0]);
  365. GB_ASSERT(tav != NULL);
  366. for (isize i = 0; i < type->Vector.count; i++) {
  367. if (i > 0) {
  368. ssa_fprintf(f, ", ");
  369. }
  370. ssa_print_compound_element(f, m, tav->value, elem_type);
  371. }
  372. } else {
  373. for (isize i = 0; i < elem_count; i++) {
  374. if (i > 0) {
  375. ssa_fprintf(f, ", ");
  376. }
  377. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[i]);
  378. GB_ASSERT(tav != NULL);
  379. ssa_print_compound_element(f, m, tav->value, elem_type);
  380. }
  381. }
  382. ssa_fprintf(f, ">");
  383. } else if (is_type_struct(type)) {
  384. gbTempArenaMemory tmp = gb_temp_arena_memory_begin(&m->tmp_arena);
  385. defer (gb_temp_arena_memory_end(tmp));
  386. ast_node(cl, CompoundLit, value.value_compound);
  387. if (cl->elems.count == 0) {
  388. ssa_fprintf(f, "zeroinitializer");
  389. break;
  390. }
  391. isize value_count = type->Record.field_count;
  392. ExactValue *values = gb_alloc_array(m->tmp_allocator, ExactValue, value_count);
  393. if (cl->elems[0]->kind == AstNode_FieldValue) {
  394. isize elem_count = cl->elems.count;
  395. for (isize i = 0; i < elem_count; i++) {
  396. ast_node(fv, FieldValue, cl->elems[i]);
  397. String name = fv->field->Ident.string;
  398. TypeAndValue *tav = type_and_value_of_expression(m->info, fv->value);
  399. GB_ASSERT(tav != NULL);
  400. Selection sel = lookup_field(m->allocator, type, name, false);
  401. Entity *f = type->Record.fields[sel.index[0]];
  402. values[f->Variable.field_index] = tav->value;
  403. }
  404. } else {
  405. for (isize i = 0; i < value_count; i++) {
  406. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[i]);
  407. GB_ASSERT(tav != NULL);
  408. Entity *f = type->Record.fields_in_src_order[i];
  409. values[f->Variable.field_index] = tav->value;
  410. }
  411. }
  412. if (type->Record.struct_is_packed) {
  413. ssa_fprintf(f, "<");
  414. }
  415. ssa_fprintf(f, "{");
  416. for (isize i = 0; i < value_count; i++) {
  417. if (i > 0) {
  418. ssa_fprintf(f, ", ");
  419. }
  420. Type *elem_type = type->Record.fields[i]->type;
  421. ssa_print_compound_element(f, m, values[i], elem_type);
  422. }
  423. ssa_fprintf(f, "}");
  424. if (type->Record.struct_is_packed) {
  425. ssa_fprintf(f, ">");
  426. }
  427. } else {
  428. ssa_fprintf(f, "zeroinitializer");
  429. }
  430. } break;
  431. default:
  432. ssa_fprintf(f, "zeroinitializer");
  433. // GB_PANIC("Invalid ExactValue: %d", value.kind);
  434. break;
  435. }
  436. }
  437. void ssa_print_block_name(ssaFileBuffer *f, ssaBlock *b) {
  438. if (b != NULL) {
  439. ssa_print_escape_string(f, b->label, false);
  440. ssa_fprintf(f, "-%td", b->index);
  441. } else {
  442. ssa_fprintf(f, "<INVALID-BLOCK>");
  443. }
  444. }
  445. void ssa_print_value(ssaFileBuffer *f, ssaModule *m, ssaValue *value, Type *type_hint) {
  446. if (value == NULL) {
  447. ssa_fprintf(f, "!!!NULL_VALUE");
  448. return;
  449. }
  450. switch (value->kind) {
  451. default: GB_PANIC("Unknown ssaValue kind"); break;
  452. case ssaValue_Constant:
  453. ssa_print_exact_value(f, m, value->Constant.value, type_hint);
  454. break;
  455. case ssaValue_ConstantSlice: {
  456. auto *cs = &value->ConstantSlice;
  457. if (cs->backing_array == NULL || cs->count == 0) {
  458. ssa_fprintf(f, "zeroinitializer");
  459. } else {
  460. Type *at = base_type(type_deref(ssa_type(cs->backing_array)));
  461. Type *et = at->Array.elem;
  462. ssa_fprintf(f, "{");
  463. ssa_print_type(f, m, et);
  464. ssa_fprintf(f, "* getelementptr inbounds (");
  465. ssa_print_type(f, m, at);
  466. ssa_fprintf(f, ", ");
  467. ssa_print_type(f, m, at);
  468. ssa_fprintf(f, "* ");
  469. ssa_print_value(f, m, cs->backing_array, at);
  470. ssa_fprintf(f, ", ");
  471. ssa_print_type(f, m, t_int);
  472. ssa_fprintf(f, " 0, i32 0), ");
  473. ssa_print_type(f, m, t_int);
  474. ssa_fprintf(f, " %lld, ", cs->count);
  475. ssa_print_type(f, m, t_int);
  476. ssa_fprintf(f, " %lld}", cs->count);
  477. }
  478. } break;
  479. case ssaValue_Nil:
  480. ssa_fprintf(f, "zeroinitializer");
  481. break;
  482. case ssaValue_TypeName:
  483. ssa_print_encoded_local(f, value->TypeName.name);
  484. break;
  485. case ssaValue_Global: {
  486. Scope *scope = value->Global.entity->scope;
  487. b32 in_global_scope = false;
  488. if (scope != NULL) {
  489. in_global_scope = scope->is_global || scope->is_init;
  490. }
  491. ssa_print_encoded_global(f, value->Global.entity->token.string, in_global_scope);
  492. } break;
  493. case ssaValue_Param:
  494. ssa_print_encoded_local(f, value->Param.entity->token.string);
  495. break;
  496. case ssaValue_Proc:
  497. ssa_print_encoded_global(f, value->Proc.name, (value->Proc.tags & (ProcTag_foreign|ProcTag_link_name)) != 0);
  498. break;
  499. case ssaValue_Instr:
  500. ssa_fprintf(f, "%%%d", value->index);
  501. break;
  502. }
  503. }
  504. void ssa_print_instr(ssaFileBuffer *f, ssaModule *m, ssaValue *value) {
  505. GB_ASSERT(value->kind == ssaValue_Instr);
  506. ssaInstr *instr = &value->Instr;
  507. ssa_fprintf(f, "\t");
  508. switch (instr->kind) {
  509. case ssaInstr_StartupRuntime: {
  510. ssa_fprintf(f, "call void ");
  511. ssa_print_encoded_global(f, make_string(SSA_STARTUP_RUNTIME_PROC_NAME), false);
  512. ssa_fprintf(f, "()\n");
  513. } break;
  514. case ssaInstr_Comment:
  515. ssa_fprintf(f, "; %.*s\n", LIT(instr->Comment.text));
  516. break;
  517. case ssaInstr_Local: {
  518. Type *type = instr->Local.entity->type;
  519. ssa_fprintf(f, "%%%d = alloca ", value->index);
  520. ssa_print_type(f, m, type);
  521. ssa_fprintf(f, ", align %lld\n", type_align_of(m->sizes, m->allocator, type));
  522. } break;
  523. case ssaInstr_ZeroInit: {
  524. Type *type = type_deref(ssa_type(instr->ZeroInit.address));
  525. ssa_fprintf(f, "store ");
  526. ssa_print_type(f, m, type);
  527. ssa_fprintf(f, " zeroinitializer, ");
  528. ssa_print_type(f, m, type);
  529. ssa_fprintf(f, "* %%%d\n", instr->ZeroInit.address->index);
  530. } break;
  531. case ssaInstr_Store: {
  532. Type *type = ssa_type(instr->Store.value);
  533. ssa_fprintf(f, "store ");
  534. ssa_print_type(f, m, type);
  535. ssa_fprintf(f, " ");
  536. ssa_print_value(f, m, instr->Store.value, type);
  537. ssa_fprintf(f, ", ");
  538. ssa_print_type(f, m, type);
  539. ssa_fprintf(f, "* ");
  540. ssa_print_value(f, m, instr->Store.address, type);
  541. ssa_fprintf(f, "\n");
  542. } break;
  543. case ssaInstr_Load: {
  544. Type *type = instr->Load.type;
  545. ssa_fprintf(f, "%%%d = load ", value->index);
  546. ssa_print_type(f, m, type);
  547. ssa_fprintf(f, ", ");
  548. ssa_print_type(f, m, type);
  549. ssa_fprintf(f, "* ");
  550. ssa_print_value(f, m, instr->Load.address, type);
  551. ssa_fprintf(f, ", align %lld\n", type_align_of(m->sizes, m->allocator, type));
  552. } break;
  553. case ssaInstr_GetElementPtr: {
  554. Type *et = instr->GetElementPtr.elem_type;
  555. ssa_fprintf(f, "%%%d = getelementptr ", value->index);
  556. if (instr->GetElementPtr.inbounds) {
  557. ssa_fprintf(f, "inbounds ");
  558. }
  559. ssa_print_type(f, m, type_deref(et));
  560. ssa_fprintf(f, ", ");
  561. ssa_print_type(f, m, et);
  562. ssa_fprintf(f, " ");
  563. ssa_print_value(f, m, instr->GetElementPtr.address, et);
  564. for (isize i = 0; i < instr->GetElementPtr.index_count; i++) {
  565. ssaValue *index = instr->GetElementPtr.indices[i];
  566. Type *t = ssa_type(index);
  567. ssa_fprintf(f, ", ");
  568. ssa_print_type(f, m, t);
  569. ssa_fprintf(f, " ");
  570. ssa_print_value(f, m, index, t);
  571. }
  572. ssa_fprintf(f, "\n");
  573. } break;
  574. case ssaInstr_Phi: {
  575. ssa_fprintf(f, "%%%d = phi ", value->index);
  576. ssa_print_type(f, m, instr->Phi.type);
  577. ssa_fprintf(f, " ", value->index);
  578. for (isize i = 0; i < instr->Phi.edges.count; i++) {
  579. if (i > 0) {
  580. ssa_fprintf(f, ", ");
  581. }
  582. ssaValue *edge = instr->Phi.edges[i];
  583. ssaBlock *block = NULL;
  584. if (instr->parent != NULL &&
  585. i < instr->parent->preds.count) {
  586. block = instr->parent->preds[i];
  587. }
  588. ssa_fprintf(f, "[ ");
  589. ssa_print_value(f, m, edge, instr->Phi.type);
  590. ssa_fprintf(f, ", %%");
  591. ssa_print_block_name(f, block);
  592. ssa_fprintf(f, " ]");
  593. }
  594. ssa_fprintf(f, "\n");
  595. } break;
  596. case ssaInstr_ExtractValue: {
  597. Type *et = instr->ExtractValue.elem_type;
  598. ssa_fprintf(f, "%%%d = extractvalue ", value->index);
  599. ssa_print_type(f, m, et);
  600. ssa_fprintf(f, " ");
  601. ssa_print_value(f, m, instr->ExtractValue.address, et);
  602. ssa_fprintf(f, ", %d\n", instr->ExtractValue.index);
  603. } break;
  604. case ssaInstr_NoOp: {;
  605. ssa_fprintf(f, "%%%d = add i32 0, 0\n", value->index);
  606. } break;
  607. case ssaInstr_Br: {;
  608. ssa_fprintf(f, "br ");
  609. if (instr->Br.cond != NULL) {
  610. ssa_print_type(f, m, t_bool);
  611. ssa_fprintf(f, " ");
  612. ssa_print_value(f, m, instr->Br.cond, t_bool);
  613. ssa_fprintf(f, ", ", instr->Br.cond->index);
  614. }
  615. ssa_fprintf(f, "label ");
  616. ssa_fprintf(f, "%%"); ssa_print_block_name(f, instr->Br.true_block);
  617. if (instr->Br.false_block != NULL) {
  618. ssa_fprintf(f, ", label ");
  619. ssa_fprintf(f, "%%"); ssa_print_block_name(f, instr->Br.false_block);
  620. }
  621. ssa_fprintf(f, "\n");
  622. } break;
  623. case ssaInstr_Ret: {
  624. auto *ret = &instr->Ret;
  625. ssa_fprintf(f, "ret ");
  626. if (ret->value == NULL) {
  627. ssa_fprintf(f, "void");
  628. } else {
  629. Type *t = ssa_type(ret->value);
  630. ssa_print_type(f, m, t);
  631. ssa_fprintf(f, " ");
  632. ssa_print_value(f, m, ret->value, t);
  633. }
  634. ssa_fprintf(f, "\n");
  635. } break;
  636. case ssaInstr_Conv: {
  637. auto *c = &instr->Conv;
  638. ssa_fprintf(f, "%%%d = %.*s ", value->index, LIT(ssa_conv_strings[c->kind]));
  639. ssa_print_type(f, m, c->from);
  640. ssa_fprintf(f, " ");
  641. ssa_print_value(f, m, c->value, c->from);
  642. ssa_fprintf(f, " to ");
  643. ssa_print_type(f, m, c->to);
  644. ssa_fprintf(f, "\n");
  645. } break;
  646. case ssaInstr_Unreachable: {
  647. ssa_fprintf(f, "unreachable\n");
  648. } break;
  649. case ssaInstr_BinaryOp: {
  650. auto *bo = &value->Instr.BinaryOp;
  651. Type *type = base_type(ssa_type(bo->left));
  652. Type *elem_type = type;
  653. while (elem_type->kind == Type_Vector) {
  654. elem_type = base_type(elem_type->Vector.elem);
  655. }
  656. ssa_fprintf(f, "%%%d = ", value->index);
  657. if (gb_is_between(bo->op, Token__ComparisonBegin+1, Token__ComparisonEnd-1)) {
  658. if (is_type_string(elem_type)) {
  659. ssa_fprintf(f, "call ");
  660. ssa_print_type(f, m, t_bool);
  661. char *runtime_proc = "";
  662. switch (bo->op) {
  663. case Token_CmpEq: runtime_proc = "__string_eq"; break;
  664. case Token_NotEq: runtime_proc = "__string_ne"; break;
  665. case Token_Lt: runtime_proc = "__string_lt"; break;
  666. case Token_Gt: runtime_proc = "__string_gt"; break;
  667. case Token_LtEq: runtime_proc = "__string_le"; break;
  668. case Token_GtEq: runtime_proc = "__string_gt"; break;
  669. }
  670. ssa_fprintf(f, " ");
  671. ssa_print_encoded_global(f, make_string(runtime_proc), false);
  672. ssa_fprintf(f, "(");
  673. ssa_print_type(f, m, type);
  674. ssa_fprintf(f, " ");
  675. ssa_print_value(f, m, bo->left, type);
  676. ssa_fprintf(f, ", ");
  677. ssa_print_type(f, m, type);
  678. ssa_fprintf(f, " ");
  679. ssa_print_value(f, m, bo->right, type);
  680. ssa_fprintf(f, ")\n");
  681. return;
  682. } else if (is_type_float(elem_type)) {
  683. ssa_fprintf(f, "fcmp ");
  684. switch (bo->op) {
  685. case Token_CmpEq: ssa_fprintf(f, "oeq"); break;
  686. case Token_NotEq: ssa_fprintf(f, "one"); break;
  687. case Token_Lt: ssa_fprintf(f, "olt"); break;
  688. case Token_Gt: ssa_fprintf(f, "ogt"); break;
  689. case Token_LtEq: ssa_fprintf(f, "ole"); break;
  690. case Token_GtEq: ssa_fprintf(f, "oge"); break;
  691. }
  692. } else {
  693. ssa_fprintf(f, "icmp ");
  694. if (bo->op != Token_CmpEq &&
  695. bo->op != Token_NotEq) {
  696. if (is_type_unsigned(elem_type)) {
  697. ssa_fprintf(f, "u");
  698. } else {
  699. ssa_fprintf(f, "s");
  700. }
  701. }
  702. switch (bo->op) {
  703. case Token_CmpEq: ssa_fprintf(f, "eq"); break;
  704. case Token_NotEq: ssa_fprintf(f, "ne"); break;
  705. case Token_Lt: ssa_fprintf(f, "lt"); break;
  706. case Token_Gt: ssa_fprintf(f, "gt"); break;
  707. case Token_LtEq: ssa_fprintf(f, "le"); break;
  708. case Token_GtEq: ssa_fprintf(f, "ge"); break;
  709. }
  710. }
  711. } else {
  712. if (is_type_float(elem_type))
  713. ssa_fprintf(f, "f");
  714. switch (bo->op) {
  715. case Token_Add: ssa_fprintf(f, "add"); break;
  716. case Token_Sub: ssa_fprintf(f, "sub"); break;
  717. case Token_And: ssa_fprintf(f, "and"); break;
  718. case Token_Or: ssa_fprintf(f, "or"); break;
  719. case Token_Xor: ssa_fprintf(f, "xor"); break;
  720. case Token_Shl: ssa_fprintf(f, "shl"); break;
  721. case Token_Shr: ssa_fprintf(f, "lshr"); break;
  722. case Token_Mul: ssa_fprintf(f, "mul"); break;
  723. case Token_Not: ssa_fprintf(f, "xor"); break;
  724. case Token_AndNot: GB_PANIC("Token_AndNot Should never be called");
  725. default: {
  726. if (!is_type_float(elem_type)) {
  727. if (is_type_unsigned(elem_type)) ssa_fprintf(f, "u");
  728. else ssa_fprintf(f, "s");
  729. }
  730. switch (bo->op) {
  731. case Token_Quo: ssa_fprintf(f, "div"); break;
  732. case Token_Mod: ssa_fprintf(f, "rem"); break;
  733. }
  734. } break;
  735. }
  736. }
  737. ssa_fprintf(f, " ");
  738. ssa_print_type(f, m, type);
  739. ssa_fprintf(f, " ");
  740. ssa_print_value(f, m, bo->left, type);
  741. ssa_fprintf(f, ", ");
  742. ssa_print_value(f, m, bo->right, type);
  743. ssa_fprintf(f, "\n");
  744. } break;
  745. case ssaInstr_Call: {
  746. auto *call = &instr->Call;
  747. Type *result_type = call->type;
  748. if (result_type) {
  749. ssa_fprintf(f, "%%%d = ", value->index);
  750. }
  751. ssa_fprintf(f, "call ");
  752. if (result_type) {
  753. ssa_print_type(f, m, result_type);
  754. } else {
  755. ssa_fprintf(f, "void");
  756. }
  757. ssa_fprintf(f, " ");
  758. ssa_print_value(f, m, call->value, call->type);
  759. ssa_fprintf(f, "(");
  760. if (call->arg_count > 0) {
  761. Type *proc_type = base_type(ssa_type(call->value));
  762. GB_ASSERT(proc_type->kind == Type_Proc);
  763. auto *params = &proc_type->Proc.params->Tuple;
  764. for (isize i = 0; i < call->arg_count; i++) {
  765. Entity *e = params->variables[i];
  766. GB_ASSERT(e != NULL);
  767. Type *t = e->type;
  768. if (i > 0) {
  769. ssa_fprintf(f, ", ");
  770. }
  771. ssa_print_type(f, m, t);
  772. ssa_fprintf(f, " ");
  773. ssaValue *arg = call->args[i];
  774. ssa_print_value(f, m, arg, t);
  775. }
  776. }
  777. ssa_fprintf(f, ")\n");
  778. } break;
  779. case ssaInstr_Select: {
  780. ssa_fprintf(f, "%%%d = select i1 ", value->index);
  781. ssa_print_value(f, m, instr->Select.cond, t_bool);
  782. ssa_fprintf(f, ", ");
  783. ssa_print_type(f, m, ssa_type(instr->Select.true_value));
  784. ssa_fprintf(f, " ");
  785. ssa_print_value(f, m, instr->Select.true_value, ssa_type(instr->Select.true_value));
  786. ssa_fprintf(f, ", ");
  787. ssa_print_type(f, m, ssa_type(instr->Select.false_value));
  788. ssa_fprintf(f, " ");
  789. ssa_print_value(f, m, instr->Select.false_value, ssa_type(instr->Select.false_value));
  790. ssa_fprintf(f, "\n");
  791. } break;
  792. case ssaInstr_ExtractElement: {
  793. Type *vt = ssa_type(instr->ExtractElement.vector);
  794. ssa_fprintf(f, "%%%d = extractelement ", value->index);
  795. ssa_print_type(f, m, vt);
  796. ssa_fprintf(f, " ");
  797. ssa_print_value(f, m, instr->ExtractElement.vector, vt);
  798. ssa_fprintf(f, ", ");
  799. Type *it = ssa_type(instr->ExtractElement.index);
  800. ssa_print_type(f, m, it);
  801. ssa_fprintf(f, " ");
  802. ssa_print_value(f, m, instr->ExtractElement.index, it);
  803. ssa_fprintf(f, "\n");
  804. } break;
  805. case ssaInstr_InsertElement: {
  806. auto *ie = &instr->InsertElement;
  807. Type *vt = ssa_type(ie->vector);
  808. ssa_fprintf(f, "%%%d = insertelement ", value->index);
  809. ssa_print_type(f, m, vt);
  810. ssa_fprintf(f, " ");
  811. ssa_print_value(f, m, ie->vector, vt);
  812. ssa_fprintf(f, ", ");
  813. ssa_print_type(f, m, ssa_type(ie->elem));
  814. ssa_fprintf(f, " ");
  815. ssa_print_value(f, m, ie->elem, ssa_type(ie->elem));
  816. ssa_fprintf(f, ", ");
  817. ssa_print_type(f, m, ssa_type(ie->index));
  818. ssa_fprintf(f, " ");
  819. ssa_print_value(f, m, ie->index, ssa_type(ie->index));
  820. ssa_fprintf(f, "\n");
  821. } break;
  822. case ssaInstr_ShuffleVector: {
  823. auto *sv = &instr->ShuffleVector;
  824. Type *vt = ssa_type(sv->vector);
  825. ssa_fprintf(f, "%%%d = shufflevector ", value->index);
  826. ssa_print_type(f, m, vt);
  827. ssa_fprintf(f, " ");
  828. ssa_print_value(f, m, sv->vector, vt);
  829. ssa_fprintf(f, ", ");
  830. ssa_print_type(f, m, vt);
  831. ssa_fprintf(f, " ");
  832. ssa_print_value(f, m, sv->vector, vt);
  833. ssa_fprintf(f, ", ");
  834. ssa_fprintf(f, "<%td x i32> <", sv->index_count);
  835. for (isize i = 0; i < sv->index_count; i++) {
  836. if (i > 0) {
  837. ssa_fprintf(f, ", ");
  838. }
  839. ssa_fprintf(f, "i32 %d", sv->indices[i]);
  840. }
  841. ssa_fprintf(f, ">");
  842. ssa_fprintf(f, "\n");
  843. } break;
  844. default: {
  845. GB_PANIC("<unknown instr> %d\n", instr->kind);
  846. ssa_fprintf(f, "; <unknown instr> %d\n", instr->kind);
  847. } break;
  848. }
  849. }
  850. void ssa_print_proc(ssaFileBuffer *f, ssaModule *m, ssaProcedure *proc) {
  851. if (proc->body == NULL) {
  852. ssa_fprintf(f, "declare ");
  853. if (proc->tags & ProcTag_dll_import) {
  854. ssa_fprintf(f, "dllimport ");
  855. }
  856. if (proc->tags & ProcTag_dll_export) {
  857. ssa_fprintf(f, "dllexport ");
  858. }
  859. } else {
  860. ssa_fprintf(f, "\ndefine ");
  861. }
  862. if (proc->tags & ProcTag_stdcall) {
  863. ssa_fprintf(f, "cc 64 ");
  864. } else if (proc->tags & ProcTag_fastcall) {
  865. ssa_fprintf(f, "cc 65 ");
  866. }
  867. auto *proc_type = &proc->type->Proc;
  868. if (proc_type->result_count == 0) {
  869. ssa_fprintf(f, "void");
  870. } else {
  871. ssa_print_type(f, m, proc_type->results);
  872. }
  873. ssa_fprintf(f, " ");
  874. ssa_print_encoded_global(f, proc->name, (proc->tags & (ProcTag_foreign|ProcTag_link_name)) != 0);
  875. ssa_fprintf(f, "(");
  876. if (proc_type->param_count > 0) {
  877. auto *params = &proc_type->params->Tuple;
  878. for (isize i = 0; i < params->variable_count; i++) {
  879. Entity *e = params->variables[i];
  880. if (i > 0) {
  881. ssa_fprintf(f, ", ");
  882. }
  883. ssa_print_type(f, m, e->type);
  884. if (proc->body != NULL) {
  885. ssa_fprintf(f, " %%%.*s", LIT(e->token.string));
  886. }
  887. }
  888. }
  889. ssa_fprintf(f, ") ");
  890. if (proc->tags & ProcTag_inline) {
  891. ssa_fprintf(f, "alwaysinline ");
  892. }
  893. if (proc->tags & ProcTag_no_inline) {
  894. ssa_fprintf(f, "noinline ");
  895. }
  896. if (proc->module->generate_debug_info && proc->entity != NULL) {
  897. if (proc->body != NULL) {
  898. ssaDebugInfo *di = *map_get(&proc->module->debug_info, hash_pointer(proc->entity));
  899. GB_ASSERT(di->kind == ssaDebugInfo_Proc);
  900. ssa_fprintf(f, "!dbg !%d ", di->id);
  901. }
  902. }
  903. if (proc->body != NULL) {
  904. // ssa_fprintf(f, "nounwind uwtable {\n");
  905. ssa_fprintf(f, "{\n");
  906. for_array(i, proc->blocks) {
  907. ssaBlock *block = proc->blocks[i];
  908. if (i > 0) ssa_fprintf(f, "\n");
  909. ssa_print_block_name(f, block);
  910. ssa_fprintf(f, ":\n");
  911. for_array(j, block->instrs) {
  912. ssaValue *value = block->instrs[j];
  913. ssa_print_instr(f, m, value);
  914. }
  915. }
  916. ssa_fprintf(f, "}\n");
  917. } else {
  918. ssa_fprintf(f, "\n");
  919. }
  920. for_array(i, proc->children) {
  921. ssa_print_proc(f, m, proc->children[i]);
  922. }
  923. }
  924. void ssa_print_type_name(ssaFileBuffer *f, ssaModule *m, ssaValue *v) {
  925. GB_ASSERT(v->kind == ssaValue_TypeName);
  926. Type *bt = base_type(ssa_type(v));
  927. if (!is_type_struct(bt) && !is_type_union(bt)) {
  928. return;
  929. }
  930. ssa_print_encoded_local(f, v->TypeName.name);
  931. ssa_fprintf(f, " = type ");
  932. ssa_print_type(f, m, base_type(v->TypeName.type));
  933. ssa_fprintf(f, "\n");
  934. }
  935. void ssa_print_llvm_ir(ssaFileBuffer *f, ssaModule *m) {
  936. if (m->layout.len > 0) {
  937. ssa_fprintf(f, "target datalayout = \"%.*s\"\n", LIT(m->layout));
  938. }
  939. ssa_print_encoded_local(f, make_string("..string"));
  940. ssa_fprintf(f, " = type {i8*, ");
  941. ssa_print_type(f, m, t_int);
  942. ssa_fprintf(f, "} ; Basic_string\n");
  943. ssa_print_encoded_local(f, make_string("..rawptr"));
  944. ssa_fprintf(f, " = type i8* ; Basic_rawptr\n");
  945. ssa_print_encoded_local(f, make_string("..any"));
  946. ssa_fprintf(f, " = type {");
  947. ssa_print_type(f, m, t_type_info_ptr);
  948. ssa_fprintf(f, ", ");
  949. ssa_print_type(f, m, t_rawptr);
  950. ssa_fprintf(f, "} ; Basic_any\n");
  951. for_array(member_index, m->members.entries) {
  952. auto *entry = &m->members.entries[member_index];
  953. ssaValue *v = entry->value;
  954. if (v->kind != ssaValue_TypeName) {
  955. continue;
  956. }
  957. ssa_print_type_name(f, m, v);
  958. }
  959. for_array(member_index, m->members.entries) {
  960. auto *entry = &m->members.entries[member_index];
  961. ssaValue *v = entry->value;
  962. if (v->kind != ssaValue_Proc) {
  963. continue;
  964. }
  965. if (v->Proc.body == NULL) {
  966. ssa_print_proc(f, m, &v->Proc);
  967. }
  968. }
  969. for_array(member_index, m->members.entries) {
  970. auto *entry = &m->members.entries[member_index];
  971. ssaValue *v = entry->value;
  972. if (v->kind != ssaValue_Proc) {
  973. continue;
  974. }
  975. if (v->Proc.body != NULL) {
  976. ssa_print_proc(f, m, &v->Proc);
  977. }
  978. }
  979. for_array(member_index, m->members.entries) {
  980. auto *entry = &m->members.entries[member_index];
  981. ssaValue *v = entry->value;
  982. if (v->kind != ssaValue_Global) {
  983. continue;
  984. }
  985. auto *g = &v->Global;
  986. Scope *scope = g->entity->scope;
  987. b32 in_global_scope = false;
  988. if (scope != NULL) {
  989. in_global_scope = scope->is_global || scope->is_init;
  990. }
  991. ssa_print_encoded_global(f, g->entity->token.string, in_global_scope);
  992. ssa_fprintf(f, " = ");
  993. if (g->is_thread_local) {
  994. ssa_fprintf(f, "thread_local ");
  995. }
  996. if (g->is_constant) {
  997. if (g->is_private) {
  998. ssa_fprintf(f, "private ");
  999. }
  1000. ssa_fprintf(f, "constant ");
  1001. } else {
  1002. ssa_fprintf(f, "global ");
  1003. }
  1004. ssa_print_type(f, m, g->entity->type);
  1005. ssa_fprintf(f, " ");
  1006. if (g->value != NULL) {
  1007. ssa_print_value(f, m, g->value, g->entity->type);
  1008. } else {
  1009. ssa_fprintf(f, "zeroinitializer");
  1010. }
  1011. ssa_fprintf(f, "\n");
  1012. }
  1013. if (m->generate_debug_info) {
  1014. ssa_fprintf(f, "\n");
  1015. ssa_fprintf(f, "!llvm.dbg.cu = !{!0}\n");
  1016. for_array(di_index, m->debug_info.entries) {
  1017. auto *entry = &m->debug_info.entries[di_index];
  1018. ssaDebugInfo *di = entry->value;
  1019. ssa_fprintf(f, "!%d = ", di->id);
  1020. defer (ssa_fprintf(f, "\n"));
  1021. switch (di->kind) {
  1022. case ssaDebugInfo_CompileUnit: {
  1023. auto *cu = &di->CompileUnit;
  1024. ssaDebugInfo *file = *map_get(&m->debug_info, hash_pointer(cu->file));
  1025. ssa_fprintf(f,
  1026. "distinct !DICompileUnit("
  1027. "language: DW_LANG_Go, " // Is this good enough?
  1028. "file: !%d, "
  1029. "producer: \"%.*s\", "
  1030. "flags: \"\", "
  1031. "runtimeVersion: 0, "
  1032. "isOptimized: false, "
  1033. "emissionKind: FullDebug"
  1034. ")",
  1035. file->id, LIT(cu->producer));
  1036. } break;
  1037. case ssaDebugInfo_File:
  1038. ssa_fprintf(f, "!DIFile(filename: \"");
  1039. ssa_print_escape_string(f, di->File.filename, false);
  1040. ssa_fprintf(f, "\", directory: \"");
  1041. ssa_print_escape_string(f, di->File.directory, false);
  1042. ssa_fprintf(f, "\")");
  1043. break;
  1044. case ssaDebugInfo_Proc:
  1045. ssa_fprintf(f, "distinct !DISubprogram("
  1046. "name: \"%.*s\", "
  1047. // "linkageName: \"\", "
  1048. "file: !%d, "
  1049. "line: %td, "
  1050. "isDefinition: true, "
  1051. "isLocal: false, "
  1052. "unit: !0"
  1053. ")",
  1054. LIT(di->Proc.name),
  1055. di->Proc.file->id,
  1056. di->Proc.pos.line);
  1057. break;
  1058. case ssaDebugInfo_AllProcs:
  1059. ssa_fprintf(f, "!{");
  1060. for_array(proc_index, di->AllProcs.procs) {
  1061. ssaDebugInfo *p = di->AllProcs.procs[proc_index];
  1062. if (proc_index > 0) {ssa_fprintf(f, ",");}
  1063. ssa_fprintf(f, "!%d", p->id);
  1064. }
  1065. ssa_fprintf(f, "}");
  1066. break;
  1067. }
  1068. }
  1069. }
  1070. }