fmt.odin 58 KB

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