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.

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