Vous ne pouvez pas sélectionner plus de 25 sujets Les noms de sujets doivent commencer par une lettre ou un nombre, peuvent contenir des tirets ('-') et peuvent comporter jusqu'à 35 caractères.

699 lignes
17 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. typedef struct {
  18. ErlNifEnv* env;
  19. jiffy_st* atoms;
  20. int uescape;
  21. int pretty;
  22. int shiftcnt;
  23. int count;
  24. int iolen;
  25. ERL_NIF_TERM iolist;
  26. ErlNifBinary* curr;
  27. char* p;
  28. unsigned char* u;
  29. size_t i;
  30. } Encoder;
  31. // String constants for pretty printing.
  32. // Every string starts with its length.
  33. #define NUM_SHIFTS 8
  34. static char* shifts[NUM_SHIFTS] = {
  35. "\x01\n",
  36. "\x03\n ",
  37. "\x05\n ",
  38. "\x07\n ",
  39. "\x09\n ",
  40. "\x0b\n ",
  41. "\x0d\n ",
  42. "\x0f\n "
  43. };
  44. int
  45. enc_init(Encoder* e, ErlNifEnv* env, ERL_NIF_TERM opts, ErlNifBinary* bin)
  46. {
  47. ERL_NIF_TERM val;
  48. e->env = env;
  49. e->atoms = enif_priv_data(env);
  50. e->uescape = 0;
  51. e->pretty = 0;
  52. e->shiftcnt = 0;
  53. e->count = 0;
  54. if(!enif_is_list(env, opts)) {
  55. return 0;
  56. }
  57. while(enif_get_list_cell(env, opts, &val, &opts)) {
  58. if(enif_compare(val, e->atoms->atom_uescape) == 0) {
  59. e->uescape = 1;
  60. } else if(enif_compare(val, e->atoms->atom_pretty) == 0) {
  61. e->pretty = 1;
  62. } else {
  63. return 0;
  64. }
  65. }
  66. e->iolen = 0;
  67. e->iolist = enif_make_list(env, 0);
  68. e->curr = bin;
  69. if(!enif_alloc_binary(BIN_INC_SIZE, e->curr)) {
  70. return 0;
  71. }
  72. memset(e->curr->data, 0, e->curr->size);
  73. e->p = (char*) e->curr->data;
  74. e->u = (unsigned char*) e->curr->data;
  75. e->i = 0;
  76. return 1;
  77. }
  78. void
  79. enc_destroy(Encoder* e)
  80. {
  81. if(e->curr != NULL) {
  82. enif_release_binary(e->curr);
  83. }
  84. }
  85. ERL_NIF_TERM
  86. enc_error(Encoder* e, const char* msg)
  87. {
  88. //assert(0 && msg);
  89. return make_error(e->atoms, e->env, msg);
  90. }
  91. static inline int
  92. enc_ensure(Encoder* e, size_t req)
  93. {
  94. size_t need = e->curr->size;
  95. while(req >= (need - e->i)) need <<= 1;
  96. if(need != e->curr->size) {
  97. if(!enif_realloc_binary(e->curr, need)) {
  98. return 0;
  99. }
  100. e->p = (char*) e->curr->data;
  101. e->u = (unsigned char*) e->curr->data;
  102. }
  103. return 1;
  104. }
  105. int
  106. enc_result(Encoder* e, ERL_NIF_TERM* value)
  107. {
  108. if(e->i != e->curr->size) {
  109. if(!enif_realloc_binary(e->curr, e->i)) {
  110. return 0;
  111. }
  112. }
  113. *value = enif_make_binary(e->env, e->curr);
  114. e->curr = NULL;
  115. return 1;
  116. }
  117. int
  118. enc_done(Encoder* e, ERL_NIF_TERM* value)
  119. {
  120. ERL_NIF_TERM last;
  121. if(e->iolen == 0) {
  122. return enc_result(e, value);
  123. }
  124. if(e->i > 0 ) {
  125. if(!enc_result(e, &last)) {
  126. return 0;
  127. }
  128. e->iolist = enif_make_list_cell(e->env, last, e->iolist);
  129. e->iolen++;
  130. }
  131. *value = e->iolist;
  132. return 1;
  133. }
  134. static inline int
  135. enc_unknown(Encoder* e, ERL_NIF_TERM value)
  136. {
  137. ErlNifBinary* bin = e->curr;
  138. ERL_NIF_TERM curr;
  139. if(e->i > 0) {
  140. if(!enc_result(e, &curr)) {
  141. return 0;
  142. }
  143. e->iolist = enif_make_list_cell(e->env, curr, e->iolist);
  144. e->iolen++;
  145. }
  146. e->iolist = enif_make_list_cell(e->env, value, e->iolist);
  147. e->iolen++;
  148. // Reinitialize our binary for the next buffer.
  149. e->curr = bin;
  150. if(!enif_alloc_binary(BIN_INC_SIZE, e->curr)) {
  151. return 0;
  152. }
  153. memset(e->curr->data, 0, e->curr->size);
  154. e->p = (char*) e->curr->data;
  155. e->u = (unsigned char*) e->curr->data;
  156. e->i = 0;
  157. return 1;
  158. }
  159. static inline int
  160. enc_literal(Encoder* e, const char* literal, size_t len)
  161. {
  162. if(!enc_ensure(e, len)) {
  163. return 0;
  164. }
  165. memcpy(&(e->p[e->i]), literal, len);
  166. e->i += len;
  167. e->count++;
  168. return 1;
  169. }
  170. static inline int
  171. enc_string(Encoder* e, ERL_NIF_TERM val)
  172. {
  173. ErlNifBinary bin;
  174. char atom[512];
  175. unsigned char* data;
  176. size_t size;
  177. int esc_extra = 0;
  178. int ulen;
  179. int uval;
  180. int i;
  181. if(enif_is_binary(e->env, val)) {
  182. if(!enif_inspect_binary(e->env, val, &bin)) {
  183. return 0;
  184. }
  185. data = bin.data;
  186. size = bin.size;
  187. } else if(enif_is_atom(e->env, val)) {
  188. if(!enif_get_atom(e->env, val, atom, 512, ERL_NIF_LATIN1)) {
  189. return 0;
  190. }
  191. data = (unsigned char*) atom;
  192. size = strlen(atom);
  193. } else {
  194. return 0;
  195. }
  196. i = 0;
  197. while(i < size) {
  198. switch((char) data[i]) {
  199. case '\"':
  200. case '\\':
  201. case '/':
  202. case '\b':
  203. case '\f':
  204. case '\n':
  205. case '\r':
  206. case '\t':
  207. esc_extra += 1;
  208. i++;
  209. continue;
  210. default:
  211. if(data[i] < 0x20) {
  212. esc_extra += 5;
  213. i++;
  214. continue;
  215. } else if(data[i] < 0x80) {
  216. i++;
  217. continue;
  218. }
  219. ulen = utf8_validate(&(data[i]), size - i);
  220. if(ulen < 0) {
  221. return 0;
  222. }
  223. if(e->uescape) {
  224. uval = utf8_to_unicode(&(data[i]), ulen);
  225. if(uval < 0) {
  226. return 0;
  227. }
  228. esc_extra = utf8_esc_len(uval);
  229. if(ulen < 0) {
  230. return 0;
  231. }
  232. }
  233. i += ulen;
  234. }
  235. }
  236. if(!enc_ensure(e, size + esc_extra + 2)) {
  237. return 0;
  238. }
  239. e->p[e->i++] = '\"';
  240. i = 0;
  241. while(i < size) {
  242. switch((char) data[i]) {
  243. case '\"':
  244. case '\\':
  245. case '/':
  246. e->p[e->i++] = '\\';
  247. e->u[e->i++] = data[i];
  248. i++;
  249. continue;
  250. case '\b':
  251. e->p[e->i++] = '\\';
  252. e->p[e->i++] = 'b';
  253. i++;
  254. continue;
  255. case '\f':
  256. e->p[e->i++] = '\\';
  257. e->p[e->i++] = 'f';
  258. i++;
  259. continue;
  260. case '\n':
  261. e->p[e->i++] = '\\';
  262. e->p[e->i++] = 'n';
  263. i++;
  264. continue;
  265. case '\r':
  266. e->p[e->i++] = '\\';
  267. e->p[e->i++] = 'r';
  268. i++;
  269. continue;
  270. case '\t':
  271. e->p[e->i++] = '\\';
  272. e->p[e->i++] = 't';
  273. i++;
  274. continue;
  275. default:
  276. if(data[i] < 0x20) {
  277. ulen = unicode_uescape(data[i], &(e->p[e->i]));
  278. if(ulen < 0) {
  279. return 0;
  280. }
  281. e->i += ulen;
  282. i++;
  283. } else if((data[i] & 0x80) && e->uescape) {
  284. uval = utf8_to_unicode(&(data[i]), size-i);
  285. if(uval < 0) {
  286. return 0;
  287. }
  288. ulen = unicode_uescape(uval, &(e->p[e->i]));
  289. if(ulen < 0) {
  290. return 0;
  291. }
  292. e->i += ulen;
  293. ulen = utf8_len(uval);
  294. if(ulen < 0) {
  295. return 0;
  296. }
  297. i += ulen;
  298. } else {
  299. e->u[e->i++] = data[i++];
  300. }
  301. }
  302. }
  303. e->p[e->i++] = '\"';
  304. e->count++;
  305. return 1;
  306. }
  307. static inline int
  308. enc_long(Encoder* e, ErlNifSInt64 val)
  309. {
  310. if(!enc_ensure(e, 32)) {
  311. return 0;
  312. }
  313. #if (defined(__WIN32__) || defined(_WIN32) || defined(_WIN32_))
  314. snprintf(&(e->p[e->i]), 32, "%ld", val);
  315. #elif SIZEOF_LONG == 8
  316. snprintf(&(e->p[e->i]), 32, "%ld", val);
  317. #else
  318. snprintf(&(e->p[e->i]), 32, "%lld", val);
  319. #endif
  320. e->i += strlen(&(e->p[e->i]));
  321. e->count++;
  322. return 1;
  323. }
  324. static inline int
  325. enc_double(Encoder* e, double val)
  326. {
  327. if(!enc_ensure(e, 32)) {
  328. return 0;
  329. }
  330. //snprintf(&(e->p[e->i]), 31, "%0.20g", val);
  331. sprintf(&(e->p[e->i]), "%.20g", val);
  332. e->i += strlen(&(e->p[e->i]));
  333. e->count++;
  334. return 1;
  335. }
  336. static inline int
  337. enc_char(Encoder* e, char c)
  338. {
  339. if(!enc_ensure(e, 1)) {
  340. return 0;
  341. }
  342. e->p[e->i++] = c;
  343. return 1;
  344. }
  345. static int
  346. enc_shift(Encoder* e) {
  347. int i;
  348. char* shift;
  349. assert(e->shiftcnt >= 0 && "Invalid shift count.");
  350. shift = shifts[MIN(e->shiftcnt, NUM_SHIFTS-1)];
  351. if(!enc_literal(e, shift + 1, *shift))
  352. return 0;
  353. // Finish the rest of this shift it's it bigger than
  354. // our largest predefined constant.
  355. for(i = NUM_SHIFTS - 1; i < e->shiftcnt; i++) {
  356. if(!enc_literal(e, " ", 2))
  357. return 0;
  358. }
  359. return 1;
  360. }
  361. static inline int
  362. enc_start_object(Encoder* e)
  363. {
  364. e->count++;
  365. e->shiftcnt++;
  366. if(!enc_char(e, '{'))
  367. return 0;
  368. MAYBE_PRETTY(e);
  369. return 1;
  370. }
  371. static inline int
  372. enc_end_object(Encoder* e)
  373. {
  374. e->shiftcnt--;
  375. MAYBE_PRETTY(e);
  376. return enc_char(e, '}');
  377. }
  378. static inline int
  379. enc_start_array(Encoder* e)
  380. {
  381. e->count++;
  382. e->shiftcnt++;
  383. if(!enc_char(e, '['))
  384. return 0;
  385. MAYBE_PRETTY(e);
  386. return 1;
  387. }
  388. static inline int
  389. enc_end_array(Encoder* e)
  390. {
  391. e->shiftcnt--;
  392. MAYBE_PRETTY(e);
  393. return enc_char(e, ']');
  394. }
  395. static inline int
  396. enc_colon(Encoder* e)
  397. {
  398. if(e->pretty)
  399. return enc_literal(e, " : ", 3);
  400. return enc_char(e, ':');
  401. }
  402. static inline int
  403. enc_comma(Encoder* e)
  404. {
  405. if(!enc_char(e, ','))
  406. return 0;
  407. MAYBE_PRETTY(e);
  408. return 1;
  409. }
  410. ERL_NIF_TERM
  411. encode(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
  412. {
  413. Encoder enc;
  414. Encoder* e = &enc;
  415. ErlNifBinary bin;
  416. ERL_NIF_TERM ret;
  417. ERL_NIF_TERM stack;
  418. ERL_NIF_TERM curr;
  419. ERL_NIF_TERM item;
  420. const ERL_NIF_TERM* tuple;
  421. int arity;
  422. ErlNifSInt64 lval;
  423. double dval;
  424. if(argc != 2) {
  425. return enif_make_badarg(env);
  426. }
  427. if(!enc_init(e, env, argv[1], &bin)) {
  428. return enif_make_badarg(env);
  429. }
  430. stack = enif_make_list(env, 1, argv[0]);
  431. while(!enif_is_empty_list(env, stack)) {
  432. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  433. ret = enc_error(e, "internal_error");
  434. goto done;
  435. }
  436. if(enif_is_identical(curr, e->atoms->ref_object)) {
  437. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  438. ret = enc_error(e, "internal_error");
  439. goto done;
  440. }
  441. if(enif_is_empty_list(env, curr)) {
  442. if(!enc_end_object(e)) {
  443. ret = enc_error(e, "internal_error");
  444. goto done;
  445. }
  446. continue;
  447. }
  448. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  449. ret = enc_error(e, "internal_error");
  450. goto done;
  451. }
  452. if(!enif_get_tuple(env, item, &arity, &tuple)) {
  453. ret = enc_error(e, "invalid_object_pair");
  454. goto done;
  455. }
  456. if(arity != 2) {
  457. ret = enc_error(e, "invalid_object_pair");
  458. goto done;
  459. }
  460. if(!enc_comma(e)) {
  461. ret = enc_error(e, "internal_error");
  462. goto done;
  463. }
  464. if(!enc_string(e, tuple[0])) {
  465. ret = enc_error(e, "invalid_object_key");
  466. goto done;
  467. }
  468. if(!enc_colon(e)) {
  469. ret = enc_error(e, "internal_error");
  470. goto done;
  471. }
  472. stack = enif_make_list_cell(env, curr, stack);
  473. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  474. stack = enif_make_list_cell(env, tuple[1], stack);
  475. } else if(enif_is_identical(curr, e->atoms->ref_array)) {
  476. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  477. ret = enc_error(e, "internal_error");
  478. goto done;
  479. }
  480. if(enif_is_empty_list(env, curr)) {
  481. if(!enc_end_array(e)) {
  482. ret = enc_error(e, "internal_error");
  483. goto done;
  484. }
  485. continue;
  486. }
  487. if(!enc_comma(e)) {
  488. ret = enc_error(e, "internal_error");
  489. goto done;
  490. }
  491. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  492. ret = enc_error(e, "internal_error");
  493. goto done;
  494. }
  495. stack = enif_make_list_cell(env, curr, stack);
  496. stack = enif_make_list_cell(env, e->atoms->ref_array, stack);
  497. stack = enif_make_list_cell(env, item, stack);
  498. } else if(enif_compare(curr, e->atoms->atom_null) == 0) {
  499. if(!enc_literal(e, "null", 4)) {
  500. ret = enc_error(e, "null");
  501. goto done;
  502. }
  503. } else if(enif_compare(curr, e->atoms->atom_true) == 0) {
  504. if(!enc_literal(e, "true", 4)) {
  505. ret = enc_error(e, "true");
  506. goto done;
  507. }
  508. } else if(enif_compare(curr, e->atoms->atom_false) == 0) {
  509. if(!enc_literal(e, "false", 5)) {
  510. ret = enc_error(e, "false");
  511. goto done;
  512. }
  513. } else if(enif_is_binary(env, curr)) {
  514. if(!enc_string(e, curr)) {
  515. ret = enc_error(e, "invalid_string");
  516. goto done;
  517. }
  518. } else if(enif_is_atom(env, curr)) {
  519. if(!enc_string(e, curr)) {
  520. ret = enc_error(e, "invalid_string");
  521. goto done;
  522. }
  523. } else if(enif_get_int64(env, curr, &lval)) {
  524. if(!enc_long(e, lval)) {
  525. ret = enc_error(e, "internal_error");
  526. goto done;
  527. }
  528. } else if(enif_get_double(env, curr, &dval)) {
  529. if(!enc_double(e, dval)) {
  530. ret = enc_error(e, "internal_error");
  531. goto done;
  532. }
  533. } else if(enif_get_tuple(env, curr, &arity, &tuple)) {
  534. if(arity != 1) {
  535. ret = enc_error(e, "invalid_ejson");
  536. goto done;
  537. }
  538. if(!enif_is_list(env, tuple[0])) {
  539. ret = enc_error(e, "invalid_object");
  540. goto done;
  541. }
  542. if(!enc_start_object(e)) {
  543. ret = enc_error(e, "internal_error");
  544. goto done;
  545. }
  546. if(enif_is_empty_list(env, tuple[0])) {
  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, tuple[0], &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_member");
  559. goto done;
  560. }
  561. if(arity != 2) {
  562. ret = enc_error(e, "invalid_object_member_arity");
  563. goto done;
  564. }
  565. if(!enc_string(e, tuple[0])) {
  566. ret = enc_error(e, "invalid_object_member_key");
  567. goto done;
  568. }
  569. if(!enc_colon(e)) {
  570. ret = enc_error(e, "internal_error");
  571. goto done;
  572. }
  573. stack = enif_make_list_cell(env, curr, stack);
  574. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  575. stack = enif_make_list_cell(env, tuple[1], stack);
  576. } else if(enif_is_list(env, curr)) {
  577. if(!enc_start_array(e)) {
  578. ret = enc_error(e, "internal_error");
  579. goto done;
  580. }
  581. if(enif_is_empty_list(env, curr)) {
  582. if(!enc_end_array(e)) {
  583. ret = enc_error(e, "internal_error");
  584. goto done;
  585. }
  586. continue;
  587. }
  588. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  589. ret = enc_error(e, "internal_error");
  590. goto done;
  591. }
  592. stack = enif_make_list_cell(env, curr, stack);
  593. stack = enif_make_list_cell(env, e->atoms->ref_array, stack);
  594. stack = enif_make_list_cell(env, item, stack);
  595. } else {
  596. if(!enc_unknown(e, curr)) {
  597. ret = enc_error(e, "internal_error");
  598. goto done;
  599. }
  600. }
  601. } while(!enif_is_empty_list(env, stack));
  602. if(!enc_done(e, &item)) {
  603. ret = enc_error(e, "internal_error");
  604. goto done;
  605. }
  606. if(e->iolen == 0) {
  607. ret = item;
  608. } else {
  609. ret = enif_make_tuple2(env, e->atoms->atom_partial, item);
  610. }
  611. done:
  612. enc_destroy(e);
  613. return ret;
  614. }