Ви не можете вибрати більше 25 тем Теми мають розпочинатися з літери або цифри, можуть містити дефіси (-) і не повинні перевищувати 35 символів.

877 рядки
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);
  258. if(ulen < 0) {
  259. return 0;
  260. }
  261. }
  262. i += ulen;
  263. }
  264. }
  265. if(!enc_ensure(e, size + esc_extra + 2)) {
  266. return 0;
  267. }
  268. e->p[e->i++] = '\"';
  269. i = 0;
  270. while(i < size) {
  271. switch((char) data[i]) {
  272. case '\"':
  273. case '\\':
  274. e->p[e->i++] = '\\';
  275. e->u[e->i++] = data[i];
  276. i++;
  277. continue;
  278. case '\b':
  279. e->p[e->i++] = '\\';
  280. e->p[e->i++] = 'b';
  281. i++;
  282. continue;
  283. case '\f':
  284. e->p[e->i++] = '\\';
  285. e->p[e->i++] = 'f';
  286. i++;
  287. continue;
  288. case '\n':
  289. e->p[e->i++] = '\\';
  290. e->p[e->i++] = 'n';
  291. i++;
  292. continue;
  293. case '\r':
  294. e->p[e->i++] = '\\';
  295. e->p[e->i++] = 'r';
  296. i++;
  297. continue;
  298. case '\t':
  299. e->p[e->i++] = '\\';
  300. e->p[e->i++] = 't';
  301. i++;
  302. continue;
  303. case '/':
  304. if(e->escape_forward_slashes) {
  305. e->p[e->i++] = '\\';
  306. e->u[e->i++] = data[i];
  307. i++;
  308. continue;
  309. }
  310. default:
  311. if(data[i] < 0x20) {
  312. ulen = unicode_uescape(data[i], &(e->p[e->i]));
  313. if(ulen < 0) {
  314. return 0;
  315. }
  316. e->i += ulen;
  317. i++;
  318. } else if((data[i] & 0x80) && e->uescape) {
  319. uval = utf8_to_unicode(&(data[i]), size-i);
  320. if(uval < 0) {
  321. return 0;
  322. }
  323. ulen = unicode_uescape(uval, &(e->p[e->i]));
  324. if(ulen < 0) {
  325. return 0;
  326. }
  327. e->i += ulen;
  328. ulen = utf8_len(uval);
  329. if(ulen < 0) {
  330. return 0;
  331. }
  332. i += ulen;
  333. } else {
  334. e->u[e->i++] = data[i++];
  335. }
  336. }
  337. }
  338. e->p[e->i++] = '\"';
  339. e->count++;
  340. return 1;
  341. }
  342. static inline int
  343. enc_long(Encoder* e, ErlNifSInt64 val)
  344. {
  345. if(!enc_ensure(e, 32)) {
  346. return 0;
  347. }
  348. #if (defined(__WIN32__) || defined(_WIN32) || defined(_WIN32_))
  349. snprintf(&(e->p[e->i]), 32, "%ld", val);
  350. #elif SIZEOF_LONG == 8
  351. snprintf(&(e->p[e->i]), 32, "%ld", val);
  352. #else
  353. snprintf(&(e->p[e->i]), 32, "%lld", val);
  354. #endif
  355. e->i += strlen(&(e->p[e->i]));
  356. e->count++;
  357. return 1;
  358. }
  359. static inline int
  360. enc_double(Encoder* e, double val)
  361. {
  362. char* start;
  363. size_t len;
  364. if(!enc_ensure(e, 32)) {
  365. return 0;
  366. }
  367. start = &(e->p[e->i]);
  368. if(!double_to_shortest(start, e->curr->size, &len, val)) {
  369. return 0;
  370. }
  371. e->i += len;
  372. e->count++;
  373. return 1;
  374. }
  375. static inline int
  376. enc_char(Encoder* e, char c)
  377. {
  378. if(!enc_ensure(e, 1)) {
  379. return 0;
  380. }
  381. e->p[e->i++] = c;
  382. return 1;
  383. }
  384. static int
  385. enc_shift(Encoder* e) {
  386. int i;
  387. char* shift;
  388. assert(e->shiftcnt >= 0 && "Invalid shift count.");
  389. shift = shifts[MIN(e->shiftcnt, NUM_SHIFTS-1)];
  390. if(!enc_literal(e, shift + 1, *shift))
  391. return 0;
  392. // Finish the rest of this shift it's it bigger than
  393. // our largest predefined constant.
  394. for(i = NUM_SHIFTS - 1; i < e->shiftcnt; i++) {
  395. if(!enc_literal(e, " ", 2))
  396. return 0;
  397. }
  398. return 1;
  399. }
  400. static inline int
  401. enc_start_object(Encoder* e)
  402. {
  403. e->count++;
  404. e->shiftcnt++;
  405. if(!enc_char(e, '{'))
  406. return 0;
  407. MAYBE_PRETTY(e);
  408. return 1;
  409. }
  410. static inline int
  411. enc_end_object(Encoder* e)
  412. {
  413. e->shiftcnt--;
  414. MAYBE_PRETTY(e);
  415. return enc_char(e, '}');
  416. }
  417. static inline int
  418. enc_start_array(Encoder* e)
  419. {
  420. e->count++;
  421. e->shiftcnt++;
  422. if(!enc_char(e, '['))
  423. return 0;
  424. MAYBE_PRETTY(e);
  425. return 1;
  426. }
  427. static inline int
  428. enc_end_array(Encoder* e)
  429. {
  430. e->shiftcnt--;
  431. MAYBE_PRETTY(e);
  432. return enc_char(e, ']');
  433. }
  434. static inline int
  435. enc_colon(Encoder* e)
  436. {
  437. if(e->pretty)
  438. return enc_literal(e, " : ", 3);
  439. return enc_char(e, ':');
  440. }
  441. static inline int
  442. enc_comma(Encoder* e)
  443. {
  444. if(!enc_char(e, ','))
  445. return 0;
  446. MAYBE_PRETTY(e);
  447. return 1;
  448. }
  449. #if MAP_TYPE_PRESENT
  450. int
  451. enc_map_to_ejson(ErlNifEnv* env, ERL_NIF_TERM map, ERL_NIF_TERM* out)
  452. {
  453. ErlNifMapIterator iter;
  454. size_t size;
  455. ERL_NIF_TERM list;
  456. ERL_NIF_TERM tuple;
  457. ERL_NIF_TERM key;
  458. ERL_NIF_TERM val;
  459. if(!enif_get_map_size(env, map, &size)) {
  460. return 0;
  461. }
  462. list = enif_make_list(env, 0);
  463. if(size == 0) {
  464. *out = enif_make_tuple1(env, list);
  465. return 1;
  466. }
  467. if(!enif_map_iterator_create(env, map, &iter, ERL_NIF_MAP_ITERATOR_HEAD)) {
  468. return 0;
  469. }
  470. do {
  471. if(!enif_map_iterator_get_pair(env, &iter, &key, &val)) {
  472. enif_map_iterator_destroy(env, &iter);
  473. return 0;
  474. }
  475. tuple = enif_make_tuple2(env, key, val);
  476. list = enif_make_list_cell(env, tuple, list);
  477. } while(enif_map_iterator_next(env, &iter));
  478. enif_map_iterator_destroy(env, &iter);
  479. *out = enif_make_tuple1(env, list);
  480. return 1;
  481. }
  482. #endif
  483. ERL_NIF_TERM
  484. encode_init(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
  485. {
  486. jiffy_st* st = (jiffy_st*) enif_priv_data(env);
  487. Encoder* e;
  488. ERL_NIF_TERM opts;
  489. ERL_NIF_TERM val;
  490. ERL_NIF_TERM tmp_argv[3];
  491. if(argc != 2) {
  492. return enif_make_badarg(env);
  493. }
  494. e = enc_new(env);
  495. if(e == NULL) {
  496. return make_error(st, env, "internal_error");
  497. }
  498. tmp_argv[0] = enif_make_resource(env, e);
  499. tmp_argv[1] = enif_make_list(env, 1, argv[0]);
  500. tmp_argv[2] = enif_make_list(env, 0);
  501. enif_release_resource(e);
  502. opts = argv[1];
  503. if(!enif_is_list(env, opts)) {
  504. return enif_make_badarg(env);
  505. }
  506. while(enif_get_list_cell(env, opts, &val, &opts)) {
  507. if(enif_compare(val, e->atoms->atom_uescape) == 0) {
  508. e->uescape = 1;
  509. } else if(enif_compare(val, e->atoms->atom_pretty) == 0) {
  510. e->pretty = 1;
  511. } else if(enif_compare(val, e->atoms->atom_escape_forward_slashes) == 0) {
  512. e->escape_forward_slashes = 1;
  513. } else if(enif_compare(val, e->atoms->atom_use_nil) == 0) {
  514. e->use_nil = 1;
  515. } else if(enif_compare(val, e->atoms->atom_force_utf8) == 0) {
  516. // Ignore, handled in Erlang
  517. } else if(get_bytes_per_iter(env, val, &(e->bytes_per_red))) {
  518. continue;
  519. } else if(get_bytes_per_red(env, val, &(e->bytes_per_red))) {
  520. continue;
  521. } else {
  522. return enif_make_badarg(env);
  523. }
  524. }
  525. return encode_iter(env, 3, tmp_argv);
  526. }
  527. ERL_NIF_TERM
  528. encode_iter(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
  529. {
  530. Encoder* e;
  531. jiffy_st* st = (jiffy_st*) enif_priv_data(env);
  532. ERL_NIF_TERM ret = 0;
  533. ERL_NIF_TERM stack;
  534. ERL_NIF_TERM curr;
  535. ERL_NIF_TERM item;
  536. const ERL_NIF_TERM* tuple;
  537. int arity;
  538. ErlNifSInt64 lval;
  539. double dval;
  540. size_t start;
  541. size_t bytes_written = 0;
  542. if(argc != 3) {
  543. return enif_make_badarg(env);
  544. } else if(!enif_get_resource(env, argv[0], st->res_enc, (void**) &e)) {
  545. return enif_make_badarg(env);
  546. } else if(!enif_is_list(env, argv[1])) {
  547. return enif_make_badarg(env);
  548. } else if(!enif_is_list(env, argv[2])) {
  549. return enif_make_badarg(env);
  550. }
  551. if(!enc_init(e, env)) {
  552. return enif_make_badarg(env);
  553. }
  554. stack = argv[1];
  555. e->iolist = argv[2];
  556. start = e->iosize + e->i;
  557. while(!enif_is_empty_list(env, stack)) {
  558. bytes_written += (e->iosize + e->i) - start;
  559. if(should_yield(env, &bytes_written, e->bytes_per_red)) {
  560. return enif_make_tuple4(
  561. env,
  562. st->atom_iter,
  563. argv[0],
  564. stack,
  565. e->iolist
  566. );
  567. }
  568. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  569. ret = enc_error(e, "internal_error");
  570. goto done;
  571. }
  572. if(enif_is_identical(curr, e->atoms->ref_object)) {
  573. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  574. ret = enc_error(e, "internal_error");
  575. goto done;
  576. }
  577. if(enif_is_empty_list(env, curr)) {
  578. if(!enc_end_object(e)) {
  579. ret = enc_error(e, "internal_error");
  580. goto done;
  581. }
  582. continue;
  583. }
  584. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  585. ret = enc_error(e, "internal_error");
  586. goto done;
  587. }
  588. if(!enif_get_tuple(env, item, &arity, &tuple)) {
  589. ret = enc_obj_error(e, "invalid_object_member", item);
  590. goto done;
  591. }
  592. if(arity != 2) {
  593. ret = enc_obj_error(e, "invalid_object_member_arity", item);
  594. goto done;
  595. }
  596. if(!enc_comma(e)) {
  597. ret = enc_error(e, "internal_error");
  598. goto done;
  599. }
  600. if(!enc_string(e, tuple[0])) {
  601. ret = enc_obj_error(e, "invalid_object_member_key", tuple[0]);
  602. goto done;
  603. }
  604. if(!enc_colon(e)) {
  605. ret = enc_error(e, "internal_error");
  606. goto done;
  607. }
  608. stack = enif_make_list_cell(env, curr, stack);
  609. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  610. stack = enif_make_list_cell(env, tuple[1], stack);
  611. } else if(enif_is_identical(curr, e->atoms->ref_array)) {
  612. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  613. ret = enc_error(e, "internal_error");
  614. goto done;
  615. }
  616. if(enif_is_empty_list(env, curr)) {
  617. if(!enc_end_array(e)) {
  618. ret = enc_error(e, "internal_error");
  619. goto done;
  620. }
  621. continue;
  622. }
  623. if(!enc_comma(e)) {
  624. ret = enc_error(e, "internal_error");
  625. goto done;
  626. }
  627. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  628. ret = enc_error(e, "internal_error");
  629. goto done;
  630. }
  631. stack = enif_make_list_cell(env, curr, stack);
  632. stack = enif_make_list_cell(env, e->atoms->ref_array, stack);
  633. stack = enif_make_list_cell(env, item, stack);
  634. } else if(enif_compare(curr, e->atoms->atom_null) == 0) {
  635. if(!enc_literal(e, "null", 4)) {
  636. ret = enc_error(e, "null");
  637. goto done;
  638. }
  639. } else if(e->use_nil && enif_compare(curr, e->atoms->atom_nil) == 0) {
  640. if(!enc_literal(e, "null", 4)) {
  641. ret = enc_error(e, "null");
  642. goto done;
  643. }
  644. } else if(enif_compare(curr, e->atoms->atom_true) == 0) {
  645. if(!enc_literal(e, "true", 4)) {
  646. ret = enc_error(e, "true");
  647. goto done;
  648. }
  649. } else if(enif_compare(curr, e->atoms->atom_false) == 0) {
  650. if(!enc_literal(e, "false", 5)) {
  651. ret = enc_error(e, "false");
  652. goto done;
  653. }
  654. } else if(enif_is_binary(env, curr)) {
  655. if(!enc_string(e, curr)) {
  656. ret = enc_obj_error(e, "invalid_string", curr);
  657. goto done;
  658. }
  659. } else if(enif_is_atom(env, curr)) {
  660. if(!enc_string(e, curr)) {
  661. ret = enc_obj_error(e, "invalid_string", curr);
  662. goto done;
  663. }
  664. } else if(enif_get_int64(env, curr, &lval)) {
  665. if(!enc_long(e, lval)) {
  666. ret = enc_error(e, "internal_error");
  667. goto done;
  668. }
  669. } else if(enif_get_double(env, curr, &dval)) {
  670. if(!enc_double(e, dval)) {
  671. ret = enc_error(e, "internal_error");
  672. goto done;
  673. }
  674. } else if(enif_get_tuple(env, curr, &arity, &tuple)) {
  675. if(arity != 1) {
  676. ret = enc_obj_error(e, "invalid_ejson", curr);
  677. goto done;
  678. }
  679. if(!enif_is_list(env, tuple[0])) {
  680. ret = enc_obj_error(e, "invalid_object", curr);
  681. goto done;
  682. }
  683. if(!enc_start_object(e)) {
  684. ret = enc_error(e, "internal_error");
  685. goto done;
  686. }
  687. if(enif_is_empty_list(env, tuple[0])) {
  688. if(!enc_end_object(e)) {
  689. ret = enc_error(e, "internal_error");
  690. goto done;
  691. }
  692. continue;
  693. }
  694. if(!enif_get_list_cell(env, tuple[0], &item, &curr)) {
  695. ret = enc_error(e, "internal_error");
  696. goto done;
  697. }
  698. if(!enif_get_tuple(env, item, &arity, &tuple)) {
  699. ret = enc_obj_error(e, "invalid_object_member", item);
  700. goto done;
  701. }
  702. if(arity != 2) {
  703. ret = enc_obj_error(e, "invalid_object_member_arity", item);
  704. goto done;
  705. }
  706. if(!enc_string(e, tuple[0])) {
  707. ret = enc_obj_error(e, "invalid_object_member_key", tuple[0]);
  708. goto done;
  709. }
  710. if(!enc_colon(e)) {
  711. ret = enc_error(e, "internal_error");
  712. goto done;
  713. }
  714. stack = enif_make_list_cell(env, curr, stack);
  715. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  716. stack = enif_make_list_cell(env, tuple[1], stack);
  717. #if MAP_TYPE_PRESENT
  718. } else if(enif_is_map(env, curr)) {
  719. if(!enc_map_to_ejson(env, curr, &curr)) {
  720. ret = enc_error(e, "internal_error");
  721. goto done;
  722. }
  723. stack = enif_make_list_cell(env, curr, stack);
  724. #endif
  725. } else if(enif_is_list(env, curr)) {
  726. if(!enc_start_array(e)) {
  727. ret = enc_error(e, "internal_error");
  728. goto done;
  729. }
  730. if(enif_is_empty_list(env, curr)) {
  731. if(!enc_end_array(e)) {
  732. ret = enc_error(e, "internal_error");
  733. goto done;
  734. }
  735. continue;
  736. }
  737. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  738. ret = enc_error(e, "internal_error");
  739. goto done;
  740. }
  741. stack = enif_make_list_cell(env, curr, stack);
  742. stack = enif_make_list_cell(env, e->atoms->ref_array, stack);
  743. stack = enif_make_list_cell(env, item, stack);
  744. } else {
  745. if(!enc_unknown(e, curr)) {
  746. ret = enc_error(e, "internal_error");
  747. goto done;
  748. }
  749. }
  750. }
  751. if(!enc_done(e, &item)) {
  752. ret = enc_error(e, "internal_error");
  753. goto done;
  754. }
  755. if(e->iolen == 0) {
  756. ret = item;
  757. } else {
  758. ret = enif_make_tuple2(env, e->atoms->atom_partial, item);
  759. }
  760. done:
  761. return ret;
  762. }