print_llvm.cpp 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227
  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. if (v.kind == ExactValue_Invalid) {
  237. ssa_fprintf(f, "zeroinitializer");
  238. } else if (v.kind == ExactValue_String) {
  239. // HACK NOTE(bill): This is a hack but it works because strings are created at the very end
  240. // of the .ll file
  241. ssaValue *str_array = ssa_add_global_string_array(m, v.value_string);
  242. ssa_fprintf(f, "{i8* getelementptr inbounds (");
  243. ssa_print_type(f, m, str_array->Global.entity->type);
  244. ssa_fprintf(f, ", ");
  245. ssa_print_type(f, m, str_array->Global.entity->type);
  246. ssa_fprintf(f, "* ");
  247. ssa_print_encoded_global(f, str_array->Global.entity->token.string, false);
  248. ssa_fprintf(f, ", ");
  249. ssa_print_type(f, m, t_int);
  250. ssa_fprintf(f, " 0, i32 0), ");
  251. ssa_print_type(f, m, t_int);
  252. ssa_fprintf(f, " %lld}", cast(i64)v.value_string.len);
  253. } else {
  254. ssa_print_exact_value(f, m, v, elem_type);
  255. }
  256. }
  257. void ssa_print_exact_value(ssaFileBuffer *f, ssaModule *m, ExactValue value, Type *type) {
  258. type = base_type(type);
  259. if (is_type_float(type)) {
  260. value = exact_value_to_float(value);
  261. } else if (is_type_integer(type)) {
  262. value = exact_value_to_integer(value);
  263. } else if (is_type_pointer(type)) {
  264. value = exact_value_to_integer(value);
  265. }
  266. switch (value.kind) {
  267. case ExactValue_Bool:
  268. ssa_fprintf(f, "%s", (value.value_bool ? "true" : "false"));
  269. break;
  270. case ExactValue_String: {
  271. ssa_fprintf(f, "c\"");
  272. ssa_print_escape_string(f, value.value_string, false);
  273. ssa_fprintf(f, "\"");
  274. } break;
  275. case ExactValue_Integer: {
  276. if (is_type_pointer(type)) {
  277. if (value.value_integer == 0) {
  278. ssa_fprintf(f, "null");
  279. } else {
  280. ssa_fprintf(f, "inttoptr (");
  281. ssa_print_type(f, m, t_int);
  282. ssa_fprintf(f, " %llu to ", value.value_integer);
  283. ssa_print_type(f, m, t_rawptr);
  284. ssa_fprintf(f, ")");
  285. }
  286. } else {
  287. ssa_fprintf(f, "%lld", value.value_integer);
  288. }
  289. } break;
  290. case ExactValue_Float: {
  291. u64 u = *cast(u64*)&value.value_float;
  292. if (is_type_float(type) && type->Basic.kind == Basic_f32) {
  293. // IMPORTANT NOTE(bill): LLVM requires all floating point constants to be
  294. // a 64 bit number if bits_of(float type) <= 64.
  295. // For some bizarre reason, you need to clear the bottom 29 bits
  296. // https://groups.google.com/forum/#!topic/llvm-dev/IlqV3TbSk6M
  297. u >>= 29;
  298. u <<= 29;
  299. }
  300. ssa_fprintf(f, "0x%016llx", u);
  301. } break;
  302. case ExactValue_Pointer:
  303. if (value.value_pointer == NULL) {
  304. ssa_fprintf(f, "null");
  305. } else {
  306. ssa_fprintf(f, "inttoptr (");
  307. ssa_print_type(f, m, t_int);
  308. ssa_fprintf(f, " %llu to ", cast(u64)cast(uintptr)value.value_pointer);
  309. ssa_print_type(f, m, t_rawptr);
  310. ssa_fprintf(f, ")");
  311. }
  312. break;
  313. case ExactValue_Compound: {
  314. type = base_type(type);
  315. if (is_type_array(type)) {
  316. ast_node(cl, CompoundLit, value.value_compound);
  317. isize elem_count = cl->elems.count;
  318. if (elem_count == 0) {
  319. ssa_fprintf(f, "zeroinitializer");
  320. break;
  321. }
  322. ssa_fprintf(f, "[");
  323. Type *elem_type = type->Array.elem;
  324. for (isize i = 0; i < elem_count; i++) {
  325. if (i > 0) {
  326. ssa_fprintf(f, ", ");
  327. }
  328. ssa_print_type(f, m, elem_type);
  329. ssa_fprintf(f, " ");
  330. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[i]);
  331. GB_ASSERT(tav != NULL);
  332. ssa_print_compound_element(f, m, tav->value, elem_type);
  333. }
  334. for (isize i = elem_count; i < type->Array.count; i++) {
  335. if (i >= elem_count) {
  336. ssa_fprintf(f, ", ");
  337. }
  338. ssa_print_type(f, m, elem_type);
  339. ssa_fprintf(f, " zeroinitializer");
  340. }
  341. ssa_fprintf(f, "]");
  342. } else if (is_type_vector(type)) {
  343. ast_node(cl, CompoundLit, value.value_compound);
  344. isize elem_count = cl->elems.count;
  345. if (elem_count == 0) {
  346. ssa_fprintf(f, "zeroinitializer");
  347. break;
  348. }
  349. ssa_fprintf(f, "<");
  350. Type *elem_type = type->Vector.elem;
  351. if (elem_count == 1 && type->Vector.count > 1) {
  352. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[0]);
  353. GB_ASSERT(tav != NULL);
  354. for (isize i = 0; i < type->Vector.count; i++) {
  355. if (i > 0) {
  356. ssa_fprintf(f, ", ");
  357. }
  358. ssa_print_type(f, m, elem_type);
  359. ssa_fprintf(f, " ");
  360. ssa_print_compound_element(f, m, tav->value, elem_type);
  361. }
  362. } else {
  363. for (isize i = 0; i < elem_count; i++) {
  364. if (i > 0) {
  365. ssa_fprintf(f, ", ");
  366. }
  367. ssa_print_type(f, m, elem_type);
  368. ssa_fprintf(f, " ");
  369. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[i]);
  370. GB_ASSERT(tav != NULL);
  371. ssa_print_compound_element(f, m, tav->value, elem_type);
  372. }
  373. }
  374. ssa_fprintf(f, ">");
  375. } else if (is_type_struct(type)) {
  376. gbTempArenaMemory tmp = gb_temp_arena_memory_begin(&m->tmp_arena);
  377. defer (gb_temp_arena_memory_end(tmp));
  378. ast_node(cl, CompoundLit, value.value_compound);
  379. if (cl->elems.count == 0) {
  380. ssa_fprintf(f, "zeroinitializer");
  381. break;
  382. }
  383. isize value_count = type->Record.field_count;
  384. ExactValue *values = gb_alloc_array(m->tmp_allocator, ExactValue, value_count);
  385. if (cl->elems[0]->kind == AstNode_FieldValue) {
  386. isize elem_count = cl->elems.count;
  387. for (isize i = 0; i < elem_count; i++) {
  388. ast_node(fv, FieldValue, cl->elems[i]);
  389. String name = fv->field->Ident.string;
  390. TypeAndValue *tav = type_and_value_of_expression(m->info, fv->value);
  391. GB_ASSERT(tav != NULL);
  392. Selection sel = lookup_field(m->allocator, type, name, false);
  393. Entity *f = type->Record.fields[sel.index[0]];
  394. values[f->Variable.field_index] = tav->value;
  395. }
  396. } else {
  397. for (isize i = 0; i < value_count; i++) {
  398. TypeAndValue *tav = type_and_value_of_expression(m->info, cl->elems[i]);
  399. GB_ASSERT(tav != NULL);
  400. Entity *f = type->Record.fields_in_src_order[i];
  401. values[f->Variable.field_index] = tav->value;
  402. }
  403. }
  404. if (type->Record.struct_is_packed) {
  405. ssa_fprintf(f, "<");
  406. }
  407. ssa_fprintf(f, "{");
  408. for (isize i = 0; i < value_count; i++) {
  409. if (i > 0) {
  410. ssa_fprintf(f, ", ");
  411. }
  412. Type *elem_type = type->Record.fields[i]->type;
  413. ssa_print_type(f, m, elem_type);
  414. ssa_fprintf(f, " ");
  415. ssa_print_compound_element(f, m, values[i], elem_type);
  416. }
  417. ssa_fprintf(f, "}");
  418. if (type->Record.struct_is_packed) {
  419. ssa_fprintf(f, ">");
  420. }
  421. } else {
  422. ssa_fprintf(f, "zeroinitializer");
  423. }
  424. } break;
  425. default:
  426. ssa_fprintf(f, "zeroinitializer");
  427. // GB_PANIC("Invalid ExactValue: %d", value.kind);
  428. break;
  429. }
  430. }
  431. void ssa_print_block_name(ssaFileBuffer *f, ssaBlock *b) {
  432. if (b != NULL) {
  433. ssa_print_escape_string(f, b->label, false);
  434. ssa_fprintf(f, "-%td", b->index);
  435. } else {
  436. ssa_fprintf(f, "<INVALID-BLOCK>");
  437. }
  438. }
  439. void ssa_print_value(ssaFileBuffer *f, ssaModule *m, ssaValue *value, Type *type_hint) {
  440. if (value == NULL) {
  441. ssa_fprintf(f, "!!!NULL_VALUE");
  442. return;
  443. }
  444. switch (value->kind) {
  445. default: GB_PANIC("Unknown ssaValue kind"); break;
  446. case ssaValue_Constant:
  447. ssa_print_exact_value(f, m, value->Constant.value, type_hint);
  448. break;
  449. case ssaValue_ConstantSlice: {
  450. auto *cs = &value->ConstantSlice;
  451. if (cs->backing_array == NULL || cs->count == 0) {
  452. ssa_fprintf(f, "zeroinitializer");
  453. } else {
  454. Type *at = base_type(type_deref(ssa_type(cs->backing_array)));
  455. Type *et = at->Array.elem;
  456. ssa_fprintf(f, "{");
  457. ssa_print_type(f, m, et);
  458. ssa_fprintf(f, "* getelementptr inbounds (");
  459. ssa_print_type(f, m, at);
  460. ssa_fprintf(f, ", ");
  461. ssa_print_type(f, m, at);
  462. ssa_fprintf(f, "* ");
  463. ssa_print_value(f, m, cs->backing_array, at);
  464. ssa_fprintf(f, ", ");
  465. ssa_print_type(f, m, t_int);
  466. ssa_fprintf(f, " 0, i32 0), ");
  467. ssa_print_type(f, m, t_int);
  468. ssa_fprintf(f, " %lld, ", cs->count);
  469. ssa_print_type(f, m, t_int);
  470. ssa_fprintf(f, " %lld}", cs->count);
  471. }
  472. } break;
  473. case ssaValue_Nil:
  474. ssa_fprintf(f, "zeroinitializer");
  475. break;
  476. case ssaValue_TypeName:
  477. ssa_print_encoded_local(f, value->TypeName.name);
  478. break;
  479. case ssaValue_Global: {
  480. Scope *scope = value->Global.entity->scope;
  481. b32 in_global_scope = false;
  482. if (scope != NULL) {
  483. in_global_scope = scope->is_global || scope->is_init;
  484. }
  485. ssa_print_encoded_global(f, value->Global.entity->token.string, in_global_scope);
  486. } break;
  487. case ssaValue_Param:
  488. ssa_print_encoded_local(f, value->Param.entity->token.string);
  489. break;
  490. case ssaValue_Proc:
  491. ssa_print_encoded_global(f, value->Proc.name, (value->Proc.tags & (ProcTag_foreign|ProcTag_link_name)) != 0);
  492. break;
  493. case ssaValue_Instr:
  494. ssa_fprintf(f, "%%%d", value->id);
  495. break;
  496. }
  497. }
  498. void ssa_print_instr(ssaFileBuffer *f, ssaModule *m, ssaValue *value) {
  499. GB_ASSERT(value->kind == ssaValue_Instr);
  500. ssaInstr *instr = &value->Instr;
  501. ssa_fprintf(f, "\t");
  502. switch (instr->kind) {
  503. case ssaInstr_StartupRuntime: {
  504. ssa_fprintf(f, "call void ");
  505. ssa_print_encoded_global(f, make_string(SSA_STARTUP_RUNTIME_PROC_NAME), false);
  506. ssa_fprintf(f, "()\n");
  507. } break;
  508. case ssaInstr_Comment:
  509. ssa_fprintf(f, "; %.*s\n", LIT(instr->Comment.text));
  510. break;
  511. case ssaInstr_Local: {
  512. Type *type = instr->Local.entity->type;
  513. ssa_fprintf(f, "%%%d = alloca ", value->id);
  514. ssa_print_type(f, m, type);
  515. ssa_fprintf(f, ", align %lld\n", type_align_of(m->sizes, m->allocator, type));
  516. } break;
  517. case ssaInstr_ZeroInit: {
  518. Type *type = type_deref(ssa_type(instr->ZeroInit.address));
  519. ssa_fprintf(f, "store ");
  520. ssa_print_type(f, m, type);
  521. ssa_fprintf(f, " zeroinitializer, ");
  522. ssa_print_type(f, m, type);
  523. ssa_fprintf(f, "* %%%d\n", instr->ZeroInit.address->id);
  524. } break;
  525. case ssaInstr_Store: {
  526. Type *type = ssa_type(instr);
  527. ssa_fprintf(f, "store ");
  528. ssa_print_type(f, m, type);
  529. ssa_fprintf(f, " ");
  530. ssa_print_value(f, m, instr->Store.value, type);
  531. ssa_fprintf(f, ", ");
  532. ssa_print_type(f, m, type);
  533. ssa_fprintf(f, "* ");
  534. ssa_print_value(f, m, instr->Store.address, type);
  535. ssa_fprintf(f, "\n");
  536. } break;
  537. case ssaInstr_Load: {
  538. Type *type = instr->Load.type;
  539. ssa_fprintf(f, "%%%d = load ", value->id);
  540. ssa_print_type(f, m, type);
  541. ssa_fprintf(f, ", ");
  542. ssa_print_type(f, m, type);
  543. ssa_fprintf(f, "* ");
  544. ssa_print_value(f, m, instr->Load.address, type);
  545. ssa_fprintf(f, ", align %lld\n", type_align_of(m->sizes, m->allocator, type));
  546. } break;
  547. case ssaInstr_GetElementPtr: {
  548. Type *et = instr->GetElementPtr.elem_type;
  549. ssa_fprintf(f, "%%%d = getelementptr ", value->id);
  550. if (instr->GetElementPtr.inbounds) {
  551. ssa_fprintf(f, "inbounds ");
  552. }
  553. ssa_print_type(f, m, type_deref(et));
  554. ssa_fprintf(f, ", ");
  555. ssa_print_type(f, m, et);
  556. ssa_fprintf(f, " ");
  557. ssa_print_value(f, m, instr->GetElementPtr.address, et);
  558. for (isize i = 0; i < instr->GetElementPtr.index_count; i++) {
  559. ssaValue *index = instr->GetElementPtr.indices[i];
  560. Type *t = ssa_type(index);
  561. ssa_fprintf(f, ", ");
  562. ssa_print_type(f, m, t);
  563. ssa_fprintf(f, " ");
  564. ssa_print_value(f, m, index, t);
  565. }
  566. ssa_fprintf(f, "\n");
  567. } break;
  568. case ssaInstr_Phi: {
  569. ssa_fprintf(f, "%%%d = phi ", value->id);
  570. ssa_print_type(f, m, instr->Phi.type);
  571. ssa_fprintf(f, " ", value->id);
  572. for (isize i = 0; i < instr->Phi.edges.count; i++) {
  573. ssaValue *edge = instr->Phi.edges[i];
  574. if (i > 0) {
  575. ssa_fprintf(f, ", ");
  576. }
  577. ssaBlock *block = NULL;
  578. if (instr->parent != NULL &&
  579. i < instr->parent->preds.count) {
  580. block = instr->parent->preds[i];
  581. }
  582. ssa_fprintf(f, "[ ");
  583. ssa_print_value(f, m, edge, instr->Phi.type);
  584. ssa_fprintf(f, ", %%");
  585. ssa_print_block_name(f, block);
  586. ssa_fprintf(f, " ]");
  587. }
  588. ssa_fprintf(f, "\n");
  589. } break;
  590. case ssaInstr_ExtractValue: {
  591. Type *et = instr->ExtractValue.elem_type;
  592. ssa_fprintf(f, "%%%d = extractvalue ", value->id);
  593. ssa_print_type(f, m, et);
  594. ssa_fprintf(f, " ");
  595. ssa_print_value(f, m, instr->ExtractValue.address, et);
  596. ssa_fprintf(f, ", %d\n", instr->ExtractValue.index);
  597. } break;
  598. case ssaInstr_NoOp: {;
  599. ssa_fprintf(f, "%%%d = add i32 0, 0\n", value->id);
  600. } break;
  601. case ssaInstr_Br: {;
  602. ssa_fprintf(f, "br ");
  603. if (instr->Br.cond != NULL) {
  604. ssa_print_type(f, m, t_bool);
  605. ssa_fprintf(f, " ");
  606. ssa_print_value(f, m, instr->Br.cond, t_bool);
  607. ssa_fprintf(f, ", ", instr->Br.cond->id);
  608. }
  609. ssa_fprintf(f, "label ");
  610. ssa_fprintf(f, "%%"); ssa_print_block_name(f, instr->Br.true_block);
  611. if (instr->Br.false_block != NULL) {
  612. ssa_fprintf(f, ", label ");
  613. ssa_fprintf(f, "%%"); ssa_print_block_name(f, instr->Br.false_block);
  614. }
  615. ssa_fprintf(f, "\n");
  616. } break;
  617. case ssaInstr_Ret: {
  618. auto *ret = &instr->Ret;
  619. ssa_fprintf(f, "ret ");
  620. if (ret->value == NULL) {
  621. ssa_fprintf(f, "void");
  622. } else {
  623. Type *t = ssa_type(ret->value);
  624. ssa_print_type(f, m, t);
  625. ssa_fprintf(f, " ");
  626. ssa_print_value(f, m, ret->value, t);
  627. }
  628. ssa_fprintf(f, "\n");
  629. } break;
  630. case ssaInstr_Conv: {
  631. auto *c = &instr->Conv;
  632. ssa_fprintf(f, "%%%d = %.*s ", value->id, LIT(ssa_conv_strings[c->kind]));
  633. ssa_print_type(f, m, c->from);
  634. ssa_fprintf(f, " ");
  635. ssa_print_value(f, m, c->value, c->from);
  636. ssa_fprintf(f, " to ");
  637. ssa_print_type(f, m, c->to);
  638. ssa_fprintf(f, "\n");
  639. } break;
  640. case ssaInstr_Unreachable: {
  641. ssa_fprintf(f, "unreachable\n");
  642. } break;
  643. case ssaInstr_BinaryOp: {
  644. auto *bo = &value->Instr.BinaryOp;
  645. Type *type = base_type(ssa_type(bo->left));
  646. Type *elem_type = type;
  647. while (elem_type->kind == Type_Vector) {
  648. elem_type = base_type(elem_type->Vector.elem);
  649. }
  650. ssa_fprintf(f, "%%%d = ", value->id);
  651. if (gb_is_between(bo->op, Token__ComparisonBegin+1, Token__ComparisonEnd-1)) {
  652. if (is_type_string(elem_type)) {
  653. ssa_fprintf(f, "call ");
  654. ssa_print_type(f, m, t_bool);
  655. char *runtime_proc = "";
  656. switch (bo->op) {
  657. case Token_CmpEq: runtime_proc = "__string_eq"; break;
  658. case Token_NotEq: runtime_proc = "__string_ne"; break;
  659. case Token_Lt: runtime_proc = "__string_lt"; break;
  660. case Token_Gt: runtime_proc = "__string_gt"; break;
  661. case Token_LtEq: runtime_proc = "__string_le"; break;
  662. case Token_GtEq: runtime_proc = "__string_gt"; break;
  663. }
  664. ssa_fprintf(f, " ");
  665. ssa_print_encoded_global(f, make_string(runtime_proc), false);
  666. ssa_fprintf(f, "(");
  667. ssa_print_type(f, m, type);
  668. ssa_fprintf(f, " ");
  669. ssa_print_value(f, m, bo->left, type);
  670. ssa_fprintf(f, ", ");
  671. ssa_print_type(f, m, type);
  672. ssa_fprintf(f, " ");
  673. ssa_print_value(f, m, bo->right, type);
  674. ssa_fprintf(f, ")\n");
  675. return;
  676. } else if (is_type_float(elem_type)) {
  677. ssa_fprintf(f, "fcmp ");
  678. switch (bo->op) {
  679. case Token_CmpEq: ssa_fprintf(f, "oeq"); break;
  680. case Token_NotEq: ssa_fprintf(f, "one"); break;
  681. case Token_Lt: ssa_fprintf(f, "olt"); break;
  682. case Token_Gt: ssa_fprintf(f, "ogt"); break;
  683. case Token_LtEq: ssa_fprintf(f, "ole"); break;
  684. case Token_GtEq: ssa_fprintf(f, "oge"); break;
  685. }
  686. } else {
  687. ssa_fprintf(f, "icmp ");
  688. if (bo->op != Token_CmpEq &&
  689. bo->op != Token_NotEq) {
  690. if (is_type_unsigned(elem_type)) {
  691. ssa_fprintf(f, "u");
  692. } else {
  693. ssa_fprintf(f, "s");
  694. }
  695. }
  696. switch (bo->op) {
  697. case Token_CmpEq: ssa_fprintf(f, "eq"); break;
  698. case Token_NotEq: ssa_fprintf(f, "ne"); break;
  699. case Token_Lt: ssa_fprintf(f, "lt"); break;
  700. case Token_Gt: ssa_fprintf(f, "gt"); break;
  701. case Token_LtEq: ssa_fprintf(f, "le"); break;
  702. case Token_GtEq: ssa_fprintf(f, "ge"); break;
  703. }
  704. }
  705. } else {
  706. if (is_type_float(elem_type))
  707. ssa_fprintf(f, "f");
  708. switch (bo->op) {
  709. case Token_Add: ssa_fprintf(f, "add"); break;
  710. case Token_Sub: ssa_fprintf(f, "sub"); break;
  711. case Token_And: ssa_fprintf(f, "and"); break;
  712. case Token_Or: ssa_fprintf(f, "or"); break;
  713. case Token_Xor: ssa_fprintf(f, "xor"); break;
  714. case Token_Shl: ssa_fprintf(f, "shl"); break;
  715. case Token_Shr: ssa_fprintf(f, "lshr"); break;
  716. case Token_Mul: ssa_fprintf(f, "mul"); break;
  717. case Token_Not: ssa_fprintf(f, "xor"); break;
  718. case Token_AndNot: GB_PANIC("Token_AndNot Should never be called");
  719. default: {
  720. if (!is_type_float(elem_type)) {
  721. if (is_type_unsigned(elem_type)) ssa_fprintf(f, "u");
  722. else ssa_fprintf(f, "s");
  723. }
  724. switch (bo->op) {
  725. case Token_Quo: ssa_fprintf(f, "div"); break;
  726. case Token_Mod: ssa_fprintf(f, "rem"); break;
  727. }
  728. } break;
  729. }
  730. }
  731. ssa_fprintf(f, " ");
  732. ssa_print_type(f, m, type);
  733. ssa_fprintf(f, " ");
  734. ssa_print_value(f, m, bo->left, type);
  735. ssa_fprintf(f, ", ");
  736. ssa_print_value(f, m, bo->right, type);
  737. ssa_fprintf(f, "\n");
  738. } break;
  739. case ssaInstr_Call: {
  740. auto *call = &instr->Call;
  741. Type *result_type = call->type;
  742. if (result_type) {
  743. ssa_fprintf(f, "%%%d = ", value->id);
  744. }
  745. ssa_fprintf(f, "call ");
  746. if (result_type) {
  747. ssa_print_type(f, m, result_type);
  748. } else {
  749. ssa_fprintf(f, "void");
  750. }
  751. ssa_fprintf(f, " ");
  752. ssa_print_value(f, m, call->value, call->type);
  753. ssa_fprintf(f, "(");
  754. if (call->arg_count > 0) {
  755. Type *proc_type = base_type(ssa_type(call->value));
  756. GB_ASSERT(proc_type->kind == Type_Proc);
  757. auto *params = &proc_type->Proc.params->Tuple;
  758. for (isize i = 0; i < call->arg_count; i++) {
  759. Entity *e = params->variables[i];
  760. GB_ASSERT(e != NULL);
  761. Type *t = e->type;
  762. if (i > 0) {
  763. ssa_fprintf(f, ", ");
  764. }
  765. ssa_print_type(f, m, t);
  766. ssa_fprintf(f, " ");
  767. ssaValue *arg = call->args[i];
  768. ssa_print_value(f, m, arg, t);
  769. }
  770. }
  771. ssa_fprintf(f, ")\n");
  772. } break;
  773. case ssaInstr_Select: {
  774. ssa_fprintf(f, "%%%d = select i1 ", value->id);
  775. ssa_print_value(f, m, instr->Select.cond, t_bool);
  776. ssa_fprintf(f, ", ");
  777. ssa_print_type(f, m, ssa_type(instr->Select.true_value));
  778. ssa_fprintf(f, " ");
  779. ssa_print_value(f, m, instr->Select.true_value, ssa_type(instr->Select.true_value));
  780. ssa_fprintf(f, ", ");
  781. ssa_print_type(f, m, ssa_type(instr->Select.false_value));
  782. ssa_fprintf(f, " ");
  783. ssa_print_value(f, m, instr->Select.false_value, ssa_type(instr->Select.false_value));
  784. ssa_fprintf(f, "\n");
  785. } break;
  786. case ssaInstr_ExtractElement: {
  787. Type *vt = ssa_type(instr->ExtractElement.vector);
  788. ssa_fprintf(f, "%%%d = extractelement ", value->id);
  789. ssa_print_type(f, m, vt);
  790. ssa_fprintf(f, " ");
  791. ssa_print_value(f, m, instr->ExtractElement.vector, vt);
  792. ssa_fprintf(f, ", ");
  793. Type *it = ssa_type(instr->ExtractElement.index);
  794. ssa_print_type(f, m, it);
  795. ssa_fprintf(f, " ");
  796. ssa_print_value(f, m, instr->ExtractElement.index, it);
  797. ssa_fprintf(f, "\n");
  798. } break;
  799. case ssaInstr_InsertElement: {
  800. auto *ie = &instr->InsertElement;
  801. Type *vt = ssa_type(ie->vector);
  802. ssa_fprintf(f, "%%%d = insertelement ", value->id);
  803. ssa_print_type(f, m, vt);
  804. ssa_fprintf(f, " ");
  805. ssa_print_value(f, m, ie->vector, vt);
  806. ssa_fprintf(f, ", ");
  807. ssa_print_type(f, m, ssa_type(ie->elem));
  808. ssa_fprintf(f, " ");
  809. ssa_print_value(f, m, ie->elem, ssa_type(ie->elem));
  810. ssa_fprintf(f, ", ");
  811. ssa_print_type(f, m, ssa_type(ie->index));
  812. ssa_fprintf(f, " ");
  813. ssa_print_value(f, m, ie->index, ssa_type(ie->index));
  814. ssa_fprintf(f, "\n");
  815. } break;
  816. case ssaInstr_ShuffleVector: {
  817. auto *sv = &instr->ShuffleVector;
  818. Type *vt = ssa_type(sv->vector);
  819. ssa_fprintf(f, "%%%d = shufflevector ", value->id);
  820. ssa_print_type(f, m, vt);
  821. ssa_fprintf(f, " ");
  822. ssa_print_value(f, m, sv->vector, vt);
  823. ssa_fprintf(f, ", ");
  824. ssa_print_type(f, m, vt);
  825. ssa_fprintf(f, " ");
  826. ssa_print_value(f, m, sv->vector, vt);
  827. ssa_fprintf(f, ", ");
  828. ssa_fprintf(f, "<%td x i32> <", sv->index_count);
  829. for (isize i = 0; i < sv->index_count; i++) {
  830. if (i > 0) {
  831. ssa_fprintf(f, ", ");
  832. }
  833. ssa_fprintf(f, "i32 %d", sv->indices[i]);
  834. }
  835. ssa_fprintf(f, ">");
  836. ssa_fprintf(f, "\n");
  837. } break;
  838. default: {
  839. GB_PANIC("<unknown instr> %d\n", instr->kind);
  840. ssa_fprintf(f, "; <unknown instr> %d\n", instr->kind);
  841. } break;
  842. }
  843. }
  844. void ssa_print_proc(ssaFileBuffer *f, ssaModule *m, ssaProcedure *proc) {
  845. if (proc->body == NULL) {
  846. ssa_fprintf(f, "declare ");
  847. if (proc->tags & ProcTag_dll_import) {
  848. ssa_fprintf(f, "dllimport ");
  849. }
  850. if (proc->tags & ProcTag_dll_export) {
  851. ssa_fprintf(f, "dllexport ");
  852. }
  853. } else {
  854. ssa_fprintf(f, "\ndefine ");
  855. }
  856. if (proc->tags & ProcTag_stdcall) {
  857. ssa_fprintf(f, "cc 64 ");
  858. } else if (proc->tags & ProcTag_fastcall) {
  859. ssa_fprintf(f, "cc 65 ");
  860. }
  861. auto *proc_type = &proc->type->Proc;
  862. if (proc_type->result_count == 0) {
  863. ssa_fprintf(f, "void");
  864. } else {
  865. ssa_print_type(f, m, proc_type->results);
  866. }
  867. ssa_fprintf(f, " ");
  868. ssa_print_encoded_global(f, proc->name, (proc->tags & (ProcTag_foreign|ProcTag_link_name)) != 0);
  869. ssa_fprintf(f, "(");
  870. if (proc_type->param_count > 0) {
  871. auto *params = &proc_type->params->Tuple;
  872. for (isize i = 0; i < params->variable_count; i++) {
  873. Entity *e = params->variables[i];
  874. if (i > 0) {
  875. ssa_fprintf(f, ", ");
  876. }
  877. ssa_print_type(f, m, e->type);
  878. if (proc->body != NULL) {
  879. ssa_fprintf(f, " %%%.*s", LIT(e->token.string));
  880. }
  881. }
  882. }
  883. ssa_fprintf(f, ") ");
  884. if (proc->tags & ProcTag_inline) {
  885. ssa_fprintf(f, "alwaysinline ");
  886. }
  887. if (proc->tags & ProcTag_no_inline) {
  888. ssa_fprintf(f, "noinline ");
  889. }
  890. if (proc->module->generate_debug_info && proc->entity != NULL) {
  891. if (proc->body != NULL) {
  892. ssaDebugInfo *di = *map_get(&proc->module->debug_info, hash_pointer(proc->entity));
  893. GB_ASSERT(di->kind == ssaDebugInfo_Proc);
  894. ssa_fprintf(f, "!dbg !%d ", di->id);
  895. }
  896. }
  897. if (proc->body != NULL) {
  898. // ssa_fprintf(f, "nounwind uwtable {\n");
  899. ssa_fprintf(f, "{\n");
  900. for_array(i, proc->blocks) {
  901. ssaBlock *block = proc->blocks[i];
  902. if (i > 0) ssa_fprintf(f, "\n");
  903. ssa_print_block_name(f, block);
  904. ssa_fprintf(f, ":\n");
  905. for_array(j, block->instrs) {
  906. ssaValue *value = block->instrs[j];
  907. ssa_print_instr(f, m, value);
  908. }
  909. }
  910. ssa_fprintf(f, "}\n");
  911. } else {
  912. ssa_fprintf(f, "\n");
  913. }
  914. for_array(i, proc->children) {
  915. ssa_print_proc(f, m, proc->children[i]);
  916. }
  917. }
  918. void ssa_print_type_name(ssaFileBuffer *f, ssaModule *m, ssaValue *v) {
  919. GB_ASSERT(v->kind == ssaValue_TypeName);
  920. Type *bt = base_type(ssa_type(v));
  921. if (!is_type_struct(bt) && !is_type_union(bt)) {
  922. return;
  923. }
  924. ssa_print_encoded_local(f, v->TypeName.name);
  925. ssa_fprintf(f, " = type ");
  926. ssa_print_type(f, m, base_type(v->TypeName.type));
  927. ssa_fprintf(f, "\n");
  928. }
  929. void ssa_print_llvm_ir(ssaFileBuffer *f, ssaModule *m) {
  930. if (m->layout.len > 0) {
  931. ssa_fprintf(f, "target datalayout = \"%.*s\"\n", LIT(m->layout));
  932. }
  933. ssa_print_encoded_local(f, make_string("..string"));
  934. ssa_fprintf(f, " = type {i8*, ");
  935. ssa_print_type(f, m, t_int);
  936. ssa_fprintf(f, "} ; Basic_string\n");
  937. ssa_print_encoded_local(f, make_string("..rawptr"));
  938. ssa_fprintf(f, " = type i8* ; Basic_rawptr\n");
  939. ssa_print_encoded_local(f, make_string("..any"));
  940. ssa_fprintf(f, " = type {");
  941. ssa_print_type(f, m, t_type_info_ptr);
  942. ssa_fprintf(f, ", ");
  943. ssa_print_type(f, m, t_rawptr);
  944. ssa_fprintf(f, "} ; Basic_any\n");
  945. for_array(member_index, m->members.entries) {
  946. auto *entry = &m->members.entries[member_index];
  947. ssaValue *v = entry->value;
  948. if (v->kind != ssaValue_TypeName) {
  949. continue;
  950. }
  951. ssa_print_type_name(f, m, v);
  952. }
  953. for_array(member_index, m->members.entries) {
  954. auto *entry = &m->members.entries[member_index];
  955. ssaValue *v = entry->value;
  956. if (v->kind != ssaValue_Proc) {
  957. continue;
  958. }
  959. if (v->Proc.body == NULL) {
  960. ssa_print_proc(f, m, &v->Proc);
  961. }
  962. }
  963. for_array(member_index, m->members.entries) {
  964. auto *entry = &m->members.entries[member_index];
  965. ssaValue *v = entry->value;
  966. if (v->kind != ssaValue_Proc) {
  967. continue;
  968. }
  969. if (v->Proc.body != NULL) {
  970. ssa_print_proc(f, m, &v->Proc);
  971. }
  972. }
  973. for_array(member_index, m->members.entries) {
  974. auto *entry = &m->members.entries[member_index];
  975. ssaValue *v = entry->value;
  976. if (v->kind != ssaValue_Global) {
  977. continue;
  978. }
  979. auto *g = &v->Global;
  980. Scope *scope = g->entity->scope;
  981. b32 in_global_scope = false;
  982. if (scope != NULL) {
  983. in_global_scope = scope->is_global || scope->is_init;
  984. }
  985. ssa_print_encoded_global(f, g->entity->token.string, in_global_scope);
  986. ssa_fprintf(f, " = ");
  987. if (g->is_thread_local) {
  988. ssa_fprintf(f, "thread_local ");
  989. }
  990. if (g->is_constant) {
  991. if (g->is_private) {
  992. ssa_fprintf(f, "private ");
  993. }
  994. ssa_fprintf(f, "constant ");
  995. } else {
  996. ssa_fprintf(f, "global ");
  997. }
  998. ssa_print_type(f, m, g->entity->type);
  999. ssa_fprintf(f, " ");
  1000. if (g->value != NULL) {
  1001. ssa_print_value(f, m, g->value, g->entity->type);
  1002. } else {
  1003. ssa_fprintf(f, "zeroinitializer");
  1004. }
  1005. ssa_fprintf(f, "\n");
  1006. }
  1007. if (m->generate_debug_info) {
  1008. ssa_fprintf(f, "\n");
  1009. ssa_fprintf(f, "!llvm.dbg.cu = !{!0}\n");
  1010. for_array(di_index, m->debug_info.entries) {
  1011. auto *entry = &m->debug_info.entries[di_index];
  1012. ssaDebugInfo *di = entry->value;
  1013. ssa_fprintf(f, "!%d = ", di->id);
  1014. defer (ssa_fprintf(f, "\n"));
  1015. switch (di->kind) {
  1016. case ssaDebugInfo_CompileUnit: {
  1017. auto *cu = &di->CompileUnit;
  1018. ssaDebugInfo *file = *map_get(&m->debug_info, hash_pointer(cu->file));
  1019. ssa_fprintf(f,
  1020. "distinct !DICompileUnit("
  1021. "language: DW_LANG_Go, " // Is this good enough?
  1022. "file: !%d, "
  1023. "producer: \"%.*s\", "
  1024. "flags: \"\", "
  1025. "runtimeVersion: 0, "
  1026. "isOptimized: false, "
  1027. "emissionKind: FullDebug"
  1028. ")",
  1029. file->id, LIT(cu->producer));
  1030. } break;
  1031. case ssaDebugInfo_File:
  1032. ssa_fprintf(f, "!DIFile(filename: \"");
  1033. ssa_print_escape_string(f, di->File.filename, false);
  1034. ssa_fprintf(f, "\", directory: \"");
  1035. ssa_print_escape_string(f, di->File.directory, false);
  1036. ssa_fprintf(f, "\")");
  1037. break;
  1038. case ssaDebugInfo_Proc:
  1039. ssa_fprintf(f, "distinct !DISubprogram("
  1040. "name: \"%.*s\", "
  1041. // "linkageName: \"\", "
  1042. "file: !%d, "
  1043. "line: %td, "
  1044. "isDefinition: true, "
  1045. "isLocal: false, "
  1046. "unit: !0"
  1047. ")",
  1048. LIT(di->Proc.name),
  1049. di->Proc.file->id,
  1050. di->Proc.pos.line);
  1051. break;
  1052. case ssaDebugInfo_AllProcs:
  1053. ssa_fprintf(f, "!{");
  1054. for_array(proc_index, di->AllProcs.procs) {
  1055. ssaDebugInfo *p = di->AllProcs.procs[proc_index];
  1056. if (proc_index > 0) {ssa_fprintf(f, ",");}
  1057. ssa_fprintf(f, "!%d", p->id);
  1058. }
  1059. ssa_fprintf(f, "}");
  1060. break;
  1061. }
  1062. }
  1063. }
  1064. }