fmt.odin 57 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296
  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. enum_value_to_string :: proc(val: any) -> (string, bool) {
  890. v := val
  891. v.id = runtime.typeid_base(v.id)
  892. type_info := type_info_of(v.id)
  893. #partial switch e in type_info.variant {
  894. case: return "", false
  895. case runtime.Type_Info_Enum:
  896. Enum_Value :: runtime.Type_Info_Enum_Value
  897. ev_, ok := reflect.as_i64(val)
  898. ev := Enum_Value(ev_)
  899. if ok {
  900. if len(e.values) == 0 {
  901. return "", true
  902. } else {
  903. for val, idx in e.values {
  904. if val == ev {
  905. return e.names[idx], true
  906. }
  907. }
  908. }
  909. return "", false
  910. }
  911. }
  912. return "", false
  913. }
  914. string_to_enum_value :: proc($T: typeid, s: string) -> (T, bool) {
  915. ti := runtime.type_info_base(type_info_of(T))
  916. if e, ok := ti.variant.(runtime.Type_Info_Enum); ok {
  917. for str, idx in e.names {
  918. if s == str {
  919. // NOTE(bill): Unsafe cast
  920. ptr := cast(^T)&e.values[idx]
  921. return ptr^, true
  922. }
  923. }
  924. }
  925. return T{}, false
  926. }
  927. fmt_enum :: proc(fi: ^Info, v: any, verb: rune) {
  928. if v.id == nil || v.data == nil {
  929. io.write_string(fi.writer, "<nil>", &fi.n)
  930. return
  931. }
  932. type_info := type_info_of(v.id)
  933. #partial switch e in type_info.variant {
  934. case: fmt_bad_verb(fi, verb)
  935. case runtime.Type_Info_Enum:
  936. switch verb {
  937. case: fmt_bad_verb(fi, verb)
  938. case 'i', 'd', 'f':
  939. fmt_arg(fi, any{v.data, runtime.type_info_base(e.base).id}, verb)
  940. case 's', 'v', 'q':
  941. if str, ok := enum_value_to_string(v); ok {
  942. fmt_string(fi, str, verb)
  943. } else {
  944. io.write_string(fi.writer, "%!(BAD ENUM VALUE=", &fi.n)
  945. fmt_arg(fi, any{v.data, runtime.type_info_base(e.base).id}, 'i')
  946. io.write_string(fi.writer, ")", &fi.n)
  947. }
  948. }
  949. }
  950. }
  951. stored_enum_value_to_string :: proc(enum_type: ^runtime.Type_Info, ev: runtime.Type_Info_Enum_Value, offset: int = 0) -> (string, bool) {
  952. et := runtime.type_info_base(enum_type)
  953. ev := ev
  954. ev += runtime.Type_Info_Enum_Value(offset)
  955. #partial switch e in et.variant {
  956. case: return "", false
  957. case runtime.Type_Info_Enum:
  958. if reflect.is_string(e.base) {
  959. for val, idx in e.values {
  960. if val == ev {
  961. return e.names[idx], true
  962. }
  963. }
  964. } else if len(e.values) == 0 {
  965. return "", true
  966. } else {
  967. for val, idx in e.values {
  968. if val == ev {
  969. return e.names[idx], true
  970. }
  971. }
  972. }
  973. return "", false
  974. }
  975. return "", false
  976. }
  977. fmt_bit_set :: proc(fi: ^Info, v: any, name: string = "") {
  978. is_bit_set_different_endian_to_platform :: proc(ti: ^runtime.Type_Info) -> bool {
  979. if ti == nil {
  980. return false
  981. }
  982. t := runtime.type_info_base(ti)
  983. #partial switch info in t.variant {
  984. case runtime.Type_Info_Integer:
  985. switch info.endianness {
  986. case .Platform: return false
  987. case .Little: return ODIN_ENDIAN != .Little
  988. case .Big: return ODIN_ENDIAN != .Big
  989. }
  990. }
  991. return false
  992. }
  993. byte_swap :: bits.byte_swap
  994. type_info := type_info_of(v.id)
  995. #partial switch info in type_info.variant {
  996. case runtime.Type_Info_Named:
  997. val := v
  998. val.id = info.base.id
  999. fmt_bit_set(fi, val, info.name)
  1000. case runtime.Type_Info_Bit_Set:
  1001. bits: u128
  1002. bit_size := u128(8*type_info.size)
  1003. do_byte_swap := is_bit_set_different_endian_to_platform(info.underlying)
  1004. switch bit_size {
  1005. case 0: bits = 0
  1006. case 8:
  1007. x := (^u8)(v.data)^
  1008. bits = u128(x)
  1009. case 16:
  1010. x := (^u16)(v.data)^
  1011. if do_byte_swap { x = byte_swap(x) }
  1012. bits = u128(x)
  1013. case 32:
  1014. x := (^u32)(v.data)^
  1015. if do_byte_swap { x = byte_swap(x) }
  1016. bits = u128(x)
  1017. case 64:
  1018. x := (^u64)(v.data)^
  1019. if do_byte_swap { x = byte_swap(x) }
  1020. bits = u128(x)
  1021. case 128:
  1022. x := (^u128)(v.data)^
  1023. if do_byte_swap { x = byte_swap(x) }
  1024. bits = x
  1025. case: panic("unknown bit_size size")
  1026. }
  1027. et := runtime.type_info_base(info.elem)
  1028. if name != "" {
  1029. io.write_string(fi.writer, name, &fi.n)
  1030. } else {
  1031. reflect.write_type(fi.writer, type_info, &fi.n)
  1032. }
  1033. io.write_byte(fi.writer, '{', &fi.n)
  1034. defer io.write_byte(fi.writer, '}', &fi.n)
  1035. e, is_enum := et.variant.(runtime.Type_Info_Enum)
  1036. commas := 0
  1037. loop: for i in 0 ..< bit_size {
  1038. if bits & (1<<i) == 0 {
  1039. continue loop
  1040. }
  1041. if commas > 0 {
  1042. io.write_string(fi.writer, ", ", &fi.n)
  1043. }
  1044. if is_enum {
  1045. for ev, evi in e.values {
  1046. v := u64(ev)
  1047. if v == u64(i) {
  1048. io.write_string(fi.writer, e.names[evi], &fi.n)
  1049. commas += 1
  1050. continue loop
  1051. }
  1052. }
  1053. }
  1054. v := i64(i) + info.lower
  1055. io.write_i64(fi.writer, v, 10, &fi.n)
  1056. commas += 1
  1057. }
  1058. }
  1059. }
  1060. fmt_write_indent :: proc(fi: ^Info) {
  1061. for in 0..<fi.indent {
  1062. io.write_byte(fi.writer, '\t', &fi.n)
  1063. }
  1064. }
  1065. fmt_write_array :: proc(fi: ^Info, array_data: rawptr, count: int, elem_size: int, elem_id: typeid, verb: rune) {
  1066. io.write_byte(fi.writer, '[', &fi.n)
  1067. defer io.write_byte(fi.writer, ']', &fi.n)
  1068. if count <= 0 {
  1069. return
  1070. }
  1071. fi.record_level += 1
  1072. defer fi.record_level -= 1
  1073. if fi.hash {
  1074. io.write_byte(fi.writer, '\n', &fi.n)
  1075. defer fmt_write_indent(fi)
  1076. indent := fi.indent
  1077. fi.indent += 1
  1078. defer fi.indent = indent
  1079. for i in 0..<count {
  1080. fmt_write_indent(fi)
  1081. data := uintptr(array_data) + uintptr(i*elem_size)
  1082. fmt_arg(fi, any{rawptr(data), elem_id}, verb)
  1083. io.write_string(fi.writer, ",\n", &fi.n)
  1084. }
  1085. } else {
  1086. for i in 0..<count {
  1087. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1088. data := uintptr(array_data) + uintptr(i*elem_size)
  1089. fmt_arg(fi, any{rawptr(data), elem_id}, verb)
  1090. }
  1091. }
  1092. }
  1093. @(private)
  1094. handle_tag :: proc(data: rawptr, info: reflect.Type_Info_Struct, idx: int, verb: ^rune, optional_len: ^int, use_nul_termination: ^bool) -> (do_continue: bool) {
  1095. handle_optional_len :: proc(data: rawptr, info: reflect.Type_Info_Struct, field_name: string, optional_len: ^int) {
  1096. if optional_len == nil {
  1097. return
  1098. }
  1099. for f, i in info.names {
  1100. if f != field_name {
  1101. continue
  1102. }
  1103. ptr := rawptr(uintptr(data) + info.offsets[i])
  1104. field := any{ptr, info.types[i].id}
  1105. if new_len, iok := reflect.as_int(field); iok {
  1106. optional_len^ = max(new_len, 0)
  1107. }
  1108. break
  1109. }
  1110. }
  1111. tag := info.tags[idx]
  1112. if vt, ok := reflect.struct_tag_lookup(reflect.Struct_Tag(tag), "fmt"); ok {
  1113. value := strings.trim_space(string(vt))
  1114. switch value {
  1115. case "": return false
  1116. case "-": return true
  1117. }
  1118. r, w := utf8.decode_rune_in_string(value)
  1119. value = value[w:]
  1120. if value == "" || value[0] == ',' {
  1121. verb^ = r
  1122. if len(value) > 0 && value[0] == ',' {
  1123. field_name := value[1:]
  1124. if field_name == "0" {
  1125. if use_nul_termination != nil {
  1126. use_nul_termination^ = true
  1127. }
  1128. } else {
  1129. switch r {
  1130. case 's', 'q':
  1131. handle_optional_len(data, info, field_name, optional_len)
  1132. case 'v':
  1133. #partial switch reflect.type_kind(info.types[idx].id) {
  1134. case .String, .Multi_Pointer, .Array, .Slice, .Dynamic_Array:
  1135. handle_optional_len(data, info, field_name, optional_len)
  1136. }
  1137. }
  1138. }
  1139. }
  1140. }
  1141. }
  1142. return false
  1143. }
  1144. fmt_struct :: proc(fi: ^Info, v: any, the_verb: rune, info: runtime.Type_Info_Struct, type_name: string) {
  1145. if the_verb != 'v' {
  1146. fmt_bad_verb(fi, the_verb)
  1147. return
  1148. }
  1149. if info.is_raw_union {
  1150. if type_name == "" {
  1151. io.write_string(fi.writer, "(raw union)", &fi.n)
  1152. } else {
  1153. io.write_string(fi.writer, type_name, &fi.n)
  1154. io.write_string(fi.writer, "{}", &fi.n)
  1155. }
  1156. return
  1157. }
  1158. is_soa := info.soa_kind != .None
  1159. io.write_string(fi.writer, type_name, &fi.n)
  1160. io.write_byte(fi.writer, '[' if is_soa else '{', &fi.n)
  1161. fi.record_level += 1
  1162. defer fi.record_level -= 1
  1163. hash := fi.hash; defer fi.hash = hash
  1164. indent := fi.indent; defer fi.indent -= 1
  1165. do_trailing_comma := hash
  1166. // fi.hash = false;
  1167. fi.indent += 1
  1168. if hash {
  1169. io.write_byte(fi.writer, '\n', &fi.n)
  1170. }
  1171. defer {
  1172. if hash {
  1173. for in 0..<indent { io.write_byte(fi.writer, '\t', &fi.n) }
  1174. }
  1175. io.write_byte(fi.writer, ']' if is_soa else '}', &fi.n)
  1176. }
  1177. if is_soa {
  1178. fi.indent += 1
  1179. defer fi.indent -= 1
  1180. base_type_name: string
  1181. if v, ok := info.soa_base_type.variant.(runtime.Type_Info_Named); ok {
  1182. base_type_name = v.name
  1183. }
  1184. actual_field_count := len(info.names)
  1185. n := uintptr(info.soa_len)
  1186. if info.soa_kind == .Slice {
  1187. actual_field_count = len(info.names)-1 // len
  1188. n = uintptr((^int)(uintptr(v.data) + info.offsets[actual_field_count])^)
  1189. } else if info.soa_kind == .Dynamic {
  1190. actual_field_count = len(info.names)-3 // len, cap, allocator
  1191. n = uintptr((^int)(uintptr(v.data) + info.offsets[actual_field_count])^)
  1192. }
  1193. for index in 0..<n {
  1194. if !hash && index > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1195. field_count := -1
  1196. if !hash && field_count > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1197. io.write_string(fi.writer, base_type_name, &fi.n)
  1198. io.write_byte(fi.writer, '{', &fi.n)
  1199. defer io.write_byte(fi.writer, '}', &fi.n)
  1200. fi.record_level += 1
  1201. defer fi.record_level -= 1
  1202. for i in 0..<actual_field_count {
  1203. verb := 'v'
  1204. name := info.names[i]
  1205. field_count += 1
  1206. if !hash && field_count > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1207. if hash {
  1208. fmt_write_indent(fi)
  1209. }
  1210. io.write_string(fi.writer, name, &fi.n)
  1211. io.write_string(fi.writer, " = ", &fi.n)
  1212. if info.soa_kind == .Fixed {
  1213. t := info.types[i].variant.(runtime.Type_Info_Array).elem
  1214. t_size := uintptr(t.size)
  1215. if reflect.is_any(t) {
  1216. io.write_string(fi.writer, "any{}", &fi.n)
  1217. } else {
  1218. data := rawptr(uintptr(v.data) + info.offsets[i] + index*t_size)
  1219. fmt_arg(fi, any{data, t.id}, verb)
  1220. }
  1221. } else {
  1222. t := info.types[i].variant.(runtime.Type_Info_Pointer).elem
  1223. t_size := uintptr(t.size)
  1224. if reflect.is_any(t) {
  1225. io.write_string(fi.writer, "any{}", &fi.n)
  1226. } else {
  1227. field_ptr := (^^byte)(uintptr(v.data) + info.offsets[i])^
  1228. data := rawptr(uintptr(field_ptr) + index*t_size)
  1229. fmt_arg(fi, any{data, t.id}, verb)
  1230. }
  1231. }
  1232. if hash { io.write_string(fi.writer, ",\n", &fi.n) }
  1233. }
  1234. }
  1235. } else {
  1236. field_count := -1
  1237. for name, i in info.names {
  1238. optional_len: int = -1
  1239. use_nul_termination: bool = false
  1240. verb := 'v'
  1241. if handle_tag(v.data, info, i, &verb, &optional_len, &use_nul_termination) {
  1242. continue
  1243. }
  1244. field_count += 1
  1245. if optional_len >= 0 {
  1246. fi.optional_len = optional_len
  1247. }
  1248. defer if optional_len >= 0 {
  1249. fi.optional_len = nil
  1250. }
  1251. fi.use_nul_termination = use_nul_termination
  1252. defer fi.use_nul_termination = false
  1253. if !do_trailing_comma && field_count > 0 { io.write_string(fi.writer, ", ") }
  1254. if hash {
  1255. fmt_write_indent(fi)
  1256. }
  1257. io.write_string(fi.writer, name, &fi.n)
  1258. io.write_string(fi.writer, " = ", &fi.n)
  1259. if t := info.types[i]; reflect.is_any(t) {
  1260. io.write_string(fi.writer, "any{}", &fi.n)
  1261. } else {
  1262. data := rawptr(uintptr(v.data) + info.offsets[i])
  1263. fmt_arg(fi, any{data, t.id}, verb)
  1264. }
  1265. if do_trailing_comma { io.write_string(fi.writer, ",\n", &fi.n) }
  1266. }
  1267. }
  1268. }
  1269. @(private)
  1270. search_nul_termination :: proc(ptr: rawptr, elem_size: int, max_n: int) -> (n: int) {
  1271. for p := uintptr(ptr); max_n < 0 || n < max_n; p += uintptr(elem_size) {
  1272. if mem.check_zero_ptr(rawptr(p), elem_size) {
  1273. break
  1274. }
  1275. n += 1
  1276. }
  1277. return n
  1278. }
  1279. fmt_array_nul_terminated :: proc(fi: ^Info, data: rawptr, max_n: int, elem_size: int, elem: ^reflect.Type_Info, verb: rune) {
  1280. if data == nil {
  1281. io.write_string(fi.writer, "<nil>", &fi.n)
  1282. return
  1283. }
  1284. n := search_nul_termination(data, elem_size, max_n)
  1285. fmt_array(fi, data, n, elem_size, elem, verb)
  1286. }
  1287. fmt_array :: proc(fi: ^Info, data: rawptr, n: int, elem_size: int, elem: ^reflect.Type_Info, verb: rune) {
  1288. if data == nil && n > 0 {
  1289. io.write_string(fi.writer, "nil")
  1290. return
  1291. }
  1292. if verb == 's' || verb == 'q' {
  1293. print_utf16 :: proc(fi: ^Info, s: []$T) where size_of(T) == 2, intrinsics.type_is_integer(T) {
  1294. REPLACEMENT_CHAR :: '\ufffd'
  1295. _surr1 :: 0xd800
  1296. _surr2 :: 0xdc00
  1297. _surr3 :: 0xe000
  1298. _surr_self :: 0x10000
  1299. for i := 0; i < len(s); i += 1 {
  1300. r := rune(REPLACEMENT_CHAR)
  1301. switch c := s[i]; {
  1302. case c < _surr1, _surr3 <= c:
  1303. r = rune(c)
  1304. case _surr1 <= c && c < _surr2 && i+1 < len(s) &&
  1305. _surr2 <= s[i+1] && s[i+1] < _surr3:
  1306. r1, r2 := rune(c), rune(s[i+1])
  1307. if _surr1 <= r1 && r1 < _surr2 && _surr2 <= r2 && r2 < _surr3 {
  1308. r = (r1-_surr1)<<10 | (r2 - _surr2) + _surr_self
  1309. }
  1310. i += 1
  1311. }
  1312. io.write_rune(fi.writer, r, &fi.n)
  1313. }
  1314. }
  1315. print_utf32 :: proc(fi: ^Info, s: []$T) where size_of(T) == 4 {
  1316. for r in s {
  1317. io.write_rune(fi.writer, rune(r), &fi.n)
  1318. }
  1319. }
  1320. switch reflect.type_info_base(elem).id {
  1321. case byte: fmt_string(fi, string(([^]byte)(data)[:n]), verb); return
  1322. case u16: print_utf16(fi, ([^]u16)(data)[:n]); return
  1323. case u16le: print_utf16(fi, ([^]u16le)(data)[:n]); return
  1324. case u16be: print_utf16(fi, ([^]u16be)(data)[:n]); return
  1325. case u32: print_utf32(fi, ([^]u32)(data)[:n]); return
  1326. case u32le: print_utf32(fi, ([^]u32le)(data)[:n]); return
  1327. case u32be: print_utf32(fi, ([^]u32be)(data)[:n]); return
  1328. case rune: print_utf32(fi, ([^]rune)(data)[:n]); return
  1329. }
  1330. }
  1331. if verb == 'p' {
  1332. fmt_pointer(fi, data, 'p')
  1333. } else {
  1334. fmt_write_array(fi, data, n, elem_size, elem.id, verb)
  1335. }
  1336. }
  1337. fmt_named :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Named) {
  1338. write_padded_number :: proc(fi: ^Info, i: i64, width: int) {
  1339. n := width-1
  1340. for x := i; x >= 10; x /= 10 {
  1341. n -= 1
  1342. }
  1343. for in 0..<n {
  1344. io.write_byte(fi.writer, '0', &fi.n)
  1345. }
  1346. io.write_i64(fi.writer, i, 10, &fi.n)
  1347. }
  1348. // Built-in Custom Formatters for core library types
  1349. switch a in v {
  1350. case runtime.Source_Code_Location:
  1351. io.write_string(fi.writer, a.file_path, &fi.n)
  1352. io.write_byte(fi.writer, '(', &fi.n)
  1353. io.write_int(fi.writer, int(a.line), 10, &fi.n)
  1354. io.write_byte(fi.writer, ':', &fi.n)
  1355. io.write_int(fi.writer, int(a.column), 10, &fi.n)
  1356. io.write_byte(fi.writer, ')', &fi.n)
  1357. return
  1358. case time.Duration:
  1359. ffrac :: proc(buf: []byte, v: u64, prec: int) -> (nw: int, nv: u64) {
  1360. v := v
  1361. w := len(buf)
  1362. print := false
  1363. for in 0..<prec {
  1364. digit := v % 10
  1365. print = print || digit != 0
  1366. if print {
  1367. w -= 1
  1368. buf[w] = byte(digit) + '0'
  1369. }
  1370. v /= 10
  1371. }
  1372. if print {
  1373. w -= 1
  1374. buf[w] = '.'
  1375. }
  1376. return w, v
  1377. }
  1378. fint :: proc(buf: []byte, v: u64) -> int {
  1379. v := v
  1380. w := len(buf)
  1381. if v == 0 {
  1382. w -= 1
  1383. buf[w] = '0'
  1384. } else {
  1385. for v > 0 {
  1386. w -= 1
  1387. buf[w] = byte(v%10) + '0'
  1388. v /= 10
  1389. }
  1390. }
  1391. return w
  1392. }
  1393. buf: [32]byte
  1394. w := len(buf)
  1395. u := u64(a)
  1396. neg := a < 0
  1397. if neg {
  1398. u = -u
  1399. }
  1400. if u < u64(time.Second) {
  1401. prec: int
  1402. w -= 1
  1403. buf[w] = 's'
  1404. w -= 1
  1405. switch {
  1406. case u == 0:
  1407. io.write_string(fi.writer, "0s", &fi.n)
  1408. return
  1409. case u < u64(time.Microsecond):
  1410. prec = 0
  1411. buf[w] = 'n'
  1412. case u < u64(time.Millisecond):
  1413. prec = 3
  1414. // U+00B5 'µ' micro sign == 0xC2 0xB5
  1415. w -= 1 // Need room for two bytes
  1416. copy(buf[w:], "µ")
  1417. case:
  1418. prec = 6
  1419. buf[w] = 'm'
  1420. }
  1421. w, u = ffrac(buf[:w], u, prec)
  1422. w = fint(buf[:w], u)
  1423. } else {
  1424. w -= 1
  1425. buf[w] = 's'
  1426. w, u = ffrac(buf[:w], u, 9)
  1427. w = fint(buf[:w], u%60)
  1428. u /= 60
  1429. if u > 0 {
  1430. w -= 1
  1431. buf[w] = 'm'
  1432. w = fint(buf[:w], u%60)
  1433. u /= 60
  1434. if u > 0 {
  1435. w -= 1
  1436. buf[w] = 'h'
  1437. w = fint(buf[:w], u)
  1438. }
  1439. }
  1440. }
  1441. if neg {
  1442. w -= 1
  1443. buf[w] = '-'
  1444. }
  1445. io.write_string(fi.writer, string(buf[w:]), &fi.n)
  1446. return
  1447. case time.Time:
  1448. t := a
  1449. y, mon, d := time.date(t)
  1450. h, min, s := time.clock(t)
  1451. ns := (t._nsec - (t._nsec/1e9 + time.UNIX_TO_ABSOLUTE)*1e9) % 1e9
  1452. write_padded_number(fi, i64(y), 4)
  1453. io.write_byte(fi.writer, '-', &fi.n)
  1454. write_padded_number(fi, i64(mon), 2)
  1455. io.write_byte(fi.writer, '-', &fi.n)
  1456. write_padded_number(fi, i64(d), 2)
  1457. io.write_byte(fi.writer, ' ', &fi.n)
  1458. write_padded_number(fi, i64(h), 2)
  1459. io.write_byte(fi.writer, ':', &fi.n)
  1460. write_padded_number(fi, i64(min), 2)
  1461. io.write_byte(fi.writer, ':', &fi.n)
  1462. write_padded_number(fi, i64(s), 2)
  1463. io.write_byte(fi.writer, '.', &fi.n)
  1464. write_padded_number(fi, (ns), 9)
  1465. io.write_string(fi.writer, " +0000 UTC", &fi.n)
  1466. return
  1467. }
  1468. #partial switch b in info.base.variant {
  1469. case runtime.Type_Info_Struct:
  1470. fmt_struct(fi, v, verb, b, info.name)
  1471. case runtime.Type_Info_Bit_Set:
  1472. fmt_bit_set(fi, v)
  1473. case:
  1474. fmt_value(fi, any{v.data, info.base.id}, verb)
  1475. }
  1476. }
  1477. fmt_union :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Union, type_size: int) {
  1478. if type_size == 0 {
  1479. io.write_string(fi.writer, "nil", &fi.n)
  1480. return
  1481. }
  1482. if reflect.type_info_union_is_pure_maybe(info) {
  1483. if v.data == nil {
  1484. io.write_string(fi.writer, "nil", &fi.n)
  1485. } else {
  1486. id := info.variants[0].id
  1487. fmt_arg(fi, any{v.data, id}, verb)
  1488. }
  1489. return
  1490. }
  1491. tag: i64 = -1
  1492. tag_ptr := uintptr(v.data) + info.tag_offset
  1493. tag_any := any{rawptr(tag_ptr), info.tag_type.id}
  1494. switch i in tag_any {
  1495. case u8: tag = i64(i)
  1496. case i8: tag = i64(i)
  1497. case u16: tag = i64(i)
  1498. case i16: tag = i64(i)
  1499. case u32: tag = i64(i)
  1500. case i32: tag = i64(i)
  1501. case u64: tag = i64(i)
  1502. case i64: tag = i
  1503. case: panic("Invalid union tag type")
  1504. }
  1505. assert(tag >= 0)
  1506. if v.data == nil {
  1507. io.write_string(fi.writer, "nil", &fi.n)
  1508. } else if info.no_nil {
  1509. id := info.variants[tag].id
  1510. fmt_arg(fi, any{v.data, id}, verb)
  1511. } else if tag == 0 {
  1512. io.write_string(fi.writer, "nil", &fi.n)
  1513. } else {
  1514. id := info.variants[tag-1].id
  1515. fmt_arg(fi, any{v.data, id}, verb)
  1516. }
  1517. }
  1518. fmt_matrix :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Matrix) {
  1519. io.write_string(fi.writer, "matrix[", &fi.n)
  1520. defer io.write_byte(fi.writer, ']', &fi.n)
  1521. fi.indent += 1
  1522. if fi.hash {
  1523. // Printed as it is written
  1524. io.write_byte(fi.writer, '\n', &fi.n)
  1525. for row in 0..<info.row_count {
  1526. fmt_write_indent(fi)
  1527. for col in 0..<info.column_count {
  1528. if col > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1529. offset := (row + col*info.elem_stride)*info.elem_size
  1530. data := uintptr(v.data) + uintptr(offset)
  1531. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1532. }
  1533. io.write_string(fi.writer, ",\n", &fi.n)
  1534. }
  1535. } else {
  1536. // Printed in Row-Major layout to match text layout
  1537. for row in 0..<info.row_count {
  1538. if row > 0 { io.write_string(fi.writer, "; ", &fi.n) }
  1539. for col in 0..<info.column_count {
  1540. if col > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1541. offset := (row + col*info.elem_stride)*info.elem_size
  1542. data := uintptr(v.data) + uintptr(offset)
  1543. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1544. }
  1545. }
  1546. }
  1547. fi.indent -= 1
  1548. if fi.hash {
  1549. fmt_write_indent(fi)
  1550. }
  1551. }
  1552. fmt_value :: proc(fi: ^Info, v: any, verb: rune) {
  1553. if v.data == nil || v.id == nil {
  1554. io.write_string(fi.writer, "<nil>", &fi.n)
  1555. return
  1556. }
  1557. if _user_formatters != nil && !fi.ignore_user_formatters {
  1558. formatter := _user_formatters[v.id]
  1559. if formatter != nil {
  1560. fi.ignore_user_formatters = false
  1561. if ok := formatter(fi, v, verb); !ok {
  1562. fi.ignore_user_formatters = true
  1563. fmt_bad_verb(fi, verb)
  1564. }
  1565. return
  1566. }
  1567. }
  1568. fi.ignore_user_formatters = false
  1569. type_info := type_info_of(v.id)
  1570. switch info in type_info.variant {
  1571. case runtime.Type_Info_Any: // Ignore
  1572. case runtime.Type_Info_Tuple: // Ignore
  1573. case runtime.Type_Info_Named:
  1574. fmt_named(fi, v, verb, info)
  1575. case runtime.Type_Info_Boolean: fmt_arg(fi, v, verb)
  1576. case runtime.Type_Info_Integer: fmt_arg(fi, v, verb)
  1577. case runtime.Type_Info_Rune: fmt_arg(fi, v, verb)
  1578. case runtime.Type_Info_Float: fmt_arg(fi, v, verb)
  1579. case runtime.Type_Info_Complex: fmt_arg(fi, v, verb)
  1580. case runtime.Type_Info_Quaternion: fmt_arg(fi, v, verb)
  1581. case runtime.Type_Info_String: fmt_arg(fi, v, verb)
  1582. case runtime.Type_Info_Pointer:
  1583. if v.id == typeid_of(^runtime.Type_Info) {
  1584. reflect.write_type(fi.writer, (^^runtime.Type_Info)(v.data)^, &fi.n)
  1585. } else {
  1586. ptr := (^rawptr)(v.data)^
  1587. if verb != 'p' && info.elem != nil {
  1588. a := any{ptr, info.elem.id}
  1589. elem := runtime.type_info_base(info.elem)
  1590. if elem != nil {
  1591. #partial switch e in elem.variant {
  1592. case runtime.Type_Info_Array,
  1593. runtime.Type_Info_Slice,
  1594. runtime.Type_Info_Dynamic_Array,
  1595. runtime.Type_Info_Map:
  1596. if ptr == nil {
  1597. io.write_string(fi.writer, "<nil>", &fi.n)
  1598. return
  1599. }
  1600. if fi.indirection_level < 1 {
  1601. fi.indirection_level += 1
  1602. defer fi.indirection_level -= 1
  1603. io.write_byte(fi.writer, '&')
  1604. fmt_value(fi, a, verb)
  1605. return
  1606. }
  1607. case runtime.Type_Info_Struct,
  1608. runtime.Type_Info_Union:
  1609. if ptr == nil {
  1610. io.write_string(fi.writer, "<nil>", &fi.n)
  1611. return
  1612. }
  1613. if fi.indirection_level < 1 {
  1614. fi.indirection_level += 1
  1615. defer fi.indirection_level -= 1
  1616. io.write_byte(fi.writer, '&', &fi.n)
  1617. fmt_value(fi, a, verb)
  1618. return
  1619. }
  1620. }
  1621. }
  1622. }
  1623. fmt_pointer(fi, ptr, verb)
  1624. }
  1625. case runtime.Type_Info_Multi_Pointer:
  1626. ptr := (^rawptr)(v.data)^
  1627. if ptr == nil {
  1628. io.write_string(fi.writer, "<nil>", &fi.n)
  1629. return
  1630. }
  1631. if verb != 'p' && info.elem != nil {
  1632. a := any{ptr, info.elem.id}
  1633. elem := runtime.type_info_base(info.elem)
  1634. if elem != nil {
  1635. if n, ok := fi.optional_len.?; ok {
  1636. fmt_array(fi, ptr, n, elem.size, elem, verb)
  1637. return
  1638. } else if fi.use_nul_termination {
  1639. fmt_array_nul_terminated(fi, ptr, -1, elem.size, elem, verb)
  1640. return
  1641. }
  1642. #partial switch e in elem.variant {
  1643. case runtime.Type_Info_Integer:
  1644. switch verb {
  1645. case 's', 'q':
  1646. switch elem.id {
  1647. case u8:
  1648. fmt_cstring(fi, cstring(ptr), verb)
  1649. return
  1650. case u16, u32, rune:
  1651. n := search_nul_termination(ptr, elem.size, -1)
  1652. fmt_array(fi, ptr, n, elem.size, elem, verb)
  1653. return
  1654. }
  1655. }
  1656. case runtime.Type_Info_Array,
  1657. runtime.Type_Info_Slice,
  1658. runtime.Type_Info_Dynamic_Array,
  1659. runtime.Type_Info_Map:
  1660. if fi.indirection_level < 1 {
  1661. fi.indirection_level += 1
  1662. defer fi.indirection_level -= 1
  1663. io.write_byte(fi.writer, '&', &fi.n)
  1664. fmt_value(fi, a, verb)
  1665. return
  1666. }
  1667. case runtime.Type_Info_Struct,
  1668. runtime.Type_Info_Union:
  1669. if fi.indirection_level < 1 {
  1670. fi.indirection_level += 1
  1671. defer fi.indirection_level -= 1
  1672. io.write_byte(fi.writer, '&', &fi.n)
  1673. fmt_value(fi, a, verb)
  1674. return
  1675. }
  1676. }
  1677. }
  1678. }
  1679. fmt_pointer(fi, ptr, verb)
  1680. case runtime.Type_Info_Enumerated_Array:
  1681. fi.record_level += 1
  1682. defer fi.record_level -= 1
  1683. if fi.hash {
  1684. io.write_string(fi.writer, "[\n", &fi.n)
  1685. defer {
  1686. io.write_byte(fi.writer, '\n', &fi.n)
  1687. fmt_write_indent(fi)
  1688. io.write_byte(fi.writer, ']', &fi.n)
  1689. }
  1690. indent := fi.indent
  1691. fi.indent += 1
  1692. defer fi.indent = indent
  1693. for i in 0..<info.count {
  1694. fmt_write_indent(fi)
  1695. idx, ok := stored_enum_value_to_string(info.index, info.min_value, i)
  1696. if ok {
  1697. io.write_byte(fi.writer, '.', &fi.n)
  1698. io.write_string(fi.writer, idx, &fi.n)
  1699. } else {
  1700. io.write_i64(fi.writer, i64(info.min_value)+i64(i), 10, &fi.n)
  1701. }
  1702. io.write_string(fi.writer, " = ", &fi.n)
  1703. data := uintptr(v.data) + uintptr(i*info.elem_size)
  1704. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1705. io.write_string(fi.writer, ",\n", &fi.n)
  1706. }
  1707. } else {
  1708. io.write_byte(fi.writer, '[', &fi.n)
  1709. defer io.write_byte(fi.writer, ']', &fi.n)
  1710. for i in 0..<info.count {
  1711. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1712. idx, ok := stored_enum_value_to_string(info.index, info.min_value, i)
  1713. if ok {
  1714. io.write_byte(fi.writer, '.', &fi.n)
  1715. io.write_string(fi.writer, idx, &fi.n)
  1716. } else {
  1717. io.write_i64(fi.writer, i64(info.min_value)+i64(i), 10, &fi.n)
  1718. }
  1719. io.write_string(fi.writer, " = ", &fi.n)
  1720. data := uintptr(v.data) + uintptr(i*info.elem_size)
  1721. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1722. }
  1723. }
  1724. case runtime.Type_Info_Array:
  1725. n := info.count
  1726. ptr := v.data
  1727. if ol, ok := fi.optional_len.?; ok {
  1728. n = min(n, ol)
  1729. } else if fi.use_nul_termination {
  1730. fmt_array_nul_terminated(fi, ptr, n, info.elem_size, info.elem, verb)
  1731. return
  1732. }
  1733. fmt_array(fi, ptr, n, info.elem_size, info.elem, verb)
  1734. case runtime.Type_Info_Slice:
  1735. slice := cast(^mem.Raw_Slice)v.data
  1736. n := slice.len
  1737. ptr := slice.data
  1738. if ol, ok := fi.optional_len.?; ok {
  1739. n = min(n, ol)
  1740. } else if fi.use_nul_termination {
  1741. fmt_array_nul_terminated(fi, ptr, n, info.elem_size, info.elem, verb)
  1742. return
  1743. }
  1744. fmt_array(fi, ptr, n, info.elem_size, info.elem, verb)
  1745. case runtime.Type_Info_Dynamic_Array:
  1746. array := cast(^mem.Raw_Dynamic_Array)v.data
  1747. n := array.len
  1748. ptr := array.data
  1749. if ol, ok := fi.optional_len.?; ok {
  1750. n = min(n, ol)
  1751. } else if fi.use_nul_termination {
  1752. fmt_array_nul_terminated(fi, ptr, n, info.elem_size, info.elem, verb)
  1753. return
  1754. }
  1755. fmt_array(fi, ptr, n, info.elem_size, info.elem, verb)
  1756. case runtime.Type_Info_Simd_Vector:
  1757. io.write_byte(fi.writer, '<', &fi.n)
  1758. defer io.write_byte(fi.writer, '>', &fi.n)
  1759. for i in 0..<info.count {
  1760. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1761. data := uintptr(v.data) + uintptr(i*info.elem_size)
  1762. fmt_arg(fi, any{rawptr(data), info.elem.id}, verb)
  1763. }
  1764. case runtime.Type_Info_Map:
  1765. if verb != 'v' {
  1766. fmt_bad_verb(fi, verb)
  1767. return
  1768. }
  1769. io.write_string(fi.writer, "map[", &fi.n)
  1770. defer io.write_byte(fi.writer, ']', &fi.n)
  1771. fi.record_level += 1
  1772. defer fi.record_level -= 1
  1773. m := (^mem.Raw_Map)(v.data)
  1774. if m != nil {
  1775. if info.generated_struct == nil {
  1776. return
  1777. }
  1778. entries := &m.entries
  1779. gs := runtime.type_info_base(info.generated_struct).variant.(runtime.Type_Info_Struct)
  1780. ed := runtime.type_info_base(gs.types[1]).variant.(runtime.Type_Info_Dynamic_Array)
  1781. entry_type := ed.elem.variant.(runtime.Type_Info_Struct)
  1782. entry_size := ed.elem_size
  1783. for i in 0..<entries.len {
  1784. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1785. data := uintptr(entries.data) + uintptr(i*entry_size)
  1786. key := data + entry_type.offsets[2]
  1787. fmt_arg(&Info{writer = fi.writer}, any{rawptr(key), info.key.id}, 'v')
  1788. io.write_string(fi.writer, "=", &fi.n)
  1789. value := data + entry_type.offsets[3]
  1790. fmt_arg(fi, any{rawptr(value), info.value.id}, 'v')
  1791. }
  1792. }
  1793. case runtime.Type_Info_Struct:
  1794. fmt_struct(fi, v, verb, info, "")
  1795. case runtime.Type_Info_Union:
  1796. fmt_union(fi, v, verb, info, type_info.size)
  1797. case runtime.Type_Info_Enum:
  1798. fmt_enum(fi, v, verb)
  1799. case runtime.Type_Info_Procedure:
  1800. ptr := (^rawptr)(v.data)^
  1801. if ptr == nil {
  1802. io.write_string(fi.writer, "nil", &fi.n)
  1803. } else {
  1804. reflect.write_typeid(fi.writer, v.id, &fi.n)
  1805. io.write_string(fi.writer, " @ ", &fi.n)
  1806. fmt_pointer(fi, ptr, 'p')
  1807. }
  1808. case runtime.Type_Info_Type_Id:
  1809. id := (^typeid)(v.data)^
  1810. reflect.write_typeid(fi.writer, id, &fi.n)
  1811. case runtime.Type_Info_Bit_Set:
  1812. fmt_bit_set(fi, v)
  1813. case runtime.Type_Info_Relative_Pointer:
  1814. ptr := reflect.relative_pointer_to_absolute_raw(v.data, info.base_integer.id)
  1815. absolute_ptr := any{ptr, info.pointer.id}
  1816. fmt_value(fi, absolute_ptr, verb)
  1817. case runtime.Type_Info_Relative_Slice:
  1818. ptr := reflect.relative_pointer_to_absolute_raw(v.data, info.base_integer.id)
  1819. if verb == 'p' {
  1820. fmt_pointer(fi, ptr, 'p')
  1821. } else if ptr == nil {
  1822. io.write_string(fi.writer, "[]", &fi.n)
  1823. } else {
  1824. len_ptr := uintptr(v.data) + uintptr(info.base_integer.size)
  1825. len_any := any{rawptr(len_ptr), info.base_integer.id}
  1826. len, _ := reflect.as_int(len_any)
  1827. slice_type := reflect.type_info_base(info.slice).variant.(runtime.Type_Info_Slice)
  1828. fi.record_level += 1
  1829. defer fi.record_level -= 1
  1830. io.write_byte(fi.writer, '[', &fi.n)
  1831. defer io.write_byte(fi.writer, ']', &fi.n)
  1832. for i in 0..<len {
  1833. if i > 0 { io.write_string(fi.writer, ", ", &fi.n) }
  1834. data := uintptr(ptr) + uintptr(i*slice_type.elem_size)
  1835. fmt_arg(fi, any{rawptr(data), slice_type.elem.id}, verb)
  1836. }
  1837. }
  1838. case runtime.Type_Info_Matrix:
  1839. fmt_matrix(fi, v, verb, info)
  1840. }
  1841. }
  1842. fmt_complex :: proc(fi: ^Info, c: complex128, bits: int, verb: rune) {
  1843. switch verb {
  1844. case 'f', 'F', 'v', 'h', 'H':
  1845. r, i := real(c), imag(c)
  1846. fmt_float(fi, r, bits/2, verb)
  1847. if !fi.plus && i >= 0 {
  1848. io.write_rune(fi.writer, '+', &fi.n)
  1849. }
  1850. fmt_float(fi, i, bits/2, verb)
  1851. io.write_rune(fi.writer, 'i', &fi.n)
  1852. case:
  1853. fmt_bad_verb(fi, verb)
  1854. return
  1855. }
  1856. }
  1857. fmt_quaternion :: proc(fi: ^Info, q: quaternion256, bits: int, verb: rune) {
  1858. switch verb {
  1859. case 'f', 'F', 'v', 'h', 'H':
  1860. r, i, j, k := real(q), imag(q), jmag(q), kmag(q)
  1861. fmt_float(fi, r, bits/4, verb)
  1862. if !fi.plus && i >= 0 {
  1863. io.write_rune(fi.writer, '+', &fi.n)
  1864. }
  1865. fmt_float(fi, i, bits/4, verb)
  1866. io.write_rune(fi.writer, 'i', &fi.n)
  1867. if !fi.plus && j >= 0 {
  1868. io.write_rune(fi.writer, '+', &fi.n)
  1869. }
  1870. fmt_float(fi, j, bits/4, verb)
  1871. io.write_rune(fi.writer, 'j', &fi.n)
  1872. if !fi.plus && k >= 0 {
  1873. io.write_rune(fi.writer, '+', &fi.n)
  1874. }
  1875. fmt_float(fi, k, bits/4, verb)
  1876. io.write_rune(fi.writer, 'k', &fi.n)
  1877. case:
  1878. fmt_bad_verb(fi, verb)
  1879. return
  1880. }
  1881. }
  1882. fmt_arg :: proc(fi: ^Info, arg: any, verb: rune) {
  1883. if arg == nil {
  1884. io.write_string(fi.writer, "<nil>")
  1885. return
  1886. }
  1887. fi.arg = arg
  1888. if verb == 'T' {
  1889. ti := type_info_of(arg.id)
  1890. switch a in arg {
  1891. case ^runtime.Type_Info: ti = a
  1892. }
  1893. reflect.write_type(fi.writer, ti, &fi.n)
  1894. return
  1895. }
  1896. if _user_formatters != nil {
  1897. formatter := _user_formatters[arg.id]
  1898. if formatter != nil {
  1899. if ok := formatter(fi, arg, verb); !ok {
  1900. fmt_bad_verb(fi, verb)
  1901. }
  1902. return
  1903. }
  1904. }
  1905. custom_types: switch a in arg {
  1906. case runtime.Source_Code_Location:
  1907. if fi.hash && verb == 'v' {
  1908. io.write_string(fi.writer, a.file_path, &fi.n)
  1909. io.write_byte(fi.writer, '(', &fi.n)
  1910. io.write_i64(fi.writer, i64(a.line), 10, &fi.n)
  1911. io.write_byte(fi.writer, ':', &fi.n)
  1912. io.write_i64(fi.writer, i64(a.column), 10, &fi.n)
  1913. io.write_byte(fi.writer, ')', &fi.n)
  1914. return
  1915. }
  1916. }
  1917. base_arg := arg
  1918. base_arg.id = runtime.typeid_base(base_arg.id)
  1919. switch a in base_arg {
  1920. case bool: fmt_bool(fi, a, verb)
  1921. case b8: fmt_bool(fi, bool(a), verb)
  1922. case b16: fmt_bool(fi, bool(a), verb)
  1923. case b32: fmt_bool(fi, bool(a), verb)
  1924. case b64: fmt_bool(fi, bool(a), verb)
  1925. case any: fmt_arg(fi, a, verb)
  1926. case rune: fmt_rune(fi, a, verb)
  1927. case f16: fmt_float(fi, f64(a), 16, verb)
  1928. case f32: fmt_float(fi, f64(a), 32, verb)
  1929. case f64: fmt_float(fi, a, 64, verb)
  1930. case f16le: fmt_float(fi, f64(a), 16, verb)
  1931. case f32le: fmt_float(fi, f64(a), 32, verb)
  1932. case f64le: fmt_float(fi, f64(a), 64, verb)
  1933. case f16be: fmt_float(fi, f64(a), 16, verb)
  1934. case f32be: fmt_float(fi, f64(a), 32, verb)
  1935. case f64be: fmt_float(fi, f64(a), 64, verb)
  1936. case complex32: fmt_complex(fi, complex128(a), 32, verb)
  1937. case complex64: fmt_complex(fi, complex128(a), 64, verb)
  1938. case complex128: fmt_complex(fi, a, 128, verb)
  1939. case quaternion64: fmt_quaternion(fi, quaternion256(a), 64, verb)
  1940. case quaternion128: fmt_quaternion(fi, quaternion256(a), 128, verb)
  1941. case quaternion256: fmt_quaternion(fi, a, 256, verb)
  1942. case i8: fmt_int(fi, u64(a), true, 8, verb)
  1943. case u8: fmt_int(fi, u64(a), false, 8, verb)
  1944. case i16: fmt_int(fi, u64(a), true, 16, verb)
  1945. case u16: fmt_int(fi, u64(a), false, 16, verb)
  1946. case i32: fmt_int(fi, u64(a), true, 32, verb)
  1947. case u32: fmt_int(fi, u64(a), false, 32, verb)
  1948. case i64: fmt_int(fi, u64(a), true, 64, verb)
  1949. case u64: fmt_int(fi, a, false, 64, verb)
  1950. case int: fmt_int(fi, u64(a), true, 8*size_of(int), verb)
  1951. case uint: fmt_int(fi, u64(a), false, 8*size_of(uint), verb)
  1952. case uintptr: fmt_int(fi, u64(a), false, 8*size_of(uintptr), verb)
  1953. case string: fmt_string(fi, a, verb)
  1954. case cstring: fmt_cstring(fi, a, verb)
  1955. case typeid: reflect.write_typeid(fi.writer, a, &fi.n)
  1956. case i16le: fmt_int(fi, u64(a), true, 16, verb)
  1957. case u16le: fmt_int(fi, u64(a), false, 16, verb)
  1958. case i32le: fmt_int(fi, u64(a), true, 32, verb)
  1959. case u32le: fmt_int(fi, u64(a), false, 32, verb)
  1960. case i64le: fmt_int(fi, u64(a), true, 64, verb)
  1961. case u64le: fmt_int(fi, u64(a), false, 64, verb)
  1962. case i16be: fmt_int(fi, u64(a), true, 16, verb)
  1963. case u16be: fmt_int(fi, u64(a), false, 16, verb)
  1964. case i32be: fmt_int(fi, u64(a), true, 32, verb)
  1965. case u32be: fmt_int(fi, u64(a), false, 32, verb)
  1966. case i64be: fmt_int(fi, u64(a), true, 64, verb)
  1967. case u64be: fmt_int(fi, u64(a), false, 64, verb)
  1968. case i128: fmt_int_128(fi, u128(a), true, 128, verb)
  1969. case u128: fmt_int_128(fi, a, false, 128, verb)
  1970. case i128le: fmt_int_128(fi, u128(a), true, 128, verb)
  1971. case u128le: fmt_int_128(fi, u128(a), false, 128, verb)
  1972. case i128be: fmt_int_128(fi, u128(a), true, 128, verb)
  1973. case u128be: fmt_int_128(fi, u128(a), false, 128, verb)
  1974. case: fmt_value(fi, arg, verb)
  1975. }
  1976. }