print_llvm.cpp 24 KB

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