Du kan inte välja fler än 25 ämnen Ämnen måste starta med en bokstav eller siffra, kan innehålla bindestreck ('-') och vara max 35 tecken långa.

709 rader
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. #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. if(!enc_ensure(e, 32)) {
  334. return 0;
  335. }
  336. start = &(e->p[e->i]);
  337. if(!double_to_shortest(start, e->curr->size, &len, val)) {
  338. return 0;
  339. }
  340. e->i += len;
  341. e->count++;
  342. return 1;
  343. }
  344. static inline int
  345. enc_char(Encoder* e, char c)
  346. {
  347. if(!enc_ensure(e, 1)) {
  348. return 0;
  349. }
  350. e->p[e->i++] = c;
  351. return 1;
  352. }
  353. static int
  354. enc_shift(Encoder* e) {
  355. int i;
  356. char* shift;
  357. assert(e->shiftcnt >= 0 && "Invalid shift count.");
  358. shift = shifts[MIN(e->shiftcnt, NUM_SHIFTS-1)];
  359. if(!enc_literal(e, shift + 1, *shift))
  360. return 0;
  361. // Finish the rest of this shift it's it bigger than
  362. // our largest predefined constant.
  363. for(i = NUM_SHIFTS - 1; i < e->shiftcnt; i++) {
  364. if(!enc_literal(e, " ", 2))
  365. return 0;
  366. }
  367. return 1;
  368. }
  369. static inline int
  370. enc_start_object(Encoder* e)
  371. {
  372. e->count++;
  373. e->shiftcnt++;
  374. if(!enc_char(e, '{'))
  375. return 0;
  376. MAYBE_PRETTY(e);
  377. return 1;
  378. }
  379. static inline int
  380. enc_end_object(Encoder* e)
  381. {
  382. e->shiftcnt--;
  383. MAYBE_PRETTY(e);
  384. return enc_char(e, '}');
  385. }
  386. static inline int
  387. enc_start_array(Encoder* e)
  388. {
  389. e->count++;
  390. e->shiftcnt++;
  391. if(!enc_char(e, '['))
  392. return 0;
  393. MAYBE_PRETTY(e);
  394. return 1;
  395. }
  396. static inline int
  397. enc_end_array(Encoder* e)
  398. {
  399. e->shiftcnt--;
  400. MAYBE_PRETTY(e);
  401. return enc_char(e, ']');
  402. }
  403. static inline int
  404. enc_colon(Encoder* e)
  405. {
  406. if(e->pretty)
  407. return enc_literal(e, " : ", 3);
  408. return enc_char(e, ':');
  409. }
  410. static inline int
  411. enc_comma(Encoder* e)
  412. {
  413. if(!enc_char(e, ','))
  414. return 0;
  415. MAYBE_PRETTY(e);
  416. return 1;
  417. }
  418. ERL_NIF_TERM
  419. encode(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
  420. {
  421. Encoder enc;
  422. Encoder* e = &enc;
  423. ErlNifBinary bin;
  424. ERL_NIF_TERM ret;
  425. ERL_NIF_TERM stack;
  426. ERL_NIF_TERM curr;
  427. ERL_NIF_TERM item;
  428. const ERL_NIF_TERM* tuple;
  429. int arity;
  430. ErlNifSInt64 lval;
  431. double dval;
  432. if(argc != 2) {
  433. return enif_make_badarg(env);
  434. }
  435. if(!enc_init(e, env, argv[1], &bin)) {
  436. return enif_make_badarg(env);
  437. }
  438. stack = enif_make_list(env, 1, argv[0]);
  439. while(!enif_is_empty_list(env, stack)) {
  440. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  441. ret = enc_error(e, "internal_error");
  442. goto done;
  443. }
  444. if(enif_is_identical(curr, e->atoms->ref_object)) {
  445. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  446. ret = enc_error(e, "internal_error");
  447. goto done;
  448. }
  449. if(enif_is_empty_list(env, curr)) {
  450. if(!enc_end_object(e)) {
  451. ret = enc_error(e, "internal_error");
  452. goto done;
  453. }
  454. continue;
  455. }
  456. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  457. ret = enc_error(e, "internal_error");
  458. goto done;
  459. }
  460. if(!enif_get_tuple(env, item, &arity, &tuple)) {
  461. ret = enc_error(e, "invalid_object_pair");
  462. goto done;
  463. }
  464. if(arity != 2) {
  465. ret = enc_error(e, "invalid_object_pair");
  466. goto done;
  467. }
  468. if(!enc_comma(e)) {
  469. ret = enc_error(e, "internal_error");
  470. goto done;
  471. }
  472. if(!enc_string(e, tuple[0])) {
  473. ret = enc_error(e, "invalid_object_key");
  474. goto done;
  475. }
  476. if(!enc_colon(e)) {
  477. ret = enc_error(e, "internal_error");
  478. goto done;
  479. }
  480. stack = enif_make_list_cell(env, curr, stack);
  481. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  482. stack = enif_make_list_cell(env, tuple[1], stack);
  483. } else if(enif_is_identical(curr, e->atoms->ref_array)) {
  484. if(!enif_get_list_cell(env, stack, &curr, &stack)) {
  485. ret = enc_error(e, "internal_error");
  486. goto done;
  487. }
  488. if(enif_is_empty_list(env, curr)) {
  489. if(!enc_end_array(e)) {
  490. ret = enc_error(e, "internal_error");
  491. goto done;
  492. }
  493. continue;
  494. }
  495. if(!enc_comma(e)) {
  496. ret = enc_error(e, "internal_error");
  497. goto done;
  498. }
  499. if(!enif_get_list_cell(env, curr, &item, &curr)) {
  500. ret = enc_error(e, "internal_error");
  501. goto done;
  502. }
  503. stack = enif_make_list_cell(env, curr, stack);
  504. stack = enif_make_list_cell(env, e->atoms->ref_array, stack);
  505. stack = enif_make_list_cell(env, item, stack);
  506. } else if(enif_compare(curr, e->atoms->atom_null) == 0) {
  507. if(!enc_literal(e, "null", 4)) {
  508. ret = enc_error(e, "null");
  509. goto done;
  510. }
  511. } else if(enif_compare(curr, e->atoms->atom_true) == 0) {
  512. if(!enc_literal(e, "true", 4)) {
  513. ret = enc_error(e, "true");
  514. goto done;
  515. }
  516. } else if(enif_compare(curr, e->atoms->atom_false) == 0) {
  517. if(!enc_literal(e, "false", 5)) {
  518. ret = enc_error(e, "false");
  519. goto done;
  520. }
  521. } else if(enif_is_binary(env, curr)) {
  522. if(!enc_string(e, curr)) {
  523. ret = enc_error(e, "invalid_string");
  524. goto done;
  525. }
  526. } else if(enif_is_atom(env, curr)) {
  527. if(!enc_string(e, curr)) {
  528. ret = enc_error(e, "invalid_string");
  529. goto done;
  530. }
  531. } else if(enif_get_int64(env, curr, &lval)) {
  532. if(!enc_long(e, lval)) {
  533. ret = enc_error(e, "internal_error");
  534. goto done;
  535. }
  536. } else if(enif_get_double(env, curr, &dval)) {
  537. if(!enc_double(e, dval)) {
  538. ret = enc_error(e, "internal_error");
  539. goto done;
  540. }
  541. } else if(enif_get_tuple(env, curr, &arity, &tuple)) {
  542. if(arity != 1) {
  543. ret = enc_error(e, "invalid_ejson");
  544. goto done;
  545. }
  546. if(!enif_is_list(env, tuple[0])) {
  547. ret = enc_error(e, "invalid_object");
  548. goto done;
  549. }
  550. if(!enc_start_object(e)) {
  551. ret = enc_error(e, "internal_error");
  552. goto done;
  553. }
  554. if(enif_is_empty_list(env, tuple[0])) {
  555. if(!enc_end_object(e)) {
  556. ret = enc_error(e, "internal_error");
  557. goto done;
  558. }
  559. continue;
  560. }
  561. if(!enif_get_list_cell(env, tuple[0], &item, &curr)) {
  562. ret = enc_error(e, "internal_error");
  563. goto done;
  564. }
  565. if(!enif_get_tuple(env, item, &arity, &tuple)) {
  566. ret = enc_error(e, "invalid_object_member");
  567. goto done;
  568. }
  569. if(arity != 2) {
  570. ret = enc_error(e, "invalid_object_member_arity");
  571. goto done;
  572. }
  573. if(!enc_string(e, tuple[0])) {
  574. ret = enc_error(e, "invalid_object_member_key");
  575. goto done;
  576. }
  577. if(!enc_colon(e)) {
  578. ret = enc_error(e, "internal_error");
  579. goto done;
  580. }
  581. stack = enif_make_list_cell(env, curr, stack);
  582. stack = enif_make_list_cell(env, e->atoms->ref_object, stack);
  583. stack = enif_make_list_cell(env, tuple[1], stack);
  584. } else if(enif_is_list(env, curr)) {
  585. if(!enc_start_array(e)) {
  586. ret = enc_error(e, "internal_error");
  587. goto done;
  588. }
  589. if(enif_is_empty_list(env, curr)) {
  590. if(!enc_end_array(e)) {
  591. ret = enc_error(e, "internal_error");
  592. goto done;
  593. }
  594. continue;
  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 {
  604. if(!enc_unknown(e, curr)) {
  605. ret = enc_error(e, "internal_error");
  606. goto done;
  607. }
  608. }
  609. }
  610. if(!enc_done(e, &item)) {
  611. ret = enc_error(e, "internal_error");
  612. goto done;
  613. }
  614. if(e->iolen == 0) {
  615. ret = item;
  616. } else {
  617. ret = enif_make_tuple2(env, e->atoms->atom_partial, item);
  618. }
  619. done:
  620. enc_destroy(e);
  621. return ret;
  622. }