fmt.odin 57 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277
  1. package fmt
  2. import "core:math/bits"
  3. import "core:mem"
  4. import "core:io"
  5. import "core:reflect"
  6. import "core:runtime"
  7. import "core:strconv"
  8. import "core:strings"
  9. import "core:time"
  10. import "core:unicode/utf8"
  11. import "core:intrinsics"
  12. // Internal data structure that stores the required information for formatted printing
  13. Info :: struct {
  14. minus: bool,
  15. plus: bool,
  16. space: bool,
  17. zero: bool,
  18. hash: bool,
  19. width_set: bool,
  20. prec_set: bool,
  21. width: int,
  22. prec: int,
  23. indent: int,
  24. reordered: bool,
  25. good_arg_index: bool,
  26. ignore_user_formatters: bool,
  27. in_bad: bool,
  28. writer: io.Writer,
  29. arg: any, // Temporary
  30. indirection_level: int,
  31. record_level: int,
  32. optional_len: Maybe(int),
  33. use_nul_termination: bool,
  34. n: int, // bytes written
  35. }
  36. // Custom formatter signature. It returns true if the formatting was successful and false when it could not be done
  37. User_Formatter :: #type proc(fi: ^Info, arg: any, verb: rune) -> bool
  38. Register_User_Formatter_Error :: enum {
  39. None,
  40. No_User_Formatter,
  41. Formatter_Previously_Found,
  42. }
  43. // NOTE(bill): This is a pointer to prevent accidental additions
  44. // it is prefixed with `_` rather than marked with a private attribute so that users can access it if necessary
  45. _user_formatters: ^map[typeid]User_Formatter
  46. // set_user_formatters assigns m to a global value allowing the user have custom print formatting for specific
  47. // types
  48. set_user_formatters :: proc(m: ^map[typeid]User_Formatter) {
  49. _user_formatters = m
  50. }
  51. // register_user_formatter assigns a formatter to a specific typeid. set_user_formatters must be called
  52. // before any use of this procedure.
  53. register_user_formatter :: proc(id: typeid, formatter: User_Formatter) -> Register_User_Formatter_Error {
  54. if _user_formatters == nil {
  55. return .No_User_Formatter
  56. }
  57. if prev, found := _user_formatters[id]; found && prev != nil {
  58. return .Formatter_Previously_Found
  59. }
  60. _user_formatters[id] = formatter
  61. return .None
  62. }
  63. // aprint procedure return a string that was allocated with the current context
  64. // They must be freed accordingly
  65. aprint :: proc(args: ..any, sep := " ") -> string {
  66. str: strings.Builder
  67. strings.builder_init(&str)
  68. sbprint(buf=&str, args=args, sep=sep)
  69. return strings.to_string(str)
  70. }
  71. // aprintln procedure return a string that was allocated with the current context
  72. // They must be freed accordingly
  73. aprintln :: proc(args: ..any, sep := " ") -> string {
  74. str: strings.Builder
  75. strings.builder_init(&str)
  76. sbprintln(buf=&str, args=args, sep=sep)
  77. return strings.to_string(str)
  78. }
  79. // aprintf procedure return a string that was allocated with the current context
  80. // They must be freed accordingly
  81. aprintf :: proc(fmt: string, args: ..any) -> string {
  82. str: strings.Builder
  83. strings.builder_init(&str)
  84. sbprintf(&str, fmt, ..args)
  85. return strings.to_string(str)
  86. }
  87. // tprint procedure return a string that was allocated with the current context's temporary allocator
  88. tprint :: proc(args: ..any, sep := " ") -> string {
  89. str: strings.Builder
  90. strings.builder_init(&str, context.temp_allocator)
  91. sbprint(buf=&str, args=args, sep=sep)
  92. return strings.to_string(str)
  93. }
  94. // tprintln procedure return a string that was allocated with the current context's temporary allocator
  95. tprintln :: proc(args: ..any, sep := " ") -> string {
  96. str: strings.Builder
  97. strings.builder_init(&str, context.temp_allocator)
  98. sbprintln(buf=&str, args=args, sep=sep)
  99. return strings.to_string(str)
  100. }
  101. // tprintf procedure return a string that was allocated with the current context's temporary allocator
  102. tprintf :: proc(fmt: string, args: ..any) -> string {
  103. str: strings.Builder
  104. strings.builder_init(&str, context.temp_allocator)
  105. sbprintf(&str, fmt, ..args)
  106. return strings.to_string(str)
  107. }
  108. // bprint procedures return a string using a buffer from an array
  109. bprint :: proc(buf: []byte, args: ..any, sep := " ") -> string {
  110. sb := strings.builder_from_bytes(buf[0:len(buf)])
  111. return sbprint(buf=&sb, args=args, sep=sep)
  112. }
  113. // bprintln procedures return a string using a buffer from an array
  114. bprintln :: proc(buf: []byte, args: ..any, sep := " ") -> string {
  115. sb := strings.builder_from_bytes(buf[0:len(buf)])
  116. return sbprintln(buf=&sb, args=args, sep=sep)
  117. }
  118. // bprintf procedures return a string using a buffer from an array
  119. bprintf :: proc(buf: []byte, fmt: string, args: ..any) -> string {
  120. sb := strings.builder_from_bytes(buf[0:len(buf)])
  121. return sbprintf(&sb, fmt, ..args)
  122. }
  123. // formatted assert
  124. assertf :: proc(condition: bool, fmt: string, args: ..any, loc := #caller_location) -> bool {
  125. if !condition {
  126. p := context.assertion_failure_proc
  127. if p == nil {
  128. p = runtime.default_assertion_failure_proc
  129. }
  130. message := tprintf(fmt, ..args)
  131. p("Runtime assertion", message, loc)
  132. }
  133. return condition
  134. }
  135. // formatted panic
  136. panicf :: proc(fmt: string, args: ..any, loc := #caller_location) -> ! {
  137. p := context.assertion_failure_proc
  138. if p == nil {
  139. p = runtime.default_assertion_failure_proc
  140. }
  141. message := tprintf(fmt, ..args)
  142. p("Panic", message, loc)
  143. }
  144. // formatted printing for cstrings
  145. caprintf :: proc(format: string, args: ..any) -> cstring {
  146. str: strings.Builder
  147. strings.builder_init(&str)
  148. sbprintf(&str, format, ..args)
  149. strings.write_byte(&str, 0)
  150. s := strings.to_string(str)
  151. return cstring(raw_data(s))
  152. }
  153. // c string with temp allocator
  154. ctprintf :: proc(format: string, args: ..any) -> cstring {
  155. str: strings.Builder
  156. strings.builder_init(&str, context.temp_allocator)
  157. sbprintf(&str, format, ..args)
  158. strings.write_byte(&str, 0)
  159. s := strings.to_string(str)
  160. return cstring(raw_data(s))
  161. }
  162. // sbprint formats using the default print settings and writes to buf
  163. sbprint :: proc(buf: ^strings.Builder, args: ..any, sep := " ") -> string {
  164. wprint(w=strings.to_writer(buf), args=args, sep=sep)
  165. return strings.to_string(buf^)
  166. }
  167. // sbprintln formats using the default print settings and writes to buf
  168. sbprintln :: proc(buf: ^strings.Builder, args: ..any, sep := " ") -> string {
  169. wprintln(w=strings.to_writer(buf), args=args, sep=sep)
  170. return strings.to_string(buf^)
  171. }
  172. // sbprintf formats according to the specififed format string and writes to buf
  173. sbprintf :: proc(buf: ^strings.Builder, fmt: string, args: ..any) -> string {
  174. wprintf(w=strings.to_writer(buf), fmt=fmt, args=args)
  175. return strings.to_string(buf^)
  176. }
  177. // wprint formats using the default print settings and writes to w
  178. wprint :: proc(w: io.Writer, args: ..any, sep := " ") -> int {
  179. fi: Info
  180. fi.writer = w
  181. // NOTE(bill): Old approach
  182. // prev_string := false;
  183. // for arg, i in args {
  184. // is_string := arg != nil && reflect.is_string(type_info_of(arg.id));
  185. // if i > 0 && !is_string && !prev_string {
  186. // io.write_byte(writer, ' ');
  187. // }
  188. // fmt_value(&fi, args[i], 'v');
  189. // prev_string = is_string;
  190. // }
  191. // NOTE(bill, 2020-06-19): I have found that the previous approach was not what people were expecting
  192. // and were expecting `*print` to be the same `*println` except for the added newline
  193. // so I am going to keep the same behaviour as `*println` for `*print`
  194. for _, i in args {
  195. if i > 0 {
  196. io.write_string(fi.writer, sep, &fi.n)
  197. }
  198. fmt_value(&fi, args[i], 'v')
  199. }
  200. io.flush(auto_cast w)
  201. return fi.n
  202. }
  203. // wprintln formats using the default print settings and writes to w
  204. wprintln :: proc(w: io.Writer, args: ..any, sep := " ") -> int {
  205. fi: Info
  206. fi.writer = w
  207. for _, i in args {
  208. if i > 0 {
  209. io.write_string(fi.writer, sep, &fi.n)
  210. }
  211. fmt_value(&fi, args[i], 'v')
  212. }
  213. io.write_byte(fi.writer, '\n', &fi.n)
  214. io.flush(auto_cast w)
  215. return fi.n
  216. }
  217. // wprintf formats according to the specififed format string and writes to w
  218. wprintf :: proc(w: io.Writer, fmt: string, args: ..any) -> int {
  219. fi: Info
  220. arg_index: int = 0
  221. end := len(fmt)
  222. was_prev_index := false
  223. loop: for i := 0; i < end; /**/ {
  224. fi = Info{writer = w, good_arg_index = true, reordered = fi.reordered, n = fi.n}
  225. prev_i := i
  226. for i < end && !(fmt[i] == '%' || fmt[i] == '{' || fmt[i] == '}') {
  227. i += 1
  228. }
  229. if i > prev_i {
  230. io.write_string(fi.writer, fmt[prev_i:i], &fi.n)
  231. }
  232. if i >= end {
  233. break loop
  234. }
  235. char := fmt[i]
  236. // Process a "char"
  237. i += 1
  238. if char == '}' {
  239. if i < end && fmt[i] == char {
  240. // Skip extra one
  241. i += 1
  242. }
  243. io.write_byte(fi.writer, char, &fi.n)
  244. continue loop
  245. } else if char == '{' {
  246. if i < end && fmt[i] == char {
  247. // Skip extra one
  248. i += 1
  249. io.write_byte(fi.writer, char, &fi.n)
  250. continue loop
  251. }
  252. }
  253. if char == '%' {
  254. prefix_loop: for ; i < end; i += 1 {
  255. switch fmt[i] {
  256. case '+':
  257. fi.plus = true
  258. case '-':
  259. fi.minus = true
  260. fi.zero = false
  261. case ' ':
  262. fi.space = true
  263. case '#':
  264. fi.hash = true
  265. case '0':
  266. fi.zero = !fi.minus
  267. case:
  268. break prefix_loop
  269. }
  270. }
  271. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args))
  272. // Width
  273. if i < end && fmt[i] == '*' {
  274. i += 1
  275. fi.width, arg_index, fi.width_set = int_from_arg(args, arg_index)
  276. if !fi.width_set {
  277. io.write_string(w, "%!(BAD WIDTH)", &fi.n)
  278. }
  279. if fi.width < 0 {
  280. fi.width = -fi.width
  281. fi.minus = true
  282. fi.zero = false
  283. }
  284. was_prev_index = false
  285. } else {
  286. fi.width, i, fi.width_set = _parse_int(fmt, i)
  287. if was_prev_index && fi.width_set { // %[6]2d
  288. fi.good_arg_index = false
  289. }
  290. }
  291. // Precision
  292. if i < end && fmt[i] == '.' {
  293. i += 1
  294. if was_prev_index { // %[6].2d
  295. fi.good_arg_index = false
  296. }
  297. if i < end && fmt[i] == '*' {
  298. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args))
  299. i += 1
  300. fi.prec, arg_index, fi.prec_set = int_from_arg(args, arg_index)
  301. if fi.prec < 0 {
  302. fi.prec = 0
  303. fi.prec_set = false
  304. }
  305. if !fi.prec_set {
  306. io.write_string(fi.writer, "%!(BAD PRECISION)", &fi.n)
  307. }
  308. was_prev_index = false
  309. } else {
  310. fi.prec, i, fi.prec_set = _parse_int(fmt, i)
  311. }
  312. }
  313. if !was_prev_index {
  314. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args))
  315. }
  316. if i >= end {
  317. io.write_string(fi.writer, "%!(NO VERB)", &fi.n)
  318. break loop
  319. }
  320. verb, w := utf8.decode_rune_in_string(fmt[i:])
  321. i += w
  322. switch {
  323. case verb == '%':
  324. io.write_byte(fi.writer, '%', &fi.n)
  325. case !fi.good_arg_index:
  326. io.write_string(fi.writer, "%!(BAD ARGUMENT NUMBER)", &fi.n)
  327. case arg_index >= len(args):
  328. io.write_string(fi.writer, "%!(MISSING ARGUMENT)", &fi.n)
  329. case:
  330. fmt_arg(&fi, args[arg_index], verb)
  331. arg_index += 1
  332. }
  333. } else if char == '{' {
  334. if i < end && fmt[i] != '}' && fmt[i] != ':' {
  335. new_arg_index, new_i, ok := _parse_int(fmt, i)
  336. if ok {
  337. fi.reordered = true
  338. was_prev_index = true
  339. arg_index = new_arg_index
  340. i = new_i
  341. } else {
  342. io.write_string(fi.writer, "%!(BAD ARGUMENT NUMBER ", &fi.n)
  343. // Skip over the bad argument
  344. start_index := i
  345. for i < end && fmt[i] != '}' && fmt[i] != ':' {
  346. i += 1
  347. }
  348. fmt_arg(&fi, fmt[start_index:i], 'v')
  349. io.write_string(fi.writer, ")", &fi.n)
  350. }
  351. }
  352. verb: rune = 'v'
  353. if i < end && fmt[i] == ':' {
  354. i += 1
  355. prefix_loop_percent: for ; i < end; i += 1 {
  356. switch fmt[i] {
  357. case '+':
  358. fi.plus = true
  359. case '-':
  360. fi.minus = true
  361. fi.zero = false
  362. case ' ':
  363. fi.space = true
  364. case '#':
  365. fi.hash = true
  366. case '0':
  367. fi.zero = !fi.minus
  368. case:
  369. break prefix_loop_percent
  370. }
  371. }
  372. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args))
  373. // Width
  374. if i < end && fmt[i] == '*' {
  375. i += 1
  376. fi.width, arg_index, fi.width_set = int_from_arg(args, arg_index)
  377. if !fi.width_set {
  378. io.write_string(fi.writer, "%!(BAD WIDTH)", &fi.n)
  379. }
  380. if fi.width < 0 {
  381. fi.width = -fi.width
  382. fi.minus = true
  383. fi.zero = false
  384. }
  385. was_prev_index = false
  386. } else {
  387. fi.width, i, fi.width_set = _parse_int(fmt, i)
  388. if was_prev_index && fi.width_set { // %[6]2d
  389. fi.good_arg_index = false
  390. }
  391. }
  392. // Precision
  393. if i < end && fmt[i] == '.' {
  394. i += 1
  395. if was_prev_index { // %[6].2d
  396. fi.good_arg_index = false
  397. }
  398. if i < end && fmt[i] == '*' {
  399. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args))
  400. i += 1
  401. fi.prec, arg_index, fi.prec_set = int_from_arg(args, arg_index)
  402. if fi.prec < 0 {
  403. fi.prec = 0
  404. fi.prec_set = false
  405. }
  406. if !fi.prec_set {
  407. io.write_string(fi.writer, "%!(BAD PRECISION)", &fi.n)
  408. }
  409. was_prev_index = false
  410. } else {
  411. fi.prec, i, fi.prec_set = _parse_int(fmt, i)
  412. }
  413. }
  414. if !was_prev_index {
  415. arg_index, i, was_prev_index = _arg_number(&fi, arg_index, fmt, i, len(args))
  416. }
  417. if i >= end {
  418. io.write_string(fi.writer, "%!(NO VERB)", &fi.n)
  419. break loop
  420. }
  421. w: int = 1
  422. verb, w = utf8.decode_rune_in_string(fmt[i:])
  423. i += w
  424. }
  425. if i >= end {
  426. io.write_string(fi.writer, "%!(MISSING CLOSE BRACE)", &fi.n)
  427. break loop
  428. }
  429. brace, w := utf8.decode_rune_in_string(fmt[i:])
  430. i += w
  431. switch {
  432. case brace != '}':
  433. io.write_string(fi.writer, "%!(MISSING CLOSE BRACE)", &fi.n)
  434. case !fi.good_arg_index:
  435. io.write_string(fi.writer, "%!(BAD ARGUMENT NUMBER)", &fi.n)
  436. case arg_index >= len(args):
  437. io.write_string(fi.writer, "%!(MISSING ARGUMENT)", &fi.n)
  438. case:
  439. fmt_arg(&fi, args[arg_index], verb)
  440. arg_index += 1
  441. }
  442. }
  443. }
  444. if !fi.reordered && arg_index < len(args) {
  445. io.write_string(fi.writer, "%!(EXTRA ", &fi.n)
  446. for arg, index in args[arg_index:] {
  447. if index > 0 {
  448. io.write_string(fi.writer, ", ", &fi.n)
  449. }
  450. if arg == nil {
  451. io.write_string(fi.writer, "<nil>", &fi.n)
  452. } else {
  453. fmt_arg(&fi, args[index], 'v')
  454. }
  455. }
  456. io.write_string(fi.writer, ")", &fi.n)
  457. }
  458. io.flush(auto_cast w)
  459. return fi.n
  460. }
  461. // wprint_type is a utility procedure to write a ^runtime.Type_Info value to w
  462. wprint_type :: proc(w: io.Writer, info: ^runtime.Type_Info) -> (int, io.Error) {
  463. n, err := reflect.write_type(w, info)
  464. io.flush(auto_cast w)
  465. return n, err
  466. }
  467. // wprint_typeid is a utility procedure to write a typeid value to w
  468. wprint_typeid :: proc(w: io.Writer, id: typeid) -> (int, io.Error) {
  469. n, err := reflect.write_type(w, type_info_of(id))
  470. io.flush(auto_cast w)
  471. return n, err
  472. }
  473. _parse_int :: proc(s: string, offset: int) -> (result: int, new_offset: int, ok: bool) {
  474. is_digit :: #force_inline proc(r: byte) -> bool { return '0' <= r && r <= '9' }
  475. new_offset = offset
  476. for new_offset < len(s) {
  477. c := s[new_offset]
  478. if !is_digit(c) {
  479. break
  480. }
  481. new_offset += 1
  482. result *= 10
  483. result += int(c)-'0'
  484. }
  485. ok = new_offset > offset
  486. return
  487. }
  488. _arg_number :: proc(fi: ^Info, arg_index: int, format: string, offset, arg_count: int) -> (index, new_offset: int, ok: bool) {
  489. parse_arg_number :: proc(format: string) -> (int, int, bool) {
  490. if len(format) < 3 {
  491. return 0, 1, false
  492. }
  493. for i in 1..<len(format) {
  494. if format[i] == ']' {
  495. width, new_index, ok := _parse_int(format, 1)
  496. if !ok || new_index != i {
  497. return 0, i+1, false
  498. }
  499. return width-1, i+1, true
  500. }
  501. }
  502. return 0, 1, false
  503. }
  504. if len(format) <= offset || format[offset] != '[' {
  505. return arg_index, offset, false
  506. }
  507. fi.reordered = true
  508. width: int
  509. index, width, ok = parse_arg_number(format[offset:])
  510. if ok && 0 <= index && index < arg_count {
  511. return index, offset+width, true
  512. }
  513. fi.good_arg_index = false
  514. return arg_index, offset+width, false
  515. }
  516. int_from_arg :: proc(args: []any, arg_index: int) -> (int, int, bool) {
  517. num := 0
  518. new_arg_index := arg_index
  519. ok := true
  520. if arg_index < len(args) {
  521. num, ok = reflect.as_int(args[arg_index])
  522. }
  523. if ok {
  524. new_arg_index += 1
  525. }
  526. return num, new_arg_index, ok
  527. }
  528. fmt_bad_verb :: proc(using fi: ^Info, verb: rune) {
  529. prev_in_bad := fi.in_bad
  530. defer fi.in_bad = prev_in_bad
  531. fi.in_bad = true
  532. io.write_string(writer, "%!", &fi.n)
  533. io.write_rune(writer, verb, &fi.n)
  534. io.write_byte(writer, '(', &fi.n)
  535. if arg.id != nil {
  536. reflect.write_typeid(writer, arg.id, &fi.n)
  537. io.write_byte(writer, '=', &fi.n)
  538. fmt_value(fi, arg, 'v')
  539. } else {
  540. io.write_string(writer, "<nil>", &fi.n)
  541. }
  542. io.write_byte(writer, ')', &fi.n)
  543. }
  544. fmt_bool :: proc(using fi: ^Info, b: bool, verb: rune) {
  545. switch verb {
  546. case 't', 'v':
  547. fmt_string(fi, b ? "true" : "false", 's')
  548. case:
  549. fmt_bad_verb(fi, verb)
  550. }
  551. }
  552. fmt_write_padding :: proc(fi: ^Info, width: int) {
  553. if width <= 0 {
  554. return
  555. }
  556. pad_byte: byte = ' '
  557. if !fi.space {
  558. pad_byte = '0'
  559. }
  560. for i := 0; i < width; i += 1 {
  561. io.write_byte(fi.writer, pad_byte, &fi.n)
  562. }
  563. }
  564. _fmt_int :: proc(fi: ^Info, u: u64, base: int, is_signed: bool, bit_size: int, digits: string) {
  565. _, neg := strconv.is_integer_negative(u, is_signed, bit_size)
  566. BUF_SIZE :: 256
  567. if fi.width_set || fi.prec_set {
  568. width := fi.width + fi.prec + 3 // 3 extra bytes for sign and prefix
  569. if width > BUF_SIZE {
  570. // TODO(bill):????
  571. panic("_fmt_int: buffer overrun. Width and precision too big")
  572. }
  573. }
  574. prec := 0
  575. if fi.prec_set {
  576. prec = fi.prec
  577. if prec == 0 && u == 0 {
  578. prev_zero := fi.zero
  579. fi.zero = false
  580. fmt_write_padding(fi, fi.width)
  581. fi.zero = prev_zero
  582. return
  583. }
  584. } else if fi.zero && fi.width_set {
  585. prec = fi.width
  586. if neg || fi.plus {
  587. // There needs to be space for the "sign"
  588. prec -= 1
  589. }
  590. }
  591. switch base {
  592. case 2, 8, 10, 12, 16:
  593. break
  594. case:
  595. panic("_fmt_int: unknown base, whoops")
  596. }
  597. buf: [256]byte
  598. start := 0
  599. flags: strconv.Int_Flags
  600. if fi.hash && !fi.zero { flags |= {.Prefix} }
  601. if fi.plus { flags |= {.Plus} }
  602. s := strconv.append_bits(buf[start:], u, base, is_signed, bit_size, digits, flags)
  603. if fi.hash && fi.zero && fi.indent == 0 {
  604. c: byte = 0
  605. switch base {
  606. case 2: c = 'b'
  607. case 8: c = 'o'
  608. case 12: c = 'z'
  609. case 16: c = 'x'
  610. }
  611. if c != 0 {
  612. io.write_byte(fi.writer, '0', &fi.n)
  613. io.write_byte(fi.writer, c, &fi.n)
  614. }
  615. }
  616. prev_zero := fi.zero
  617. defer fi.zero = prev_zero
  618. fi.zero = false
  619. _pad(fi, s)
  620. }
  621. _fmt_int_128 :: proc(fi: ^Info, u: u128, base: int, is_signed: bool, bit_size: int, digits: string) {
  622. _, neg := strconv.is_integer_negative_128(u, is_signed, bit_size)
  623. BUF_SIZE :: 256
  624. if fi.width_set || fi.prec_set {
  625. width := fi.width + fi.prec + 3 // 3 extra bytes for sign and prefix
  626. if width > BUF_SIZE {
  627. // TODO(bill):????
  628. panic("_fmt_int: buffer overrun. Width and precision too big")
  629. }
  630. }
  631. prec := 0
  632. if fi.prec_set {
  633. prec = fi.prec
  634. if prec == 0 && u == 0 {
  635. prev_zero := fi.zero
  636. fi.zero = false
  637. fmt_write_padding(fi, fi.width)
  638. fi.zero = prev_zero
  639. return
  640. }
  641. } else if fi.zero && fi.width_set {
  642. prec = fi.width
  643. if neg || fi.plus {
  644. // There needs to be space for the "sign"
  645. prec -= 1
  646. }
  647. }
  648. switch base {
  649. case 2, 8, 10, 12, 16:
  650. break
  651. case:
  652. panic("_fmt_int: unknown base, whoops")
  653. }
  654. buf: [256]byte
  655. start := 0
  656. flags: strconv.Int_Flags
  657. if fi.hash && !fi.zero { flags |= {.Prefix} }
  658. if fi.plus { flags |= {.Plus} }
  659. s := strconv.append_bits_128(buf[start:], u, base, is_signed, bit_size, digits, flags)
  660. if fi.hash && fi.zero && fi.indent == 0 {
  661. c: byte = 0
  662. switch base {
  663. case 2: c = 'b'
  664. case 8: c = 'o'
  665. case 12: c = 'z'
  666. case 16: c = 'x'
  667. }
  668. if c != 0 {
  669. io.write_byte(fi.writer, '0', &fi.n)
  670. io.write_byte(fi.writer, c, &fi.n)
  671. }
  672. }
  673. prev_zero := fi.zero
  674. defer fi.zero = prev_zero
  675. fi.zero = false
  676. _pad(fi, s)
  677. }
  678. __DIGITS_LOWER := "0123456789abcdefx"
  679. __DIGITS_UPPER := "0123456789ABCDEFX"
  680. fmt_rune :: proc(fi: ^Info, r: rune, verb: rune) {
  681. switch verb {
  682. case 'c', 'r', 'v':
  683. io.write_rune(fi.writer, r, &fi.n)
  684. case 'q':
  685. fi.n += io.write_quoted_rune(fi.writer, r)
  686. case:
  687. fmt_int(fi, u64(r), false, 32, verb)
  688. }
  689. }
  690. fmt_int :: proc(fi: ^Info, u: u64, is_signed: bool, bit_size: int, verb: rune) {
  691. switch verb {
  692. case 'v': _fmt_int(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER)
  693. case 'b': _fmt_int(fi, u, 2, is_signed, bit_size, __DIGITS_LOWER)
  694. case 'o': _fmt_int(fi, u, 8, is_signed, bit_size, __DIGITS_LOWER)
  695. case 'i', 'd': _fmt_int(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER)
  696. case 'z': _fmt_int(fi, u, 12, is_signed, bit_size, __DIGITS_LOWER)
  697. case 'x': _fmt_int(fi, u, 16, is_signed, bit_size, __DIGITS_LOWER)
  698. case 'X': _fmt_int(fi, u, 16, is_signed, bit_size, __DIGITS_UPPER)
  699. case 'c', 'r':
  700. fmt_rune(fi, rune(u), verb)
  701. case 'U':
  702. r := rune(u)
  703. if r < 0 || r > utf8.MAX_RUNE {
  704. fmt_bad_verb(fi, verb)
  705. } else {
  706. io.write_string(fi.writer, "U+", &fi.n)
  707. _fmt_int(fi, u, 16, false, bit_size, __DIGITS_UPPER)
  708. }
  709. case:
  710. fmt_bad_verb(fi, verb)
  711. }
  712. }
  713. fmt_int_128 :: proc(fi: ^Info, u: u128, is_signed: bool, bit_size: int, verb: rune) {
  714. switch verb {
  715. case 'v': _fmt_int_128(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER)
  716. case 'b': _fmt_int_128(fi, u, 2, is_signed, bit_size, __DIGITS_LOWER)
  717. case 'o': _fmt_int_128(fi, u, 8, is_signed, bit_size, __DIGITS_LOWER)
  718. case 'i', 'd': _fmt_int_128(fi, u, 10, is_signed, bit_size, __DIGITS_LOWER)
  719. case 'z': _fmt_int_128(fi, u, 12, is_signed, bit_size, __DIGITS_LOWER)
  720. case 'x': _fmt_int_128(fi, u, 16, is_signed, bit_size, __DIGITS_LOWER)
  721. case 'X': _fmt_int_128(fi, u, 16, is_signed, bit_size, __DIGITS_UPPER)
  722. case 'c', 'r':
  723. fmt_rune(fi, rune(u), verb)
  724. case 'U':
  725. r := rune(u)
  726. if r < 0 || r > utf8.MAX_RUNE {
  727. fmt_bad_verb(fi, verb)
  728. } else {
  729. io.write_string(fi.writer, "U+", &fi.n)
  730. _fmt_int_128(fi, u, 16, false, bit_size, __DIGITS_UPPER)
  731. }
  732. case:
  733. fmt_bad_verb(fi, verb)
  734. }
  735. }
  736. _pad :: proc(fi: ^Info, s: string) {
  737. if !fi.width_set {
  738. io.write_string(fi.writer, s, &fi.n)
  739. return
  740. }
  741. width := fi.width - utf8.rune_count_in_string(s)
  742. if fi.minus { // right pad
  743. io.write_string(fi.writer, s, &fi.n)
  744. fmt_write_padding(fi, width)
  745. } else { // left pad
  746. fmt_write_padding(fi, width)
  747. io.write_string(fi.writer, s, &fi.n)
  748. }
  749. }
  750. _fmt_float_as :: proc(fi: ^Info, v: f64, bit_size: int, verb: rune, float_fmt: byte) {
  751. prec := fi.prec if fi.prec_set else 3
  752. buf: [386]byte
  753. // Can return "NaN", "+Inf", "-Inf", "+<value>", "-<value>".
  754. str := strconv.append_float(buf[:], v, float_fmt, prec, bit_size)
  755. if !fi.plus {
  756. // Strip sign from "+<value>" but not "+Inf".
  757. if str[0] == '+' && str[1] != 'I' {
  758. str = str[1:]
  759. }
  760. }
  761. _pad(fi, str)
  762. }
  763. fmt_float :: proc(fi: ^Info, v: f64, bit_size: int, verb: rune) {
  764. switch verb {
  765. case 'f', 'F', 'g', 'G', 'v':
  766. _fmt_float_as(fi, v, bit_size, verb, 'f')
  767. case 'e', 'E':
  768. // BUG(): "%.3e" returns "3.000e+00"
  769. _fmt_float_as(fi, v, bit_size, verb, 'e')
  770. case 'h', 'H':
  771. prev_fi := fi^
  772. defer fi^ = prev_fi
  773. fi.hash = false
  774. fi.width = bit_size
  775. fi.zero = true
  776. fi.plus = false
  777. u: u64
  778. switch bit_size {
  779. case 16: u = u64(transmute(u16)f16(v))
  780. case 32: u = u64(transmute(u32)f32(v))
  781. case 64: u = transmute(u64)v
  782. case: panic("Unhandled float size")
  783. }
  784. io.write_string(fi.writer, "0h", &fi.n)
  785. _fmt_int(fi, u, 16, false, bit_size, __DIGITS_LOWER if verb == 'h' else __DIGITS_UPPER)
  786. case:
  787. fmt_bad_verb(fi, verb)
  788. }
  789. }
  790. fmt_string :: proc(fi: ^Info, s: string, verb: rune) {
  791. s, verb := s, verb
  792. if ol, ok := fi.optional_len.?; ok {
  793. s = s[:clamp(ol, 0, len(s))]
  794. }
  795. if !fi.in_bad && fi.record_level > 0 && verb == 'v' {
  796. verb = 'q'
  797. }
  798. switch verb {
  799. case 's', 'v':
  800. if fi.width_set {
  801. if fi.width > len(s) {
  802. if fi.minus {
  803. io.write_string(fi.writer, s, &fi.n)
  804. }
  805. for _ in 0..<fi.width - len(s) {
  806. io.write_byte(fi.writer, ' ', &fi.n)
  807. }
  808. if !fi.minus {
  809. io.write_string(fi.writer, s, &fi.n)
  810. }
  811. }
  812. else {
  813. io.write_string(fi.writer, s, &fi.n)
  814. }
  815. }
  816. else
  817. {
  818. io.write_string(fi.writer, s, &fi.n)
  819. }
  820. case 'q': // quoted string
  821. io.write_quoted_string(fi.writer, s, '"', &fi.n)
  822. case 'x', 'X':
  823. space := fi.space
  824. fi.space = false
  825. defer fi.space = space
  826. for i in 0..<len(s) {
  827. if i > 0 && space {
  828. io.write_byte(fi.writer, ' ', &fi.n)
  829. }
  830. char_set := __DIGITS_UPPER
  831. if verb == 'x' {
  832. char_set = __DIGITS_LOWER
  833. }
  834. _fmt_int(fi, u64(s[i]), 16, false, 8, char_set)
  835. }
  836. case:
  837. fmt_bad_verb(fi, verb)
  838. }
  839. }
  840. fmt_cstring :: proc(fi: ^Info, s: cstring, verb: rune) {
  841. fmt_string(fi, string(s), verb)
  842. }
  843. fmt_pointer :: proc(fi: ^Info, p: rawptr, verb: rune) {
  844. u := u64(uintptr(p))
  845. switch verb {
  846. case 'p', 'v':
  847. if !fi.hash && verb == 'v' {
  848. io.write_string(fi.writer, "0x", &fi.n)
  849. }
  850. _fmt_int(fi, u, 16, false, 8*size_of(rawptr), __DIGITS_UPPER)
  851. case 'b': _fmt_int(fi, u, 2, false, 8*size_of(rawptr), __DIGITS_UPPER)
  852. case 'o': _fmt_int(fi, u, 8, false, 8*size_of(rawptr), __DIGITS_UPPER)
  853. case 'i', 'd': _fmt_int(fi, u, 10, false, 8*size_of(rawptr), __DIGITS_UPPER)
  854. case 'z': _fmt_int(fi, u, 12, false, 8*size_of(rawptr), __DIGITS_UPPER)
  855. case 'x': _fmt_int(fi, u, 16, false, 8*size_of(rawptr), __DIGITS_UPPER)
  856. case 'X': _fmt_int(fi, u, 16, false, 8*size_of(rawptr), __DIGITS_UPPER)
  857. case:
  858. fmt_bad_verb(fi, verb)
  859. }
  860. }
  861. fmt_soa_pointer :: proc(fi: ^Info, p: runtime.Raw_Soa_Pointer, verb: rune) {
  862. io.write_string(fi.writer, "#soa{data=0x", &fi.n)
  863. _fmt_int(fi, u64(uintptr(p.data)), 16, false, 8*size_of(rawptr), __DIGITS_UPPER)
  864. io.write_string(fi.writer, ", index=", &fi.n)
  865. _fmt_int(fi, u64(p.index), 10, false, 8*size_of(rawptr), __DIGITS_UPPER)
  866. io.write_string(fi.writer, "}", &fi.n)
  867. }
  868. enum_value_to_string :: proc(val: any) -> (string, bool) {
  869. v := val
  870. v.id = runtime.typeid_base(v.id)
  871. type_info := type_info_of(v.id)
  872. #partial switch e in type_info.variant {
  873. case: return "", false
  874. case runtime.Type_Info_Enum:
  875. Enum_Value :: runtime.Type_Info_Enum_Value
  876. ev_, ok := reflect.as_i64(val)
  877. ev := Enum_Value(ev_)
  878. if ok {
  879. if len(e.values) == 0 {
  880. return "", true
  881. } else {
  882. for val, idx in e.values {
  883. if val == ev {
  884. return e.names[idx], true
  885. }
  886. }
  887. }
  888. return "", false
  889. }
  890. }
  891. return "", false
  892. }
  893. string_to_enum_value :: proc($T: typeid, s: string) -> (T, bool) {
  894. ti := runtime.type_info_base(type_info_of(T))
  895. if e, ok := ti.variant.(runtime.Type_Info_Enum); ok {
  896. for str, idx in e.names {
  897. if s == str {
  898. // NOTE(bill): Unsafe cast
  899. ptr := cast(^T)&e.values[idx]
  900. return ptr^, true
  901. }
  902. }
  903. }
  904. return T{}, false
  905. }
  906. fmt_enum :: proc(fi: ^Info, v: any, verb: rune) {
  907. if v.id == nil || v.data == nil {
  908. io.write_string(fi.writer, "<nil>", &fi.n)
  909. return
  910. }
  911. type_info := type_info_of(v.id)
  912. #partial switch e in type_info.variant {
  913. case: fmt_bad_verb(fi, verb)
  914. case runtime.Type_Info_Enum:
  915. switch verb {
  916. case: fmt_bad_verb(fi, verb)
  917. case 'i', 'd', 'f':
  918. fmt_arg(fi, any{v.data, runtime.type_info_base(e.base).id}, verb)
  919. case 's', 'v', 'q':
  920. if str, ok := enum_value_to_string(v); ok {
  921. fmt_string(fi, str, verb)
  922. } else {
  923. io.write_string(fi.writer, "%!(BAD ENUM VALUE=", &fi.n)
  924. fmt_arg(fi, any{v.data, runtime.type_info_base(e.base).id}, 'i')
  925. io.write_string(fi.writer, ")", &fi.n)
  926. }
  927. }
  928. }
  929. }
  930. stored_enum_value_to_string :: proc(enum_type: ^runtime.Type_Info, ev: runtime.Type_Info_Enum_Value, offset: int = 0) -> (string, bool) {
  931. et := runtime.type_info_base(enum_type)
  932. ev := ev
  933. ev += runtime.Type_Info_Enum_Value(offset)
  934. #partial switch e in et.variant {
  935. case: return "", false
  936. case runtime.Type_Info_Enum:
  937. if reflect.is_string(e.base) {
  938. for val, idx in e.values {
  939. if val == ev {
  940. return e.names[idx], true
  941. }
  942. }
  943. } else if len(e.values) == 0 {
  944. return "", true
  945. } else {
  946. for val, idx in e.values {
  947. if val == ev {
  948. return e.names[idx], true
  949. }
  950. }
  951. }
  952. return "", false
  953. }
  954. return "", false
  955. }
  956. fmt_bit_set :: proc(fi: ^Info, v: any, name: string = "") {
  957. is_bit_set_different_endian_to_platform :: proc(ti: ^runtime.Type_Info) -> bool {
  958. if ti == nil {
  959. return false
  960. }
  961. t := runtime.type_info_base(ti)
  962. #partial switch info in t.variant {
  963. case runtime.Type_Info_Integer:
  964. switch info.endianness {
  965. case .Platform: return false
  966. case .Little: return ODIN_ENDIAN != .Little
  967. case .Big: return ODIN_ENDIAN != .Big
  968. }
  969. }
  970. return false
  971. }
  972. byte_swap :: bits.byte_swap
  973. type_info := type_info_of(v.id)
  974. #partial switch info in type_info.variant {
  975. case runtime.Type_Info_Named:
  976. val := v
  977. val.id = info.base.id
  978. fmt_bit_set(fi, val, info.name)
  979. case runtime.Type_Info_Bit_Set:
  980. bits: u128
  981. bit_size := u128(8*type_info.size)
  982. do_byte_swap := is_bit_set_different_endian_to_platform(info.underlying)
  983. switch bit_size {
  984. case 0: bits = 0
  985. case 8:
  986. x := (^u8)(v.data)^
  987. bits = u128(x)
  988. case 16:
  989. x := (^u16)(v.data)^
  990. if do_byte_swap { x = byte_swap(x) }
  991. bits = u128(x)
  992. case 32:
  993. x := (^u32)(v.data)^
  994. if do_byte_swap { x = byte_swap(x) }
  995. bits = u128(x)
  996. case 64:
  997. x := (^u64)(v.data)^
  998. if do_byte_swap { x = byte_swap(x) }
  999. bits = u128(x)
  1000. case 128:
  1001. x := (^u128)(v.data)^
  1002. if do_byte_swap { x = byte_swap(x) }
  1003. bits = x
  1004. case: panic("unknown bit_size size")
  1005. }
  1006. et := runtime.type_info_base(info.elem)
  1007. if name != "" {
  1008. io.write_string(fi.writer, name, &fi.n)
  1009. } else {
  1010. reflect.write_type(fi.writer, type_info, &fi.n)
  1011. }
  1012. io.write_byte(fi.writer, '{', &fi.n)
  1013. defer io.write_byte(fi.writer, '}', &fi.n)
  1014. e, is_enum := et.variant.(runtime.Type_Info_Enum)
  1015. commas := 0
  1016. loop: for i in 0 ..< bit_size {
  1017. if bits & (1<<i) == 0 {
  1018. continue loop
  1019. }
  1020. if commas > 0 {
  1021. io.write_string(fi.writer, ", ", &fi.n)
  1022. }
  1023. if is_enum {
  1024. for ev, evi in e.values {
  1025. v := u64(ev)
  1026. if v == u64(i) {
  1027. io.write_string(fi.writer, e.names[evi], &fi.n)
  1028. commas += 1
  1029. continue loop
  1030. }
  1031. }
  1032. }
  1033. v := i64(i) + info.lower
  1034. io.write_i64(fi.writer, v, 10, &fi.n)
  1035. commas += 1
  1036. }
  1037. }
  1038. }
  1039. fmt_write_indent :: proc(fi: ^Info) {
  1040. for in 0..<fi.indent {
  1041. io.write_byte(fi.writer, '\t', &fi.n)
  1042. }
  1043. }
  1044. fmt_write_array :: proc(fi: ^Info, array_data: rawptr, count: int, elem_size: int, elem_id: typeid, verb: rune) {
  1045. io.write_byte(fi.writer, '[', &fi.n)
  1046. defer io.write_byte(fi.writer, ']', &fi.n)
  1047. if count <= 0 {
  1048. return
  1049. }
  1050. fi.record_level += 1
  1051. defer fi.record_level -= 1
  1052. if fi.hash {
  1053. io.write_byte(fi.writer, '\n', &fi.n)
  1054. defer fmt_write_indent(fi)
  1055. indent := fi.indent
  1056. fi.indent += 1
  1057. defer fi.indent = indent
  1058. for i in 0..<count {
  1059. fmt_write_indent(fi)
  1060. data := uintptr(array_data) + uintptr(i*elem_size)
  1061. fmt_arg(fi, any{rawptr(data), elem_id}, verb)
  1062. io.write_string(fi.writer, ",\n", &fi.n)
  1063. }
  1064. } else {
  1065. for i in 0..<count {
  1066. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1067. data := uintptr(array_data) + uintptr(i*elem_size)
  1068. fmt_arg(fi, any{rawptr(data), elem_id}, verb)
  1069. }
  1070. }
  1071. }
  1072. @(private)
  1073. handle_tag :: proc(data: rawptr, info: reflect.Type_Info_Struct, idx: int, verb: ^rune, optional_len: ^int, use_nul_termination: ^bool) -> (do_continue: bool) {
  1074. handle_optional_len :: proc(data: rawptr, info: reflect.Type_Info_Struct, field_name: string, optional_len: ^int) {
  1075. if optional_len == nil {
  1076. return
  1077. }
  1078. for f, i in info.names {
  1079. if f != field_name {
  1080. continue
  1081. }
  1082. ptr := rawptr(uintptr(data) + info.offsets[i])
  1083. field := any{ptr, info.types[i].id}
  1084. if new_len, iok := reflect.as_int(field); iok {
  1085. optional_len^ = max(new_len, 0)
  1086. }
  1087. break
  1088. }
  1089. }
  1090. tag := info.tags[idx]
  1091. if vt, ok := reflect.struct_tag_lookup(reflect.Struct_Tag(tag), "fmt"); ok {
  1092. value := strings.trim_space(string(vt))
  1093. switch value {
  1094. case "": return false
  1095. case "-": return true
  1096. }
  1097. r, w := utf8.decode_rune_in_string(value)
  1098. value = value[w:]
  1099. if value == "" || value[0] == ',' {
  1100. verb^ = r
  1101. if len(value) > 0 && value[0] == ',' {
  1102. field_name := value[1:]
  1103. if field_name == "0" {
  1104. if use_nul_termination != nil {
  1105. use_nul_termination^ = true
  1106. }
  1107. } else {
  1108. switch r {
  1109. case 's', 'q':
  1110. handle_optional_len(data, info, field_name, optional_len)
  1111. case 'v':
  1112. #partial switch reflect.type_kind(info.types[idx].id) {
  1113. case .String, .Multi_Pointer, .Array, .Slice, .Dynamic_Array:
  1114. handle_optional_len(data, info, field_name, optional_len)
  1115. }
  1116. }
  1117. }
  1118. }
  1119. }
  1120. }
  1121. return false
  1122. }
  1123. fmt_struct :: proc(fi: ^Info, v: any, the_verb: rune, info: runtime.Type_Info_Struct, type_name: string) {
  1124. if the_verb != 'v' {
  1125. fmt_bad_verb(fi, the_verb)
  1126. return
  1127. }
  1128. if info.is_raw_union {
  1129. if type_name == "" {
  1130. io.write_string(fi.writer, "(raw union)", &fi.n)
  1131. } else {
  1132. io.write_string(fi.writer, type_name, &fi.n)
  1133. io.write_string(fi.writer, "{}", &fi.n)
  1134. }
  1135. return
  1136. }
  1137. is_soa := info.soa_kind != .None
  1138. io.write_string(fi.writer, type_name, &fi.n)
  1139. io.write_byte(fi.writer, '[' if is_soa else '{', &fi.n)
  1140. fi.record_level += 1
  1141. defer fi.record_level -= 1
  1142. hash := fi.hash; defer fi.hash = hash
  1143. indent := fi.indent; defer fi.indent -= 1
  1144. do_trailing_comma := hash
  1145. // fi.hash = false;
  1146. fi.indent += 1
  1147. if hash {
  1148. io.write_byte(fi.writer, '\n', &fi.n)
  1149. }
  1150. defer {
  1151. if hash {
  1152. for in 0..<indent { io.write_byte(fi.writer, '\t', &fi.n) }
  1153. }
  1154. io.write_byte(fi.writer, ']' if is_soa else '}', &fi.n)
  1155. }
  1156. if is_soa {
  1157. fi.indent += 1
  1158. defer fi.indent -= 1
  1159. base_type_name: string
  1160. if v, ok := info.soa_base_type.variant.(runtime.Type_Info_Named); ok {
  1161. base_type_name = v.name
  1162. }
  1163. actual_field_count := len(info.names)
  1164. n := uintptr(info.soa_len)
  1165. if info.soa_kind == .Slice {
  1166. actual_field_count = len(info.names)-1 // len
  1167. n = uintptr((^int)(uintptr(v.data) + info.offsets[actual_field_count])^)
  1168. } else if info.soa_kind == .Dynamic {
  1169. actual_field_count = len(info.names)-3 // len, cap, allocator
  1170. n = uintptr((^int)(uintptr(v.data) + info.offsets[actual_field_count])^)
  1171. }
  1172. for index in 0..<n {
  1173. if !hash && index > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1174. field_count := -1
  1175. if !hash && field_count > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1176. io.write_string(fi.writer, base_type_name, &fi.n)
  1177. io.write_byte(fi.writer, '{', &fi.n)
  1178. defer io.write_byte(fi.writer, '}', &fi.n)
  1179. fi.record_level += 1
  1180. defer fi.record_level -= 1
  1181. for i in 0..<actual_field_count {
  1182. verb := 'v'
  1183. name := info.names[i]
  1184. field_count += 1
  1185. if !hash && field_count > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1186. if hash {
  1187. fmt_write_indent(fi)
  1188. }
  1189. io.write_string(fi.writer, name, &fi.n)
  1190. io.write_string(fi.writer, " = ", &fi.n)
  1191. if info.soa_kind == .Fixed {
  1192. t := info.types[i].variant.(runtime.Type_Info_Array).elem
  1193. t_size := uintptr(t.size)
  1194. if reflect.is_any(t) {
  1195. io.write_string(fi.writer, "any{}", &fi.n)
  1196. } else {
  1197. data := rawptr(uintptr(v.data) + info.offsets[i] + index*t_size)
  1198. fmt_arg(fi, any{data, t.id}, verb)
  1199. }
  1200. } else {
  1201. t := info.types[i].variant.(runtime.Type_Info_Pointer).elem
  1202. t_size := uintptr(t.size)
  1203. if reflect.is_any(t) {
  1204. io.write_string(fi.writer, "any{}", &fi.n)
  1205. } else {
  1206. field_ptr := (^^byte)(uintptr(v.data) + info.offsets[i])^
  1207. data := rawptr(uintptr(field_ptr) + index*t_size)
  1208. fmt_arg(fi, any{data, t.id}, verb)
  1209. }
  1210. }
  1211. if hash { io.write_string(fi.writer, ",\n", &fi.n) }
  1212. }
  1213. }
  1214. } else {
  1215. field_count := -1
  1216. for name, i in info.names {
  1217. optional_len: int = -1
  1218. use_nul_termination: bool = false
  1219. verb := 'v'
  1220. if handle_tag(v.data, info, i, &verb, &optional_len, &use_nul_termination) {
  1221. continue
  1222. }
  1223. field_count += 1
  1224. if optional_len >= 0 {
  1225. fi.optional_len = optional_len
  1226. }
  1227. defer if optional_len >= 0 {
  1228. fi.optional_len = nil
  1229. }
  1230. fi.use_nul_termination = use_nul_termination
  1231. defer fi.use_nul_termination = false
  1232. if !do_trailing_comma && field_count > 0 { io.write_string(fi.writer, ", ") }
  1233. if hash {
  1234. fmt_write_indent(fi)
  1235. }
  1236. io.write_string(fi.writer, name, &fi.n)
  1237. io.write_string(fi.writer, " = ", &fi.n)
  1238. if t := info.types[i]; reflect.is_any(t) {
  1239. io.write_string(fi.writer, "any{}", &fi.n)
  1240. } else {
  1241. data := rawptr(uintptr(v.data) + info.offsets[i])
  1242. fmt_arg(fi, any{data, t.id}, verb)
  1243. }
  1244. if do_trailing_comma { io.write_string(fi.writer, ",\n", &fi.n) }
  1245. }
  1246. }
  1247. }
  1248. @(private)
  1249. search_nul_termination :: proc(ptr: rawptr, elem_size: int, max_n: int) -> (n: int) {
  1250. for p := uintptr(ptr); max_n < 0 || n < max_n; p += uintptr(elem_size) {
  1251. if mem.check_zero_ptr(rawptr(p), elem_size) {
  1252. break
  1253. }
  1254. n += 1
  1255. }
  1256. return n
  1257. }
  1258. fmt_array_nul_terminated :: proc(fi: ^Info, data: rawptr, max_n: int, elem_size: int, elem: ^reflect.Type_Info, verb: rune) {
  1259. if data == nil {
  1260. io.write_string(fi.writer, "<nil>", &fi.n)
  1261. return
  1262. }
  1263. n := search_nul_termination(data, elem_size, max_n)
  1264. fmt_array(fi, data, n, elem_size, elem, verb)
  1265. }
  1266. fmt_array :: proc(fi: ^Info, data: rawptr, n: int, elem_size: int, elem: ^reflect.Type_Info, verb: rune) {
  1267. if data == nil && n > 0 {
  1268. io.write_string(fi.writer, "nil")
  1269. return
  1270. }
  1271. if verb == 's' || verb == 'q' {
  1272. print_utf16 :: proc(fi: ^Info, s: []$T) where size_of(T) == 2, intrinsics.type_is_integer(T) {
  1273. REPLACEMENT_CHAR :: '\ufffd'
  1274. _surr1 :: 0xd800
  1275. _surr2 :: 0xdc00
  1276. _surr3 :: 0xe000
  1277. _surr_self :: 0x10000
  1278. for i := 0; i < len(s); i += 1 {
  1279. r := rune(REPLACEMENT_CHAR)
  1280. switch c := s[i]; {
  1281. case c < _surr1, _surr3 <= c:
  1282. r = rune(c)
  1283. case _surr1 <= c && c < _surr2 && i+1 < len(s) &&
  1284. _surr2 <= s[i+1] && s[i+1] < _surr3:
  1285. r1, r2 := rune(c), rune(s[i+1])
  1286. if _surr1 <= r1 && r1 < _surr2 && _surr2 <= r2 && r2 < _surr3 {
  1287. r = (r1-_surr1)<<10 | (r2 - _surr2) + _surr_self
  1288. }
  1289. i += 1
  1290. }
  1291. io.write_rune(fi.writer, r, &fi.n)
  1292. }
  1293. }
  1294. print_utf32 :: proc(fi: ^Info, s: []$T) where size_of(T) == 4 {
  1295. for r in s {
  1296. io.write_rune(fi.writer, rune(r), &fi.n)
  1297. }
  1298. }
  1299. switch reflect.type_info_base(elem).id {
  1300. case byte: fmt_string(fi, string(([^]byte)(data)[:n]), verb); return
  1301. case u16: print_utf16(fi, ([^]u16)(data)[:n]); return
  1302. case u16le: print_utf16(fi, ([^]u16le)(data)[:n]); return
  1303. case u16be: print_utf16(fi, ([^]u16be)(data)[:n]); return
  1304. case u32: print_utf32(fi, ([^]u32)(data)[:n]); return
  1305. case u32le: print_utf32(fi, ([^]u32le)(data)[:n]); return
  1306. case u32be: print_utf32(fi, ([^]u32be)(data)[:n]); return
  1307. case rune: print_utf32(fi, ([^]rune)(data)[:n]); return
  1308. }
  1309. }
  1310. if verb == 'p' {
  1311. fmt_pointer(fi, data, 'p')
  1312. } else {
  1313. fmt_write_array(fi, data, n, elem_size, elem.id, verb)
  1314. }
  1315. }
  1316. fmt_named :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Named) {
  1317. write_padded_number :: proc(fi: ^Info, i: i64, width: int) {
  1318. n := width-1
  1319. for x := i; x >= 10; x /= 10 {
  1320. n -= 1
  1321. }
  1322. for in 0..<n {
  1323. io.write_byte(fi.writer, '0', &fi.n)
  1324. }
  1325. io.write_i64(fi.writer, i, 10, &fi.n)
  1326. }
  1327. // Built-in Custom Formatters for core library types
  1328. switch a in v {
  1329. case runtime.Source_Code_Location:
  1330. io.write_string(fi.writer, a.file_path, &fi.n)
  1331. io.write_byte(fi.writer, '(', &fi.n)
  1332. io.write_int(fi.writer, int(a.line), 10, &fi.n)
  1333. io.write_byte(fi.writer, ':', &fi.n)
  1334. io.write_int(fi.writer, int(a.column), 10, &fi.n)
  1335. io.write_byte(fi.writer, ')', &fi.n)
  1336. return
  1337. case time.Duration:
  1338. ffrac :: proc(buf: []byte, v: u64, prec: int) -> (nw: int, nv: u64) {
  1339. v := v
  1340. w := len(buf)
  1341. print := false
  1342. for in 0..<prec {
  1343. digit := v % 10
  1344. print = print || digit != 0
  1345. if print {
  1346. w -= 1
  1347. buf[w] = byte(digit) + '0'
  1348. }
  1349. v /= 10
  1350. }
  1351. if print {
  1352. w -= 1
  1353. buf[w] = '.'
  1354. }
  1355. return w, v
  1356. }
  1357. fint :: proc(buf: []byte, v: u64) -> int {
  1358. v := v
  1359. w := len(buf)
  1360. if v == 0 {
  1361. w -= 1
  1362. buf[w] = '0'
  1363. } else {
  1364. for v > 0 {
  1365. w -= 1
  1366. buf[w] = byte(v%10) + '0'
  1367. v /= 10
  1368. }
  1369. }
  1370. return w
  1371. }
  1372. buf: [32]byte
  1373. w := len(buf)
  1374. u := u64(a)
  1375. neg := a < 0
  1376. if neg {
  1377. u = -u
  1378. }
  1379. if u < u64(time.Second) {
  1380. prec: int
  1381. w -= 1
  1382. buf[w] = 's'
  1383. w -= 1
  1384. switch {
  1385. case u == 0:
  1386. io.write_string(fi.writer, "0s", &fi.n)
  1387. return
  1388. case u < u64(time.Microsecond):
  1389. prec = 0
  1390. buf[w] = 'n'
  1391. case u < u64(time.Millisecond):
  1392. prec = 3
  1393. // U+00B5 'µ' micro sign == 0xC2 0xB5
  1394. w -= 1 // Need room for two bytes
  1395. copy(buf[w:], "µ")
  1396. case:
  1397. prec = 6
  1398. buf[w] = 'm'
  1399. }
  1400. w, u = ffrac(buf[:w], u, prec)
  1401. w = fint(buf[:w], u)
  1402. } else {
  1403. w -= 1
  1404. buf[w] = 's'
  1405. w, u = ffrac(buf[:w], u, 9)
  1406. w = fint(buf[:w], u%60)
  1407. u /= 60
  1408. if u > 0 {
  1409. w -= 1
  1410. buf[w] = 'm'
  1411. w = fint(buf[:w], u%60)
  1412. u /= 60
  1413. if u > 0 {
  1414. w -= 1
  1415. buf[w] = 'h'
  1416. w = fint(buf[:w], u)
  1417. }
  1418. }
  1419. }
  1420. if neg {
  1421. w -= 1
  1422. buf[w] = '-'
  1423. }
  1424. io.write_string(fi.writer, string(buf[w:]), &fi.n)
  1425. return
  1426. case time.Time:
  1427. t := a
  1428. y, mon, d := time.date(t)
  1429. h, min, s := time.clock(t)
  1430. ns := (t._nsec - (t._nsec/1e9 + time.UNIX_TO_ABSOLUTE)*1e9) % 1e9
  1431. write_padded_number(fi, i64(y), 4)
  1432. io.write_byte(fi.writer, '-', &fi.n)
  1433. write_padded_number(fi, i64(mon), 2)
  1434. io.write_byte(fi.writer, '-', &fi.n)
  1435. write_padded_number(fi, i64(d), 2)
  1436. io.write_byte(fi.writer, ' ', &fi.n)
  1437. write_padded_number(fi, i64(h), 2)
  1438. io.write_byte(fi.writer, ':', &fi.n)
  1439. write_padded_number(fi, i64(min), 2)
  1440. io.write_byte(fi.writer, ':', &fi.n)
  1441. write_padded_number(fi, i64(s), 2)
  1442. io.write_byte(fi.writer, '.', &fi.n)
  1443. write_padded_number(fi, (ns), 9)
  1444. io.write_string(fi.writer, " +0000 UTC", &fi.n)
  1445. return
  1446. }
  1447. #partial switch b in info.base.variant {
  1448. case runtime.Type_Info_Struct:
  1449. fmt_struct(fi, v, verb, b, info.name)
  1450. case runtime.Type_Info_Bit_Set:
  1451. fmt_bit_set(fi, v)
  1452. case:
  1453. fmt_value(fi, any{v.data, info.base.id}, verb)
  1454. }
  1455. }
  1456. fmt_union :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Union, type_size: int) {
  1457. if type_size == 0 {
  1458. io.write_string(fi.writer, "nil", &fi.n)
  1459. return
  1460. }
  1461. if reflect.type_info_union_is_pure_maybe(info) {
  1462. if v.data == nil {
  1463. io.write_string(fi.writer, "nil", &fi.n)
  1464. } else {
  1465. id := info.variants[0].id
  1466. fmt_arg(fi, any{v.data, id}, verb)
  1467. }
  1468. return
  1469. }
  1470. tag: i64 = -1
  1471. tag_ptr := uintptr(v.data) + info.tag_offset
  1472. tag_any := any{rawptr(tag_ptr), info.tag_type.id}
  1473. switch i in tag_any {
  1474. case u8: tag = i64(i)
  1475. case i8: tag = i64(i)
  1476. case u16: tag = i64(i)
  1477. case i16: tag = i64(i)
  1478. case u32: tag = i64(i)
  1479. case i32: tag = i64(i)
  1480. case u64: tag = i64(i)
  1481. case i64: tag = i
  1482. case: panic("Invalid union tag type")
  1483. }
  1484. assert(tag >= 0)
  1485. if v.data == nil {
  1486. io.write_string(fi.writer, "nil", &fi.n)
  1487. } else if info.no_nil {
  1488. id := info.variants[tag].id
  1489. fmt_arg(fi, any{v.data, id}, verb)
  1490. } else if tag == 0 {
  1491. io.write_string(fi.writer, "nil", &fi.n)
  1492. } else {
  1493. id := info.variants[tag-1].id
  1494. fmt_arg(fi, any{v.data, id}, verb)
  1495. }
  1496. }
  1497. fmt_matrix :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Matrix) {
  1498. io.write_string(fi.writer, "matrix[", &fi.n)
  1499. defer io.write_byte(fi.writer, ']', &fi.n)
  1500. fi.indent += 1
  1501. if fi.hash {
  1502. // Printed as it is written
  1503. io.write_byte(fi.writer, '\n', &fi.n)
  1504. for row in 0..<info.row_count {
  1505. fmt_write_indent(fi)
  1506. for col in 0..<info.column_count {
  1507. if col > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1508. offset := (row + col*info.elem_stride)*info.elem_size
  1509. data := uintptr(v.data) + uintptr(offset)
  1510. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1511. }
  1512. io.write_string(fi.writer, ",\n", &fi.n)
  1513. }
  1514. } else {
  1515. // Printed in Row-Major layout to match text layout
  1516. for row in 0..<info.row_count {
  1517. if row > 0 { io.write_string(fi.writer, "; ", &fi.n) }
  1518. for col in 0..<info.column_count {
  1519. if col > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1520. offset := (row + col*info.elem_stride)*info.elem_size
  1521. data := uintptr(v.data) + uintptr(offset)
  1522. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1523. }
  1524. }
  1525. }
  1526. fi.indent -= 1
  1527. if fi.hash {
  1528. fmt_write_indent(fi)
  1529. }
  1530. }
  1531. fmt_value :: proc(fi: ^Info, v: any, verb: rune) {
  1532. if v.data == nil || v.id == nil {
  1533. io.write_string(fi.writer, "<nil>", &fi.n)
  1534. return
  1535. }
  1536. if _user_formatters != nil && !fi.ignore_user_formatters {
  1537. formatter := _user_formatters[v.id]
  1538. if formatter != nil {
  1539. fi.ignore_user_formatters = false
  1540. if ok := formatter(fi, v, verb); !ok {
  1541. fi.ignore_user_formatters = true
  1542. fmt_bad_verb(fi, verb)
  1543. }
  1544. return
  1545. }
  1546. }
  1547. fi.ignore_user_formatters = false
  1548. type_info := type_info_of(v.id)
  1549. switch info in type_info.variant {
  1550. case runtime.Type_Info_Any: // Ignore
  1551. case runtime.Type_Info_Tuple: // Ignore
  1552. case runtime.Type_Info_Named:
  1553. fmt_named(fi, v, verb, info)
  1554. case runtime.Type_Info_Boolean: fmt_arg(fi, v, verb)
  1555. case runtime.Type_Info_Integer: fmt_arg(fi, v, verb)
  1556. case runtime.Type_Info_Rune: fmt_arg(fi, v, verb)
  1557. case runtime.Type_Info_Float: fmt_arg(fi, v, verb)
  1558. case runtime.Type_Info_Complex: fmt_arg(fi, v, verb)
  1559. case runtime.Type_Info_Quaternion: fmt_arg(fi, v, verb)
  1560. case runtime.Type_Info_String: fmt_arg(fi, v, verb)
  1561. case runtime.Type_Info_Pointer:
  1562. if v.id == typeid_of(^runtime.Type_Info) {
  1563. reflect.write_type(fi.writer, (^^runtime.Type_Info)(v.data)^, &fi.n)
  1564. } else {
  1565. ptr := (^rawptr)(v.data)^
  1566. if verb != 'p' && info.elem != nil {
  1567. a := any{ptr, info.elem.id}
  1568. elem := runtime.type_info_base(info.elem)
  1569. if elem != nil {
  1570. #partial switch e in elem.variant {
  1571. case runtime.Type_Info_Array,
  1572. runtime.Type_Info_Slice,
  1573. runtime.Type_Info_Dynamic_Array,
  1574. runtime.Type_Info_Map:
  1575. if ptr == nil {
  1576. io.write_string(fi.writer, "<nil>", &fi.n)
  1577. return
  1578. }
  1579. if fi.indirection_level < 1 {
  1580. fi.indirection_level += 1
  1581. defer fi.indirection_level -= 1
  1582. io.write_byte(fi.writer, '&')
  1583. fmt_value(fi, a, verb)
  1584. return
  1585. }
  1586. case runtime.Type_Info_Struct,
  1587. runtime.Type_Info_Union:
  1588. if ptr == nil {
  1589. io.write_string(fi.writer, "<nil>", &fi.n)
  1590. return
  1591. }
  1592. if fi.indirection_level < 1 {
  1593. fi.indirection_level += 1
  1594. defer fi.indirection_level -= 1
  1595. io.write_byte(fi.writer, '&', &fi.n)
  1596. fmt_value(fi, a, verb)
  1597. return
  1598. }
  1599. }
  1600. }
  1601. }
  1602. fmt_pointer(fi, ptr, verb)
  1603. }
  1604. case runtime.Type_Info_Soa_Pointer:
  1605. ptr := (^runtime.Raw_Soa_Pointer)(v.data)^
  1606. fmt_soa_pointer(fi, ptr, verb)
  1607. case runtime.Type_Info_Multi_Pointer:
  1608. ptr := (^rawptr)(v.data)^
  1609. if ptr == nil {
  1610. io.write_string(fi.writer, "<nil>", &fi.n)
  1611. return
  1612. }
  1613. if verb != 'p' && info.elem != nil {
  1614. a := any{ptr, info.elem.id}
  1615. elem := runtime.type_info_base(info.elem)
  1616. if elem != nil {
  1617. if n, ok := fi.optional_len.?; ok {
  1618. fmt_array(fi, ptr, n, elem.size, elem, verb)
  1619. return
  1620. } else if fi.use_nul_termination {
  1621. fmt_array_nul_terminated(fi, ptr, -1, elem.size, elem, verb)
  1622. return
  1623. }
  1624. #partial switch e in elem.variant {
  1625. case runtime.Type_Info_Integer:
  1626. switch verb {
  1627. case 's', 'q':
  1628. switch elem.id {
  1629. case u8:
  1630. fmt_cstring(fi, cstring(ptr), verb)
  1631. return
  1632. case u16, u32, rune:
  1633. n := search_nul_termination(ptr, elem.size, -1)
  1634. fmt_array(fi, ptr, n, elem.size, elem, verb)
  1635. return
  1636. }
  1637. }
  1638. case runtime.Type_Info_Array,
  1639. runtime.Type_Info_Slice,
  1640. runtime.Type_Info_Dynamic_Array,
  1641. runtime.Type_Info_Map:
  1642. if fi.indirection_level < 1 {
  1643. fi.indirection_level += 1
  1644. defer fi.indirection_level -= 1
  1645. io.write_byte(fi.writer, '&', &fi.n)
  1646. fmt_value(fi, a, verb)
  1647. return
  1648. }
  1649. case runtime.Type_Info_Struct,
  1650. runtime.Type_Info_Union:
  1651. if fi.indirection_level < 1 {
  1652. fi.indirection_level += 1
  1653. defer fi.indirection_level -= 1
  1654. io.write_byte(fi.writer, '&', &fi.n)
  1655. fmt_value(fi, a, verb)
  1656. return
  1657. }
  1658. }
  1659. }
  1660. }
  1661. fmt_pointer(fi, ptr, verb)
  1662. case runtime.Type_Info_Enumerated_Array:
  1663. fi.record_level += 1
  1664. defer fi.record_level -= 1
  1665. if fi.hash {
  1666. io.write_string(fi.writer, "[\n", &fi.n)
  1667. defer {
  1668. io.write_byte(fi.writer, '\n', &fi.n)
  1669. fmt_write_indent(fi)
  1670. io.write_byte(fi.writer, ']', &fi.n)
  1671. }
  1672. indent := fi.indent
  1673. fi.indent += 1
  1674. defer fi.indent = indent
  1675. for i in 0..<info.count {
  1676. fmt_write_indent(fi)
  1677. idx, ok := stored_enum_value_to_string(info.index, info.min_value, i)
  1678. if ok {
  1679. io.write_byte(fi.writer, '.', &fi.n)
  1680. io.write_string(fi.writer, idx, &fi.n)
  1681. } else {
  1682. io.write_i64(fi.writer, i64(info.min_value)+i64(i), 10, &fi.n)
  1683. }
  1684. io.write_string(fi.writer, " = ", &fi.n)
  1685. data := uintptr(v.data) + uintptr(i*info.elem_size)
  1686. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1687. io.write_string(fi.writer, ",\n", &fi.n)
  1688. }
  1689. } else {
  1690. io.write_byte(fi.writer, '[', &fi.n)
  1691. defer io.write_byte(fi.writer, ']', &fi.n)
  1692. for i in 0..<info.count {
  1693. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1694. idx, ok := stored_enum_value_to_string(info.index, info.min_value, i)
  1695. if ok {
  1696. io.write_byte(fi.writer, '.', &fi.n)
  1697. io.write_string(fi.writer, idx, &fi.n)
  1698. } else {
  1699. io.write_i64(fi.writer, i64(info.min_value)+i64(i), 10, &fi.n)
  1700. }
  1701. io.write_string(fi.writer, " = ", &fi.n)
  1702. data := uintptr(v.data) + uintptr(i*info.elem_size)
  1703. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1704. }
  1705. }
  1706. case runtime.Type_Info_Array:
  1707. n := info.count
  1708. ptr := v.data
  1709. if ol, ok := fi.optional_len.?; ok {
  1710. n = min(n, ol)
  1711. } else if fi.use_nul_termination {
  1712. fmt_array_nul_terminated(fi, ptr, n, info.elem_size, info.elem, verb)
  1713. return
  1714. }
  1715. fmt_array(fi, ptr, n, info.elem_size, info.elem, verb)
  1716. case runtime.Type_Info_Slice:
  1717. slice := cast(^mem.Raw_Slice)v.data
  1718. n := slice.len
  1719. ptr := slice.data
  1720. if ol, ok := fi.optional_len.?; ok {
  1721. n = min(n, ol)
  1722. } else if fi.use_nul_termination {
  1723. fmt_array_nul_terminated(fi, ptr, n, info.elem_size, info.elem, verb)
  1724. return
  1725. }
  1726. fmt_array(fi, ptr, n, info.elem_size, info.elem, verb)
  1727. case runtime.Type_Info_Dynamic_Array:
  1728. array := cast(^mem.Raw_Dynamic_Array)v.data
  1729. n := array.len
  1730. ptr := array.data
  1731. if ol, ok := fi.optional_len.?; ok {
  1732. n = min(n, ol)
  1733. } else if fi.use_nul_termination {
  1734. fmt_array_nul_terminated(fi, ptr, n, info.elem_size, info.elem, verb)
  1735. return
  1736. }
  1737. fmt_array(fi, ptr, n, info.elem_size, info.elem, verb)
  1738. case runtime.Type_Info_Simd_Vector:
  1739. io.write_byte(fi.writer, '<', &fi.n)
  1740. defer io.write_byte(fi.writer, '>', &fi.n)
  1741. for i in 0..<info.count {
  1742. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1743. data := uintptr(v.data) + uintptr(i*info.elem_size)
  1744. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1745. }
  1746. case runtime.Type_Info_Map:
  1747. if verb != 'v' {
  1748. fmt_bad_verb(fi, verb)
  1749. return
  1750. }
  1751. io.write_string(fi.writer, "map[", &fi.n)
  1752. defer io.write_byte(fi.writer, ']', &fi.n)
  1753. fi.record_level += 1
  1754. defer fi.record_level -= 1
  1755. m := (^mem.Raw_Map)(v.data)
  1756. if m != nil {
  1757. if info.map_info == nil {
  1758. return
  1759. }
  1760. map_cap := uintptr(runtime.map_cap(m^))
  1761. ks, vs, hs, _, _ := runtime.map_kvh_data_dynamic(m^, info.map_info)
  1762. j := 0
  1763. for bucket_index in 0..<map_cap {
  1764. if !runtime.map_hash_is_valid(hs[bucket_index]) {
  1765. continue
  1766. }
  1767. if j > 0 {
  1768. io.write_string(fi.writer, ", ", &fi.n)
  1769. }
  1770. j += 1
  1771. key := runtime.map_cell_index_dynamic(ks, info.map_info.ks, bucket_index)
  1772. value := runtime.map_cell_index_dynamic(vs, info.map_info.vs, bucket_index)
  1773. fmt_arg(&Info{writer = fi.writer}, any{rawptr(key), info.key.id}, 'v')
  1774. io.write_string(fi.writer, "=", &fi.n)
  1775. fmt_arg(fi, any{rawptr(value), info.value.id}, 'v')
  1776. }
  1777. }
  1778. case runtime.Type_Info_Struct:
  1779. fmt_struct(fi, v, verb, info, "")
  1780. case runtime.Type_Info_Union:
  1781. fmt_union(fi, v, verb, info, type_info.size)
  1782. case runtime.Type_Info_Enum:
  1783. fmt_enum(fi, v, verb)
  1784. case runtime.Type_Info_Procedure:
  1785. ptr := (^rawptr)(v.data)^
  1786. if ptr == nil {
  1787. io.write_string(fi.writer, "nil", &fi.n)
  1788. } else {
  1789. reflect.write_typeid(fi.writer, v.id, &fi.n)
  1790. io.write_string(fi.writer, " @ ", &fi.n)
  1791. fmt_pointer(fi, ptr, 'p')
  1792. }
  1793. case runtime.Type_Info_Type_Id:
  1794. id := (^typeid)(v.data)^
  1795. reflect.write_typeid(fi.writer, id, &fi.n)
  1796. case runtime.Type_Info_Bit_Set:
  1797. fmt_bit_set(fi, v)
  1798. case runtime.Type_Info_Relative_Pointer:
  1799. ptr := reflect.relative_pointer_to_absolute_raw(v.data, info.base_integer.id)
  1800. absolute_ptr := any{ptr, info.pointer.id}
  1801. fmt_value(fi, absolute_ptr, verb)
  1802. case runtime.Type_Info_Relative_Slice:
  1803. ptr := reflect.relative_pointer_to_absolute_raw(v.data, info.base_integer.id)
  1804. if verb == 'p' {
  1805. fmt_pointer(fi, ptr, 'p')
  1806. } else if ptr == nil {
  1807. io.write_string(fi.writer, "[]", &fi.n)
  1808. } else {
  1809. len_ptr := uintptr(v.data) + uintptr(info.base_integer.size)
  1810. len_any := any{rawptr(len_ptr), info.base_integer.id}
  1811. len, _ := reflect.as_int(len_any)
  1812. slice_type := reflect.type_info_base(info.slice).variant.(runtime.Type_Info_Slice)
  1813. fi.record_level += 1
  1814. defer fi.record_level -= 1
  1815. io.write_byte(fi.writer, '[', &fi.n)
  1816. defer io.write_byte(fi.writer, ']', &fi.n)
  1817. for i in 0..<len {
  1818. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1819. data := uintptr(ptr) + uintptr(i*slice_type.elem_size)
  1820. fmt_arg(fi, any{rawptr(data), slice_type.elem.id}, verb)
  1821. }
  1822. }
  1823. case runtime.Type_Info_Matrix:
  1824. fmt_matrix(fi, v, verb, info)
  1825. }
  1826. }
  1827. fmt_complex :: proc(fi: ^Info, c: complex128, bits: int, verb: rune) {
  1828. switch verb {
  1829. case 'f', 'F', 'v', 'h', 'H':
  1830. r, i := real(c), imag(c)
  1831. fmt_float(fi, r, bits/2, verb)
  1832. if !fi.plus && i >= 0 {
  1833. io.write_rune(fi.writer, '+', &fi.n)
  1834. }
  1835. fmt_float(fi, i, bits/2, verb)
  1836. io.write_rune(fi.writer, 'i', &fi.n)
  1837. case:
  1838. fmt_bad_verb(fi, verb)
  1839. return
  1840. }
  1841. }
  1842. fmt_quaternion :: proc(fi: ^Info, q: quaternion256, bits: int, verb: rune) {
  1843. switch verb {
  1844. case 'f', 'F', 'v', 'h', 'H':
  1845. r, i, j, k := real(q), imag(q), jmag(q), kmag(q)
  1846. fmt_float(fi, r, bits/4, verb)
  1847. if !fi.plus && i >= 0 {
  1848. io.write_rune(fi.writer, '+', &fi.n)
  1849. }
  1850. fmt_float(fi, i, bits/4, verb)
  1851. io.write_rune(fi.writer, 'i', &fi.n)
  1852. if !fi.plus && j >= 0 {
  1853. io.write_rune(fi.writer, '+', &fi.n)
  1854. }
  1855. fmt_float(fi, j, bits/4, verb)
  1856. io.write_rune(fi.writer, 'j', &fi.n)
  1857. if !fi.plus && k >= 0 {
  1858. io.write_rune(fi.writer, '+', &fi.n)
  1859. }
  1860. fmt_float(fi, k, bits/4, verb)
  1861. io.write_rune(fi.writer, 'k', &fi.n)
  1862. case:
  1863. fmt_bad_verb(fi, verb)
  1864. return
  1865. }
  1866. }
  1867. fmt_arg :: proc(fi: ^Info, arg: any, verb: rune) {
  1868. if arg == nil {
  1869. io.write_string(fi.writer, "<nil>")
  1870. return
  1871. }
  1872. fi.arg = arg
  1873. if verb == 'T' {
  1874. ti := type_info_of(arg.id)
  1875. switch a in arg {
  1876. case ^runtime.Type_Info: ti = a
  1877. }
  1878. reflect.write_type(fi.writer, ti, &fi.n)
  1879. return
  1880. }
  1881. if _user_formatters != nil {
  1882. formatter := _user_formatters[arg.id]
  1883. if formatter != nil {
  1884. if ok := formatter(fi, arg, verb); !ok {
  1885. fmt_bad_verb(fi, verb)
  1886. }
  1887. return
  1888. }
  1889. }
  1890. custom_types: switch a in arg {
  1891. case runtime.Source_Code_Location:
  1892. if fi.hash && verb == 'v' {
  1893. io.write_string(fi.writer, a.file_path, &fi.n)
  1894. io.write_byte(fi.writer, '(', &fi.n)
  1895. io.write_i64(fi.writer, i64(a.line), 10, &fi.n)
  1896. io.write_byte(fi.writer, ':', &fi.n)
  1897. io.write_i64(fi.writer, i64(a.column), 10, &fi.n)
  1898. io.write_byte(fi.writer, ')', &fi.n)
  1899. return
  1900. }
  1901. }
  1902. base_arg := arg
  1903. base_arg.id = runtime.typeid_base(base_arg.id)
  1904. switch a in base_arg {
  1905. case bool: fmt_bool(fi, a, verb)
  1906. case b8: fmt_bool(fi, bool(a), verb)
  1907. case b16: fmt_bool(fi, bool(a), verb)
  1908. case b32: fmt_bool(fi, bool(a), verb)
  1909. case b64: fmt_bool(fi, bool(a), verb)
  1910. case any: fmt_arg(fi, a, verb)
  1911. case rune: fmt_rune(fi, a, verb)
  1912. case f16: fmt_float(fi, f64(a), 16, verb)
  1913. case f32: fmt_float(fi, f64(a), 32, verb)
  1914. case f64: fmt_float(fi, a, 64, verb)
  1915. case f16le: fmt_float(fi, f64(a), 16, verb)
  1916. case f32le: fmt_float(fi, f64(a), 32, verb)
  1917. case f64le: fmt_float(fi, f64(a), 64, verb)
  1918. case f16be: fmt_float(fi, f64(a), 16, verb)
  1919. case f32be: fmt_float(fi, f64(a), 32, verb)
  1920. case f64be: fmt_float(fi, f64(a), 64, verb)
  1921. case complex32: fmt_complex(fi, complex128(a), 32, verb)
  1922. case complex64: fmt_complex(fi, complex128(a), 64, verb)
  1923. case complex128: fmt_complex(fi, a, 128, verb)
  1924. case quaternion64: fmt_quaternion(fi, quaternion256(a), 64, verb)
  1925. case quaternion128: fmt_quaternion(fi, quaternion256(a), 128, verb)
  1926. case quaternion256: fmt_quaternion(fi, a, 256, verb)
  1927. case i8: fmt_int(fi, u64(a), true, 8, verb)
  1928. case u8: fmt_int(fi, u64(a), false, 8, verb)
  1929. case i16: fmt_int(fi, u64(a), true, 16, verb)
  1930. case u16: fmt_int(fi, u64(a), false, 16, verb)
  1931. case i32: fmt_int(fi, u64(a), true, 32, verb)
  1932. case u32: fmt_int(fi, u64(a), false, 32, verb)
  1933. case i64: fmt_int(fi, u64(a), true, 64, verb)
  1934. case u64: fmt_int(fi, a, false, 64, verb)
  1935. case int: fmt_int(fi, u64(a), true, 8*size_of(int), verb)
  1936. case uint: fmt_int(fi, u64(a), false, 8*size_of(uint), verb)
  1937. case uintptr: fmt_int(fi, u64(a), false, 8*size_of(uintptr), verb)
  1938. case string: fmt_string(fi, a, verb)
  1939. case cstring: fmt_cstring(fi, a, verb)
  1940. case typeid: reflect.write_typeid(fi.writer, a, &fi.n)
  1941. case i16le: fmt_int(fi, u64(a), true, 16, verb)
  1942. case u16le: fmt_int(fi, u64(a), false, 16, verb)
  1943. case i32le: fmt_int(fi, u64(a), true, 32, verb)
  1944. case u32le: fmt_int(fi, u64(a), false, 32, verb)
  1945. case i64le: fmt_int(fi, u64(a), true, 64, verb)
  1946. case u64le: fmt_int(fi, u64(a), false, 64, verb)
  1947. case i16be: fmt_int(fi, u64(a), true, 16, verb)
  1948. case u16be: fmt_int(fi, u64(a), false, 16, verb)
  1949. case i32be: fmt_int(fi, u64(a), true, 32, verb)
  1950. case u32be: fmt_int(fi, u64(a), false, 32, verb)
  1951. case i64be: fmt_int(fi, u64(a), true, 64, verb)
  1952. case u64be: fmt_int(fi, u64(a), false, 64, verb)
  1953. case i128: fmt_int_128(fi, u128(a), true, 128, verb)
  1954. case u128: fmt_int_128(fi, a, false, 128, verb)
  1955. case i128le: fmt_int_128(fi, u128(a), true, 128, verb)
  1956. case u128le: fmt_int_128(fi, u128(a), false, 128, verb)
  1957. case i128be: fmt_int_128(fi, u128(a), true, 128, verb)
  1958. case u128be: fmt_int_128(fi, u128(a), false, 128, verb)
  1959. case: fmt_value(fi, arg, verb)
  1960. }
  1961. }