PageRenderTime 50ms CodeModel.GetById 24ms RepoModel.GetById 0ms app.codeStats 0ms

/c_src/encoder.c

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