fmt.odin 40 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611
  1. package fmt
  2. import "core:runtime"
  3. import "core:os"
  4. import "core:mem"
  5. import "core:math/bits"
  6. import "core:unicode/utf8"
  7. import "core:strconv"
  8. import "core:strings"
  9. import "core:reflect"
  10. @private
  11. DEFAULT_BUFFER_SIZE :: 1<<12;
  12. Info :: struct {
  13. minus: bool,
  14. plus: bool,
  15. space: bool,
  16. zero: bool,
  17. hash: bool,
  18. width_set: bool,
  19. prec_set: bool,
  20. width: int,
  21. prec: int,
  22. indent: int,
  23. reordered: bool,
  24. good_arg_index: bool,
  25. buf: ^strings.Builder,
  26. arg: any, // Temporary
  27. record_level: int,
  28. }
  29. fprint :: proc(fd: os.Handle, args: ..any) -> int {
  30. data: [DEFAULT_BUFFER_SIZE]byte;
  31. buf := strings.builder_from_slice(data[:]);
  32. res := sbprint(&buf, ..args);
  33. os.write_string(fd, res);
  34. return len(res);
  35. }
  36. fprintln :: proc(fd: os.Handle, args: ..any) -> int {
  37. data: [DEFAULT_BUFFER_SIZE]byte;
  38. buf := strings.builder_from_slice(data[:]);
  39. res := sbprintln(&buf, ..args);
  40. os.write_string(fd, res);
  41. return len(res);
  42. }
  43. fprintf :: proc(fd: os.Handle, fmt: string, args: ..any) -> int {
  44. data: [DEFAULT_BUFFER_SIZE]byte;
  45. buf := strings.builder_from_slice(data[:]);
  46. res := sbprintf(&buf, fmt, ..args);
  47. os.write_string(fd, res);
  48. return len(res);
  49. }
  50. // print* procedures return the number of bytes written
  51. print :: proc(args: ..any) -> int { return fprint(context.stdout, ..args); }
  52. println :: proc(args: ..any) -> int { return fprintln(context.stdout, ..args); }
  53. printf :: proc(fmt: string, args: ..any) -> int { return fprintf(context.stdout, fmt, ..args); }
  54. eprint :: proc(args: ..any) -> int { return fprint(context.stderr, ..args); }
  55. eprintln :: proc(args: ..any) -> int { return fprintln(context.stderr, ..args); }
  56. eprintf :: proc(fmt: string, args: ..any) -> int { return fprintf(context.stderr, fmt, ..args); }
  57. @(deprecated="prefer eprint") print_err :: proc(args: ..any) -> int { return eprint(..args); }
  58. @(deprecated="prefer eprintf") printf_err :: proc(fmt: string, args: ..any) -> int { return eprintf(fmt, ..args); }
  59. @(deprecated="prefer eprintln") println_err :: proc(args: ..any) -> int { return eprintln(..args); }
  60. // aprint* procedures return a string that was allocated with the current context
  61. // They must be freed accordingly
  62. aprint :: proc(args: ..any) -> string {
  63. str := strings.make_builder();
  64. sbprint(&str, ..args);
  65. return strings.to_string(str);
  66. }
  67. aprintln :: proc(args: ..any) -> string {
  68. str := strings.make_builder();
  69. sbprintln(&str, ..args);
  70. return strings.to_string(str);
  71. }
  72. aprintf :: proc(fmt: string, args: ..any) -> string {
  73. str := strings.make_builder();
  74. sbprintf(&str, fmt, ..args);
  75. return strings.to_string(str);
  76. }
  77. // tprint* procedures return a string that was allocated with the current context's temporary allocator
  78. tprint :: proc(args: ..any) -> string {
  79. str := strings.make_builder(context.temp_allocator);
  80. sbprint(&str, ..args);
  81. return strings.to_string(str);
  82. }
  83. tprintln :: proc(args: ..any) -> string {
  84. str := strings.make_builder(context.temp_allocator);
  85. sbprintln(&str, ..args);
  86. return strings.to_string(str);
  87. }
  88. tprintf :: proc(fmt: string, args: ..any) -> string {
  89. str := strings.make_builder(context.temp_allocator);
  90. sbprintf(&str, fmt, ..args);
  91. return strings.to_string(str);
  92. }
  93. // bprint* procedures return a string using a buffer from an array
  94. bprint :: proc(buf: []byte, args: ..any) -> string {
  95. sb := strings.builder_from_slice(buf[0:len(buf)]);
  96. return sbprint(&sb, ..args);
  97. }
  98. bprintln :: proc(buf: []byte, args: ..any) -> string {
  99. sb := strings.builder_from_slice(buf[0:len(buf)]);
  100. return sbprintln(&sb, ..args);
  101. }
  102. bprintf :: proc(buf: []byte, fmt: string, args: ..any) -> string {
  103. sb := strings.builder_from_slice(buf[0:len(buf)]);
  104. return sbprintf(&sb, fmt, ..args);
  105. }
  106. assertf :: proc "contextless" (condition: bool, fmt: string, args: ..any, loc := #caller_location) -> bool {
  107. if !condition {
  108. p := context.assertion_failure_proc;
  109. if p == nil {
  110. p = runtime.default_assertion_failure_proc;
  111. }
  112. message := tprintf(fmt, ..args);
  113. p("Runtime assertion", message, loc);
  114. }
  115. return condition;
  116. }
  117. panicf :: proc "contextless" (fmt: string, args: ..any, loc := #caller_location) {
  118. p := context.assertion_failure_proc;
  119. if p == nil {
  120. p = runtime.default_assertion_failure_proc;
  121. }
  122. message := tprintf(fmt, ..args);
  123. p("Panic", message, loc);
  124. }
  125. fprint_type :: proc(fd: os.Handle, info: ^runtime.Type_Info) {
  126. data: [DEFAULT_BUFFER_SIZE]byte;
  127. buf := strings.builder_from_slice(data[:]);
  128. reflect.write_type(&buf, info);
  129. os.write_string(fd, strings.to_string(buf));
  130. }
  131. sbprint :: proc(buf: ^strings.Builder, args: ..any) -> string {
  132. fi: Info;
  133. prev_string := false;
  134. fi.buf = buf;
  135. for arg, i in args {
  136. is_string := arg != nil && reflect.is_string(type_info_of(arg.id));
  137. if i > 0 && !is_string && !prev_string {
  138. strings.write_byte(buf, ' ');
  139. }
  140. fmt_value(&fi, args[i], 'v');
  141. prev_string = is_string;
  142. }
  143. return strings.to_string(buf^);
  144. }
  145. sbprintln :: proc(buf: ^strings.Builder, args: ..any) -> string {
  146. fi: Info;
  147. fi.buf = buf;
  148. for _, i in args {
  149. if i > 0 do strings.write_byte(buf, ' ');
  150. fmt_value(&fi, args[i], 'v');
  151. }
  152. strings.write_byte(buf, '\n');
  153. return strings.to_string(buf^);
  154. }
  155. sbprintf :: proc(b: ^strings.Builder, fmt: string, args: ..any) -> string {
  156. fi: Info;
  157. arg_index: int = 0;
  158. end := len(fmt);
  159. was_prev_index := false;
  160. loop: for i := 0; i < end; /**/ {
  161. fi = Info{buf = b, good_arg_index = true};
  162. prev_i := i;
  163. for i < end && fmt[i] != '%' {
  164. i += 1;
  165. }
  166. if i > prev_i {
  167. strings.write_string(b, fmt[prev_i:i]);
  168. }
  169. if i >= end {
  170. break loop;
  171. }
  172. // Process a "verb"
  173. i += 1;
  174. prefix_loop: for ; i < end; i += 1 {
  175. switch fmt[i] {
  176. case '+':
  177. fi.plus = true;
  178. case '-':
  179. fi.minus = true;
  180. fi.zero = false;
  181. case ' ':
  182. fi.space = true;
  183. case '#':
  184. fi.hash = true;
  185. case '0':
  186. fi.zero = !fi.minus;
  187. case:
  188. break prefix_loop;
  189. }
  190. }
  191. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args));
  192. // Width
  193. if i < end && fmt[i] == '*' {
  194. i += 1;
  195. fi.width, arg_index, fi.width_set = int_from_arg(args, arg_index);
  196. if !fi.width_set {
  197. strings.write_string(b, "%!(BAD WIDTH)");
  198. }
  199. if fi.width < 0 {
  200. fi.width = -fi.width;
  201. fi.minus = true;
  202. fi.zero = false;
  203. }
  204. was_prev_index = false;
  205. } else {
  206. fi.width, i, fi.width_set = _parse_int(fmt, i);
  207. if was_prev_index && fi.width_set { // %[6]2d
  208. fi.good_arg_index = false;
  209. }
  210. }
  211. // Precision
  212. if i < end && fmt[i] == '.' {
  213. i += 1;
  214. if was_prev_index { // %[6].2d
  215. fi.good_arg_index = false;
  216. }
  217. if i < end && fmt[i] == '*' {
  218. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args));
  219. i += 1;
  220. fi.prec, arg_index, fi.prec_set = int_from_arg(args, arg_index);
  221. if fi.prec < 0 {
  222. fi.prec = 0;
  223. fi.prec_set = false;
  224. }
  225. if !fi.prec_set {
  226. strings.write_string(fi.buf, "%!(BAD PRECISION)");
  227. }
  228. was_prev_index = false;
  229. } else {
  230. fi.prec, i, fi.prec_set = _parse_int(fmt, i);
  231. if !fi.prec_set {
  232. // fi.prec_set = true;
  233. // fi.prec = 0;
  234. }
  235. }
  236. }
  237. if !was_prev_index {
  238. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args));
  239. }
  240. if i >= end {
  241. strings.write_string(b, "%!(NO VERB)");
  242. break loop;
  243. }
  244. verb, w := utf8.decode_rune_in_string(fmt[i:]);
  245. i += w;
  246. switch {
  247. case verb == '%':
  248. strings.write_byte(b, '%');
  249. case !fi.good_arg_index:
  250. strings.write_string(b, "%!(BAD ARGUMENT NUMBER)");
  251. case arg_index >= len(args):
  252. strings.write_string(b, "%!(MISSING ARGUMENT)");
  253. case:
  254. fmt_arg(&fi, args[arg_index], verb);
  255. arg_index += 1;
  256. }
  257. }
  258. if !fi.reordered && arg_index < len(args) {
  259. strings.write_string(b, "%!(EXTRA ");
  260. for arg, index in args[arg_index:] {
  261. if index > 0 do strings.write_string(b, ", ");
  262. if arg == nil do strings.write_string(b, "<nil>");
  263. else do fmt_arg(&fi, args[index], 'v');
  264. }
  265. strings.write_string(b, ")");
  266. }
  267. return strings.to_string(b^);
  268. }
  269. _parse_int :: proc(s: string, offset: int) -> (result: int, new_offset: int, ok: bool) {
  270. is_digit :: inline proc(r: byte) -> bool { return '0' <= r && r <= '9' }
  271. new_offset = offset;
  272. for new_offset <= len(s) {
  273. c := s[new_offset];
  274. if !is_digit(c) do break;
  275. new_offset += 1;
  276. result *= 10;
  277. result += int(c)-'0';
  278. }
  279. ok = new_offset > offset;
  280. return;
  281. }
  282. _arg_number :: proc(fi: ^Info, arg_index: int, format: string, offset, arg_count: int) -> (index, new_offset: int, ok: bool) {
  283. parse_arg_number :: proc(format: string) -> (int, int, bool) {
  284. if len(format) < 3 do return 0, 1, false;
  285. for i in 1..<len(format) {
  286. if format[i] == ']' {
  287. width, new_index, ok := _parse_int(format, 1);
  288. if !ok || new_index != i {
  289. return 0, i+1, false;
  290. }
  291. return width-1, i+1, true;
  292. }
  293. }
  294. return 0, 1, false;
  295. }
  296. if len(format) <= offset || format[offset] != '[' {
  297. return arg_index, offset, false;
  298. }
  299. fi.reordered = true;
  300. width: int;
  301. index, width, ok = parse_arg_number(format[offset:]);
  302. if ok && 0 <= index && index < arg_count {
  303. return index, offset+width, true;
  304. }
  305. fi.good_arg_index = false;
  306. return arg_index, offset+width, false;
  307. }
  308. int_from_arg :: proc(args: []any, arg_index: int) -> (int, int, bool) {
  309. num := 0;
  310. new_arg_index := arg_index;
  311. ok := true;
  312. if arg_index < len(args) {
  313. arg := args[arg_index];
  314. arg.id = runtime.typeid_base(arg.id);
  315. switch i in arg {
  316. case int: num = i;
  317. case i8: num = int(i);
  318. case i16: num = int(i);
  319. case i32: num = int(i);
  320. case i64: num = int(i);
  321. case u8: num = int(i);
  322. case u16: num = int(i);
  323. case u32: num = int(i);
  324. case u64: num = int(i);
  325. case:
  326. ok = false;
  327. }
  328. }
  329. if ok {
  330. new_arg_index += 1;
  331. }
  332. return num, new_arg_index, ok;
  333. }
  334. fmt_bad_verb :: proc(using fi: ^Info, verb: rune) {
  335. strings.write_string(buf, "%!");
  336. strings.write_rune(buf, verb);
  337. strings.write_byte(buf, '(');
  338. if arg.id != nil {
  339. reflect.write_typeid(buf, arg.id);
  340. strings.write_byte(buf, '=');
  341. fmt_value(fi, arg, 'v');
  342. } else {
  343. strings.write_string(buf, "<nil>");
  344. }
  345. strings.write_byte(buf, ')');
  346. }
  347. fmt_bool :: proc(using fi: ^Info, b: bool, verb: rune) {
  348. switch verb {
  349. case 't', 'v':
  350. strings.write_string(buf, b ? "true" : "false");
  351. case:
  352. fmt_bad_verb(fi, verb);
  353. }
  354. }
  355. fmt_write_padding :: proc(fi: ^Info, width: int) {
  356. if width <= 0 do return;
  357. pad_byte: byte = '0';
  358. if fi.space do pad_byte = ' ';
  359. for i := 0; i < width; i += 1 {
  360. strings.write_byte(fi.buf, pad_byte);
  361. }
  362. }
  363. _fmt_int :: proc(fi: ^Info, u: u64, base: int, is_signed: bool, bit_size: int, digits: string) {
  364. _, neg := strconv.is_integer_negative(u, is_signed, bit_size);
  365. BUF_SIZE :: 256;
  366. if fi.width_set || fi.prec_set {
  367. width := fi.width + fi.prec + 3; // 3 extra bytes for sign and prefix
  368. if width > BUF_SIZE {
  369. // TODO(bill):????
  370. panic("_fmt_int: buffer overrun. Width and precision too big");
  371. }
  372. }
  373. prec := 0;
  374. if fi.prec_set {
  375. prec = fi.prec;
  376. if prec == 0 && u == 0 {
  377. prev_zero := fi.zero;
  378. fi.zero = false;
  379. fmt_write_padding(fi, fi.width);
  380. fi.zero = prev_zero;
  381. return;
  382. }
  383. } else if fi.zero && fi.width_set {
  384. prec = fi.width;
  385. if neg || fi.plus || fi.space {
  386. // There needs to be space for the "sign"
  387. prec -= 1;
  388. }
  389. }
  390. switch base {
  391. case 2, 8, 10, 12, 16:
  392. break;
  393. case:
  394. panic("_fmt_int: unknown base, whoops");
  395. }
  396. buf: [256]byte;
  397. start := 0;
  398. flags: strconv.Int_Flags;
  399. if fi.hash && !fi.zero do flags |= {.Prefix};
  400. if fi.plus do flags |= {.Plus};
  401. if fi.space do flags |= {.Space};
  402. s := strconv.append_bits(buf[start:], u, base, is_signed, bit_size, digits, flags);
  403. if fi.hash && fi.zero {
  404. c: byte = 0;
  405. switch base {
  406. case 2: c = 'b';
  407. case 8: c = 'o';
  408. case 12: c = 'z';
  409. case 16: c = 'x';
  410. }
  411. if c != 0 {
  412. strings.write_byte(fi.buf, '0');
  413. strings.write_byte(fi.buf, c);
  414. }
  415. }
  416. prev_zero := fi.zero;
  417. defer fi.zero = prev_zero;
  418. fi.zero = false;
  419. _pad(fi, s);
  420. }
  421. _fmt_int_128 :: proc(fi: ^Info, u: u128, base: int, is_signed: bool, bit_size: int, digits: string) {
  422. _, neg := strconv.is_integer_negative_128(u, is_signed, bit_size);
  423. BUF_SIZE :: 256;
  424. if fi.width_set || fi.prec_set {
  425. width := fi.width + fi.prec + 3; // 3 extra bytes for sign and prefix
  426. if width > BUF_SIZE {
  427. // TODO(bill):????
  428. panic("_fmt_int: buffer overrun. Width and precision too big");
  429. }
  430. }
  431. prec := 0;
  432. if fi.prec_set {
  433. prec = fi.prec;
  434. if prec == 0 && u == 0 {
  435. prev_zero := fi.zero;
  436. fi.zero = false;
  437. fmt_write_padding(fi, fi.width);
  438. fi.zero = prev_zero;
  439. return;
  440. }
  441. } else if fi.zero && fi.width_set {
  442. prec = fi.width;
  443. if neg || fi.plus || fi.space {
  444. // There needs to be space for the "sign"
  445. prec -= 1;
  446. }
  447. }
  448. switch base {
  449. case 2, 8, 10, 12, 16:
  450. break;
  451. case:
  452. panic("_fmt_int: unknown base, whoops");
  453. }
  454. buf: [256]byte;
  455. start := 0;
  456. flags: strconv.Int_Flags;
  457. if fi.hash && !fi.zero do flags |= {.Prefix};
  458. if fi.plus do flags |= {.Plus};
  459. if fi.space do flags |= {.Space};
  460. s := strconv.append_bits_128(buf[start:], u, base, is_signed, bit_size, digits, flags);
  461. if fi.hash && fi.zero {
  462. c: byte = 0;
  463. switch base {
  464. case 2: c = 'b';
  465. case 8: c = 'o';
  466. case 12: c = 'z';
  467. case 16: c = 'x';
  468. }
  469. if c != 0 {
  470. strings.write_byte(fi.buf, '0');
  471. strings.write_byte(fi.buf, c);
  472. }
  473. }
  474. prev_zero := fi.zero;
  475. defer fi.zero = prev_zero;
  476. fi.zero = false;
  477. _pad(fi, s);
  478. }
  479. __DIGITS_LOWER := "0123456789abcdefx";
  480. __DIGITS_UPPER := "0123456789ABCDEFX";
  481. fmt_rune :: proc(fi: ^Info, r: rune, verb: rune) {
  482. switch verb {
  483. case 'c', 'r', 'v':
  484. strings.write_rune(fi.buf, r);
  485. case:
  486. fmt_int(fi, u64(r), false, 32, verb);
  487. }
  488. }
  489. fmt_int :: proc(fi: ^Info, u: u64, is_signed: bool, bit_size: int, verb: rune) {
  490. switch verb {
  491. case 'v': _fmt_int(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER);
  492. case 'b': _fmt_int(fi, u, 2, is_signed, bit_size, __DIGITS_LOWER);
  493. case 'o': _fmt_int(fi, u, 8, is_signed, bit_size, __DIGITS_LOWER);
  494. case 'd': _fmt_int(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER);
  495. case 'z': _fmt_int(fi, u, 12, is_signed, bit_size, __DIGITS_LOWER);
  496. case 'x': _fmt_int(fi, u, 16, is_signed, bit_size, __DIGITS_LOWER);
  497. case 'X': _fmt_int(fi, u, 16, is_signed, bit_size, __DIGITS_UPPER);
  498. case 'c', 'r':
  499. fmt_rune(fi, rune(u), verb);
  500. case 'U':
  501. r := rune(u);
  502. if r < 0 || r > utf8.MAX_RUNE {
  503. fmt_bad_verb(fi, verb);
  504. } else {
  505. strings.write_string(fi.buf, "U+");
  506. _fmt_int(fi, u, 16, false, bit_size, __DIGITS_UPPER);
  507. }
  508. case:
  509. fmt_bad_verb(fi, verb);
  510. }
  511. }
  512. fmt_int_128 :: proc(fi: ^Info, u: u128, is_signed: bool, bit_size: int, verb: rune) {
  513. switch verb {
  514. case 'v': _fmt_int_128(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER);
  515. case 'b': _fmt_int_128(fi, u, 2, is_signed, bit_size, __DIGITS_LOWER);
  516. case 'o': _fmt_int_128(fi, u, 8, is_signed, bit_size, __DIGITS_LOWER);
  517. case 'd': _fmt_int_128(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER);
  518. case 'z': _fmt_int_128(fi, u, 12, is_signed, bit_size, __DIGITS_LOWER);
  519. case 'x': _fmt_int_128(fi, u, 16, is_signed, bit_size, __DIGITS_LOWER);
  520. case 'X': _fmt_int_128(fi, u, 16, is_signed, bit_size, __DIGITS_UPPER);
  521. case 'c', 'r':
  522. fmt_rune(fi, rune(u), verb);
  523. case 'U':
  524. r := rune(u);
  525. if r < 0 || r > utf8.MAX_RUNE {
  526. fmt_bad_verb(fi, verb);
  527. } else {
  528. strings.write_string(fi.buf, "U+");
  529. _fmt_int_128(fi, u, 16, false, bit_size, __DIGITS_UPPER);
  530. }
  531. case:
  532. fmt_bad_verb(fi, verb);
  533. }
  534. }
  535. _pad :: proc(fi: ^Info, s: string) {
  536. if !fi.width_set {
  537. strings.write_string(fi.buf, s);
  538. return;
  539. }
  540. width := fi.width - utf8.rune_count_in_string(s);
  541. if fi.minus { // right pad
  542. strings.write_string(fi.buf, s);
  543. fmt_write_padding(fi, width);
  544. } else { // left pad
  545. fmt_write_padding(fi, width);
  546. strings.write_string(fi.buf, s);
  547. }
  548. }
  549. fmt_float :: proc(fi: ^Info, v: f64, bit_size: int, verb: rune) {
  550. switch verb {
  551. case 'f', 'F', 'v':
  552. prec: int = 3;
  553. if fi.prec_set do prec = fi.prec;
  554. buf: [386]byte;
  555. str := strconv.append_float(buf[1:], v, 'f', prec, bit_size);
  556. str = string(buf[:len(str)+1]);
  557. if str[1] == '+' || str[1] == '-' {
  558. str = str[1:];
  559. } else {
  560. str[0] = '+';
  561. }
  562. if fi.space && !fi.plus && str[0] == '+' {
  563. str[0] = ' ';
  564. }
  565. if len(str) > 1 && (str[1] == 'N' || str[1] == 'I') {
  566. strings.write_string(fi.buf, str);
  567. return;
  568. }
  569. if fi.plus || str[0] != '+' {
  570. if fi.zero && fi.width_set && fi.width > len(str) {
  571. strings.write_byte(fi.buf, str[0]);
  572. fmt_write_padding(fi, fi.width - len(str));
  573. strings.write_string(fi.buf, str[1:]);
  574. } else {
  575. _pad(fi, str);
  576. }
  577. } else {
  578. _pad(fi, str[1:]);
  579. }
  580. case 'e', 'E':
  581. prec: int = 3;
  582. if fi.prec_set do prec = fi.prec;
  583. buf: [386]byte;
  584. str := strconv.append_float(buf[1:], v, 'e', prec, bit_size);
  585. str = string(buf[:len(str)+1]);
  586. if str[1] == '+' || str[1] == '-' {
  587. str = str[1:];
  588. } else {
  589. str[0] = '+';
  590. }
  591. if fi.space && !fi.plus && str[0] == '+' {
  592. str[0] = ' ';
  593. }
  594. if len(str) > 1 && (str[1] == 'N' || str[1] == 'I') {
  595. strings.write_string(fi.buf, str);
  596. return;
  597. }
  598. if fi.plus || str[0] != '+' {
  599. if fi.zero && fi.width_set && fi.width > len(str) {
  600. strings.write_byte(fi.buf, str[0]);
  601. fmt_write_padding(fi, fi.width - len(str));
  602. strings.write_string(fi.buf, str[1:]);
  603. } else {
  604. _pad(fi, str);
  605. }
  606. } else {
  607. _pad(fi, str[1:]);
  608. }
  609. case 'h', 'H':
  610. prev_fi := fi^;
  611. defer fi^ = prev_fi;
  612. fi.hash = false;
  613. fi.width = bit_size;
  614. fi.zero = true;
  615. fi.plus = false;
  616. u: u64;
  617. switch bit_size {
  618. case 32: u = u64(transmute(u32)f32(v));
  619. case 64: u = transmute(u64)v;
  620. case: panic("Unhandled float size");
  621. }
  622. strings.write_string(fi.buf, "0h");
  623. _fmt_int(fi, u, 16, false, bit_size, verb == 'h' ? __DIGITS_LOWER : __DIGITS_UPPER);
  624. case:
  625. fmt_bad_verb(fi, verb);
  626. }
  627. }
  628. fmt_string :: proc(fi: ^Info, s: string, verb: rune) {
  629. switch verb {
  630. case 's', 'v':
  631. strings.write_string(fi.buf, s);
  632. case 'q': // quoted string
  633. strings.write_quoted_string(fi.buf, s, '"');
  634. case 'x', 'X':
  635. space := fi.space;
  636. fi.space = false;
  637. defer fi.space = space;
  638. for i in 0..<len(s) {
  639. if i > 0 && space do strings.write_byte(fi.buf, ' ');
  640. char_set := __DIGITS_UPPER;
  641. if verb == 'x' do char_set = __DIGITS_LOWER;
  642. _fmt_int(fi, u64(s[i]), 16, false, 8, char_set);
  643. }
  644. case:
  645. fmt_bad_verb(fi, verb);
  646. }
  647. }
  648. fmt_cstring :: proc(fi: ^Info, s: cstring, verb: rune) {
  649. fmt_string(fi, string(s), verb);
  650. }
  651. fmt_pointer :: proc(fi: ^Info, p: rawptr, verb: rune) {
  652. u := u64(uintptr(p));
  653. switch verb {
  654. case 'p', 'v':
  655. if !fi.hash || verb == 'v' {
  656. strings.write_string(fi.buf, "0x");
  657. }
  658. _fmt_int(fi, u, 16, false, 8*size_of(rawptr), __DIGITS_UPPER);
  659. case 'b': _fmt_int(fi, u, 2, false, 8*size_of(rawptr), __DIGITS_UPPER);
  660. case 'o': _fmt_int(fi, u, 8, false, 8*size_of(rawptr), __DIGITS_UPPER);
  661. case 'd': _fmt_int(fi, u, 10, false, 8*size_of(rawptr), __DIGITS_UPPER);
  662. case 'x': _fmt_int(fi, u, 16, false, 8*size_of(rawptr), __DIGITS_UPPER);
  663. case 'X': _fmt_int(fi, u, 16, false, 8*size_of(rawptr), __DIGITS_UPPER);
  664. case:
  665. fmt_bad_verb(fi, verb);
  666. }
  667. }
  668. enum_value_to_string :: proc(val: any) -> (string, bool) {
  669. v := val;
  670. v.id = runtime.typeid_base(v.id);
  671. type_info := type_info_of(v.id);
  672. switch e in type_info.variant {
  673. case: return "", false;
  674. case runtime.Type_Info_Enum:
  675. get_str :: proc(i: $T, e: runtime.Type_Info_Enum) -> (string, bool) {
  676. if reflect.is_string(e.base) {
  677. for val, idx in e.values {
  678. if v, ok := val.(T); ok && v == i {
  679. return e.names[idx], true;
  680. }
  681. }
  682. } else if len(e.values) == 0 {
  683. return "", true;
  684. } else {
  685. for val, idx in e.values {
  686. if v, ok := val.(T); ok && v == i {
  687. return e.names[idx], true;
  688. }
  689. }
  690. }
  691. return "", false;
  692. }
  693. a := any{v.data, runtime.type_info_base(e.base).id};
  694. switch v in a {
  695. case rune: return get_str(v, e);
  696. case i8: return get_str(v, e);
  697. case i16: return get_str(v, e);
  698. case i32: return get_str(v, e);
  699. case i64: return get_str(v, e);
  700. case int: return get_str(v, e);
  701. case u8: return get_str(v, e);
  702. case u16: return get_str(v, e);
  703. case u32: return get_str(v, e);
  704. case u64: return get_str(v, e);
  705. case uint: return get_str(v, e);
  706. case uintptr: return get_str(v, e);
  707. }
  708. }
  709. return "", false;
  710. }
  711. string_to_enum_value :: proc($T: typeid, s: string) -> (T, bool) {
  712. ti := type_info_base(type_info_of(T));
  713. if e, ok := ti.variant.(Type_Info_Enum); ok {
  714. for str, idx in e.names {
  715. if s == str {
  716. // NOTE(bill): Unsafe cast
  717. ptr := cast(^T)&e.values[idx];
  718. return ptr^, true;
  719. }
  720. }
  721. }
  722. return T{}, false;
  723. }
  724. fmt_enum :: proc(fi: ^Info, v: any, verb: rune) {
  725. if v.id == nil || v.data == nil {
  726. strings.write_string(fi.buf, "<nil>");
  727. return;
  728. }
  729. type_info := type_info_of(v.id);
  730. switch e in type_info.variant {
  731. case: fmt_bad_verb(fi, verb);
  732. case runtime.Type_Info_Enum:
  733. switch verb {
  734. case: fmt_bad_verb(fi, verb);
  735. case 'd', 'f':
  736. fmt_arg(fi, any{v.data, runtime.type_info_base(e.base).id}, verb);
  737. case 's', 'v':
  738. str, ok := enum_value_to_string(v);
  739. if !ok do str = "!%(BAD ENUM VALUE)";
  740. strings.write_string(fi.buf, str);
  741. }
  742. }
  743. }
  744. enum_value_to_u64 :: proc(ev: runtime.Type_Info_Enum_Value) -> u64 {
  745. switch i in ev {
  746. case rune: return u64(i);
  747. case i8: return u64(i);
  748. case i16: return u64(i);
  749. case i32: return u64(i);
  750. case i64: return u64(i);
  751. case int: return u64(i);
  752. case u8: return u64(i);
  753. case u16: return u64(i);
  754. case u32: return u64(i);
  755. case u64: return u64(i);
  756. case uint: return u64(i);
  757. case uintptr: return u64(i);
  758. }
  759. return 0;
  760. }
  761. fmt_bit_set :: proc(fi: ^Info, v: any, name: string = "") {
  762. is_bit_set_different_endian_to_platform :: proc(ti: ^runtime.Type_Info) -> bool {
  763. if ti == nil {
  764. return false;
  765. }
  766. t := runtime.type_info_base(ti);
  767. switch info in t.variant {
  768. case runtime.Type_Info_Integer:
  769. switch info.endianness {
  770. case .Platform: return false;
  771. case .Little: return ODIN_ENDIAN != "little";
  772. case .Big: return ODIN_ENDIAN != "big";
  773. }
  774. }
  775. return false;
  776. }
  777. byte_swap :: bits.byte_swap;
  778. type_info := type_info_of(v.id);
  779. switch info in type_info.variant {
  780. case runtime.Type_Info_Named:
  781. val := v;
  782. val.id = info.base.id;
  783. fmt_bit_set(fi, val, info.name);
  784. case runtime.Type_Info_Bit_Set:
  785. bits: u128;
  786. bit_size := u128(8*type_info.size);
  787. do_byte_swap := is_bit_set_different_endian_to_platform(info.underlying);
  788. switch bit_size {
  789. case 0: bits = 0;
  790. case 8:
  791. x := (^u8)(v.data)^;
  792. bits = u128(x);
  793. case 16:
  794. x := (^u16)(v.data)^;
  795. if do_byte_swap do x = byte_swap(x);
  796. bits = u128(x);
  797. case 32:
  798. x := (^u32)(v.data)^;
  799. if do_byte_swap do x = byte_swap(x);
  800. bits = u128(x);
  801. case 64:
  802. x := (^u64)(v.data)^;
  803. if do_byte_swap do x = byte_swap(x);
  804. bits = u128(x);
  805. case 128:
  806. x := (^u128)(v.data)^;
  807. if do_byte_swap do x = byte_swap(x);
  808. bits = u128(x);
  809. case: panic("unknown bit_size size");
  810. }
  811. et := runtime.type_info_base(info.elem);
  812. if name != "" {
  813. strings.write_string(fi.buf, name);
  814. } else {
  815. reflect.write_type(fi.buf, type_info);
  816. }
  817. strings.write_byte(fi.buf, '{');
  818. defer strings.write_byte(fi.buf, '}');
  819. e, is_enum := et.variant.(runtime.Type_Info_Enum);
  820. commas := 0;
  821. loop: for i in 0 ..< bit_size {
  822. if bits & (1<<i) == 0 {
  823. continue loop;
  824. }
  825. if commas > 0 do strings.write_string(fi.buf, ", ");
  826. if is_enum do for ev, evi in e.values {
  827. v := enum_value_to_u64(ev);
  828. if v == u64(i) {
  829. strings.write_string(fi.buf, e.names[evi]);
  830. commas += 1;
  831. continue loop;
  832. }
  833. }
  834. strings.write_i64(fi.buf, i64(i), 10);
  835. commas += 1;
  836. }
  837. }
  838. }
  839. fmt_bit_field :: proc(fi: ^Info, v: any, bit_field_name: string = "") {
  840. type_info := type_info_of(v.id);
  841. switch info in type_info.variant {
  842. case runtime.Type_Info_Named:
  843. val := v;
  844. val.id = info.base.id;
  845. fmt_bit_field(fi, val, info.name);
  846. case runtime.Type_Info_Bit_Field:
  847. data: u64 = 0;
  848. switch type_info.size {
  849. case 1: data = cast(u64) (^u8)(v.data)^;
  850. case 2: data = cast(u64)(^u16)(v.data)^;
  851. case 4: data = cast(u64)(^u32)(v.data)^;
  852. case 8: data = cast(u64)(^u64)(v.data)^;
  853. }
  854. if bit_field_name != "" {
  855. strings.write_string(fi.buf, bit_field_name);
  856. strings.write_byte(fi.buf, '{');
  857. } else {
  858. strings.write_string(fi.buf, "bit_field{");
  859. }
  860. for name, i in info.names {
  861. if i > 0 {
  862. strings.write_string(fi.buf, ", ");
  863. }
  864. bits := u64(info.bits[i]);
  865. offset := u64(info.offsets[i]);
  866. strings.write_string(fi.buf, name);
  867. strings.write_string(fi.buf, " = ");
  868. n := 8*u64(size_of(u64));
  869. sa := n - bits;
  870. u := data>>offset;
  871. u <<= sa;
  872. u >>= sa;
  873. strings.write_u64(fi.buf, u, 10);
  874. }
  875. strings.write_byte(fi.buf, '}');
  876. }
  877. }
  878. fmt_opaque :: proc(fi: ^Info, v: any) {
  879. is_nil :: proc(data: rawptr, n: int) -> bool {
  880. if data == nil do return true;
  881. if n == 0 do return true;
  882. a := (^byte)(data);
  883. for i in 0..<n do if mem.ptr_offset(a, i)^ != 0 {
  884. return false;
  885. }
  886. return true;
  887. }
  888. rt :: runtime;
  889. type_info := type_info_of(v.id);
  890. if is_nil(v.data, type_info.size) {
  891. strings.write_string(fi.buf, "nil");
  892. return;
  893. }
  894. if ot, ok := rt.type_info_base(type_info).variant.(rt.Type_Info_Opaque); ok {
  895. elem := rt.type_info_base(ot.elem);
  896. if elem == nil do return;
  897. reflect.write_type(fi.buf, type_info);
  898. strings.write_byte(fi.buf, '{');
  899. defer strings.write_byte(fi.buf, '}');
  900. switch in elem.variant {
  901. case rt.Type_Info_Integer, rt.Type_Info_Pointer, rt.Type_Info_Float:
  902. fmt_value(fi, any{v.data, elem.id}, 'v');
  903. case:
  904. // Okay
  905. }
  906. } else {
  907. reflect.write_type(fi.buf, type_info);
  908. strings.write_byte(fi.buf, '{');
  909. strings.write_byte(fi.buf, '}');
  910. }
  911. }
  912. fmt_value :: proc(fi: ^Info, v: any, verb: rune) {
  913. if v.data == nil || v.id == nil {
  914. strings.write_string(fi.buf, "<nil>");
  915. return;
  916. }
  917. type_info := type_info_of(v.id);
  918. switch info in type_info.variant {
  919. case runtime.Type_Info_Named:
  920. switch b in info.base.variant {
  921. case runtime.Type_Info_Struct:
  922. if verb != 'v' {
  923. fmt_bad_verb(fi, verb);
  924. return;
  925. }
  926. if b.is_raw_union {
  927. strings.write_string(fi.buf, info.name);
  928. strings.write_string(fi.buf, "{}");
  929. return;
  930. };
  931. is_soa := b.soa_base_type != nil;
  932. strings.write_string(fi.buf, info.name);
  933. strings.write_byte(fi.buf, is_soa ? '[' : '{');
  934. hash := fi.hash; defer fi.hash = hash;
  935. indent := fi.indent; defer fi.indent -= 1;
  936. fi.hash = false;
  937. fi.indent += 1;
  938. if hash do strings.write_byte(fi.buf, '\n');
  939. defer {
  940. if hash do for in 0..<indent do strings.write_byte(fi.buf, '\t');
  941. strings.write_byte(fi.buf, is_soa ? ']' : '}');
  942. }
  943. if is_soa {
  944. fi.indent += 1;
  945. defer fi.indent -= 1;
  946. base_type_name: string;
  947. if v, ok := b.soa_base_type.variant.(runtime.Type_Info_Named); ok {
  948. base_type_name = v.name;
  949. }
  950. for index in 0..<uintptr(b.soa_len) {
  951. if !hash && index > 0 do strings.write_string(fi.buf, ", ");
  952. field_count := -1;
  953. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  954. strings.write_string(fi.buf, base_type_name);
  955. strings.write_byte(fi.buf, '{');
  956. defer strings.write_byte(fi.buf, '}');
  957. for name, i in b.names {
  958. field_count += 1;
  959. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  960. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  961. strings.write_string(fi.buf, name);
  962. strings.write_string(fi.buf, " = ");
  963. t := b.types[i].variant.(runtime.Type_Info_Array).elem;
  964. t_size := uintptr(t.size);
  965. if reflect.is_any(t) {
  966. strings.write_string(fi.buf, "any{}");
  967. } else {
  968. data := rawptr(uintptr(v.data) + b.offsets[i] + index*t_size);
  969. fmt_arg(fi, any{data, t.id}, 'v');
  970. }
  971. if hash do strings.write_string(fi.buf, ",\n");
  972. }
  973. }
  974. } else {
  975. field_count := -1;
  976. for name, i in b.names {
  977. field_count += 1;
  978. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  979. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  980. strings.write_string(fi.buf, name);
  981. strings.write_string(fi.buf, " = ");
  982. if t := b.types[i]; reflect.is_any(t) {
  983. strings.write_string(fi.buf, "any{}");
  984. } else {
  985. data := rawptr(uintptr(v.data) + b.offsets[i]);
  986. fmt_arg(fi, any{data, t.id}, 'v');
  987. }
  988. if hash do strings.write_string(fi.buf, ",\n");
  989. }
  990. }
  991. case runtime.Type_Info_Bit_Set:
  992. fmt_bit_set(fi, v);
  993. case runtime.Type_Info_Bit_Field:
  994. fmt_bit_field(fi, v);
  995. case runtime.Type_Info_Opaque:
  996. fmt_opaque(fi, v);
  997. case:
  998. fmt_value(fi, any{v.data, info.base.id}, verb);
  999. }
  1000. case runtime.Type_Info_Boolean: fmt_arg(fi, v, verb);
  1001. case runtime.Type_Info_Integer: fmt_arg(fi, v, verb);
  1002. case runtime.Type_Info_Rune: fmt_arg(fi, v, verb);
  1003. case runtime.Type_Info_Float: fmt_arg(fi, v, verb);
  1004. case runtime.Type_Info_Complex: fmt_arg(fi, v, verb);
  1005. case runtime.Type_Info_Quaternion: fmt_arg(fi, v, verb);
  1006. case runtime.Type_Info_String: fmt_arg(fi, v, verb);
  1007. case runtime.Type_Info_Pointer:
  1008. if v.id == typeid_of(^runtime.Type_Info) {
  1009. reflect.write_type(fi.buf, (^^runtime.Type_Info)(v.data)^);
  1010. } else {
  1011. ptr := (^rawptr)(v.data)^;
  1012. if verb != 'p' && info.elem != nil {
  1013. a := any{ptr, info.elem.id};
  1014. elem := runtime.type_info_base(info.elem);
  1015. if elem != nil do switch e in elem.variant {
  1016. case runtime.Type_Info_Array,
  1017. runtime.Type_Info_Slice,
  1018. runtime.Type_Info_Dynamic_Array,
  1019. runtime.Type_Info_Map:
  1020. if ptr == nil {
  1021. strings.write_string(fi.buf, "<nil>");
  1022. return;
  1023. }
  1024. if fi.record_level < 1 {
  1025. fi.record_level += 1;
  1026. defer fi.record_level -= 1;
  1027. strings.write_byte(fi.buf, '&');
  1028. fmt_value(fi, a, verb);
  1029. return;
  1030. }
  1031. case runtime.Type_Info_Struct,
  1032. runtime.Type_Info_Union:
  1033. if ptr == nil {
  1034. strings.write_string(fi.buf, "<nil>");
  1035. return;
  1036. }
  1037. if fi.record_level < 1 {
  1038. fi.record_level += 1;
  1039. defer fi.record_level -= 1;
  1040. strings.write_byte(fi.buf, '&');
  1041. fmt_value(fi, a, verb);
  1042. return;
  1043. }
  1044. }
  1045. }
  1046. fmt_pointer(fi, ptr, verb);
  1047. }
  1048. case runtime.Type_Info_Array:
  1049. strings.write_byte(fi.buf, '[');
  1050. defer strings.write_byte(fi.buf, ']');
  1051. for i in 0..<info.count {
  1052. if i > 0 do strings.write_string(fi.buf, ", ");
  1053. data := uintptr(v.data) + uintptr(i*info.elem_size);
  1054. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1055. }
  1056. case runtime.Type_Info_Dynamic_Array:
  1057. if verb == 'p' {
  1058. slice := cast(^mem.Raw_Dynamic_Array)v.data;
  1059. fmt_pointer(fi, slice.data, 'p');
  1060. } else {
  1061. strings.write_byte(fi.buf, '[');
  1062. defer strings.write_byte(fi.buf, ']');
  1063. array := cast(^mem.Raw_Dynamic_Array)v.data;
  1064. for i in 0..<array.len {
  1065. if i > 0 do strings.write_string(fi.buf, ", ");
  1066. data := uintptr(array.data) + uintptr(i*info.elem_size);
  1067. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1068. }
  1069. }
  1070. case runtime.Type_Info_Simd_Vector:
  1071. if info.is_x86_mmx {
  1072. strings.write_string(fi.buf, "intrinsics.x86_mmx<>");
  1073. }
  1074. strings.write_byte(fi.buf, '<');
  1075. defer strings.write_byte(fi.buf, '>');
  1076. for i in 0..<info.count {
  1077. if i > 0 do strings.write_string(fi.buf, ", ");
  1078. data := uintptr(v.data) + uintptr(i*info.elem_size);
  1079. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1080. }
  1081. case runtime.Type_Info_Slice:
  1082. if verb == 'p' {
  1083. slice := cast(^mem.Raw_Slice)v.data;
  1084. fmt_pointer(fi, slice.data, 'p');
  1085. } else {
  1086. strings.write_byte(fi.buf, '[');
  1087. defer strings.write_byte(fi.buf, ']');
  1088. slice := cast(^mem.Raw_Slice)v.data;
  1089. for i in 0..<slice.len {
  1090. if i > 0 do strings.write_string(fi.buf, ", ");
  1091. data := uintptr(slice.data) + uintptr(i*info.elem_size);
  1092. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1093. }
  1094. }
  1095. case runtime.Type_Info_Map:
  1096. if verb != 'v' {
  1097. fmt_bad_verb(fi, verb);
  1098. return;
  1099. }
  1100. strings.write_string(fi.buf, "map[");
  1101. defer strings.write_byte(fi.buf, ']');
  1102. m := (^mem.Raw_Map)(v.data);
  1103. if m != nil {
  1104. if info.generated_struct == nil {
  1105. return;
  1106. }
  1107. entries := &m.entries;
  1108. gs := runtime.type_info_base(info.generated_struct).variant.(runtime.Type_Info_Struct);
  1109. ed := runtime.type_info_base(gs.types[1]).variant.(runtime.Type_Info_Dynamic_Array);
  1110. entry_type := ed.elem.variant.(runtime.Type_Info_Struct);
  1111. entry_size := ed.elem_size;
  1112. for i in 0..<entries.len {
  1113. if i > 0 do strings.write_string(fi.buf, ", ");
  1114. data := uintptr(entries.data) + uintptr(i*entry_size);
  1115. header := cast(^runtime.Map_Entry_Header)data;
  1116. if reflect.is_string(info.key) {
  1117. strings.write_string(fi.buf, header.key.str);
  1118. } else {
  1119. fi := Info{buf = fi.buf};
  1120. fmt_arg(&fi, any{rawptr(&header.key.hash), info.key.id}, 'v');
  1121. }
  1122. strings.write_string(fi.buf, "=");
  1123. value := data + entry_type.offsets[2];
  1124. fmt_arg(fi, any{rawptr(value), info.value.id}, 'v');
  1125. }
  1126. }
  1127. case runtime.Type_Info_Struct:
  1128. if info.is_raw_union {
  1129. strings.write_string(fi.buf, "(raw_union)");
  1130. return;
  1131. }
  1132. is_soa := info.soa_base_type != nil;
  1133. strings.write_byte(fi.buf, is_soa ? '[' : '{');
  1134. defer strings.write_byte(fi.buf, is_soa ? ']' : '}');
  1135. fi.indent += 1; defer fi.indent -= 1;
  1136. hash := fi.hash; defer fi.hash = hash;
  1137. fi.hash = false;
  1138. if hash do strings.write_byte(fi.buf, '\n');
  1139. if is_soa {
  1140. fi.indent += 1;
  1141. defer fi.indent -= 1;
  1142. base_type_name: string;
  1143. if v, ok := info.soa_base_type.variant.(runtime.Type_Info_Named); ok {
  1144. base_type_name = v.name;
  1145. }
  1146. for index in 0..<uintptr(info.soa_len) {
  1147. if !hash && index > 0 do strings.write_string(fi.buf, ", ");
  1148. field_count := -1;
  1149. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1150. strings.write_string(fi.buf, base_type_name);
  1151. strings.write_byte(fi.buf, '{');
  1152. defer strings.write_byte(fi.buf, '}');
  1153. for name, i in info.names {
  1154. field_count += 1;
  1155. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1156. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  1157. strings.write_string(fi.buf, name);
  1158. strings.write_string(fi.buf, " = ");
  1159. t := info.types[i].variant.(runtime.Type_Info_Array).elem;
  1160. t_size := uintptr(t.size);
  1161. if reflect.is_any(t) {
  1162. strings.write_string(fi.buf, "any{}");
  1163. } else {
  1164. data := rawptr(uintptr(v.data) + info.offsets[i] + index*t_size);
  1165. fmt_arg(fi, any{data, t.id}, 'v');
  1166. }
  1167. if hash do strings.write_string(fi.buf, ",\n");
  1168. }
  1169. }
  1170. } else {
  1171. field_count := -1;
  1172. for name, i in info.names {
  1173. field_count += 1;
  1174. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1175. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  1176. strings.write_string(fi.buf, name);
  1177. strings.write_string(fi.buf, " = ");
  1178. if t := info.types[i]; reflect.is_any(t) {
  1179. strings.write_string(fi.buf, "any{}");
  1180. } else {
  1181. data := rawptr(uintptr(v.data) + info.offsets[i]);
  1182. fmt_arg(fi, any{data, t.id}, 'v');
  1183. }
  1184. if hash do strings.write_string(fi.buf, ",\n");
  1185. }
  1186. }
  1187. case runtime.Type_Info_Union:
  1188. if type_info.size == 0 {
  1189. strings.write_string(fi.buf, "nil");
  1190. return;
  1191. }
  1192. tag_ptr := uintptr(v.data) + info.tag_offset;
  1193. tag_any := any{rawptr(tag_ptr), info.tag_type.id};
  1194. tag: i64 = -1;
  1195. switch i in tag_any {
  1196. case u8: tag = i64(i);
  1197. case i8: tag = i64(i);
  1198. case u16: tag = i64(i);
  1199. case i16: tag = i64(i);
  1200. case u32: tag = i64(i);
  1201. case i32: tag = i64(i);
  1202. case u64: tag = i64(i);
  1203. case i64: tag = i64(i);
  1204. case: panic("Invalid union tag type");
  1205. }
  1206. assert(tag >= 0);
  1207. if v.data == nil {
  1208. strings.write_string(fi.buf, "nil");
  1209. } else if info.no_nil {
  1210. id := info.variants[tag].id;
  1211. fmt_arg(fi, any{v.data, id}, verb);
  1212. } else if tag == 0 {
  1213. strings.write_string(fi.buf, "nil");
  1214. } else {
  1215. id := info.variants[tag-1].id;
  1216. fmt_arg(fi, any{v.data, id}, verb);
  1217. }
  1218. case runtime.Type_Info_Enum:
  1219. fmt_enum(fi, v, verb);
  1220. case runtime.Type_Info_Procedure:
  1221. ptr := (^rawptr)(v.data)^;
  1222. if ptr == nil {
  1223. strings.write_string(fi.buf, "nil");
  1224. } else {
  1225. reflect.write_typeid(fi.buf, v.id);
  1226. strings.write_string(fi.buf, " @ ");
  1227. fmt_pointer(fi, ptr, 'p');
  1228. }
  1229. case runtime.Type_Info_Type_Id:
  1230. id := (^typeid)(v.data)^;
  1231. reflect.write_typeid(fi.buf, id);
  1232. case runtime.Type_Info_Bit_Field:
  1233. fmt_bit_field(fi, v);
  1234. case runtime.Type_Info_Bit_Set:
  1235. fmt_bit_set(fi, v);
  1236. case runtime.Type_Info_Opaque:
  1237. fmt_opaque(fi, v);
  1238. }
  1239. }
  1240. fmt_complex :: proc(fi: ^Info, c: complex128, bits: int, verb: rune) {
  1241. switch verb {
  1242. case 'f', 'F', 'v', 'h', 'H':
  1243. r, i := real(c), imag(c);
  1244. fmt_float(fi, r, bits/2, verb);
  1245. if !fi.plus && i >= 0 {
  1246. strings.write_rune(fi.buf, '+');
  1247. }
  1248. fmt_float(fi, i, bits/2, verb);
  1249. strings.write_rune(fi.buf, 'i');
  1250. case:
  1251. fmt_bad_verb(fi, verb);
  1252. return;
  1253. }
  1254. }
  1255. fmt_quaternion :: proc(fi: ^Info, q: quaternion256, bits: int, verb: rune) {
  1256. switch verb {
  1257. case 'f', 'F', 'v', 'h', 'H':
  1258. r, i, j, k := real(q), imag(q), jmag(q), kmag(q);
  1259. fmt_float(fi, r, bits/4, verb);
  1260. if !fi.plus && i >= 0 do strings.write_rune(fi.buf, '+');
  1261. fmt_float(fi, i, bits/4, verb);
  1262. strings.write_rune(fi.buf, 'i');
  1263. if !fi.plus && j >= 0 do strings.write_rune(fi.buf, '+');
  1264. fmt_float(fi, j, bits/4, verb);
  1265. strings.write_rune(fi.buf, 'j');
  1266. if !fi.plus && k >= 0 do strings.write_rune(fi.buf, '+');
  1267. fmt_float(fi, k, bits/4, verb);
  1268. strings.write_rune(fi.buf, 'k');
  1269. case:
  1270. fmt_bad_verb(fi, verb);
  1271. return;
  1272. }
  1273. }
  1274. fmt_arg :: proc(fi: ^Info, arg: any, verb: rune) {
  1275. if arg == nil {
  1276. strings.write_string(fi.buf, "<nil>");
  1277. return;
  1278. }
  1279. fi.arg = arg;
  1280. if verb == 'T' {
  1281. ti := type_info_of(arg.id);
  1282. switch a in arg {
  1283. case ^runtime.Type_Info: ti = a;
  1284. }
  1285. reflect.write_type(fi.buf, ti);
  1286. return;
  1287. }
  1288. custom_types: switch a in arg {
  1289. case runtime.Source_Code_Location:
  1290. if fi.hash && verb == 'v' {
  1291. strings.write_string(fi.buf, a.file_path);
  1292. strings.write_byte(fi.buf, '(');
  1293. strings.write_i64(fi.buf, i64(a.line), 10);
  1294. strings.write_byte(fi.buf, ':');
  1295. strings.write_i64(fi.buf, i64(a.column), 10);
  1296. strings.write_byte(fi.buf, ')');
  1297. return;
  1298. }
  1299. }
  1300. base_arg := arg;
  1301. base_arg.id = runtime.typeid_base(base_arg.id);
  1302. switch a in base_arg {
  1303. case bool: fmt_bool(fi, bool(a), verb);
  1304. case b8: fmt_bool(fi, bool(a), verb);
  1305. case b16: fmt_bool(fi, bool(a), verb);
  1306. case b32: fmt_bool(fi, bool(a), verb);
  1307. case b64: fmt_bool(fi, bool(a), verb);
  1308. case any: fmt_arg(fi, a, verb);
  1309. case rune: fmt_rune(fi, a, verb);
  1310. case f32: fmt_float(fi, f64(a), 32, verb);
  1311. case f64: fmt_float(fi, a, 64, verb);
  1312. case complex64: fmt_complex(fi, complex128(a), 64, verb);
  1313. case complex128: fmt_complex(fi, a, 128, verb);
  1314. case quaternion128: fmt_quaternion(fi, quaternion256(a), 128, verb);
  1315. case quaternion256: fmt_quaternion(fi, a, 256, verb);
  1316. case i8: fmt_int(fi, u64(a), true, 8, verb);
  1317. case u8: fmt_int(fi, u64(a), false, 8, verb);
  1318. case i16: fmt_int(fi, u64(a), true, 16, verb);
  1319. case u16: fmt_int(fi, u64(a), false, 16, verb);
  1320. case i32: fmt_int(fi, u64(a), true, 32, verb);
  1321. case u32: fmt_int(fi, u64(a), false, 32, verb);
  1322. case i64: fmt_int(fi, u64(a), true, 64, verb);
  1323. case u64: fmt_int(fi, u64(a), false, 64, verb);
  1324. case int: fmt_int(fi, u64(a), true, 8*size_of(int), verb);
  1325. case uint: fmt_int(fi, u64(a), false, 8*size_of(uint), verb);
  1326. case uintptr: fmt_int(fi, u64(a), false, 8*size_of(uintptr), verb);
  1327. case string: fmt_string(fi, a, verb);
  1328. case cstring: fmt_cstring(fi, a, verb);
  1329. case typeid: reflect.write_typeid(fi.buf, a);
  1330. case i16le: fmt_int(fi, u64(a), true, 16, verb);
  1331. case u16le: fmt_int(fi, u64(a), false, 16, verb);
  1332. case i32le: fmt_int(fi, u64(a), true, 32, verb);
  1333. case u32le: fmt_int(fi, u64(a), false, 32, verb);
  1334. case i64le: fmt_int(fi, u64(a), true, 64, verb);
  1335. case u64le: fmt_int(fi, u64(a), false, 64, verb);
  1336. case i16be: fmt_int(fi, u64(a), true, 16, verb);
  1337. case u16be: fmt_int(fi, u64(a), false, 16, verb);
  1338. case i32be: fmt_int(fi, u64(a), true, 32, verb);
  1339. case u32be: fmt_int(fi, u64(a), false, 32, verb);
  1340. case i64be: fmt_int(fi, u64(a), true, 64, verb);
  1341. case u64be: fmt_int(fi, u64(a), false, 64, verb);
  1342. case i128: fmt_int_128(fi, u128(a), true, 128, verb);
  1343. case u128: fmt_int_128(fi, u128(a), false, 128, verb);
  1344. case i128le: fmt_int_128(fi, u128(a), true, 128, verb);
  1345. case u128le: fmt_int_128(fi, u128(a), false, 128, verb);
  1346. case i128be: fmt_int_128(fi, u128(a), true, 128, verb);
  1347. case u128be: fmt_int_128(fi, u128(a), false, 128, verb);
  1348. case: fmt_value(fi, arg, verb);
  1349. }
  1350. }