fmt.odin 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725
  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. b := buf[:len(str)+1];
  557. if b[1] == '+' || b[1] == '-' {
  558. b = b[1:];
  559. } else {
  560. b[0] = '+';
  561. }
  562. if fi.space && !fi.plus && b[0] == '+' {
  563. b[0] = ' ';
  564. }
  565. if len(b) > 1 && (b[1] == 'N' || b[1] == 'I') {
  566. strings.write_string(fi.buf, string(b));
  567. return;
  568. }
  569. if fi.plus || b[0] != '+' {
  570. if fi.zero && fi.width_set && fi.width > len(b) {
  571. strings.write_byte(fi.buf, b[0]);
  572. fmt_write_padding(fi, fi.width - len(b));
  573. strings.write_string(fi.buf, string(b[1:]));
  574. } else {
  575. _pad(fi, string(b));
  576. }
  577. } else {
  578. _pad(fi, string(b[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. b := buf[:len(str)+1];
  586. if b[1] == '+' || b[1] == '-' {
  587. b = b[1:];
  588. } else {
  589. b[0] = '+';
  590. }
  591. if fi.space && !fi.plus && b[0] == '+' {
  592. b[0] = ' ';
  593. }
  594. if len(b) > 1 && (b[1] == 'N' || b[1] == 'I') {
  595. strings.write_string(fi.buf, string(b));
  596. return;
  597. }
  598. if fi.plus || str[0] != '+' {
  599. if fi.zero && fi.width_set && fi.width > len(b) {
  600. strings.write_byte(fi.buf, b[0]);
  601. fmt_write_padding(fi, fi.width - len(b));
  602. strings.write_string(fi.buf, string(b[1:]));
  603. } else {
  604. _pad(fi, string(b));
  605. }
  606. } else {
  607. _pad(fi, string(b[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. #partial 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 := runtime.type_info_base(type_info_of(T));
  713. if e, ok := ti.variant.(runtime.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. #partial 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. stored_enum_value_to_string :: proc(enum_type: ^runtime.Type_Info, ev: runtime.Type_Info_Enum_Value, offset: int = 0) -> (string, bool) {
  745. et := runtime.type_info_base(enum_type);
  746. #partial switch e in et.variant {
  747. case: return "", false;
  748. case runtime.Type_Info_Enum:
  749. get_str :: proc(i: $T, e: runtime.Type_Info_Enum) -> (string, bool) {
  750. if reflect.is_string(e.base) {
  751. for val, idx in e.values {
  752. if v, ok := val.(T); ok && v == i {
  753. return e.names[idx], true;
  754. }
  755. }
  756. } else if len(e.values) == 0 {
  757. return "", true;
  758. } else {
  759. for val, idx in e.values {
  760. if v, ok := val.(T); ok && v == i {
  761. return e.names[idx], true;
  762. }
  763. }
  764. }
  765. return "", false;
  766. }
  767. switch v in ev {
  768. case rune: return get_str(v + auto_cast offset, e);
  769. case i8: return get_str(v + auto_cast offset, e);
  770. case i16: return get_str(v + auto_cast offset, e);
  771. case i32: return get_str(v + auto_cast offset, e);
  772. case i64: return get_str(v + auto_cast offset, e);
  773. case int: return get_str(v + auto_cast offset, e);
  774. case u8: return get_str(v + auto_cast offset, e);
  775. case u16: return get_str(v + auto_cast offset, e);
  776. case u32: return get_str(v + auto_cast offset, e);
  777. case u64: return get_str(v + auto_cast offset, e);
  778. case uint: return get_str(v + auto_cast offset, e);
  779. case uintptr: return get_str(v + auto_cast offset, e);
  780. }
  781. }
  782. return "", false;
  783. }
  784. enum_value_to_u64 :: proc(ev: runtime.Type_Info_Enum_Value) -> u64 {
  785. switch i in ev {
  786. case rune: return u64(i);
  787. case i8: return u64(i);
  788. case i16: return u64(i);
  789. case i32: return u64(i);
  790. case i64: return u64(i);
  791. case int: return u64(i);
  792. case u8: return u64(i);
  793. case u16: return u64(i);
  794. case u32: return u64(i);
  795. case u64: return u64(i);
  796. case uint: return u64(i);
  797. case uintptr: return u64(i);
  798. }
  799. return 0;
  800. }
  801. enum_value_to_i64 :: proc(ev: runtime.Type_Info_Enum_Value) -> i64 {
  802. switch i in ev {
  803. case rune: return i64(i);
  804. case i8: return i64(i);
  805. case i16: return i64(i);
  806. case i32: return i64(i);
  807. case i64: return i64(i);
  808. case int: return i64(i);
  809. case u8: return i64(i);
  810. case u16: return i64(i);
  811. case u32: return i64(i);
  812. case u64: return i64(i);
  813. case uint: return i64(i);
  814. case uintptr: return i64(i);
  815. }
  816. return 0;
  817. }
  818. fmt_bit_set :: proc(fi: ^Info, v: any, name: string = "") {
  819. is_bit_set_different_endian_to_platform :: proc(ti: ^runtime.Type_Info) -> bool {
  820. if ti == nil {
  821. return false;
  822. }
  823. t := runtime.type_info_base(ti);
  824. #partial switch info in t.variant {
  825. case runtime.Type_Info_Integer:
  826. switch info.endianness {
  827. case .Platform: return false;
  828. case .Little: return ODIN_ENDIAN != "little";
  829. case .Big: return ODIN_ENDIAN != "big";
  830. }
  831. }
  832. return false;
  833. }
  834. byte_swap :: bits.byte_swap;
  835. type_info := type_info_of(v.id);
  836. #partial switch info in type_info.variant {
  837. case runtime.Type_Info_Named:
  838. val := v;
  839. val.id = info.base.id;
  840. fmt_bit_set(fi, val, info.name);
  841. case runtime.Type_Info_Bit_Set:
  842. bits: u128;
  843. bit_size := u128(8*type_info.size);
  844. do_byte_swap := is_bit_set_different_endian_to_platform(info.underlying);
  845. switch bit_size {
  846. case 0: bits = 0;
  847. case 8:
  848. x := (^u8)(v.data)^;
  849. bits = u128(x);
  850. case 16:
  851. x := (^u16)(v.data)^;
  852. if do_byte_swap do x = byte_swap(x);
  853. bits = u128(x);
  854. case 32:
  855. x := (^u32)(v.data)^;
  856. if do_byte_swap do x = byte_swap(x);
  857. bits = u128(x);
  858. case 64:
  859. x := (^u64)(v.data)^;
  860. if do_byte_swap do x = byte_swap(x);
  861. bits = u128(x);
  862. case 128:
  863. x := (^u128)(v.data)^;
  864. if do_byte_swap do x = byte_swap(x);
  865. bits = u128(x);
  866. case: panic("unknown bit_size size");
  867. }
  868. et := runtime.type_info_base(info.elem);
  869. if name != "" {
  870. strings.write_string(fi.buf, name);
  871. } else {
  872. reflect.write_type(fi.buf, type_info);
  873. }
  874. strings.write_byte(fi.buf, '{');
  875. defer strings.write_byte(fi.buf, '}');
  876. e, is_enum := et.variant.(runtime.Type_Info_Enum);
  877. commas := 0;
  878. loop: for i in 0 ..< bit_size {
  879. if bits & (1<<i) == 0 {
  880. continue loop;
  881. }
  882. if commas > 0 do strings.write_string(fi.buf, ", ");
  883. if is_enum do for ev, evi in e.values {
  884. v := enum_value_to_u64(ev);
  885. if v == u64(i) {
  886. strings.write_string(fi.buf, e.names[evi]);
  887. commas += 1;
  888. continue loop;
  889. }
  890. }
  891. v := i64(i) + info.lower;
  892. strings.write_i64(fi.buf, v, 10);
  893. commas += 1;
  894. }
  895. }
  896. }
  897. fmt_bit_field :: proc(fi: ^Info, v: any, bit_field_name: string = "") {
  898. type_info := type_info_of(v.id);
  899. #partial switch info in type_info.variant {
  900. case runtime.Type_Info_Named:
  901. val := v;
  902. val.id = info.base.id;
  903. fmt_bit_field(fi, val, info.name);
  904. case runtime.Type_Info_Bit_Field:
  905. data: u64 = 0;
  906. switch type_info.size {
  907. case 1: data = cast(u64) (^u8)(v.data)^;
  908. case 2: data = cast(u64)(^u16)(v.data)^;
  909. case 4: data = cast(u64)(^u32)(v.data)^;
  910. case 8: data = cast(u64)(^u64)(v.data)^;
  911. }
  912. if bit_field_name != "" {
  913. strings.write_string(fi.buf, bit_field_name);
  914. strings.write_byte(fi.buf, '{');
  915. } else {
  916. strings.write_string(fi.buf, "bit_field{");
  917. }
  918. for name, i in info.names {
  919. if i > 0 {
  920. strings.write_string(fi.buf, ", ");
  921. }
  922. bits := u64(info.bits[i]);
  923. offset := u64(info.offsets[i]);
  924. strings.write_string(fi.buf, name);
  925. strings.write_string(fi.buf, " = ");
  926. n := 8*u64(size_of(u64));
  927. sa := n - bits;
  928. u := data>>offset;
  929. u <<= sa;
  930. u >>= sa;
  931. strings.write_u64(fi.buf, u, 10);
  932. }
  933. strings.write_byte(fi.buf, '}');
  934. }
  935. }
  936. fmt_opaque :: proc(fi: ^Info, v: any) {
  937. is_nil :: proc(data: rawptr, n: int) -> bool {
  938. if data == nil do return true;
  939. if n == 0 do return true;
  940. a := (^byte)(data);
  941. for i in 0..<n do if mem.ptr_offset(a, i)^ != 0 {
  942. return false;
  943. }
  944. return true;
  945. }
  946. rt :: runtime;
  947. type_info := type_info_of(v.id);
  948. if is_nil(v.data, type_info.size) {
  949. strings.write_string(fi.buf, "nil");
  950. return;
  951. }
  952. if ot, ok := rt.type_info_base(type_info).variant.(rt.Type_Info_Opaque); ok {
  953. elem := rt.type_info_base(ot.elem);
  954. if elem == nil do return;
  955. reflect.write_type(fi.buf, type_info);
  956. strings.write_byte(fi.buf, '{');
  957. defer strings.write_byte(fi.buf, '}');
  958. #partial switch in elem.variant {
  959. case rt.Type_Info_Integer, rt.Type_Info_Pointer, rt.Type_Info_Float:
  960. fmt_value(fi, any{v.data, elem.id}, 'v');
  961. case:
  962. // Okay
  963. }
  964. } else {
  965. reflect.write_type(fi.buf, type_info);
  966. strings.write_byte(fi.buf, '{');
  967. strings.write_byte(fi.buf, '}');
  968. }
  969. }
  970. fmt_value :: proc(fi: ^Info, v: any, verb: rune) {
  971. if v.data == nil || v.id == nil {
  972. strings.write_string(fi.buf, "<nil>");
  973. return;
  974. }
  975. type_info := type_info_of(v.id);
  976. switch info in type_info.variant {
  977. case runtime.Type_Info_Any: // Ignore
  978. case runtime.Type_Info_Tuple: // Ignore
  979. case runtime.Type_Info_Named:
  980. #partial switch b in info.base.variant {
  981. case runtime.Type_Info_Struct:
  982. if verb != 'v' {
  983. fmt_bad_verb(fi, verb);
  984. return;
  985. }
  986. if b.is_raw_union {
  987. strings.write_string(fi.buf, info.name);
  988. strings.write_string(fi.buf, "{}");
  989. return;
  990. };
  991. is_soa := b.soa_kind != .None;
  992. strings.write_string(fi.buf, info.name);
  993. strings.write_byte(fi.buf, is_soa ? '[' : '{');
  994. hash := fi.hash; defer fi.hash = hash;
  995. indent := fi.indent; defer fi.indent -= 1;
  996. fi.hash = false;
  997. fi.indent += 1;
  998. if hash do strings.write_byte(fi.buf, '\n');
  999. defer {
  1000. if hash do for in 0..<indent do strings.write_byte(fi.buf, '\t');
  1001. strings.write_byte(fi.buf, is_soa ? ']' : '}');
  1002. }
  1003. if is_soa {
  1004. fi.indent += 1;
  1005. defer fi.indent -= 1;
  1006. base_type_name: string;
  1007. if v, ok := b.soa_base_type.variant.(runtime.Type_Info_Named); ok {
  1008. base_type_name = v.name;
  1009. }
  1010. for index in 0..<uintptr(b.soa_len) {
  1011. if !hash && index > 0 do strings.write_string(fi.buf, ", ");
  1012. field_count := -1;
  1013. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1014. strings.write_string(fi.buf, base_type_name);
  1015. strings.write_byte(fi.buf, '{');
  1016. defer strings.write_byte(fi.buf, '}');
  1017. for name, i in b.names {
  1018. field_count += 1;
  1019. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1020. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  1021. strings.write_string(fi.buf, name);
  1022. strings.write_string(fi.buf, " = ");
  1023. t := b.types[i].variant.(runtime.Type_Info_Array).elem;
  1024. t_size := uintptr(t.size);
  1025. if reflect.is_any(t) {
  1026. strings.write_string(fi.buf, "any{}");
  1027. } else {
  1028. data := rawptr(uintptr(v.data) + b.offsets[i] + index*t_size);
  1029. fmt_arg(fi, any{data, t.id}, 'v');
  1030. }
  1031. if hash do strings.write_string(fi.buf, ",\n");
  1032. }
  1033. }
  1034. } else {
  1035. field_count := -1;
  1036. for name, i in b.names {
  1037. field_count += 1;
  1038. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1039. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  1040. strings.write_string(fi.buf, name);
  1041. strings.write_string(fi.buf, " = ");
  1042. if t := b.types[i]; reflect.is_any(t) {
  1043. strings.write_string(fi.buf, "any{}");
  1044. } else {
  1045. data := rawptr(uintptr(v.data) + b.offsets[i]);
  1046. fmt_arg(fi, any{data, t.id}, 'v');
  1047. }
  1048. if hash do strings.write_string(fi.buf, ",\n");
  1049. }
  1050. }
  1051. case runtime.Type_Info_Bit_Set:
  1052. fmt_bit_set(fi, v);
  1053. case runtime.Type_Info_Bit_Field:
  1054. fmt_bit_field(fi, v);
  1055. case runtime.Type_Info_Opaque:
  1056. fmt_opaque(fi, v);
  1057. case:
  1058. fmt_value(fi, any{v.data, info.base.id}, verb);
  1059. }
  1060. case runtime.Type_Info_Boolean: fmt_arg(fi, v, verb);
  1061. case runtime.Type_Info_Integer: fmt_arg(fi, v, verb);
  1062. case runtime.Type_Info_Rune: fmt_arg(fi, v, verb);
  1063. case runtime.Type_Info_Float: fmt_arg(fi, v, verb);
  1064. case runtime.Type_Info_Complex: fmt_arg(fi, v, verb);
  1065. case runtime.Type_Info_Quaternion: fmt_arg(fi, v, verb);
  1066. case runtime.Type_Info_String: fmt_arg(fi, v, verb);
  1067. case runtime.Type_Info_Pointer:
  1068. if v.id == typeid_of(^runtime.Type_Info) {
  1069. reflect.write_type(fi.buf, (^^runtime.Type_Info)(v.data)^);
  1070. } else {
  1071. ptr := (^rawptr)(v.data)^;
  1072. if verb != 'p' && info.elem != nil {
  1073. a := any{ptr, info.elem.id};
  1074. elem := runtime.type_info_base(info.elem);
  1075. if elem != nil do #partial switch e in elem.variant {
  1076. case runtime.Type_Info_Array,
  1077. runtime.Type_Info_Slice,
  1078. runtime.Type_Info_Dynamic_Array,
  1079. runtime.Type_Info_Map:
  1080. if ptr == nil {
  1081. strings.write_string(fi.buf, "<nil>");
  1082. return;
  1083. }
  1084. if fi.record_level < 1 {
  1085. fi.record_level += 1;
  1086. defer fi.record_level -= 1;
  1087. strings.write_byte(fi.buf, '&');
  1088. fmt_value(fi, a, verb);
  1089. return;
  1090. }
  1091. case runtime.Type_Info_Struct,
  1092. runtime.Type_Info_Union:
  1093. if ptr == nil {
  1094. strings.write_string(fi.buf, "<nil>");
  1095. return;
  1096. }
  1097. if fi.record_level < 1 {
  1098. fi.record_level += 1;
  1099. defer fi.record_level -= 1;
  1100. strings.write_byte(fi.buf, '&');
  1101. fmt_value(fi, a, verb);
  1102. return;
  1103. }
  1104. }
  1105. }
  1106. fmt_pointer(fi, ptr, verb);
  1107. }
  1108. case runtime.Type_Info_Array:
  1109. strings.write_byte(fi.buf, '[');
  1110. defer strings.write_byte(fi.buf, ']');
  1111. for i in 0..<info.count {
  1112. if i > 0 do strings.write_string(fi.buf, ", ");
  1113. data := uintptr(v.data) + uintptr(i*info.elem_size);
  1114. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1115. }
  1116. case runtime.Type_Info_Enumerated_Array:
  1117. strings.write_byte(fi.buf, '[');
  1118. defer strings.write_byte(fi.buf, ']');
  1119. for i in 0..<info.count {
  1120. if i > 0 do strings.write_string(fi.buf, ", ");
  1121. idx, ok := stored_enum_value_to_string(info.index, info.min_value, i);
  1122. if ok {
  1123. strings.write_byte(fi.buf, '.');
  1124. strings.write_string(fi.buf, idx);
  1125. } else {
  1126. strings.write_i64(fi.buf, enum_value_to_i64(info.min_value)+i64(i));
  1127. }
  1128. strings.write_string(fi.buf, " = ");
  1129. data := uintptr(v.data) + uintptr(i*info.elem_size);
  1130. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1131. }
  1132. case runtime.Type_Info_Dynamic_Array:
  1133. if verb == 'p' {
  1134. slice := cast(^mem.Raw_Dynamic_Array)v.data;
  1135. fmt_pointer(fi, slice.data, 'p');
  1136. } else {
  1137. strings.write_byte(fi.buf, '[');
  1138. defer strings.write_byte(fi.buf, ']');
  1139. array := cast(^mem.Raw_Dynamic_Array)v.data;
  1140. for i in 0..<array.len {
  1141. if i > 0 do strings.write_string(fi.buf, ", ");
  1142. data := uintptr(array.data) + uintptr(i*info.elem_size);
  1143. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1144. }
  1145. }
  1146. case runtime.Type_Info_Simd_Vector:
  1147. if info.is_x86_mmx {
  1148. strings.write_string(fi.buf, "intrinsics.x86_mmx<>");
  1149. }
  1150. strings.write_byte(fi.buf, '<');
  1151. defer strings.write_byte(fi.buf, '>');
  1152. for i in 0..<info.count {
  1153. if i > 0 do strings.write_string(fi.buf, ", ");
  1154. data := uintptr(v.data) + uintptr(i*info.elem_size);
  1155. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1156. }
  1157. case runtime.Type_Info_Slice:
  1158. if verb == 'p' {
  1159. slice := cast(^mem.Raw_Slice)v.data;
  1160. fmt_pointer(fi, slice.data, 'p');
  1161. } else {
  1162. strings.write_byte(fi.buf, '[');
  1163. defer strings.write_byte(fi.buf, ']');
  1164. slice := cast(^mem.Raw_Slice)v.data;
  1165. for i in 0..<slice.len {
  1166. if i > 0 do strings.write_string(fi.buf, ", ");
  1167. data := uintptr(slice.data) + uintptr(i*info.elem_size);
  1168. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb);
  1169. }
  1170. }
  1171. case runtime.Type_Info_Map:
  1172. if verb != 'v' {
  1173. fmt_bad_verb(fi, verb);
  1174. return;
  1175. }
  1176. strings.write_string(fi.buf, "map[");
  1177. defer strings.write_byte(fi.buf, ']');
  1178. m := (^mem.Raw_Map)(v.data);
  1179. if m != nil {
  1180. if info.generated_struct == nil {
  1181. return;
  1182. }
  1183. entries := &m.entries;
  1184. gs := runtime.type_info_base(info.generated_struct).variant.(runtime.Type_Info_Struct);
  1185. ed := runtime.type_info_base(gs.types[1]).variant.(runtime.Type_Info_Dynamic_Array);
  1186. entry_type := ed.elem.variant.(runtime.Type_Info_Struct);
  1187. entry_size := ed.elem_size;
  1188. for i in 0..<entries.len {
  1189. if i > 0 do strings.write_string(fi.buf, ", ");
  1190. data := uintptr(entries.data) + uintptr(i*entry_size);
  1191. header := cast(^runtime.Map_Entry_Header)data;
  1192. if reflect.is_string(info.key) {
  1193. strings.write_string(fi.buf, header.key.str);
  1194. } else {
  1195. fi := Info{buf = fi.buf};
  1196. fmt_arg(&fi, any{rawptr(&header.key.hash), info.key.id}, 'v');
  1197. }
  1198. strings.write_string(fi.buf, "=");
  1199. value := data + entry_type.offsets[2];
  1200. fmt_arg(fi, any{rawptr(value), info.value.id}, 'v');
  1201. }
  1202. }
  1203. case runtime.Type_Info_Struct:
  1204. if info.is_raw_union {
  1205. strings.write_string(fi.buf, "(raw_union)");
  1206. return;
  1207. }
  1208. is_soa := info.soa_kind != .None;
  1209. strings.write_byte(fi.buf, is_soa ? '[' : '{');
  1210. defer strings.write_byte(fi.buf, is_soa ? ']' : '}');
  1211. fi.indent += 1; defer fi.indent -= 1;
  1212. hash := fi.hash; defer fi.hash = hash;
  1213. fi.hash = false;
  1214. if hash do strings.write_byte(fi.buf, '\n');
  1215. if is_soa {
  1216. fi.indent += 1;
  1217. defer fi.indent -= 1;
  1218. base_type_name: string;
  1219. if v, ok := info.soa_base_type.variant.(runtime.Type_Info_Named); ok {
  1220. base_type_name = v.name;
  1221. }
  1222. actual_field_count := len(info.names);
  1223. n := uintptr(info.soa_len);
  1224. if info.soa_kind == .Slice {
  1225. actual_field_count = len(info.names)-1; // len
  1226. n = uintptr((^int)(uintptr(v.data) + info.offsets[actual_field_count])^);
  1227. } else if info.soa_kind == .Dynamic {
  1228. actual_field_count = len(info.names)-3; // len, cap, allocator
  1229. n = uintptr((^int)(uintptr(v.data) + info.offsets[actual_field_count])^);
  1230. }
  1231. for index in 0..<n {
  1232. if !hash && index > 0 do strings.write_string(fi.buf, ", ");
  1233. field_count := -1;
  1234. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1235. strings.write_string(fi.buf, base_type_name);
  1236. strings.write_byte(fi.buf, '{');
  1237. defer strings.write_byte(fi.buf, '}');
  1238. for i in 0..<actual_field_count {
  1239. name := info.names[i];
  1240. field_count += 1;
  1241. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1242. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  1243. strings.write_string(fi.buf, name);
  1244. strings.write_string(fi.buf, " = ");
  1245. if info.soa_kind == .Fixed {
  1246. t := info.types[i].variant.(runtime.Type_Info_Array).elem;
  1247. t_size := uintptr(t.size);
  1248. if reflect.is_any(t) {
  1249. strings.write_string(fi.buf, "any{}");
  1250. } else {
  1251. data := rawptr(uintptr(v.data) + info.offsets[i] + index*t_size);
  1252. fmt_arg(fi, any{data, t.id}, 'v');
  1253. }
  1254. } else {
  1255. t := info.types[i].variant.(runtime.Type_Info_Pointer).elem;
  1256. t_size := uintptr(t.size);
  1257. if reflect.is_any(t) {
  1258. strings.write_string(fi.buf, "any{}");
  1259. } else {
  1260. field_ptr := (^^byte)(uintptr(v.data) + info.offsets[i])^;
  1261. data := rawptr(uintptr(field_ptr) + index*t_size);
  1262. fmt_arg(fi, any{data, t.id}, 'v');
  1263. }
  1264. }
  1265. if hash do strings.write_string(fi.buf, ",\n");
  1266. }
  1267. }
  1268. } else {
  1269. field_count := -1;
  1270. for name, i in info.names {
  1271. field_count += 1;
  1272. if !hash && field_count > 0 do strings.write_string(fi.buf, ", ");
  1273. if hash do for in 0..<fi.indent do strings.write_byte(fi.buf, '\t');
  1274. strings.write_string(fi.buf, name);
  1275. strings.write_string(fi.buf, " = ");
  1276. if t := info.types[i]; reflect.is_any(t) {
  1277. strings.write_string(fi.buf, "any{}");
  1278. } else {
  1279. data := rawptr(uintptr(v.data) + info.offsets[i]);
  1280. fmt_arg(fi, any{data, t.id}, 'v');
  1281. }
  1282. if hash do strings.write_string(fi.buf, ",\n");
  1283. }
  1284. }
  1285. case runtime.Type_Info_Union:
  1286. if type_info.size == 0 {
  1287. strings.write_string(fi.buf, "nil");
  1288. return;
  1289. }
  1290. tag_ptr := uintptr(v.data) + info.tag_offset;
  1291. tag_any := any{rawptr(tag_ptr), info.tag_type.id};
  1292. tag: i64 = -1;
  1293. switch i in tag_any {
  1294. case u8: tag = i64(i);
  1295. case i8: tag = i64(i);
  1296. case u16: tag = i64(i);
  1297. case i16: tag = i64(i);
  1298. case u32: tag = i64(i);
  1299. case i32: tag = i64(i);
  1300. case u64: tag = i64(i);
  1301. case i64: tag = i64(i);
  1302. case: panic("Invalid union tag type");
  1303. }
  1304. assert(tag >= 0);
  1305. if v.data == nil {
  1306. strings.write_string(fi.buf, "nil");
  1307. } else if info.no_nil {
  1308. id := info.variants[tag].id;
  1309. fmt_arg(fi, any{v.data, id}, verb);
  1310. } else if tag == 0 {
  1311. strings.write_string(fi.buf, "nil");
  1312. } else {
  1313. id := info.variants[tag-1].id;
  1314. fmt_arg(fi, any{v.data, id}, verb);
  1315. }
  1316. case runtime.Type_Info_Enum:
  1317. fmt_enum(fi, v, verb);
  1318. case runtime.Type_Info_Procedure:
  1319. ptr := (^rawptr)(v.data)^;
  1320. if ptr == nil {
  1321. strings.write_string(fi.buf, "nil");
  1322. } else {
  1323. reflect.write_typeid(fi.buf, v.id);
  1324. strings.write_string(fi.buf, " @ ");
  1325. fmt_pointer(fi, ptr, 'p');
  1326. }
  1327. case runtime.Type_Info_Type_Id:
  1328. id := (^typeid)(v.data)^;
  1329. reflect.write_typeid(fi.buf, id);
  1330. case runtime.Type_Info_Bit_Field:
  1331. fmt_bit_field(fi, v);
  1332. case runtime.Type_Info_Bit_Set:
  1333. fmt_bit_set(fi, v);
  1334. case runtime.Type_Info_Opaque:
  1335. fmt_opaque(fi, v);
  1336. }
  1337. }
  1338. fmt_complex :: proc(fi: ^Info, c: complex128, bits: int, verb: rune) {
  1339. switch verb {
  1340. case 'f', 'F', 'v', 'h', 'H':
  1341. r, i := real(c), imag(c);
  1342. fmt_float(fi, r, bits/2, verb);
  1343. if !fi.plus && i >= 0 {
  1344. strings.write_rune(fi.buf, '+');
  1345. }
  1346. fmt_float(fi, i, bits/2, verb);
  1347. strings.write_rune(fi.buf, 'i');
  1348. case:
  1349. fmt_bad_verb(fi, verb);
  1350. return;
  1351. }
  1352. }
  1353. fmt_quaternion :: proc(fi: ^Info, q: quaternion256, bits: int, verb: rune) {
  1354. switch verb {
  1355. case 'f', 'F', 'v', 'h', 'H':
  1356. r, i, j, k := real(q), imag(q), jmag(q), kmag(q);
  1357. fmt_float(fi, r, bits/4, verb);
  1358. if !fi.plus && i >= 0 do strings.write_rune(fi.buf, '+');
  1359. fmt_float(fi, i, bits/4, verb);
  1360. strings.write_rune(fi.buf, 'i');
  1361. if !fi.plus && j >= 0 do strings.write_rune(fi.buf, '+');
  1362. fmt_float(fi, j, bits/4, verb);
  1363. strings.write_rune(fi.buf, 'j');
  1364. if !fi.plus && k >= 0 do strings.write_rune(fi.buf, '+');
  1365. fmt_float(fi, k, bits/4, verb);
  1366. strings.write_rune(fi.buf, 'k');
  1367. case:
  1368. fmt_bad_verb(fi, verb);
  1369. return;
  1370. }
  1371. }
  1372. fmt_arg :: proc(fi: ^Info, arg: any, verb: rune) {
  1373. if arg == nil {
  1374. strings.write_string(fi.buf, "<nil>");
  1375. return;
  1376. }
  1377. fi.arg = arg;
  1378. if verb == 'T' {
  1379. ti := type_info_of(arg.id);
  1380. switch a in arg {
  1381. case ^runtime.Type_Info: ti = a;
  1382. }
  1383. reflect.write_type(fi.buf, ti);
  1384. return;
  1385. }
  1386. custom_types: switch a in arg {
  1387. case runtime.Source_Code_Location:
  1388. if fi.hash && verb == 'v' {
  1389. strings.write_string(fi.buf, a.file_path);
  1390. strings.write_byte(fi.buf, '(');
  1391. strings.write_i64(fi.buf, i64(a.line), 10);
  1392. strings.write_byte(fi.buf, ':');
  1393. strings.write_i64(fi.buf, i64(a.column), 10);
  1394. strings.write_byte(fi.buf, ')');
  1395. return;
  1396. }
  1397. }
  1398. base_arg := arg;
  1399. base_arg.id = runtime.typeid_base(base_arg.id);
  1400. switch a in base_arg {
  1401. case bool: fmt_bool(fi, bool(a), verb);
  1402. case b8: fmt_bool(fi, bool(a), verb);
  1403. case b16: fmt_bool(fi, bool(a), verb);
  1404. case b32: fmt_bool(fi, bool(a), verb);
  1405. case b64: fmt_bool(fi, bool(a), verb);
  1406. case any: fmt_arg(fi, a, verb);
  1407. case rune: fmt_rune(fi, a, verb);
  1408. case f32: fmt_float(fi, f64(a), 32, verb);
  1409. case f64: fmt_float(fi, a, 64, verb);
  1410. case complex64: fmt_complex(fi, complex128(a), 64, verb);
  1411. case complex128: fmt_complex(fi, a, 128, verb);
  1412. case quaternion128: fmt_quaternion(fi, quaternion256(a), 128, verb);
  1413. case quaternion256: fmt_quaternion(fi, a, 256, verb);
  1414. case i8: fmt_int(fi, u64(a), true, 8, verb);
  1415. case u8: fmt_int(fi, u64(a), false, 8, verb);
  1416. case i16: fmt_int(fi, u64(a), true, 16, verb);
  1417. case u16: fmt_int(fi, u64(a), false, 16, verb);
  1418. case i32: fmt_int(fi, u64(a), true, 32, verb);
  1419. case u32: fmt_int(fi, u64(a), false, 32, verb);
  1420. case i64: fmt_int(fi, u64(a), true, 64, verb);
  1421. case u64: fmt_int(fi, u64(a), false, 64, verb);
  1422. case int: fmt_int(fi, u64(a), true, 8*size_of(int), verb);
  1423. case uint: fmt_int(fi, u64(a), false, 8*size_of(uint), verb);
  1424. case uintptr: fmt_int(fi, u64(a), false, 8*size_of(uintptr), verb);
  1425. case string: fmt_string(fi, a, verb);
  1426. case cstring: fmt_cstring(fi, a, verb);
  1427. case typeid: reflect.write_typeid(fi.buf, a);
  1428. case i16le: fmt_int(fi, u64(a), true, 16, verb);
  1429. case u16le: fmt_int(fi, u64(a), false, 16, verb);
  1430. case i32le: fmt_int(fi, u64(a), true, 32, verb);
  1431. case u32le: fmt_int(fi, u64(a), false, 32, verb);
  1432. case i64le: fmt_int(fi, u64(a), true, 64, verb);
  1433. case u64le: fmt_int(fi, u64(a), false, 64, verb);
  1434. case i16be: fmt_int(fi, u64(a), true, 16, verb);
  1435. case u16be: fmt_int(fi, u64(a), false, 16, verb);
  1436. case i32be: fmt_int(fi, u64(a), true, 32, verb);
  1437. case u32be: fmt_int(fi, u64(a), false, 32, verb);
  1438. case i64be: fmt_int(fi, u64(a), true, 64, verb);
  1439. case u64be: fmt_int(fi, u64(a), false, 64, verb);
  1440. case i128: fmt_int_128(fi, u128(a), true, 128, verb);
  1441. case u128: fmt_int_128(fi, u128(a), false, 128, verb);
  1442. case i128le: fmt_int_128(fi, u128(a), true, 128, verb);
  1443. case u128le: fmt_int_128(fi, u128(a), false, 128, verb);
  1444. case i128be: fmt_int_128(fi, u128(a), true, 128, verb);
  1445. case u128be: fmt_int_128(fi, u128(a), false, 128, verb);
  1446. case: fmt_value(fi, arg, verb);
  1447. }
  1448. }