unmarshal.odin 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649
  1. package json
  2. import "core:mem"
  3. import "core:math"
  4. import "core:reflect"
  5. import "core:strconv"
  6. import "core:strings"
  7. import "base:runtime"
  8. import "base:intrinsics"
  9. Unmarshal_Data_Error :: enum {
  10. Invalid_Data,
  11. Invalid_Parameter,
  12. Non_Pointer_Parameter,
  13. Multiple_Use_Field,
  14. }
  15. Unsupported_Type_Error :: struct {
  16. id: typeid,
  17. token: Token,
  18. }
  19. Unmarshal_Error :: union {
  20. Error,
  21. Unmarshal_Data_Error,
  22. Unsupported_Type_Error,
  23. }
  24. unmarshal_any :: proc(data: []byte, v: any, spec := DEFAULT_SPECIFICATION, allocator := context.allocator) -> Unmarshal_Error {
  25. v := v
  26. if v == nil || v.id == nil {
  27. return .Invalid_Parameter
  28. }
  29. v = reflect.any_base(v)
  30. ti := type_info_of(v.id)
  31. if !reflect.is_pointer(ti) || ti.id == rawptr {
  32. return .Non_Pointer_Parameter
  33. }
  34. PARSE_INTEGERS :: true
  35. if !is_valid(data, spec, PARSE_INTEGERS) {
  36. return .Invalid_Data
  37. }
  38. p := make_parser(data, spec, PARSE_INTEGERS, allocator)
  39. data := any{(^rawptr)(v.data)^, ti.variant.(reflect.Type_Info_Pointer).elem.id}
  40. if v.data == nil {
  41. return .Invalid_Parameter
  42. }
  43. context.allocator = p.allocator
  44. if p.spec == .MJSON {
  45. #partial switch p.curr_token.kind {
  46. case .Ident, .String:
  47. return unmarshal_object(&p, data, .EOF)
  48. }
  49. }
  50. return unmarshal_value(&p, data)
  51. }
  52. unmarshal :: proc(data: []byte, ptr: ^$T, spec := DEFAULT_SPECIFICATION, allocator := context.allocator) -> Unmarshal_Error {
  53. return unmarshal_any(data, ptr, spec, allocator)
  54. }
  55. unmarshal_string :: proc(data: string, ptr: ^$T, spec := DEFAULT_SPECIFICATION, allocator := context.allocator) -> Unmarshal_Error {
  56. return unmarshal_any(transmute([]byte)data, ptr, spec, allocator)
  57. }
  58. @(private)
  59. assign_bool :: proc(val: any, b: bool) -> bool {
  60. v := reflect.any_core(val)
  61. switch &dst in v {
  62. case bool: dst = bool(b)
  63. case b8: dst = b8 (b)
  64. case b16: dst = b16 (b)
  65. case b32: dst = b32 (b)
  66. case b64: dst = b64 (b)
  67. case: return false
  68. }
  69. return true
  70. }
  71. @(private)
  72. assign_int :: proc(val: any, i: $T) -> bool {
  73. v := reflect.any_core(val)
  74. switch &dst in v {
  75. case i8: dst = i8 (i)
  76. case i16: dst = i16 (i)
  77. case i16le: dst = i16le (i)
  78. case i16be: dst = i16be (i)
  79. case i32: dst = i32 (i)
  80. case i32le: dst = i32le (i)
  81. case i32be: dst = i32be (i)
  82. case i64: dst = i64 (i)
  83. case i64le: dst = i64le (i)
  84. case i64be: dst = i64be (i)
  85. case i128: dst = i128 (i)
  86. case i128le: dst = i128le (i)
  87. case i128be: dst = i128be (i)
  88. case u8: dst = u8 (i)
  89. case u16: dst = u16 (i)
  90. case u16le: dst = u16le (i)
  91. case u16be: dst = u16be (i)
  92. case u32: dst = u32 (i)
  93. case u32le: dst = u32le (i)
  94. case u32be: dst = u32be (i)
  95. case u64: dst = u64 (i)
  96. case u64le: dst = u64le (i)
  97. case u64be: dst = u64be (i)
  98. case u128: dst = u128 (i)
  99. case u128le: dst = u128le (i)
  100. case u128be: dst = u128be (i)
  101. case int: dst = int (i)
  102. case uint: dst = uint (i)
  103. case uintptr: dst = uintptr(i)
  104. case: return false
  105. }
  106. return true
  107. }
  108. @(private)
  109. assign_float :: proc(val: any, f: $T) -> bool {
  110. v := reflect.any_core(val)
  111. switch &dst in v {
  112. case f16: dst = f16 (f)
  113. case f16le: dst = f16le(f)
  114. case f16be: dst = f16be(f)
  115. case f32: dst = f32 (f)
  116. case f32le: dst = f32le(f)
  117. case f32be: dst = f32be(f)
  118. case f64: dst = f64 (f)
  119. case f64le: dst = f64le(f)
  120. case f64be: dst = f64be(f)
  121. case complex32: dst = complex(f16(f), 0)
  122. case complex64: dst = complex(f32(f), 0)
  123. case complex128: dst = complex(f64(f), 0)
  124. case quaternion64: dst = quaternion(w=f16(f), x=0, y=0, z=0)
  125. case quaternion128: dst = quaternion(w=f32(f), x=0, y=0, z=0)
  126. case quaternion256: dst = quaternion(w=f64(f), x=0, y=0, z=0)
  127. case: return false
  128. }
  129. return true
  130. }
  131. @(private)
  132. unmarshal_string_token :: proc(p: ^Parser, val: any, str: string, ti: ^reflect.Type_Info) -> bool {
  133. val := val
  134. switch &dst in val {
  135. case string:
  136. dst = str
  137. return true
  138. case cstring:
  139. if str == "" {
  140. dst = strings.clone_to_cstring("", p.allocator)
  141. } else {
  142. // NOTE: This is valid because 'clone_string' appends a NUL terminator
  143. dst = cstring(raw_data(str))
  144. }
  145. return true
  146. }
  147. #partial switch variant in ti.variant {
  148. case reflect.Type_Info_Enum:
  149. for name, i in variant.names {
  150. if name == str {
  151. assign_int(val, variant.values[i])
  152. return true
  153. }
  154. }
  155. // TODO(bill): should this be an error or not?
  156. return true
  157. case reflect.Type_Info_Integer:
  158. i := strconv.parse_i128(str) or_return
  159. if assign_int(val, i) {
  160. return true
  161. }
  162. if assign_float(val, i) {
  163. return true
  164. }
  165. case reflect.Type_Info_Float:
  166. f := strconv.parse_f64(str) or_return
  167. if assign_int(val, f) {
  168. return true
  169. }
  170. if assign_float(val, f) {
  171. return true
  172. }
  173. }
  174. return false
  175. }
  176. @(private)
  177. unmarshal_value :: proc(p: ^Parser, v: any) -> (err: Unmarshal_Error) {
  178. UNSUPPORTED_TYPE := Unsupported_Type_Error{v.id, p.curr_token}
  179. token := p.curr_token
  180. v := v
  181. ti := reflect.type_info_base(type_info_of(v.id))
  182. if u, ok := ti.variant.(reflect.Type_Info_Union); ok && token.kind != .Null {
  183. // NOTE: If it's a union with only one variant, then treat it as that variant
  184. if len(u.variants) == 1 {
  185. variant := u.variants[0]
  186. v.id = variant.id
  187. ti = reflect.type_info_base(variant)
  188. if !reflect.is_pointer_internally(variant) {
  189. tag := any{rawptr(uintptr(v.data) + u.tag_offset), u.tag_type.id}
  190. assign_int(tag, 1)
  191. }
  192. } else if v.id != Value {
  193. for variant, i in u.variants {
  194. variant_any := any{v.data, variant.id}
  195. variant_p := p^
  196. if err = unmarshal_value(&variant_p, variant_any); err == nil {
  197. p^ = variant_p
  198. raw_tag := i
  199. if !u.no_nil { raw_tag += 1 }
  200. tag := any{rawptr(uintptr(v.data) + u.tag_offset), u.tag_type.id}
  201. assign_int(tag, raw_tag)
  202. return
  203. }
  204. }
  205. return UNSUPPORTED_TYPE
  206. }
  207. }
  208. switch &dst in v {
  209. // Handle json.Value as an unknown type
  210. case Value:
  211. dst = parse_value(p) or_return
  212. return
  213. }
  214. #partial switch token.kind {
  215. case .Null:
  216. mem.zero(v.data, ti.size)
  217. advance_token(p)
  218. return
  219. case .False, .True:
  220. advance_token(p)
  221. if assign_bool(v, token.kind == .True) {
  222. return
  223. }
  224. return UNSUPPORTED_TYPE
  225. case .Integer:
  226. advance_token(p)
  227. i, _ := strconv.parse_i128(token.text)
  228. if assign_int(v, i) {
  229. return
  230. }
  231. if assign_float(v, i) {
  232. return
  233. }
  234. return UNSUPPORTED_TYPE
  235. case .Float:
  236. advance_token(p)
  237. f, _ := strconv.parse_f64(token.text)
  238. if assign_float(v, f) {
  239. return
  240. }
  241. if i, fract := math.modf(f); fract == 0 {
  242. if assign_int(v, i) {
  243. return
  244. }
  245. if assign_float(v, i) {
  246. return
  247. }
  248. }
  249. return UNSUPPORTED_TYPE
  250. case .Ident:
  251. advance_token(p)
  252. if p.spec == .MJSON {
  253. if unmarshal_string_token(p, any{v.data, ti.id}, token.text, ti) {
  254. return nil
  255. }
  256. }
  257. return UNSUPPORTED_TYPE
  258. case .String:
  259. advance_token(p)
  260. str := unquote_string(token, p.spec, p.allocator) or_return
  261. if unmarshal_string_token(p, any{v.data, ti.id}, str, ti) {
  262. return nil
  263. }
  264. delete(str, p.allocator)
  265. return UNSUPPORTED_TYPE
  266. case .Open_Brace:
  267. return unmarshal_object(p, v, .Close_Brace)
  268. case .Open_Bracket:
  269. return unmarshal_array(p, v)
  270. case:
  271. if p.spec != .JSON {
  272. #partial switch token.kind {
  273. case .Infinity:
  274. advance_token(p)
  275. f: f64 = 0h7ff0000000000000
  276. if token.text[0] == '-' {
  277. f = 0hfff0000000000000
  278. }
  279. if assign_float(v, f) {
  280. return
  281. }
  282. return UNSUPPORTED_TYPE
  283. case .NaN:
  284. advance_token(p)
  285. f: f64 = 0h7ff7ffffffffffff
  286. if token.text[0] == '-' {
  287. f = 0hfff7ffffffffffff
  288. }
  289. if assign_float(v, f) {
  290. return
  291. }
  292. return UNSUPPORTED_TYPE
  293. }
  294. }
  295. }
  296. advance_token(p)
  297. return UNSUPPORTED_TYPE
  298. }
  299. @(private)
  300. unmarshal_expect_token :: proc(p: ^Parser, kind: Token_Kind, loc := #caller_location) -> Token {
  301. prev := p.curr_token
  302. err := expect_token(p, kind)
  303. assert(err == nil, "unmarshal_expect_token")
  304. return prev
  305. }
  306. @(private)
  307. unmarshal_object :: proc(p: ^Parser, v: any, end_token: Token_Kind) -> (err: Unmarshal_Error) {
  308. UNSUPPORTED_TYPE := Unsupported_Type_Error{v.id, p.curr_token}
  309. if end_token == .Close_Brace {
  310. unmarshal_expect_token(p, .Open_Brace)
  311. }
  312. v := v
  313. v = reflect.any_base(v)
  314. ti := type_info_of(v.id)
  315. #partial switch t in ti.variant {
  316. case reflect.Type_Info_Struct:
  317. if t.is_raw_union {
  318. return UNSUPPORTED_TYPE
  319. }
  320. struct_loop: for p.curr_token.kind != end_token {
  321. key, _ := parse_object_key(p, p.allocator)
  322. defer delete(key, p.allocator)
  323. unmarshal_expect_token(p, .Colon)
  324. fields := reflect.struct_fields_zipped(ti.id)
  325. field_test :: #force_inline proc "contextless" (field_used: [^]byte, offset: uintptr) -> bool {
  326. prev_set := field_used[offset/8] & byte(offset&7) != 0
  327. field_used[offset/8] |= byte(offset&7)
  328. return prev_set
  329. }
  330. field_used_bytes := (reflect.size_of_typeid(ti.id)+7)/8
  331. field_used := intrinsics.alloca(field_used_bytes, 1)
  332. intrinsics.mem_zero(field_used, field_used_bytes)
  333. use_field_idx := -1
  334. for field, field_idx in fields {
  335. tag_value := string(reflect.struct_tag_get(field.tag, "json"))
  336. if key == tag_value {
  337. use_field_idx = field_idx
  338. break
  339. }
  340. }
  341. if use_field_idx < 0 {
  342. for field, field_idx in fields {
  343. if key == field.name {
  344. use_field_idx = field_idx
  345. break
  346. }
  347. }
  348. }
  349. check_children_using_fields :: proc(key: string, parent: typeid) -> (
  350. offset: uintptr,
  351. type: ^reflect.Type_Info,
  352. found: bool,
  353. ) {
  354. for field in reflect.struct_fields_zipped(parent) {
  355. if field.is_using && field.name == "_" {
  356. offset, type, found = check_children_using_fields(key, field.type.id)
  357. if found {
  358. offset += field.offset
  359. return
  360. }
  361. }
  362. if field.name == key {
  363. offset = field.offset
  364. type = field.type
  365. found = true
  366. return
  367. }
  368. }
  369. return
  370. }
  371. offset: uintptr
  372. type: ^reflect.Type_Info
  373. field_found: bool = use_field_idx >= 0
  374. if field_found {
  375. offset = fields[use_field_idx].offset
  376. type = fields[use_field_idx].type
  377. } else {
  378. offset, type, field_found = check_children_using_fields(key, ti.id)
  379. }
  380. if field_found {
  381. if field_test(field_used, offset) {
  382. return .Multiple_Use_Field
  383. }
  384. field_ptr := rawptr(uintptr(v.data) + offset)
  385. field := any{field_ptr, type.id}
  386. unmarshal_value(p, field) or_return
  387. if parse_comma(p) {
  388. break struct_loop
  389. }
  390. continue struct_loop
  391. } else {
  392. // allows skipping unused struct fields
  393. // NOTE(bill): prevent possible memory leak if a string is unquoted
  394. allocator := p.allocator
  395. defer p.allocator = allocator
  396. p.allocator = mem.nil_allocator()
  397. parse_value(p) or_return
  398. if parse_comma(p) {
  399. break struct_loop
  400. }
  401. continue struct_loop
  402. }
  403. }
  404. case reflect.Type_Info_Map:
  405. if !reflect.is_string(t.key) {
  406. return UNSUPPORTED_TYPE
  407. }
  408. raw_map := (^mem.Raw_Map)(v.data)
  409. if raw_map.allocator.procedure == nil {
  410. raw_map.allocator = p.allocator
  411. }
  412. elem_backing := bytes_make(t.value.size, t.value.align, p.allocator) or_return
  413. defer delete(elem_backing, p.allocator)
  414. map_backing_value := any{raw_data(elem_backing), t.value.id}
  415. map_loop: for p.curr_token.kind != end_token {
  416. key, _ := parse_object_key(p, p.allocator)
  417. unmarshal_expect_token(p, .Colon)
  418. mem.zero_slice(elem_backing)
  419. if uerr := unmarshal_value(p, map_backing_value); uerr != nil {
  420. delete(key, p.allocator)
  421. return uerr
  422. }
  423. key_ptr := rawptr(&key)
  424. key_cstr: cstring
  425. if reflect.is_cstring(t.key) {
  426. key_cstr = cstring(raw_data(key))
  427. key_ptr = &key_cstr
  428. }
  429. set_ptr := runtime.__dynamic_map_set_without_hash(raw_map, t.map_info, key_ptr, map_backing_value.data)
  430. if set_ptr == nil {
  431. delete(key, p.allocator)
  432. }
  433. if parse_comma(p) {
  434. break map_loop
  435. }
  436. }
  437. case reflect.Type_Info_Enumerated_Array:
  438. index_type := reflect.type_info_base(t.index)
  439. enum_type := index_type.variant.(reflect.Type_Info_Enum)
  440. enumerated_array_loop: for p.curr_token.kind != end_token {
  441. key, _ := parse_object_key(p, p.allocator)
  442. unmarshal_expect_token(p, .Colon)
  443. defer delete(key, p.allocator)
  444. index := -1
  445. for name, i in enum_type.names {
  446. if key == name {
  447. index = int(enum_type.values[i] - t.min_value)
  448. break
  449. }
  450. }
  451. if index < 0 || index >= t.count {
  452. return UNSUPPORTED_TYPE
  453. }
  454. index_ptr := rawptr(uintptr(v.data) + uintptr(index*t.elem_size))
  455. index_any := any{index_ptr, t.elem.id}
  456. unmarshal_value(p, index_any) or_return
  457. if parse_comma(p) {
  458. break enumerated_array_loop
  459. }
  460. }
  461. case:
  462. return UNSUPPORTED_TYPE
  463. }
  464. if end_token == .Close_Brace {
  465. unmarshal_expect_token(p, .Close_Brace)
  466. }
  467. return
  468. }
  469. @(private)
  470. unmarshal_count_array :: proc(p: ^Parser) -> (length: uintptr) {
  471. p_backup := p^
  472. p.allocator = mem.nil_allocator()
  473. unmarshal_expect_token(p, .Open_Bracket)
  474. array_length_loop: for p.curr_token.kind != .Close_Bracket {
  475. _, _ = parse_value(p)
  476. length += 1
  477. if parse_comma(p) {
  478. break
  479. }
  480. }
  481. p^ = p_backup
  482. return
  483. }
  484. @(private)
  485. unmarshal_array :: proc(p: ^Parser, v: any) -> (err: Unmarshal_Error) {
  486. assign_array :: proc(p: ^Parser, base: rawptr, elem: ^reflect.Type_Info, length: uintptr) -> Unmarshal_Error {
  487. unmarshal_expect_token(p, .Open_Bracket)
  488. for idx: uintptr = 0; p.curr_token.kind != .Close_Bracket; idx += 1 {
  489. assert(idx < length)
  490. elem_ptr := rawptr(uintptr(base) + idx*uintptr(elem.size))
  491. elem := any{elem_ptr, elem.id}
  492. unmarshal_value(p, elem) or_return
  493. if parse_comma(p) {
  494. break
  495. }
  496. }
  497. unmarshal_expect_token(p, .Close_Bracket)
  498. return nil
  499. }
  500. UNSUPPORTED_TYPE := Unsupported_Type_Error{v.id, p.curr_token}
  501. ti := reflect.type_info_base(type_info_of(v.id))
  502. length := unmarshal_count_array(p)
  503. #partial switch t in ti.variant {
  504. case reflect.Type_Info_Slice:
  505. raw := (^mem.Raw_Slice)(v.data)
  506. data := bytes_make(t.elem.size * int(length), t.elem.align, p.allocator) or_return
  507. raw.data = raw_data(data)
  508. raw.len = int(length)
  509. return assign_array(p, raw.data, t.elem, length)
  510. case reflect.Type_Info_Dynamic_Array:
  511. raw := (^mem.Raw_Dynamic_Array)(v.data)
  512. data := bytes_make(t.elem.size * int(length), t.elem.align, p.allocator) or_return
  513. raw.data = raw_data(data)
  514. raw.len = int(length)
  515. raw.cap = int(length)
  516. raw.allocator = p.allocator
  517. return assign_array(p, raw.data, t.elem, length)
  518. case reflect.Type_Info_Array:
  519. // NOTE(bill): Allow lengths which are less than the dst array
  520. if int(length) > t.count {
  521. return UNSUPPORTED_TYPE
  522. }
  523. return assign_array(p, v.data, t.elem, length)
  524. case reflect.Type_Info_Enumerated_Array:
  525. // NOTE(bill): Allow lengths which are less than the dst array
  526. if int(length) > t.count {
  527. return UNSUPPORTED_TYPE
  528. }
  529. return assign_array(p, v.data, t.elem, length)
  530. case reflect.Type_Info_Complex:
  531. // NOTE(bill): Allow lengths which are less than the dst array
  532. if int(length) > 2 {
  533. return UNSUPPORTED_TYPE
  534. }
  535. switch ti.id {
  536. case complex32: return assign_array(p, v.data, type_info_of(f16), 2)
  537. case complex64: return assign_array(p, v.data, type_info_of(f32), 2)
  538. case complex128: return assign_array(p, v.data, type_info_of(f64), 2)
  539. }
  540. return UNSUPPORTED_TYPE
  541. }
  542. return UNSUPPORTED_TYPE
  543. }