Du kannst nicht mehr als 25 Themen auswählen Themen müssen entweder mit einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.

887 Zeilen
22 KiB

  1. // This file is part of Jiffy released under the MIT license.
  2. // See the LICENSE file for more information.
  3. #include <assert.h>
  4. #include <stdio.h>
  5. #include <string.h>
  6. #include "erl_nif.h"
  7. #include "jiffy.h"
  8. #define BIN_INC_SIZE 2048
  9. #define MIN(X, Y) ((X) < (Y) ? (X) : (Y))
  10. #define MAYBE_PRETTY(e) \
  11. do { \
  12. if(e->pretty) { \
  13. if(!enc_shift(e)) \
  14. return 0; \
  15. } \
  16. } while(0)
  17. #if WINDOWS || WIN32
  18. #define inline __inline
  19. #define snprintf _snprintf
  20. #endif
  21. typedef struct {
  22. ErlNifEnv* env;
  23. jiffy_st* atoms;
  24. size_t bytes_per_red;
  25. int uescape;
  26. int pretty;
  27. int use_nil;
  28. int escape_forward_slashes;
  29. int shiftcnt;
  30. int count;
  31. size_t iolen;
  32. size_t iosize;
  33. ERL_NIF_TERM iolist;
  34. ErlNifBinary bin;
  35. ErlNifBinary* curr;
  36. char* p;
  37. unsigned char* u;
  38. size_t i;
  39. } Encoder;
  40. // String constants for pretty printing.
  41. // Every string starts with its length.
  42. #define NUM_SHIFTS 8
  43. static char* shifts[NUM_SHIFTS] = {
  44. "\x01\n",
  45. "\x03\n ",
  46. "\x05\n ",
  47. "\x07\n ",
  48. "\x09\n ",
  49. "\x0b\n ",
  50. "\x0d\n ",
  51. "\x0f\n "
  52. };
  53. Encoder* enc_new(ErlNifEnv* env);
  54. int enc_init(Encoder* e, ErlNifEnv* env);
  55. ERL_NIF_TERM enc_error(Encoder* e, const char* msg);
  56. ERL_NIF_TERM enc_obj_error(Encoder* e, const char* msg, ERL_NIF_TERM obj);
  57. int enc_result(Encoder* e, ERL_NIF_TERM* value);
  58. int enc_done(Encoder* e, ERL_NIF_TERM* value);
  59. #if MAP_TYPE_PRESENT
  60. int enc_map_to_ejson(ErlNifEnv* env, ERL_NIF_TERM map, ERL_NIF_TERM* out);
  61. #endif
  62. Encoder*
  63. enc_new(ErlNifEnv* env)
  64. {
  65. jiffy_st* st = (jiffy_st*) enif_priv_data(env);
  66. Encoder* e = enif_alloc_resource(st->res_enc, sizeof(Encoder));
  67. e->atoms = st;
  68. e->bytes_per_red = DEFAULT_BYTES_PER_REDUCTION;
  69. e->uescape = 0;
  70. e->pretty = 0;
  71. e->use_nil = 0;
  72. e->escape_forward_slashes = 0;
  73. e->shiftcnt = 0;
  74. e->count = 0;
  75. e->iolen = 0;
  76. e->iosize = 0;
  77. e->curr = &(e->bin);
  78. if(!enif_alloc_binary(BIN_INC_SIZE, e->curr)) {
  79. e->curr = NULL;
  80. enif_release_resource(e);
  81. return NULL;
  82. }
  83. memset(e->curr->data, 0, e->curr->size);
  84. e->p = (char*) e->curr->data;
  85. e->u = (unsigned char*) e->curr->data;
  86. e->i = 0;
  87. return e;
  88. }
  89. int
  90. enc_init(Encoder* e, ErlNifEnv* env)
  91. {
  92. e->env = env;
  93. return 1;
  94. }
  95. void
  96. enc_destroy(ErlNifEnv* env, void* obj)
  97. {
  98. Encoder* e = (Encoder*) obj;
  99. if(e->curr != NULL) {
  100. enif_release_binary(e->curr);
  101. }
  102. }
  103. ERL_NIF_TERM
  104. enc_error(Encoder* e, const char* msg)
  105. {
  106. //assert(0 && msg);
  107. return make_error(e->atoms, e->env, msg);
  108. }
  109. ERL_NIF_TERM
  110. enc_obj_error(Encoder* e, const char* msg, ERL_NIF_TERM obj)
  111. {
  112. return make_obj_error(e->atoms, e->env, msg, obj);
  113. }
  114. static inline int
  115. enc_ensure(Encoder* e, size_t req)
  116. {
  117. size_t need = e->curr->size;
  118. while(req >= (need - e->i)) need <<= 1;
  119. if(need != e->curr->size) {
  120. if(!enif_realloc_binary(e->curr, need)) {
  121. return 0;
  122. }
  123. e->p = (char*) e->curr->data;
  124. e->u = (unsigned char*) e->curr->data;
  125. }
  126. return 1;
  127. }
  128. int
  129. enc_result(Encoder* e, ERL_NIF_TERM* value)
  130. {
  131. if(e->i != e->curr->size) {
  132. if(!enif_realloc_binary(e->curr, e->i)) {
  133. return 0;
  134. }
  135. }
  136. *value = enif_make_binary(e->env, e->curr);
  137. e->curr = NULL;
  138. return 1;
  139. }
  140. int
  141. enc_done(Encoder* e, ERL_NIF_TERM* value)
  142. {
  143. ERL_NIF_TERM last;
  144. if(e->iolen == 0) {
  145. return enc_result(e, value);
  146. }
  147. if(e->i > 0 ) {
  148. if(!enc_result(e, &last)) {
  149. return 0;
  150. }
  151. e->iolist = enif_make_list_cell(e->env, last, e->iolist);
  152. e->iolen++;
  153. }
  154. *value = e->iolist;
  155. return 1;
  156. }
  157. static inline int
  158. enc_unknown(Encoder* e, ERL_NIF_TERM value)
  159. {
  160. ErlNifBinary* bin = e->curr;
  161. ERL_NIF_TERM curr;
  162. if(e->i > 0) {
  163. if(!enc_result(e, &curr)) {
  164. return 0;
  165. }
  166. e->iolist = enif_make_list_cell(e->env, curr, e->iolist);
  167. e->iolen++;
  168. }
  169. e->iolist = enif_make_list_cell(e->env, value, e->iolist);
  170. e->iolen++;
  171. // Track the total number of bytes produced before
  172. // splitting our IO buffer. We add 16 to this value
  173. // as a rough estimate of the number of bytes that
  174. // a bignum might produce when encoded.
  175. e->iosize += e->i + 16;
  176. // Reinitialize our binary for the next buffer if we
  177. // used any data in the buffer. If we haven't used any
  178. // bytes in the buffer then we can safely reuse it
  179. // for anything following the unknown value.
  180. if(e->i > 0) {
  181. e->curr = bin;
  182. if(!enif_alloc_binary(BIN_INC_SIZE, e->curr)) {
  183. return 0;
  184. }
  185. memset(e->curr->data, 0, e->curr->size);
  186. e->p = (char*) e->curr->data;
  187. e->u = (unsigned char*) e->curr->data;
  188. e->i = 0;
  189. }
  190. return 1;
  191. }
  192. static inline int
  193. enc_literal(Encoder* e, const char* literal, size_t len)
  194. {
  195. if(!enc_ensure(e, len)) {
  196. return 0;
  197. }
  198. memcpy(&(e->p[e->i]), literal, len);
  199. e->i += len;
  200. e->count++;
  201. return 1;
  202. }
  203. static inline int
  204. enc_string(Encoder* e, ERL_NIF_TERM val)
  205. {
  206. ErlNifBinary bin;
  207. char atom[512];
  208. unsigned char* data;
  209. size_t size;
  210. int esc_extra = 0;
  211. int ulen;
  212. int uval;
  213. int i;
  214. if(enif_is_binary(e->env, val)) {
  215. if(!enif_inspect_binary(e->env, val, &bin)) {
  216. return 0;
  217. }
  218. data = bin.data;
  219. size = bin.size;
  220. } else if(enif_is_atom(e->env, val)) {
  221. if(!enif_get_atom(e->env, val, atom, 512, ERL_NIF_LATIN1)) {
  222. return 0;
  223. }
  224. data = (unsigned char*) atom;
  225. size = strlen(atom);
  226. } else {
  227. return 0;
  228. }
  229. i = 0;
  230. while(i < size) {
  231. switch((char) data[i]) {
  232. case '\"':
  233. case '\\':
  234. case '\b':
  235. case '\f':
  236. case '\n':
  237. case '\r':
  238. case '\t':
  239. esc_extra += 1;
  240. i++;
  241. continue;
  242. case '/':
  243. if(e->escape_forward_slashes) {
  244. esc_extra += 1;
  245. i++;
  246. continue;
  247. }
  248. default:
  249. if(data[i] < 0x20) {
  250. esc_extra += 5;
  251. i++;
  252. continue;
  253. } else if(data[i] < 0x80) {
  254. i++;
  255. continue;
  256. }
  257. ulen = utf8_validate(&(data[i]), size - i);
  258. if(ulen < 0) {
  259. return 0;
  260. }
  261. if(e->uescape) {
  262. uval = utf8_to_unicode(&(data[i]), ulen);
  263. if(uval < 0) {
  264. return 0;
  265. }
  266. esc_extra += utf8_esc_len(uval);
  267. if(ulen < 0) {
  268. return 0;
  269. }
  270. }
  271. i += ulen;
  272. }
  273. }
  274. if(!enc_ensure(e, size + esc_extra + 2)) {
  275. return 0;
  276. }
  277. e->p[e->i++] = '\"';
  278. i = 0;
  279. while(i < size) {
  280. switch((char) data[i]) {
  281. case '\"':
  282. case '\\':
  283. e->p[e->i++] = '\\';
  284. e->u[e->i++] = data[i];
  285. i++;
  286. continue;
  287. case '\b':
  288. e->p[e->i++] = '\\';
  289. e->p[e->i++] = 'b';
  290. i++;
  291. continue;
  292. case '\f':
  293. e->p[e->i++] = '\\';
  294. e->p[e->i++] = 'f';
  295. i++;
  296. continue;
  297. case '\n':
  298. e->p[e->i++] = '\\';
  299. e->p[e->i++] = 'n';
  300. i++;
  301. continue;
  302. case '\r':
  303. e->p[e->i++] = '\\';
  304. e->p[e->i++] = 'r';
  305. i++;
  306. continue;
  307. case '\t':
  308. e->p[e->i++] = '\\';
  309. e->p[e->i++] = 't';
  310. i++;
  311. continue;
  312. case '/':
  313. if(e->escape_forward_slashes) {
  314. e->p[e->i++] = '\\';
  315. e->u[e->i++] = data[i];
  316. i++;
  317. continue;
  318. }
  319. default:
  320. if(data[i] < 0x20) {
  321. ulen = unicode_uescape(data[i], &(e->p[e->i]));
  322. if(ulen < 0) {
  323. return 0;
  324. }
  325. e->i += ulen;
  326. i++;
  327. } else if((data[i] & 0x80) && e->uescape) {
  328. uval = utf8_to_unicode(&(data[i]), size-i);
  329. if(uval < 0) {
  330. return 0;
  331. }
  332. ulen = unicode_uescape(uval, &(e->p[e->i]));
  333. if(ulen < 0) {
  334. return 0;
  335. }
  336. e->i += ulen;
  337. ulen = utf8_len(uval);
  338. if(ulen < 0) {
  339. return 0;
  340. }
  341. i += ulen;
  342. } else {
  343. e->u[e->i++] = data[i++];
  344. }
  345. }
  346. }
  347. e->p[e->i++] = '\"';
  348. e->count++;
  349. return 1;
  350. }
  351. static inline int
  352. enc_long(Encoder* e, ErlNifSInt64 val)
  353. {
  354. if(!enc_ensure(e, 32)) {
  355. return 0;
  356. }
  357. #if (defined(__WIN32__) || defined(_WIN32) || defined(_WIN32_))
  358. snprintf(&(e->p[e->i]), 32, "%ld", val);
  359. #elif SIZEOF_LONG == 8
  360. snprintf(&(e->p[e->i]), 32, "%ld", val);
  361. #else
  362. snprintf(&(e->p[e->i]), 32, "%lld", val);
  363. #endif
  364. e->i += strlen(&(e->p[e->i]));
  365. e->count++;
  366. return 1;
  367. }
  368. static inline int
  369. enc_double(Encoder* e, double val)
  370. {
  371. char* start;
  372. size_t len;
  373. if(!enc_ensure(e, 32)) {
  374. return 0;
  375. }
  376. start = &(e->p[e->i]);
  377. if(!double_to_shortest(start, e->curr->size, &len, val)) {
  378. return 0;
  379. }
  380. e->i += len;
  381. e->count++;
  382. return 1;
  383. }
  384. static inline int
  385. enc_char(Encoder* e, char c)
  386. {
  387. if(!enc_ensure(e, 1)) {
  388. return 0;
  389. }
  390. e->p[e->i++] = c;
  391. return 1;
  392. }
  393. static int
  394. enc_shift(Encoder* e) {
  395. int i;
  396. char* shift;
  397. assert(e->shiftcnt >= 0 && "Invalid shift count.");
  398. shift = shifts[MIN(e->shiftcnt, NUM_SHIFTS-1)];
  399. if(!enc_literal(e, shift + 1, *shift))
  400. return 0;
  401. // Finish the rest of this shift it's it bigger than
  402. // our largest predefined constant.
  403. for(i = NUM_SHIFTS - 1; i < e->shiftcnt; i++) {
  404. if(!enc_literal(e, " ", 2))
  405. return 0;
  406. }
  407. return 1;
  408. }
  409. static inline int
  410. enc_start_object(Encoder* e)
  411. {
  412. e->count++;
  413. e->shiftcnt++;
  414. if(!enc_char(e, '{'))
  415. return 0;
  416. MAYBE_PRETTY(e);
  417. return 1;
  418. }
  419. static inline int
  420. enc_end_object(Encoder* e)
  421. {
  422. e->shiftcnt--;
  423. MAYBE_PRETTY(e);
  424. return enc_char(e, '}');
  425. }
  426. static inline int
  427. enc_start_array(Encoder* e)
  428. {
  429. e->count++;
  430. e->shiftcnt++;
  431. if(!enc_char(e, '['))
  432. return 0;
  433. MAYBE_PRETTY(e);
  434. return 1;
  435. }
  436. static inline int
  437. enc_end_array(Encoder* e)
  438. {
  439. e->shiftcnt--;
  440. MAYBE_PRETTY(e);
  441. return enc_char(e, ']');
  442. }
  443. static inline int
  444. enc_colon(Encoder* e)
  445. {
  446. if(e->pretty)
  447. return enc_literal(e, " : ", 3);
  448. return enc_char(e, ':');
  449. }
  450. static inline int
  451. enc_comma(Encoder* e)
  452. {
  453. if(!enc_char(e, ','))
  454. return 0;
  455. MAYBE_PRETTY(e);
  456. return 1;
  457. }
  458. #if MAP_TYPE_PRESENT
  459. int
  460. enc_map_to_ejson(ErlNifEnv* env, ERL_NIF_TERM map, ERL_NIF_TERM* out)
  461. {
  462. ErlNifMapIterator iter;
  463. size_t size;
  464. ERL_NIF_TERM list;
  465. ERL_NIF_TERM tuple;
  466. ERL_NIF_TERM key;
  467. ERL_NIF_TERM val;
  468. if(!enif_get_map_size(env, map, &size)) {
  469. fprintf(stderr, "bad map size\r\n");
  470. return 0;
  471. }
  472. list = enif_make_list(env, 0);
  473. if(size == 0) {
  474. *out = enif_make_tuple1(env, list);
  475. return 1;
  476. }
  477. if(!enif_map_iterator_create(env, map, &iter, ERL_NIF_MAP_ITERATOR_HEAD)) {
  478. fprintf(stderr, "bad iterator create\r\n");
  479. return 0;
  480. }
  481. do {
  482. if(!enif_map_iterator_get_pair(env, &iter, &key, &val)) {
  483. fprintf(stderr, "bad get pair\r\n");
  484. return 0;
  485. }
  486. tuple = enif_make_tuple2(env, key, val);
  487. list = enif_make_list_cell(env, tuple, list);
  488. } while(enif_map_iterator_next(env, &iter));
  489. *out = enif_make_tuple1(env, list);
  490. return 1;
  491. }
  492. #endif
  493. ERL_NIF_TERM
  494. encode_init(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
  495. {
  496. jiffy_st* st = (jiffy_st*) enif_priv_data(env);
  497. Encoder* e;
  498. ERL_NIF_TERM opts;
  499. ERL_NIF_TERM val;
  500. ERL_NIF_TERM tmp_argv[3];
  501. if(argc != 2) {
  502. return enif_make_badarg(env);
  503. }
  504. e = enc_new(env);
  505. if(e == NULL) {
  506. return make_error(st, env, "internal_error");
  507. }
  508. tmp_argv[0] = enif_make_resource(env, e);
  509. tmp_argv[1] = enif_make_list(env, 1, argv[0]);
  510. tmp_argv[2] = enif_make_list(env, 0);
  511. enif_release_resource(e);
  512. opts = argv[1];
  513. if(!enif_is_list(env, opts)) {
  514. return enif_make_badarg(env);
  515. }
  516. while(enif_get_list_cell(env, opts, &val, &opts)) {
  517. if(enif_compare(val, e->atoms->atom_uescape) == 0) {
  518. e->uescape = 1;
  519. } else if(enif_compare(val, e->atoms->atom_pretty) == 0) {
  520. e->pretty = 1;
  521. } else if(enif_compare(val, e->atoms->atom_escape_forward_slashes) == 0) {
  522. e->escape_forward_slashes = 1;
  523. } else if(enif_compare(val, e->atoms->atom_use_nil) == 0) {
  524. e->use_nil = 1;
  525. } else if(enif_compare(val, e->atoms->atom_force_utf8) == 0) {
  526. // Ignore, handled in Erlang
  527. } else if(get_bytes_per_iter(env, val, &(e->bytes_per_red))) {
  528. continue;
  529. } else if(get_bytes_per_red(env, val, &(e->bytes_per_red))) {
  530. continue;
  531. } else {
  532. return enif_make_badarg(env);
  533. }
  534. }
  535. return encode_iter(env, 3, tmp_argv);
  536. }
  537. ERL_NIF_TERM
  538. encode_iter(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
  539. {
  540. Encoder* e;
  541. jiffy_st* st = (jiffy_st*) enif_priv_data(env);
  542. ERL_NIF_TERM ret = 0;
  543. ERL_NIF_TERM stack;
  544. ERL_NIF_TERM curr;
  545. ERL_NIF_TERM item;
  546. const ERL_NIF_TERM* tuple;
  547. int arity;
  548. ErlNifSInt64 lval;
  549. double dval;
  550. size_t start;
  551. size_t bytes_written = 0;
  552. if(argc != 3) {
  553. return enif_make_badarg(env);
  554. } else if(!enif_get_resource(env, argv[0], st->res_enc, (void**) &e)) {
  555. return enif_make_badarg(env);
  556. } else if(!enif_is_list(env, argv[1])) {
  557. return enif_make_badarg(env);
  558. } else if(!enif_is_list(env, argv[2])) {
  559. return enif_make_badarg(env);
  560. }
  561. if(!enc_init(e, env)) {
  562. return enif_make_badarg(env);
  563. }
  564. stack = argv[1];
  565. e->iolist = argv[2];
  566. start = e->iosize + e->i;
  567. while(!enif_is_empty_list(env, stack)) {
  568. bytes_written += (e->iosize + e->i) - start;
  569. if(should_yield(env, &bytes_written, e->bytes_per_red)) {
  570. return enif_make_tuple4(
  571. env,
  572. st->atom_iter,
  573. argv[0],
  574. stack,
  575. e->iolist
  576. );
  577. }
  578. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  579. ret = enc_error(e, "internal_error");
  580. goto done;
  581. }
  582. if(enif_is_identical(curr, e->atoms->ref_object)) {
  583. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  584. ret = enc_error(e, "internal_error");
  585. goto done;
  586. }
  587. if(enif_is_empty_list(env, curr)) {
  588. if(!enc_end_object(e)) {
  589. ret = enc_error(e, "internal_error");
  590. goto done;
  591. }
  592. continue;
  593. }
  594. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  595. ret = enc_error(e, "internal_error");
  596. goto done;
  597. }
  598. if(!enif_get_tuple(env, item, &arity, &tuple)) {
  599. ret = enc_obj_error(e, "invalid_object_member", item);
  600. goto done;
  601. }
  602. if(arity != 2) {
  603. ret = enc_obj_error(e, "invalid_object_member_arity", item);
  604. goto done;
  605. }
  606. if(!enc_comma(e)) {
  607. ret = enc_error(e, "internal_error");
  608. goto done;
  609. }
  610. if(!enc_string(e, tuple[0])) {
  611. ret = enc_obj_error(e, "invalid_object_member_key", tuple[0]);
  612. goto done;
  613. }
  614. if(!enc_colon(e)) {
  615. ret = enc_error(e, "internal_error");
  616. goto done;
  617. }
  618. stack = enif_make_list_cell(env, curr, stack);
  619. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  620. stack = enif_make_list_cell(env, tuple[1], stack);
  621. } else if(enif_is_identical(curr, e->atoms->ref_array)) {
  622. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  623. ret = enc_error(e, "internal_error");
  624. goto done;
  625. }
  626. if(enif_is_empty_list(env, curr)) {
  627. if(!enc_end_array(e)) {
  628. ret = enc_error(e, "internal_error");
  629. goto done;
  630. }
  631. continue;
  632. }
  633. if(!enc_comma(e)) {
  634. ret = enc_error(e, "internal_error");
  635. goto done;
  636. }
  637. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  638. ret = enc_error(e, "internal_error");
  639. goto done;
  640. }
  641. stack = enif_make_list_cell(env, curr, stack);
  642. stack = enif_make_list_cell(env, e->atoms->ref_array, stack);
  643. stack = enif_make_list_cell(env, item, stack);
  644. } else if(enif_compare(curr, e->atoms->atom_null) == 0) {
  645. if(!enc_literal(e, "null", 4)) {
  646. ret = enc_error(e, "null");
  647. goto done;
  648. }
  649. } else if(e->use_nil && enif_compare(curr, e->atoms->atom_nil) == 0) {
  650. if(!enc_literal(e, "null", 4)) {
  651. ret = enc_error(e, "null");
  652. goto done;
  653. }
  654. } else if(enif_compare(curr, e->atoms->atom_true) == 0) {
  655. if(!enc_literal(e, "true", 4)) {
  656. ret = enc_error(e, "true");
  657. goto done;
  658. }
  659. } else if(enif_compare(curr, e->atoms->atom_false) == 0) {
  660. if(!enc_literal(e, "false", 5)) {
  661. ret = enc_error(e, "false");
  662. goto done;
  663. }
  664. } else if(enif_is_binary(env, curr)) {
  665. if(!enc_string(e, curr)) {
  666. ret = enc_obj_error(e, "invalid_string", curr);
  667. goto done;
  668. }
  669. } else if(enif_is_atom(env, curr)) {
  670. if(!enc_string(e, curr)) {
  671. ret = enc_obj_error(e, "invalid_string", curr);
  672. goto done;
  673. }
  674. } else if(enif_get_int64(env, curr, &lval)) {
  675. if(!enc_long(e, lval)) {
  676. ret = enc_error(e, "internal_error");
  677. goto done;
  678. }
  679. } else if(enif_get_double(env, curr, &dval)) {
  680. if(!enc_double(e, dval)) {
  681. ret = enc_error(e, "internal_error");
  682. goto done;
  683. }
  684. } else if(enif_get_tuple(env, curr, &arity, &tuple)) {
  685. if(arity != 1) {
  686. ret = enc_obj_error(e, "invalid_ejson", curr);
  687. goto done;
  688. }
  689. if(!enif_is_list(env, tuple[0])) {
  690. ret = enc_obj_error(e, "invalid_object", curr);
  691. goto done;
  692. }
  693. if(!enc_start_object(e)) {
  694. ret = enc_error(e, "internal_error");
  695. goto done;
  696. }
  697. if(enif_is_empty_list(env, tuple[0])) {
  698. if(!enc_end_object(e)) {
  699. ret = enc_error(e, "internal_error");
  700. goto done;
  701. }
  702. continue;
  703. }
  704. if(!enif_get_list_cell(env, tuple[0], &item, &curr)) {
  705. ret = enc_error(e, "internal_error");
  706. goto done;
  707. }
  708. if(!enif_get_tuple(env, item, &arity, &tuple)) {
  709. ret = enc_obj_error(e, "invalid_object_member", item);
  710. goto done;
  711. }
  712. if(arity != 2) {
  713. ret = enc_obj_error(e, "invalid_object_member_arity", item);
  714. goto done;
  715. }
  716. if(!enc_string(e, tuple[0])) {
  717. ret = enc_obj_error(e, "invalid_object_member_key", tuple[0]);
  718. goto done;
  719. }
  720. if(!enc_colon(e)) {
  721. ret = enc_error(e, "internal_error");
  722. goto done;
  723. }
  724. stack = enif_make_list_cell(env, curr, stack);
  725. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  726. stack = enif_make_list_cell(env, tuple[1], stack);
  727. #if MAP_TYPE_PRESENT
  728. } else if(enif_is_map(env, curr)) {
  729. if(!enc_map_to_ejson(env, curr, &curr)) {
  730. ret = enc_error(e, "internal_error");
  731. goto done;
  732. }
  733. stack = enif_make_list_cell(env, curr, stack);
  734. #endif
  735. } else if(enif_is_list(env, curr)) {
  736. if(!enc_start_array(e)) {
  737. ret = enc_error(e, "internal_error");
  738. goto done;
  739. }
  740. if(enif_is_empty_list(env, curr)) {
  741. if(!enc_end_array(e)) {
  742. ret = enc_error(e, "internal_error");
  743. goto done;
  744. }
  745. continue;
  746. }
  747. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  748. ret = enc_error(e, "internal_error");
  749. goto done;
  750. }
  751. stack = enif_make_list_cell(env, curr, stack);
  752. stack = enif_make_list_cell(env, e->atoms->ref_array, stack);
  753. stack = enif_make_list_cell(env, item, stack);
  754. } else {
  755. if(!enc_unknown(e, curr)) {
  756. ret = enc_error(e, "internal_error");
  757. goto done;
  758. }
  759. }
  760. }
  761. if(!enc_done(e, &item)) {
  762. ret = enc_error(e, "internal_error");
  763. goto done;
  764. }
  765. if(e->iolen == 0) {
  766. ret = item;
  767. } else {
  768. ret = enif_make_tuple2(env, e->atoms->atom_partial, item);
  769. }
  770. done:
  771. return ret;
  772. }