print_llvm.cpp 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863
  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. u8 *buf = gb_alloc_array(gb_heap_allocator(), u8, buf_len);
  71. defer (gb_free(gb_heap_allocator(), buf));
  72. isize j = 0;
  73. if (print_quotes) {
  74. buf[j++] = '"';
  75. }
  76. for (isize i = 0; i < name.len; i++) {
  77. u8 c = name.text[i];
  78. if (ssa_valid_char(c)) {
  79. buf[j++] = c;
  80. } else {
  81. buf[j] = '\\';
  82. buf[j+1] = hex_table[c >> 4];
  83. buf[j+2] = hex_table[c & 0x0f];
  84. j += 3;
  85. }
  86. }
  87. if (print_quotes) {
  88. buf[j++] = '"';
  89. }
  90. ssa_file_write(f, buf, j);
  91. }
  92. void ssa_print_encoded_local(ssaFileBuffer *f, String name) {
  93. ssa_fprintf(f, "%%");
  94. ssa_print_escape_string(f, name, true);
  95. }
  96. void ssa_print_encoded_global(ssaFileBuffer *f, String name, b32 global_scope = false) {
  97. ssa_fprintf(f, "@");
  98. if (!global_scope) {
  99. ssa_fprintf(f, ".");
  100. }
  101. ssa_print_escape_string(f, name, true);
  102. }
  103. void ssa_print_type(ssaFileBuffer *f, BaseTypeSizes s, Type *t) {
  104. i64 word_bits = 8*s.word_size;
  105. GB_ASSERT_NOT_NULL(t);
  106. t = default_type(t);
  107. switch (t->kind) {
  108. case Type_Basic:
  109. switch (t->Basic.kind) {
  110. case Basic_bool: ssa_fprintf(f, "i1"); break;
  111. case Basic_i8: ssa_fprintf(f, "i8"); break;
  112. case Basic_i16: ssa_fprintf(f, "i16"); break;
  113. case Basic_i32: ssa_fprintf(f, "i32"); break;
  114. case Basic_i64: ssa_fprintf(f, "i64"); break;
  115. case Basic_i128: ssa_fprintf(f, "i128"); break;
  116. case Basic_u8: ssa_fprintf(f, "i8"); break;
  117. case Basic_u16: ssa_fprintf(f, "i16"); break;
  118. case Basic_u32: ssa_fprintf(f, "i32"); break;
  119. case Basic_u64: ssa_fprintf(f, "i64"); break;
  120. case Basic_u128: ssa_fprintf(f, "u128"); break;
  121. case Basic_f32: ssa_fprintf(f, "float"); break;
  122. case Basic_f64: ssa_fprintf(f, "double"); break;
  123. case Basic_rawptr: ssa_fprintf(f, "%%..rawptr"); break;
  124. case Basic_string: ssa_fprintf(f, "%%..string"); break;
  125. case Basic_uint: ssa_fprintf(f, "i%lld", word_bits); break;
  126. case Basic_int: ssa_fprintf(f, "i%lld", word_bits); break;
  127. }
  128. break;
  129. case Type_Array:
  130. ssa_fprintf(f, "[%lld x ", t->Array.count);
  131. ssa_print_type(f, s, t->Array.elem);
  132. ssa_fprintf(f, "]");
  133. break;
  134. case Type_Vector: {
  135. // TODO(bill): actually do correctly
  136. ssa_fprintf(f, "<%lld x ", t->Vector.count);
  137. ssa_print_type(f, s, t->Vector.elem);
  138. ssa_fprintf(f, ">");
  139. } break;
  140. case Type_Slice:
  141. ssa_fprintf(f, "{");
  142. ssa_print_type(f, s, t->Slice.elem);
  143. ssa_fprintf(f, "*, i%lld, i%lld}", word_bits, word_bits);
  144. break;
  145. case Type_Record: {
  146. switch (t->Record.kind) {
  147. case TypeRecord_Struct:
  148. if (t->Record.struct_is_packed) {
  149. ssa_fprintf(f, "<");
  150. }
  151. ssa_fprintf(f, "{");
  152. for (isize i = 0; i < t->Record.field_count; i++) {
  153. if (i > 0) {
  154. ssa_fprintf(f, ", ");
  155. }
  156. Type *ft = t->Record.fields[i]->type;
  157. Type *bft = get_base_type(ft);
  158. if (!is_type_struct(bft)) {
  159. ft = bft;
  160. }
  161. ssa_print_type(f, s, ft);
  162. }
  163. ssa_fprintf(f, "}");
  164. if (t->Record.struct_is_packed) {
  165. ssa_fprintf(f, ">");
  166. }
  167. break;
  168. case TypeRecord_Union: {
  169. i64 size_of_union = type_size_of(s, gb_heap_allocator(), t) - s.word_size;
  170. ssa_fprintf(f, "{[%lld x i8], i%lld}", size_of_union, word_bits);
  171. } break;
  172. case TypeRecord_RawUnion:
  173. ssa_fprintf(f, "[%lld x i8]", type_size_of(s, gb_heap_allocator(), t));
  174. break;
  175. case TypeRecord_Enum:
  176. ssa_print_type(f, s, t->Record.enum_base);
  177. break;
  178. }
  179. } break;
  180. case Type_Pointer:
  181. ssa_print_type(f, s, t->Pointer.elem);
  182. ssa_fprintf(f, "*");
  183. break;
  184. case Type_Named:
  185. if (is_type_struct(t) || is_type_union(t)) {
  186. ssa_print_encoded_local(f, t->Named.name);
  187. } else {
  188. ssa_print_type(f, s, get_base_type(t));
  189. }
  190. break;
  191. case Type_Tuple:
  192. if (t->Tuple.variable_count == 1) {
  193. ssa_print_type(f, s, t->Tuple.variables[0]->type);
  194. } else {
  195. ssa_fprintf(f, "{");
  196. for (isize i = 0; i < t->Tuple.variable_count; i++) {
  197. if (i > 0) ssa_fprintf(f, ", ");
  198. ssa_print_type(f, s, t->Tuple.variables[i]->type);
  199. }
  200. ssa_fprintf(f, "}");
  201. }
  202. break;
  203. case Type_Proc: {
  204. if (t->Proc.result_count == 0) {
  205. ssa_fprintf(f, "void");
  206. } else {
  207. ssa_print_type(f, s, t->Proc.results);
  208. }
  209. ssa_fprintf(f, " (");
  210. auto *params = &t->Proc.params->Tuple;
  211. for (isize i = 0; i < t->Proc.param_count; i++) {
  212. if (i > 0) {
  213. ssa_fprintf(f, ", ");
  214. }
  215. ssa_print_type(f, s, params->variables[i]->type);
  216. }
  217. ssa_fprintf(f, ")*");
  218. } break;
  219. }
  220. }
  221. void ssa_print_exact_value(ssaFileBuffer *f, ssaModule *m, ExactValue value, Type *type) {
  222. type = get_base_type(type);
  223. if (is_type_float(type)) {
  224. value = exact_value_to_float(value);
  225. } else if (is_type_integer(type)) {
  226. value = exact_value_to_integer(value);
  227. } else if (is_type_pointer(type)) {
  228. value = exact_value_to_integer(value);
  229. }
  230. switch (value.kind) {
  231. case ExactValue_Bool:
  232. ssa_fprintf(f, (value.value_bool ? "true" : "false"));
  233. break;
  234. case ExactValue_String: {
  235. ssa_fprintf(f, "c\"");
  236. ssa_print_escape_string(f, value.value_string, false);
  237. ssa_fprintf(f, "\"");
  238. } break;
  239. case ExactValue_Integer: {
  240. if (is_type_pointer(type)) {
  241. if (value.value_integer == 0) {
  242. ssa_fprintf(f, "null");
  243. } else {
  244. ssa_fprintf(f, "inttoptr (");
  245. ssa_print_type(f, m->sizes, t_int);
  246. ssa_fprintf(f, " %llu to ", value.value_integer);
  247. ssa_print_type(f, m->sizes, t_rawptr);
  248. ssa_fprintf(f, ")");
  249. }
  250. } else {
  251. ssa_fprintf(f, "%lld", value.value_integer);
  252. }
  253. } break;
  254. case ExactValue_Float: {
  255. u64 u = *cast(u64*)&value.value_float;
  256. if (is_type_float(type) && type->Basic.kind == Basic_f32) {
  257. // IMPORTANT NOTE(bill): LLVM requires all floating point constants to be
  258. // a 64 bit number if bits_of(float type) <= 64.
  259. // For some bizarre reason, you need to clear the bottom 29 bits
  260. // https://groups.google.com/forum/#!topic/llvm-dev/IlqV3TbSk6M
  261. u >>= 29;
  262. u <<= 29;
  263. }
  264. ssa_fprintf(f, "0x%016llx", u);
  265. } break;
  266. case ExactValue_Pointer:
  267. if (value.value_pointer == NULL) {
  268. ssa_fprintf(f, "null");
  269. } else {
  270. ssa_fprintf(f, "inttoptr (");
  271. ssa_print_type(f, m->sizes, t_int);
  272. ssa_fprintf(f, " %llu to ", cast(u64)cast(uintptr)value.value_pointer);
  273. ssa_print_type(f, m->sizes, t_rawptr);
  274. ssa_fprintf(f, ")");
  275. }
  276. break;
  277. default:
  278. GB_PANIC("Invalid ExactValue: %d", value.kind);
  279. break;
  280. }
  281. }
  282. void ssa_print_block_name(ssaFileBuffer *f, ssaBlock *b) {
  283. ssa_print_escape_string(f, b->label, false);
  284. ssa_fprintf(f, "-%d", b->id);
  285. }
  286. void ssa_print_value(ssaFileBuffer *f, ssaModule *m, ssaValue *value, Type *type_hint) {
  287. if (value == NULL) {
  288. ssa_fprintf(f, "!!!NULL_VALUE");
  289. return;
  290. }
  291. switch (value->kind) {
  292. case ssaValue_Constant:
  293. ssa_print_exact_value(f, m, value->Constant.value, type_hint);
  294. break;
  295. case ssaValue_TypeName:
  296. ssa_print_encoded_local(f, value->TypeName.name);
  297. break;
  298. case ssaValue_Global:
  299. ssa_print_encoded_global(f, value->Global.entity->token.string);
  300. break;
  301. case ssaValue_Param:
  302. ssa_print_encoded_local(f, value->Param.entity->token.string);
  303. break;
  304. case ssaValue_Proc:
  305. ssa_print_encoded_global(f, value->Proc.name, (value->Proc.tags & ProcTag_foreign) != 0);
  306. break;
  307. case ssaValue_Instr:
  308. ssa_fprintf(f, "%%%d", value->id);
  309. break;
  310. }
  311. }
  312. void ssa_print_instr(ssaFileBuffer *f, ssaModule *m, ssaValue *value) {
  313. GB_ASSERT(value->kind == ssaValue_Instr);
  314. ssaInstr *instr = &value->Instr;
  315. ssa_fprintf(f, "\t");
  316. switch (instr->kind) {
  317. case ssaInstr_StartupRuntime: {
  318. ssa_fprintf(f, "call void ");
  319. ssa_print_encoded_global(f, make_string(SSA_STARTUP_RUNTIME_PROC_NAME));
  320. ssa_fprintf(f, "()\n");
  321. } break;
  322. case ssaInstr_Comment:
  323. ssa_fprintf(f, "; %.*s\n", LIT(instr->Comment.text));
  324. break;
  325. case ssaInstr_Local: {
  326. Type *type = instr->Local.entity->type;
  327. ssa_fprintf(f, "%%%d = alloca ", value->id);
  328. ssa_print_type(f, m->sizes, type);
  329. ssa_fprintf(f, ", align %lld\n", type_align_of(m->sizes, m->allocator, type));
  330. if (instr->Local.zero_initialized) {
  331. ssa_fprintf(f, "\tstore ");
  332. ssa_print_type(f, m->sizes, type);
  333. ssa_fprintf(f, " zeroinitializer, ");
  334. ssa_print_type(f, m->sizes, type);
  335. ssa_fprintf(f, "* %%%d\n", value->id);
  336. }
  337. } break;
  338. case ssaInstr_Store: {
  339. Type *type = ssa_type(instr);
  340. ssa_fprintf(f, "store ");
  341. ssa_print_type(f, m->sizes, type);
  342. ssa_fprintf(f, " ");
  343. ssa_print_value(f, m, instr->Store.value, type);
  344. ssa_fprintf(f, ", ");
  345. ssa_print_type(f, m->sizes, type);
  346. ssa_fprintf(f, "* ");
  347. ssa_print_value(f, m, instr->Store.address, type);
  348. ssa_fprintf(f, "\n");
  349. } break;
  350. case ssaInstr_Load: {
  351. Type *type = instr->Load.type;
  352. ssa_fprintf(f, "%%%d = load ", value->id);
  353. ssa_print_type(f, m->sizes, type);
  354. ssa_fprintf(f, ", ");
  355. ssa_print_type(f, m->sizes, type);
  356. ssa_fprintf(f, "* ");
  357. ssa_print_value(f, m, instr->Load.address, type);
  358. ssa_fprintf(f, ", align %lld\n", type_align_of(m->sizes, m->allocator, type));
  359. } break;
  360. case ssaInstr_GetElementPtr: {
  361. Type *et = instr->GetElementPtr.elem_type;
  362. ssa_fprintf(f, "%%%d = getelementptr ", value->id);
  363. if (instr->GetElementPtr.inbounds) {
  364. ssa_fprintf(f, "inbounds ");
  365. }
  366. ssa_print_type(f, m->sizes, type_deref(et));
  367. ssa_fprintf(f, ", ");
  368. ssa_print_type(f, m->sizes, et);
  369. ssa_fprintf(f, " ");
  370. ssa_print_value(f, m, instr->GetElementPtr.address, et);
  371. for (isize i = 0; i < instr->GetElementPtr.index_count; i++) {
  372. ssaValue *index = instr->GetElementPtr.indices[i];
  373. Type *t = ssa_type(index);
  374. ssa_fprintf(f, ", ");
  375. ssa_print_type(f, m->sizes, t);
  376. ssa_fprintf(f, " ");
  377. ssa_print_value(f, m, index, t);
  378. }
  379. ssa_fprintf(f, "\n");
  380. } break;
  381. case ssaInstr_ExtractValue: {
  382. Type *et = instr->ExtractValue.elem_type;
  383. ssa_fprintf(f, "%%%d = extractvalue ", value->id);
  384. ssa_print_type(f, m->sizes, et);
  385. ssa_fprintf(f, " ");
  386. ssa_print_value(f, m, instr->ExtractValue.address, et);
  387. ssa_fprintf(f, ", %d\n", instr->ExtractValue.index);
  388. } break;
  389. case ssaInstr_NoOp: {;
  390. ssa_fprintf(f, "%%%d = add i32 0, 0\n", value->id);
  391. } break;
  392. case ssaInstr_Br: {;
  393. ssa_fprintf(f, "br ");
  394. if (instr->Br.cond != NULL) {
  395. ssa_print_type(f, m->sizes, t_bool);
  396. ssa_fprintf(f, " ");
  397. ssa_print_value(f, m, instr->Br.cond, t_bool);
  398. ssa_fprintf(f, ", ", instr->Br.cond->id);
  399. }
  400. ssa_fprintf(f, "label ");
  401. ssa_fprintf(f, "%%"); ssa_print_block_name(f, instr->Br.true_block);
  402. if (instr->Br.false_block != NULL) {
  403. ssa_fprintf(f, ", label ");
  404. ssa_fprintf(f, "%%"); ssa_print_block_name(f, instr->Br.false_block);
  405. }
  406. ssa_fprintf(f, "\n");
  407. } break;
  408. case ssaInstr_Ret: {
  409. auto *ret = &instr->Ret;
  410. ssa_fprintf(f, "ret ");
  411. if (ret->value == NULL) {
  412. ssa_fprintf(f, "void");
  413. } else {
  414. Type *t = ssa_type(ret->value);
  415. ssa_print_type(f, m->sizes, t);
  416. ssa_fprintf(f, " ");
  417. ssa_print_value(f, m, ret->value, t);
  418. }
  419. ssa_fprintf(f, "\n");
  420. } break;
  421. case ssaInstr_Conv: {
  422. auto *c = &instr->Conv;
  423. ssa_fprintf(f, "%%%d = %.*s ", value->id, LIT(ssa_conv_strings[c->kind]));
  424. ssa_print_type(f, m->sizes, c->from);
  425. ssa_fprintf(f, " ");
  426. ssa_print_value(f, m, c->value, c->from);
  427. ssa_fprintf(f, " to ");
  428. ssa_print_type(f, m->sizes, c->to);
  429. ssa_fprintf(f, "\n");
  430. } break;
  431. case ssaInstr_Unreachable: {
  432. ssa_fprintf(f, "unreachable\n");
  433. } break;
  434. case ssaInstr_BinaryOp: {
  435. auto *bo = &value->Instr.BinaryOp;
  436. Type *type = get_base_type(ssa_type(bo->left));
  437. Type *elem_type = type;
  438. while (elem_type->kind == Type_Vector) {
  439. elem_type = get_base_type(elem_type->Vector.elem);
  440. }
  441. ssa_fprintf(f, "%%%d = ", value->id);
  442. if (gb_is_between(bo->op.kind, Token__ComparisonBegin+1, Token__ComparisonEnd-1)) {
  443. if (is_type_string(elem_type)) {
  444. ssa_fprintf(f, "call ");
  445. ssa_print_type(f, m->sizes, t_bool);
  446. char *runtime_proc = "";
  447. switch (bo->op.kind) {
  448. case Token_CmpEq: runtime_proc = "__string_eq"; break;
  449. case Token_NotEq: runtime_proc = "__string_ne"; break;
  450. case Token_Lt: runtime_proc = "__string_lt"; break;
  451. case Token_Gt: runtime_proc = "__string_gt"; break;
  452. case Token_LtEq: runtime_proc = "__string_le"; break;
  453. case Token_GtEq: runtime_proc = "__string_gt"; break;
  454. }
  455. ssa_fprintf(f, " ");
  456. ssa_print_encoded_global(f, make_string(runtime_proc), false);
  457. ssa_fprintf(f, "(");
  458. ssa_print_type(f, m->sizes, type);
  459. ssa_fprintf(f, " ");
  460. ssa_print_value(f, m, bo->left, type);
  461. ssa_fprintf(f, ", ");
  462. ssa_print_type(f, m->sizes, type);
  463. ssa_fprintf(f, " ");
  464. ssa_print_value(f, m, bo->right, type);
  465. ssa_fprintf(f, ")\n");
  466. return;
  467. } else if (is_type_float(elem_type)) {
  468. ssa_fprintf(f, "fcmp ");
  469. switch (bo->op.kind) {
  470. case Token_CmpEq: ssa_fprintf(f, "oeq"); break;
  471. case Token_NotEq: ssa_fprintf(f, "one"); break;
  472. case Token_Lt: ssa_fprintf(f, "olt"); break;
  473. case Token_Gt: ssa_fprintf(f, "ogt"); break;
  474. case Token_LtEq: ssa_fprintf(f, "ole"); break;
  475. case Token_GtEq: ssa_fprintf(f, "oge"); break;
  476. }
  477. } else {
  478. ssa_fprintf(f, "icmp ");
  479. if (bo->op.kind != Token_CmpEq &&
  480. bo->op.kind != Token_NotEq) {
  481. if (is_type_unsigned(elem_type)) {
  482. ssa_fprintf(f, "u");
  483. } else {
  484. ssa_fprintf(f, "s");
  485. }
  486. }
  487. switch (bo->op.kind) {
  488. case Token_CmpEq: ssa_fprintf(f, "eq"); break;
  489. case Token_NotEq: ssa_fprintf(f, "ne"); break;
  490. case Token_Lt: ssa_fprintf(f, "lt"); break;
  491. case Token_Gt: ssa_fprintf(f, "gt"); break;
  492. case Token_LtEq: ssa_fprintf(f, "le"); break;
  493. case Token_GtEq: ssa_fprintf(f, "ge"); break;
  494. }
  495. }
  496. } else {
  497. if (is_type_float(elem_type))
  498. ssa_fprintf(f, "f");
  499. switch (bo->op.kind) {
  500. case Token_Add: ssa_fprintf(f, "add"); break;
  501. case Token_Sub: ssa_fprintf(f, "sub"); break;
  502. case Token_And: ssa_fprintf(f, "and"); break;
  503. case Token_Or: ssa_fprintf(f, "or"); break;
  504. case Token_Xor: ssa_fprintf(f, "xor"); break;
  505. case Token_Shl: ssa_fprintf(f, "shl"); break;
  506. case Token_Shr: ssa_fprintf(f, "lshr"); break;
  507. case Token_Mul: ssa_fprintf(f, "mul"); break;
  508. case Token_Not: ssa_fprintf(f, "xor"); break;
  509. case Token_AndNot: GB_PANIC("Token_AndNot Should never be called");
  510. default: {
  511. if (!is_type_float(elem_type)) {
  512. if (is_type_unsigned(elem_type)) ssa_fprintf(f, "u");
  513. else ssa_fprintf(f, "s");
  514. }
  515. switch (bo->op.kind) {
  516. case Token_Quo: ssa_fprintf(f, "div"); break;
  517. case Token_Mod: ssa_fprintf(f, "rem"); break;
  518. }
  519. } break;
  520. }
  521. }
  522. ssa_fprintf(f, " ");
  523. ssa_print_type(f, m->sizes, type);
  524. ssa_fprintf(f, " ");
  525. ssa_print_value(f, m, bo->left, type);
  526. ssa_fprintf(f, ", ");
  527. ssa_print_value(f, m, bo->right, type);
  528. ssa_fprintf(f, "\n");
  529. } break;
  530. case ssaInstr_Call: {
  531. auto *call = &instr->Call;
  532. Type *result_type = call->type;
  533. if (result_type) {
  534. ssa_fprintf(f, "%%%d = ", value->id);
  535. }
  536. ssa_fprintf(f, "call ");
  537. if (result_type) {
  538. ssa_print_type(f, m->sizes, result_type);
  539. } else {
  540. ssa_fprintf(f, "void");
  541. }
  542. ssa_fprintf(f, " ");
  543. ssa_print_value(f, m, call->value, call->type);
  544. ssa_fprintf(f, "(");
  545. if (call->arg_count > 0) {
  546. Type *proc_type = get_base_type(ssa_type(call->value));
  547. GB_ASSERT(proc_type->kind == Type_Proc);
  548. auto *params = &proc_type->Proc.params->Tuple;
  549. for (isize i = 0; i < call->arg_count; i++) {
  550. Entity *e = params->variables[i];
  551. GB_ASSERT(e != NULL);
  552. Type *t = e->type;
  553. if (i > 0) {
  554. ssa_fprintf(f, ", ");
  555. }
  556. ssa_print_type(f, m->sizes, t);
  557. ssa_fprintf(f, " ");
  558. ssaValue *arg = call->args[i];
  559. ssa_print_value(f, m, arg, t);
  560. }
  561. }
  562. ssa_fprintf(f, ")\n");
  563. } break;
  564. case ssaInstr_Select: {
  565. ssa_fprintf(f, "%%%d = select i1 ", value->id);
  566. ssa_print_value(f, m, instr->Select.cond, t_bool);
  567. ssa_fprintf(f, ", ");
  568. ssa_print_type(f, m->sizes, ssa_type(instr->Select.true_value));
  569. ssa_fprintf(f, " ");
  570. ssa_print_value(f, m, instr->Select.true_value, ssa_type(instr->Select.true_value));
  571. ssa_fprintf(f, ", ");
  572. ssa_print_type(f, m->sizes, ssa_type(instr->Select.false_value));
  573. ssa_fprintf(f, " ");
  574. ssa_print_value(f, m, instr->Select.false_value, ssa_type(instr->Select.false_value));
  575. ssa_fprintf(f, "\n");
  576. } break;
  577. case ssaInstr_ExtractElement: {
  578. Type *vt = ssa_type(instr->ExtractElement.vector);
  579. ssa_fprintf(f, "%%%d = extractelement ", value->id);
  580. ssa_print_type(f, m->sizes, vt);
  581. ssa_fprintf(f, " ");
  582. ssa_print_value(f, m, instr->ExtractElement.vector, vt);
  583. ssa_fprintf(f, ", ");
  584. Type *it = ssa_type(instr->ExtractElement.index);
  585. ssa_print_type(f, m->sizes, it);
  586. ssa_fprintf(f, " ");
  587. ssa_print_value(f, m, instr->ExtractElement.index, it);
  588. ssa_fprintf(f, "\n");
  589. } break;
  590. case ssaInstr_InsertElement: {
  591. auto *ie = &instr->InsertElement;
  592. Type *vt = ssa_type(ie->vector);
  593. ssa_fprintf(f, "%%%d = insertelement ", value->id);
  594. ssa_print_type(f, m->sizes, vt);
  595. ssa_fprintf(f, " ");
  596. ssa_print_value(f, m, ie->vector, vt);
  597. ssa_fprintf(f, ", ");
  598. ssa_print_type(f, m->sizes, ssa_type(ie->elem));
  599. ssa_fprintf(f, " ");
  600. ssa_print_value(f, m, ie->elem, ssa_type(ie->elem));
  601. ssa_fprintf(f, ", ");
  602. ssa_print_type(f, m->sizes, ssa_type(ie->index));
  603. ssa_fprintf(f, " ");
  604. ssa_print_value(f, m, ie->index, ssa_type(ie->index));
  605. ssa_fprintf(f, "\n");
  606. } break;
  607. case ssaInstr_ShuffleVector: {
  608. auto *sv = &instr->ShuffleVector;
  609. Type *vt = ssa_type(sv->vector);
  610. ssa_fprintf(f, "%%%d = shufflevector ", value->id);
  611. ssa_print_type(f, m->sizes, vt);
  612. ssa_fprintf(f, " ");
  613. ssa_print_value(f, m, sv->vector, vt);
  614. ssa_fprintf(f, ", ");
  615. ssa_print_type(f, m->sizes, vt);
  616. ssa_fprintf(f, " ");
  617. ssa_print_value(f, m, sv->vector, vt);
  618. ssa_fprintf(f, ", ");
  619. ssa_fprintf(f, "<%td x i32> <", sv->index_count);
  620. for (isize i = 0; i < sv->index_count; i++) {
  621. if (i > 0) {
  622. ssa_fprintf(f, ", ");
  623. }
  624. ssa_fprintf(f, "i32 %d", sv->indices[i]);
  625. }
  626. ssa_fprintf(f, ">");
  627. ssa_fprintf(f, "\n");
  628. } break;
  629. default: {
  630. GB_PANIC("<unknown instr> %d\n", instr->kind);
  631. ssa_fprintf(f, "; <unknown instr> %d\n", instr->kind);
  632. } break;
  633. }
  634. }
  635. void ssa_print_proc(ssaFileBuffer *f, ssaModule *m, ssaProcedure *proc) {
  636. if (proc->body == NULL) {
  637. ssa_fprintf(f, "\ndeclare ");
  638. } else {
  639. ssa_fprintf(f, "\ndefine ");
  640. }
  641. auto *proc_type = &proc->type->Proc;
  642. if (proc_type->result_count == 0) {
  643. ssa_fprintf(f, "void");
  644. } else {
  645. ssa_print_type(f, m->sizes, proc_type->results);
  646. }
  647. ssa_fprintf(f, " ");
  648. if (are_strings_equal(proc->name, make_string("main"))) {
  649. ssa_print_encoded_global(f, proc->name, true);
  650. } else {
  651. ssa_print_encoded_global(f, proc->name, (proc->tags & ProcTag_foreign) != 0);
  652. }
  653. ssa_fprintf(f, "(");
  654. if (proc_type->param_count > 0) {
  655. auto *params = &proc_type->params->Tuple;
  656. for (isize i = 0; i < params->variable_count; i++) {
  657. Entity *e = params->variables[i];
  658. if (i > 0) {
  659. ssa_fprintf(f, ", ");
  660. }
  661. ssa_print_type(f, m->sizes, e->type);
  662. ssa_fprintf(f, " %%%.*s", LIT(e->token.string));
  663. }
  664. }
  665. ssa_fprintf(f, ") ");
  666. if (proc->tags != 0) {
  667. if (proc->tags & ProcTag_inline) {
  668. ssa_fprintf(f, "alwaysinline ");
  669. }
  670. if (proc->tags & ProcTag_no_inline) {
  671. ssa_fprintf(f, "noinline ");
  672. }
  673. if (proc->tags & ProcTag_foreign) {
  674. // TODO(bill): Set calling convention
  675. ssa_fprintf(f, "; foreign\n");
  676. }
  677. }
  678. if (proc->body != NULL) {
  679. ssa_fprintf(f, "{\n");
  680. gb_for_array(i, proc->blocks) {
  681. ssaBlock *block = proc->blocks[i];
  682. if (i > 0) ssa_fprintf(f, "\n");
  683. ssa_print_block_name(f, block);
  684. ssa_fprintf(f, ":\n");
  685. gb_for_array(j, block->instrs) {
  686. ssaValue *value = block->instrs[j];
  687. ssa_print_instr(f, m, value);
  688. }
  689. }
  690. ssa_fprintf(f, "}\n");
  691. }
  692. gb_for_array(i, proc->children) {
  693. ssa_print_proc(f, m, proc->children[i]);
  694. }
  695. }
  696. void ssa_print_type_name(ssaFileBuffer *f, ssaModule *m, ssaValue *v) {
  697. GB_ASSERT(v->kind == ssaValue_TypeName);
  698. Type *base_type = get_base_type(ssa_type(v));
  699. if (!is_type_struct(base_type) && !is_type_union(base_type)) {
  700. return;
  701. }
  702. ssa_print_encoded_local(f, v->TypeName.name);
  703. ssa_fprintf(f, " = type ");
  704. ssa_print_type(f, m->sizes, get_base_type(v->TypeName.type));
  705. ssa_fprintf(f, "\n");
  706. }
  707. void ssa_print_llvm_ir(ssaFileBuffer *f, ssaModule *m) {
  708. if (m->layout.len > 0) {
  709. ssa_fprintf(f, "target datalayout = \"%.*s\"\n", LIT(m->layout));
  710. }
  711. ssa_print_encoded_local(f, make_string("..string"));
  712. ssa_fprintf(f, " = type {i8*, ");
  713. ssa_print_type(f, m->sizes, t_int);
  714. ssa_fprintf(f, "} ; Basic_string\n");
  715. ssa_print_encoded_local(f, make_string("..rawptr"));
  716. ssa_fprintf(f, " = type i8* ; Basic_rawptr\n\n");
  717. gb_for_array(member_index, m->members.entries) {
  718. auto *entry = &m->members.entries[member_index];
  719. ssaValue *v = entry->value;
  720. switch (v->kind) {
  721. case ssaValue_TypeName:
  722. ssa_print_type_name(f, m, v);
  723. break;
  724. }
  725. }
  726. gb_for_array(member_index, m->members.entries) {
  727. auto *entry = &m->members.entries[member_index];
  728. ssaValue *v = entry->value;
  729. switch (v->kind) {
  730. case ssaValue_Global: {
  731. auto *g = &v->Global;
  732. ssa_print_encoded_global(f, g->entity->token.string);
  733. ssa_fprintf(f, " = ");
  734. if (g->is_thread_local) {
  735. ssa_fprintf(f, "thread_local ");
  736. }
  737. if (g->is_constant) {
  738. if (g->is_private) {
  739. ssa_fprintf(f, "private ");
  740. }
  741. ssa_fprintf(f, "constant ");
  742. } else {
  743. ssa_fprintf(f, "global ");
  744. }
  745. ssa_print_type(f, m->sizes, g->entity->type);
  746. ssa_fprintf(f, " ");
  747. if (g->value != NULL) {
  748. ssa_print_value(f, m, g->value, g->entity->type);
  749. } else {
  750. ssa_fprintf(f, "zeroinitializer");
  751. }
  752. ssa_fprintf(f, "\n");
  753. } break;
  754. case ssaValue_Proc: {
  755. ssa_print_proc(f, m, &v->Proc);
  756. } break;
  757. }
  758. }
  759. }