You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

721 lines
18 KiB

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