fmt.odin 54 KB

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