print_llvm.cpp 22 KB

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