Вы не можете выбрать более 25 тем Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.

874 строки
22 KiB

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