encoder.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155
  1. #pragma once
  2. #include <nan.h>
  3. #include <cmath>
  4. #include <limits>
  5. #include "../cpp/encoder.h"
  6. using namespace v8;
  7. class Encoder {
  8. static const size_t DEFAULT_RECURSE_LIMIT = 256;
  9. static const size_t INITIAL_BUFFER_SIZE = 1024 * 1024;
  10. public:
  11. Encoder() {
  12. ret = 0;
  13. pk.buf = (char*)malloc(INITIAL_BUFFER_SIZE);
  14. pk.length = 0;
  15. pk.allocated_size = INITIAL_BUFFER_SIZE;
  16. ret = erlpack_append_version(&pk);
  17. if (ret == -1) {
  18. Nan::ThrowError("Unable to allocate large buffer for encoding.");
  19. }
  20. }
  21. Nan::MaybeLocal<Object> releaseAsBuffer() {
  22. if (pk.buf == NULL) {
  23. return Nan::MaybeLocal<Object>();
  24. }
  25. auto buffer = Nan::NewBuffer(pk.length);
  26. memcpy(node::Buffer::Data(buffer.ToLocalChecked()), pk.buf, pk.length);
  27. pk.length = 0;
  28. erlpack_append_version(&pk);
  29. return buffer;
  30. }
  31. ~Encoder() {
  32. if (pk.buf) {
  33. free(pk.buf);
  34. }
  35. pk.buf = NULL;
  36. pk.length = 0;
  37. pk.allocated_size = 0;
  38. }
  39. int pack(Local<Value> value, const int nestLimit = DEFAULT_RECURSE_LIMIT) {
  40. ret = 0;
  41. if (nestLimit < 0) {
  42. Nan::ThrowError("Reached recursion limit");
  43. return -1;
  44. }
  45. if (value->IsInt32() || value->IsUint32()) {
  46. int number = value->Int32Value();
  47. if (number >= 0 && number <= 255) {
  48. unsigned char num = (unsigned char)number;
  49. ret = erlpack_append_small_integer(&pk, num);
  50. }
  51. else if (value->IsInt32()) {
  52. ret = erlpack_append_integer(&pk, number);
  53. }
  54. else if (value->IsUint32()) {
  55. auto uNum = (unsigned long long)value->Uint32Value();
  56. ret = erlpack_append_unsigned_long_long(&pk, uNum);
  57. }
  58. }
  59. else if(value->IsNumber()) {
  60. double decimal = value->NumberValue();
  61. ret = erlpack_append_double(&pk, decimal);
  62. }
  63. else if (value->IsNull() || value->IsUndefined()) {
  64. ret = erlpack_append_nil(&pk);
  65. }
  66. else if (value->IsTrue()) {
  67. ret = erlpack_append_true(&pk);
  68. }
  69. else if(value->IsFalse()) {
  70. ret = erlpack_append_false(&pk);
  71. }
  72. else if(value->IsString()) {
  73. Nan::Utf8String string(value);
  74. ret = erlpack_append_binary(&pk, *string, string.length());
  75. }
  76. else if (value->IsArray()) {
  77. auto array = Nan::To<Object>(value).ToLocalChecked();
  78. const auto properties = Nan::GetOwnPropertyNames(array).ToLocalChecked();
  79. const uint32_t length = properties->Length();
  80. if (length == 0) {
  81. ret = erlpack_append_nil_ext(&pk);
  82. }
  83. else {
  84. if (length > std::numeric_limits<uint32_t>::max() - 1) {
  85. Nan::ThrowError("List is too large");
  86. return -1;
  87. }
  88. ret = erlpack_append_list_header(&pk, length);
  89. if (ret != 0) {
  90. return ret;
  91. }
  92. for(uint32_t i = 0; i < length; ++i) {
  93. const auto k = properties->Get(i);
  94. const auto v = Nan::Get(array, k).ToLocalChecked();
  95. ret = pack(v, nestLimit - 1);
  96. if (ret != 0) {
  97. return ret;
  98. }
  99. }
  100. ret = erlpack_append_nil_ext(&pk);
  101. }
  102. }
  103. else if (value->IsObject()) {
  104. auto object = Nan::To<Object>(value).ToLocalChecked();
  105. const auto properties = Nan::GetOwnPropertyNames(object).ToLocalChecked();
  106. const uint32_t len = properties->Length();
  107. if (len > std::numeric_limits<uint32_t>::max() - 1) {
  108. Nan::ThrowError("Dictionary has too many properties");
  109. return -1;
  110. }
  111. ret = erlpack_append_map_header(&pk, len);
  112. if (ret != 0) {
  113. return ret;
  114. }
  115. for(uint32_t i = 0; i < len; ++i) {
  116. const auto k = properties->Get(i);
  117. const auto v = Nan::Get(object, k).ToLocalChecked();
  118. ret = pack(k, nestLimit - 1);
  119. if (ret != 0) {
  120. return ret;
  121. }
  122. ret = pack(v, nestLimit - 1);
  123. if (ret != 0) {
  124. return ret;
  125. }
  126. }
  127. }
  128. return ret;
  129. }
  130. private:
  131. int ret;
  132. erlpack_buffer pk;
  133. };